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