hashtable.c File Reference

#include "hashtable.h"
#include "hashtable_private.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include "../MALLOC/includes/MALLOC.h"

Include dependency graph for hashtable.c:

Go to the source code of this file.

Functions
hashtable *	create_hashtable (unsigned int minsize, unsigned int(*hashf)(void *), int(*eqf)(void *, void *))
unsigned int	hash (struct hashtable *h, void *k)
static int	hashtable_expand (struct hashtable *h)
unsigned int	hashtable_count (struct hashtable *h)
int	hashtable_insert (struct hashtable *h, void *k, void *v)
void *	hashtable_search (struct hashtable *h, void *k)
void *	hashtable_remove (struct hashtable *h, void *k)
void	hashtable_destroy (struct hashtable *h, int free_values)
Variables
static const unsigned int	primes []
const unsigned int	prime_table_length = sizeof(primes)/sizeof(primes[0])
const float	max_load_factor = 0.65f

---

Function Documentation

struct hashtable* create_hashtable	(	unsigned int	minsize,
		unsigned int(*)(void *)	hashf,
		int(*)(void *, void *)	eqf
	)

Definition at line 62 of file hashtable.c.

References FREE, h, MALLOC, NULL, prime_table_length, and size.

Referenced by createGetHashTable(), CreateHashtable_string(), createSetHashTable(), and myhcreate().

{
    struct hashtable *h;
    unsigned int pindex, size = primes[0];
    /* Check requested hashtable isn't too large */
    if (minsize > (1u << 30)) return NULL;
    /* Enforce size as prime */
    for (pindex=0; pindex < prime_table_length; pindex++) {
        if (primes[pindex] > minsize) { size = primes[pindex]; break; }
    }
    h = (struct hashtable *)MALLOC(sizeof(struct hashtable));
    if (NULL == h) return NULL; /*oom*/
    h->table = (struct entry **)MALLOC(sizeof(struct entry*) * size);
    if (NULL == h->table) { FREE(h); return NULL; } /*oom*/
    memset(h->table, 0, size * sizeof(struct entry *));
    h->tablelength  = size;
    h->primeindex   = pindex;
    h->entrycount   = 0;
    h->hashfn       = hashf;
    h->eqfn         = eqf;
    h->loadlimit    = (unsigned int) ceil(size * max_load_factor);
    return h;
}

Here is the caller graph for this function:

unsigned int hash	(	struct hashtable *	h,
		void *	k
	)

Definition at line 90 of file hashtable.c.

References h, and i.

{
    /* Aim to protect against poor hash functions by adding logic here
     * - logic taken from java 1.4 hashtable source */
    unsigned int i = h->hashfn(k);
    i += ~(i << 9);
    i ^=  ((i >> 14) | (i << 18)); /* >>> */
    i +=  (i << 4);
    i ^=  ((i >> 10) | (i << 22)); /* >>> */
    return i;
}

unsigned int hashtable_count

(

struct hashtable *

h

)

Definition at line 162 of file hashtable.c.

References h.

{
    return h->entrycount;
}

void hashtable_destroy	(	struct hashtable *	h,
		int	free_values
	)

Definition at line 251 of file hashtable.c.

References f(), FREE, freekey, h, entry::next, NULL, and table.

Referenced by destroyGetHashTable(), DestroyHashtable_string(), destroySetHashTable(), DisposeHashTableScilabErrors(), DisposeHashTableScilabMenus(), DisposeHashTableScilabMessages(), and myhdestroy().

{
    unsigned int i;
    struct entry *e, *f;
    struct entry **table = h->table;
    if (free_values)
    {
        for (i = 0; i < h->tablelength; i++)
        {
            e = table[i];
            while (NULL != e)
            { f = e; e = e->next; freekey(f->k); FREE(f->v); FREE(f); }
        }
    }
    else
    {
        for (i = 0; i < h->tablelength; i++)
        {
            e = table[i];
            while (NULL != e)
            { f = e; e = e->next; freekey(f->k); FREE(f); }
        }
    }
    FREE(h->table);
    FREE(h);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int hashtable_expand

(

struct hashtable *

h

)

[static]

Definition at line 104 of file hashtable.c.

References FREE, entry::h, h, i, indexFor(), MALLOC, memset(), entry::next, NULL, and prime_table_length.

Referenced by hashtable_insert().

{
    /* Double the size of the table to accomodate more entries */
    struct entry **newtable;
    struct entry *e;
    struct entry **pE;
    unsigned int newsize, i, index_;
    /* Check we're not hitting max capacity */
    if (h->primeindex == (prime_table_length - 1)) return 0;
    newsize = primes[++(h->primeindex)];

    newtable = (struct entry **)MALLOC(sizeof(struct entry*) * newsize);
    if (NULL != newtable)
    {
        memset(newtable, 0, newsize * sizeof(struct entry *));
        /* This algorithm is not 'stable'. ie. it reverses the list
         * when it transfers entries between the tables */
        for (i = 0; i < h->tablelength; i++) {
            while (NULL != (e = h->table[i])) {
                h->table[i] = e->next;
                index_ = indexFor(newsize,e->h);
                e->next = newtable[index_];
                newtable[index_] = e;
            }
        }
        FREE(h->table);
        h->table = newtable;
    }
    /* Plan B: realloc instead */
    else 
    {
        newtable = (struct entry **) REALLOC(h->table, newsize * sizeof(struct entry *));
        if (NULL == newtable) { (h->primeindex)--; return 0; }
        h->table = newtable;
        memset(newtable[h->tablelength], 0, newsize - h->tablelength);
        for (i = 0; i < h->tablelength; i++) {
            for (pE = &(newtable[i]), e = *pE; e != NULL; e = *pE) {
                index_ = indexFor(newsize,e->h);
                if (index_ == i)
                {
                    pE = &(e->next);
                }
                else
                {
                    *pE = e->next;
                    e->next = newtable[index_];
                    newtable[index_] = e;
                }
            }
        }
    }
    h->tablelength = newsize;
    h->loadlimit   = (unsigned int) ceil(newsize * max_load_factor);
    return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int hashtable_insert	(	struct hashtable *	h,
		void *	k,
		void *	v
	)

Definition at line 169 of file hashtable.c.

References h, entry::h, hash(), hashtable_expand(), indexFor(), entry::k, MALLOC, entry::next, NULL, and entry::v.

Referenced by insertGetHashtable(), InsertHashtable_string(), and insertSetHashtable().

{
    /* This method allows duplicate keys - but they shouldn't be used */
    unsigned int index_;
    struct entry *e;
    if (++(h->entrycount) > h->loadlimit)
    {
        /* Ignore the return value. If expand fails, we should
         * still try cramming just this value into the existing table
         * -- we may not have memory for a larger table, but one more
         * element may be ok. Next time we insert, we'll try expanding again.*/
        hashtable_expand(h);
    }
    e = (struct entry *)MALLOC(sizeof(struct entry));
    if (NULL == e) { --(h->entrycount); return 0; } /*oom*/
    e->h = hash(h,k);
    index_ = indexFor(h->tablelength,e->h);
    e->k = k;
    e->v = v;
    e->next = h->table[index_];
    h->table[index_] = e;
    return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void* hashtable_remove	(	struct hashtable *	h,
		void *	k
	)

Definition at line 217 of file hashtable.c.

References FREE, freekey, h, entry::h, hash(), indexFor(), entry::k, entry::next, NULL, v, and entry::v.

Referenced by RemoveHastable_string().

{
    /* TODO: consider compacting the table when the load factor drops enough,
     *       or provide a 'compact' method. */

    struct entry *e;
    struct entry **pE;
    void *v;
    unsigned int hashvalue, index_;

    hashvalue = hash(h,k);
    index_ = indexFor(h->tablelength,hash(h,k));
    pE = &(h->table[index_]);
    e = *pE;
    while (NULL != e)
    {
        /* Check hash value to short circuit heavier comparison */
        if ((hashvalue == e->h) && (h->eqfn(k, e->k)))
        {
            *pE = e->next;
            h->entrycount--;
            v = e->v;
            freekey(e->k);
            FREE(e);
            return v;
        }
        pE = &(e->next);
        e = e->next;
    }
    return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void* hashtable_search	(	struct hashtable *	h,
		void *	k
	)

Definition at line 195 of file hashtable.c.

References h, entry::h, hash(), indexFor(), entry::k, entry::next, NULL, and entry::v.

Referenced by searchGetHashtable(), SearchHashtable_string(), and searchSetHashtable().

{
    struct entry *e;
    unsigned int hashvalue, index_;
    hashvalue = hash(h,k);
    index_ = indexFor(h->tablelength,hashvalue);
    e = h->table[index_];
    while (NULL != e)
    {
        /* Check hash value to short circuit heavier comparison */
        if ((hashvalue == e->h) && (h->eqfn(k, e->k))) 
                {
                        return e->v;
                }
                        
        e = e->next;
    }
    return NULL;
}

Here is the call graph for this function:

Here is the caller graph for this function:

---

Variable Documentation

const float max_load_factor = 0.65f

Definition at line 58 of file hashtable.c.

const unsigned int prime_table_length = sizeof(primes)/sizeof(primes[0])

Definition at line 57 of file hashtable.c.

Referenced by create_hashtable(), and hashtable_expand().

const unsigned int primes[] [static]

Initial value:

 {
53, 97, 193, 389,
769, 1543, 3079, 6151,
12289, 24593, 49157, 98317,
196613, 393241, 786433, 1572869,
3145739, 6291469, 12582917, 25165843,
50331653, 100663319, 201326611, 402653189,
805306457, 1610612741
}

Definition at line 48 of file hashtable.c.

---