Lines Matching defs:end
42 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>;
51 // Update the end to include the other non-heap sections.
64 std::sort(intervals.begin(), intervals.end());
65 // Intervals are already sorted by begin, if a new interval begins at the end of the current
72 const uintptr_t end = std::get<1>(interval);
75 << reinterpret_cast<const void*>(end) << " is_heap=" << is_heap;
76 DCHECK_GE(end, begin);
78 // New interval is not at the end of the current one, start a new interval if we are a heap
88 cur_end = end;
92 cur_heap_size += end - begin;
107 DCHECK(spaces_.find(space) == spaces_.end()) << *space;
123 return spaces_.find(space) != spaces_.end();