86 	__le32 hash;  member
130 	u32 hash;  member
157 static void dx_insert_block (struct dx_frame *frame, u32 hash, u32 block);
158 static int ext3_htree_next_block(struct inode *dir, __u32 hash,
195 	return le32_to_cpu(entry->hash);  in dx_get_hash()
200 	entry->hash = cpu_to_le32(value);  in dx_set_hash()
276 				printk(":%x.%u ", h.hash,  in dx_show_leaf()
299 		u32 block = dx_get_block(entries), hash = i? dx_get_hash(entries): 0;  in dx_show_entries()  local
300 		u32 range = i < count - 1? (dx_get_hash(entries + 1) - hash): ~hash;  in dx_show_entries()
302 		printk("%s%3u:%03u hash %8x/%8x ",levels?"":"   ", i, block, hash, range);  in dx_show_entries()
337 	u32 hash;  in dx_probe()  local
361 	hash = hinfo->hash;  in dx_probe()
393 	dxtrace (printk("Look up %x", hash));  in dx_probe()
411 			if (dx_get_hash(m) > hash)  in dx_probe()
424 				if (dx_get_hash(++at) > hash)  in dx_probe()
494 static int ext3_htree_next_block(struct inode *dir, __u32 hash,  in ext3_htree_next_block()  argument
531 	if ((hash & 1) == 0) {  in ext3_htree_next_block()
532 		if ((bhash & ~1) != hash)  in ext3_htree_next_block()
583 		if ((hinfo->hash < start_hash) ||  in htree_dirblock_to_tree()
584 		    ((hinfo->hash == start_hash) &&  in htree_dirblock_to_tree()
590 				   hinfo->hash, hinfo->minor_hash, de)) != 0) {  in htree_dirblock_to_tree()
635 	hinfo.hash = start_hash;  in ext3_htree_fill_tree()
712 			map_tail->hash = h.hash;  in dx_make_map()
736                         if (p->hash < q->hash)  in dx_sort_map()
745                         if (q[1].hash >= q[0].hash)  in dx_sort_map()
753 static void dx_insert_block(struct dx_frame *frame, u32 hash, u32 block)  in dx_insert_block()  argument
762 	dx_set_hash(new, hash);  in dx_insert_block()
996 		retval = ext3_htree_next_block(dir, hinfo.hash, frame,  in ext3_dx_find_entry()
1190 	hash2 = map[split].hash;  in do_split()
1191 	continued = hash2 == map[split - 1].hash;  in do_split()
1204 	if (hinfo->hash >= hash2)  in do_split()