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 	down(&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 	up(&fd->tree->tree_lock);  in hfs_find_exit()
36 	fd->tree = NULL;  in hfs_find_exit()
56 		cmpval = bnode->tree->keycmp(fd->key, fd->search_key);  in __hfs_brec_find()
85 	struct hfs_btree *tree;  in hfs_brec_find()  local
91 	tree = fd->tree;  in hfs_brec_find()
95 	nidx = tree->root;  in hfs_brec_find()
98 	height = tree->depth;  in hfs_brec_find()
102 		bnode = hfs_bnode_find(tree, nidx);  in hfs_brec_find()
152 	struct hfs_btree *tree;  in hfs_brec_goto()  local
158 	tree = bnode->tree;  in hfs_brec_goto()
171 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
189 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()