138 	__be32 cnid;  in hfs_bnode_dump()  local
160 			hfs_bnode_read(node, &cnid, key_off + tmp, 4);  in hfs_bnode_dump()
161 			hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));  in hfs_bnode_dump()
176 	__be32 cnid;  in hfs_bnode_unlink()  local
184 		cnid = cpu_to_be32(tmp->next);  in hfs_bnode_unlink()
185 		hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4);  in hfs_bnode_unlink()
195 		cnid = cpu_to_be32(tmp->prev);  in hfs_bnode_unlink()
196 		hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);  in hfs_bnode_unlink()
219 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)  in hfs_bnode_findhash()  argument
223 	if (cnid >= tree->node_count) {  in hfs_bnode_findhash()
224 		pr_err("request for non-existent node %d in B*Tree\n", cnid);  in hfs_bnode_findhash()
228 	for (node = tree->node_hash[hfs_bnode_hash(cnid)];  in hfs_bnode_findhash()
230 		if (node->this == cnid) {  in hfs_bnode_findhash()
237 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)  in __hfs_bnode_create()  argument
246 	if (cnid >= tree->node_count) {  in __hfs_bnode_create()
247 		pr_err("request for non-existent node %d in B*Tree\n", cnid);  in __hfs_bnode_create()
258 	node->this = cnid;  in __hfs_bnode_create()
262 		node->tree->cnid, node->this);  in __hfs_bnode_create()
265 	node2 = hfs_bnode_findhash(tree, cnid);  in __hfs_bnode_create()
267 		hash = hfs_bnode_hash(cnid);  in __hfs_bnode_create()
280 	off = (loff_t)cnid * tree->node_size;  in __hfs_bnode_create()
305 		node->tree->cnid, node->this, atomic_read(&node->refcnt));  in hfs_bnode_unhash()
451 			node->tree->cnid, node->this,  in hfs_bnode_get()
464 			node->tree->cnid, node->this,  in hfs_bnode_put()