Lines Matching refs:tree
61 struct hfs_btree *tree;
64 tree = node->tree;
66 tree->attributes & HFS_TREE_VARIDXKEYS ||
67 node->tree->cnid == HFSPLUS_ATTR_CNID)
70 key_len = tree->max_key_len + 2;
310 off = node->tree->node_size - 2;
317 if (node->tree->attributes & HFS_TREE_VARIDXKEYS ||
318 node->tree->cnid == HFSPLUS_ATTR_CNID)
321 tmp = node->tree->max_key_len + 2;
337 struct hfs_btree *tree;
341 tree = node->tree;
343 tmp = hfs_bnode_find(tree, node->prev);
352 tree->leaf_head = node->next;
355 tmp = hfs_bnode_find(tree, node->next);
364 tree->leaf_tail = node->prev;
370 tree->root = 0;
371 tree->depth = 0;
383 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
387 if (cnid >= tree->node_count) {
393 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
400 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
408 if (cnid >= tree->node_count) {
414 size = sizeof(struct hfs_bnode) + tree->pages_per_bnode *
419 node->tree = tree;
424 node->tree->cnid, node->this);
426 spin_lock(&tree->hash_lock);
427 node2 = hfs_bnode_findhash(tree, cnid);
430 node->next_hash = tree->node_hash[hash];
431 tree->node_hash[hash] = node;
432 tree->node_hash_cnt++;
434 spin_unlock(&tree->hash_lock);
440 spin_unlock(&tree->hash_lock);
442 mapping = tree->inode->i_mapping;
443 off = (loff_t)cnid << tree->node_size_shift;
446 for (i = 0; i < tree->pages_per_bnode; block++, i++) {
468 node->tree->cnid, node->this, atomic_read(&node->refcnt));
469 for (p = &node->tree->node_hash[hfs_bnode_hash(node->this)];
474 node->tree->node_hash_cnt--;
477 /* Load a particular node out of a tree */
478 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num)
485 spin_lock(&tree->hash_lock);
486 node = hfs_bnode_findhash(tree, num);
489 spin_unlock(&tree->hash_lock);
496 spin_unlock(&tree->hash_lock);
497 node = __hfs_bnode_create(tree, num);
525 if (node->height <= 1 || node->height > tree->depth)
532 rec_off = tree->node_size - 2;
540 next_off > tree->node_size ||
567 for (i = 0; i < node->tree->pages_per_bnode; i++)
573 struct hfs_bnode *hfs_bnode_create(struct hfs_btree *tree, u32 num)
579 spin_lock(&tree->hash_lock);
580 node = hfs_bnode_findhash(tree, num);
581 spin_unlock(&tree->hash_lock);
587 node = __hfs_bnode_create(tree, num);
597 min_t(int, PAGE_SIZE, tree->node_size));
600 for (i = 1; i < tree->pages_per_bnode; i++) {
616 node->tree->cnid, node->this,
625 struct hfs_btree *tree = node->tree;
629 node->tree->cnid, node->this,
632 if (!atomic_dec_and_lock(&node->refcnt, &tree->hash_lock))
634 for (i = 0; i < tree->pages_per_bnode; i++) {
642 spin_unlock(&tree->hash_lock);
643 if (hfs_bnode_need_zeroout(tree))
644 hfs_bnode_clear(node, 0, tree->node_size);
649 spin_unlock(&tree->hash_lock);
654 * Unused nodes have to be zeroed if this is the catalog tree and
657 bool hfs_bnode_need_zeroout(struct hfs_btree *tree)
659 struct super_block *sb = tree->inode->i_sb;
663 return tree->cnid == HFSPLUS_CAT_CNID &&