ed/raddebugger
1
0
Fork 0
mirror of https://github.com/Ed94/raddebugger.git synced 2026-08-14 17:28:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

handle empty hash table case

Browse Source
This commit is contained in:
Nikita Smith
2025-11-19 11:25:54 -08:00
parent e0d0cf6e29
commit 597ea44337
1 changed files with 18 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/linker/hash_table.c
+18 -16
View File
@@ -162,13 +162,21 @@ hash_table_push_path_raw(Arena *arena, HashTable *ht, String8 path, void *value)
//////////////////////////////// ////////////////////////////////
internal BucketNode *
hash_table_bucket_from_hash(HashTable *ht, U64 hash)
{
BucketNode *bucket = 0;
if (ht->cap > 0) {
bucket = ht->buckets[hash % ht->cap].first;
}
return bucket;
}
internal BucketNode * internal BucketNode *
hash_table_search_string(HashTable *ht, String8 key_string) hash_table_search_string(HashTable *ht, String8 key_string)
{ {
U64 hash = hash_table_hasher(key_string); BucketNode *bucket = hash_table_bucket_from_hash(ht, hash_table_hasher(key_string));
U64 ibucket = hash % ht->cap; for EachNode(n, BucketNode, bucket) {
BucketList *bucket = ht->buckets + ibucket;
for (BucketNode *n = bucket->first; n != 0; n = n->next) {
if (str8_match(n->v.key_string, key_string, 0)) { if (str8_match(n->v.key_string, key_string, 0)) {
return n; return n;
} }
@@ -179,10 +187,8 @@ hash_table_search_string(HashTable *ht, String8 key_string)
internal BucketNode * internal BucketNode *
hash_table_search_u32(HashTable *ht, U32 key_u32) hash_table_search_u32(HashTable *ht, U32 key_u32)
{ {
U64 hash = hash_table_hasher(str8_struct(&key_u32)); BucketNode *bucket = hash_table_bucket_from_hash(ht, hash_table_hasher(str8_struct(&key_u32)));
U64 ibucket = hash % ht->cap; for EachNode(n, BucketNode, bucket) {
BucketList *bucket = ht->buckets + ibucket;
for (BucketNode *n = bucket->first; n != 0; n = n->next) {
if (n->v.key_u32 == key_u32) { if (n->v.key_u32 == key_u32) {
return n; return n;
} }
@@ -193,10 +199,8 @@ hash_table_search_u32(HashTable *ht, U32 key_u32)
internal BucketNode * internal BucketNode *
hash_table_search_u64(HashTable *ht, U64 key_u64) hash_table_search_u64(HashTable *ht, U64 key_u64)
{ {
U64 hash = hash_table_hasher(str8_struct(&key_u64)); BucketNode *bucket = hash_table_bucket_from_hash(ht, hash_table_hasher(str8_struct(&key_u64)));
U64 ibucket = hash % ht->cap; for EachNode(n, BucketNode, bucket) {
BucketList *bucket = ht->buckets + ibucket;
for (BucketNode *n = bucket->first; n != 0; n = n->next) {
if (n->v.key_u64 == key_u64) { if (n->v.key_u64 == key_u64) {
return n; return n;
} }
@@ -219,10 +223,8 @@ hash_table_search_path(HashTable *ht, String8 path)
internal BucketNode * internal BucketNode *
hash_table_search_raw(HashTable *ht, void *key) hash_table_search_raw(HashTable *ht, void *key)
{ {
U64 hash = hash_table_hasher(str8_struct(&key)); BucketNode *bucket = hash_table_bucket_from_hash(ht, hash_table_hasher(str8_struct(&key)));
U64 ibucket = hash % ht->cap; for EachNode(n, BucketNode, bucket) {
BucketList *bucket = ht->buckets + ibucket;
for (BucketNode *n = bucket->first; n != 0; n = n->next) {
if (n->v.key_raw == key) { if (n->v.key_raw == key) {
return n; return n;
} }