Lines Matching defs:cnid
137 __be32 cnid;
158 hfs_bnode_read(node, &cnid, key_off + tmp, 4);
159 dprint(DBG_BNODE_MOD, ",%d)", be32_to_cpu(cnid));
174 __be32 cnid;
182 cnid = cpu_to_be32(tmp->next);
183 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, next), 4);
193 cnid = cpu_to_be32(tmp->prev);
194 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);
217 struct hfs_bnode *hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid)
221 if (cnid >= tree->node_count) {
222 printk(KERN_ERR "hfs: request for non-existent node %d in B*Tree\n", cnid);
226 for (node = tree->node_hash[hfs_bnode_hash(cnid)];
228 if (node->this == cnid) {
235 static struct hfs_bnode *__hfs_bnode_create(struct hfs_btree *tree, u32 cnid)
244 if (cnid >= tree->node_count) {
245 printk(KERN_ERR "hfs: request for non-existent node %d in B*Tree\n", cnid);
256 node->this = cnid;
260 node->tree->cnid, node->this);
263 node2 = hfs_bnode_findhash(tree, cnid);
265 hash = hfs_bnode_hash(cnid);
278 off = (loff_t)cnid * tree->node_size;
304 node->tree->cnid, node->this, atomic_read(&node->refcnt));
446 node->tree->cnid, node->this, atomic_read(&node->refcnt));
458 node->tree->cnid, node->this, atomic_read(&node->refcnt));