Lines Matching full:tree
15 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) in hfs_find_init() argument
19 if (!tree) in hfs_find_init()
21 fd->tree = tree; in hfs_find_init()
23 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
27 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
29 tree->cnid, __builtin_return_address(0)); in hfs_find_init()
30 switch (tree->cnid) { in hfs_find_init()
32 mutex_lock_nested(&tree->tree_lock, CATALOG_BTREE_MUTEX); in hfs_find_init()
35 mutex_lock_nested(&tree->tree_lock, EXTENTS_BTREE_MUTEX); in hfs_find_init()
38 mutex_lock_nested(&tree->tree_lock, ATTR_BTREE_MUTEX); in hfs_find_init()
51 fd->tree->cnid, __builtin_return_address(0)); in hfs_find_exit()
52 mutex_unlock(&fd->tree->tree_lock); in hfs_find_exit()
53 fd->tree = NULL; in hfs_find_exit()
77 cmpval = bnode->tree->keycmp(fd->key, fd->search_key); in __hfs_brec_find()
107 /* Traverse a B*Tree from the root to a leaf finding best fit to key */
111 struct hfs_btree *tree; in hfs_brec_find() local
117 tree = fd->tree; in hfs_brec_find()
121 nidx = tree->root; in hfs_brec_find()
124 height = tree->depth; in hfs_brec_find()
128 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
155 pr_err("inconsistency in B*Tree (%d,%d,%d,%u,%u)\n", in hfs_brec_find()
178 struct hfs_btree *tree; in hfs_brec_goto() local
184 tree = bnode->tree; in hfs_brec_goto()
197 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
215 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()