Home
last modified time | relevance | path

Searched refs:search_start (Results 1 – 17 of 17) sorted by relevance

/openbmc/linux/fs/reiserfs/
H A Dbitmap.c791 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 …]
H A Dreiserfs.h3292 b_blocknr_t search_start; member
/openbmc/u-boot/examples/api/
H A Dglue.c43 uint32_t search_start = 0; in api_search_sig() local
52 search_start = search_hint & ~0x000fffff; in api_search_sig()
53 search_end = search_start + API_SEARCH_LEN - API_SIG_MAGLEN; in api_search_sig()
55 sp = (unsigned char *)search_start; in api_search_sig()
/openbmc/linux/fs/ocfs2/
H A Dreservations.c401 unsigned int search_start, in ocfs2_resmap_find_free_bits() argument
410 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, in ocfs2_resmap_find_free_bits()
415 start = search_start; in ocfs2_resmap_find_free_bits()
419 if (offset >= (search_start + search_len)) in ocfs2_resmap_find_free_bits()
/openbmc/linux/arch/riscv/mm/
H A Dinit.c1404 unsigned long search_start = memblock_start_of_DRAM(); in reserve_crashkernel() local
1442 search_start = (unsigned long)dma32_phys_limit; in reserve_crashkernel()
1454 search_start = crash_base; in reserve_crashkernel()
1466 search_start, search_end); in reserve_crashkernel()
1482 search_start = memblock_start_of_DRAM(); in reserve_crashkernel()
1490 search_start = (unsigned long)dma32_phys_limit; in reserve_crashkernel()
1496 search_start, search_end); in reserve_crashkernel()
/openbmc/linux/fs/btrfs/
H A Dfile.c211 u64 search_start = args->start; in btrfs_drop_extents() local
251 search_start, modify_tree); in btrfs_drop_extents()
254 if (ret > 0 && path->slots[0] > 0 && search_start == args->start) { in btrfs_drop_extents()
318 if (extent_end == key.offset && extent_end >= search_start) { in btrfs_drop_extents()
323 if (extent_end <= search_start) { in btrfs_drop_extents()
329 search_start = max(key.offset, args->start); in btrfs_drop_extents()
420 search_start = extent_end; in btrfs_drop_extents()
3621 u64 search_start = last_extent_end; in find_desired_extent() local
3629 search_start = offset; in find_desired_extent()
3633 search_start, in find_desired_extent()
[all …]
H A Dfree-space-cache.c2155 u64 search_start, search_bytes; in remove_from_bitmap() local
2167 search_start = *offset; in remove_from_bitmap()
2169 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2170 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, in remove_from_bitmap()
2172 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
2179 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
2181 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); in remove_from_bitmap()
2213 search_start = *offset; in remove_from_bitmap()
2215 ret = search_bitmap(ctl, bitmap_info, &search_start, in remove_from_bitmap()
2217 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
[all …]
H A Dextent-tree.h26 u64 search_start; member
H A Dextent-tree.c3588 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, in find_free_extent_clustered()
3593 ffe_ctl->num_bytes, ffe_ctl->search_start, in find_free_extent_clustered()
3650 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, in find_free_extent_unclustered()
3855 ffe_ctl->search_start = ffe_ctl->found_offset; in do_allocation_zoned()
4251 ffe_ctl->search_start = 0; in find_free_extent()
4287 ffe_ctl->search_start = max(ffe_ctl->search_start, in find_free_extent()
4289 ffe_ctl->search_start = max(ffe_ctl->search_start, ffe_ctl->hint_byte); in find_free_extent()
4290 if (ffe_ctl->search_start == ffe_ctl->hint_byte) { in find_free_extent()
4292 ffe_ctl->search_start); in find_free_extent()
4347 ffe_ctl->search_start = block_group->start; in find_free_extent()
[all …]
H A Dctree.c534 u64 search_start, u64 empty_size, in btrfs_force_cow_block() argument
567 search_start, empty_size, nest); in btrfs_force_cow_block()
715 u64 search_start; in btrfs_cow_block() local
747 search_start = buf->start & ~((u64)SZ_1G - 1); in btrfs_cow_block()
757 cow_ret, search_start, 0, nest); in btrfs_cow_block()
837 u64 search_start = *last_ret; in btrfs_realloc_node() local
900 if (search_start == 0) in btrfs_realloc_node()
901 search_start = last_block; in btrfs_realloc_node()
905 &cur, search_start, in btrfs_realloc_node()
914 search_start = cur->start; in btrfs_realloc_node()
[all …]
H A Drelocation.c155 u64 search_start; member
3443 if (rc->search_start >= last) { in find_next_extent()
3448 key.objectid = rc->search_start; in find_next_extent()
3480 key.objectid + key.offset <= rc->search_start) { in find_next_extent()
3487 rc->search_start) { in find_next_extent()
3498 rc->search_start = end + 1; in find_next_extent()
3501 rc->search_start = key.objectid + key.offset; in find_next_extent()
3503 rc->search_start = key.objectid + in find_next_extent()
3543 rc->search_start = rc->block_group->start; in prepare_to_relocate()
3656 rc->search_start = key.objectid; in relocate_block_group()
H A Dscrub.c1335 u64 search_start, u64 search_len) in compare_extent_item_range() argument
1349 if (key.objectid + len <= search_start) in compare_extent_item_range()
1351 if (key.objectid >= search_start + search_len) in compare_extent_item_range()
1374 u64 search_start, u64 search_len) in find_first_extent_item() argument
1388 key.objectid = search_start; in find_first_extent_item()
1410 if (key.objectid >= search_start + search_len) in find_first_extent_item()
1416 ret = compare_extent_item_range(path, search_start, search_len); in find_first_extent_item()
H A Dvolumes.c1637 u64 search_start; in find_free_dev_extent() local
1647 search_start = dev_extent_search_start(device); in find_free_dev_extent()
1648 max_hole_start = search_start; in find_free_dev_extent()
1659 if (search_start >= search_end || in find_free_dev_extent()
1670 key.offset = search_start; in find_free_dev_extent()
1677 while (search_start < search_end) { in find_free_dev_extent()
1703 if (key.offset > search_start) { in find_free_dev_extent()
1704 hole_size = key.offset - search_start; in find_free_dev_extent()
1705 dev_extent_hole_check(device, &search_start, &hole_size, in find_free_dev_extent()
1709 max_hole_start = search_start; in find_free_dev_extent()
[all …]
H A Dctree.h546 u64 search_start, u64 empty_size,
H A Dinode.c2616 u64 search_start = start; in btrfs_find_new_delalloc_bytes() local
2619 while (search_start < end) { in btrfs_find_new_delalloc_bytes()
2620 const u64 search_len = end - search_start + 1; in btrfs_find_new_delalloc_bytes()
2625 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len); in btrfs_find_new_delalloc_bytes()
2633 if (em->start < search_start) in btrfs_find_new_delalloc_bytes()
2634 em_len -= search_start - em->start; in btrfs_find_new_delalloc_bytes()
2638 ret = set_extent_bit(&inode->io_tree, search_start, in btrfs_find_new_delalloc_bytes()
2639 search_start + em_len - 1, in btrfs_find_new_delalloc_bytes()
2642 search_start = extent_map_end(em); in btrfs_find_new_delalloc_bytes()
H A Dsend.c6460 u64 search_start = start; in range_is_hole_in_parent() local
6469 key.offset = search_start; in range_is_hole_in_parent()
6476 while (search_start < end) { in range_is_hole_in_parent()
6505 search_start = extent_end; in range_is_hole_in_parent()
/openbmc/linux/include/trace/events/
H A Dbtrfs.h1392 __entry->start = ffe_ctl->search_start;