Home
last modified time | relevance | path

Searched refs:hfs_bnode_find (Results 1 – 11 of 11) sorted by relevance

/linux/fs/hfsplus/ !
H A Dbrec.c76 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
151 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_insert()
202 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_remove()
258 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
371 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_update_parent()
436 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
471 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
H A Dbtree.c289 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
390 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
440 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
467 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
485 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
H A Dbfind.c178 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
247 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
265 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
H A Dbnode.c393 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
405 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
525 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
H A Dhfsplus_fs.h300 #define hfs_bnode_find hfsplus_bnode_find macro
381 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
/linux/fs/hfs/ !
H A Dbrec.c78 node = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
151 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_insert()
201 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_remove()
273 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
386 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_update_parent()
451 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
486 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
H A Dbtree.c203 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
301 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
344 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
370 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
387 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
H A Dbfind.c135 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
204 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
222 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
H A Dbnode.c285 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
296 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
415 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
H A Dbtree.h112 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
H A Dcatalog.c259 node = hfs_bnode_find(cat_tree, leaf_tail); in hfs_correct_next_unused_CNID()
272 node = hfs_bnode_find(cat_tree, node_id); in hfs_correct_next_unused_CNID()