22 	struct hfs_btree *tree;  in hfs_btree_open()  local
29 	tree = kzalloc(sizeof(*tree), GFP_KERNEL);  in hfs_btree_open()
30 	if (!tree)  in hfs_btree_open()
33 	init_MUTEX(&tree->tree_lock);  in hfs_btree_open()
34 	spin_lock_init(&tree->hash_lock);  in hfs_btree_open()
35 	tree->sb = sb;  in hfs_btree_open()
36 	tree->cnid = id;  in hfs_btree_open()
40 	tree->inode = inode;  in hfs_btree_open()
42 	mapping = tree->inode->i_mapping;  in hfs_btree_open()
49 	tree->root = be32_to_cpu(head->root);  in hfs_btree_open()
50 	tree->leaf_count = be32_to_cpu(head->leaf_count);  in hfs_btree_open()
51 	tree->leaf_head = be32_to_cpu(head->leaf_head);  in hfs_btree_open()
52 	tree->leaf_tail = be32_to_cpu(head->leaf_tail);  in hfs_btree_open()
53 	tree->node_count = be32_to_cpu(head->node_count);  in hfs_btree_open()
54 	tree->free_nodes = be32_to_cpu(head->free_nodes);  in hfs_btree_open()
55 	tree->attributes = be32_to_cpu(head->attributes);  in hfs_btree_open()
56 	tree->node_size = be16_to_cpu(head->node_size);  in hfs_btree_open()
57 	tree->max_key_len = be16_to_cpu(head->max_key_len);  in hfs_btree_open()
58 	tree->depth = be16_to_cpu(head->depth);  in hfs_btree_open()
62 		tree->keycmp = hfsplus_ext_cmp_key;  in hfs_btree_open()
66 			tree->keycmp = hfsplus_cat_bin_cmp_key;  in hfs_btree_open()
68 			tree->keycmp = hfsplus_cat_case_cmp_key;  in hfs_btree_open()
76 	size = tree->node_size;  in hfs_btree_open()
79 	if (!tree->node_count)  in hfs_btree_open()
81 	tree->node_size_shift = ffs(size) - 1;  in hfs_btree_open()
83 	tree->pages_per_bnode = (tree->node_size + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;  in hfs_btree_open()
87 	return tree;  in hfs_btree_open()
90 	tree->inode->i_mapping->a_ops = &hfsplus_aops;  in hfs_btree_open()
93 	iput(tree->inode);  in hfs_btree_open()
94 	kfree(tree);  in hfs_btree_open()
99 void hfs_btree_close(struct hfs_btree *tree)  in hfs_btree_close()  argument
104 	if (!tree)  in hfs_btree_close()
108 		while ((node = tree->node_hash[i])) {  in hfs_btree_close()
109 			tree->node_hash[i] = node->next_hash;  in hfs_btree_close()
112 					node->tree->cnid, node->this, atomic_read(&node->refcnt));  in hfs_btree_close()
114 			tree->node_hash_cnt--;  in hfs_btree_close()
117 	iput(tree->inode);  in hfs_btree_close()
118 	kfree(tree);  in hfs_btree_close()
121 void hfs_btree_write(struct hfs_btree *tree)  in hfs_btree_write()  argument
127 	node = hfs_bnode_find(tree, 0);  in hfs_btree_write()
135 	head->root = cpu_to_be32(tree->root);  in hfs_btree_write()
136 	head->leaf_count = cpu_to_be32(tree->leaf_count);  in hfs_btree_write()
137 	head->leaf_head = cpu_to_be32(tree->leaf_head);  in hfs_btree_write()
138 	head->leaf_tail = cpu_to_be32(tree->leaf_tail);  in hfs_btree_write()
139 	head->node_count = cpu_to_be32(tree->node_count);  in hfs_btree_write()
140 	head->free_nodes = cpu_to_be32(tree->free_nodes);  in hfs_btree_write()
141 	head->attributes = cpu_to_be32(tree->attributes);  in hfs_btree_write()
142 	head->depth = cpu_to_be16(tree->depth);  in hfs_btree_write()
151 	struct hfs_btree *tree = prev->tree;  in hfs_bmap_new_bmap()  local
156 	node = hfs_bnode_create(tree, idx);  in hfs_bmap_new_bmap()
160 	tree->free_nodes--;  in hfs_bmap_new_bmap()
167 	hfs_bnode_clear(node, 0, tree->node_size);  in hfs_bmap_new_bmap()
176 	hfs_bnode_write_u16(node, tree->node_size - 2, 14);  in hfs_bmap_new_bmap()
177 	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);  in hfs_bmap_new_bmap()
182 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)  in hfs_bmap_alloc()  argument
193 	while (!tree->free_nodes) {  in hfs_bmap_alloc()
194 		struct inode *inode = tree->inode;  in hfs_bmap_alloc()
203 				HFSPLUS_SB(tree->sb).alloc_blksz_shift;  in hfs_bmap_alloc()
205 					     HFSPLUS_SB(tree->sb).fs_shift;  in hfs_bmap_alloc()
207 		count = inode->i_size >> tree->node_size_shift;  in hfs_bmap_alloc()
208 		tree->free_nodes = count - tree->node_count;  in hfs_bmap_alloc()
209 		tree->node_count = count;  in hfs_bmap_alloc()
213 	node = hfs_bnode_find(tree, nidx);  in hfs_bmap_alloc()
235 						tree->free_nodes--;  in hfs_bmap_alloc()
236 						mark_inode_dirty(tree->inode);  in hfs_bmap_alloc()
238 						return hfs_bnode_create(tree, idx);  in hfs_bmap_alloc()
256 			next_node = hfs_bnode_find(tree, nidx);  in hfs_bmap_alloc()
273 	struct hfs_btree *tree;  in hfs_bmap_free()  local
281 	tree = node->tree;  in hfs_bmap_free()
283 	node = hfs_bnode_find(tree, 0);  in hfs_bmap_free()
298 		node = hfs_bnode_find(tree, i);  in hfs_bmap_free()
325 	tree->free_nodes++;  in hfs_bmap_free()
326 	mark_inode_dirty(tree->inode);  in hfs_bmap_free()