| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 44 #include "test/cctest/cctest.h" | 44 #include "test/cctest/cctest.h" |
| 45 #include "test/cctest/heap/heap-tester.h" | 45 #include "test/cctest/heap/heap-tester.h" |
| 46 #include "test/cctest/heap/heap-utils.h" | 46 #include "test/cctest/heap/heap-utils.h" |
| 47 | 47 |
| 48 using namespace v8::internal; | 48 using namespace v8::internal; |
| 49 using v8::Just; | 49 using v8::Just; |
| 50 | 50 |
| 51 | 51 |
| 52 TEST(MarkingDeque) { | 52 TEST(MarkingDeque) { |
| 53 CcTest::InitializeVM(); | 53 CcTest::InitializeVM(); |
| 54 MarkingDeque s; | 54 MarkingDeque s(CcTest::i_isolate()->heap()); |
| 55 s.SetUp(); | 55 s.SetUp(); |
| 56 s.StartUsing(); | 56 s.StartUsing(); |
| 57 Address original_address = reinterpret_cast<Address>(&s); | 57 Address original_address = reinterpret_cast<Address>(&s); |
| 58 Address current_address = original_address; | 58 Address current_address = original_address; |
| 59 while (!s.IsFull()) { | 59 while (!s.IsFull()) { |
| 60 s.Push(HeapObject::FromAddress(current_address)); | 60 s.Push(HeapObject::FromAddress(current_address)); |
| 61 current_address += kPointerSize; | 61 current_address += kPointerSize; |
| 62 } | 62 } |
| 63 | 63 |
| 64 while (!s.IsEmpty()) { | 64 while (!s.IsEmpty()) { |
| (...skipping 411 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 476 | 476 |
| 477 | 477 |
| 478 TEST(RegressJoinThreadsOnIsolateDeinit) { | 478 TEST(RegressJoinThreadsOnIsolateDeinit) { |
| 479 intptr_t size_limit = ShortLivingIsolate() * 2; | 479 intptr_t size_limit = ShortLivingIsolate() * 2; |
| 480 for (int i = 0; i < 10; i++) { | 480 for (int i = 0; i < 10; i++) { |
| 481 CHECK_GT(size_limit, ShortLivingIsolate()); | 481 CHECK_GT(size_limit, ShortLivingIsolate()); |
| 482 } | 482 } |
| 483 } | 483 } |
| 484 | 484 |
| 485 #endif // __linux__ and !USE_SIMULATOR | 485 #endif // __linux__ and !USE_SIMULATOR |
| OLD | NEW |