| /kernel/linux/linux-5.10/fs/reiserfs/ |
| H A D | bitmap.c | 781 /*hint->search_start = hint->beg;*/ in new_hashed_relocation()
791 hint->search_start = in new_hashed_relocation()
817 hint->search_start = hash; in dirid_groups()
846 hint->search_start = hash; in oid_groups()
865 * structure supplied; then we rely on supplied search_start in get_left_neighbor()
877 hint->search_start = bh->b_blocknr; in get_left_neighbor()
889 hint->search_start = t; in get_left_neighbor()
922 hint->search_start = in displace_large_file()
927 hint->search_start = in displace_large_file()
944 hint->search_start in hash_formatted_node()
[all...] |
| /kernel/linux/linux-6.6/fs/reiserfs/ |
| H A D | bitmap.c | 781 /*hint->search_start = hint->beg;*/ in new_hashed_relocation()
791 hint->search_start = in new_hashed_relocation()
817 hint->search_start = hash; in dirid_groups()
846 hint->search_start = hash; in oid_groups()
865 * structure supplied; then we rely on supplied search_start in get_left_neighbor()
877 hint->search_start = bh->b_blocknr; in get_left_neighbor()
889 hint->search_start = t; in get_left_neighbor()
922 hint->search_start = in displace_large_file()
927 hint->search_start = in displace_large_file()
944 hint->search_start in hash_formatted_node()
[all...] |
| /kernel/linux/linux-5.10/fs/ocfs2/ |
| H A D | reservations.c | 389 * inside the reservations tree (search_start, search_len). The range
395 * This function searches the bitmap range starting at search_start
405 unsigned int search_start, in ocfs2_resmap_find_free_bits()
414 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, in ocfs2_resmap_find_free_bits()
419 start = search_start; in ocfs2_resmap_find_free_bits()
423 if (offset >= (search_start + search_len)) in ocfs2_resmap_find_free_bits()
403 ocfs2_resmap_find_free_bits(struct ocfs2_reservation_map *resmap, unsigned int wanted, unsigned int search_start, unsigned int search_len, unsigned int *rstart, unsigned int *rlen) ocfs2_resmap_find_free_bits() argument
|
| /kernel/linux/linux-6.6/fs/ocfs2/ |
| H A D | reservations.c | 385 * inside the reservations tree (search_start, search_len). The range
391 * This function searches the bitmap range starting at search_start
401 unsigned int search_start, in ocfs2_resmap_find_free_bits()
410 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, in ocfs2_resmap_find_free_bits()
415 start = search_start; in ocfs2_resmap_find_free_bits()
419 if (offset >= (search_start + search_len)) in ocfs2_resmap_find_free_bits()
399 ocfs2_resmap_find_free_bits(struct ocfs2_reservation_map *resmap, unsigned int wanted, unsigned int search_start, unsigned int search_len, unsigned int *rstart, unsigned int *rlen) ocfs2_resmap_find_free_bits() argument
|
| /kernel/linux/linux-6.6/arch/riscv/mm/ |
| H A D | init.c | 1378 unsigned long search_start = memblock_start_of_DRAM(); in reserve_crashkernel() local
1416 search_start = (unsigned long)dma32_phys_limit; in reserve_crashkernel()
1428 search_start = crash_base; in reserve_crashkernel()
1440 search_start, search_end); in reserve_crashkernel()
1456 search_start = memblock_start_of_DRAM(); in reserve_crashkernel()
1464 search_start = (unsigned long)dma32_phys_limit; in reserve_crashkernel()
1470 search_start, search_end); in reserve_crashkernel()
|
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | extent-tree.c | 2521 static u64 first_logical_byte(struct btrfs_fs_info *fs_info, u64 search_start) in first_logical_byte() argument
2533 cache = btrfs_lookup_first_block_group(fs_info, search_start); in first_logical_byte()
3495 u64 search_start; member
3577 ffe_ctl->search_start, ffe_ctl->num_bytes); in find_free_extent_clustered()
3617 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, in find_free_extent_clustered()
3622 ffe_ctl->num_bytes, ffe_ctl->search_start, in find_free_extent_clustered()
3628 ffe_ctl->search_start, in find_free_extent_clustered()
3690 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, in find_free_extent_unclustered()
3976 * Any available blocks before search_start are skipped.
4013 ffe_ctl.search_start in find_free_extent()
[all...] |
| H A D | free-space-cache.c | 1983 u64 search_start, search_bytes; in remove_from_bitmap() local
1995 search_start = *offset; in remove_from_bitmap()
1997 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1998 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2000 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
2007 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2009 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes); in remove_from_bitmap()
2041 search_start = *offset; in remove_from_bitmap()
2043 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2045 if (ret < 0 || search_start ! in remove_from_bitmap()
2954 u64 search_start = cluster->window_start; btrfs_alloc_from_bitmap() local
[all...] |
| H A D | relocation.c | 143 u64 search_start; member
3133 if (rc->search_start >= last) { in find_next_extent()
3138 key.objectid = rc->search_start; in find_next_extent()
3170 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3177 rc->search_start) { in find_next_extent()
3188 rc->search_start = end + 1; in find_next_extent()
3191 rc->search_start = key.objectid + key.offset; in find_next_extent()
3193 rc->search_start = key.objectid + in find_next_extent()
3247 rc->search_start = rc->block_group->start; in prepare_to_relocate()
3375 rc->search_start in relocate_block_group()
[all...] |
| H A D | ctree.c | 1006 * search_start -- an allocation hint for the new block
1017 u64 search_start, u64 empty_size, in __btrfs_cow_block()
1049 level, search_start, empty_size, nest); in __btrfs_cow_block()
1487 u64 search_start; in btrfs_cow_block() local
1509 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
1523 parent_slot, cow_ret, search_start, 0, nest); in btrfs_cow_block()
1607 u64 search_start = *last_ret; in btrfs_realloc_node() local
1687 if (search_start == 0) in btrfs_realloc_node()
1688 search_start = last_block; in btrfs_realloc_node()
1693 &cur, search_start, in btrfs_realloc_node()
1012 __btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size, enum btrfs_lock_nesting nest) __btrfs_cow_block() argument
[all...] |
| H A D | volumes.c | 1540 * @search_start: the position from which to begin the search
1564 u64 num_bytes, u64 search_start, u64 *start, in find_free_dev_extent_start()
1581 search_start = dev_extent_search_start(device, search_start); in find_free_dev_extent_start()
1587 max_hole_start = search_start; in find_free_dev_extent_start()
1591 if (search_start >= search_end || in find_free_dev_extent_start()
1602 key.offset = search_start; in find_free_dev_extent_start()
1614 while (search_start < search_end) { in find_free_dev_extent_start()
1640 if (key.offset > search_start) { in find_free_dev_extent_start()
1641 hole_size = key.offset - search_start; in find_free_dev_extent_start()
1563 find_free_dev_extent_start(struct btrfs_device *device, u64 num_bytes, u64 search_start, u64 *start, u64 *len) find_free_dev_extent_start() argument
[all...] |
| H A D | file.c | 691 u64 search_start = start; in __btrfs_drop_extents() local
717 search_start, modify_tree); in __btrfs_drop_extents()
720 if (ret > 0 && path->slots[0] > 0 && search_start == start) { in __btrfs_drop_extents()
786 if (extent_end == key.offset && extent_end >= search_start) { in __btrfs_drop_extents()
791 if (extent_end <= search_start) { in __btrfs_drop_extents()
797 search_start = max(key.offset, start); in __btrfs_drop_extents()
884 search_start = extent_end; in __btrfs_drop_extents()
|
| H A D | ioctl.c | 1293 u64 search_start; in cluster_pages_for_defrag() local
1404 search_start = page_start; in cluster_pages_for_defrag()
1405 while (search_start < page_end) { in cluster_pages_for_defrag()
1408 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, search_start, in cluster_pages_for_defrag()
1409 page_end - search_start); in cluster_pages_for_defrag()
1420 search_start = extent_map_end(em); in cluster_pages_for_defrag()
|
| H A D | inode.c | 2260 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
2263 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
2264 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
2269 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len); in btrfs_find_new_delalloc_bytes()
2277 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
2278 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
2282 ret = set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
2283 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
2287 search_start = extent_map_end(em); in btrfs_find_new_delalloc_bytes()
|
| H A D | extent_io.c | 356 struct rb_node *search_start, in tree_insert()
372 p = search_start ? &search_start : &root->rb_node; in tree_insert()
355 tree_insert(struct rb_root *root, struct rb_node *search_start, u64 offset, struct rb_node *node, struct rb_node ***p_in, struct rb_node **parent_in) tree_insert() argument
|
| H A D | send.c | 5840 u64 search_start = start; in range_is_hole_in_parent() local
5849 key.offset = search_start; in range_is_hole_in_parent()
5856 while (search_start < end) { in range_is_hole_in_parent()
5885 search_start = extent_end; in range_is_hole_in_parent()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | free-space-cache.c | 2154 u64 search_start, search_bytes; in remove_from_bitmap() local
2166 search_start = *offset; in remove_from_bitmap()
2168 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2169 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2171 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
2178 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2180 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); in remove_from_bitmap()
2212 search_start = *offset; in remove_from_bitmap()
2214 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2216 if (ret < 0 || search_start ! in remove_from_bitmap()
3190 u64 search_start = cluster->window_start; btrfs_alloc_from_bitmap() local
[all...] |
| H A D | file.c | 211 u64 search_start = args->start; in btrfs_drop_extents() local
251 search_start, modify_tree); in btrfs_drop_extents()
254 if (ret > 0 && path->slots[0] > 0 && search_start == args->start) { in btrfs_drop_extents()
318 if (extent_end == key.offset && extent_end >= search_start) { in btrfs_drop_extents()
323 if (extent_end <= search_start) { in btrfs_drop_extents()
329 search_start = max(key.offset, args->start); in btrfs_drop_extents()
420 search_start = extent_end; in btrfs_drop_extents()
3568 u64 search_start = last_extent_end; in find_desired_extent() local
3576 search_start = offset; in find_desired_extent()
3580 search_start, in find_desired_extent()
3609 u64 search_start = key.offset; find_desired_extent() local
[all...] |
| H A D | extent-tree.h | 26 u64 search_start; member
|
| H A D | extent-tree.c | 3569 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, in find_free_extent_clustered()
3574 ffe_ctl->num_bytes, ffe_ctl->search_start, in find_free_extent_clustered()
3631 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, in find_free_extent_unclustered()
3836 ffe_ctl->search_start = ffe_ctl->found_offset; in do_allocation_zoned()
4200 * Any available blocks before search_start are skipped.
4232 ffe_ctl->search_start = 0; in find_free_extent()
4268 ffe_ctl->search_start = max(ffe_ctl->search_start, in find_free_extent()
4270 ffe_ctl->search_start = max(ffe_ctl->search_start, ffe_ct in find_free_extent()
[all...] |
| H A D | relocation.c | 155 u64 search_start; member
3512 if (rc->search_start >= last) { in find_next_extent()
3517 key.objectid = rc->search_start; in find_next_extent()
3549 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3556 rc->search_start) { in find_next_extent()
3567 rc->search_start = end + 1; in find_next_extent()
3570 rc->search_start = key.objectid + key.offset; in find_next_extent()
3572 rc->search_start = key.objectid + in find_next_extent()
3612 rc->search_start = rc->block_group->start; in prepare_to_relocate()
3727 rc->search_start in relocate_block_group()
[all...] |
| H A D | scrub.c | 1331 * Return <0 if the extent item is before @search_start.
1335 u64 search_start, u64 search_len) in compare_extent_item_range()
1349 if (key.objectid + len <= search_start) in compare_extent_item_range()
1351 if (key.objectid >= search_start + search_len) in compare_extent_item_range()
1358 * [@search_start, @search_start + @search_length)
1365 * NOTE: If an extent item starts before @search_start, we will still
1374 u64 search_start, u64 search_len) in find_first_extent_item()
1388 key.objectid = search_start; in find_first_extent_item()
1398 * an extent item starting before @search_start in find_first_extent_item()
1334 compare_extent_item_range(struct btrfs_path *path, u64 search_start, u64 search_len) compare_extent_item_range() argument
1372 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 | ctree.c | 515 * search_start -- an allocation hint for the new block
526 u64 search_start, u64 empty_size, in __btrfs_cow_block()
559 search_start, empty_size, nest); in __btrfs_cow_block()
693 u64 search_start; in btrfs_cow_block() local
726 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
736 parent_slot, cow_ret, search_start, 0, nest); in btrfs_cow_block()
820 u64 search_start = *last_ret; in btrfs_realloc_node() local
883 if (search_start == 0) in btrfs_realloc_node()
884 search_start = last_block; in btrfs_realloc_node()
888 &cur, search_start, in btrfs_realloc_node()
521 __btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size, enum btrfs_lock_nesting nest) __btrfs_cow_block() argument
[all...] |
| H A D | volumes.c | 1564 * @search_start: the position from which to begin the search
1594 u64 search_start; in find_free_dev_extent() local
1604 search_start = dev_extent_search_start(device); in find_free_dev_extent()
1605 max_hole_start = search_start; in find_free_dev_extent()
1616 if (search_start >= search_end || in find_free_dev_extent()
1627 key.offset = search_start; in find_free_dev_extent()
1634 while (search_start < search_end) { in find_free_dev_extent()
1660 if (key.offset > search_start) { in find_free_dev_extent()
1661 hole_size = key.offset - search_start; in find_free_dev_extent()
1662 dev_extent_hole_check(device, &search_start, in find_free_dev_extent()
[all...] |
| H A D | inode.c | 2614 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
2617 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
2618 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
2623 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len); in btrfs_find_new_delalloc_bytes()
2631 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
2632 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
2636 ret = set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
2637 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
2640 search_start = extent_map_end(em); in btrfs_find_new_delalloc_bytes()
|
| H A D | send.c | 6394 u64 search_start = start; in range_is_hole_in_parent() local
6403 key.offset = search_start; in range_is_hole_in_parent()
6410 while (search_start < end) { in range_is_hole_in_parent()
6439 search_start = extent_end; in range_is_hole_in_parent()
|