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
|
/*
* Copyright (C) 2018 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 "thread_tree.h"
#include <gtest/gtest.h>
#include "read_symbol_map.h"
using namespace simpleperf;
// @CddTest = 6.1/C-0-2
class ThreadTreeTest : public ::testing::Test {
protected:
void AddMap(uint64_t start, uint64_t end, const std::string& name) {
thread_tree_.AddThreadMap(0, 0, start, end - start, start, name);
if (expected_names_.size() < end) {
expected_names_.resize(end);
}
for (uint64_t i = start; i < end; ++i) {
expected_names_[i] = name;
}
}
void CheckMaps() {
std::vector<std::string> names;
ThreadEntry* thread = thread_tree_.FindThreadOrNew(0, 0);
ASSERT_TRUE(thread != nullptr);
ASSERT_TRUE(thread->maps != nullptr);
uint64_t prev_end = 0;
for (auto& pair : thread->maps->maps) {
ASSERT_GE(pair.first, prev_end);
prev_end = pair.second->get_end_addr();
ASSERT_EQ(pair.second->start_addr, pair.first);
ASSERT_GT(pair.second->len, 0u);
ASSERT_EQ(pair.second->pgoff, pair.first);
if (names.size() < pair.second->get_end_addr()) {
names.resize(pair.second->get_end_addr());
}
for (uint64_t i = pair.first; i < pair.second->get_end_addr(); ++i) {
names[i] = pair.second->dso->Path();
}
}
ASSERT_EQ(names, expected_names_);
// Check result of ThreadTree::FindMap.
for (size_t i = 0; i < expected_names_.size(); ++i) {
const MapEntry* entry = thread_tree_.FindMap(thread, i, false);
ASSERT_TRUE(entry != nullptr);
if (expected_names_[i].empty()) {
ASSERT_TRUE(thread_tree_.IsUnknownDso(entry->dso));
} else {
ASSERT_EQ(entry->dso->Path(), expected_names_[i]);
}
}
}
const Symbol* FindSymbol(int pid, int tid, uint64_t ip, bool in_kernel = false) {
auto thread = thread_tree_.FindThreadOrNew(pid, tid);
auto map = thread_tree_.FindMap(thread, ip, in_kernel);
return thread_tree_.FindSymbol(map, ip, nullptr, nullptr);
}
std::vector<std::string> expected_names_;
ThreadTree thread_tree_;
};
// @CddTest = 6.1/C-0-2
TEST_F(ThreadTreeTest, maps_smoke) {
AddMap(0, 5, "0");
AddMap(10, 15, "1");
CheckMaps();
// Overlap left.
AddMap(1, 6, "2");
CheckMaps();
AddMap(4, 5, "3");
CheckMaps();
// Overlap right.
AddMap(9, 12, "4");
CheckMaps();
AddMap(8, 15, "5");
CheckMaps();
AddMap(7, 16, "6");
CheckMaps();
// Overlap all.
AddMap(0, 17, "7");
CheckMaps();
}
// @CddTest = 6.1/C-0-2
TEST_F(ThreadTreeTest, jit_maps_before_fork) {
// Maps for JIT symfiles can arrive before fork records.
thread_tree_.AddThreadMap(0, 0, 0, 1, 0, "0", map_flags::PROT_JIT_SYMFILE_MAP);
thread_tree_.AddThreadMap(1, 1, 1, 1, 1, "1");
thread_tree_.ForkThread(0, 0, 1, 1);
expected_names_ = {"0", "1"};
CheckMaps();
ThreadEntry* thread = thread_tree_.FindThreadOrNew(0, 0);
ASSERT_TRUE(thread != nullptr);
const MapEntry* map = thread_tree_.FindMap(thread, 0);
ASSERT_TRUE(map != nullptr);
ASSERT_EQ(map->flags, map_flags::PROT_JIT_SYMFILE_MAP);
}
// @CddTest = 6.1/C-0-2
TEST_F(ThreadTreeTest, reused_tid) {
// Process 1 has thread 1 and 2.
thread_tree_.ForkThread(1, 2, 1, 1);
// Thread 2 exits.
thread_tree_.ExitThread(1, 2);
// Thread 1 forks process 2.
thread_tree_.ForkThread(2, 2, 1, 1);
}
// @CddTest = 6.1/C-0-2
TEST_F(ThreadTreeTest, reused_tid_without_thread_exit) {
// Similar to the above test, but the thread exit record is missing.
thread_tree_.ForkThread(1, 2, 1, 1);
thread_tree_.ForkThread(2, 2, 1, 1);
}
// @CddTest = 6.1/C-0-2
TEST_F(ThreadTreeTest, add_symbols_for_process) {
std::string symbol_map(
"0x2000 0x20 two\n"
"0x1000 0x10 one\n"
"0x3000 0x30 three\n");
auto symbols = ReadSymbolMapFromString(symbol_map);
thread_tree_.AddSymbolsForProcess(1, &symbols);
ASSERT_STREQ("one", FindSymbol(1, 1, 0x1000)->Name());
ASSERT_STREQ("two", FindSymbol(1, 1, 0x2010)->Name());
ASSERT_STREQ("three", FindSymbol(1, 1, 0x302f)->Name());
}
// @CddTest = 6.1/C-0-2
TEST_F(ThreadTreeTest, invalid_fork) {
// tid == ptid
ASSERT_FALSE(thread_tree_.ForkThread(1, 2, 1, 2));
// pid != tid && pid != ppid
ASSERT_FALSE(thread_tree_.ForkThread(1, 2, 3, 1));
}
|
