Home
last modified time | relevance | path

Searched refs:get_end_addr (Results 1 – 5 of 5) sorted by relevance

/system/extras/simpleperf/
Dthread_tree_test.cpp43 prev_end = pair.second->get_end_addr(); in CheckMaps()
47 if (names.size() < pair.second->get_end_addr()) { in CheckMaps()
48 names.resize(pair.second->get_end_addr()); in CheckMaps()
50 for (uint64_t i = pair.first; i < pair.second->get_end_addr(); ++i) { in CheckMaps()
Dthread_tree.cpp175 if (it2->second->get_end_addr() > entry.get_end_addr()) { in InsertMap()
176 map.emplace(entry.get_end_addr(), in InsertMap()
177 AllocateMap(RemoveFirstPartOfMapEntry(it2->second, entry.get_end_addr()))); in InsertMap()
179 if (it2->second->get_end_addr() > entry.start_addr) { in InsertMap()
185 while (it != map.end() && it->second->get_end_addr() <= entry.get_end_addr()) { in InsertMap()
188 if (it != map.end() && it->second->start_addr < entry.get_end_addr()) { in InsertMap()
189 map.emplace(entry.get_end_addr(), in InsertMap()
190 AllocateMap(RemoveFirstPartOfMapEntry(it->second, entry.get_end_addr()))); in InsertMap()
202 if (it->second->get_end_addr() > addr) { in FindMapByAddr()
Dthread_tree.h60 uint64_t get_end_addr() const { return start_addr + len; } in get_end_addr() function
63 return addr >= start_addr && addr < get_end_addr(); in Contains()
DOfflineUnwinder.cpp147 return new unwindstack::MapInfo(nullptr, nullptr, entry->start_addr, entry->get_end_addr(), pgoff, in CreateMapInfo()
DETMDecoder.cpp270 data.buffer_end = map->get_end_addr(); in ReadTargetMemory()