diff options
author | ubq323 <ubq323@ubq323.website> | 2023-08-05 04:15:17 +0100 |
---|---|---|
committer | ubq323 <ubq323@ubq323.website> | 2023-08-05 04:15:20 +0100 |
commit | 9ee73a8459eb2bb58adc29da02de312b7e4e7dca (patch) | |
tree | f41bddde050c61e254af8ba4c53a3bc11ca7b804 | |
parent | 93fe66fb8ef5c731b46a30a804f74b4bf3b133d7 (diff) |
refactor hashtables, and use objstrings for keys
doesn't yet work without string interning, which will require
further refactoring
-rw-r--r-- | Makefile | 4 | ||||
-rw-r--r-- | com.c | 2 | ||||
-rw-r--r-- | ht.c | 103 | ||||
-rw-r--r-- | ht.h | 17 | ||||
-rw-r--r-- | mem.h | 1 | ||||
-rw-r--r-- | val.c | 14 | ||||
-rw-r--r-- | val.h | 9 | ||||
-rw-r--r-- | vm.c | 11 |
8 files changed, 90 insertions, 71 deletions
@@ -1,5 +1,5 @@ -CS=ast.c com.c dis.c mem.c prs.c read.c val.c vm.c -HS=ast.h dis.h mem.h prs.h read.h val.h vm.h +CS=ast.c com.c dis.c ht.c mem.c prs.c read.c val.c vm.c +HS=ast.h dis.h ht.h mem.h prs.h read.h val.h vm.h CFLAGS=-O3 -Wall -Wpedantic -Werror=implicit-function-declaration bþ: $(CS) $(HS) @@ -18,7 +18,7 @@ static void compile_node(Chunk *ch, AstNode a) { break; case AST_STRING: { size_t len = strlen(a.as.str); - ObjString *o = objstring_new(a.as.str, len); + ObjString *o = objstring_copy(a.as.str, len); chunk_wbc(ch, OP_LOADK); chunk_wbc(ch, chunk_wconst(ch, VAL_OBJ(o))); break; @@ -4,73 +4,84 @@ #include <stdio.h> #include <string.h> +#include "mem.h" + #define FNV_BASIS 0x811c9dc5 #define FNV_PRIME 0x01000193 // fnv-1a -static uint32_t hash(char *s) { +uint32_t hash(char *s, size_t len) { uint32_t h = FNV_BASIS; - for(;;) { - h ^= *s; + for(int i = 0; i < len; i++) { + h ^= s[i]; h *= FNV_PRIME; - if (*s == '\0') break; - s++; } return h; } Ht ht_new() { - Ht h; - h.len = 0; - for (int i = 0; i < HT_SIZE; i++) { - h.b[i] = (HtEntry){ .k = NULL, .v=0 }; - } - return h; + return (Ht){ + .len = 0, + .cap = 0, + .b = NULL + }; } -void ht_put(Ht *h, char *k, int v) { - uint32_t hv = hash(k); - int start = hv%HT_SIZE; - for (int cur = start; cur != start - 1; cur = (cur+1)%HT_SIZE) { - HtEntry *ent = &h->b[cur]; - if (ent->k == NULL) { - printf(" p %d\n",cur); - ent->k = strdup(k); - ent->v = v; - h->len++; - break; - } else if (0 == strcmp(k, ent->k)) { - printf(" r %d\n",cur); - ent->v = v; - break; - } else { - printf(" n %d\n",cur); +static HtEntry *find(HtEntry *b, size_t cap, ObjString *k) { + size_t ix = k->hash % cap; + for (;;) { + HtEntry *ent = &b[ix]; + if (ent->k == k || ent->k == NULL) { + return ent; } + ix = (ix+1)%cap; } } -int ht_get(Ht *h, char *k, int *v) { - uint32_t hv = hash(k); - int start = hv%HT_SIZE; - for (int cur = start; cur != start - 1; cur = (cur+1)%HT_SIZE) { - HtEntry *ent = &h->b[cur]; - if (ent->k == NULL) { - return 0; // not found - } else if (0 == strncmp(ent->k, k, 80)) { - *v = ent->v; - return 1; +static void grow(Ht *h) { + HtEntry *old = h->b; + size_t newsz = h->cap == 0 ? 8 : h->cap * 2; + HtEntry *new = NEW_ARR(HtEntry, newsz); + for (int i = 0; i<newsz; i++) { + new[i].k = NULL; + new[i].v = VAL_NIL; + } + + if (old != NULL) { + for (int i = 0; i < h->cap; i++) { + HtEntry *oldent = &old[i]; + if (oldent->k == NULL) continue; + + HtEntry *newent = find(new, newsz, oldent->k); + newent->k = oldent->k; + newent->v = oldent->v; } } - return 0; // exhausted + + h->b = new; + FREE_ARR(old, HtEntry, h->cap); + h->cap = newsz; } -void ht_dump(Ht *h) { - printf("#%d:\n",h->len); - for (int i = 0; i < HT_SIZE; i++) { - HtEntry ent = h->b[i]; - if (ent.k != NULL) { - printf(" %s:%d\n",ent.k,ent.v); - } + +void ht_put(Ht *h, ObjString *k, Val v) { + if (h->cap == 0 || h->len >= (h->cap/2)) { + grow(h); + } + HtEntry *ent = find(h->b, h->cap, k); + if (ent->k == NULL) { + ent->k = k; + h->len++; + } + ent->v = v; +} + +Val ht_get(Ht *h, ObjString *k) { + HtEntry *ent = find(h->b, h->cap, k); + if (ent->k == NULL) { + return VAL_NIL; + } else { + return ent->v; } } @@ -1,22 +1,23 @@ #ifndef _ht_h #define _ht_h -#define HT_SIZE 128 +#include "val.h" typedef struct { - char *k; - int v; + ObjString *k; + Val v; } HtEntry; typedef struct { - int len; - HtEntry b[HT_SIZE]; + size_t len; + size_t cap; + HtEntry *b; } Ht; -typedef Ht Env; +uint32_t hash(char *s, size_t len); Ht ht_new(); -void ht_put(Ht *h, char *k, int v); -int ht_get(Ht *h, char *k, int *v); +void ht_put(Ht *h, ObjString *k, Val v); +Val ht_get(Ht *h, ObjString *k); #endif @@ -12,6 +12,7 @@ void *M(void *p, size_t old, size_t new); #define NEW_OBJ(t, oty) (t*)alloc_obj(sizeof(t), oty) #define FREE(p,t) M(p, sizeof(t), 0) +#define FREE_ARR(p,t,old) M(p, (old)*sizeof(t), 0) Obj *alloc_obj(size_t sz, ObjTy oty); @@ -2,15 +2,27 @@ #include <string.h> #include "val.h" #include "mem.h" +#include "ht.h" -ObjString *objstring_new(char *src, size_t len) { +ObjString *objstring_copy(char *src, size_t len) { char *d = NEW_ARR(char, 1+len); memcpy(d, src, len); d[len] = '\0'; ObjString *o = NEW_OBJ(ObjString, OTY_STRING); o->len = len; o->b = d; + o->hash = hash(d, len); + + return o; +} + +ObjString *objstring_take(char *src, size_t len) { + ObjString *o = NEW_OBJ(ObjString, OTY_STRING); + o->len = len; + o->b = src; + o->hash = hash(src, len); + return o; } @@ -2,6 +2,9 @@ #define _val_h #include <stdbool.h> +#include <stdint.h> +#include <stddef.h> + typedef struct _val Val; typedef struct _obj Obj; @@ -38,10 +41,12 @@ typedef struct _obj { typedef struct { Obj obj; size_t len; + uint32_t hash; char *b; } ObjString; -// copies data -ObjString *objstring_new(char *src, size_t len); + +ObjString *objstring_copy(char *src, size_t len); +ObjString *objstring_take(char *src, size_t len); #define IS_NIL(x) (x.ty == NIL) @@ -55,17 +55,6 @@ Vm vm_new(Chunk *ch) { void runvm(Chunk *ch) { - // Chunk ch = chunk_new(); - - // chunk_wbc(&ch, OP_LOADK); - // chunk_wbc(&ch, chunk_wconst(&ch, VAL_NUM(10.0))); - // chunk_wbc(&ch, OP_LOADK); - // chunk_wbc(&ch, chunk_wconst(&ch, VAL_NUM(3.0))); - // chunk_wbc(&ch, OP_DIV); - // chunk_wbc(&ch, OP_PRINT); - - // chunk_wbc(&ch, OP_RET); - disasm_chunk(ch); |