152 	__be32 cnid;  in hfs_bnode_dump()  local
174 			hfs_bnode_read(node, &cnid, key_off + tmp, 4);  in hfs_bnode_dump()
175 			hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));  in hfs_bnode_dump()
190 	__be32 cnid;  in hfs_bnode_unlink()  local
198 		cnid = cpu_to_be32(tmp->next);  in hfs_bnode_unlink()
199 		hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4);  in hfs_bnode_unlink()
209 		cnid = cpu_to_be32(tmp->prev);  in hfs_bnode_unlink()
210 		hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);  in hfs_bnode_unlink()
233 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)  in hfs_bnode_findhash()  argument
237 	if (cnid >= tree->node_count) {  in hfs_bnode_findhash()
238 		pr_err("request for non-existent node %d in B*Tree\n", cnid);  in hfs_bnode_findhash()
242 	for (node = tree->node_hash[hfs_bnode_hash(cnid)];  in hfs_bnode_findhash()
244 		if (node->this == cnid) {  in hfs_bnode_findhash()
251 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)  in __hfs_bnode_create()  argument
259 	if (cnid >= tree->node_count) {  in __hfs_bnode_create()
260 		pr_err("request for non-existent node %d in B*Tree\n", cnid);  in __hfs_bnode_create()
270 	node->this = cnid;  in __hfs_bnode_create()
274 		node->tree->cnid, node->this);  in __hfs_bnode_create()
277 	node2 = hfs_bnode_findhash(tree, cnid);  in __hfs_bnode_create()
279 		hash = hfs_bnode_hash(cnid);  in __hfs_bnode_create()
292 	off = (loff_t)cnid * tree->node_size;  in __hfs_bnode_create()
317 		node->tree->cnid, node->this, atomic_read(&node->refcnt));  in hfs_bnode_unhash()
463 			node->tree->cnid, node->this,  in hfs_bnode_get()
476 			node->tree->cnid, node->this,  in hfs_bnode_put()