| /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 | 3292 b_blocknr_t search_start; member
|
| /fs/ocfs2/ |
| D | reservations.c | 408 unsigned int search_start, in ocfs2_resmap_find_free_bits() argument
417 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, in ocfs2_resmap_find_free_bits()
422 start = search_start; in ocfs2_resmap_find_free_bits()
426 if (offset >= (search_start + search_len)) in ocfs2_resmap_find_free_bits()
|
| /fs/btrfs/ |
| D | file.c | 471 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
474 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
475 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
480 em = btrfs_get_extent(inode, NULL, 0, search_start, in btrfs_find_new_delalloc_bytes()
489 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
490 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
494 ret = set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
495 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
499 search_start = extent_map_end(em); in btrfs_find_new_delalloc_bytes()
762 u64 search_start = start; in __btrfs_drop_extents() local
[all …]
|
| D | extent-tree.c | 2547 static u64 first_logical_byte(struct btrfs_fs_info *fs_info, u64 search_start) in first_logical_byte() argument
2559 cache = btrfs_lookup_first_block_group(fs_info, search_start); in first_logical_byte()
3429 u64 search_start; member
3503 ffe_ctl->search_start, ffe_ctl->num_bytes); in find_free_extent_clustered()
3543 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, in find_free_extent_clustered()
3548 ffe_ctl->num_bytes, ffe_ctl->search_start, in find_free_extent_clustered()
3554 ffe_ctl->search_start, in find_free_extent_clustered()
3616 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, in find_free_extent_unclustered()
3798 ffe_ctl.search_start = 0; in find_free_extent()
3860 ffe_ctl.search_start = max(ffe_ctl.search_start, in find_free_extent()
[all …]
|
| D | free-space-cache.c | 1902 u64 search_start, search_bytes; in remove_from_bitmap() local
1914 search_start = *offset; in remove_from_bitmap()
1916 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1917 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
1919 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
1926 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1928 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes); in remove_from_bitmap()
1960 search_start = *offset; in remove_from_bitmap()
1962 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
1964 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
[all …]
|
| D | volumes.c | 1553 u64 num_bytes, u64 search_start, u64 *start, in find_free_dev_extent_start() argument
1575 search_start = max_t(u64, search_start, SZ_1M); in find_free_dev_extent_start()
1581 max_hole_start = search_start; in find_free_dev_extent_start()
1585 if (search_start >= search_end || in find_free_dev_extent_start()
1596 key.offset = search_start; in find_free_dev_extent_start()
1631 if (key.offset > search_start) { in find_free_dev_extent_start()
1632 hole_size = key.offset - search_start; in find_free_dev_extent_start()
1638 if (contains_pending_extent(device, &search_start, 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()
[all …]
|
| D | ctree.c | 1058 u64 search_start, u64 empty_size) in __btrfs_cow_block() argument
1089 level, search_start, empty_size); in __btrfs_cow_block()
1494 u64 search_start; in btrfs_cow_block() local
1516 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
1530 parent_slot, cow_ret, search_start, 0); in btrfs_cow_block()
1597 u64 search_start = *last_ret; in btrfs_realloc_node() local
1677 if (search_start == 0) in btrfs_realloc_node()
1678 search_start = last_block; in btrfs_realloc_node()
1683 &cur, search_start, in btrfs_realloc_node()
1691 search_start = cur->start; in btrfs_realloc_node()
[all …]
|
| D | relocation.c | 176 u64 search_start; member
3910 if (rc->search_start >= last) { in find_next_extent()
3915 key.objectid = rc->search_start; in find_next_extent()
3947 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3954 rc->search_start) { in find_next_extent()
3965 rc->search_start = end + 1; in find_next_extent()
3968 rc->search_start = key.objectid + key.offset; in find_next_extent()
3970 rc->search_start = key.objectid + in find_next_extent()
4024 rc->search_start = rc->block_group->key.objectid; in prepare_to_relocate()
4154 rc->search_start = key.objectid; in relocate_block_group()
|
| D | send.c | 5627 u64 search_start = start; in range_is_hole_in_parent() local
5636 key.offset = search_start; in range_is_hole_in_parent()
5643 while (search_start < end) { in range_is_hole_in_parent()
5681 search_start = extent_end; in range_is_hole_in_parent()
|
| D | extent_io.c | 327 struct rb_node *search_start, in tree_insert() argument
343 p = search_start ? &search_start : &root->rb_node; in tree_insert()
|