Home
last modified time | relevance | path

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

/linux/fs/btrfs/
A Dextent-io-tree.h241 u64 *start_ret, u64 *end_ret, u32 bits,
244 u64 *start_ret, u64 *end_ret, u32 bits);
246 u64 *start_ret, u64 *end_ret, u32 bits);
A Dextent_io.c1565 u64 *start_ret, u64 *end_ret, u32 bits, in find_first_extent_bit() argument
1591 *start_ret = state->start; in find_first_extent_bit()
1617 u64 *start_ret, u64 *end_ret, u32 bits) in find_contiguous_extent_bit() argument
1625 *start_ret = state->start; in find_contiguous_extent_bit()
1654 u64 *start_ret, u64 *end_ret, u32 bits) in find_first_clear_extent_bit() argument
1669 *start_ret = 0; in find_first_clear_extent_bit()
1678 *start_ret = state->end + 1; in find_first_clear_extent_bit()
1708 *start_ret = state->start; in find_first_clear_extent_bit()
1726 *start_ret = state->end + 1; in find_first_clear_extent_bit()
1728 *start_ret = 0; in find_first_clear_extent_bit()
A Dtree-log.c2210 u64 *start_ret, u64 *end_ret) in find_dir_range() argument
2218 if (*start_ret == (u64)-1) in find_dir_range()
2223 key.offset = *start_ret; in find_dir_range()
2244 if (*start_ret >= key.offset && *start_ret <= found_end) { in find_dir_range()
2246 *start_ret = key.offset; in find_dir_range()
2270 *start_ret = key.offset; in find_dir_range()

Completed in 24 milliseconds