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