Home
last modified time | relevance | path

Searched refs:btrfs_previous_item (Results 1 - 12 of 12) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dctree.h516 int btrfs_previous_item(struct btrfs_root *root,
H A Dvolumes.c1752 ret = btrfs_previous_item(root, path, key.objectid, in btrfs_free_dev_extent()
1829 ret = btrfs_previous_item(fs_info->chunk_root, path, in find_next_devid()
3357 ret = btrfs_previous_item(chunk_root, path, key.objectid, in btrfs_relocate_sys_chunks()
3930 ret = btrfs_previous_item(chunk_root, path, 0, in __btrfs_balance()
4898 ret = btrfs_previous_item(root, path, 0, key.type); in btrfs_shrink_device()
H A Dtree-log.c3785 ret = btrfs_previous_item(root, path, ino, BTRFS_DIR_INDEX_KEY); in log_dir_items()
3807 ret = btrfs_previous_item(root, path, ino, BTRFS_DIR_INDEX_KEY); in log_dir_items()
4746 ret = btrfs_previous_item(root, path, ino, BTRFS_EXTENT_DATA_KEY); in btrfs_log_prealloc_extents()
H A Dctree.c2541 * btrfs_previous_item) don't miss an existing item with a key matching in btrfs_prev_leaf()
2627 * Execute search and call btrfs_previous_item to traverse backwards if the item
2639 ret = btrfs_previous_item(root, path, key->objectid, key->type); in btrfs_search_backwards()
5133 int btrfs_previous_item(struct btrfs_root *root, in btrfs_previous_item() function
H A Dextent_io.c2893 ret = btrfs_previous_item(root, path, ino, BTRFS_EXTENT_DATA_KEY); in fiemap_find_last_extent_offset()
H A Dioctl.c1956 ret = btrfs_previous_item(root, path, dirid, in btrfs_search_path_in_tree_user()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dsuper.c1178 ret = btrfs_previous_item(root, path, subvol_objectid, in btrfs_get_subvol_name_from_objectid()
1225 ret = btrfs_previous_item(fs_root, path, dirid, in btrfs_get_subvol_name_from_objectid()
H A Dvolumes.c1609 ret = btrfs_previous_item(root, path, key.objectid, key.type); in find_free_dev_extent_start()
1739 ret = btrfs_previous_item(root, path, key.objectid, in btrfs_free_dev_extent()
1863 ret = btrfs_previous_item(fs_info->chunk_root, path, in find_next_devid()
3183 ret = btrfs_previous_item(chunk_root, path, key.objectid, in btrfs_relocate_sys_chunks()
3761 ret = btrfs_previous_item(chunk_root, path, 0, in __btrfs_balance()
4736 ret = btrfs_previous_item(root, path, 0, key.type); in btrfs_shrink_device()
H A Dioctl.c2429 ret = btrfs_previous_item(root, path, dirid, in btrfs_search_path_in_tree()
2520 ret = btrfs_previous_item(root, path, dirid, in btrfs_search_path_in_tree_user()
2548 ret = btrfs_previous_item(root, path, dirid, in btrfs_search_path_in_tree_user()
H A Dtree-log.c3618 ret = btrfs_previous_item(root, path, ino, key_type); in log_dir_items()
3636 ret = btrfs_previous_item(root, path, ino, key_type); in log_dir_items()
4361 ret = btrfs_previous_item(root, path, ino, BTRFS_EXTENT_DATA_KEY); in btrfs_log_prealloc_extents()
H A Dctree.h2693 int btrfs_previous_item(struct btrfs_root *root,
H A Dctree.c5228 * btrfs_previous_item) don't miss an existing item with a key matching in btrfs_prev_leaf()
5626 int btrfs_previous_item(struct btrfs_root *root, in btrfs_previous_item() function

Completed in 100 milliseconds