| /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/btrfs/ |
| D | file.c | 706 u64 search_start = start; in __btrfs_drop_extents() local
733 search_start, modify_tree); in __btrfs_drop_extents()
736 if (ret > 0 && path->slots[0] > 0 && search_start == start) { in __btrfs_drop_extents()
802 if (extent_end == key.offset && extent_end >= search_start) { in __btrfs_drop_extents()
807 if (extent_end <= search_start) { in __btrfs_drop_extents()
813 search_start = max(key.offset, start); in __btrfs_drop_extents()
897 search_start = extent_end; in __btrfs_drop_extents()
1411 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
1414 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
1415 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
[all …]
|
| D | free-space-cache.c | 1907 u64 search_start, search_bytes; in remove_from_bitmap() local
1919 search_start = *offset; in remove_from_bitmap()
1921 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1922 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
1924 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
1931 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1933 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes); in remove_from_bitmap()
1965 search_start = *offset; in remove_from_bitmap()
1967 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
1969 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
[all …]
|
| D | volumes.c | 1346 u64 search_start, u64 *start, u64 *len) in find_free_dev_extent_start() argument
1367 search_start = max_t(u64, search_start, SZ_1M); in find_free_dev_extent_start()
1373 max_hole_start = search_start; in find_free_dev_extent_start()
1377 if (search_start >= search_end || device->is_tgtdev_for_dev_replace) { in find_free_dev_extent_start()
1387 key.offset = search_start; in find_free_dev_extent_start()
1422 if (key.offset > search_start) { in find_free_dev_extent_start()
1423 hole_size = key.offset - search_start; in find_free_dev_extent_start()
1430 &search_start, in find_free_dev_extent_start()
1432 if (key.offset >= search_start) { in find_free_dev_extent_start()
1433 hole_size = key.offset - search_start; in find_free_dev_extent_start()
[all …]
|
| D | extent-tree.c | 6435 static u64 first_logical_byte(struct btrfs_fs_info *fs_info, u64 search_start) in first_logical_byte() argument
6447 cache = btrfs_lookup_first_block_group(fs_info, search_start); in first_logical_byte()
7573 u64 search_start = 0; in find_free_extent() local
7640 search_start = max(search_start, first_logical_byte(fs_info, 0)); in find_free_extent()
7641 search_start = max(search_start, hint_byte); in find_free_extent()
7642 if (search_start == hint_byte) { in find_free_extent()
7643 block_group = btrfs_lookup_block_group(fs_info, search_start); in find_free_extent()
7688 search_start = block_group->key.objectid; in find_free_extent()
7763 search_start, num_bytes); in find_free_extent()
7818 last_ptr, search_start, in find_free_extent()
[all …]
|
| D | ctree.c | 1080 u64 search_start, u64 empty_size) in __btrfs_cow_block() argument
1112 search_start, empty_size); in __btrfs_cow_block()
1517 u64 search_start; in btrfs_cow_block() local
1535 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
1542 parent_slot, cow_ret, search_start, 0); in btrfs_cow_block()
1609 u64 search_start = *last_ret; in btrfs_realloc_node() local
1684 if (search_start == 0) in btrfs_realloc_node()
1685 search_start = last_block; in btrfs_realloc_node()
1690 &cur, search_start, in btrfs_realloc_node()
1698 search_start = cur->start; in btrfs_realloc_node()
[all …]
|
| D | relocation.c | 185 u64 search_start; member
3863 if (rc->search_start >= last) {
3868 key.objectid = rc->search_start;
3900 key.objectid + key.offset <= rc->search_start) {
3907 rc->search_start) {
3918 rc->search_start = end + 1;
3921 rc->search_start = key.objectid + key.offset;
3923 rc->search_start = key.objectid +
3977 rc->search_start = rc->block_group->key.objectid;
4135 rc->search_start = key.objectid;
|
| D | volumes.h | 468 u64 search_start, u64 *start, u64 *max_avail);
|
| D | send.c | 5548 u64 search_start = start; in range_is_hole_in_parent() local
5557 key.offset = search_start; in range_is_hole_in_parent()
5564 while (search_start < end) { in range_is_hole_in_parent()
5602 search_start = extent_end; in range_is_hole_in_parent()
|
| D | extent_io.c | 251 struct rb_node *search_start, in tree_insert() argument
267 p = search_start ? &search_start : &root->rb_node; in tree_insert()
|
| /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()
|