| /linux-2.6.39/fs/reiserfs/ |
| D | bitmap.c | 654 hint->search_start = in new_hashed_relocation()
679 hint->search_start = hash; in dirid_groups()
707 hint->search_start = hash; in oid_groups()
734 hint->search_start = bh->b_blocknr; in get_left_neighbor()
745 hint->search_start = t; in get_left_neighbor()
776 hint->search_start = in displace_large_file()
781 hint->search_start = in displace_large_file()
798 hint->search_start = in hash_formatted_node()
816 hint->search_start = in displace_new_packing_locality()
835 if (border > hint->search_start) in old_hashed_relocation()
[all …]
|
| /linux-2.6.39/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()
|
| /linux-2.6.39/fs/btrfs/ |
| D | free-space-cache.c | 1271 u64 search_start, search_bytes; in remove_from_bitmap() local
1288 search_start = *offset; in remove_from_bitmap()
1290 search_bytes = min(search_bytes, end - search_start + 1); in remove_from_bitmap()
1291 ret = search_bitmap(block_group, bitmap_info, &search_start, in remove_from_bitmap()
1293 BUG_ON(ret < 0 || search_start != *offset); in remove_from_bitmap()
1333 search_start = *offset; in remove_from_bitmap()
1335 ret = search_bitmap(block_group, bitmap_info, &search_start, in remove_from_bitmap()
1337 if (ret < 0 || search_start != *offset) in remove_from_bitmap()
1867 u64 search_start = cluster->window_start; in btrfs_alloc_from_bitmap() local
1871 search_start = min_start; in btrfs_alloc_from_bitmap()
[all …]
|
| D | file.c | 301 u64 search_start = start; in btrfs_drop_extents() local
322 search_start, -1); in btrfs_drop_extents()
325 if (ret > 0 && path->slots[0] > 0 && search_start == start) { in btrfs_drop_extents()
369 extent_end = search_start; in btrfs_drop_extents()
372 if (extent_end <= search_start) { in btrfs_drop_extents()
377 search_start = max(key.offset, start); in btrfs_drop_extents()
451 search_start = extent_end; in btrfs_drop_extents()
|
| D | delayed-ref.h | 178 struct list_head *cluster, u64 search_start);
|
| D | extent-tree.c | 611 u64 search_start, u64 search_hint, int owner) in btrfs_find_block_group() argument
615 u64 last = max(search_hint, search_start); in btrfs_find_block_group()
645 last = search_start; in btrfs_find_block_group()
650 last = search_start; in btrfs_find_block_group()
4248 static u64 first_logical_byte(struct btrfs_root *root, u64 search_start) in first_logical_byte() argument
4253 cache = btrfs_lookup_first_block_group(root->fs_info, search_start); in first_logical_byte()
4953 u64 search_start, u64 search_end, in find_free_extent() argument
5014 search_start = max(search_start, first_logical_byte(root, 0)); in find_free_extent()
5015 search_start = max(search_start, hint_byte); in find_free_extent()
5020 if (search_start == hint_byte) { in find_free_extent()
[all …]
|
| D | root-tree.c | 30 int btrfs_search_root(struct btrfs_root *root, u64 search_start, in btrfs_search_root() argument
38 search_key.objectid = search_start; in btrfs_search_root()
|
| D | volumes.c | 807 u64 search_start; in find_free_dev_extent() local
818 search_start = 1024 * 1024; in find_free_dev_extent()
821 search_start = max(root->fs_info->alloc_start, search_start); in find_free_dev_extent()
823 max_hole_start = search_start; in find_free_dev_extent()
826 if (search_start >= search_end) { in find_free_dev_extent()
839 key.offset = search_start; in find_free_dev_extent()
874 if (key.offset > search_start) { in find_free_dev_extent()
875 hole_size = key.offset - search_start; in find_free_dev_extent()
878 max_hole_start = search_start; in find_free_dev_extent()
900 if (extent_end > search_start) in find_free_dev_extent()
[all …]
|
| D | ctree.c | 387 u64 search_start, u64 empty_size) in __btrfs_cow_block() argument
422 level, search_start, empty_size); in __btrfs_cow_block()
508 u64 search_start; in btrfs_cow_block() local
530 search_start = buf->start & ~((u64)(1024 * 1024 * 1024) - 1); in btrfs_cow_block()
537 parent_slot, cow_ret, search_start, 0); in btrfs_cow_block()
602 u64 search_start = *last_ret; in btrfs_realloc_node() local
691 if (search_start == 0) in btrfs_realloc_node()
692 search_start = last_block; in btrfs_realloc_node()
697 &cur, search_start, in btrfs_realloc_node()
705 search_start = cur->start; in btrfs_realloc_node()
[all …]
|
| D | relocation.c | 179 u64 search_start; member
3530 if (rc->search_start >= last) {
3535 key.objectid = rc->search_start;
3561 key.objectid + key.offset <= rc->search_start) {
3572 rc->search_start = end + 1;
3574 rc->search_start = key.objectid + key.offset;
3637 rc->search_start = rc->block_group->key.objectid;
3755 rc->search_start = key.objectid;
|
| D | ctree.h | 2122 u64 search_start, u64 search_hint, int owner);
2360 int btrfs_search_root(struct btrfs_root *root, u64 search_start,
|
| /linux-2.6.39/include/linux/ |
| D | reiserfs_fs.h | 2242 b_blocknr_t search_start; /* a field used to transfer search start value (block number) member
|