Lines Matching refs:hash
60 struct cache_head *key, int hash)
65 head = &detail->hash_table[hash];
144 struct cache_head *new, struct cache_head *old, int hash)
175 head = &detail->hash_table[hash];
492 * All deferred requests are stored in a hash table,
515 int hash = DFR_HASH(item);
534 if (cache_defer_hash[hash].next == NULL)
535 INIT_LIST_HEAD(&cache_defer_hash[hash]);
536 list_add(&dreq->hash, &cache_defer_hash[hash]);
544 list_del_init(&discard->hash);
567 int hash = DFR_HASH(item);
572 lp = cache_defer_hash[hash].next;
574 while (lp != &cache_defer_hash[hash]) {
575 dreq = list_entry(lp, struct cache_deferred_req, hash);
578 list_del_init(&dreq->hash);
604 list_del_init(&dreq->hash);
1152 unsigned hash, entry;
1160 hash = n >> 32;
1163 for (ch=cd->hash_table[hash]; ch; ch=ch->next)
1168 hash++;
1170 } while(hash < cd->hash_size &&
1171 cd->hash_table[hash]==NULL);
1172 if (hash >= cd->hash_size)
1175 return cd->hash_table[hash];
1181 int hash = (*pos >> 32);
1185 hash = 0;
1187 hash++;
1194 while (hash < cd->hash_size &&
1195 cd->hash_table[hash] == NULL) {
1196 hash++;
1199 if (hash >= cd->hash_size)
1202 return cd->hash_table[hash];
1662 q.hash = full_name_hash(q.name, q.len);