Lines Matching defs:hash
154 #define ID_HASH(id, hash) \
156 (hash) = MOD2(((id) ^ NFSID_CACHE_ANCHORS), NFSID_CACHE_ANCHORS); \
1081 * Ops per hash queue
1154 * The only serialization required it to hold the hash chain lock
1156 * to all hash chains while flushing. It is possible that (valid)
1157 * entries could be cached in later hash chains after we start flushing.
1161 * Ops per hash queue
1179 * remove list from hash header so we can release
1245 * Callback reclaim function for VM. We reap timed-out entries from all hash
1269 * hash queue number, is returned in hashno.
1274 uint_t *hashno, /* hash number, retval */
1292 * Compute hash queue
1346 * cache, and inserted. The hash queue number is obtained from hash_number
1353 hash_stat behavior, /* hash algorithm behavior */
1354 uint_t hash_number) /* hash number iff hint */
1373 * Obtain correct hash queue to insert new entry in
1447 * hash queue number, is returned in hashno.
1452 uint_t *hashno, /* hash number, retval */
1459 uint_t hash;
1462 * Compute hash queue
1464 ID_HASH(id, hash);
1465 *hashno = hash;
1466 hq = &cip->table[hash];
1514 * cache, and inserted. The hash queue number is obtained from hash_number
1522 uint_t hash_number) /* hash number iff hint */
1532 * Obtain correct hash queue to insert new entry in