rpm-build/rpmdb/rpmhash.c

176 lines
3.6 KiB
C
Raw Normal View History

2002-03-25 23:16:26 +03:00
/**
* \file rpmdb/rpmhash.c
* Hash table implemenation
*/
#include "system.h"
#include "rpmlib.h"
2002-03-25 23:16:26 +03:00
#include "rpmhash.h"
#include "debug.h"
typedef /*@owned@*/ const void * voidptr;
typedef struct hashBucket_s * hashBucket;
/**
*/
struct hashBucket_s {
voidptr key; /*!< hash key */
/*@owned@*/ voidptr * data; /*!< pointer to hashed data */
int dataCount; /*!< length of data (0 if unknown) */
/*@dependent@*/hashBucket next; /*!< pointer to next item in bucket */
};
/**
*/
struct hashTable_s {
int numBuckets; /*!< number of hash buckets */
int freeData; /*!< should data be freed when table is destroyed? */
hashBucket * buckets; /*!< hash bucket array */
hashFunctionType fn; /*!< generate hash value for key */
hashEqualityType eq; /*!< compare hash keys for equality */
};
/**
* Find entry in hash table.
* @param ht pointer to hash table
* @param key pointer to key value
* @return pointer to hash bucket of key (or NULL)
*/
static /*@shared@*/ /*@null@*/
hashBucket findEntry(hashTable ht, const void * key)
/*@*/
{
unsigned int hash;
hashBucket b;
/*@-modunconnomods@*/
hash = ht->fn(key) % ht->numBuckets;
b = ht->buckets[hash];
while (b && b->key && ht->eq(b->key, key))
b = b->next;
/*@=modunconnomods@*/
return b;
}
int hashEqualityString(const void * key1, const void * key2)
{
const char *k1 = (const char *)key1;
const char *k2 = (const char *)key2;
return strcmp(k1, k2);
}
unsigned int hashFunctionString(const void * string)
{
char xorValue = 0;
char sum = 0;
short len;
int i;
const char * chp = string;
len = strlen(string);
for (i = 0; i < len; i++, chp++) {
xorValue ^= *chp;
sum += *chp;
}
return ((((unsigned)len) << 16) + (((unsigned)sum) << 8) + xorValue);
}
hashTable htCreate(int numBuckets, int freeData,
2002-03-25 23:16:26 +03:00
hashFunctionType fn, hashEqualityType eq)
{
hashTable ht;
ht = xmalloc(sizeof(*ht));
ht->numBuckets = numBuckets;
ht->buckets = xcalloc(numBuckets, sizeof(*ht->buckets));
ht->freeData = freeData;
/*@-assignexpose@*/
ht->fn = fn;
ht->eq = eq;
/*@=assignexpose@*/
return ht;
}
void htAddEntry(hashTable ht, const void * key, const void * data)
{
unsigned int hash;
hashBucket b;
hash = ht->fn(key) % ht->numBuckets;
b = ht->buckets[hash];
while (b && b->key && ht->eq(b->key, key))
b = b->next;
/*@-branchstate@*/
if (b == NULL) {
b = xmalloc(sizeof(*b));
b->key = key;
2002-03-25 23:16:26 +03:00
b->dataCount = 0;
b->next = ht->buckets[hash];
b->data = NULL;
ht->buckets[hash] = b;
}
/*@=branchstate@*/
b->data = xrealloc(b->data, sizeof(*b->data) * (b->dataCount + 1));
b->data[b->dataCount++] = data;
}
void htFree(hashTable ht)
{
hashBucket b, n;
int i;
for (i = 0; i < ht->numBuckets; i++) {
b = ht->buckets[i];
if (b == NULL)
continue;
ht->buckets[i] = NULL;
do {
n = b->next;
/*@-branchstate@*/
if (b->data) {
if (ht->freeData)
*b->data = _free(*b->data);
b->data = _free(b->data);
}
/*@=branchstate@*/
b = _free(b);
} while ((b = n) != NULL);
}
ht->buckets = _free(ht->buckets);
ht = _free(ht);
}
int htHasEntry(hashTable ht, const void * key)
{
hashBucket b;
if (!(b = findEntry(ht, key))) return 0; else return 1;
}
int htGetEntry(hashTable ht, const void * key, const void *** data,
int * dataCount, const void ** tableKey)
{
hashBucket b;
if ((b = findEntry(ht, key)) == NULL)
return 1;
if (data)
*data = (const void **) b->data;
if (dataCount)
*dataCount = b->dataCount;
if (tableKey)
*tableKey = b->key;
return 0;
}