Lines Matching refs:cnid
145 __be32 cnid;
167 hfs_bnode_read(node, &cnid, key_off + tmp, 4);
168 hfs_dbg_cont(BNODE_MOD, ",%d)", be32_to_cpu(cnid));
183 __be32 cnid;
191 cnid = cpu_to_be32(tmp->next);
192 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4);
202 cnid = cpu_to_be32(tmp->prev);
203 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);
226 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
230 if (cnid >= tree->node_count) {
231 pr_err("request for non-existent node %d in B*Tree\n", cnid);
235 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
237 if (node->this == cnid) {
244 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
252 if (cnid >= tree->node_count) {
253 pr_err("request for non-existent node %d in B*Tree\n", cnid);
263 node->this = cnid;
267 node->tree->cnid, node->this);
270 node2 = hfs_bnode_findhash(tree, cnid);
272 hash = hfs_bnode_hash(cnid);
286 off = (loff_t)cnid * tree->node_size;
307 node->tree->cnid, node->this, atomic_read(&node->refcnt));
452 node->tree->cnid, node->this,
465 node->tree->cnid, node->this,