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 <gperftools/custom_allocator.h> | |
8 | |
9 #include "base/macros.h" | |
10 #include "testing/gtest/include/gtest/gtest.h" | |
11 | |
12 namespace leak_detector { | |
13 | |
14 namespace { | |
15 | |
16 // Some test call stacks. | |
17 const void* kRawStack0[] = { | |
18 reinterpret_cast<const void*>(0xaabbccdd), | |
19 reinterpret_cast<const void*>(0x11223344), | |
20 reinterpret_cast<const void*>(0x55667788), | |
jar (doing other things)
2015/09/04 18:01:56
I noticed all these addresses were 32 bits long.
Simon Que
2015/09/07 06:40:32
Done. I'll rely on truncation from 64 to 32 bits o
| |
21 reinterpret_cast<const void*>(0x99887766), | |
22 }; | |
23 const void* kRawStack1[] = { | |
jar (doing other things)
2015/09/04 18:01:56
For purposes of testing... it was nice that this s
Simon Que
2015/09/07 06:40:32
Done.
| |
24 reinterpret_cast<const void*>(0xdeadbeef), | |
25 reinterpret_cast<const void*>(0x900df00d), | |
26 reinterpret_cast<const void*>(0xcafedeed), | |
27 reinterpret_cast<const void*>(0xdeafbabe), | |
28 }; | |
29 const void* kRawStack2[] = { | |
30 reinterpret_cast<const void*>(0x12345678), | |
31 reinterpret_cast<const void*>(0xabcdef01), | |
32 reinterpret_cast<const void*>(0xfdecab98), | |
33 }; | |
34 const void* kRawStack3[] = { | |
35 reinterpret_cast<const void*>(0xdead0001), | |
36 reinterpret_cast<const void*>(0xbeef0002), | |
37 reinterpret_cast<const void*>(0x900d0003), | |
38 reinterpret_cast<const void*>(0xf00d0004), | |
39 reinterpret_cast<const void*>(0xcafe0005), | |
40 reinterpret_cast<const void*>(0xdeed0006), | |
41 reinterpret_cast<const void*>(0xdeaf0007), | |
42 reinterpret_cast<const void*>(0xbabe0008), | |
43 }; | |
44 | |
45 } // namespace | |
46 | |
47 class CallStackManagerTest : public ::testing::Test { | |
48 public: | |
49 CallStackManagerTest() {} | |
50 | |
51 void SetUp() override { | |
52 CustomAllocator::InitializeForUnitTest(); | |
53 } | |
54 void TearDown() override { | |
55 CustomAllocator::Shutdown(); | |
56 } | |
57 | |
58 private: | |
59 DISALLOW_COPY_AND_ASSIGN(CallStackManagerTest); | |
60 }; | |
61 | |
62 TEST_F(CallStackManagerTest, NewStacks) { | |
63 CallStackManager manager; | |
64 EXPECT_EQ(0U, manager.size()); | |
65 | |
66 const CallStack* stack0 = | |
67 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
68 EXPECT_EQ(1U, manager.size()); | |
69 | |
70 const CallStack* stack1 = | |
71 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
72 EXPECT_EQ(2U, manager.size()); | |
73 | |
74 const CallStack* stack2 = | |
75 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
76 EXPECT_EQ(3U, manager.size()); | |
77 | |
78 const CallStack* stack3 = | |
79 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
80 EXPECT_EQ(4U, manager.size()); | |
81 | |
82 // Call stack objects should be unique. | |
83 EXPECT_NE(stack0, stack1); | |
84 EXPECT_NE(stack0, stack2); | |
85 EXPECT_NE(stack0, stack3); | |
86 EXPECT_NE(stack1, stack2); | |
87 EXPECT_NE(stack1, stack3); | |
88 EXPECT_NE(stack2, stack3); | |
89 } | |
90 | |
91 TEST_F(CallStackManagerTest, Hashes) { | |
92 CallStackManager manager; | |
93 | |
94 const CallStack* stack0 = | |
95 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
96 const CallStack* stack1 = | |
97 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
98 const CallStack* stack2 = | |
99 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
100 const CallStack* stack3 = | |
101 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
102 | |
103 // Hash values should be nonzero. | |
104 EXPECT_NE(0U, stack0->hash); | |
105 EXPECT_NE(0U, stack1->hash); | |
106 EXPECT_NE(0U, stack2->hash); | |
107 EXPECT_NE(0U, stack3->hash); | |
108 | |
109 // Hash values should be unique. | |
110 EXPECT_NE(stack0->hash, stack1->hash); | |
111 EXPECT_NE(stack0->hash, stack2->hash); | |
112 EXPECT_NE(stack0->hash, stack3->hash); | |
113 EXPECT_NE(stack1->hash, stack2->hash); | |
114 EXPECT_NE(stack1->hash, stack3->hash); | |
115 EXPECT_NE(stack2->hash, stack3->hash); | |
116 } | |
117 | |
118 TEST_F(CallStackManagerTest, HashWithReducedDepth) { | |
119 CallStackManager manager; | |
120 const CallStack* stack = | |
121 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
jar (doing other things)
2015/09/04 18:01:56
Please add:
EXPECT_EQ(arraysize(kRawStack3), stack
Simon Que
2015/09/07 06:40:32
Done.
| |
122 | |
123 // Hash function should only operate on the first |CallStack::depth| elements | |
124 // of CallStack::stack. To test this, reduce the depth value of one of the | |
125 // stacks and make sure the hash changes. | |
126 EXPECT_NE(stack->hash, | |
127 manager.GetCallStack(stack->depth - 1, stack->stack)->hash); | |
128 EXPECT_NE(stack->hash, | |
129 manager.GetCallStack(stack->depth - 2, stack->stack)->hash); | |
130 EXPECT_NE(stack->hash, | |
131 manager.GetCallStack(stack->depth - 3, stack->stack)->hash); | |
132 EXPECT_NE(stack->hash, | |
133 manager.GetCallStack(stack->depth - 4, stack->stack)->hash); | |
jar (doing other things)
2015/09/04 18:01:56
This is good... but it just checks that similar ba
Simon Que
2015/09/07 06:40:32
Done.
| |
134 } | |
135 | |
136 TEST_F(CallStackManagerTest, DuplicateStacks) { | |
137 CallStackManager manager; | |
138 EXPECT_EQ(0U, manager.size()); | |
bjanakiraman1
2015/09/01 21:48:55
In general, add a brief comment at the beginning s
Simon Que
2015/09/01 23:23:30
Done.
| |
139 | |
140 // Add stack0. | |
141 const CallStack* stack0 = | |
142 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
143 | |
144 const CallStack* stack0_duplicate0 = | |
145 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
jar (doing other things)
2015/09/04 18:01:56
Better might be to replicate the stack into new me
Simon Que
2015/09/07 06:40:32
Done.
| |
146 EXPECT_EQ(1U, manager.size()); | |
147 EXPECT_EQ(stack0, stack0_duplicate0); | |
148 | |
149 // Add stack1. | |
150 const CallStack* stack1 = | |
151 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
152 | |
153 const CallStack* stack0_duplicate1 = | |
154 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
155 EXPECT_EQ(2U, manager.size()); | |
156 EXPECT_EQ(stack0, stack0_duplicate1); | |
157 | |
158 const CallStack* stack1_duplicate0 = | |
159 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
160 EXPECT_EQ(2U, manager.size()); | |
161 EXPECT_EQ(stack1, stack1_duplicate0); | |
162 | |
163 // Add stack2 and stack3. | |
164 const CallStack* stack2 = | |
165 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
166 const CallStack* stack3 = | |
167 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
168 EXPECT_EQ(4U, manager.size()); | |
169 | |
170 const CallStack* stack1_duplicate1 = | |
171 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); | |
172 EXPECT_EQ(4U, manager.size()); | |
173 EXPECT_EQ(stack1, stack1_duplicate1); | |
174 | |
175 const CallStack* stack0_duplicate2 = | |
176 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); | |
177 EXPECT_EQ(4U, manager.size()); | |
178 EXPECT_EQ(stack0, stack0_duplicate2); | |
179 | |
180 const CallStack* stack3_duplicate0 = | |
181 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); | |
182 EXPECT_EQ(4U, manager.size()); | |
183 EXPECT_EQ(stack3, stack3_duplicate0); | |
184 | |
185 const CallStack* stack2_duplicate0 = | |
186 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); | |
187 EXPECT_EQ(4U, manager.size()); | |
188 EXPECT_EQ(stack2, stack2_duplicate0); | |
189 } | |
190 | |
191 } // namespace leak_detector | |
OLD | NEW |