| /Linux-v4.19/fs/reiserfs/ |
| D | bitmap.c | 791 hint->search_start = in new_hashed_relocation()
817 hint->search_start = hash; in dirid_groups()
846 hint->search_start = hash; in oid_groups()
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()
962 hint->search_start = in displace_new_packing_locality()
981 if (border > hint->search_start) in old_hashed_relocation()
[all …]
|
| D | reiserfs.h | 3290 b_blocknr_t search_start; member
|
| /Linux-v4.19/fs/ocfs2/ |
| D | reservations.c | 416 unsigned int search_start, in ocfs2_resmap_find_free_bits() argument
425 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, in ocfs2_resmap_find_free_bits()
430 start = search_start; in ocfs2_resmap_find_free_bits()
434 if (offset >= (search_start + search_len)) in ocfs2_resmap_find_free_bits()
|
| /Linux-v4.19/fs/btrfs/ |
| D | file.c | 470 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
473 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
474 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
479 em = btrfs_get_extent(inode, NULL, 0, search_start, in btrfs_find_new_delalloc_bytes()
488 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
489 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
493 ret = set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
494 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
498 search_start = extent_map_end(em); in btrfs_find_new_delalloc_bytes()
752 u64 search_start = start; in __btrfs_drop_extents() local
[all …]
|
| D | free-space-cache.c | 1859 u64 search_start, search_bytes; in remove_from_bitmap() local
1871 search_start = *offset; in remove_from_bitmap()
1873 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1874 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
1876 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
1883 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1885 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes); in remove_from_bitmap()
1917 search_start = *offset; in remove_from_bitmap()
1919 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
1921 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
[all …]
|
| D | volumes.c | 1338 u64 search_start, u64 *start, u64 *len) in find_free_dev_extent_start() argument
1359 search_start = max_t(u64, search_start, SZ_1M); in find_free_dev_extent_start()
1365 max_hole_start = search_start; in find_free_dev_extent_start()
1369 if (search_start >= search_end || in find_free_dev_extent_start()
1380 key.offset = search_start; in find_free_dev_extent_start()
1415 if (key.offset > search_start) { in find_free_dev_extent_start()
1416 hole_size = key.offset - search_start; in find_free_dev_extent_start()
1423 &search_start, in find_free_dev_extent_start()
1425 if (key.offset >= search_start) { in find_free_dev_extent_start()
1426 hole_size = key.offset - search_start; in find_free_dev_extent_start()
[all …]
|
| D | ctree.c | 1023 u64 search_start, u64 empty_size) in __btrfs_cow_block() argument
1055 search_start, empty_size); in __btrfs_cow_block()
1461 u64 search_start; in btrfs_cow_block() local
1479 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
1486 parent_slot, cow_ret, search_start, 0); in btrfs_cow_block()
1553 u64 search_start = *last_ret; in btrfs_realloc_node() local
1633 if (search_start == 0) in btrfs_realloc_node()
1634 search_start = last_block; in btrfs_realloc_node()
1639 &cur, search_start, in btrfs_realloc_node()
1647 search_start = cur->start; in btrfs_realloc_node()
[all …]
|
| D | extent-tree.c | 6164 static u64 first_logical_byte(struct btrfs_fs_info *fs_info, u64 search_start) in first_logical_byte() argument
6176 cache = btrfs_lookup_first_block_group(fs_info, search_start); in first_logical_byte()
7234 u64 search_start = 0; in find_free_extent() local
7300 search_start = max(search_start, first_logical_byte(fs_info, 0)); in find_free_extent()
7301 search_start = max(search_start, hint_byte); in find_free_extent()
7302 if (search_start == hint_byte) { in find_free_extent()
7303 block_group = btrfs_lookup_block_group(fs_info, search_start); in find_free_extent()
7349 search_start = block_group->key.objectid; in find_free_extent()
7416 search_start, num_bytes); in find_free_extent()
7471 last_ptr, search_start, in find_free_extent()
[all …]
|
| D | relocation.c | 172 u64 search_start; member
3778 if (rc->search_start >= last) { in find_next_extent()
3783 key.objectid = rc->search_start; in find_next_extent()
3815 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3822 rc->search_start) { in find_next_extent()
3833 rc->search_start = end + 1; in find_next_extent()
3836 rc->search_start = key.objectid + key.offset; in find_next_extent()
3838 rc->search_start = key.objectid + in find_next_extent()
3892 rc->search_start = rc->block_group->key.objectid; in prepare_to_relocate()
4021 rc->search_start = key.objectid; in relocate_block_group()
|
| D | volumes.h | 445 u64 search_start, u64 *start, u64 *max_avail);
|
| D | send.c | 5528 u64 search_start = start; in range_is_hole_in_parent() local
5537 key.offset = search_start; in range_is_hole_in_parent()
5544 while (search_start < end) { in range_is_hole_in_parent()
5582 search_start = extent_end; in range_is_hole_in_parent()
|
| D | extent_io.c | 239 struct rb_node *search_start, in tree_insert() argument
255 p = search_start ? &search_start : &root->rb_node; in tree_insert()
|
