rs_get_end
while (sio != NULL && SIO_GET_OFFSET(sio) < rs_get_end(rs,
ASSERT3U(SIO_GET_END_OFFSET(sio), <=, rs_get_end(rs,
if (sio != NULL && SIO_GET_OFFSET(sio) < rs_get_end(rs,
SIO_GET_OFFSET(sio), rs_get_end(rs,
uint64_t rend = rs_get_end(rs, queue->q_exts_by_addr);
uint64_t size = rs_get_end(size_rs, rt) - start;
ASSERT3U(rs_get_end(size_rs, rt), ==,
rs_get_end(addr_rs, rt));
uint64_t size = rs_get_end(size_rs, rt) - start;
ASSERT3U(rs_get_end(size_rs, rt), ==, rs_get_end(addr_rs, rt));
if (rs_get_end(rs, rt) - rs_get_start(rs, rt) <
if (rs_get_end(rs, rt) - rs_get_start(rs, rt) < (1 <<
return (rs_get_end(rs, msp->ms_allocatable) - rs_get_start(rs,
uint64_t rsize = rs_get_end(rs, msp->ms_unflushed_frees) - rstart;
if (offset + size <= rs_get_end(rs, rt)) {
if (rs != NULL && rs_get_start(rs, rt) + size <= rs_get_end(rs,
if (rs == NULL || (rs_get_end(rs, rt) - rs_get_start(rs, rt)) <
*cursor_end = rs_get_end(rs, rt);
if (rs == NULL || (rs_get_end(rs, rt) - rs_get_start(rs, rt)) < size) {
if ((rs_get_end(rs, rt) - rs_get_start(rs, rt)) >= size) {
uint64_t size = rs_get_end(rs, rt) - rs_get_start(rs, rt);
uint64_t size = rs_get_end(rs, rt) - rs_get_start(rs, rt);
uint64_t size = rs_get_end(rs, rt) - rs_get_start(rs, rt);
ASSERT3U(rs_get_fill(rs, rt) + delta, <=, rs_get_end(rs, rt) -
uint64_t rend = rs_get_end(rs, rt);
merge_before = (rs_before != NULL && rs_get_end(rs_before, rt) >=
bridge_size += start - rs_get_end(rs_before, rt);
ASSERT3U(rs_get_fill(rs, rt), <=, rs_get_end(rs, rt) -
ASSERT3U(rs_get_fill(rs, rt), ==, rs_get_end(rs, rt) -
end = rs_get_end(rs, rt);
rs_get_end(rs, rt) != end) {
(longlong_t)rs_get_end(rs, rt) - rs_get_start(rs,
VERIFY3U(rs_get_end(rs, rt), >=, end);
right_over = (rs_get_end(rs, rt) != end);
rs_set_fill(&newseg, rt, rs_get_end(rs, rt) - end);
int64_t delta = newsize - (rs_get_end(rs, rt) - rs_get_start(rs, rt));
rs_get_end(rs, rt) >= start + size) {
*osize = MIN(size, rs_get_end(rs, rt) - start);
*osize = MIN(start + size, rs_get_end(rs, rt)) -
uint64_t free_end = MIN(rs_get_end(rs, rt), start + size);
func(arg, rs_get_start(rs, rt), rs_get_end(rs, rt) -
func(arg, rs_get_start(rs, rt), rs_get_end(rs, rt) -
uint64_t overlap_end = MIN(rs_get_end(curr, removefrom),
ASSERT(start == end || start == rs_get_end(&rs,
rs_get_end(rs, rt), removefrom, addto);
return (rs != NULL ? rs_get_end(rs, rt) : 0);
uint64_t length = (rs_get_end(rs, rt) - rs_get_start(rs, rt)) >>
space_map_write_seg(sm, rs_get_start(rs, rt), rs_get_end(rs,
space_reftree_add_seg(t, rs_get_start(rs, rt), rs_get_end(rs,
uint64_t size = rs_get_end(rs, rt) - rs_get_start(rs, rt);
logical_rs.rs_end = rs_get_end(rs, rt);
seg_length = MIN(rs_get_end(rs, rt) - rs_get_start(rs,
} else if (rs_get_end(rs, rt) - range_tree_min(segs) >
seg_length = rs_get_end(rs, rt) -
size = rs_get_end(rs, segs) - start;
uint64_t prev_seg_end = rs_get_end(rs, segs);
prev_seg_end = rs_get_end(rs, segs);
uint64_t size = rs_get_end(rs, ta->trim_tree) - rs_get_start(rs,
logical_rs.rs_end = rs_get_end(rs, rt);