14 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd)  in hfs_find_init()  argument
18 	fd->tree = tree;  in hfs_find_init()
20 	ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL);  in hfs_find_init()
24 	fd->key = ptr + tree->max_key_len + 2;  in hfs_find_init()
25 	dprint(DBG_BNODE_REFS, "find_init: %d (%p)\n", tree->cnid, __builtin_return_address(0));  in hfs_find_init()
26 	mutex_lock(&tree->tree_lock);  in hfs_find_init()
34 	dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0));  in hfs_find_exit()
35 	mutex_unlock(&fd->tree->tree_lock);  in hfs_find_exit()
36 	fd->tree = NULL;  in hfs_find_exit()
60 		cmpval = bnode->tree->keycmp(fd->key, fd->search_key);  in __hfs_brec_find()
90 /* Traverse a B*Tree from the root to a leaf finding best fit to key */
94 	struct hfs_btree *tree;  in hfs_brec_find()  local
100 	tree = fd->tree;  in hfs_brec_find()
104 	nidx = tree->root;  in hfs_brec_find()
107 	height = tree->depth;  in hfs_brec_find()
111 		bnode = hfs_bnode_find(tree, nidx);  in hfs_brec_find()
138 	printk(KERN_ERR "hfs: inconsistency in B*Tree (%d,%d,%d,%u,%u)\n",  in hfs_brec_find()
161 	struct hfs_btree *tree;  in hfs_brec_goto()  local
167 	tree = bnode->tree;  in hfs_brec_goto()
180 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
198 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()