45 bool HeapWalker::Allocation(uintptr_t begin, uintptr_t end) {  in Allocation()  argument
46   if (end == begin) {  in Allocation()
47     end = begin + 1;  in Allocation()
50   end = UntagAddress(end);  in Allocation()
51   Range range{begin, end};  in Allocation()
52   if (valid_mappings_range_.end != 0 &&  in Allocation()
53       (begin < valid_mappings_range_.begin || end > valid_mappings_range_.end)) {  in Allocation()
55                          reinterpret_cast<void*>(begin), reinterpret_cast<void*>(end),  in Allocation()
57                          reinterpret_cast<void*>(valid_mappings_range_.end));  in Allocation()
62     valid_allocations_range_.end = std::max(valid_allocations_range_.end, end);  in Allocation()
69                 reinterpret_cast<void*>(end), reinterpret_cast<void*>(overlap.begin),  in Allocation()
70                 reinterpret_cast<void*>(overlap.end));  in Allocation()
94   if (value >= valid_allocations_range_.begin && value < valid_allocations_range_.end) {  in WordContainsAllocationPtr()
96     if (it != allocations_.end()) {  in WordContainsAllocationPtr()
122 void HeapWalker::Mapping(uintptr_t begin, uintptr_t end) {  in Mapping()  argument
124   valid_mappings_range_.end = std::max(valid_mappings_range_.end, end);  in Mapping()
127 void HeapWalker::Root(uintptr_t begin, uintptr_t end) {  in Root()  argument
128   roots_.push_back(Range{begin, end});  in Root()
132   root_vals_.insert(root_vals_.end(), vals.begin(), vals.end());  in Root()
145   for (auto it = roots_.begin(); it != roots_.end(); it++) {  in DetectLeaks()
151   vals.end = vals.begin + root_vals_.size() * sizeof(uintptr_t);  in DetectLeaks()
168   for (auto it = allocations_.begin(); it != allocations_.end(); it++) {  in Leaked()
171       leak_bytes += it->first.end - it->first.begin;  in Leaked()
176   for (auto it = allocations_.begin(); it != allocations_.end(); it++) {  in Leaked()
218                 reinterpret_cast<void*>(walking_range_.end));  in HandleSegFault()