Loading libmemunreachable/HeapWalker.cpp +7 −5 Original line number Diff line number Diff line Loading @@ -41,11 +41,13 @@ bool HeapWalker::Allocation(uintptr_t begin, uintptr_t end) { return true; } else { Range overlap = inserted.first->first; if (overlap != range) { ALOGE("range %p-%p overlaps with existing range %p-%p", reinterpret_cast<void*>(begin), reinterpret_cast<void*>(end), reinterpret_cast<void*>(overlap.begin), reinterpret_cast<void*>(overlap.end)); } return false; } } Loading libmemunreachable/HeapWalker.h +6 −0 Original line number Diff line number Diff line Loading @@ -31,6 +31,12 @@ struct Range { uintptr_t end; size_t size() const { return end - begin; }; bool operator==(const Range& other) const { return this->begin == other.begin && this->end == other.end; } bool operator!=(const Range& other) const { return !(*this == other); } }; // Comparator for Ranges that returns equivalence for overlapping ranges Loading Loading
libmemunreachable/HeapWalker.cpp +7 −5 Original line number Diff line number Diff line Loading @@ -41,11 +41,13 @@ bool HeapWalker::Allocation(uintptr_t begin, uintptr_t end) { return true; } else { Range overlap = inserted.first->first; if (overlap != range) { ALOGE("range %p-%p overlaps with existing range %p-%p", reinterpret_cast<void*>(begin), reinterpret_cast<void*>(end), reinterpret_cast<void*>(overlap.begin), reinterpret_cast<void*>(overlap.end)); } return false; } } Loading
libmemunreachable/HeapWalker.h +6 −0 Original line number Diff line number Diff line Loading @@ -31,6 +31,12 @@ struct Range { uintptr_t end; size_t size() const { return end - begin; }; bool operator==(const Range& other) const { return this->begin == other.begin && this->end == other.end; } bool operator!=(const Range& other) const { return !(*this == other); } }; // Comparator for Ranges that returns equivalence for overlapping ranges Loading