Lines Matching refs:tree
22 struct hfs_btree *tree;
28 tree = kzalloc(sizeof(*tree), GFP_KERNEL);
29 if (!tree)
32 init_MUTEX(&tree->tree_lock);
33 spin_lock_init(&tree->hash_lock);
34 tree->sb = sb;
35 tree->cnid = id;
36 tree->inode = iget(sb, id);
37 if (!tree->inode) {
42 mapping = tree->inode->i_mapping;
51 tree->root = be32_to_cpu(head->root);
52 tree->leaf_count = be32_to_cpu(head->leaf_count);
53 tree->leaf_head = be32_to_cpu(head->leaf_head);
54 tree->leaf_tail = be32_to_cpu(head->leaf_tail);
55 tree->node_count = be32_to_cpu(head->node_count);
56 tree->free_nodes = be32_to_cpu(head->free_nodes);
57 tree->attributes = be32_to_cpu(head->attributes);
58 tree->node_size = be16_to_cpu(head->node_size);
59 tree->max_key_len = be16_to_cpu(head->max_key_len);
60 tree->depth = be16_to_cpu(head->depth);
64 tree->keycmp = hfsplus_ext_cmp_key;
68 tree->keycmp = hfsplus_cat_bin_cmp_key;
70 tree->keycmp = hfsplus_cat_case_cmp_key;
76 size = tree->node_size;
79 if (!tree->node_count) {
83 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 = &hfsplus_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(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree)
129 node = hfs_bnode_find(hfsplus_handle, 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(hfsplus_handle, tree, idx);
162 tree->free_nodes--;
169 hfs_bnode_clear(hfsplus_handle, node, 0, tree->node_size);
178 hfs_bnode_write_u16(hfsplus_handle, node, tree->node_size - 2, 14);
179 hfs_bnode_write_u16(hfsplus_handle, node, tree->node_size - 4, tree->node_size - 6);
184 struct hfs_bnode *hfs_bmap_alloc(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree)
193 while (!tree->free_nodes) {
194 struct inode *inode = tree->inode;
203 HFSPLUS_SB(tree->sb).alloc_blksz_shift;
205 HFSPLUS_SB(tree->sb).fs_shift;
213 count = inode->i_size >> tree->node_size_shift;
214 tree->free_nodes = count - tree->node_count;
215 tree->node_count = count;
219 node = hfs_bnode_find(hfsplus_handle, tree, nidx);
240 tree->free_nodes--;
241 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))
244 return hfs_bnode_create(hfsplus_handle, tree, idx);
262 next_node = hfs_bnode_find(hfsplus_handle, tree, nidx);
278 struct hfs_btree *tree;
286 tree = node->tree;
288 node = hfs_bnode_find(hfsplus_handle, tree, 0);
303 node = hfs_bnode_find(hfsplus_handle, tree, i);
330 tree->free_nodes++;
331 if (hfsplus_journalled_mark_inode_dirty(__FUNCTION__, hfsplus_handle, tree->inode))