Lines Matching defs:hash
50 * When a leaf is completely full, the size of the hash table can be
53 * but never before the maximum hash table size has been reached.
351 be32_to_cpu(dent->de_hash) == name->hash &&
423 * hash is correct for example, but that would take a lot of extra time.
768 index = name->hash >> (32 - ip->i_di.di_depth);
810 struct qstr name = { .name = "", .len = 0, .hash = 0 };
897 hash table. */
944 index = name->hash >> (32 - dip->i_di.di_depth);
969 /* Compute the start and len of leaf pointers in the hash table. */
1015 str.hash = be32_to_cpu(dent->de_hash);
1140 * compare_dents - compare directory entries by hash value
1144 * When comparing the hash entries of @a to @b:
1191 * Jump through some hoops to make sure that if there are hash collsions,
1352 * @offset: the hash of the last entry read shifted to the right once
1366 u32 hash, index;
1378 hash = gfs2_dir_offset2hash(*offset);
1379 index = hash >> (32 - dip->i_di.di_depth);
1520 index = name->hash >> (32 - ip->i_di.di_depth);
1814 * @index: the hash table offset in the directory