summaryrefslogtreecommitdiffstats
path: root/src/misc/st/stmm.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/misc/st/stmm.c')
-rw-r--r--src/misc/st/stmm.c98
1 files changed, 51 insertions, 47 deletions
diff --git a/src/misc/st/stmm.c b/src/misc/st/stmm.c
index b75b0134..c9b2320b 100644
--- a/src/misc/st/stmm.c
+++ b/src/misc/st/stmm.c
@@ -8,9 +8,13 @@
*
*/
#include <stdio.h>
-#include "util.h"
+#include "extra.h"
#include "stmm.h"
+#ifndef ABS
+# define ABS(a) ((a) < 0 ? -(a) : (a))
+#endif
+
#define STMM_NUMCMP(x,y) ((x) != (y))
#define STMM_NUMHASH(x,size) (ABS((long)x)%(size))
#define STMM_PTRHASH(x,size) ((int)((unsigned long)(x)>>2)%size)
@@ -41,8 +45,8 @@ stmm_init_table_with_params (compare, hash, size, density, grow_factor,
stmm_table *new;
new = ALLOC (stmm_table, 1);
- if (new == NIL (stmm_table)) {
- return NIL (stmm_table);
+ if (new == NULL) {
+ return NULL;
}
new->compare = compare;
new->hash = hash;
@@ -55,9 +59,9 @@ stmm_init_table_with_params (compare, hash, size, density, grow_factor,
}
new->num_bins = size;
new->bins = ALLOC (stmm_table_entry *, size);
- if (new->bins == NIL (stmm_table_entry *)) {
+ if (new->bins == NULL) {
FREE (new);
- return NIL (stmm_table);
+ return NULL;
}
for (i = 0; i < size; i++) {
new->bins[i] = 0;
@@ -90,7 +94,7 @@ stmm_free_table (table)
for ( i = 0; i < table->num_bins; i++ )
{
ptr = table->bins[i];
- while ( ptr != NIL( stmm_table_entry ) )
+ while ( ptr != NULL )
{
next = ptr->next;
FREE( ptr );
@@ -123,7 +127,7 @@ stmm_clean (table)
#define PTR_NOT_EQUAL(table, ptr, user_key)\
-(ptr != NIL(stmm_table_entry) && !EQUAL(table->compare, user_key, (ptr)->key))
+(ptr != NULL && !EQUAL(table->compare, user_key, (ptr)->key))
#define FIND_ENTRY(table, hash_val, key, ptr, last) \
(last) = &(table)->bins[hash_val];\
@@ -131,7 +135,7 @@ stmm_clean (table)
while (PTR_NOT_EQUAL((table), (ptr), (key))) {\
(last) = &(ptr)->next; (ptr) = *(last);\
}\
- if ((ptr) != NIL(stmm_table_entry) && (table)->reorder_flag) {\
+ if ((ptr) != NULL && (table)->reorder_flag) {\
*(last) = (ptr)->next;\
(ptr)->next = (table)->bins[hash_val];\
(table)->bins[hash_val] = (ptr);\
@@ -150,11 +154,11 @@ stmm_lookup (table, key, value)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
return 0;
}
else {
- if (value != NIL (char *))
+ if (value != NULL)
{
*value = ptr->record;
}
@@ -175,11 +179,11 @@ stmm_lookup_int (table, key, value)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
return 0;
}
else {
- if (value != NIL (int))
+ if (value != 0)
{
*value = (long) ptr->record;
}
@@ -223,7 +227,7 @@ stmm_insert (table, key, value)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
if (table->num_entries / table->num_bins >= table->max_density) {
if (rehash (table) == STMM_OUT_OF_MEM) {
return STMM_OUT_OF_MEM;
@@ -233,7 +237,7 @@ stmm_insert (table, key, value)
// new = ALLOC( stmm_table_entry, 1 );
new = (stmm_table_entry *) Extra_MmFixedEntryFetch (table->pMemMan);
- if (new == NIL (stmm_table_entry)) {
+ if (new == NULL) {
return STMM_OUT_OF_MEM;
}
@@ -269,7 +273,7 @@ stmm_add_direct (table, key, value)
// new = ALLOC( stmm_table_entry, 1 );
new = (stmm_table_entry *) Extra_MmFixedEntryFetch (table->pMemMan);
- if (new == NIL (stmm_table_entry)) {
+ if (new == NULL) {
return STMM_OUT_OF_MEM;
}
@@ -294,7 +298,7 @@ stmm_find_or_add (table, key, slot)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
if (table->num_entries / table->num_bins >= table->max_density) {
if (rehash (table) == STMM_OUT_OF_MEM) {
return STMM_OUT_OF_MEM;
@@ -304,7 +308,7 @@ stmm_find_or_add (table, key, slot)
// new = ALLOC( stmm_table_entry, 1 );
new = (stmm_table_entry *) Extra_MmFixedEntryFetch (table->pMemMan);
- if (new == NIL (stmm_table_entry)) {
+ if (new == NULL) {
return STMM_OUT_OF_MEM;
}
@@ -313,12 +317,12 @@ stmm_find_or_add (table, key, slot)
new->next = table->bins[hash_val];
table->bins[hash_val] = new;
table->num_entries++;
- if (slot != NIL (char **))
+ if (slot != NULL)
*slot = &new->record;
return 0;
}
else {
- if (slot != NIL (char **))
+ if (slot != NULL)
*slot = &ptr->record;
return 1;
}
@@ -337,11 +341,11 @@ stmm_find (table, key, slot)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
return 0;
}
else {
- if (slot != NIL (char **))
+ if (slot != NULL)
{
*slot = &ptr->record;
}
@@ -368,7 +372,7 @@ rehash (table)
}
table->num_entries = 0;
table->bins = ALLOC (stmm_table_entry *, table->num_bins);
- if (table->bins == NIL (stmm_table_entry *)) {
+ if (table->bins == NULL) {
table->bins = old_bins;
table->num_bins = old_num_bins;
table->num_entries = old_num_entries;
@@ -382,7 +386,7 @@ rehash (table)
/* copy data over */
for (i = 0; i < old_num_bins; i++) {
ptr = old_bins[i];
- while (ptr != NIL (stmm_table_entry)) {
+ while (ptr != NULL) {
next = ptr->next;
hash_val = do_hash (ptr->key, table);
ptr->next = table->bins[hash_val];
@@ -405,15 +409,15 @@ stmm_copy (old_table)
int i, /*j, */ num_bins = old_table->num_bins;
new_table = ALLOC (stmm_table, 1);
- if (new_table == NIL (stmm_table)) {
- return NIL (stmm_table);
+ if (new_table == NULL) {
+ return NULL;
}
*new_table = *old_table;
new_table->bins = ALLOC (stmm_table_entry *, num_bins);
- if (new_table->bins == NIL (stmm_table_entry *)) {
+ if (new_table->bins == NULL) {
FREE (new_table);
- return NIL (stmm_table);
+ return NULL;
}
// allocate the memory manager for the new table
@@ -421,20 +425,20 @@ stmm_copy (old_table)
Extra_MmFixedStart (sizeof (stmm_table_entry));
for (i = 0; i < num_bins; i++) {
- new_table->bins[i] = NIL (stmm_table_entry);
+ new_table->bins[i] = NULL;
ptr = old_table->bins[i];
- while (ptr != NIL (stmm_table_entry)) {
+ while (ptr != NULL) {
// new = ALLOC( stmm_table_entry, 1 );
new =
(stmm_table_entry *) Extra_MmFixedEntryFetch (new_table->
pMemMan);
- if (new == NIL (stmm_table_entry)) {
+ if (new == NULL) {
/*
for ( j = 0; j <= i; j++ )
{
newptr = new_table->bins[j];
- while ( newptr != NIL( stmm_table_entry ) )
+ while ( newptr != NULL )
{
next = newptr->next;
FREE( newptr );
@@ -446,7 +450,7 @@ stmm_copy (old_table)
FREE (new_table->bins);
FREE (new_table);
- return NIL (stmm_table);
+ return NULL;
}
*new = *ptr;
new->next = new_table->bins[i];
@@ -471,12 +475,12 @@ stmm_delete (table, keyp, value)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
return 0;
}
*last = ptr->next;
- if (value != NIL (char *))
+ if (value != NULL)
*value = ptr->record;
*keyp = ptr->key;
// FREE( ptr );
@@ -500,12 +504,12 @@ stmm_delete_int (table, keyp, value)
FIND_ENTRY (table, hash_val, key, ptr, last);
- if (ptr == NIL (stmm_table_entry)) {
+ if (ptr == NULL) {
return 0;
}
*last = ptr->next;
- if (value != NIL (char *))
+ if (value != NULL)
*value = ptr->record;
*keyp = (long) ptr->key;
// FREE( ptr );
@@ -528,7 +532,7 @@ stmm_foreach (table, func, arg)
for (i = 0; i < table->num_bins; i++) {
last = &table->bins[i];
ptr = *last;
- while (ptr != NIL (stmm_table_entry)) {
+ while (ptr != NULL) {
retval = (*func) (ptr->key, ptr->record, arg);
switch (retval) {
case STMM_CONTINUE:
@@ -604,11 +608,11 @@ stmm_init_gen (table)
stmm_generator *gen;
gen = ALLOC (stmm_generator, 1);
- if (gen == NIL (stmm_generator)) {
- return NIL (stmm_generator);
+ if (gen == NULL) {
+ return NULL;
}
gen->table = table;
- gen->entry = NIL (stmm_table_entry);
+ gen->entry = NULL;
gen->index = 0;
return gen;
}
@@ -622,16 +626,16 @@ stmm_gen (gen, key_p, value_p)
{
register int i;
- if (gen->entry == NIL (stmm_table_entry)) {
+ if (gen->entry == NULL) {
/* try to find next entry */
for (i = gen->index; i < gen->table->num_bins; i++) {
- if (gen->table->bins[i] != NIL (stmm_table_entry)) {
+ if (gen->table->bins[i] != NULL) {
gen->index = i + 1;
gen->entry = gen->table->bins[i];
break;
}
}
- if (gen->entry == NIL (stmm_table_entry)) {
+ if (gen->entry == NULL) {
return 0; /* that's all folks ! */
}
}
@@ -652,21 +656,21 @@ stmm_gen_int (gen, key_p, value_p)
{
register int i;
- if (gen->entry == NIL (stmm_table_entry)) {
+ if (gen->entry == NULL) {
/* try to find next entry */
for (i = gen->index; i < gen->table->num_bins; i++) {
- if (gen->table->bins[i] != NIL (stmm_table_entry)) {
+ if (gen->table->bins[i] != NULL) {
gen->index = i + 1;
gen->entry = gen->table->bins[i];
break;
}
}
- if (gen->entry == NIL (stmm_table_entry)) {
+ if (gen->entry == NULL) {
return 0; /* that's all folks ! */
}
}
*key_p = gen->entry->key;
- if (value_p != NIL (long))
+ if (value_p != 0)
{
*value_p = (long) gen->entry->record;
}
generated by cgit v1.2.3 (git 2.25.1) at 2024-06-28 16:21:09 +0000