| /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 | 405 unsigned int search_start, in ocfs2_resmap_find_free_bits() argument
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()
|
| /fs/btrfs/ |
| 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()
4013 ffe_ctl.search_start = 0; in find_free_extent()
4044 ffe_ctl.search_start = max(ffe_ctl.search_start, in find_free_extent()
[all …]
|
| 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 != *offset) in remove_from_bitmap()
[all …]
|
| 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 = key.objectid; in relocate_block_group()
|
| D | volumes.c | 1564 u64 num_bytes, u64 search_start, u64 *start, in find_free_dev_extent_start() argument
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()
1642 dev_extent_hole_check(device, &search_start, &hole_size, in find_free_dev_extent_start()
1646 max_hole_start = search_start; in find_free_dev_extent_start()
[all …]
|
| D | ctree.c | 1017 u64 search_start, u64 empty_size, in __btrfs_cow_block() argument
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()
1702 search_start = cur->start; in btrfs_realloc_node()
[all …]
|
| 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()
|
| 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()
|
| 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()
|
| D | extent_io.c | 356 struct rb_node *search_start, in tree_insert() argument
372 p = search_start ? &search_start : &root->rb_node; in tree_insert()
|
| 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()
|