Lines Matching defs:hash
170 /* Check hash value order, count stale entries. */
654 * Look up the entry by hash value and name.
657 * But if there are dup hash values the index is of the first of those.
668 * See if there are any entries with the same hash value
670 * This is good because it puts multiple same-hash value entries
1208 * Look up name/hash in the leaf block.
1250 * Look for the first leaf entry with our hash value.
1254 * Loop over all the entries with the right hash value
1541 * one with this hash value, or if there are none, the insert point
1542 * for that hash value.
1549 xfs_dahash_t hash=0; /* hash from this entry */
1550 xfs_dahash_t hashwant; /* hash value looking for */
1561 * Binary search the leaf entries looking for our hash value.
1567 if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant)
1569 if (hash < hashwant)
1575 * Found one, back up through all the equal hash values.
1577 if (hash == hashwant) {
1585 else if (hash < hashwant)