OLD | NEW |
| (Empty) |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | |
2 // Use of this source code is governed by a BSD-style license that can be | |
3 // found in the LICENSE file. | |
4 | |
5 #include "components/metrics/leak_detector/call_stack_manager.h" | |
6 | |
7 #include <stdint.h> | |
8 | |
9 #include <algorithm> | |
10 | |
11 #include "base/macros.h" | |
12 #include "base/memory/scoped_ptr.h" | |
13 #include "components/metrics/leak_detector/custom_allocator.h" | |
14 #include "testing/gtest/include/gtest/gtest.h" | |
15 | |
16 namespace metrics { | |
17 namespace leak_detector { | |
18 | |
19 namespace { | |
20 | |
21 // Some test call stacks. The addresses are 64-bit but they should automatically | |
22 // be truncated to 32 bits on a 32-bit machine. | |
23 const void* kRawStack0[] = { | |
24 reinterpret_cast<const void*>(0x8899aabbccddeeff), | |
25 reinterpret_cast<const void*>(0x0000112233445566), | |
26 reinterpret_cast<const void*>(0x5566778899aabbcc), | |
27 reinterpret_cast<const void*>(0x9988776655443322), | |
28 }; | |
29 // This is similar to kRawStack0, differing only in one address by 1. It should | |
30 // still produce a distinct CallStack object and hash. | |
31 const void* kRawStack1[] = { | |
32 kRawStack0[0], kRawStack0[1], | |
33 reinterpret_cast<const void*>(reinterpret_cast<uintptr_t>(kRawStack0[2]) + | |
34 1), | |
35 kRawStack0[3], | |
36 }; | |
37 const void* kRawStack2[] = { | |
38 reinterpret_cast<const void*>(0x900df00dcab58888), | |
39 reinterpret_cast<const void*>(0x00001337cafedeed), | |
40 reinterpret_cast<const void*>(0x0000deafbabe1234), | |
41 }; | |
42 const void* kRawStack3[] = { | |
43 reinterpret_cast<const void*>(0x0000000012345678), | |
44 reinterpret_cast<const void*>(0x00000000abcdef01), | |
45 reinterpret_cast<const void*>(0x00000000fdecab98), | |
46 reinterpret_cast<const void*>(0x0000deadbeef0001), | |
47 reinterpret_cast<const void*>(0x0000900ddeed0002), | |
48 reinterpret_cast<const void*>(0x0000f00dcafe0003), | |
49 reinterpret_cast<const void*>(0x0000f00d900d0004), | |
50 reinterpret_cast<const void*>(0xdeedcafebabe0005), | |
51 }; | |
52 | |
53 // Creates a copy of a call stack as a scoped_ptr to a raw stack. The depth is | |
54 // the same as the original stack, but it is not stored in the result. | |
55 scoped_ptr<const void* []> CopyStack(const CallStack* stack) { | |
56 scoped_ptr<const void* []> stack_copy(new const void*[stack->depth]); | |
57 std::copy(stack->stack, stack->stack + stack->depth, stack_copy.get()); | |
58 return stack_copy.Pass(); | |
59 } | |
60 | |
61 } // namespace | |
62 | |
63 class CallStackManagerTest : public ::testing::Test { | |
64 public: | |
65 CallStackManagerTest() {} | |
66 | |
67 void SetUp() override { CustomAllocator::Initialize(); } | |
68 void TearDown() override { EXPECT_TRUE(CustomAllocator::Shutdown()); } | |
69 | |
70 private: | |
71 DISALLOW_COPY_AND_ASSIGN(CallStackManagerTest); | |
72 }; | |
73 | |
74 TEST_F(CallStackManagerTest, NewStacks) { | |
75 CallStackManager manager; | |
76 EXPECT_EQ(0U, manager.size()); | |
77 | |
78 // Request some new stacks and make sure their creation is reflected in the | |
79 // size of |manager|. | |
80 const CallStack* stack0 = | |
81 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
82 EXPECT_EQ(arraysize(kRawStack0), stack0->depth); | |
83 EXPECT_EQ(1U, manager.size()); | |
84 | |
85 const CallStack* stack1 = | |
86 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
87 EXPECT_EQ(arraysize(kRawStack1), stack1->depth); | |
88 EXPECT_EQ(2U, manager.size()); | |
89 | |
90 const CallStack* stack2 = | |
91 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
92 EXPECT_EQ(arraysize(kRawStack2), stack2->depth); | |
93 EXPECT_EQ(3U, manager.size()); | |
94 | |
95 const CallStack* stack3 = | |
96 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
97 EXPECT_EQ(arraysize(kRawStack3), stack3->depth); | |
98 EXPECT_EQ(4U, manager.size()); | |
99 | |
100 // Call stack objects should be unique. | |
101 EXPECT_NE(stack0, stack1); | |
102 EXPECT_NE(stack0, stack2); | |
103 EXPECT_NE(stack0, stack3); | |
104 EXPECT_NE(stack1, stack2); | |
105 EXPECT_NE(stack1, stack3); | |
106 EXPECT_NE(stack2, stack3); | |
107 } | |
108 | |
109 TEST_F(CallStackManagerTest, Hashes) { | |
110 CallStackManager manager; | |
111 | |
112 const CallStack* stack0 = | |
113 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
114 const CallStack* stack1 = | |
115 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
116 const CallStack* stack2 = | |
117 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
118 const CallStack* stack3 = | |
119 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
120 | |
121 // Hash values should be unique. This test is not designed to make sure the | |
122 // hash function is generating unique hashes, but that CallStackManager is | |
123 // properly storing the hashes in CallStack structs. | |
124 EXPECT_NE(stack0->hash, stack1->hash); | |
125 EXPECT_NE(stack0->hash, stack2->hash); | |
126 EXPECT_NE(stack0->hash, stack3->hash); | |
127 EXPECT_NE(stack1->hash, stack2->hash); | |
128 EXPECT_NE(stack1->hash, stack3->hash); | |
129 EXPECT_NE(stack2->hash, stack3->hash); | |
130 } | |
131 | |
132 TEST_F(CallStackManagerTest, MultipleManagersHashes) { | |
133 CallStackManager manager1; | |
134 const CallStack* stack10 = | |
135 manager1.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
136 const CallStack* stack11 = | |
137 manager1.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
138 const CallStack* stack12 = | |
139 manager1.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
140 const CallStack* stack13 = | |
141 manager1.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
142 | |
143 CallStackManager manager2; | |
144 const CallStack* stack20 = | |
145 manager2.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
146 const CallStack* stack21 = | |
147 manager2.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
148 const CallStack* stack22 = | |
149 manager2.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
150 const CallStack* stack23 = | |
151 manager2.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
152 | |
153 // Different CallStackManagers should still generate the same hashes. | |
154 EXPECT_EQ(stack10->hash, stack20->hash); | |
155 EXPECT_EQ(stack11->hash, stack21->hash); | |
156 EXPECT_EQ(stack12->hash, stack22->hash); | |
157 EXPECT_EQ(stack13->hash, stack23->hash); | |
158 } | |
159 | |
160 TEST_F(CallStackManagerTest, HashWithReducedDepth) { | |
161 CallStackManager manager; | |
162 const CallStack* stack = | |
163 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
164 | |
165 // Hash function should only operate on the first |CallStack::depth| elements | |
166 // of CallStack::stack. To test this, reduce the depth value of one of the | |
167 // stacks and make sure the hash changes. | |
168 EXPECT_NE(stack->hash, | |
169 manager.GetCallStack(stack->depth - 1, stack->stack)->hash); | |
170 EXPECT_NE(stack->hash, | |
171 manager.GetCallStack(stack->depth - 2, stack->stack)->hash); | |
172 EXPECT_NE(stack->hash, | |
173 manager.GetCallStack(stack->depth - 3, stack->stack)->hash); | |
174 EXPECT_NE(stack->hash, | |
175 manager.GetCallStack(stack->depth - 4, stack->stack)->hash); | |
176 | |
177 // Also try subsets of the stack that don't start from the beginning. | |
178 EXPECT_NE(stack->hash, | |
179 manager.GetCallStack(stack->depth - 1, stack->stack + 1)->hash); | |
180 EXPECT_NE(stack->hash, | |
181 manager.GetCallStack(stack->depth - 2, stack->stack + 2)->hash); | |
182 EXPECT_NE(stack->hash, | |
183 manager.GetCallStack(stack->depth - 3, stack->stack + 3)->hash); | |
184 EXPECT_NE(stack->hash, | |
185 manager.GetCallStack(stack->depth - 4, stack->stack + 4)->hash); | |
186 } | |
187 | |
188 TEST_F(CallStackManagerTest, DuplicateStacks) { | |
189 CallStackManager manager; | |
190 EXPECT_EQ(0U, manager.size()); | |
191 | |
192 // Calling manager.GetCallStack() multiple times with the same raw stack | |
193 // arguments will not result in creation of new call stack objects after the | |
194 // first call. Instead, the previously created object will be returned, and | |
195 // the size of |manager| will remain unchanged. | |
196 // | |
197 // Thus a call to GetCallStack() will always return the same result, given the | |
198 // same inputs. | |
199 | |
200 // Add stack0. | |
201 const CallStack* stack0 = | |
202 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
203 | |
204 scoped_ptr<const void* []> rawstack0_duplicate0 = CopyStack(stack0); | |
205 const CallStack* stack0_duplicate0 = | |
206 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate0.get()); | |
207 EXPECT_EQ(1U, manager.size()); | |
208 EXPECT_EQ(stack0, stack0_duplicate0); | |
209 | |
210 // Add stack1. | |
211 const CallStack* stack1 = | |
212 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
213 EXPECT_EQ(2U, manager.size()); | |
214 | |
215 scoped_ptr<const void* []> rawstack0_duplicate1 = CopyStack(stack0); | |
216 const CallStack* stack0_duplicate1 = | |
217 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate1.get()); | |
218 EXPECT_EQ(2U, manager.size()); | |
219 EXPECT_EQ(stack0, stack0_duplicate1); | |
220 | |
221 scoped_ptr<const void* []> rawstack1_duplicate0 = CopyStack(stack1); | |
222 const CallStack* stack1_duplicate0 = | |
223 manager.GetCallStack(arraysize(kRawStack1), rawstack1_duplicate0.get()); | |
224 EXPECT_EQ(2U, manager.size()); | |
225 EXPECT_EQ(stack1, stack1_duplicate0); | |
226 | |
227 // Add stack2 and stack3. | |
228 const CallStack* stack2 = | |
229 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
230 const CallStack* stack3 = | |
231 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
232 EXPECT_EQ(4U, manager.size()); | |
233 | |
234 scoped_ptr<const void* []> rawstack1_duplicate1 = CopyStack(stack1); | |
235 const CallStack* stack1_duplicate1 = | |
236 manager.GetCallStack(arraysize(kRawStack1), rawstack1_duplicate1.get()); | |
237 EXPECT_EQ(4U, manager.size()); | |
238 EXPECT_EQ(stack1, stack1_duplicate1); | |
239 | |
240 scoped_ptr<const void* []> rawstack0_duplicate2 = CopyStack(stack0); | |
241 const CallStack* stack0_duplicate2 = | |
242 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate2.get()); | |
243 EXPECT_EQ(4U, manager.size()); | |
244 EXPECT_EQ(stack0, stack0_duplicate2); | |
245 | |
246 scoped_ptr<const void* []> rawstack3_duplicate0 = CopyStack(stack3); | |
247 const CallStack* stack3_duplicate0 = | |
248 manager.GetCallStack(arraysize(kRawStack3), rawstack3_duplicate0.get()); | |
249 EXPECT_EQ(4U, manager.size()); | |
250 EXPECT_EQ(stack3, stack3_duplicate0); | |
251 | |
252 scoped_ptr<const void* []> rawstack2_duplicate0 = CopyStack(stack2); | |
253 const CallStack* stack2_duplicate0 = | |
254 manager.GetCallStack(arraysize(kRawStack2), rawstack2_duplicate0.get()); | |
255 EXPECT_EQ(4U, manager.size()); | |
256 EXPECT_EQ(stack2, stack2_duplicate0); | |
257 } | |
258 | |
259 } // namespace leak_detector | |
260 } // namespace metrics | |
OLD | NEW |