| /linux/fs/btrfs/ |
| H A D | defrag.c | 346 u64 search_start = *last_ret; in btrfs_realloc_node() local
403 if (search_start == 0) in btrfs_realloc_node()
404 search_start = last_block; in btrfs_realloc_node()
408 &cur, search_start, in btrfs_realloc_node()
417 search_start = cur->start; in btrfs_realloc_node()
419 *last_ret = search_start; in btrfs_realloc_node()
|
| H A D | file.c | 148 u64 search_start = args->start; in btrfs_drop_extents() local
188 search_start, modify_tree); in btrfs_drop_extents()
191 if (ret > 0 && path->slots[0] > 0 && search_start == args->start) { in btrfs_drop_extents()
259 if (extent_end == key.offset && extent_end >= search_start) { in btrfs_drop_extents()
264 if (extent_end <= search_start) { in btrfs_drop_extents()
270 search_start = max(key.offset, args->start); in btrfs_drop_extents()
366 search_start = extent_end; in btrfs_drop_extents()
3673 u64 search_start = last_extent_end; in find_desired_extent() local
3681 search_start = offset; in find_desired_extent()
3685 search_start, in find_desired_extent()
3714 u64 search_start = key.offset; find_desired_extent() local
[all...] |
| H A D | free-space-cache.c | 2152 u64 search_start, search_bytes; in remove_from_bitmap() local
2164 search_start = *offset; in remove_from_bitmap()
2166 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2167 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2169 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
2176 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2178 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); in remove_from_bitmap()
2210 search_start = *offset; in remove_from_bitmap()
2212 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2214 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
[all …]
|
| H A D | extent-tree.c | 3917 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, in find_free_extent_clustered()
3922 ffe_ctl->num_bytes, ffe_ctl->search_start, in find_free_extent_clustered()
3979 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, in find_free_extent_unclustered()
4181 ffe_ctl->search_start = ffe_ctl->found_offset; in do_allocation_zoned()
4538 * Any available blocks before search_start are skipped.
4570 ffe_ctl->search_start = 0; in find_free_extent()
4617 ffe_ctl->search_start = max(ffe_ctl->search_start, in find_free_extent()
4619 ffe_ctl->search_start = max(ffe_ctl->search_start, ffe_ct in find_free_extent()
[all...] |
| H A D | scrub.c | 1461 * Return <0 if the extent item is before @search_start. in get_raid56_logic_offset()
1465 u64 search_start, u64 search_len) in get_raid56_logic_offset()
1479 if (key.objectid + len <= search_start) in compare_extent_item_range() argument
1481 if (key.objectid >= search_start + search_len) in compare_extent_item_range()
1488 * [@search_start, @search_start + @search_length) in compare_extent_item_range()
1495 * NOTE: If an extent item starts before @search_start, we will still in compare_extent_item_range()
1504 u64 search_start, u64 search_len)
1514 key.objectid = search_start;
1535 * an extent item starting before @search_start in find_first_extent_item()
1518 find_first_extent_item(struct btrfs_root * extent_root,struct btrfs_path * path,u64 search_start,u64 search_len) find_first_extent_item() argument
[all...] |
| H A D | volumes.c | 1787 * @search_start: the position from which to begin the search
1817 u64 search_start; in find_free_dev_extent()
1827 search_start = dev_extent_search_start(device); in find_free_dev_extent()
1828 max_hole_start = search_start; in find_free_dev_extent()
1839 if (search_start >= search_end || in find_free_dev_extent()
1851 key.offset = search_start; in find_free_dev_extent()
1857 while (search_start < search_end) { in find_free_dev_extent()
1883 if (key.offset > search_start) { in find_free_dev_extent()
1884 hole_size = key.offset - search_start; in find_free_dev_extent()
1885 dev_extent_hole_check(device, &search_start, in find_free_dev_extent()
1816 u64 search_start; find_free_dev_extent() local
[all...] |
| H A D | relocation.c | 174 u64 search_start; member
3349 if (rc->search_start >= last) { in find_next_extent()
3354 key.objectid = rc->search_start; in find_next_extent()
3386 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3393 rc->search_start) { in find_next_extent()
3404 rc->search_start = end + 1; in find_next_extent()
3407 rc->search_start = key.objectid + key.offset; in find_next_extent()
3409 rc->search_start = key.objectid + in find_next_extent()
3449 rc->search_start = rc->block_group->start; in prepare_to_relocate()
3577 rc->search_start in relocate_block_group()
[all...] |
| H A D | inode.c | 2775 u64 search_start = start; in add_pending_csums()
2778 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
2779 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
2784 em = btrfs_get_extent(inode, NULL, search_start, search_len); in btrfs_find_new_delalloc_bytes()
2792 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
2793 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
2797 ret = btrfs_set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
2798 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
2801 search_start = btrfs_extent_map_end(em); in btrfs_find_new_delalloc_bytes()
2783 u64 search_start = start; btrfs_find_new_delalloc_bytes() local
|
| H A D | send.c | 6342 u64 search_start = start; in range_is_hole_in_parent() local
6351 key.offset = search_start; in range_is_hole_in_parent()
6358 while (search_start < end) { in range_is_hole_in_parent()
6389 search_start = extent_end; in range_is_hole_in_parent()
|
| /linux/include/trace/events/ |
| H A D | btrfs.h | 1386 __entry->start = ffe_ctl->search_start;
|