Home
last modified time | relevance | path

Searched refs:start_ret (Results 1 – 4 of 4) sorted by relevance

/linux/fs/btrfs/
A Dextent-io-tree.h219 u64 *start_ret, u64 *end_ret, u32 bits,
222 u64 *start_ret, u64 *end_ret, u32 bits);
224 u64 *start_ret, u64 *end_ret, u32 bits);
A Dextent-io-tree.c896 u64 *start_ret, u64 *end_ret, u32 bits, in find_first_extent_bit() argument
931 *start_ret = state->start; in find_first_extent_bit()
957 u64 *start_ret, u64 *end_ret, u32 bits) in find_contiguous_extent_bit() argument
967 *start_ret = state->start; in find_contiguous_extent_bit()
1522 u64 *start_ret, u64 *end_ret, u32 bits) in find_first_clear_extent_bit() argument
1537 *start_ret = 0; in find_first_clear_extent_bit()
1545 *start_ret = prev->end + 1; in find_first_clear_extent_bit()
1574 *start_ret = state->start; in find_first_clear_extent_bit()
1590 *start_ret = prev->end + 1; in find_first_clear_extent_bit()
1592 *start_ret = 0; in find_first_clear_extent_bit()
A Dfile.c3436 u64 start, u64 end, u64 *start_ret) in find_desired_extent_in_hole() argument
3445 *start_ret = delalloc_start; in find_desired_extent_in_hole()
3455 *start_ret = start; in find_desired_extent_in_hole()
3465 *start_ret = delalloc_end + 1; in find_desired_extent_in_hole()
3474 *start_ret = start; in find_desired_extent_in_hole()
A Dtree-log.c2043 u64 *start_ret, u64 *end_ret) in find_dir_range() argument
2051 if (*start_ret == (u64)-1) in find_dir_range()
2056 key.offset = *start_ret; in find_dir_range()
2077 if (*start_ret >= key.offset && *start_ret <= found_end) { in find_dir_range()
2079 *start_ret = key.offset; in find_dir_range()
2103 *start_ret = key.offset; in find_dir_range()

Completed in 628 milliseconds