Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2013 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 "base/memory/discardable_memory_provider.h" | |
| 6 | |
| 7 #include "base/bind.h" | |
| 8 #include "base/memory/discardable_memory.h" | |
| 9 #include "base/run_loop.h" | |
| 10 #include "base/synchronization/waitable_event.h" | |
| 11 #include "base/threading/thread.h" | |
| 12 #include "testing/gtest/include/gtest/gtest.h" | |
| 13 | |
| 14 using base::internal::DiscardableMemoryProvider; | |
| 15 | |
| 16 namespace base { | |
| 17 | |
| 18 class DiscardableMemoryProviderTest : public testing::Test { | |
| 19 public: | |
| 20 DiscardableMemoryProviderTest() | |
| 21 : message_loop_(MessageLoop::TYPE_IO), | |
| 22 provider_(new DiscardableMemoryProvider) { | |
| 23 // We set a provider here for two reasons: | |
| 24 // 1. It ensures that one test cannot affect the next, and | |
| 25 // 2. Since the provider listens for pressure notifications on the thread | |
| 26 // it was created on, if we create it on the test thread, we can run | |
| 27 // the test thread's message loop until idle when we want to process | |
| 28 // one of these notifications. | |
| 29 DiscardableMemoryProvider::SetInstanceForTest(provider_.get()); | |
| 30 } | |
| 31 | |
| 32 virtual ~DiscardableMemoryProviderTest() { | |
| 33 DiscardableMemoryProvider::SetInstanceForTest(NULL); | |
| 34 } | |
| 35 | |
| 36 protected: | |
| 37 bool IsRegistered(const DiscardableMemory* discardable) { | |
| 38 return DiscardableMemoryProvider::GetInstance()->IsRegisteredForTest( | |
| 39 discardable); | |
| 40 } | |
| 41 | |
| 42 bool CanBePurged(const DiscardableMemory* discardable) { | |
| 43 return DiscardableMemoryProvider::GetInstance()->CanBePurgedForTest( | |
| 44 discardable); | |
| 45 } | |
| 46 | |
| 47 size_t BytesAllocated() const { | |
| 48 return DiscardableMemoryProvider::GetInstance()-> | |
| 49 GetBytesAllocatedForTest(); | |
| 50 } | |
| 51 | |
| 52 void* Memory(const DiscardableMemory* discardable) const { | |
| 53 return discardable->Memory(); | |
| 54 } | |
| 55 | |
| 56 void SetDiscardableMemoryLimit(size_t bytes) { | |
| 57 DiscardableMemoryProvider::GetInstance()-> | |
| 58 SetDiscardableMemoryLimit(bytes); | |
| 59 } | |
| 60 | |
| 61 void SetBytesToReclaimUnderModeratePressure(size_t bytes) { | |
| 62 DiscardableMemoryProvider::GetInstance()-> | |
| 63 SetBytesToReclaimUnderModeratePressure(bytes); | |
| 64 } | |
| 65 | |
| 66 private: | |
| 67 MessageLoop message_loop_; | |
| 68 scoped_ptr<DiscardableMemoryProvider> provider_; | |
| 69 }; | |
| 70 | |
| 71 TEST_F(DiscardableMemoryProviderTest, CreateLockedMemory) { | |
| 72 size_t size = 1024; | |
| 73 const scoped_ptr<DiscardableMemory> discardable( | |
| 74 DiscardableMemory::CreateLockedMemory(size)); | |
| 75 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 76 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 77 EXPECT_EQ(1024u, BytesAllocated()); | |
| 78 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 79 } | |
| 80 | |
| 81 TEST_F(DiscardableMemoryProviderTest, CreateLockedMemoryZeroSize) { | |
| 82 size_t size = 0; | |
| 83 const scoped_ptr<DiscardableMemory> discardable( | |
| 84 DiscardableMemory::CreateLockedMemory(size)); | |
| 85 EXPECT_FALSE(discardable); | |
| 86 EXPECT_FALSE(IsRegistered(discardable.get())); | |
| 87 EXPECT_EQ(0u, BytesAllocated()); | |
| 88 } | |
| 89 | |
| 90 TEST_F(DiscardableMemoryProviderTest, LockAfterUnlock) { | |
| 91 size_t size = 1024; | |
| 92 const scoped_ptr<DiscardableMemory> discardable( | |
| 93 DiscardableMemory::CreateLockedMemory(size)); | |
| 94 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 95 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 96 EXPECT_EQ(1024u, BytesAllocated()); | |
| 97 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 98 | |
| 99 // Now unlock so we can lock later. | |
| 100 discardable->Unlock(); | |
| 101 EXPECT_TRUE(CanBePurged(discardable.get())); | |
| 102 | |
| 103 EXPECT_EQ(DISCARDABLE_MEMORY_SUCCESS, discardable->Lock()); | |
| 104 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 105 } | |
| 106 | |
| 107 TEST_F(DiscardableMemoryProviderTest, LockAfterPurge) { | |
| 108 size_t size = 1024; | |
| 109 const scoped_ptr<DiscardableMemory> discardable( | |
| 110 DiscardableMemory::CreateLockedMemory(size)); | |
| 111 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 112 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 113 EXPECT_EQ(1024u, BytesAllocated()); | |
| 114 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 115 | |
| 116 // Now unlock so we can lock later. | |
| 117 discardable->Unlock(); | |
| 118 EXPECT_TRUE(CanBePurged(discardable.get())); | |
| 119 | |
| 120 // Force the system to purge. | |
| 121 MemoryPressureListener::NotifyMemoryPressure( | |
| 122 MemoryPressureListener::MEMORY_PRESSURE_CRITICAL); | |
| 123 | |
| 124 // Required because ObserverListThreadSafe notifies via PostTask. | |
| 125 RunLoop().RunUntilIdle(); | |
| 126 | |
| 127 EXPECT_EQ(DISCARDABLE_MEMORY_PURGED, discardable->Lock()); | |
| 128 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 129 } | |
| 130 | |
| 131 TEST_F(DiscardableMemoryProviderTest, LockAfterPurgeAndCannotReallocate) { | |
| 132 size_t size = 1024; | |
| 133 const scoped_ptr<DiscardableMemory> discardable( | |
| 134 DiscardableMemory::CreateLockedMemory(size)); | |
| 135 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 136 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 137 EXPECT_EQ(1024u, BytesAllocated()); | |
| 138 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 139 | |
| 140 // Now unlock so we can lock later. | |
| 141 discardable->Unlock(); | |
| 142 EXPECT_TRUE(CanBePurged(discardable.get())); | |
| 143 | |
| 144 // Set max allowed allocation to 1 byte. This will make cause the memory | |
| 145 // to be purged. | |
| 146 SetDiscardableMemoryLimit(1); | |
| 147 | |
| 148 EXPECT_EQ(DISCARDABLE_MEMORY_PURGED, discardable->Lock()); | |
| 149 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 150 } | |
| 151 | |
| 152 // Use discardable memory in order specified by d0, d1 and d2 then apply | |
| 153 // memory pressure and verify that memory was discarded in the correct order. | |
| 154 #define DiscardableMemoryProviderPermutionTest(name, d0, d1, d2, pressure) \ | |
| 155 TEST_F(DiscardableMemoryProviderTest, name##_##d0##_##d1##_##d2) { \ | |
| 156 scoped_ptr<DiscardableMemory> discardables[3]; \ | |
| 157 for (int i = 0; i < 3; ++i) { \ | |
| 158 discardables[i] = DiscardableMemory::CreateLockedMemory(1024); \ | |
| 159 EXPECT_TRUE(discardables[i]); \ | |
| 160 EXPECT_NE(static_cast<void*>(NULL), Memory(discardables[i].get())); \ | |
| 161 discardables[i]->Unlock(); \ | |
| 162 } \ | |
| 163 int ordering[] = { d0, d1, d2 }; \ | |
| 164 for (int i = 0; i < 3; ++i) { \ | |
| 165 int current_index = ordering[i]; \ | |
| 166 EXPECT_NE(DISCARDABLE_MEMORY_FAILED, \ | |
| 167 discardables[current_index]->Lock()); \ | |
| 168 if (i > 0) \ | |
| 169 discardables[current_index]->Unlock(); \ | |
| 170 } \ | |
| 171 SetBytesToReclaimUnderModeratePressure(1024); \ | |
| 172 if (pressure) { \ | |
| 173 MemoryPressureListener::NotifyMemoryPressure( \ | |
| 174 MemoryPressureListener::MEMORY_PRESSURE_MODERATE); \ | |
| 175 RunLoop().RunUntilIdle(); \ | |
| 176 } else { \ | |
| 177 SetDiscardableMemoryLimit(2048); \ | |
| 178 } \ | |
| 179 EXPECT_NE(DISCARDABLE_MEMORY_FAILED, discardables[ordering[2]]->Lock()); \ | |
| 180 EXPECT_NE(DISCARDABLE_MEMORY_SUCCESS, discardables[ordering[1]]->Lock()); \ | |
| 181 EXPECT_NE(static_cast<void*>(NULL), \ | |
| 182 Memory(discardables[ordering[0]].get())); \ | |
| 183 } | |
| 184 | |
| 185 #define DiscardableMemoryProviderPermutions(name, pressure) \ | |
|
willchan no longer on Chromium
2013/10/29 01:44:59
My instinct is that you can replace this with valu
reveman
2013/10/29 15:22:23
I went ahead and parameterized these tests in late
| |
| 186 DiscardableMemoryProviderPermutionTest(name, 0, 1, 2, pressure); \ | |
| 187 DiscardableMemoryProviderPermutionTest(name, 0, 2, 1, pressure); \ | |
| 188 DiscardableMemoryProviderPermutionTest(name, 1, 0, 2, pressure); \ | |
| 189 DiscardableMemoryProviderPermutionTest(name, 1, 2, 0, pressure); \ | |
| 190 DiscardableMemoryProviderPermutionTest(name, 2, 0, 1, pressure); \ | |
| 191 DiscardableMemoryProviderPermutionTest(name, 2, 1, 0, pressure); | |
| 192 | |
| 193 DiscardableMemoryProviderPermutions(LRUDiscardedModeratePressure, true); | |
| 194 DiscardableMemoryProviderPermutions(LRUDiscardedExceedLimit, false); | |
| 195 | |
| 196 TEST_F(DiscardableMemoryProviderTest, CriticalPressureFreesAllUnlocked) { | |
| 197 scoped_ptr<DiscardableMemory> discardables[3]; | |
| 198 for (int i = 0; i < 3; ++i) { | |
| 199 discardables[i] = DiscardableMemory::CreateLockedMemory(1024); | |
| 200 EXPECT_TRUE(discardables[i]); | |
| 201 EXPECT_NE(static_cast<void*>(NULL), Memory(discardables[i].get())); | |
| 202 discardables[i]->Unlock(); | |
| 203 } | |
| 204 | |
| 205 for (int i = 0; i < 3; ++i) { | |
| 206 EXPECT_NE(DISCARDABLE_MEMORY_FAILED, discardables[i]->Lock()); | |
| 207 if (i > 0) | |
| 208 discardables[i]->Unlock(); | |
| 209 } | |
| 210 | |
| 211 MemoryPressureListener::NotifyMemoryPressure( | |
| 212 MemoryPressureListener::MEMORY_PRESSURE_CRITICAL); | |
| 213 RunLoop().RunUntilIdle(); | |
| 214 | |
| 215 for (int i = 0; i < 3; ++i) { | |
| 216 if (i == 0) | |
| 217 EXPECT_NE(static_cast<void*>(NULL), Memory(discardables[i].get())); | |
| 218 else | |
| 219 EXPECT_EQ(DISCARDABLE_MEMORY_PURGED, discardables[i]->Lock()); | |
| 220 } | |
| 221 } | |
| 222 | |
| 223 TEST_F(DiscardableMemoryProviderTest, NormalDestruction) { | |
| 224 { | |
| 225 size_t size = 1024; | |
| 226 const scoped_ptr<DiscardableMemory> discardable( | |
| 227 DiscardableMemory::CreateLockedMemory(size)); | |
| 228 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 229 EXPECT_EQ(1024u, BytesAllocated()); | |
| 230 } | |
| 231 EXPECT_EQ(0u, BytesAllocated()); | |
| 232 } | |
| 233 | |
| 234 TEST_F(DiscardableMemoryProviderTest, DestructionWhileLocked) { | |
| 235 { | |
| 236 size_t size = 1024; | |
| 237 const scoped_ptr<DiscardableMemory> discardable( | |
| 238 DiscardableMemory::CreateLockedMemory(size)); | |
| 239 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 240 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 241 EXPECT_EQ(1024u, BytesAllocated()); | |
| 242 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 243 } | |
| 244 // Should have ignored the "locked" status and freed the discardable memory. | |
| 245 EXPECT_EQ(0u, BytesAllocated()); | |
| 246 } | |
| 247 | |
| 248 TEST_F(DiscardableMemoryProviderTest, MemoryAfterUnlock) { | |
| 249 size_t size = 1024; | |
| 250 const scoped_ptr<DiscardableMemory> discardable( | |
| 251 DiscardableMemory::CreateLockedMemory(size)); | |
| 252 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 253 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 254 EXPECT_EQ(1024u, BytesAllocated()); | |
| 255 EXPECT_FALSE(CanBePurged(discardable.get())); | |
| 256 discardable->Unlock(); | |
| 257 EXPECT_TRUE(CanBePurged(discardable.get())); | |
| 258 // We *must* die if we are asked to vend a pointer to unlocked memory. | |
| 259 EXPECT_DEATH(discardable->Memory(), ".*Check failed.*"); | |
| 260 } | |
| 261 | |
| 262 class ThreadedDiscardableMemoryProviderTest | |
| 263 : public DiscardableMemoryProviderTest { | |
| 264 public: | |
| 265 ThreadedDiscardableMemoryProviderTest() | |
| 266 : memory_usage_thread_("memory_usage_thread"), | |
| 267 thread_sync_(true, false) { | |
| 268 } | |
| 269 | |
| 270 virtual void SetUp() OVERRIDE { | |
| 271 memory_usage_thread_.Start(); | |
| 272 } | |
| 273 | |
| 274 virtual void TearDown() OVERRIDE { | |
| 275 memory_usage_thread_.Stop(); | |
| 276 } | |
| 277 | |
| 278 void UseMemoryHelper() { | |
| 279 size_t size = 1024; | |
| 280 const scoped_ptr<DiscardableMemory> discardable( | |
| 281 DiscardableMemory::CreateLockedMemory(size)); | |
| 282 EXPECT_TRUE(IsRegistered(discardable.get())); | |
| 283 EXPECT_NE(static_cast<void*>(NULL), Memory(discardable.get())); | |
| 284 discardable->Unlock(); | |
| 285 } | |
| 286 | |
| 287 void SignalHelper() { | |
| 288 thread_sync_.Signal(); | |
| 289 } | |
| 290 | |
| 291 Thread memory_usage_thread_; | |
| 292 WaitableEvent thread_sync_; | |
| 293 }; | |
| 294 | |
| 295 TEST_F(ThreadedDiscardableMemoryProviderTest, UseMemoryOnThread) { | |
| 296 memory_usage_thread_.message_loop()->PostTask( | |
| 297 FROM_HERE, | |
| 298 Bind(&ThreadedDiscardableMemoryProviderTest::UseMemoryHelper, | |
| 299 Unretained(this))); | |
| 300 memory_usage_thread_.message_loop()->PostTask( | |
| 301 FROM_HERE, | |
| 302 Bind(&ThreadedDiscardableMemoryProviderTest::SignalHelper, | |
| 303 Unretained(this))); | |
| 304 thread_sync_.Wait(); | |
| 305 } | |
| 306 | |
| 307 } // namespace base | |
| OLD | NEW |