Lines Matching refs:h
111 uint32_t h = seed ^ len; in dictGenHashFunction() local
123 h *= m; in dictGenHashFunction()
124 h ^= k; in dictGenHashFunction()
132 case 3: h ^= data[2] << 16; in dictGenHashFunction()
133 case 2: h ^= data[1] << 8; in dictGenHashFunction()
134 case 1: h ^= data[0]; h *= m; in dictGenHashFunction()
139 h ^= h >> 13; in dictGenHashFunction()
140 h *= m; in dictGenHashFunction()
141 h ^= h >> 15; in dictGenHashFunction()
143 return (unsigned int)h; in dictGenHashFunction()
262 unsigned int h; in dictRehash() local
266 h = dictHashKey(d, de->key) & d->ht[1].sizemask; in dictRehash()
267 de->next = d->ht[1].table[h]; in dictRehash()
268 d->ht[1].table[h] = de; in dictRehash()
414 unsigned int h, idx; in dictGenericDelete() local
420 h = dictHashKey(d, key); in dictGenericDelete()
423 idx = h & d->ht[table].sizemask; in dictGenericDelete()
495 unsigned int h, idx, table; in dictFind() local
499 h = dictHashKey(d, key); in dictFind()
501 idx = h & d->ht[table].sizemask; in dictFind()
629 unsigned int h; in dictGetRandomKey() local
638 h = d->rehashidx + (random() % (d->ht[0].size + in dictGetRandomKey()
641 he = (h >= d->ht[0].size) ? d->ht[1].table[h - d->ht[0].size] : in dictGetRandomKey()
642 d->ht[0].table[h]; in dictGetRandomKey()
646 h = random() & d->ht[0].sizemask; in dictGetRandomKey()
647 he = d->ht[0].table[h]; in dictGetRandomKey()
968 unsigned int h, idx, table; in _dictKeyIndex() local
975 h = dictHashKey(d, key); in _dictKeyIndex()
977 idx = h & d->ht[table].sizemask; in _dictKeyIndex()