Lines Matching refs:tree
20 struct hfs_btree *tree;
26 tree = kzalloc(sizeof(*tree), GFP_KERNEL);
27 if (!tree)
30 init_MUTEX(&tree->tree_lock);
31 spin_lock_init(&tree->hash_lock);
33 tree->sb = sb;
34 tree->cnid = id;
35 tree->keycmp = keycmp;
37 tree->inode = iget_locked(sb, id);
38 if (!tree->inode)
40 BUG_ON(!(tree->inode->i_state & I_NEW));
43 HFS_I(tree->inode)->flags = 0;
44 mutex_init(&HFS_I(tree->inode)->extents_lock);
47 hfs_inode_read_fork(tree->inode, mdb->drXTExtRec, mdb->drXTFlSize,
49 tree->inode->i_mapping->a_ops = &hfs_btree_aops;
52 hfs_inode_read_fork(tree->inode, mdb->drCTExtRec, mdb->drCTFlSize,
54 tree->inode->i_mapping->a_ops = &hfs_btree_aops;
60 unlock_new_inode(tree->inode);
62 if (!HFS_I(tree->inode)->first_blocks) {
67 mapping = tree->inode->i_mapping;
74 tree->root = be32_to_cpu(head->root);
75 tree->leaf_count = be32_to_cpu(head->leaf_count);
76 tree->leaf_head = be32_to_cpu(head->leaf_head);
77 tree->leaf_tail = be32_to_cpu(head->leaf_tail);
78 tree->node_count = be32_to_cpu(head->node_count);
79 tree->free_nodes = be32_to_cpu(head->free_nodes);
80 tree->attributes = be32_to_cpu(head->attributes);
81 tree->node_size = be16_to_cpu(head->node_size);
82 tree->max_key_len = be16_to_cpu(head->max_key_len);
83 tree->depth = be16_to_cpu(head->depth);
85 size = tree->node_size;
88 if (!tree->node_count)
92 if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) {
94 tree->max_key_len);
99 if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) {
101 tree->max_key_len);
109 tree->node_size_shift = ffs(size) - 1;
110 tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
114 return tree;
119 tree->inode->i_mapping->a_ops = &hfs_aops;
120 iput(tree->inode);
122 kfree(tree);
127 void hfs_btree_close(struct hfs_btree *tree)
132 if (!tree)
136 while ((node = tree->node_hash[i])) {
137 tree->node_hash[i] = node->next_hash;
140 node->tree->cnid, node->this, atomic_read(&node->refcnt));
142 tree->node_hash_cnt--;
145 iput(tree->inode);
146 kfree(tree);
149 void hfs_btree_write(struct hfs_btree *tree)
155 node = hfs_bnode_find(tree, 0);
163 head->root = cpu_to_be32(tree->root);
164 head->leaf_count = cpu_to_be32(tree->leaf_count);
165 head->leaf_head = cpu_to_be32(tree->leaf_head);
166 head->leaf_tail = cpu_to_be32(tree->leaf_tail);
167 head->node_count = cpu_to_be32(tree->node_count);
168 head->free_nodes = cpu_to_be32(tree->free_nodes);
169 head->attributes = cpu_to_be32(tree->attributes);
170 head->depth = cpu_to_be16(tree->depth);
179 struct hfs_btree *tree = prev->tree;
184 node = hfs_bnode_create(tree, idx);
188 if (!tree->free_nodes)
190 tree->free_nodes--;
197 hfs_bnode_clear(node, 0, tree->node_size);
206 hfs_bnode_write_u16(node, tree->node_size - 2, 14);
207 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
212 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
223 while (!tree->free_nodes) {
224 struct inode *inode = tree->inode;
233 HFS_SB(tree->sb)->alloc_blksz;
235 tree->sb->s_blocksize_bits;
243 count = inode->i_size >> tree->node_size_shift;
244 tree->free_nodes = count - tree->node_count;
245 tree->node_count = count;
249 node = hfs_bnode_find(tree, nidx);
271 tree->free_nodes--;
272 mark_inode_dirty(tree->inode);
274 return hfs_bnode_create(tree, idx);
292 next_node = hfs_bnode_find(tree, nidx);
309 struct hfs_btree *tree;
316 tree = node->tree;
318 node = hfs_bnode_find(tree, 0);
333 node = hfs_bnode_find(tree, i);
360 tree->free_nodes++;
361 mark_inode_dirty(tree->inode);