Home
last modified time | relevance | path

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

/Linux-v4.19/fs/hfs/
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()
200 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_remove()
254 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
367 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_update_parent()
428 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
462 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
Dbtree.c166 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
254 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
297 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
323 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
339 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
Dbfind.c114 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
183 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
201 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
Dbnode.c179 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
190 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
312 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
Dbtree.h103 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *, u32);
/Linux-v4.19/fs/hfsplus/
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()
432 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
466 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
Dbtree.c288 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
377 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
421 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
448 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
465 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
Dbfind.c183 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
252 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
270 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
Dbnode.c343 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
355 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
478 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
Dhfsplus_fs.h328 #define hfs_bnode_find hfsplus_bnode_find macro
416 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);