Lines Matching refs:tree
21 struct hfs_btree *tree;
27 tree = kzalloc(sizeof(*tree), GFP_KERNEL);
28 if (!tree)
31 mutex_init(&tree->tree_lock);
32 spin_lock_init(&tree->hash_lock);
34 tree->sb = sb;
35 tree->cnid = id;
36 tree->keycmp = keycmp;
38 tree->inode = iget_locked(sb, id);
39 if (!tree->inode)
41 BUG_ON(!(tree->inode->i_state & I_NEW));
44 HFS_I(tree->inode)->flags = 0;
45 mutex_init(&HFS_I(tree->inode)->extents_lock);
48 hfs_inode_read_fork(tree->inode, mdb->drXTExtRec, mdb->drXTFlSize,
50 if (HFS_I(tree->inode)->alloc_blocks >
51 HFS_I(tree->inode)->first_blocks) {
53 unlock_new_inode(tree->inode);
57 tree->inode->i_mapping->a_ops = &hfs_btree_aops;
60 hfs_inode_read_fork(tree->inode, mdb->drCTExtRec, mdb->drCTFlSize,
63 if (!HFS_I(tree->inode)->first_blocks) {
65 unlock_new_inode(tree->inode);
69 tree->inode->i_mapping->a_ops = &hfs_btree_aops;
75 unlock_new_inode(tree->inode);
77 mapping = tree->inode->i_mapping;
84 tree->root = be32_to_cpu(head->root);
85 tree->leaf_count = be32_to_cpu(head->leaf_count);
86 tree->leaf_head = be32_to_cpu(head->leaf_head);
87 tree->leaf_tail = be32_to_cpu(head->leaf_tail);
88 tree->node_count = be32_to_cpu(head->node_count);
89 tree->free_nodes = be32_to_cpu(head->free_nodes);
90 tree->attributes = be32_to_cpu(head->attributes);
91 tree->node_size = be16_to_cpu(head->node_size);
92 tree->max_key_len = be16_to_cpu(head->max_key_len);
93 tree->depth = be16_to_cpu(head->depth);
95 size = tree->node_size;
98 if (!tree->node_count)
102 if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) {
104 tree->max_key_len);
109 if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) {
111 tree->max_key_len);
119 tree->node_size_shift = ffs(size) - 1;
120 tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
124 return tree;
129 tree->inode->i_mapping->a_ops = &hfs_aops;
130 iput(tree->inode);
132 kfree(tree);
137 void hfs_btree_close(struct hfs_btree *tree)
142 if (!tree)
146 while ((node = tree->node_hash[i])) {
147 tree->node_hash[i] = node->next_hash;
150 node->tree->cnid, node->this,
153 tree->node_hash_cnt--;
156 iput(tree->inode);
157 kfree(tree);
160 void hfs_btree_write(struct hfs_btree *tree)
166 node = hfs_bnode_find(tree, 0);
174 head->root = cpu_to_be32(tree->root);
175 head->leaf_count = cpu_to_be32(tree->leaf_count);
176 head->leaf_head = cpu_to_be32(tree->leaf_head);
177 head->leaf_tail = cpu_to_be32(tree->leaf_tail);
178 head->node_count = cpu_to_be32(tree->node_count);
179 head->free_nodes = cpu_to_be32(tree->free_nodes);
180 head->attributes = cpu_to_be32(tree->attributes);
181 head->depth = cpu_to_be16(tree->depth);
190 struct hfs_btree *tree = prev->tree;
195 node = hfs_bnode_create(tree, idx);
199 if (!tree->free_nodes)
201 tree->free_nodes--;
208 hfs_bnode_clear(node, 0, tree->node_size);
217 hfs_bnode_write_u16(node, tree->node_size - 2, 14);
218 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
223 /* Make sure @tree has enough space for the @rsvd_nodes */
224 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes)
226 struct inode *inode = tree->inode;
230 while (tree->free_nodes < rsvd_nodes) {
236 HFS_SB(tree->sb)->alloc_blksz;
238 tree->sb->s_blocksize_bits;
240 count = inode->i_size >> tree->node_size_shift;
241 tree->free_nodes += count - tree->node_count;
242 tree->node_count = count;
247 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
258 res = hfs_bmap_reserve(tree, 1);
263 node = hfs_bnode_find(tree, nidx);
285 tree->free_nodes--;
286 mark_inode_dirty(tree->inode);
288 return hfs_bnode_create(tree, idx);
306 next_node = hfs_bnode_find(tree, nidx);
323 struct hfs_btree *tree;
330 tree = node->tree;
332 node = hfs_bnode_find(tree, 0);
349 node = hfs_bnode_find(tree, i);
378 tree->free_nodes++;
379 mark_inode_dirty(tree->inode);