fs/hfs/btree.c

21 	struct hfs_btree *tree;
27 	tree = kzalloc(sizeof(*tree), GFP_KERNEL);
28 	if (!tree)
31 	mutex_init(&tree->tree_lock);
32 	spin_lock_init(&tree->hash_lock);
34 	tree->sb = sb;
35 	tree->cnid = id;
36 	tree->keycmp = keycmp;
38 	tree->inode = iget_locked(sb, id);
39 	if (!tree->inode)
41 	BUG_ON(!(tree->inode->i_state & I_NEW));
44 	HFS_I(tree->inode)->flags = 0;
45 	mutex_init(&HFS_I(tree->inode)->extents_lock);
48 		hfs_inode_read_fork(tree->inode, mdb->drXTExtRec, mdb->drXTFlSize,
50 		if (HFS_I(tree->inode)->alloc_blocks >
51 					HFS_I(tree->inode)->first_blocks) {
53 			unlock_new_inode(tree->inode);
57 		tree->inode->i_mapping->a_ops = &hfs_btree_aops;
60 		hfs_inode_read_fork(tree->inode, mdb->drCTExtRec, mdb->drCTFlSize,
63 		if (!HFS_I(tree->inode)->first_blocks) {
65 			unlock_new_inode(tree->inode);
69 		tree->inode->i_mapping->a_ops = &hfs_btree_aops;
75 	unlock_new_inode(tree->inode);
77 	mapping = tree->inode->i_mapping;
85 	tree->root = be32_to_cpu(head->root);
86 	tree->leaf_count = be32_to_cpu(head->leaf_count);
87 	tree->leaf_head = be32_to_cpu(head->leaf_head);
88 	tree->leaf_tail = be32_to_cpu(head->leaf_tail);
89 	tree->node_count = be32_to_cpu(head->node_count);
90 	tree->free_nodes = be32_to_cpu(head->free_nodes);
91 	tree->attributes = be32_to_cpu(head->attributes);
92 	tree->node_size = be16_to_cpu(head->node_size);
93 	tree->max_key_len = be16_to_cpu(head->max_key_len);
94 	tree->depth = be16_to_cpu(head->depth);
96 	size = tree->node_size;
99 	if (!tree->node_count)
103 		if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) {
105 			       tree->max_key_len);
110 		if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) {
112 			       tree->max_key_len);
120 	tree->node_size_shift = ffs(size) - 1;
121 	tree->pages_per_bnode = (tree->node_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
125 	return tree;
131 	tree->inode->i_mapping->a_ops = &hfs_aops;
132 	iput(tree->inode);
134 	kfree(tree);
139 void hfs_btree_close(struct hfs_btree *tree)
144 	if (!tree)
148 		while ((node = tree->node_hash[i])) {
149 			tree->node_hash[i] = node->next_hash;
152 				       node->tree->cnid, node->this,
155 			tree->node_hash_cnt--;
158 	iput(tree->inode);
159 	kfree(tree);
162 void hfs_btree_write(struct hfs_btree *tree)
168 	node = hfs_bnode_find(tree, 0);
177 	head->root = cpu_to_be32(tree->root);
178 	head->leaf_count = cpu_to_be32(tree->leaf_count);
179 	head->leaf_head = cpu_to_be32(tree->leaf_head);
180 	head->leaf_tail = cpu_to_be32(tree->leaf_tail);
181 	head->node_count = cpu_to_be32(tree->node_count);
182 	head->free_nodes = cpu_to_be32(tree->free_nodes);
183 	head->attributes = cpu_to_be32(tree->attributes);
184 	head->depth = cpu_to_be16(tree->depth);
193 	struct hfs_btree *tree = prev->tree;
198 	node = hfs_bnode_create(tree, idx);
202 	if (!tree->free_nodes)
204 	tree->free_nodes--;
211 	hfs_bnode_clear(node, 0, tree->node_size);
220 	hfs_bnode_write_u16(node, tree->node_size - 2, 14);
221 	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);
226 /* Make sure @tree has enough space for the @rsvd_nodes */
227 int hfs_bmap_reserve(struct hfs_btree *tree, int rsvd_nodes)
229 	struct inode *inode = tree->inode;
233 	while (tree->free_nodes < rsvd_nodes) {
239 				HFS_SB(tree->sb)->alloc_blksz;
241 					  tree->sb->s_blocksize_bits;
243 		count = inode->i_size >> tree->node_size_shift;
244 		tree->free_nodes += count - tree->node_count;
245 		tree->node_count = count;
250 struct hfs_bnode *hfs_bmap_alloc(struct hfs_btree *tree)
261 	res = hfs_bmap_reserve(tree, 1);
266 	node = hfs_bnode_find(tree, nidx);
288 						tree->free_nodes--;
289 						mark_inode_dirty(tree->inode);
291 						return hfs_bnode_create(tree, idx);
309 			next_node = hfs_bnode_find(tree, nidx);
326 	struct hfs_btree *tree;
333 	tree = node->tree;
335 	node = hfs_bnode_find(tree, 0);
352 		node = hfs_bnode_find(tree, i);
381 	tree->free_nodes++;
382 	mark_inode_dirty(tree->inode);