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)
40 mapping = tree->inode->i_mapping;
47 tree->root = be32_to_cpu(head->root);
48 tree->leaf_count = be32_to_cpu(head->leaf_count);
49 tree->leaf_head = be32_to_cpu(head->leaf_head);
50 tree->leaf_tail = be32_to_cpu(head->leaf_tail);
51 tree->node_count = be32_to_cpu(head->node_count);
52 tree->free_nodes = be32_to_cpu(head->free_nodes);
53 tree->attributes = be32_to_cpu(head->attributes);
54 tree->node_size = be16_to_cpu(head->node_size);
55 tree->max_key_len = be16_to_cpu(head->max_key_len);
56 tree->depth = be16_to_cpu(head->depth);
60 tree->keycmp = hfsplus_ext_cmp_key;
64 tree->keycmp = hfsplus_cat_bin_cmp_key;
66 tree->keycmp = hfsplus_cat_case_cmp_key;
72 size = tree->node_size;
75 if (!tree->node_count)
77 tree->node_size_shift = ffs(size) - 1;
79 tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
83 return tree;
86 tree->inode->i_mapping->a_ops = &hfsplus_aops;
89 iput(tree->inode);
90 kfree(tree);
95 void hfs_btree_close(struct hfs_btree *tree)
100 if (!tree)
104 while ((node = tree->node_hash[i])) {
105 tree->node_hash[i] = node->next_hash;
108 node->tree->cnid, node->this, atomic_read(&node->refcnt));
110 tree->node_hash_cnt--;
113 iput(tree->inode);
114 kfree(tree);
117 void hfs_btree_write(struct hfs_btree *tree)
123 node = hfs_bnode_find(tree, 0);
131 head->root = cpu_to_be32(tree->root);
132 head->leaf_count = cpu_to_be32(tree->leaf_count);
133 head->leaf_head = cpu_to_be32(tree->leaf_head);
134 head->leaf_tail = cpu_to_be32(tree->leaf_tail);
135 head->node_count = cpu_to_be32(tree->node_count);
136 head->free_nodes = cpu_to_be32(tree->free_nodes);
137 head->attributes = cpu_to_be32(tree->attributes);
138 head->depth = cpu_to_be16(tree->depth);
147 struct hfs_btree *tree = prev->tree;
152 node = hfs_bnode_create(tree, idx);
156 tree->free_nodes--;
163 hfs_bnode_clear(node, 0, tree->node_size);
172 hfs_bnode_write_u16(node, tree->node_size - 2, 14);
173 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
178 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
187 while (!tree->free_nodes) {
188 struct inode *inode = tree->inode;
197 HFSPLUS_SB(tree->sb).alloc_blksz_shift;
199 HFSPLUS_SB(tree->sb).fs_shift;
207 count = inode->i_size >> tree->node_size_shift;
208 tree->free_nodes = count - tree->node_count;
209 tree->node_count = count;
213 node = hfs_bnode_find(tree, nidx);
234 tree->free_nodes--;
235 mark_inode_dirty(tree->inode);
237 return hfs_bnode_create(tree, idx);
255 next_node = hfs_bnode_find(tree, nidx);
271 struct hfs_btree *tree;
279 tree = node->tree;
281 node = hfs_bnode_find(tree, 0);
296 node = hfs_bnode_find(tree, i);
323 tree->free_nodes++;
324 mark_inode_dirty(tree->inode);