51   Range range{begin, end};  in Allocation()
59   auto inserted = allocations_.insert(std::pair<Range, AllocationInfo>(range, AllocationInfo{}));  in Allocation()
66     Range overlap = inserted.first->first;  in Allocation()
86 bool HeapWalker::WordContainsAllocationPtr(uintptr_t word_ptr, Range* range, AllocationInfo** info)…  in WordContainsAllocationPtr()
95     AllocationMap::iterator it = allocations_.find(Range{value, value + 1});  in WordContainsAllocationPtr()
105 void HeapWalker::RecurseRoot(const Range& root) {  in RecurseRoot()
106   allocator::vector<Range> to_do(1, root, allocator_);  in RecurseRoot()
108     Range range = to_do.back();  in RecurseRoot()
112     ForEachPtrInRange(range, [&](Range& ref_range, AllocationInfo* ref_info) {  in RecurseRoot()
118     walking_range_ = Range{0, 0};  in RecurseRoot()
128   roots_.push_back(Range{begin, end});  in Root()
149   Range vals;  in DetectLeaks()
162 bool HeapWalker::Leaked(allocator::vector<Range>& leaked, size_t limit, size_t* num_leaks_out,  in Leaked()