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 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
89 | 89 |
90 // Array should be in the new space. | 90 // Array should be in the new space. |
91 CHECK(heap->InSpace(*array, NEW_SPACE)); | 91 CHECK(heap->InSpace(*array, NEW_SPACE)); |
92 heap->CollectAllGarbage(); | 92 heap->CollectAllGarbage(); |
93 heap->CollectAllGarbage(); | 93 heap->CollectAllGarbage(); |
94 CHECK(heap->InSpace(*array, OLD_SPACE)); | 94 CHECK(heap->InSpace(*array, OLD_SPACE)); |
95 } | 95 } |
96 } | 96 } |
97 | 97 |
98 HEAP_TEST(NoPromotion) { | 98 HEAP_TEST(NoPromotion) { |
| 99 // Page promotion allows pages to be moved to old space even in the case of |
| 100 // OOM scenarios. |
| 101 FLAG_page_promotion = false; |
99 CcTest::InitializeVM(); | 102 CcTest::InitializeVM(); |
100 Isolate* isolate = CcTest::i_isolate(); | 103 Isolate* isolate = CcTest::i_isolate(); |
101 { | 104 { |
102 v8::HandleScope sc(CcTest::isolate()); | 105 v8::HandleScope sc(CcTest::isolate()); |
103 Heap* heap = isolate->heap(); | 106 Heap* heap = isolate->heap(); |
104 | 107 |
105 heap::SealCurrentObjects(heap); | 108 heap::SealCurrentObjects(heap); |
106 | 109 |
107 int array_length = heap::FixedArrayLenFromSize(kMaxRegularHeapObjectSize); | 110 int array_length = heap::FixedArrayLenFromSize(kMaxRegularHeapObjectSize); |
108 Handle<FixedArray> array = isolate->factory()->NewFixedArray(array_length); | 111 Handle<FixedArray> array = isolate->factory()->NewFixedArray(array_length); |
(...skipping 366 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
475 | 478 |
476 | 479 |
477 TEST(RegressJoinThreadsOnIsolateDeinit) { | 480 TEST(RegressJoinThreadsOnIsolateDeinit) { |
478 intptr_t size_limit = ShortLivingIsolate() * 2; | 481 intptr_t size_limit = ShortLivingIsolate() * 2; |
479 for (int i = 0; i < 10; i++) { | 482 for (int i = 0; i < 10; i++) { |
480 CHECK_GT(size_limit, ShortLivingIsolate()); | 483 CHECK_GT(size_limit, ShortLivingIsolate()); |
481 } | 484 } |
482 } | 485 } |
483 | 486 |
484 #endif // __linux__ and !USE_SIMULATOR | 487 #endif // __linux__ and !USE_SIMULATOR |
OLD | NEW |