Lines Matching refs:hash
236 __le32 hash;
242 * dirent the two low bits of the hash version will be zero. Therefore, the
243 * hash version mod 4 should never be 0. Sincerely, the paranoia department.
280 u32 hash;
318 u32 hash, ext4_lblk_t block);
319 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
580 return le32_to_cpu(entry->hash);
585 entry->hash = cpu_to_le32(value);
682 name, h.hash,
712 h.hash = EXT4_DIRENT_HASH(de);
718 h.hash, (unsigned) ((char *) de
728 printk("%*.s:%x.%u ", len, name, h.hash,
752 ext4_lblk_t hash = i ? dx_get_hash(entries): 0;
753 u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;
755 printk("%s%3u:%03u hash %8x/%8x ",levels?"":" ", i, block, hash, range);
780 u32 hash, unsigned int n)
784 if (dx_get_hash(++at) > hash) {
794 u32 hash, unsigned int n)
817 u32 hash;
831 ext4_warning_inode(dir, "Unrecognised inode hash code %u",
838 "Hash in dirent, but hash is not SIPHASH");
844 "Hash code is SIPHASH, but hash not in dirent");
854 /* hash is already computed for encrypted casefolded directory */
864 hash = hinfo->hash;
867 ext4_warning_inode(dir, "Unimplemented hash flags: %#06x",
896 dxtrace(printk("Look up %x", hash));
913 if (dx_get_hash(m) > hash)
919 htree_rep_invariant_check(entries, p, hash, count - 1);
993 * controlled by the hash parameter. If the hash value is even, then
995 * hash value. This is used if we are searching for a specific file.
997 * If the hash value is HASH_NB_ALWAYS, then always go to the next block.
1004 * hash of the next page.
1006 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
1034 * If the hash is 1, then continue only if the next page has a
1035 * continuation hash of any value. This is used for readdir
1036 * handling. Otherwise, check to see if the hash matches the
1037 * desired continuation hash. If it doesn't, return since
1043 if ((hash & 1) == 0) {
1044 if ((bhash & ~1) != hash)
1048 * If the hash is HASH_NB_ALWAYS, we always go to the next
1117 hinfo->hash = EXT4_DIRENT_HASH(de);
1120 hinfo->hash = 0;
1131 if ((hinfo->hash < start_hash) ||
1132 ((hinfo->hash == start_hash) &&
1141 hinfo->hash, hinfo->minor_hash, de,
1149 err = fscrypt_fname_disk_to_usr(dir, hinfo->hash,
1157 hinfo->hash, hinfo->minor_hash, de,
1176 * directory. We start scanning the directory in hash order, starting
1195 dxtrace(printk(KERN_DEBUG "In htree_fill_tree, start hash: %x:%x\n",
1224 hinfo.hash = start_hash;
1278 * next hash value is not a continuation
1286 "next hash: %x\n", count, *next_hash));
1308 * Create map of hash values, offsets, and sizes, stored at end of block.
1331 h.hash = EXT4_DIRENT_HASH(de);
1339 map_tail->hash = h.hash;
1351 /* Sort map by hash value */
1362 if (p->hash < q->hash)
1370 if (q[1].hash >= q[0].hash)
1378 static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block)
1387 dx_set_hash(new, hash);
1509 if (fname->hinfo.hash != EXT4_DIRENT_HASH(de) ||
1811 retval = ext4_htree_next_block(dir, fname->hinfo.hash, frame,
2046 hash2 = map[split].hash;
2047 continued = hash2 == map[split - 1].hash;
2073 if (hinfo->hash >= hash2) {
2156 EXT4_DIRENT_HASHES(de)->hash = cpu_to_le32(hinfo->hash);