getKeyHashValue h; |
index = n & nTableMask; |
Bucket *p = arBucket[index]; |
while (p) { |
if ((p->h == h) && (p->nKeyLength == nKeyLength)) { |
RETURN p->data; |
} |
p=p->next; |
} |
RETURN FALTURE; |
p = (Bucket *) pemalloc(sizeof(Bucket) - 1 + nKeyLength, ht->persistent); |