Lines Matching defs:tree
15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd)
19 fd->tree = tree;
21 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL);
25 fd->key = ptr + tree->max_key_len + 2;
27 tree->cnid, __builtin_return_address(0));
28 switch (tree->cnid) {
30 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX);
33 mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX);
36 mutex_lock_nested(&tree->tree_lock, ATTR_BTREE_MUTEX);
49 fd->tree->cnid, __builtin_return_address(0));
50 mutex_unlock(&fd->tree->tree_lock);
51 fd->tree = NULL;
63 if (bnode->tree->cnid == HFSPLUS_EXT_CNID) {
66 } else if (bnode->tree->cnid == HFSPLUS_CAT_CNID) {
69 } else if (bnode->tree->cnid == HFSPLUS_ATTR_CNID) {
100 cmpval = bnode->tree->keycmp(fd->key, fd->search_key);
166 struct hfs_btree *tree;
172 tree = fd->tree;
176 nidx = tree->root;
179 height = tree->depth;
183 bnode = hfs_bnode_find(tree, nidx);
233 struct hfs_btree *tree;
239 tree = bnode->tree;
252 bnode = hfs_bnode_find(tree, idx);
270 bnode = hfs_bnode_find(tree, idx);