Lines Matching refs:tree

30 		if (pagenum >= node->tree->pages_per_bnode)  in hfs_bnode_read()
60 struct hfs_btree *tree; in hfs_bnode_read_key() local
63 tree = node->tree; in hfs_bnode_read_key()
65 tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_read_key()
68 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
154 off = node->tree->node_size - 2; in hfs_bnode_dump()
161 if (node->tree->attributes & HFS_TREE_VARIDXKEYS) in hfs_bnode_dump()
164 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
181 struct hfs_btree *tree; in hfs_bnode_unlink() local
185 tree = node->tree; in hfs_bnode_unlink()
187 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
195 tree->leaf_head = node->next; in hfs_bnode_unlink()
198 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
206 tree->leaf_tail = node->prev; in hfs_bnode_unlink()
213 tree->root = 0; in hfs_bnode_unlink()
214 tree->depth = 0; in hfs_bnode_unlink()
226 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) in hfs_bnode_findhash() argument
230 if (cnid >= tree->node_count) { in hfs_bnode_findhash()
235 for (node = tree->node_hash[hfs_bnode_hash(cnid)]; in hfs_bnode_findhash()
244 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid) in __hfs_bnode_create() argument
252 if (cnid >= tree->node_count) { in __hfs_bnode_create()
257 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode * in __hfs_bnode_create()
262 node->tree = tree; in __hfs_bnode_create()
267 node->tree->cnid, node->this); in __hfs_bnode_create()
269 spin_lock(&tree->hash_lock); in __hfs_bnode_create()
270 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
273 node->next_hash = tree->node_hash[hash]; in __hfs_bnode_create()
274 tree->node_hash[hash] = node; in __hfs_bnode_create()
275 tree->node_hash_cnt++; in __hfs_bnode_create()
278 spin_unlock(&tree->hash_lock); in __hfs_bnode_create()
283 spin_unlock(&tree->hash_lock); in __hfs_bnode_create()
285 mapping = tree->inode->i_mapping; in __hfs_bnode_create()
286 off = (loff_t)cnid * tree->node_size; in __hfs_bnode_create()
289 for (i = 0; i < tree->pages_per_bnode; i++) { in __hfs_bnode_create()
307 node->tree->cnid, node->this, atomic_read(&node->refcnt)); in hfs_bnode_unhash()
308 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)]; in hfs_bnode_unhash()
313 node->tree->node_hash_cnt--; in hfs_bnode_unhash()
317 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() argument
324 spin_lock(&tree->hash_lock); in hfs_bnode_find()
325 node = hfs_bnode_findhash(tree, num); in hfs_bnode_find()
328 spin_unlock(&tree->hash_lock); in hfs_bnode_find()
334 spin_unlock(&tree->hash_lock); in hfs_bnode_find()
335 node = __hfs_bnode_create(tree, num); in hfs_bnode_find()
363 if (node->height <= 1 || node->height > tree->depth) in hfs_bnode_find()
370 rec_off = tree->node_size - 2; in hfs_bnode_find()
378 next_off > tree->node_size || in hfs_bnode_find()
405 for (i = 0; i < node->tree->pages_per_bnode; i++) in hfs_bnode_free()
411 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num) in hfs_bnode_create() argument
417 spin_lock(&tree->hash_lock); in hfs_bnode_create()
418 node = hfs_bnode_findhash(tree, num); in hfs_bnode_create()
419 spin_unlock(&tree->hash_lock); in hfs_bnode_create()
425 node = __hfs_bnode_create(tree, num); in hfs_bnode_create()
435 min((int)PAGE_SIZE, (int)tree->node_size)); in hfs_bnode_create()
437 for (i = 1; i < tree->pages_per_bnode; i++) { in hfs_bnode_create()
452 node->tree->cnid, node->this, in hfs_bnode_get()
461 struct hfs_btree *tree = node->tree; in hfs_bnode_put() local
465 node->tree->cnid, node->this, in hfs_bnode_put()
468 if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock)) in hfs_bnode_put()
470 for (i = 0; i < tree->pages_per_bnode; i++) { in hfs_bnode_put()
478 spin_unlock(&tree->hash_lock); in hfs_bnode_put()
483 spin_unlock(&tree->hash_lock); in hfs_bnode_put()