Lines Matching refs:node
176 struct hfs_bnode *node; in hfs_btree_close() local
183 while ((node = tree->node_hash[i])) { in hfs_btree_close()
184 tree->node_hash[i] = node->next_hash; in hfs_btree_close()
185 if (atomic_read(&node->refcnt)) in hfs_btree_close()
187 node->tree->cnid, node->this, in hfs_btree_close()
188 atomic_read(&node->refcnt)); in hfs_btree_close()
189 hfs_bnode_free(node); in hfs_btree_close()
200 struct hfs_bnode *node; in hfs_btree_write() local
203 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
204 if (IS_ERR(node)) in hfs_btree_write()
208 page = node->page[0]; in hfs_btree_write()
223 hfs_bnode_put(node); in hfs_btree_write()
229 struct hfs_bnode *node; in hfs_bmap_new_bmap() local
233 node = hfs_bnode_create(tree, idx); in hfs_bmap_new_bmap()
234 if (IS_ERR(node)) in hfs_bmap_new_bmap()
235 return node; in hfs_bmap_new_bmap()
244 node->type = HFS_NODE_MAP; in hfs_bmap_new_bmap()
245 node->num_recs = 1; in hfs_bmap_new_bmap()
246 hfs_bnode_clear(node, 0, tree->node_size); in hfs_bmap_new_bmap()
253 hfs_bnode_write(node, &desc, 0, sizeof(desc)); in hfs_bmap_new_bmap()
254 hfs_bnode_write_u16(node, 14, 0x8000); in hfs_bmap_new_bmap()
255 hfs_bnode_write_u16(node, tree->node_size - 2, 14); in hfs_bmap_new_bmap()
256 hfs_bnode_write_u16(node, tree->node_size - 4, tree->node_size - 6); in hfs_bmap_new_bmap()
258 return node; in hfs_bmap_new_bmap()
287 struct hfs_bnode *node, *next_node; in hfs_bmap_alloc() local
301 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
302 if (IS_ERR(node)) in hfs_bmap_alloc()
303 return node; in hfs_bmap_alloc()
304 len = hfs_brec_lenoff(node, 2, &off16); in hfs_bmap_alloc()
307 off += node->page_offset; in hfs_bmap_alloc()
308 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bmap_alloc()
325 hfs_bnode_put(node); in hfs_bmap_alloc()
339 nidx = node->next; in hfs_bmap_alloc()
342 next_node = hfs_bmap_new_bmap(node, idx); in hfs_bmap_alloc()
345 hfs_bnode_put(node); in hfs_bmap_alloc()
348 node = next_node; in hfs_bmap_alloc()
350 len = hfs_brec_lenoff(node, 0, &off16); in hfs_bmap_alloc()
352 off += node->page_offset; in hfs_bmap_alloc()
353 pagep = node->page + (off >> PAGE_SHIFT); in hfs_bmap_alloc()
359 void hfs_bmap_free(struct hfs_bnode *node) in hfs_bmap_free() argument
367 hfs_dbg(BNODE_MOD, "btree_free_node: %u\n", node->this); in hfs_bmap_free()
368 tree = node->tree; in hfs_bmap_free()
369 nidx = node->this; in hfs_bmap_free()
370 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
371 if (IS_ERR(node)) in hfs_bmap_free()
373 len = hfs_brec_lenoff(node, 2, &off); in hfs_bmap_free()
378 i = node->next; in hfs_bmap_free()
382 node->this); in hfs_bmap_free()
383 hfs_bnode_put(node); in hfs_bmap_free()
386 hfs_bnode_put(node); in hfs_bmap_free()
387 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
388 if (IS_ERR(node)) in hfs_bmap_free()
390 if (node->type != HFS_NODE_MAP) { in hfs_bmap_free()
393 node->this, node->type); in hfs_bmap_free()
394 hfs_bnode_put(node); in hfs_bmap_free()
397 len = hfs_brec_lenoff(node, 0, &off); in hfs_bmap_free()
399 off += node->page_offset + nidx / 8; in hfs_bmap_free()
400 page = node->page[off >> PAGE_SHIFT]; in hfs_bmap_free()
407 node->this, node->type); in hfs_bmap_free()
409 hfs_bnode_put(node); in hfs_bmap_free()
415 hfs_bnode_put(node); in hfs_bmap_free()