123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596 |
- #include <string.h>
- #include "hatab.h"
- #include "mem.h"
- #include "dynar.h"
- #define HATAB_ROOM_DEFAULT 128
- #define HATAB_CELLAR_DEFAULT 16
- /* TODO: the current hash table structure isn't too good.
- Empty pails are kept in the hash chains. Better would be to use doubly
- linked pails, and drop unused pails from the doubly linked list.
- Also, the cellar can be replaced by a pail storage, that
- keeps all the pails. The hash table's lookup table then
- only stores *pointers* to pails in the pail storage. In theory,
- the pail storage could even be external if that was needed.
- */
- /* Allocate a new hash tab pair. */
- HatabPair * hatabpair_alloc() {
- return STRUCT_ALLOC(HatabPair);
- }
- /* Initialize a hash tab pair. */
- HatabPair * hatabpair_init(HatabPair * self, void * key, void * value) {
- if(!self) return NULL;
- self->key = key;
- self->value = value;
- return self;
- }
- /* Make a new hash tab pair. */
- HatabPair * hatabpair_new(HatabPair * self, void * key, void * value) {
- return hatabpair_init(hatabpair_alloc(), key, value);
- }
- /* Free the pair. Contrary to normal, does not clean up the contents of the pair!. */
- HatabPair * hatabpair_free(HatabPair * self) {
- return mem_free(self);
- }
- /* Apply destructor to pair. */
- HatabPair * hatabpair_destroy(HatabPair * self, HatabPairFree * destructor) {
- if (destructor) destructor(self);
- return hatabpair_free(self);
- }
- /* Get the key of a hash tab pair. */
- void * hatabpair_key(HatabPair * self) {
- if(!self) return NULL;
- return self->key;
- }
- /* Get the value of a hash tab pair. */
- void * hatabpair_value(HatabPair * self) {
- if(!self) return NULL;
- return self->value;
- }
- /* Returns nonzero if the pair is empty, that is, has a NULL key, zero if not . */
- int hatabpair_empty_p(HatabPair * self) {
- if(!self) return TRUE;
- if(!self->key) return TRUE;
- return FALSE;
- }
- /* Jenkins hash function. */
- uint32_t hatab_jenkins(char *key, size_t len) {
- uint32_t hash, i;
- for(hash = i = 0; i < len; ++i) {
- hash += key[i];
- hash += (hash << 10);
- hash ^= (hash >> 6);
- }
- hash += (hash << 3);
- hash ^= (hash >> 11);
- hash += (hash << 15);
- return hash;
- }
- /** Hash function that hashes a C string. */
- uint32_t hatab_hash_cstr(void * key) {
- char * cstr = (char *) key;
- return hatab_jenkins(cstr, strlen(cstr));
- }
- /** Hash function that hashes a uint32_t. */
- uint32_t hatab_hash_uint32(void * key) {
- return hatab_jenkins((char *)&key, sizeof(uint32_t));
- }
- /* A Pail is a hash bucket. This is internal to Hatab and should not be used
- outside of this file. */
- struct Pail_;
- typedef struct Pail_ Pail;
- /* Hash bucket, contains a pair, the hash value, and and a linked list to the next pail. */
- struct Pail_ {
- HatabPair pair;
- Pail * next;
- Pail * prev;
- uint32_t hash;
- };
- /** A hash table. The algorithm implemented is a coalesced hash table. */
- struct Hatab_ {
- Dynar * lookup ;
- Dynar * pails ;
- int lookup_used;
- int pails_used;
- /* Acts of the hash table, for customization of the hash function, etc. */
- HatabActs * acts ;
- Pail * freelist;
- };
- /* Initializes a hash table bucket, here abbreviated to "pail". */
- static Pail * pail_init(Pail * self,
- void * key, void * data, void * next,
- void * prev, uint32_t hash) {
- hatabpair_init(&self->pair, key, data);
- self->next = next;
- self->prev = prev;
- self->hash = hash;
- return self;
- }
- /* Initializes a hash table bucket, here abbreviated to "pail". */
- static Pail * pail_initpair(Pail * self, HatabPair pair,
- void * next, void * prev, uint32_t hash) {
- self->pair = pair;
- self->next = next;
- self->prev = prev;
- self->hash = hash;
- return self;
- }
- /* Returns the next pail following this one. */
- static Pail * pail_next(Pail * self) {
- if(!self) return NULL;
- return self->next;
- }
- /* Returns the previous pail preceding this one. */
- static Pail * pail_prev(Pail * self) {
- if(!self) return NULL;
- return self->next;
- }
- /* Sets the next pail following this one. Also updates next->prev if needed. */
- static Pail * pail_next_(Pail * self, Pail * next) {
- if(!self) return NULL;
- self->next = next;
- if(next) {
- next->prev = self;
- }
- return next;
- }
- /* Sets the next pail preceding this one */
- static Pail * pail_prev_(Pail * self, Pail * prev) {
- if(!self) return NULL;
- self->prev = prev;
- if(prev) {
- prev->next = self;
- }
- return prev;
- }
- /* Gets the key of the pail. */
- static void * pail_key(Pail * self) {
- return hatabpair_key(&self->pair);
- }
- /* Gets the value of the pail. */
- static void * pail_value(Pail * self) {
- return hatabpair_value(&self->pair);
- }
- /* Initializes a hash bucket to be empty. */
- static Pail * pail_initempty(Pail * self) {
- return pail_init(self, NULL, NULL, NULL, NULL, 0);
- }
- /* Returns zero if the hash of the bucket is equal to hash, nonzero if not. */
- static int pail_cmphash(Pail * self, uint32_t hash) {
- return self->hash != hash;
- }
- /* Returns nonzero if the pail is empty, zero if not . */
- static int pail_empty_p(Pail * self) {
- return hatabpair_empty_p(&self->pair);
- }
- /* Empties a pail, without breaking the link chain */
- static Pail * pail_emptynobreak(Pail * self) {
- return pail_init(self, NULL, NULL, self->next, self->prev, 0);
- }
- /* Unlinks the pail, that is, removes itself from the pail chain it is in.
- Returns the next pail in the chain, if any. Then empties the pail,
- so make suure to destroy the contents before calling thsi function. */
- static Pail * pail_unlink(Pail * self) {
- /* Link next and prev together. */
- pail_next_(self->prev, self->next);
- pail_prev_(self->next, self->prev);
- pail_initempty(self);
- return self->next;
- }
- /* If the pail is in use, free the memory held by the key
- by using the HatabPairFree destructor in the acts struct.
- If the destructor is NULL, nothing happens.
- Does not break the link chain. Does nothing if the pail is already empty. */
- static Pail * pail_done(Pail * self, HatabActs * acts) {
- if(pail_empty_p(self)) return self;
- if(acts) {
- if(acts->free_pair) acts->free_pair(&self->pair);
- }
- return pail_unlink(self);
- }
- /* Allocates a new pail. */
- static Pail * pail_alloc() {
- return STRUCT_ALLOC(Pail);
- }
- /* Allocates and initializes a new empty pail.*/
- static Pail * pail_newempty() {
- return pail_initempty(pail_alloc());
- }
- /* Frees a pail, also calls pail_done with acts */
- static Pail * pail_free(Pail * self, HatabActs * acts) {
- pail_done(self, acts);
- return mem_free(self);
- }
- /* Default operations for the hash table. */
- static HatabActs hatab_default_acts = {
- (HatabCompare *) strcmp,
- (HatabHash *) hatab_hash_cstr,
- NULL,
- };
- /* Puts a pail in the hatab's free list. */
- Pail * hatab_addfreepail(Hatab * self, Pail * pail) {
- Pail * oldpail;
- if ((!self) || (!pail)) return NULL;
- oldpail = self->freelist;
- if (oldpail) {
- pail_next_(pail, oldpail);
- pail_prev_(oldpail, pail);
- }
- self->freelist = pail;
- return pail;
- }
- /* Gets a pail from the free pail's list and remove it from there.
- * Returns NULL if no more pails are available.
- */
- Pail * hatab_takefreepail(Hatab * self) {
- Pail * pail, *nextpail;
- pail = self->freelist;
- if (!pail) return NULL;
- nextpail = pail_next(pail);
- self->freelist = nextpail;
- return pail;
- }
- /* Adds a single, new pail to the hatab's free pail list. */
- Pail * hatab_newfreepail(Hatab * self) {
- Pail * pail, *oldpail;
- pail = pail_newempty();
- return hatab_addfreepail(self, pail);
- }
- /** Returns nonzero if the pails is full, zero if it isn't. */
- int hatab_pailsfull_p(Hatab * self) {
- if(!self) return 0;
- return self->freelist != NULL;
- }
- /** Returns nonzero if the lookup array is full, zero if it isn't. */
- int hatab_lookupfull_p(Hatab * self) {
- if(!self) return 0;
- return self->lookup_used >= dynar_size(self->lookup);
- }
- /** Cleans up and empties a table. */
- Hatab * hatab_done(Hatab * self) {
- int index;
- Pail * pail, * nextpail;
- if(!self) return NULL;
- for(index = 0; index < dynar_size(self->lookup); index++) {
- pail = dynar_getptr(self->lookup, index);
- while (pail) {
- nextpail = pail_next(pail);
- pail_free(pail, self->acts);
- pail = nextpail;
- }
- }
- dynar_free(self->lookup);
- pail = hatab_takefreepail(self);
- while(pail) {
- pail_free(pail, NULL); // NULL because no destructor needed for EMPTY pails.
- }
- return self;
- }
- /** Frees a hash table */
- Hatab * hatab_free(Hatab * self) {
- hatab_done(self);
- return mem_free(self);
- }
- /* Gets a pointer to the lookup pail at the given index,
- which is not checked and should be valid. */
- static Pail * hatab_getlookuppail(Hatab * self, uint32_t index) {
- return (Pail *) dynar_getptr(self->lookup, index);
- }
- /* Gets a pointer to the pails pail at the given index,
- which is not checked and should be valid. */
- static Pail * hatab_getpailspail(Hatab * self, uint32_t index) {
- return (Pail *) dynar_getdata(self->pails, index);
- }
- /* Returns the next empty pail cell, or NULL if the pails storage is full. */
- static Pail * hatab_getnextemptypail(Hatab * self) {
- int index, stop;
- stop = dynar_size(self->pails);
- for (index = 0; index < stop; index ++) {
- Pail * pail = hatab_getpailspail(self, index);
- if (pail_empty_p(pail)) {
- self->pails_used++;
- return pail;
- }
- }
- return NULL;
- }
- /* Empties all entries in the table. */
- Hatab * hatab_clear(Hatab * self) {
- int index, size;
- size = dynar_size(self->lookup);
- /* Empty lookup table. */
- for(index = 0; index < size; index++) {
- dynar_putptr(self->lookup, index, NULL);
- }
- /* Clean up and free pails. */
- size = dynar_size(self->pails);
- for(index = 0; index < size; index++) {
- void * data = hatab_getpailspail(self, index);
- pail_done(data, self->acts);
- }
- return self;
- }
- /* Initializes the dynars and pails of the table. */
- Hatab * hatab_initpails(Hatab * self) {
- int index, size;
- size = dynar_size(self->lookup);
- /* Empty lookup table. */
- for(index = 0; index < size; index++) {
- dynar_putptr(self->lookup, index, NULL);
- }
- /* Clean up and free pails. */
- size = dynar_size(self->pails);
- for(index = 0; index < size; index++) {
- void * data = hatab_getpailspail(self, index);
- pail_initempty(data);
- }
- return self;
- }
- /** Initializes the table with the given room and pails space. */
- Hatab * hatab_initroom(Hatab * self, HatabActs * acts,
- int pails, int space)
- {
- if(!self) return NULL;
- self->acts = acts ? acts : (&hatab_default_acts);
- self->lookup = dynar_new(pails, sizeof(Pail *));
- self->pails = dynar_new(space, sizeof(Pail));
- if((!self->lookup) || (!self->pails)) return hatab_done(self);
- hatab_initpails(self);
- return self;
- }
- /** Allocates a Hatab. */
- Hatab * hatab_alloc() {
- return STRUCT_ALLOC(Hatab);
- }
- /** Initializes the hatab with default room and pails space */
- Hatab * hatab_init(Hatab * self, HatabActs * acts) {
- return hatab_initroom(self, acts, HATAB_ROOM_DEFAULT, HATAB_ROOM_DEFAULT * 2);
- }
- /** Makes a new hatab */
- Hatab * hatab_newroom(HatabActs * acts, int pails, int space) {
- return hatab_initroom(hatab_alloc(), acts, pails, space);
- }
- /** Makes a new hatab with default room and pails space */
- Hatab * hatab_new(HatabActs * acts) {
- return hatab_newroom(acts, HATAB_ROOM_DEFAULT, HATAB_ROOM_DEFAULT * 2);
- }
- /* Calculates the hash value of the given data pointer using self->acts->hash*/
- uint32_t hatab_hash(Hatab * self, void * ptr) {
- return self->acts->hash(ptr);
- }
- /* Compares the given data pointers using self->acts->compare */
- int hatab_compare(Hatab * self, void * pa, void * pb) {
- return self->acts->compare(pa, pb);
- }
- /* Checks if the given bucket contains the given key with the given hash. */
- static int hatab_pailok(Hatab * self, Pail * pail,
- void * key, uint32_t hash) {
- if(!pail) return FALSE;
- if(pail_empty_p(pail)) return FALSE;
- if(pail_cmphash(pail, hash)) return FALSE;
- if(hatab_compare(self, pail_key(pail), key)) return FALSE;
- return TRUE;
- }
- /* Gets the pail that matches this key, or NULL if not found. */
- static Pail * hatab_findpail(Hatab * self, void * key) {
- uint32_t hash, index;
- Pail * pail;
- if(!self) return NULL;
- hash = hatab_hash(self, key);
- index = hash % dynar_size(self->lookup);
- pail = hatab_getlookuppail(self, index);
- if (!pail) return NULL;
- while(pail) {
- if(hatab_pailok(self, pail, key, hash)) return pail;
- // return the pail if it's OK.
- pail = pail_next(pail); // Follow the linked chain of pails.
- }
- // If we get here, no more links, and not found. Return null.
- return NULL;
- }
- /** Gets a value that matches key from a hash table. */
- void * hatab_get(Hatab * self, void * key) {
- Pail * pail = hatab_findpail(self, key);
- if(!pail) return NULL;
- return pail_value(pail);
- }
- /** Removes a value that matches key from a hash table.
- * The value will also will be deleted if the methods are set correctly. */
- void * hatab_drop(Hatab * self, void * key) {
- uint32_t hash, index;
- void * data;
- Pail * next;
- Pail * pail = hatab_findpail(self, key);
- if(!pail) return NULL;
- /* if it's the first pail get the next one and set that (also when NULL) */
- if(!pail_prev(pail)) {
- next = pail_next(pail);
- hash = hatab_hash(self, pail_key((pail)));
- index = hash % dynar_size(self->lookup);
- dynar_putptr(self->lookup, index, next);
- }
- /* XXX: this can't work now... */
- pail_done(pail, self->acts);
- return self;
- }
- /** Grows the hash table when needed. */
- Hatab * hatab_grow(Hatab * self) {
- int oldsize, index;
- oldsize = dynar_size(self->pails);
- // double the size of the pails block, so collisions can be handled
- // NOTE: should also grow lookup table but rehash is slow...
- // Dynar cannot work here, since it may invalidate the pointers in
- // itself when growing. Should maintain a free list in stead.
- void * mok = dynar_grow(self->pails, oldsize*2);
- /*void * cok = siarray_grow(hatab_pails(self), hatab_pailsroom(self)*2);*/
- if(!mok) return NULL;
- for(index = oldsize; index < (oldsize * 2); index++) {
- Pail * pail = (Pail *) dynar_getraw(self->pails, index);
- pail_initempty(pail);
- }
- // if(!cok) return NULL; // XXX: rehash the table here!
- return self;
- }
- /** Stores a value in the hash table. */
- void * hatab_put(Hatab * self, void * key, void * value) {
- uint32_t hash, index;
- Pail * pail, * newpail = NULL;
- if(!self) return NULL;
- hash = hatab_hash(self, key);
- index = hash % dynar_size(self->lookup);
- pail = hatab_getlookuppail(self, index);
- /* get a new pail */
- newpail = hatab_getnextemptypail(self);
- if(!newpail) {
- if(hatab_pailsfull_p(self)) { // The pails is full.
- if(!hatab_grow(self)) return NULL;
- // Grow the hashtable, return null if that failed.
- }
- newpail = hatab_getnextemptypail(self);
- if (!newpail) return NULL;
- }
-
- /* No pail set yet, set it in the array. */
- if (!pail) {
- dynar_putptr(self->lookup, index, newpail);
- } else {
- /* Pail already there. Go to end of linked list and add pail there. */
- while (pail->next) {
- pail = pail->next;
- // Follow chain of linked, nonempty pails. If the pail is empty or
- // the chain is broken, we can store the data in the pail.
- }
- // XXX
- pail->next = newpail;
- newpail->prev = pail;
- }
- newpail->hash = hash;
- hatabpair_init(&newpail->pair, key, value);
- return newpail;
- }
- /* Prints a dot graph of the hash tab for debugging */
- void hatab_printgraph(Hatab * self) {
- int index, stop, oldindex;
- Pail * pail, * oldpail, * nextpail, *linkpail;
- pail = NULL; oldpail = NULL;
- oldindex = -1;
- printf("digraph { \n");
- stop = dynar_size(self->lookup);
- for(index = 0; index < stop; index ++) {
- pail = (Pail *) dynar_getptr(self->lookup, index);
- if (!pail) {
- continue;
- }
- if (oldpail) {
- printf("t%p -> t%p [color=red];\n", (void *)oldpail, (void *)pail);
- }
- linkpail = pail ; nextpail = pail_next(linkpail);
- while (nextpail) {
- printf("t%p -> t%p [color=green];\n", (void *)linkpail, (void *)nextpail);
- linkpail = nextpail;
- nextpail = pail_next(linkpail);
- }
- oldpail = pail;
- }
- printf("} \n");
- }
|