139 	struct hfs_bnode *node;  in hfs_btree_close()  local
146 		while ((node = tree->node_hash[i])) {  in hfs_btree_close()
147 			tree->node_hash[i] = node->next_hash;  in hfs_btree_close()
148 			if (atomic_read(&node->refcnt))  in hfs_btree_close()
150 				       node->tree->cnid, node->this,  in hfs_btree_close()
151 				       atomic_read(&node->refcnt));  in hfs_btree_close()
152 			hfs_bnode_free(node);  in hfs_btree_close()
163 	struct hfs_bnode *node;  in hfs_btree_write()  local
166 	node = hfs_bnode_find(tree, 0);  in hfs_btree_write()
167 	if (IS_ERR(node))  in hfs_btree_write()
171 	page = node->page[0];  in hfs_btree_write()
185 	hfs_bnode_put(node);  in hfs_btree_write()
191 	struct hfs_bnode *node;  in hfs_bmap_new_bmap()  local
195 	node = hfs_bnode_create(tree, idx);  in hfs_bmap_new_bmap()
196 	if (IS_ERR(node))  in hfs_bmap_new_bmap()
197 		return node;  in hfs_bmap_new_bmap()
206 	node->type = HFS_NODE_MAP;  in hfs_bmap_new_bmap()
207 	node->num_recs = 1;  in hfs_bmap_new_bmap()
208 	hfs_bnode_clear(node, 0, tree->node_size);  in hfs_bmap_new_bmap()
215 	hfs_bnode_write(node, &desc, 0, sizeof(desc));  in hfs_bmap_new_bmap()
216 	hfs_bnode_write_u16(node, 14, 0x8000);  in hfs_bmap_new_bmap()
217 	hfs_bnode_write_u16(node, tree->node_size - 2, 14);  in hfs_bmap_new_bmap()
218 	hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6);  in hfs_bmap_new_bmap()
220 	return node;  in hfs_bmap_new_bmap()
249 	struct hfs_bnode *node, *next_node;  in hfs_bmap_alloc()  local
263 	node = hfs_bnode_find(tree, nidx);  in hfs_bmap_alloc()
264 	if (IS_ERR(node))  in hfs_bmap_alloc()
265 		return node;  in hfs_bmap_alloc()
266 	len = hfs_brec_lenoff(node, 2, &off16);  in hfs_bmap_alloc()
269 	off += node->page_offset;  in hfs_bmap_alloc()
270 	pagep = node->page + (off >> PAGE_SHIFT);  in hfs_bmap_alloc()
287 						hfs_bnode_put(node);  in hfs_bmap_alloc()
301 		nidx = node->next;  in hfs_bmap_alloc()
304 			next_node = hfs_bmap_new_bmap(node, idx);  in hfs_bmap_alloc()
307 		hfs_bnode_put(node);  in hfs_bmap_alloc()
310 		node = next_node;  in hfs_bmap_alloc()
312 		len = hfs_brec_lenoff(node, 0, &off16);  in hfs_bmap_alloc()
314 		off += node->page_offset;  in hfs_bmap_alloc()
315 		pagep = node->page + (off >> PAGE_SHIFT);  in hfs_bmap_alloc()
321 void hfs_bmap_free(struct hfs_bnode *node)  in hfs_bmap_free()  argument
329 	hfs_dbg(BNODE_MOD, "btree_free_node: %u\n", node->this);  in hfs_bmap_free()
330 	tree = node->tree;  in hfs_bmap_free()
331 	nidx = node->this;  in hfs_bmap_free()
332 	node = hfs_bnode_find(tree, 0);  in hfs_bmap_free()
333 	if (IS_ERR(node))  in hfs_bmap_free()
335 	len = hfs_brec_lenoff(node, 2, &off);  in hfs_bmap_free()
340 		i = node->next;  in hfs_bmap_free()
344 				node->this);  in hfs_bmap_free()
345 			hfs_bnode_put(node);  in hfs_bmap_free()
348 		hfs_bnode_put(node);  in hfs_bmap_free()
349 		node = hfs_bnode_find(tree, i);  in hfs_bmap_free()
350 		if (IS_ERR(node))  in hfs_bmap_free()
352 		if (node->type != HFS_NODE_MAP) {  in hfs_bmap_free()
355 				node->this, node->type);  in hfs_bmap_free()
356 			hfs_bnode_put(node);  in hfs_bmap_free()
359 		len = hfs_brec_lenoff(node, 0, &off);  in hfs_bmap_free()
361 	off += node->page_offset + nidx / 8;  in hfs_bmap_free()
362 	page = node->page[off >> PAGE_SHIFT];  in hfs_bmap_free()
369 			node->this, node->type);  in hfs_bmap_free()
371 		hfs_bnode_put(node);  in hfs_bmap_free()
377 	hfs_bnode_put(node);  in hfs_bmap_free()