Lines Matching refs:tree
19 struct hfs_btree *tree;
25 tree = kzalloc(sizeof(*tree), GFP_KERNEL);
26 if (!tree)
29 init_MUTEX(&tree->tree_lock);
30 spin_lock_init(&tree->hash_lock);
32 tree->sb = sb;
33 tree->cnid = id;
34 tree->keycmp = keycmp;
36 tree->inode = iget_locked(sb, id);
37 if (!tree->inode)
39 BUG_ON(!(tree->inode->i_state & I_NEW));
42 HFS_I(tree->inode)->flags = 0;
43 init_MUTEX(&HFS_I(tree->inode)->extents_lock);
46 hfs_inode_read_fork(tree->inode, mdb->drXTExtRec, mdb->drXTFlSize,
48 tree->inode->i_mapping->a_ops = &hfs_btree_aops;
51 hfs_inode_read_fork(tree->inode, mdb->drCTExtRec, mdb->drCTFlSize,
53 tree->inode->i_mapping->a_ops = &hfs_btree_aops;
59 unlock_new_inode(tree->inode);
61 mapping = tree->inode->i_mapping;
68 tree->root = be32_to_cpu(head->root);
69 tree->leaf_count = be32_to_cpu(head->leaf_count);
70 tree->leaf_head = be32_to_cpu(head->leaf_head);
71 tree->leaf_tail = be32_to_cpu(head->leaf_tail);
72 tree->node_count = be32_to_cpu(head->node_count);
73 tree->free_nodes = be32_to_cpu(head->free_nodes);
74 tree->attributes = be32_to_cpu(head->attributes);
75 tree->node_size = be16_to_cpu(head->node_size);
76 tree->max_key_len = be16_to_cpu(head->max_key_len);
77 tree->depth = be16_to_cpu(head->depth);
79 size = tree->node_size;
82 if (!tree->node_count)
84 tree->node_size_shift = ffs(size) - 1;
85 tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
89 return tree;
92 tree->inode->i_mapping->a_ops = &hfs_aops;
95 iput(tree->inode);
96 kfree(tree);
101 void hfs_btree_close(struct hfs_btree *tree)
106 if (!tree)
110 while ((node = tree->node_hash[i])) {
111 tree->node_hash[i] = node->next_hash;
114 node->tree->cnid, node->this, atomic_read(&node->refcnt));
116 tree->node_hash_cnt--;
119 iput(tree->inode);
120 kfree(tree);
123 void hfs_btree_write(struct hfs_btree *tree)
129 node = hfs_bnode_find(tree, 0);
137 head->root = cpu_to_be32(tree->root);
138 head->leaf_count = cpu_to_be32(tree->leaf_count);
139 head->leaf_head = cpu_to_be32(tree->leaf_head);
140 head->leaf_tail = cpu_to_be32(tree->leaf_tail);
141 head->node_count = cpu_to_be32(tree->node_count);
142 head->free_nodes = cpu_to_be32(tree->free_nodes);
143 head->attributes = cpu_to_be32(tree->attributes);
144 head->depth = cpu_to_be16(tree->depth);
153 struct hfs_btree *tree = prev->tree;
158 node = hfs_bnode_create(tree, idx);
162 if (!tree->free_nodes)
164 tree->free_nodes--;
171 hfs_bnode_clear(node, 0, tree->node_size);
180 hfs_bnode_write_u16(node, tree->node_size - 2, 14);
181 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
186 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
195 while (!tree->free_nodes) {
196 struct inode *inode = tree->inode;
205 HFS_SB(tree->sb)->alloc_blksz;
207 tree->sb->s_blocksize_bits;
215 count = inode->i_size >> tree->node_size_shift;
216 tree->free_nodes = count - tree->node_count;
217 tree->node_count = count;
221 node = hfs_bnode_find(tree, nidx);
242 tree->free_nodes--;
243 mark_inode_dirty(tree->inode);
245 return hfs_bnode_create(tree, idx);
263 next_node = hfs_bnode_find(tree, nidx);
279 struct hfs_btree *tree;
286 tree = node->tree;
288 node = hfs_bnode_find(tree, 0);
303 node = hfs_bnode_find(tree, i);
330 tree->free_nodes++;
331 mark_inode_dirty(tree->inode);