134 	struct hfs_btree *tree;  in hfs_btree_open()  local
141 	tree = kzalloc(sizeof(*tree), GFP_KERNEL);  in hfs_btree_open()
142 	if (!tree)  in hfs_btree_open()
145 	mutex_init(&tree->tree_lock);  in hfs_btree_open()
146 	spin_lock_init(&tree->hash_lock);  in hfs_btree_open()
147 	tree->sb = sb;  in hfs_btree_open()
148 	tree->cnid = id;  in hfs_btree_open()
152 	tree->inode = inode;  in hfs_btree_open()
154 	if (!HFSPLUS_I(tree->inode)->first_blocks) {  in hfs_btree_open()
159 	mapping = tree->inode->i_mapping;  in hfs_btree_open()
167 	tree->root = be32_to_cpu(head->root);  in hfs_btree_open()
168 	tree->leaf_count = be32_to_cpu(head->leaf_count);  in hfs_btree_open()
169 	tree->leaf_head = be32_to_cpu(head->leaf_head);  in hfs_btree_open()
170 	tree->leaf_tail = be32_to_cpu(head->leaf_tail);  in hfs_btree_open()
171 	tree->node_count = be32_to_cpu(head->node_count);  in hfs_btree_open()
172 	tree->free_nodes = be32_to_cpu(head->free_nodes);  in hfs_btree_open()
173 	tree->attributes = be32_to_cpu(head->attributes);  in hfs_btree_open()
174 	tree->node_size = be16_to_cpu(head->node_size);  in hfs_btree_open()
175 	tree->max_key_len = be16_to_cpu(head->max_key_len);  in hfs_btree_open()
176 	tree->depth = be16_to_cpu(head->depth);  in hfs_btree_open()
181 		if (tree->max_key_len != HFSPLUS_EXT_KEYLEN - sizeof(u16)) {  in hfs_btree_open()
183 				tree->max_key_len);  in hfs_btree_open()
186 		if (tree->attributes & HFS_TREE_VARIDXKEYS) {  in hfs_btree_open()
191 		tree->keycmp = hfsplus_ext_cmp_key;  in hfs_btree_open()
194 		if (tree->max_key_len != HFSPLUS_CAT_KEYLEN - sizeof(u16)) {  in hfs_btree_open()
196 				tree->max_key_len);  in hfs_btree_open()
199 		if (!(tree->attributes & HFS_TREE_VARIDXKEYS)) {  in hfs_btree_open()
206 			tree->keycmp = hfsplus_cat_bin_cmp_key;  in hfs_btree_open()
208 			tree->keycmp = hfsplus_cat_case_cmp_key;  in hfs_btree_open()
213 		if (tree->max_key_len != HFSPLUS_ATTR_KEYLEN - sizeof(u16)) {  in hfs_btree_open()
215 				tree->max_key_len);  in hfs_btree_open()
218 		tree->keycmp = hfsplus_attr_bin_cmp_key;  in hfs_btree_open()
225 	if (!(tree->attributes & HFS_TREE_BIGKEYS)) {  in hfs_btree_open()
230 	size = tree->node_size;  in hfs_btree_open()
233 	if (!tree->node_count)  in hfs_btree_open()
236 	tree->node_size_shift = ffs(size) - 1;  in hfs_btree_open()
238 	tree->pages_per_bnode =  in hfs_btree_open()
239 		(tree->node_size + PAGE_CACHE_SIZE - 1) >>  in hfs_btree_open()
244 	return tree;  in hfs_btree_open()
249 	tree->inode->i_mapping->a_ops = &hfsplus_aops;  in hfs_btree_open()
250 	iput(tree->inode);  in hfs_btree_open()
252 	kfree(tree);  in hfs_btree_open()
257 void hfs_btree_close(struct hfs_btree *tree)  in hfs_btree_close()  argument
262 	if (!tree)  in hfs_btree_close()
266 		while ((node = tree->node_hash[i])) {  in hfs_btree_close()
267 			tree->node_hash[i] = node->next_hash;  in hfs_btree_close()
271 					node->tree->cnid, node->this,  in hfs_btree_close()
274 			tree->node_hash_cnt--;  in hfs_btree_close()
277 	iput(tree->inode);  in hfs_btree_close()
278 	kfree(tree);  in hfs_btree_close()
281 int hfs_btree_write(struct hfs_btree *tree)  in hfs_btree_write()  argument
287 	node = hfs_bnode_find(tree, 0);  in hfs_btree_write()
296 	head->root = cpu_to_be32(tree->root);  in hfs_btree_write()
297 	head->leaf_count = cpu_to_be32(tree->leaf_count);  in hfs_btree_write()
298 	head->leaf_head = cpu_to_be32(tree->leaf_head);  in hfs_btree_write()
299 	head->leaf_tail = cpu_to_be32(tree->leaf_tail);  in hfs_btree_write()
300 	head->node_count = cpu_to_be32(tree->node_count);  in hfs_btree_write()
301 	head->free_nodes = cpu_to_be32(tree->free_nodes);  in hfs_btree_write()
302 	head->attributes = cpu_to_be32(tree->attributes);  in hfs_btree_write()
303 	head->depth = cpu_to_be16(tree->depth);  in hfs_btree_write()
313 	struct hfs_btree *tree = prev->tree;  in hfs_bmap_new_bmap()  local
318 	node = hfs_bnode_create(tree, idx);  in hfs_bmap_new_bmap()
322 	tree->free_nodes--;  in hfs_bmap_new_bmap()
329 	hfs_bnode_clear(node, 0, tree->node_size);  in hfs_bmap_new_bmap()
338 	hfs_bnode_write_u16(node, tree->node_size - 2, 14);  in hfs_bmap_new_bmap()
339 	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);  in hfs_bmap_new_bmap()
344 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)  in hfs_bmap_alloc()  argument
355 	while (!tree->free_nodes) {  in hfs_bmap_alloc()
356 		struct inode *inode = tree->inode;  in hfs_bmap_alloc()
361 		res = hfsplus_file_extend(inode, hfs_bnode_need_zeroout(tree));  in hfs_bmap_alloc()
366 				HFSPLUS_SB(tree->sb)->alloc_blksz_shift;  in hfs_bmap_alloc()
368 			hip->alloc_blocks << HFSPLUS_SB(tree->sb)->fs_shift;  in hfs_bmap_alloc()
370 		count = inode->i_size >> tree->node_size_shift;  in hfs_bmap_alloc()
371 		tree->free_nodes = count - tree->node_count;  in hfs_bmap_alloc()
372 		tree->node_count = count;  in hfs_bmap_alloc()
376 	node = hfs_bnode_find(tree, nidx);  in hfs_bmap_alloc()
398 						tree->free_nodes--;  in hfs_bmap_alloc()
399 						mark_inode_dirty(tree->inode);  in hfs_bmap_alloc()
401 						return hfs_bnode_create(tree,  in hfs_bmap_alloc()
420 			next_node = hfs_bnode_find(tree, nidx);  in hfs_bmap_alloc()
437 	struct hfs_btree *tree;  in hfs_bmap_free()  local
445 	tree = node->tree;  in hfs_bmap_free()
447 	node = hfs_bnode_find(tree, 0);  in hfs_bmap_free()
464 		node = hfs_bnode_find(tree, i);  in hfs_bmap_free()
495 	tree->free_nodes++;  in hfs_bmap_free()
496 	mark_inode_dirty(tree->inode);  in hfs_bmap_free()