Lines Matching full:hash
21 * 4KiB offset in case of inode node, and direntry hash in case of a direntry
22 * node. We use "r5" hash borrowed from reiserfs.
29 * key_mask_hash - mask a valid hash value.
32 * We use hash values as offset in directories, so values %0 and %1 are
36 static inline uint32_t key_mask_hash(uint32_t hash) in key_mask_hash() argument
38 hash &= UBIFS_S_KEY_HASH_MASK; in key_mask_hash()
39 if (unlikely(hash <= 2)) in key_mask_hash()
40 hash += 3; in key_mask_hash()
41 return hash; in key_mask_hash()
45 * key_r5_hash - R5 hash function (borrowed from reiserfs).
65 * key_test_hash - testing hash function.
144 uint32_t hash = c->key_hash(nm->name, nm->len); in dent_key_init() local
146 ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK)); in dent_key_init()
148 key->u32[1] = hash | (UBIFS_DENT_KEY << UBIFS_S_KEY_HASH_BITS); in dent_key_init()
153 * hash function.
157 * @hash: direntry name hash
161 uint32_t hash) in dent_key_init_hash() argument
163 ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK)); in dent_key_init_hash()
165 key->u32[1] = hash | (UBIFS_DENT_KEY << UBIFS_S_KEY_HASH_BITS); in dent_key_init_hash()
179 uint32_t hash = c->key_hash(nm->name, nm->len); in dent_key_init_flash() local
181 ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK)); in dent_key_init_flash()
183 key->j32[1] = cpu_to_le32(hash | in dent_key_init_flash()
212 uint32_t hash = c->key_hash(nm->name, nm->len); in xent_key_init() local
214 ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK)); in xent_key_init()
216 key->u32[1] = hash | (UBIFS_XENT_KEY << UBIFS_S_KEY_HASH_BITS); in xent_key_init()
230 uint32_t hash = c->key_hash(nm->name, nm->len); in xent_key_init_flash() local
232 ubifs_assert(!(hash & ~UBIFS_S_KEY_HASH_MASK)); in xent_key_init_flash()
234 key->j32[1] = cpu_to_le32(hash | in xent_key_init_flash()
358 * key_hash - get directory entry hash.
360 * @key: the key to get hash from
369 * key_hash_flash - get directory entry hash from an on-flash formatted key.
371 * @k: the key to get hash from
508 * is_hash_key - is a key vulnerable to hash collisions.