Lines Matching refs:tree
22 struct hfs_btree *tree;
29 tree = kzalloc(sizeof(*tree), GFP_KERNEL);
30 if (!tree)
33 init_MUTEX(&tree->tree_lock);
34 spin_lock_init(&tree->hash_lock);
35 tree->sb = sb;
36 tree->cnid = id;
40 tree->inode = inode;
42 mapping = tree->inode->i_mapping;
49 tree->root = be32_to_cpu(head->root);
50 tree->leaf_count = be32_to_cpu(head->leaf_count);
51 tree->leaf_head = be32_to_cpu(head->leaf_head);
52 tree->leaf_tail = be32_to_cpu(head->leaf_tail);
53 tree->node_count = be32_to_cpu(head->node_count);
54 tree->free_nodes = be32_to_cpu(head->free_nodes);
55 tree->attributes = be32_to_cpu(head->attributes);
56 tree->node_size = be16_to_cpu(head->node_size);
57 tree->max_key_len = be16_to_cpu(head->max_key_len);
58 tree->depth = be16_to_cpu(head->depth);
62 tree->keycmp = hfsplus_ext_cmp_key;
66 tree->keycmp = hfsplus_cat_bin_cmp_key;
68 tree->keycmp = hfsplus_cat_case_cmp_key;
76 size = tree->node_size;
79 if (!tree->node_count)
81 tree->node_size_shift = ffs(size) - 1;
83 tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
87 return tree;
90 tree->inode->i_mapping->a_ops = &hfsplus_aops;
93 iput(tree->inode);
94 kfree(tree);
99 void hfs_btree_close(struct hfs_btree *tree)
104 if (!tree)
108 while ((node = tree->node_hash[i])) {
109 tree->node_hash[i] = node->next_hash;
112 node->tree->cnid, node->this, atomic_read(&node->refcnt));
114 tree->node_hash_cnt--;
117 iput(tree->inode);
118 kfree(tree);
121 void hfs_btree_write(struct hfs_btree *tree)
127 node = hfs_bnode_find(tree, 0);
135 head->root = cpu_to_be32(tree->root);
136 head->leaf_count = cpu_to_be32(tree->leaf_count);
137 head->leaf_head = cpu_to_be32(tree->leaf_head);
138 head->leaf_tail = cpu_to_be32(tree->leaf_tail);
139 head->node_count = cpu_to_be32(tree->node_count);
140 head->free_nodes = cpu_to_be32(tree->free_nodes);
141 head->attributes = cpu_to_be32(tree->attributes);
142 head->depth = cpu_to_be16(tree->depth);
151 struct hfs_btree *tree = prev->tree;
156 node = hfs_bnode_create(tree, idx);
160 tree->free_nodes--;
167 hfs_bnode_clear(node, 0, tree->node_size);
176 hfs_bnode_write_u16(node, tree->node_size - 2, 14);
177 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
182 struct hfs_bnode *hfs_bmap_alloc(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(tree, nidx);
241 tree->free_nodes--;
242 mark_inode_dirty(tree->inode);
244 return hfs_bnode_create(tree, idx);
262 next_node = hfs_bnode_find(tree, nidx);
279 struct hfs_btree *tree;
287 tree = node->tree;
289 node = hfs_bnode_find(tree, 0);
304 node = hfs_bnode_find(tree, i);
331 tree->free_nodes++;
332 mark_inode_dirty(tree->inode);