Lines Matching refs:tree
31 if (pagenum >= node->tree->pages_per_bnode)
63 struct hfs_btree *tree;
66 tree = node->tree;
68 tree->attributes & HFS_TREE_VARIDXKEYS)
71 key_len = tree->max_key_len + 1;
161 off = node->tree->node_size - 2;
168 if (node->tree->attributes & HFS_TREE_VARIDXKEYS)
171 tmp = node->tree->max_key_len + 1;
188 struct hfs_btree *tree;
192 tree = node->tree;
194 tmp = hfs_bnode_find(tree, node->prev);
202 tree->leaf_head = node->next;
205 tmp = hfs_bnode_find(tree, node->next);
213 tree->leaf_tail = node->prev;
220 tree->root = 0;
221 tree->depth = 0;
233 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
237 if (cnid >= tree->node_count) {
242 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
251 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
259 if (cnid >= tree->node_count) {
264 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
269 node->tree = tree;
274 node->tree->cnid, node->this);
276 spin_lock(&tree->hash_lock);
277 node2 = hfs_bnode_findhash(tree, cnid);
280 node->next_hash = tree->node_hash[hash];
281 tree->node_hash[hash] = node;
282 tree->node_hash_cnt++;
285 spin_unlock(&tree->hash_lock);
290 spin_unlock(&tree->hash_lock);
292 mapping = tree->inode->i_mapping;
293 off = (loff_t)cnid * tree->node_size;
296 for (i = 0; i < tree->pages_per_bnode; i++) {
318 node->tree->cnid, node->this, atomic_read(&node->refcnt));
319 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
324 node->tree->node_hash_cnt--;
327 /* Load a particular node out of a tree */
328 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)
335 spin_lock(&tree->hash_lock);
336 node = hfs_bnode_findhash(tree, num);
339 spin_unlock(&tree->hash_lock);
345 spin_unlock(&tree->hash_lock);
346 node = __hfs_bnode_create(tree, num);
373 if (node->height <= 1 || node->height > tree->depth)
380 rec_off = tree->node_size - 2;
388 next_off > tree->node_size ||
415 for (i = 0; i < node->tree->pages_per_bnode; i++)
421 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)
427 spin_lock(&tree->hash_lock);
428 node = hfs_bnode_findhash(tree, num);
429 spin_unlock(&tree->hash_lock);
435 node = __hfs_bnode_create(tree, num);
445 min((int)PAGE_SIZE, (int)tree->node_size));
448 for (i = 1; i < tree->pages_per_bnode; i++) {
464 node->tree->cnid, node->this,
473 struct hfs_btree *tree = node->tree;
477 node->tree->cnid, node->this,
480 if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
482 for (i = 0; i < tree->pages_per_bnode; i++) {
490 spin_unlock(&tree->hash_lock);
495 spin_unlock(&tree->hash_lock);