1
0
mirror of https://github.com/janet-lang/janet synced 2024-11-29 11:29:54 +00:00
janet/src/core/symcache.c

245 lines
8.4 KiB
C
Raw Normal View History

/*
* Copyright (c) 2019 Calvin Rose
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
/* The symbol cache is an open hashtable with all active symbols in the program
* stored in it. As the primary use of symbols is table lookups and equality
* checks, all symbols are interned so that there is a single copy of it in the
* whole program. Equality is then just a pointer check. */
#include <string.h>
#ifndef JANET_AMALG
#include <janet.h>
#include "state.h"
#include "gc.h"
#include "util.h"
#include "symcache.h"
#endif
/* Cache state */
2018-09-06 02:18:42 +00:00
JANET_THREAD_LOCAL const uint8_t **janet_vm_cache = NULL;
JANET_THREAD_LOCAL uint32_t janet_vm_cache_capacity = 0;
JANET_THREAD_LOCAL uint32_t janet_vm_cache_count = 0;
JANET_THREAD_LOCAL uint32_t janet_vm_cache_deleted = 0;
/* Initialize the cache (allocate cache memory) */
2018-09-06 02:18:42 +00:00
void janet_symcache_init() {
janet_vm_cache_capacity = 1024;
janet_vm_cache = calloc(1, janet_vm_cache_capacity * sizeof(const uint8_t *));
2018-09-06 02:18:42 +00:00
if (NULL == janet_vm_cache) {
JANET_OUT_OF_MEMORY;
}
2018-09-06 02:18:42 +00:00
janet_vm_cache_count = 0;
janet_vm_cache_deleted = 0;
}
/* Deinitialize the cache (free the cache memory) */
2018-09-06 02:18:42 +00:00
void janet_symcache_deinit() {
free((void *)janet_vm_cache);
janet_vm_cache = NULL;
janet_vm_cache_capacity = 0;
janet_vm_cache_count = 0;
janet_vm_cache_deleted = 0;
}
/* Mark an entry in the table as deleted. */
2018-10-17 03:08:26 +00:00
static const uint8_t JANET_SYMCACHE_DELETED[1] = {0};
/* Find an item in the cache and return its location.
* If the item is not found, return the location
* where one would put it. */
2018-09-06 02:18:42 +00:00
static const uint8_t **janet_symcache_findmem(
const uint8_t *str,
int32_t len,
int32_t hash,
int *success) {
2017-11-29 20:17:56 +00:00
uint32_t bounds[4];
uint32_t i, j, index;
const uint8_t **firstEmpty = NULL;
/* We will search two ranges - index to the end,
* and 0 to the index. */
2018-09-06 02:18:42 +00:00
index = (uint32_t)hash & (janet_vm_cache_capacity - 1);
bounds[0] = index;
2018-09-06 02:18:42 +00:00
bounds[1] = janet_vm_cache_capacity;
bounds[2] = 0;
bounds[3] = index;
for (j = 0; j < 4; j += 2)
for (i = bounds[j]; i < bounds[j + 1]; ++i) {
2018-09-06 02:18:42 +00:00
const uint8_t *test = janet_vm_cache[i];
/* Check empty spots */
if (NULL == test) {
if (NULL == firstEmpty)
2018-09-06 02:18:42 +00:00
firstEmpty = janet_vm_cache + i;
goto notfound;
}
/* Check for marked deleted */
2018-09-06 02:18:42 +00:00
if (JANET_SYMCACHE_DELETED == test) {
if (firstEmpty == NULL)
2018-09-06 02:18:42 +00:00
firstEmpty = janet_vm_cache + i;
continue;
}
2018-09-06 02:18:42 +00:00
if (janet_string_equalconst(test, str, len, hash)) {
/* Replace first deleted */
*success = 1;
if (firstEmpty != NULL) {
*firstEmpty = test;
2018-09-06 02:18:42 +00:00
janet_vm_cache[i] = JANET_SYMCACHE_DELETED;
return firstEmpty;
}
2018-09-06 02:18:42 +00:00
return janet_vm_cache + i;
}
}
notfound:
*success = 0;
return firstEmpty;
}
2018-09-06 02:18:42 +00:00
#define janet_symcache_find(str, success) \
janet_symcache_findmem((str), janet_string_length(str), janet_string_hash(str), (success))
/* Resize the cache. */
2018-09-06 02:18:42 +00:00
static void janet_cache_resize(uint32_t newCapacity) {
2017-11-29 20:17:56 +00:00
uint32_t i, oldCapacity;
2018-09-06 02:18:42 +00:00
const uint8_t **oldCache = janet_vm_cache;
const uint8_t **newCache = calloc(1, newCapacity * sizeof(const uint8_t *));
if (newCache == NULL) {
2018-09-06 02:18:42 +00:00
JANET_OUT_OF_MEMORY;
}
2018-09-06 02:18:42 +00:00
oldCapacity = janet_vm_cache_capacity;
janet_vm_cache = newCache;
janet_vm_cache_capacity = newCapacity;
janet_vm_cache_deleted = 0;
/* Add all of the old cache entries back */
for (i = 0; i < oldCapacity; ++i) {
int status;
const uint8_t **bucket;
const uint8_t *x = oldCache[i];
2018-09-06 02:18:42 +00:00
if (x != NULL && x != JANET_SYMCACHE_DELETED) {
bucket = janet_symcache_find(x, &status);
if (status || bucket == NULL) {
/* there was a problem with the algorithm. */
break;
}
*bucket = x;
}
}
/* Free the old cache */
2018-08-06 01:13:14 +00:00
free((void *)oldCache);
}
/* Add an item to the cache */
2018-09-06 02:18:42 +00:00
static void janet_symcache_put(const uint8_t *x, const uint8_t **bucket) {
if ((janet_vm_cache_count + janet_vm_cache_deleted) * 2 > janet_vm_cache_capacity) {
int status;
2018-09-06 02:18:42 +00:00
janet_cache_resize(janet_tablen((2 * janet_vm_cache_count + 1)));
bucket = janet_symcache_find(x, &status);
}
/* Add x to the cache */
2018-09-06 02:18:42 +00:00
janet_vm_cache_count++;
*bucket = x;
}
/* Remove a symbol from the symcache */
2018-09-06 02:18:42 +00:00
void janet_symbol_deinit(const uint8_t *sym) {
int status = 0;
2018-09-06 02:18:42 +00:00
const uint8_t **bucket = janet_symcache_find(sym, &status);
if (status) {
2018-09-06 02:18:42 +00:00
janet_vm_cache_count--;
janet_vm_cache_deleted++;
*bucket = JANET_SYMCACHE_DELETED;
}
}
/* Create a symbol from a byte string */
2018-09-06 02:18:42 +00:00
const uint8_t *janet_symbol(const uint8_t *str, int32_t len) {
int32_t hash = janet_string_calchash(str, len);
uint8_t *newstr;
int success = 0;
2018-09-06 02:18:42 +00:00
const uint8_t **bucket = janet_symcache_findmem(str, len, hash, &success);
if (success)
return *bucket;
JanetStringHead *head = janet_gcalloc(JANET_MEMORY_SYMBOL, sizeof(JanetStringHead) + len + 1);
head->hash = hash;
head->length = len;
newstr = (uint8_t *)(head->data);
memcpy(newstr, str, len);
newstr[len] = 0;
2018-09-06 02:18:42 +00:00
janet_symcache_put((const uint8_t *)newstr, bucket);
return newstr;
}
/* Get a symbol from a cstring */
2018-09-06 02:18:42 +00:00
const uint8_t *janet_csymbol(const char *cstr) {
2019-02-21 16:34:04 +00:00
return janet_symbol((const uint8_t *)cstr, (int32_t) strlen(cstr));
}
2018-07-01 19:49:33 +00:00
/* Store counter for genysm to avoid quadratic behavior */
2018-09-06 02:18:42 +00:00
JANET_THREAD_LOCAL uint8_t gensym_counter[8] = {'_', '0', '0', '0', '0', '0', '0', 0};
2018-07-01 19:49:33 +00:00
/* Increment the gensym buffer */
static void inc_gensym(void) {
for (int i = sizeof(gensym_counter) - 2; i; i--) {
if (gensym_counter[i] == '9') {
gensym_counter[i] = 'a';
2018-07-09 00:54:41 +00:00
break;
2018-07-01 19:49:33 +00:00
} else if (gensym_counter[i] == 'z') {
gensym_counter[i] = 'A';
2018-07-09 00:54:41 +00:00
break;
2018-07-01 19:49:33 +00:00
} else if (gensym_counter[i] == 'Z') {
gensym_counter[i] = '0';
} else {
gensym_counter[i]++;
break;
}
}
}
/* Generate a unique symbol. This is used in the library function gensym. The
2018-07-01 19:49:33 +00:00
* symbol will be of the format _XXXXXX, where X is a base64 digit, and
* prefix is the argument passed. No prefix for speed. */
2018-09-06 02:18:42 +00:00
const uint8_t *janet_symbol_gen(void) {
2018-03-18 13:13:21 +00:00
const uint8_t **bucket = NULL;
2018-07-01 19:49:33 +00:00
uint8_t *sym;
2018-03-18 13:13:21 +00:00
int32_t hash = 0;
2018-07-01 19:49:33 +00:00
int status;
/* Leave spaces for 6 base 64 digits and two dashes. That means 64^6 possible suffixes, which
* is enough for resolving collisions. */
2018-07-01 19:49:33 +00:00
do {
2018-09-06 02:18:42 +00:00
hash = janet_string_calchash(
gensym_counter,
sizeof(gensym_counter) - 1);
2018-09-06 02:18:42 +00:00
bucket = janet_symcache_findmem(
gensym_counter,
sizeof(gensym_counter) - 1,
hash,
&status);
2018-07-01 19:49:33 +00:00
} while (status && (inc_gensym(), 1));
JanetStringHead *head = janet_gcalloc(JANET_MEMORY_SYMBOL, sizeof(JanetStringHead) + sizeof(gensym_counter));
head->length = sizeof(gensym_counter) - 1;
head->hash = hash;
sym = (uint8_t *)(head->data);
2018-07-01 19:49:33 +00:00
memcpy(sym, gensym_counter, sizeof(gensym_counter));
2018-09-06 02:18:42 +00:00
janet_symcache_put((const uint8_t *)sym, bucket);
2018-07-01 19:49:33 +00:00
return (const uint8_t *)sym;
}