Home
last modified time | relevance | path

Searched refs:btrfs_next_leaf (Results 1 - 25 of 41) sorted by relevance

12

/kernel/linux/linux-5.10/fs/btrfs/
H A Dtree-log.c2213 ret = btrfs_next_leaf(root, path); in find_dir_range()
2429 ret = btrfs_next_leaf(root, path); in replay_xattr_deletes()
2506 ret = btrfs_next_leaf(root, path); in replay_dir_deletes()
3732 ret = btrfs_next_leaf(root, path); in log_dir_items()
4399 ret = btrfs_next_leaf(root, path); in btrfs_log_prealloc_extents()
4648 ret = btrfs_next_leaf(root, path); in btrfs_log_all_xattrs()
4716 ret = btrfs_next_leaf(root, path); in btrfs_log_holes()
5053 ret = btrfs_next_leaf(root, path); in log_conflicting_inodes()
5764 ret = btrfs_next_leaf(log, path); in log_new_dir_dentries()
5818 ret = btrfs_next_leaf(roo in btrfs_log_all_parents()
[all...]
H A Dreflink.c196 ret = btrfs_next_leaf(root, path); in clone_copy_inline_extent()
394 ret = btrfs_next_leaf(BTRFS_I(src)->root, path); in btrfs_clone()
H A Dinode-map.c73 ret = btrfs_next_leaf(root, path); in caching_kthread()
H A Dxattr.c319 ret = btrfs_next_leaf(root, path); in btrfs_listxattr()
H A Ddir-item.c319 ret = btrfs_next_leaf(root, path); in btrfs_search_dir_index_item()
H A Droot-tree.c236 ret = btrfs_next_leaf(tree_root, path); in btrfs_find_orphan_roots()
H A Dprops.c141 ret = btrfs_next_leaf(root, path); in iterate_object_props()
H A Dfile-item.c447 ret = btrfs_next_leaf(root, path); in btrfs_lookup_csums_range()
904 ret = btrfs_next_leaf(root, path); in btrfs_csum_file_blocks()
H A Dsend.c2703 ret = btrfs_next_leaf(sctx->send_root, path); in did_create_dir()
2977 ret = btrfs_next_leaf(root, path); in can_rmdir()
3632 ret = btrfs_next_leaf(root, path); in is_ancestor()
4599 ret = btrfs_next_leaf(root, path); in process_all_refs()
4909 ret = btrfs_next_leaf(root, path); in process_all_new_xattrs()
5404 ret = btrfs_next_leaf(clone_root->root, path); in clone_range()
5863 ret = btrfs_next_leaf(root, path); in range_is_hole_in_parent()
6029 ret = btrfs_next_leaf(root, path); in process_all_extents()
6267 ret = btrfs_next_leaf(sctx->parent_root, path); in btrfs_unlink_all_paths()
H A Dbackref.c460 ret = btrfs_next_leaf(root, path); in add_all_parents()
484 ret = btrfs_next_leaf(root, path); in add_all_parents()
1661 ret = btrfs_next_leaf(root, path);
H A Dscrub.c2834 ret = btrfs_next_leaf(root, path); in scrub_raid56_parity()
3187 ret = btrfs_next_leaf(root, path); in scrub_stripe()
3454 ret = btrfs_next_leaf(root, path); in scrub_enumerate_chunks()
H A Dblock-group.c577 ret = btrfs_next_leaf(extent_root, path); in load_extent_tree_free()
1616 ret = btrfs_next_leaf(root, path); in find_first_block_group()
H A Dctree.c2572 ret = btrfs_next_leaf(fs_root, path); in btrfs_find_item()
3095 ret = btrfs_next_leaf(root, p); in btrfs_search_slot_for_read()
5362 * this is similar to btrfs_next_leaf, but does not try to preserve
5442 int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) in btrfs_next_leaf() function
/kernel/linux/linux-6.6/fs/btrfs/
H A Dfile-item.c523 ret = btrfs_next_leaf(root, path); in btrfs_lookup_csums_list()
673 ret = btrfs_next_leaf(root, path); in btrfs_lookup_csums_bitmap()
1018 ret = btrfs_next_leaf(root, path); in find_next_csum_offset()
H A Dreflink.c201 ret = btrfs_next_leaf(root, path); in clone_copy_inline_extent()
402 ret = btrfs_next_leaf(BTRFS_I(src)->root, path); in btrfs_clone()
H A Dtree-log.c2071 ret = btrfs_next_leaf(root, path); in find_dir_range()
2260 ret = btrfs_next_leaf(root, path); in replay_xattr_deletes()
2336 ret = btrfs_next_leaf(root, path); in replay_dir_deletes()
3873 ret = btrfs_next_leaf(root, path); in log_dir_items()
4784 ret = btrfs_next_leaf(root, path); in btrfs_log_prealloc_extents()
5023 ret = btrfs_next_leaf(root, path); in btrfs_log_all_xattrs()
5091 ret = btrfs_next_leaf(root, path); in btrfs_log_holes()
6694 ret = btrfs_next_leaf(root, path); in btrfs_log_all_parents()
6832 ret = btrfs_next_leaf(root, path); in log_new_ancestors()
6925 ret = btrfs_next_leaf(roo in log_all_new_ancestors()
[all...]
H A Dverity.c398 ret = btrfs_next_leaf(root, path); in read_key_bytes()
H A Droot-tree.c239 ret = btrfs_next_leaf(tree_root, path); in btrfs_find_orphan_roots()
H A Dprops.c171 ret = btrfs_next_leaf(root, path); in iterate_object_props()
H A Dctree.h686 static inline int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) in btrfs_next_leaf() function
H A Dbackref.c513 ret = btrfs_next_leaf(root, path); in add_all_parents()
537 ret = btrfs_next_leaf(root, path); in add_all_parents()
2082 ret = btrfs_next_leaf(root, path); in btrfs_find_one_extref()
H A Dscrub.c1424 ret = btrfs_next_leaf(extent_root, path); in find_first_extent_item()
2421 ret = btrfs_next_leaf(root, path); in scrub_enumerate_chunks()
H A Dctree.c1811 ret = btrfs_next_leaf(fs_root, path); in btrfs_find_item()
2584 ret = btrfs_next_leaf(root, p); in btrfs_search_slot_for_read()
2664 ret = btrfs_next_leaf(root, path); in btrfs_get_next_valid_item()
4843 * this is similar to btrfs_next_leaf, but does not try to preserve
H A Dfile.c266 ret = btrfs_next_leaf(root, path); in btrfs_drop_extents()
3542 ret = btrfs_next_leaf(root, path); in find_desired_extent()
H A Dextent_io.c2454 * while we call btrfs_next_leaf() (through fiemap_next_leaf_item()). in emit_fiemap_extent()
2458 * btrfs_next_leaf() releases the path, there's an ordered extent that in emit_fiemap_extent()
2463 * the first item of the next leaf - in either case btrfs_next_leaf() in emit_fiemap_extent()
2470 * Upon calling btrfs_next_leaf() we may also find an extent with an in emit_fiemap_extent()
2473 * it, but after btrfs_next_leaf() released the path, delalloc was in emit_fiemap_extent()
2620 ret = btrfs_next_leaf(inode->root, path); in fiemap_next_leaf_item()
2675 ret = btrfs_next_leaf(root, path); in fiemap_search_slot()

Completed in 80 milliseconds

12