141 	struct hfs_bnode *node;  in hfs_btree_close()  local
148 		while ((node = tree->node_hash[i])) {  in hfs_btree_close()
149 			tree->node_hash[i] = node->next_hash;  in hfs_btree_close()
150 			if (atomic_read(&node->refcnt))  in hfs_btree_close()
152 				       node->tree->cnid, node->this,  in hfs_btree_close()
153 				       atomic_read(&node->refcnt));  in hfs_btree_close()
154 			hfs_bnode_free(node);  in hfs_btree_close()
165 	struct hfs_bnode *node;  in hfs_btree_write()  local
168 	node = hfs_bnode_find(tree, 0);  in hfs_btree_write()
169 	if (IS_ERR(node))  in hfs_btree_write()
173 	page = node->page[0];  in hfs_btree_write()
188 	hfs_bnode_put(node);  in hfs_btree_write()
194 	struct hfs_bnode *node;  in hfs_bmap_new_bmap()  local
198 	node = hfs_bnode_create(tree, idx);  in hfs_bmap_new_bmap()
199 	if (IS_ERR(node))  in hfs_bmap_new_bmap()
200 		return node;  in hfs_bmap_new_bmap()
209 	node->type = HFS_NODE_MAP;  in hfs_bmap_new_bmap()
210 	node->num_recs = 1;  in hfs_bmap_new_bmap()
211 	hfs_bnode_clear(node, 0, tree->node_size);  in hfs_bmap_new_bmap()
218 	hfs_bnode_write(node, &desc, 0, sizeof(desc));  in hfs_bmap_new_bmap()
219 	hfs_bnode_write_u16(node, 14, 0x8000);  in hfs_bmap_new_bmap()
220 	hfs_bnode_write_u16(node, tree->node_size - 2, 14);  in hfs_bmap_new_bmap()
221 	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);  in hfs_bmap_new_bmap()
223 	return node;  in hfs_bmap_new_bmap()
252 	struct hfs_bnode *node, *next_node;  in hfs_bmap_alloc()  local
266 	node = hfs_bnode_find(tree, nidx);  in hfs_bmap_alloc()
267 	if (IS_ERR(node))  in hfs_bmap_alloc()
268 		return node;  in hfs_bmap_alloc()
269 	len = hfs_brec_lenoff(node, 2, &off16);  in hfs_bmap_alloc()
272 	off += node->page_offset;  in hfs_bmap_alloc()
273 	pagep = node->page + (off >> PAGE_SHIFT);  in hfs_bmap_alloc()
290 						hfs_bnode_put(node);  in hfs_bmap_alloc()
304 		nidx = node->next;  in hfs_bmap_alloc()
307 			next_node = hfs_bmap_new_bmap(node, idx);  in hfs_bmap_alloc()
310 		hfs_bnode_put(node);  in hfs_bmap_alloc()
313 		node = next_node;  in hfs_bmap_alloc()
315 		len = hfs_brec_lenoff(node, 0, &off16);  in hfs_bmap_alloc()
317 		off += node->page_offset;  in hfs_bmap_alloc()
318 		pagep = node->page + (off >> PAGE_SHIFT);  in hfs_bmap_alloc()
324 void hfs_bmap_free(struct hfs_bnode *node)  in hfs_bmap_free()  argument
332 	hfs_dbg(BNODE_MOD, "btree_free_node: %u\n", node->this);  in hfs_bmap_free()
333 	tree = node->tree;  in hfs_bmap_free()
334 	nidx = node->this;  in hfs_bmap_free()
335 	node = hfs_bnode_find(tree, 0);  in hfs_bmap_free()
336 	if (IS_ERR(node))  in hfs_bmap_free()
338 	len = hfs_brec_lenoff(node, 2, &off);  in hfs_bmap_free()
343 		i = node->next;  in hfs_bmap_free()
347 				node->this);  in hfs_bmap_free()
348 			hfs_bnode_put(node);  in hfs_bmap_free()
351 		hfs_bnode_put(node);  in hfs_bmap_free()
352 		node = hfs_bnode_find(tree, i);  in hfs_bmap_free()
353 		if (IS_ERR(node))  in hfs_bmap_free()
355 		if (node->type != HFS_NODE_MAP) {  in hfs_bmap_free()
358 				node->this, node->type);  in hfs_bmap_free()
359 			hfs_bnode_put(node);  in hfs_bmap_free()
362 		len = hfs_brec_lenoff(node, 0, &off);  in hfs_bmap_free()
364 	off += node->page_offset + nidx / 8;  in hfs_bmap_free()
365 	page = node->page[off >> PAGE_SHIFT];  in hfs_bmap_free()
372 			node->this, node->type);  in hfs_bmap_free()
374 		hfs_bnode_put(node);  in hfs_bmap_free()
380 	hfs_bnode_put(node);  in hfs_bmap_free()