| OLD | NEW |
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "platform/heap/HeapCompact.h" | 5 #include "platform/heap/HeapCompact.h" |
| 6 | 6 |
| 7 #include "platform/heap/Handle.h" | 7 #include "platform/heap/Handle.h" |
| 8 #include "platform/heap/SparseHeapBitmap.h" | 8 #include "platform/heap/SparseHeapBitmap.h" |
| 9 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
| 10 #include "wtf/Deque.h" | 10 #include "wtf/Deque.h" |
| (...skipping 300 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 311 EXPECT_EQ(10u, intVector.size()); | 311 EXPECT_EQ(10u, intVector.size()); |
| 312 for (size_t i = 0; i < intVector.size(); ++i) { | 312 for (size_t i = 0; i < intVector.size(); ++i) { |
| 313 EXPECT_EQ(static_cast<int>(i), intVector[i]->value()); | 313 EXPECT_EQ(static_cast<int>(i), intVector[i]->value()); |
| 314 } | 314 } |
| 315 } | 315 } |
| 316 } | 316 } |
| 317 | 317 |
| 318 TEST(HeapCompactTest, CompactDeques) { | 318 TEST(HeapCompactTest, CompactDeques) { |
| 319 Persistent<IntDeque> deque = new IntDeque; | 319 Persistent<IntDeque> deque = new IntDeque; |
| 320 for (int i = 0; i < 8; ++i) { | 320 for (int i = 0; i < 8; ++i) { |
| 321 deque->prepend(IntWrapper::create(i)); | 321 deque->push_front(IntWrapper::create(i)); |
| 322 } | 322 } |
| 323 EXPECT_EQ(8u, deque->size()); | 323 EXPECT_EQ(8u, deque->size()); |
| 324 | 324 |
| 325 for (size_t i = 0; i < deque->size(); ++i) | 325 for (size_t i = 0; i < deque->size(); ++i) |
| 326 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i)->value()); | 326 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i)->value()); |
| 327 | 327 |
| 328 performHeapCompaction(); | 328 performHeapCompaction(); |
| 329 | 329 |
| 330 for (size_t i = 0; i < deque->size(); ++i) | 330 for (size_t i = 0; i < deque->size(); ++i) |
| 331 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i)->value()); | 331 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i)->value()); |
| 332 } | 332 } |
| 333 | 333 |
| 334 TEST(HeapCompactTest, CompactDequeVectors) { | 334 TEST(HeapCompactTest, CompactDequeVectors) { |
| 335 Persistent<HeapDeque<IntVector>> deque = new HeapDeque<IntVector>; | 335 Persistent<HeapDeque<IntVector>> deque = new HeapDeque<IntVector>; |
| 336 for (int i = 0; i < 8; ++i) { | 336 for (int i = 0; i < 8; ++i) { |
| 337 IntWrapper* value = IntWrapper::create(i); | 337 IntWrapper* value = IntWrapper::create(i); |
| 338 IntVector vector = IntVector(8, value); | 338 IntVector vector = IntVector(8, value); |
| 339 deque->prepend(vector); | 339 deque->push_front(vector); |
| 340 } | 340 } |
| 341 EXPECT_EQ(8u, deque->size()); | 341 EXPECT_EQ(8u, deque->size()); |
| 342 | 342 |
| 343 for (size_t i = 0; i < deque->size(); ++i) | 343 for (size_t i = 0; i < deque->size(); ++i) |
| 344 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i).at(i)->value()); | 344 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i).at(i)->value()); |
| 345 | 345 |
| 346 performHeapCompaction(); | 346 performHeapCompaction(); |
| 347 | 347 |
| 348 for (size_t i = 0; i < deque->size(); ++i) | 348 for (size_t i = 0; i < deque->size(); ++i) |
| 349 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i).at(i)->value()); | 349 EXPECT_EQ(static_cast<int>(7 - i), deque->at(i).at(i)->value()); |
| (...skipping 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 452 | 452 |
| 453 expected = 0; | 453 expected = 0; |
| 454 for (const Inner* v : *set) { | 454 for (const Inner* v : *set) { |
| 455 EXPECT_EQ(1u, v->size()); | 455 EXPECT_EQ(1u, v->size()); |
| 456 EXPECT_EQ(expected, (*v->begin())->value()); | 456 EXPECT_EQ(expected, (*v->begin())->value()); |
| 457 expected++; | 457 expected++; |
| 458 } | 458 } |
| 459 } | 459 } |
| 460 | 460 |
| 461 } // namespace blink | 461 } // namespace blink |
| OLD | NEW |