Lines Matching refs:tree
14 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd)
18 fd->tree = tree;
20 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL);
24 fd->key = ptr + tree->max_key_len + 2;
25 dprint(DBG_BNODE_REFS, "find_init: %d (%p)\n", tree->cnid, __builtin_return_address(0));
26 down(&tree->tree_lock);
34 dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0));
35 up(&fd->tree->tree_lock);
36 fd->tree = NULL;
39 int hfsplus_journalled_find_init(struct hfs_btree *tree, struct hfs_find_data *fd)
43 fd->tree = tree;
45 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL);
49 fd->key = ptr + tree->max_key_len + 2;
50 dprint(DBG_BNODE_REFS, "find_init: %d (%p)\n", tree->cnid, __builtin_return_address(0));
58 dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0));
59 fd->tree = NULL;
79 cmpval = bnode->tree->keycmp(fd->key, fd->search_key);
108 struct hfs_btree *tree;
114 tree = fd->tree;
118 nidx = tree->root;
121 height = tree->depth;
125 bnode = hfs_bnode_find(hfsplus_handle, tree, nidx);
175 struct hfs_btree *tree;
181 tree = bnode->tree;
194 bnode = hfs_bnode_find(hfsplus_handle, tree, idx);
212 bnode = hfs_bnode_find(hfsplus_handle, tree, idx);