Lines Matching defs:cnid
243 __be32 cnid;
265 hfs_bnode_read(node, &cnid, key_off + tmp, 4);
266 hfs_dbg(", cnid %d)", be32_to_cpu(cnid));
281 __be32 cnid;
289 cnid = cpu_to_be32(tmp->next);
290 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4);
300 cnid = cpu_to_be32(tmp->prev);
301 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);
324 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
328 if (cnid >= tree->node_count) {
329 pr_err("request for non-existent node %d in B*Tree\n", cnid);
333 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
335 if (node->this == cnid) {
342 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
350 if (cnid >= tree->node_count) {
351 pr_err("request for non-existent node %d in B*Tree\n", cnid);
361 node->this = cnid;
364 hfs_dbg("cnid %d, node %d, refcnt 1\n",
365 node->tree->cnid, node->this);
368 node2 = hfs_bnode_findhash(tree, cnid);
370 hash = hfs_bnode_hash(cnid);
384 off = (loff_t)cnid * tree->node_size;
404 hfs_dbg("cnid %d, node %d, refcnt %d\n",
405 node->tree->cnid, node->this, atomic_read(&node->refcnt));
549 hfs_dbg("cnid %d, node %d, refcnt %d\n",
550 node->tree->cnid, node->this,
562 hfs_dbg("cnid %d, node %d, refcnt %d\n",
563 node->tree->cnid, node->this,