#include "config.h"
#include "system.h"
#include "hash.h"
#include "obstack.h"
#include "toplev.h"
#define obstack_chunk_alloc xmalloc
#define obstack_chunk_free free
#define DEFAULT_SIZE (1009)
boolean
hash_table_init_n (table, newfunc, hash, comp, size)
struct hash_table *table;
struct hash_entry *(*newfunc) PARAMS ((struct hash_entry *,
struct hash_table *,
hash_table_key));
unsigned long (*hash) PARAMS ((hash_table_key));
boolean (*comp) PARAMS ((hash_table_key, hash_table_key));
unsigned int size;
{
unsigned int alloc;
alloc = size * sizeof (struct hash_entry *);
if (!obstack_begin (&table->memory, alloc))
{
error ("no memory");
return false;
}
table->table = ((struct hash_entry **)
obstack_alloc (&table->memory, alloc));
if (!table->table)
{
error ("no memory");
return false;
}
memset ((PTR) table->table, 0, alloc);
table->size = size;
table->newfunc = newfunc;
table->hash = hash;
table->comp = comp;
return true;
}
boolean
hash_table_init (table, newfunc, hash, comp)
struct hash_table *table;
struct hash_entry *(*newfunc) PARAMS ((struct hash_entry *,
struct hash_table *,
hash_table_key));
unsigned long (*hash) PARAMS ((hash_table_key));
boolean (*comp) PARAMS ((hash_table_key, hash_table_key));
{
return hash_table_init_n (table, newfunc, hash, comp, DEFAULT_SIZE);
}
void
hash_table_free (table)
struct hash_table *table;
{
obstack_free (&table->memory, (PTR) NULL);
}
struct hash_entry *
hash_lookup (table, key, create, copy)
struct hash_table *table;
hash_table_key key;
boolean create;
hash_table_key (*copy) PARAMS ((struct obstack* memory,
hash_table_key key));
{
register unsigned long hash;
struct hash_entry *hashp;
unsigned int index;
hash = (*table->hash)(key);
index = hash % table->size;
for (hashp = table->table[index];
hashp != (struct hash_entry *) NULL;
hashp = hashp->next)
{
if (hashp->hash == hash
&& (*table->comp)(hashp->key, key))
return hashp;
}
if (! create)
return (struct hash_entry *) NULL;
hashp = (*table->newfunc) ((struct hash_entry *) NULL, table, key);
if (hashp == (struct hash_entry *) NULL)
return (struct hash_entry *) NULL;
if (copy)
key = (*copy) (&table->memory, key);
hashp->key = key;
hashp->hash = hash;
hashp->next = table->table[index];
table->table[index] = hashp;
return hashp;
}
struct hash_entry *
hash_newfunc (entry, table, p)
struct hash_entry *entry;
struct hash_table *table;
hash_table_key p;
{
if (entry == (struct hash_entry *) NULL)
entry = ((struct hash_entry *)
hash_allocate (table, sizeof (struct hash_entry)));
return entry;
}
PTR
hash_allocate (table, size)
struct hash_table *table;
unsigned int size;
{
PTR ret;
ret = obstack_alloc (&table->memory, size);
if (ret == NULL && size != 0)
error ("no memory");
return ret;
}
void
hash_traverse (table, func, info)
struct hash_table *table;
boolean (*func) PARAMS ((struct hash_entry *, hash_table_key));
PTR info;
{
unsigned int i;
for (i = 0; i < table->size; i++)
{
struct hash_entry *p;
for (p = table->table[i]; p != NULL; p = p->next)
{
if (! (*func) (p, info))
return;
}
}
}
unsigned long
string_hash (k)
hash_table_key k;
{
const unsigned char *s;
unsigned long hash;
unsigned char c;
unsigned int len;
s = (const unsigned char *) k;
hash = 0;
len = 0;
while ((c = *s++) != '\0')
{
hash += c + (c << 17);
hash ^= hash >> 2;
++len;
}
hash += len + (len << 17);
hash ^= hash >> 2;
return hash;
}
boolean
string_compare (k1, k2)
hash_table_key k1;
hash_table_key k2;
{
return (strcmp ((char*) k1, (char*) k2) == 0);
}
hash_table_key
string_copy (memory, k)
struct obstack* memory;
hash_table_key k;
{
char *new;
char *string = (char*) k;
new = (char *) obstack_alloc (memory, strlen (string) + 1);
if (!new)
{
error ("no memory");
return NULL;
}
strcpy (new, string);
return new;
}