| /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 | 3291 b_blocknr_t search_start; member
|
| /fs/ocfs2/ |
| D | reservations.c | 403 unsigned int search_start, in ocfs2_resmap_find_free_bits() argument
412 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, in ocfs2_resmap_find_free_bits()
417 start = search_start; in ocfs2_resmap_find_free_bits()
421 if (offset >= (search_start + search_len)) in ocfs2_resmap_find_free_bits()
|
| /fs/btrfs/ |
| D | extent-tree.c | 2511 static u64 first_logical_byte(struct btrfs_fs_info *fs_info, u64 search_start) in first_logical_byte() argument
2523 cache = btrfs_lookup_first_block_group(fs_info, search_start); in first_logical_byte()
3484 u64 search_start; member
3572 ffe_ctl->search_start, ffe_ctl->num_bytes); in find_free_extent_clustered()
3612 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, in find_free_extent_clustered()
3617 ffe_ctl->num_bytes, ffe_ctl->search_start, in find_free_extent_clustered()
3623 ffe_ctl->search_start, in find_free_extent_clustered()
3685 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, in find_free_extent_unclustered()
3861 ffe_ctl->search_start = ffe_ctl->found_offset; in do_allocation_zoned()
4199 ffe_ctl.search_start = 0; in find_free_extent()
[all …]
|
| D | free-space-cache.c | 1991 u64 search_start, search_bytes; in remove_from_bitmap() local
2003 search_start = *offset; in remove_from_bitmap()
2005 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2006 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2008 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
2015 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2017 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes); in remove_from_bitmap()
2049 search_start = *offset; in remove_from_bitmap()
2051 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2053 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
[all …]
|
| D | ctree.c | 384 u64 search_start, u64 empty_size, in __btrfs_cow_block() argument
417 search_start, empty_size, nest); in __btrfs_cow_block()
545 u64 search_start; in btrfs_cow_block() local
578 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
588 parent_slot, cow_ret, search_start, 0, nest); in btrfs_cow_block()
672 u64 search_start = *last_ret; in btrfs_realloc_node() local
735 if (search_start == 0) in btrfs_realloc_node()
736 search_start = last_block; in btrfs_realloc_node()
740 &cur, search_start, in btrfs_realloc_node()
749 search_start = cur->start; in btrfs_realloc_node()
[all …]
|
| D | relocation.c | 144 u64 search_start; member
3484 if (rc->search_start >= last) { in find_next_extent()
3489 key.objectid = rc->search_start; in find_next_extent()
3521 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3528 rc->search_start) { in find_next_extent()
3539 rc->search_start = end + 1; in find_next_extent()
3542 rc->search_start = key.objectid + key.offset; in find_next_extent()
3544 rc->search_start = key.objectid + in find_next_extent()
3584 rc->search_start = rc->block_group->start; in prepare_to_relocate()
3699 rc->search_start = key.objectid; in relocate_block_group()
|
| D | volumes.c | 1632 u64 num_bytes, u64 search_start, u64 *start, in find_free_dev_extent_start() argument
1649 search_start = dev_extent_search_start(device, search_start); in find_free_dev_extent_start()
1658 max_hole_start = search_start; in find_free_dev_extent_start()
1662 if (search_start >= search_end || in find_free_dev_extent_start()
1673 key.offset = search_start; in find_free_dev_extent_start()
1680 while (search_start < search_end) { in find_free_dev_extent_start()
1706 if (key.offset > search_start) { in find_free_dev_extent_start()
1707 hole_size = key.offset - search_start; in find_free_dev_extent_start()
1708 dev_extent_hole_check(device, &search_start, &hole_size, in find_free_dev_extent_start()
1712 max_hole_start = search_start; in find_free_dev_extent_start()
[all …]
|
| D | file.c | 700 u64 search_start = args->start; in btrfs_drop_extents() local
741 search_start, modify_tree); in btrfs_drop_extents()
744 if (ret > 0 && path->slots[0] > 0 && search_start == args->start) { in btrfs_drop_extents()
810 if (extent_end == key.offset && extent_end >= search_start) { in btrfs_drop_extents()
815 if (extent_end <= search_start) { in btrfs_drop_extents()
821 search_start = max(key.offset, args->start); in btrfs_drop_extents()
912 search_start = extent_end; in btrfs_drop_extents()
|
| D | ioctl.c | 1224 u64 search_start; in cluster_pages_for_defrag() local
1342 search_start = page_start; in cluster_pages_for_defrag()
1343 while (search_start < page_end) { in cluster_pages_for_defrag()
1346 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, search_start, in cluster_pages_for_defrag()
1347 page_end - search_start); in cluster_pages_for_defrag()
1358 search_start = extent_map_end(em); in cluster_pages_for_defrag()
|
| D | inode.c | 2643 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
2646 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
2647 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
2652 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len); in btrfs_find_new_delalloc_bytes()
2660 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
2661 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
2665 ret = set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
2666 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
2670 search_start = extent_map_end(em); in btrfs_find_new_delalloc_bytes()
|
| 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()
|
| D | extent_io.c | 366 struct rb_node *search_start, in tree_insert() argument
382 p = search_start ? &search_start : &root->rb_node; in tree_insert()
|