Home
last modified time | relevance | path

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

/fs/hfs/
Dbrec.c77 fd->bnode = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
149 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_insert()
198 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_remove()
252 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
365 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_update_parent()
426 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
460 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
Dbtree.c165 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
253 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
296 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
322 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
338 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
Dbfind.c113 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
182 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
200 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
Dbnode.c180 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
191 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
315 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
Dbtree.h102 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *, u32);
/fs/hfsplus/
Dbrec.c75 fd->bnode = hfs_bnode_find(tree, tree->leaf_head); in hfs_brec_insert()
149 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()
256 next_node = hfs_bnode_find(tree, node->next); in hfs_bnode_split()
369 parent = hfs_bnode_find(tree, node->parent); in hfs_brec_update_parent()
430 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
464 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
Dbtree.c287 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
376 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
420 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
447 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
464 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
Dbfind.c182 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
251 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
269 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
Dbnode.c344 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
356 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
481 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);