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 #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 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], |
| 33 kRawStack0[1], |
| 34 reinterpret_cast<const void*>( |
| 35 reinterpret_cast<uintptr_t>(kRawStack0[2]) + 1), |
| 36 kRawStack0[3], |
| 37 }; |
| 38 const void* kRawStack2[] = { |
| 39 reinterpret_cast<const void*>(0x900df00dcab58888), |
| 40 reinterpret_cast<const void*>(0x00001337cafedeed), |
| 41 reinterpret_cast<const void*>(0x0000deafbabe1234), |
| 42 }; |
| 43 const void* kRawStack3[] = { |
| 44 reinterpret_cast<const void*>(0x0000000012345678), |
| 45 reinterpret_cast<const void*>(0x00000000abcdef01), |
| 46 reinterpret_cast<const void*>(0x00000000fdecab98), |
| 47 reinterpret_cast<const void*>(0x0000deadbeef0001), |
| 48 reinterpret_cast<const void*>(0x0000900ddeed0002), |
| 49 reinterpret_cast<const void*>(0x0000f00dcafe0003), |
| 50 reinterpret_cast<const void*>(0x0000f00d900d0004), |
| 51 reinterpret_cast<const void*>(0xdeedcafebabe0005), |
| 52 }; |
| 53 |
| 54 // Creates a copy of a call stack as a unique_ptr to a raw stack. The depth is |
| 55 // the same as the original stack, but it is not stored in the result. |
| 56 std::unique_ptr<const void*[]> CopyStack(const CallStack* stack) { |
| 57 std::unique_ptr<const void*[]> stack_copy(new const void*[stack->depth]); |
| 58 std::copy(stack->stack, stack->stack + stack->depth, stack_copy.get()); |
| 59 return std::move(stack_copy); |
| 60 } |
| 61 |
| 62 } // namespace |
| 63 |
| 64 class CallStackManagerTest : public ::testing::Test { |
| 65 public: |
| 66 CallStackManagerTest() {} |
| 67 |
| 68 void SetUp() override { |
| 69 CustomAllocator::Initialize(); |
| 70 } |
| 71 void TearDown() override { |
| 72 EXPECT_TRUE(CustomAllocator::Shutdown()); |
| 73 } |
| 74 |
| 75 private: |
| 76 DISALLOW_COPY_AND_ASSIGN(CallStackManagerTest); |
| 77 }; |
| 78 |
| 79 TEST_F(CallStackManagerTest, NewStacks) { |
| 80 CallStackManager manager; |
| 81 EXPECT_EQ(0U, manager.size()); |
| 82 |
| 83 // Request some new stacks and make sure their creation is reflected in the |
| 84 // size of |manager|. |
| 85 const CallStack* stack0 = |
| 86 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); |
| 87 EXPECT_EQ(arraysize(kRawStack0), stack0->depth); |
| 88 EXPECT_EQ(1U, manager.size()); |
| 89 |
| 90 const CallStack* stack1 = |
| 91 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); |
| 92 EXPECT_EQ(arraysize(kRawStack1), stack1->depth); |
| 93 EXPECT_EQ(2U, manager.size()); |
| 94 |
| 95 const CallStack* stack2 = |
| 96 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); |
| 97 EXPECT_EQ(arraysize(kRawStack2), stack2->depth); |
| 98 EXPECT_EQ(3U, manager.size()); |
| 99 |
| 100 const CallStack* stack3 = |
| 101 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); |
| 102 EXPECT_EQ(arraysize(kRawStack3), stack3->depth); |
| 103 EXPECT_EQ(4U, manager.size()); |
| 104 |
| 105 // Call stack objects should be unique. |
| 106 EXPECT_NE(stack0, stack1); |
| 107 EXPECT_NE(stack0, stack2); |
| 108 EXPECT_NE(stack0, stack3); |
| 109 EXPECT_NE(stack1, stack2); |
| 110 EXPECT_NE(stack1, stack3); |
| 111 EXPECT_NE(stack2, stack3); |
| 112 } |
| 113 |
| 114 TEST_F(CallStackManagerTest, Hashes) { |
| 115 CallStackManager manager; |
| 116 |
| 117 const CallStack* stack0 = |
| 118 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); |
| 119 const CallStack* stack1 = |
| 120 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); |
| 121 const CallStack* stack2 = |
| 122 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); |
| 123 const CallStack* stack3 = |
| 124 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); |
| 125 |
| 126 // Hash values should be nonzero. |
| 127 EXPECT_NE(0U, stack0->hash); |
| 128 EXPECT_NE(0U, stack1->hash); |
| 129 EXPECT_NE(0U, stack2->hash); |
| 130 EXPECT_NE(0U, stack3->hash); |
| 131 |
| 132 // Hash values should be unique. |
| 133 EXPECT_NE(stack0->hash, stack1->hash); |
| 134 EXPECT_NE(stack0->hash, stack2->hash); |
| 135 EXPECT_NE(stack0->hash, stack3->hash); |
| 136 EXPECT_NE(stack1->hash, stack2->hash); |
| 137 EXPECT_NE(stack1->hash, stack3->hash); |
| 138 EXPECT_NE(stack2->hash, stack3->hash); |
| 139 } |
| 140 |
| 141 TEST_F(CallStackManagerTest, HashWithReducedDepth) { |
| 142 CallStackManager manager; |
| 143 const CallStack* stack = |
| 144 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); |
| 145 |
| 146 // Hash function should only operate on the first |CallStack::depth| elements |
| 147 // of CallStack::stack. To test this, reduce the depth value of one of the |
| 148 // stacks and make sure the hash changes. |
| 149 EXPECT_NE(stack->hash, |
| 150 manager.GetCallStack(stack->depth - 1, stack->stack)->hash); |
| 151 EXPECT_NE(stack->hash, |
| 152 manager.GetCallStack(stack->depth - 2, stack->stack)->hash); |
| 153 EXPECT_NE(stack->hash, |
| 154 manager.GetCallStack(stack->depth - 3, stack->stack)->hash); |
| 155 EXPECT_NE(stack->hash, |
| 156 manager.GetCallStack(stack->depth - 4, stack->stack)->hash); |
| 157 |
| 158 // Also try subsets of the stack that don't start from the beginning. |
| 159 EXPECT_NE(stack->hash, |
| 160 manager.GetCallStack(stack->depth - 1, stack->stack + 1)->hash); |
| 161 EXPECT_NE(stack->hash, |
| 162 manager.GetCallStack(stack->depth - 2, stack->stack + 2)->hash); |
| 163 EXPECT_NE(stack->hash, |
| 164 manager.GetCallStack(stack->depth - 3, stack->stack + 3)->hash); |
| 165 EXPECT_NE(stack->hash, |
| 166 manager.GetCallStack(stack->depth - 4, stack->stack + 4)->hash); |
| 167 } |
| 168 |
| 169 TEST_F(CallStackManagerTest, DuplicateStacks) { |
| 170 CallStackManager manager; |
| 171 EXPECT_EQ(0U, manager.size()); |
| 172 |
| 173 // Calling manager.GetCallStack() multiple times with the same raw stack |
| 174 // arguments will not result in creation of new call stack objects after the |
| 175 // first call. Instead, the previously created object will be returned, and |
| 176 // the size of |manager| will remain unchanged. |
| 177 // |
| 178 // Thus a call to GetCallStack() will always return the same result, given the |
| 179 // same inputs. |
| 180 |
| 181 // Add stack0. |
| 182 const CallStack* stack0 = |
| 183 manager.GetCallStack(arraysize(kRawStack0), kRawStack0); |
| 184 |
| 185 std::unique_ptr<const void*[]> rawstack0_duplicate0 = CopyStack(stack0); |
| 186 const CallStack* stack0_duplicate0 = |
| 187 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate0.get()); |
| 188 EXPECT_EQ(1U, manager.size()); |
| 189 EXPECT_EQ(stack0, stack0_duplicate0); |
| 190 |
| 191 // Add stack1. |
| 192 const CallStack* stack1 = |
| 193 manager.GetCallStack(arraysize(kRawStack1), kRawStack1); |
| 194 EXPECT_EQ(2U, manager.size()); |
| 195 |
| 196 std::unique_ptr<const void*[]> rawstack0_duplicate1 = CopyStack(stack0); |
| 197 const CallStack* stack0_duplicate1 = |
| 198 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate1.get()); |
| 199 EXPECT_EQ(2U, manager.size()); |
| 200 EXPECT_EQ(stack0, stack0_duplicate1); |
| 201 |
| 202 std::unique_ptr<const void*[]> rawstack1_duplicate0 = CopyStack(stack1); |
| 203 const CallStack* stack1_duplicate0 = |
| 204 manager.GetCallStack(arraysize(kRawStack1), rawstack1_duplicate0.get()); |
| 205 EXPECT_EQ(2U, manager.size()); |
| 206 EXPECT_EQ(stack1, stack1_duplicate0); |
| 207 |
| 208 // Add stack2 and stack3. |
| 209 const CallStack* stack2 = |
| 210 manager.GetCallStack(arraysize(kRawStack2), kRawStack2); |
| 211 const CallStack* stack3 = |
| 212 manager.GetCallStack(arraysize(kRawStack3), kRawStack3); |
| 213 EXPECT_EQ(4U, manager.size()); |
| 214 |
| 215 std::unique_ptr<const void*[]> rawstack1_duplicate1 = CopyStack(stack1); |
| 216 const CallStack* stack1_duplicate1 = |
| 217 manager.GetCallStack(arraysize(kRawStack1), rawstack1_duplicate1.get()); |
| 218 EXPECT_EQ(4U, manager.size()); |
| 219 EXPECT_EQ(stack1, stack1_duplicate1); |
| 220 |
| 221 std::unique_ptr<const void*[]> rawstack0_duplicate2 = CopyStack(stack0); |
| 222 const CallStack* stack0_duplicate2 = |
| 223 manager.GetCallStack(arraysize(kRawStack0), rawstack0_duplicate2.get()); |
| 224 EXPECT_EQ(4U, manager.size()); |
| 225 EXPECT_EQ(stack0, stack0_duplicate2); |
| 226 |
| 227 std::unique_ptr<const void*[]> rawstack3_duplicate0 = CopyStack(stack3); |
| 228 const CallStack* stack3_duplicate0 = |
| 229 manager.GetCallStack(arraysize(kRawStack3), rawstack3_duplicate0.get()); |
| 230 EXPECT_EQ(4U, manager.size()); |
| 231 EXPECT_EQ(stack3, stack3_duplicate0); |
| 232 |
| 233 std::unique_ptr<const void*[]> rawstack2_duplicate0 = CopyStack(stack2); |
| 234 const CallStack* stack2_duplicate0 = |
| 235 manager.GetCallStack(arraysize(kRawStack2), rawstack2_duplicate0.get()); |
| 236 EXPECT_EQ(4U, manager.size()); |
| 237 EXPECT_EQ(stack2, stack2_duplicate0); |
| 238 } |
| 239 |
| 240 } // namespace leak_detector |
| 241 } // namespace metrics |
OLD | NEW |