437
435
* bucket, or NULL if it is empty. prev can also be NULL, in which case it is
440
static HashNode* Hash_FindNode(const Hash* h, uint key1, uint key2, HashNode** prev_out)
438
static HashNode *Hash_FindNode(const Hash *h, uint key1, uint key2, HashNode** prev_out)
442
440
uint hash = h->hash(key1, key2);
446
444
debug("Looking for %u, %u", key1, key2);