Home
last modified time | relevance | path

Searched refs:btrfs_next_leaf (Results 1 – 18 of 18) sorted by relevance

/linux/fs/btrfs/
H A Dfiemap.c131 * btrfs_next_leaf() releases the path, there's an ordered extent that in emit_fiemap_extent()
136 * the first item of the next leaf - in either case btrfs_next_leaf() in emit_fiemap_extent()
143 * Upon calling btrfs_next_leaf() we may also find an extent with an in emit_fiemap_extent()
146 * it, but after btrfs_next_leaf() released the path, delalloc was in emit_fiemap_extent()
319 * prevent btrfs_next_leaf() freeing it, we want to reuse it to avoid in fiemap_next_leaf_item()
325 ret = btrfs_next_leaf(inode->root, path); in fiemap_next_leaf_item()
394 ret = btrfs_next_leaf(root, path); in fiemap_search_slot()
H A Dreflink.c198 ret = btrfs_next_leaf(root, path); in clone_copy_inline_extent()
403 ret = btrfs_next_leaf(BTRFS_I(src)->root, path); in btrfs_clone()
H A Dfile-item.c522 ret = btrfs_next_leaf(root, path); in btrfs_lookup_csums_list()
679 ret = btrfs_next_leaf(root, path); in btrfs_lookup_csums_bitmap()
1023 ret = btrfs_next_leaf(root, path); in find_next_csum_offset()
H A Dprops.c173 ret = btrfs_next_leaf(root, path); in iterate_object_props()
H A Dctree.h713 static inline int btrfs_next_leaf(struct btrfs_root *root, struct btrfs_path *path) in btrfs_next_leaf() function
H A Droot-tree.c244 ret = btrfs_next_leaf(tree_root, path); in btrfs_find_orphan_roots()
H A Dtree-log.c2119 ret = btrfs_next_leaf(root, path); in find_dir_range()
2309 ret = btrfs_next_leaf(root, path); in replay_xattr_deletes()
2388 ret = btrfs_next_leaf(root, path); in replay_dir_deletes()
3990 ret = btrfs_next_leaf(root, path); in log_dir_items()
4897 ret = btrfs_next_leaf(root, path); in btrfs_log_prealloc_extents()
4922 * while btrfs_next_leaf() has the tree unlocked. in btrfs_log_prealloc_extents()
5142 ret = btrfs_next_leaf(root, path); in btrfs_log_all_xattrs()
5210 ret = btrfs_next_leaf(root, path); in btrfs_log_holes()
6817 ret = btrfs_next_leaf(root, path); in btrfs_log_all_parents()
6950 ret = btrfs_next_leaf(roo in log_new_ancestors()
[all...]
H A Dbackref.c509 ret = btrfs_next_leaf(root, path); in add_all_parents()
533 ret = btrfs_next_leaf(root, path); in add_all_parents()
2076 ret = btrfs_next_leaf(root, path); in btrfs_find_one_extref()
H A Dctree.c1675 ret = btrfs_next_leaf(fs_root, path); in btrfs_find_item()
2450 ret = btrfs_next_leaf(root, p); in btrfs_search_slot_for_read()
2530 ret = btrfs_next_leaf(root, path); in btrfs_get_next_valid_item()
4694 * this is similar to btrfs_next_leaf, but does not try to preserve
H A Dfile.c207 ret = btrfs_next_leaf(root, path); in btrfs_drop_extents()
3632 ret = btrfs_next_leaf(root, path); in find_desired_extent()
H A Dioctl.c2133 ret = btrfs_next_leaf(fs_info->tree_root, path); in btrfs_ioctl_get_subvol_info()
2216 ret = btrfs_next_leaf(root, path); in btrfs_ioctl_get_subvol_rootref()
H A Dzoned.c310 ret = btrfs_next_leaf(root, path); in calculate_emulated_zone_size()
H A Dscrub.c2623 ret = btrfs_next_leaf(root, path); in scrub_enumerate_chunks()
H A Dblock-group.c787 ret = btrfs_next_leaf(extent_root, path); in load_extent_tree_free()
H A Drelocation.c3391 ret = btrfs_next_leaf(rc->extent_root, path); in find_next_extent()
H A Ddisk-io.c2134 ret = btrfs_next_leaf(tree_root, path); in load_global_roots_objectid()
H A Dinode.c2096 ret = btrfs_next_leaf(root, path); in run_delalloc_nocow()
7080 ret = btrfs_next_leaf(root, path); in btrfs_get_extent()
H A Dextent-tree.c463 ret = btrfs_next_leaf(root, path); in lookup_extent_data_ref()