= table->bucket + table->hasher (entry, table->n_buckets);
struct hash_entry *cursor;
- if (table->bucket_limit <= bucket)
+ if (! (bucket < table->bucket_limit))
abort ();
if (bucket->data == NULL)
return NULL;
for (bucket = table->bucket; ; bucket++)
- if (table->bucket_limit <= bucket)
+ if (! (bucket < table->bucket_limit))
abort ();
else if (bucket->data)
return bucket->data;
= table->bucket + table->hasher (entry, table->n_buckets);
struct hash_entry *cursor;
- if (table->bucket_limit <= bucket)
+ if (! (bucket < table->bucket_limit))
abort ();
/* Find next entry in the same bucket. */
= table->bucket + table->hasher (entry, table->n_buckets);
struct hash_entry *cursor;
- if (table->bucket_limit <= bucket)
+ if (! (bucket < table->bucket_limit))
abort ();
*bucket_head = bucket;
= (new_table->bucket
+ new_table->hasher (data, new_table->n_buckets));
- if (new_table->bucket_limit <= new_bucket)
+ if (! (new_bucket < new_table->bucket_limit))
abort ();
next = cursor->next;