Home
last modified time | relevance | path

Searched refs:hfs_bnode_find (Results 1 - 20 of 20) sorted by relevance

/kernel/linux/linux-5.10/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.c288 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()
H A 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()
H A Dhfsplus_fs.h331 #define hfs_bnode_find hfsplus_bnode_find macro
420 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
H A 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
/kernel/linux/linux-5.10/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()
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()
H A Dbfind.c128 bnode = hfs_bnode_find(tree, nidx); in hfs_brec_find()
197 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
215 bnode = hfs_bnode_find(tree, idx); in hfs_brec_goto()
H A Dbtree.c166 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()
H A Dbtree.h111 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *, u32);
H A Dbnode.c194 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
/kernel/linux/linux-6.6/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()
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()
H A Dbfind.c126 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()
H A Dbtree.c168 node = hfs_bnode_find(tree, 0); in hfs_btree_write()
266 node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
309 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
335 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
352 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
H A Dbnode.c187 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
198 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
317 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function
H A Dbtree.h111 extern struct hfs_bnode *hfs_bnode_find(struct hfs_btree *, u32);
/kernel/linux/linux-6.6/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()
434 next_node = hfs_bnode_find(tree, nidx); in hfs_bmap_alloc()
461 node = hfs_bnode_find(tree, 0); in hfs_bmap_free()
479 node = hfs_bnode_find(tree, i); in hfs_bmap_free()
H A 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()
H A Dhfsplus_fs.h331 #define hfs_bnode_find hfsplus_bnode_find macro
409 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num);
H A Dbnode.c336 tmp = hfs_bnode_find(tree, node->prev); in hfs_bnode_unlink()
348 tmp = hfs_bnode_find(tree, node->next); in hfs_bnode_unlink()
467 struct hfs_bnode *hfs_bnode_find(struct hfs_btree *tree, u32 num) in hfs_bnode_find() function

Completed in 20 milliseconds