Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(74)

Side by Side Diff: components/metrics/leak_detector/call_stack_manager_unittest.cc

Issue 986503002: components/metrics: Add runtime memory leak detector (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Replace tcmalloc's wrappers with pthread_spinlock and standard allocator (no more tcmalloc changes) Created 5 years, 2 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
(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 #include <memory>
11
12 #include "base/macros.h"
13 #include "components/metrics/leak_detector/custom_allocator.h"
14 #include "testing/gtest/include/gtest/gtest.h"
15
16 namespace leak_detector {
17
18 namespace {
19
20 // Some test call stacks. The addresses are 64-bit but they should automatically
21 // be truncated to 32 bits on a 32-bit machine.
22 const void* kRawStack0[] = {
23 reinterpret_cast<const void*>(0x8899aabbccddeeff),
24 reinterpret_cast<const void*>(0x0000112233445566),
25 reinterpret_cast<const void*>(0x5566778899aabbcc),
26 reinterpret_cast<const void*>(0x9988776655443322),
27 };
28 // This is similar to kRawStack0, differing only in one address by 1. It should
29 // still produce a distinct CallStack object and hash.
30 const void* kRawStack1[] = {
31 kRawStack0[0],
32 kRawStack0[1],
33 reinterpret_cast<const void*>(
34 reinterpret_cast<uintptr_t>(kRawStack0[2]) + 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 unique_ptr to a raw stack. The depth is
54 // the same as the original stack, but it is not stored in the result.
55 std::unique_ptr<const void*[]> CopyStack(const CallStack* stack) {
56 std::unique_ptr<const void*[]> stack_copy(new const void*[stack->depth]);
57 std::copy(stack->stack, stack->stack + stack->depth, stack_copy.get());
58 return std::move(stack_copy);
59 }
60
61 } // namespace
62
63 class CallStackManagerTest : public ::testing::Test {
64 public:
65 CallStackManagerTest() {}
66
67 void SetUp() override {
68 CustomAllocator::Initialize();
69 }
70 void TearDown() override {
71 EXPECT_TRUE(CustomAllocator::Shutdown());
72 }
73
74 private:
75 DISALLOW_COPY_AND_ASSIGN(CallStackManagerTest);
76 };
77
78 TEST_F(CallStackManagerTest, NewStacks) {
79 CallStackManager manager;
80 EXPECT_EQ(0U, manager.size());
81
82 // Request some new stacks and make sure their creation is reflected in the
83 // size of |manager|.
84 const CallStack* stack0 =
85 manager.GetCallStack(arraysize(kRawStack0), kRawStack0);
86 EXPECT_EQ(arraysize(kRawStack0), stack0->depth);
87 EXPECT_EQ(1U, manager.size());
88
89 const CallStack* stack1 =
90 manager.GetCallStack(arraysize(kRawStack1), kRawStack1);
91 EXPECT_EQ(arraysize(kRawStack1), stack1->depth);
92 EXPECT_EQ(2U, manager.size());
93
94 const CallStack* stack2 =
95 manager.GetCallStack(arraysize(kRawStack2), kRawStack2);
96 EXPECT_EQ(arraysize(kRawStack2), stack2->depth);
97 EXPECT_EQ(3U, manager.size());
98
99 const CallStack* stack3 =
100 manager.GetCallStack(arraysize(kRawStack3), kRawStack3);
101 EXPECT_EQ(arraysize(kRawStack3), stack3->depth);
102 EXPECT_EQ(4U, manager.size());
103
104 // Call stack objects should be unique.
105 EXPECT_NE(stack0, stack1);
106 EXPECT_NE(stack0, stack2);
107 EXPECT_NE(stack0, stack3);
108 EXPECT_NE(stack1, stack2);
109 EXPECT_NE(stack1, stack3);
110 EXPECT_NE(stack2, stack3);
111 }
112
113 TEST_F(CallStackManagerTest, Hashes) {
114 CallStackManager manager;
115
116 const CallStack* stack0 =
117 manager.GetCallStack(arraysize(kRawStack0), kRawStack0);
118 const CallStack* stack1 =
119 manager.GetCallStack(arraysize(kRawStack1), kRawStack1);
120 const CallStack* stack2 =
121 manager.GetCallStack(arraysize(kRawStack2), kRawStack2);
122 const CallStack* stack3 =
123 manager.GetCallStack(arraysize(kRawStack3), kRawStack3);
124
125 // Hash values should be nonzero.
126 EXPECT_NE(0U, stack0->hash);
127 EXPECT_NE(0U, stack1->hash);
128 EXPECT_NE(0U, stack2->hash);
129 EXPECT_NE(0U, stack3->hash);
130
131 // Hash values should be unique.
132 EXPECT_NE(stack0->hash, stack1->hash);
133 EXPECT_NE(stack0->hash, stack2->hash);
134 EXPECT_NE(stack0->hash, stack3->hash);
135 EXPECT_NE(stack1->hash, stack2->hash);
136 EXPECT_NE(stack1->hash, stack3->hash);
137 EXPECT_NE(stack2->hash, stack3->hash);
138 }
139
140 TEST_F(CallStackManagerTest, HashWithReducedDepth) {
141 CallStackManager manager;
142 const CallStack* stack =
143 manager.GetCallStack(arraysize(kRawStack3), kRawStack3);
144
145 // Hash function should only operate on the first |CallStack::depth| elements
146 // of CallStack::stack. To test this, reduce the depth value of one of the
147 // stacks and make sure the hash changes.
148 EXPECT_NE(stack->hash,
149 manager.GetCallStack(stack->depth - 1, stack->stack)->hash);
150 EXPECT_NE(stack->hash,
151 manager.GetCallStack(stack->depth - 2, stack->stack)->hash);
152 EXPECT_NE(stack->hash,
153 manager.GetCallStack(stack->depth - 3, stack->stack)->hash);
154 EXPECT_NE(stack->hash,
155 manager.GetCallStack(stack->depth - 4, stack->stack)->hash);
156
157 // Also try subsets of the stack that don't start from the beginning.
158 EXPECT_NE(stack->hash,
159 manager.GetCallStack(stack->depth - 1, stack->stack + 1)->hash);
160 EXPECT_NE(stack->hash,
161 manager.GetCallStack(stack->depth - 2, stack->stack + 2)->hash);
162 EXPECT_NE(stack->hash,
163 manager.GetCallStack(stack->depth - 3, stack->stack + 3)->hash);
164 EXPECT_NE(stack->hash,
165 manager.GetCallStack(stack->depth - 4, stack->stack + 4)->hash);
166 }
167
168 TEST_F(CallStackManagerTest, DuplicateStacks) {
169 CallStackManager manager;
170 EXPECT_EQ(0U, manager.size());
171
172 // Calling manager.GetCallStack() multiple times with the same raw stack
173 // arguments will not result in creation of new call stack objects after the
174 // first call. Instead, the previously created object will be returned, and
175 // the size of |manager| will remain unchanged.
176 //
177 // Thus a call to GetCallStack() will always return the same result, given the
178 // same inputs.
179
180 // Add stack0.
181 const CallStack* stack0 =
182 manager.GetCallStack(arraysize(kRawStack0), kRawStack0);
183
184 std::unique_ptr<const void*[]> rawstack0_duplicate0 = CopyStack(stack0);
185 const CallStack* stack0_duplicate0 =
186 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate0.get());
187 EXPECT_EQ(1U, manager.size());
188 EXPECT_EQ(stack0, stack0_duplicate0);
189
190 // Add stack1.
191 const CallStack* stack1 =
192 manager.GetCallStack(arraysize(kRawStack1), kRawStack1);
193 EXPECT_EQ(2U, manager.size());
194
195 std::unique_ptr<const void*[]> rawstack0_duplicate1 = CopyStack(stack0);
196 const CallStack* stack0_duplicate1 =
197 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate1.get());
198 EXPECT_EQ(2U, manager.size());
199 EXPECT_EQ(stack0, stack0_duplicate1);
200
201 std::unique_ptr<const void*[]> rawstack1_duplicate0 = CopyStack(stack1);
202 const CallStack* stack1_duplicate0 =
203 manager.GetCallStack(arraysize(kRawStack1), rawstack1_duplicate0.get());
204 EXPECT_EQ(2U, manager.size());
205 EXPECT_EQ(stack1, stack1_duplicate0);
206
207 // Add stack2 and stack3.
208 const CallStack* stack2 =
209 manager.GetCallStack(arraysize(kRawStack2), kRawStack2);
210 const CallStack* stack3 =
211 manager.GetCallStack(arraysize(kRawStack3), kRawStack3);
212 EXPECT_EQ(4U, manager.size());
213
214 std::unique_ptr<const void*[]> rawstack1_duplicate1 = CopyStack(stack1);
215 const CallStack* stack1_duplicate1 =
216 manager.GetCallStack(arraysize(kRawStack1), rawstack1_duplicate1.get());
217 EXPECT_EQ(4U, manager.size());
218 EXPECT_EQ(stack1, stack1_duplicate1);
219
220 std::unique_ptr<const void*[]> rawstack0_duplicate2 = CopyStack(stack0);
221 const CallStack* stack0_duplicate2 =
222 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate2.get());
223 EXPECT_EQ(4U, manager.size());
224 EXPECT_EQ(stack0, stack0_duplicate2);
225
226 std::unique_ptr<const void*[]> rawstack3_duplicate0 = CopyStack(stack3);
227 const CallStack* stack3_duplicate0 =
228 manager.GetCallStack(arraysize(kRawStack3), rawstack3_duplicate0.get());
229 EXPECT_EQ(4U, manager.size());
230 EXPECT_EQ(stack3, stack3_duplicate0);
231
232 std::unique_ptr<const void*[]> rawstack2_duplicate0 = CopyStack(stack2);
233 const CallStack* stack2_duplicate0 =
234 manager.GetCallStack(arraysize(kRawStack2), rawstack2_duplicate0.get());
235 EXPECT_EQ(4U, manager.size());
236 EXPECT_EQ(stack2, stack2_duplicate0);
237 }
238
239 } // namespace leak_detector
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698