2 * Copyright (C) 2015 The Android Open Source Project
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 #include "thread_tree.h"
21 #include <base/logging.h>
23 #include "environment.h"
24 #include "perf_event.h"
27 bool MapComparator::operator()(const MapEntry* map1, const MapEntry* map2) const {
28 if (map1->start_addr != map2->start_addr) {
29 return map1->start_addr < map2->start_addr;
31 if (map1->get_end_addr() != map2->get_end_addr()) {
32 return map1->get_end_addr() < map2->get_end_addr();
34 if (map1->time != map2->time) {
35 return map1->time < map2->time;
40 void ThreadTree::AddThread(int pid, int tid, const std::string& comm) {
41 auto it = thread_tree_.find(tid);
42 if (it == thread_tree_.end()) {
43 ThreadEntry* thread = new ThreadEntry{
46 std::set<MapEntry*, MapComparator>(), // maps
48 auto pair = thread_tree_.insert(std::make_pair(tid, std::unique_ptr<ThreadEntry>(thread)));
52 thread_comm_storage_.push_back(std::unique_ptr<std::string>(new std::string(comm)));
53 it->second->comm = thread_comm_storage_.back()->c_str();
56 void ThreadTree::ForkThread(int pid, int tid, int ppid, int ptid) {
57 ThreadEntry* parent = FindThreadOrNew(ppid, ptid);
58 ThreadEntry* child = FindThreadOrNew(pid, tid);
59 child->comm = parent->comm;
60 child->maps = parent->maps;
63 ThreadEntry* ThreadTree::FindThreadOrNew(int pid, int tid) {
64 auto it = thread_tree_.find(tid);
65 if (it == thread_tree_.end()) {
66 AddThread(pid, tid, "unknown");
67 it = thread_tree_.find(tid);
69 if (pid != it->second.get()->pid) {
71 LOG(DEBUG) << "unexpected (pid, tid) pair: expected (" << it->second.get()->pid << ", " << tid
72 << "), actual (" << pid << ", " << tid << ")";
75 return it->second.get();
78 void ThreadTree::AddKernelMap(uint64_t start_addr, uint64_t len, uint64_t pgoff, uint64_t time,
79 const std::string& filename) {
80 // kernel map len can be 0 when record command is not run in supervisor mode.
84 Dso* dso = FindKernelDsoOrNew(filename);
85 MapEntry* map = AllocateMap(MapEntry(start_addr, len, pgoff, time, dso));
86 FixOverlappedMap(&kernel_map_tree_, map);
87 auto pair = kernel_map_tree_.insert(map);
91 Dso* ThreadTree::FindKernelDsoOrNew(const std::string& filename) {
92 if (filename == DEFAULT_KERNEL_MMAP_NAME) {
93 if (kernel_dso_ == nullptr) {
94 kernel_dso_ = Dso::CreateDso(DSO_KERNEL);
96 return kernel_dso_.get();
98 auto it = module_dso_tree_.find(filename);
99 if (it == module_dso_tree_.end()) {
100 module_dso_tree_[filename] = Dso::CreateDso(DSO_KERNEL_MODULE, filename);
101 it = module_dso_tree_.find(filename);
103 return it->second.get();
106 void ThreadTree::AddThreadMap(int pid, int tid, uint64_t start_addr, uint64_t len, uint64_t pgoff,
107 uint64_t time, const std::string& filename) {
108 ThreadEntry* thread = FindThreadOrNew(pid, tid);
109 Dso* dso = FindUserDsoOrNew(filename);
110 MapEntry* map = AllocateMap(MapEntry(start_addr, len, pgoff, time, dso));
111 FixOverlappedMap(&thread->maps, map);
112 auto pair = thread->maps.insert(map);
116 Dso* ThreadTree::FindUserDsoOrNew(const std::string& filename) {
117 auto it = user_dso_tree_.find(filename);
118 if (it == user_dso_tree_.end()) {
119 user_dso_tree_[filename] = Dso::CreateDso(DSO_ELF_FILE, filename);
120 it = user_dso_tree_.find(filename);
122 return it->second.get();
125 MapEntry* ThreadTree::AllocateMap(const MapEntry& value) {
126 MapEntry* map = new MapEntry(value);
127 map_storage_.push_back(std::unique_ptr<MapEntry>(map));
131 void ThreadTree::FixOverlappedMap(std::set<MapEntry*, MapComparator>* map_set, const MapEntry* map) {
132 for (auto it = map_set->begin(); it != map_set->end();) {
133 if ((*it)->start_addr >= map->get_end_addr()) {
134 // No more overlapped maps.
137 if ((*it)->get_end_addr() <= map->start_addr) {
141 if (old->start_addr < map->start_addr) {
142 MapEntry* before = AllocateMap(MapEntry(old->start_addr, map->start_addr - old->start_addr,
143 old->pgoff, old->time, old->dso));
144 map_set->insert(before);
146 if (old->get_end_addr() > map->get_end_addr()) {
147 MapEntry* after = AllocateMap(
148 MapEntry(map->get_end_addr(), old->get_end_addr() - map->get_end_addr(),
149 map->get_end_addr() - old->start_addr + old->pgoff, old->time, old->dso));
150 map_set->insert(after);
153 it = map_set->erase(it);
158 static bool IsAddrInMap(uint64_t addr, const MapEntry* map) {
159 return (addr >= map->start_addr && addr < map->get_end_addr());
162 static MapEntry* FindMapByAddr(const std::set<MapEntry*, MapComparator>& maps, uint64_t addr) {
163 // Construct a map_entry which is strictly after the searched map_entry, based on MapComparator.
164 MapEntry find_map(addr, std::numeric_limits<uint64_t>::max(), 0,
165 std::numeric_limits<uint64_t>::max(), nullptr);
166 auto it = maps.upper_bound(&find_map);
167 if (it != maps.begin() && IsAddrInMap(addr, *--it)) {
173 const MapEntry* ThreadTree::FindMap(const ThreadEntry* thread, uint64_t ip, bool in_kernel) {
174 MapEntry* result = nullptr;
176 result = FindMapByAddr(thread->maps, ip);
178 result = FindMapByAddr(kernel_map_tree_, ip);
180 return result != nullptr ? result : &unknown_map_;
183 const Symbol* ThreadTree::FindSymbol(const MapEntry* map, uint64_t ip) {
184 uint64_t vaddr_in_file;
185 if (map->dso == kernel_dso_.get()) {
188 vaddr_in_file = ip - map->start_addr + map->dso->MinVirtualAddress();
190 const Symbol* symbol = map->dso->FindSymbol(vaddr_in_file);
191 if (symbol == nullptr) {
192 symbol = &unknown_symbol_;
197 void BuildThreadTree(const Record& record, ThreadTree* thread_tree) {
198 if (record.header.type == PERF_RECORD_MMAP) {
199 const MmapRecord& r = *static_cast<const MmapRecord*>(&record);
200 if ((r.header.misc & PERF_RECORD_MISC_CPUMODE_MASK) == PERF_RECORD_MISC_KERNEL) {
201 thread_tree->AddKernelMap(r.data.addr, r.data.len, r.data.pgoff, r.sample_id.time_data.time,
204 thread_tree->AddThreadMap(r.data.pid, r.data.tid, r.data.addr, r.data.len, r.data.pgoff,
205 r.sample_id.time_data.time, r.filename);
207 } else if (record.header.type == PERF_RECORD_MMAP2) {
208 const Mmap2Record& r = *static_cast<const Mmap2Record*>(&record);
209 if ((r.header.misc & PERF_RECORD_MISC_CPUMODE_MASK) == PERF_RECORD_MISC_KERNEL) {
210 thread_tree->AddKernelMap(r.data.addr, r.data.len, r.data.pgoff, r.sample_id.time_data.time,
213 std::string filename =
214 (r.filename == DEFAULT_EXECNAME_FOR_THREAD_MMAP) ? "[unknown]" : r.filename;
215 thread_tree->AddThreadMap(r.data.pid, r.data.tid, r.data.addr, r.data.len, r.data.pgoff,
216 r.sample_id.time_data.time, filename);
218 } else if (record.header.type == PERF_RECORD_COMM) {
219 const CommRecord& r = *static_cast<const CommRecord*>(&record);
220 thread_tree->AddThread(r.data.pid, r.data.tid, r.comm);
221 } else if (record.header.type == PERF_RECORD_FORK) {
222 const ForkRecord& r = *static_cast<const ForkRecord*>(&record);
223 thread_tree->ForkThread(r.data.pid, r.data.tid, r.data.ppid, r.data.ptid);