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()
26 		tree->cnid, __builtin_return_address(0));  in hfs_find_init()
27 	switch (tree->cnid) {  in hfs_find_init()
29 		mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX);  in hfs_find_init()
32 		mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX);  in hfs_find_init()
35 		mutex_lock_nested(&tree->tree_lock, ATTR_BTREE_MUTEX);  in hfs_find_init()
48 		fd->tree->cnid, __builtin_return_address(0));  in hfs_find_exit()
49 	mutex_unlock(&fd->tree->tree_lock);  in hfs_find_exit()
50 	fd->tree = NULL;  in hfs_find_exit()
62 	if (bnode->tree->cnid == HFSPLUS_EXT_CNID) {  in hfs_find_1st_rec_by_cnid()
65 	} else if (bnode->tree->cnid == HFSPLUS_CAT_CNID) {  in hfs_find_1st_rec_by_cnid()
68 	} else if (bnode->tree->cnid == HFSPLUS_ATTR_CNID) {  in hfs_find_1st_rec_by_cnid()
99 	cmpval = bnode->tree->keycmp(fd->key, fd->search_key);  in hfs_find_rec_by_key()
165 	struct hfs_btree *tree;  in hfs_brec_find()  local
171 	tree = fd->tree;  in hfs_brec_find()
175 	nidx = tree->root;  in hfs_brec_find()
178 	height = tree->depth;  in hfs_brec_find()
182 		bnode = hfs_bnode_find(tree, nidx);  in hfs_brec_find()
232 	struct hfs_btree *tree;  in hfs_brec_goto()  local
238 	tree = bnode->tree;  in hfs_brec_goto()
251 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()
269 			bnode = hfs_bnode_find(tree, idx);  in hfs_brec_goto()