1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/*
* Copyright (C) 2015 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "sample_tree.h"
#include <base/logging.h>
bool SampleTree::MapComparator::operator()(const MapEntry* map1, const MapEntry* map2) {
if (map1->pid != map2->pid) {
return map1->pid < map2->pid;
}
if (map1->start_addr != map2->start_addr) {
return map1->start_addr < map2->start_addr;
}
if (map1->len != map2->len) {
return map1->len < map2->len;
}
if (map1->time != map2->time) {
return map1->time < map2->time;
}
return false;
}
void SampleTree::AddProcess(int pid, const std::string& comm) {
ProcessEntry process = {
.pid = pid, .comm = comm,
};
process_tree_[pid] = process;
}
void SampleTree::AddKernelMap(uint64_t start_addr, uint64_t len, uint64_t pgoff, uint64_t time,
const std::string& filename) {
MapEntry* map = new MapEntry{
.pid = -1,
.start_addr = start_addr,
.len = len,
.pgoff = pgoff,
.time = time,
.filename = filename,
};
map_storage_.push_back(map);
kernel_map_tree_.insert(map);
}
void SampleTree::AddUserMap(int pid, uint64_t start_addr, uint64_t len, uint64_t pgoff,
uint64_t time, const std::string& filename) {
MapEntry* map = new MapEntry{
.pid = pid,
.start_addr = start_addr,
.len = len,
.pgoff = pgoff,
.time = time,
.filename = filename,
};
map_storage_.push_back(map);
RemoveOverlappedUserMap(map);
user_map_tree_.insert(map);
}
void SampleTree::RemoveOverlappedUserMap(const MapEntry* map) {
MapEntry find_map = {
.pid = map->pid, .start_addr = 0, .len = 0, .time = 0,
};
auto it = user_map_tree_.lower_bound(&find_map);
while (it != user_map_tree_.end() && (*it)->pid == map->pid) {
if ((*it)->start_addr >= map->start_addr + map->len) {
break;
}
if ((*it)->start_addr + (*it)->len <= map->start_addr) {
++it;
} else {
it = user_map_tree_.erase(it);
}
}
}
const ProcessEntry* SampleTree::FindProcessEntryOrNew(int pid) {
auto it = process_tree_.find(pid);
if (it == process_tree_.end()) {
ProcessEntry new_entry = {
.pid = pid, .comm = "unknown",
};
auto pair = process_tree_.insert(std::make_pair(pid, new_entry));
it = pair.first;
}
return &it->second;
}
static bool IsIpInMap(int pid, uint64_t ip, const MapEntry* map) {
return (pid == map->pid && map->start_addr <= ip && map->start_addr + map->len > ip);
}
const MapEntry* SampleTree::FindMapEntryOrNew(int pid, uint64_t ip) {
// Construct a map_entry which is strictly after the searched map_entry, based on MapComparator.
MapEntry find_map = {
.pid = pid,
.start_addr = ip,
.len = static_cast<uint64_t>(-1),
.time = static_cast<uint64_t>(-1),
};
auto it = user_map_tree_.upper_bound(&find_map);
if (it != user_map_tree_.begin() && IsIpInMap(pid, ip, *--it)) {
return *it;
}
find_map.pid = -1;
it = kernel_map_tree_.upper_bound(&find_map);
if (it != kernel_map_tree_.begin() && IsIpInMap(-1, ip, *--it)) {
return *it;
}
return FindUnknownMapEntryOrNew(pid);
}
const MapEntry* SampleTree::FindUnknownMapEntryOrNew(int pid) {
auto it = unknown_maps_.find(pid);
if (it == unknown_maps_.end()) {
MapEntry* map = new MapEntry{
.pid = pid,
.start_addr = 0,
.len = static_cast<uint64_t>(-1),
.pgoff = 0,
.time = 0,
.filename = "unknown",
};
map_storage_.push_back(map);
auto pair = unknown_maps_.insert(std::make_pair(pid, map));
it = pair.first;
}
return it->second;
}
void SampleTree::AddSample(int pid, int tid, uint64_t ip, uint64_t time, uint64_t period) {
const ProcessEntry* process_entry = FindProcessEntryOrNew(pid);
const MapEntry* map_entry = FindMapEntryOrNew(pid, ip);
SampleEntry find_sample = {
.tid = tid,
.ip = ip,
.time = time,
.period = period,
.sample_count = 1,
.process_entry = process_entry,
.map_entry = map_entry,
};
auto it = sample_tree_.find(find_sample);
if (it == sample_tree_.end()) {
sample_tree_.insert(find_sample);
} else {
SampleEntry* sample_entry = const_cast<SampleEntry*>(&*it);
sample_entry->period += period;
sample_entry->sample_count++;
}
total_samples_++;
total_period_ += period;
}
void SampleTree::VisitAllSamples(std::function<void(const SampleEntry&)> callback) {
if (sorted_sample_tree_.size() != sample_tree_.size()) {
sorted_sample_tree_.clear();
for (auto& sample : sample_tree_) {
sorted_sample_tree_.insert(sample);
}
}
for (auto& sample : sorted_sample_tree_) {
callback(sample);
}
}
|
