99 	__le32 hash;  member
143 	u32 hash;  member
171 					u32 hash, ext4_lblk_t block);
172 static int ext4_htree_next_block(struct inode *dir, __u32 hash,
210 	return le32_to_cpu(entry->hash);  in dx_get_hash()
215 	entry->hash = cpu_to_le32(value);  in dx_set_hash()
291 				printk(":%x.%u ", h.hash,  in dx_show_leaf()
315 		ext4_lblk_t hash  = i ? dx_get_hash(entries): 0;  in dx_show_entries()  local
316 		u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;  in dx_show_entries()
318 		printk("%s%3u:%03u hash %8x/%8x ",levels?"":"   ", i, block, hash, range);  in dx_show_entries()
354 	u32 hash;  in dx_probe()  local
376 	hash = hinfo->hash;  in dx_probe()
408 	dxtrace(printk("Look up %x", hash));  in dx_probe()
426 			if (dx_get_hash(m) > hash)  in dx_probe()
439 				if (dx_get_hash(++at) > hash)  in dx_probe()
507 static int ext4_htree_next_block(struct inode *dir, __u32 hash,  in ext4_htree_next_block()  argument
544 	if ((hash & 1) == 0) {  in ext4_htree_next_block()
545 		if ((bhash & ~1) != hash)  in ext4_htree_next_block()
599 		if ((hinfo->hash < start_hash) ||  in htree_dirblock_to_tree()
600 		    ((hinfo->hash == start_hash) &&  in htree_dirblock_to_tree()
606 				   hinfo->hash, hinfo->minor_hash, de)) != 0) {  in htree_dirblock_to_tree()
651 	hinfo.hash = start_hash;  in ext4_htree_fill_tree()
728 			map_tail->hash = h.hash;  in dx_make_map()
751 			if (p->hash < q->hash)  in dx_sort_map()
759 			if (q[1].hash >= q[0].hash)  in dx_sort_map()
767 static void dx_insert_block(struct dx_frame *frame, u32 hash, ext4_lblk_t block)  in dx_insert_block()  argument
776 	dx_set_hash(new, hash);  in dx_insert_block()
971 	u32 hash;  in ext4_dx_find_entry()  local
991 	hash = hinfo.hash;  in ext4_dx_find_entry()
1017 		retval = ext4_htree_next_block(dir, hash, frame,  in ext4_dx_find_entry()
1211 	hash2 = map[split].hash;  in do_split()
1212 	continued = hash2 == map[split - 1].hash;  in do_split()
1226 	if (hinfo->hash >= hash2)  in do_split()