Lines Matching defs:hash
51 struct cache_head *key, int hash)
56 head = &detail->hash_table[hash];
125 struct cache_head *new, struct cache_head *old, int hash)
157 head = &detail->hash_table[hash];
509 * All deferred requests are stored in a hash table,
532 int hash = DFR_HASH(item);
552 if (cache_defer_hash[hash].next == NULL)
553 INIT_LIST_HEAD(&cache_defer_hash[hash]);
554 list_add(&dreq->hash, &cache_defer_hash[hash]);
562 list_del(&dreq->hash);
584 int hash = DFR_HASH(item);
589 lp = cache_defer_hash[hash].next;
591 while (lp != &cache_defer_hash[hash]) {
592 dreq = list_entry(lp, struct cache_deferred_req, hash);
595 list_del(&dreq->hash);
621 list_del(&dreq->hash);
1133 unsigned hash, entry;
1141 hash = n >> 32;
1144 for (ch=cd->hash_table[hash]; ch; ch=ch->next)
1149 hash++;
1151 } while(hash < cd->hash_size &&
1152 cd->hash_table[hash]==NULL);
1153 if (hash >= cd->hash_size)
1156 return cd->hash_table[hash];
1162 int hash = (*pos >> 32);
1166 hash = 0;
1168 hash++;
1175 while (hash < cd->hash_size &&
1176 cd->hash_table[hash] == NULL) {
1177 hash++;
1180 if (hash >= cd->hash_size)
1183 return cd->hash_table[hash];