Searched refs:hfs_bnode_find (Results 1 – 10 of 10) sorted by relevance
| /linux-4.19.296/fs/hfsplus/ ! |
| D | brec.c | 76 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()
|
| D | btree.c | 288 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
389 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
433 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
460 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
478 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
|
| D | bfind.c | 183 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()
|
| D | bnode.c | 343 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
|
| D | hfsplus_fs.h | 331 #define hfs_bnode_find hfsplus_bnode_find macro
420 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
|
| /linux-4.19.296/fs/hfs/ ! |
| D | brec.c | 78 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()
432 fd->bnode = hfs_bnode_find(tree, new_node->parent); in hfs_brec_update_parent()
467 node = hfs_bnode_find(tree, tree->root); in hfs_btree_inc_height()
|
| D | btree.c | 166 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
263 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
306 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
332 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
349 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
|
| D | bfind.c | 126 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
195 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
213 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
|
| D | bnode.c | 194 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
205 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
328 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
|
| D | btree.h | 111 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *, u32);
|