Lines Matching refs:hash

66     uint32_t *hash_table;   /* hash table address (in mmap) */
67 uint32_t ht_size; /* size of hash table */
100 uint32_t hash)
102 if (rec->hash1 == hash) {
104 } else if (rec->hash2 == hash) {
114 uint32_t hash,
119 if (rec->hash1 == hash) {
121 } else if (rec->hash2 == hash) {
205 uint32_t hash)
210 if (hash > MC_HT_ELEMS(mcc->ht_size)) {
211 /* Invalid hash. This should never happen, but better
216 slot = mcc->hash_table[hash];
218 /* no previous record/collision, just add to hash table */
219 mcc->hash_table[hash] = MC_PTR_TO_SLOT(mcc->data_table, rec);
226 /* rec already stored in hash chain */
229 slot = sss_mc_next_slot_with_hash(cur, hash);
234 sss_mc_chain_slot_to_record_with_hash(cur, hash, slot);
239 uint32_t hash)
245 if (hash > MC_HT_ELEMS(mcc->ht_size)) {
247 * or it is invalid hash. It is better to return
253 slot = mcc->hash_table[hash];
262 mcc->hash_table[hash] = sss_mc_next_slot_with_hash(rec, hash);
264 slot = sss_mc_next_slot_with_hash(cur, hash);
269 slot = sss_mc_next_slot_with_hash(cur, hash);
271 sss_mc_chain_slot_to_record_with_hash(prev, hash, slot);
274 slot = sss_mc_next_slot_with_hash(cur, hash);
301 /* Remove from hash chains */
302 /* hash chain 1 */
304 /* hash chain 2 */
511 uint32_t hash;
520 hash = sss_mc_hash(mcc, key->str, key->len);
522 slot = mcc->hash_table[hash];
552 slot = sss_mc_next_slot_with_hash(rec, hash);
580 slot = sss_mc_next_slot_with_hash(rec, hash);
769 /* finally chain the rec in the hash table */
785 uint32_t hash;
800 hash = sss_mc_hash(mcc, uidstr, strlen(uidstr) + 1);
802 slot = mcc->hash_table[hash];
824 slot = sss_mc_next_slot_with_hash(rec, hash);
908 /* finally chain the rec in the hash table */
924 uint32_t hash;
939 hash = sss_mc_hash(mcc, gidstr, strlen(gidstr) + 1);
941 slot = mcc->hash_table[hash];
963 slot = sss_mc_next_slot_with_hash(rec, hash);
1041 /* finally chain the rec in the hash table */
1278 /* hash table is double the size because it will store both forward and