/linux-master/fs/reiserfs/ |
H A D | bitmap.c | 781 /*hint->search_start = hint->beg;*/ 791 hint->search_start = 817 hint->search_start = hash; 846 hint->search_start = hash; 865 * structure supplied; then we rely on supplied search_start 877 hint->search_start = bh->b_blocknr; 889 hint->search_start = t; 922 hint->search_start = 927 hint->search_start = 944 hint->search_start [all...] |
H A D | reiserfs.h | 3277 * search path, used by allocator to deternine search_start by 3295 b_blocknr_t search_start; member in struct:__reiserfs_blocknr_hint
|
/linux-master/fs/btrfs/ |
H A D | ctree.c | 526 * search_start -- an allocation hint for the new block 537 u64 search_start, u64 empty_size, 573 search_start, empty_size, reloc_src_root, nest); 707 u64 search_start; local 740 search_start = round_down(buf->start, SZ_1G); 750 cow_ret, search_start, 0, nest); 532 btrfs_force_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size, enum btrfs_lock_nesting nest) argument
|
H A D | ctree.h | 551 u64 search_start, u64 empty_size,
|
H A D | defrag.c | 364 u64 search_start = *last_ret; local 421 if (search_start == 0) 422 search_start = last_block; 426 &cur, search_start, 435 search_start = cur->start; 437 *last_ret = search_start;
|
H A D | extent-tree.c | 3749 ret = btrfs_find_space_cluster(bg, last_ptr, ffe_ctl->search_start, 3754 ffe_ctl->num_bytes, ffe_ctl->search_start, 3811 offset = btrfs_find_space_for_alloc(bg, ffe_ctl->search_start, 4016 ffe_ctl->search_start = ffe_ctl->found_offset; 4380 * Any available blocks before search_start are skipped. 4412 ffe_ctl->search_start = 0; 4448 ffe_ctl->search_start = max(ffe_ctl->search_start, 4450 ffe_ctl->search_start = max(ffe_ctl->search_start, ffe_ct [all...] |
H A D | extent-tree.h | 37 u64 search_start; member in struct:find_free_extent_ctl
|
H A D | file.c | 213 u64 search_start = args->start; local 253 search_start, modify_tree); 256 if (ret > 0 && path->slots[0] > 0 && search_start == args->start) { 320 if (extent_end == key.offset && extent_end >= search_start) { 325 if (extent_end <= search_start) { 331 search_start = max(key.offset, args->start); 423 search_start = extent_end; 3583 u64 search_start = last_extent_end; local 3591 search_start = offset; 3595 search_start, 3624 u64 search_start = key.offset; local [all...] |
H A D | free-space-cache.c | 2156 u64 search_start, search_bytes; local 2168 search_start = *offset; 2170 search_bytes = min(search_bytes, end - search_start + 1); 2171 ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes, 2173 if (ret < 0 || search_start != *offset) 2180 search_bytes = min(search_bytes, end - search_start + 1); 2182 bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes, true); 2214 search_start = *offset; 2216 ret = search_bitmap(ctl, bitmap_info, &search_start, 2218 if (ret < 0 || search_start ! 3192 u64 search_start = cluster->window_start; local [all...] |
H A D | inode.c | 2645 u64 search_start = start; local 2648 while (search_start < end) { 2649 const u64 search_len = end - search_start + 1; 2654 em = btrfs_get_extent(inode, NULL, search_start, search_len); 2662 if (em->start < search_start) 2663 em_len -= search_start - em->start; 2667 ret = set_extent_bit(&inode->io_tree, search_start, 2668 search_start + em_len - 1, 2671 search_start = extent_map_end(em);
|
H A D | relocation.c | 162 u64 search_start; member in struct:reloc_control 3543 if (rc->search_start >= last) { 3548 key.objectid = rc->search_start; 3580 key.objectid + key.offset <= rc->search_start) { 3587 rc->search_start) { 3598 rc->search_start = end + 1; 3601 rc->search_start = key.objectid + key.offset; 3603 rc->search_start = key.objectid + 3643 rc->search_start = rc->block_group->start; 3773 rc->search_start [all...] |
H A D | scrub.c | 1330 * Return <0 if the extent item is before @search_start. 1334 u64 search_start, u64 search_len) 1348 if (key.objectid + len <= search_start) 1350 if (key.objectid >= search_start + search_len) 1357 * [@search_start, @search_start + @search_length) 1364 * NOTE: If an extent item starts before @search_start, we will still 1373 u64 search_start, u64 search_len) 1387 key.objectid = search_start; 1404 * an extent item starting before @search_start 1333 compare_extent_item_range(struct btrfs_path *path, u64 search_start, u64 search_len) argument 1371 find_first_extent_item(struct btrfs_root *extent_root, struct btrfs_path *path, u64 search_start, u64 search_len) argument [all...] |
H A D | send.c | 6411 u64 search_start = start; local 6420 key.offset = search_start; 6427 while (search_start < end) { 6456 search_start = extent_end;
|
H A D | volumes.c | 1591 * @search_start: the position from which to begin the search 1621 u64 search_start; local 1631 search_start = dev_extent_search_start(device); 1632 max_hole_start = search_start; 1643 if (search_start >= search_end || 1654 key.offset = search_start; 1661 while (search_start < search_end) { 1687 if (key.offset > search_start) { 1688 hole_size = key.offset - search_start; 1689 dev_extent_hole_check(device, &search_start, [all...] |
/linux-master/fs/ocfs2/ |
H A D | reservations.c | 385 * inside the reservations tree (search_start, search_len). The range 391 * This function searches the bitmap range starting at search_start 401 unsigned int search_start, 410 trace_ocfs2_resmap_find_free_bits_begin(search_start, search_len, 415 start = search_start; 419 if (offset >= (search_start + search_len)) 399 ocfs2_resmap_find_free_bits(struct ocfs2_reservation_map *resmap, unsigned int wanted, unsigned int search_start, unsigned int search_len, unsigned int *rstart, unsigned int *rlen) argument
|
/linux-master/include/trace/events/ |
H A D | btrfs.h | 1389 __entry->start = ffe_ctl->search_start;
|