| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include <stdlib.h> | 28 #include <stdlib.h> |
| 29 | 29 |
| 30 #include "src/snapshot.h" |
| 30 #include "src/v8.h" | 31 #include "src/v8.h" |
| 31 #include "test/cctest/cctest.h" | 32 #include "test/cctest/cctest.h" |
| 32 | 33 |
| 34 |
| 33 using namespace v8::internal; | 35 using namespace v8::internal; |
| 34 | 36 |
| 35 #if 0 | 37 #if 0 |
| 36 static void VerifyRegionMarking(Address page_start) { | 38 static void VerifyRegionMarking(Address page_start) { |
| 37 #ifdef ENABLE_CARDMARKING_WRITE_BARRIER | 39 #ifdef ENABLE_CARDMARKING_WRITE_BARRIER |
| 38 Page* p = Page::FromAddress(page_start); | 40 Page* p = Page::FromAddress(page_start); |
| 39 | 41 |
| 40 p->SetRegionMarks(Page::kAllRegionsCleanMarks); | 42 p->SetRegionMarks(Page::kAllRegionsCleanMarks); |
| 41 | 43 |
| 42 for (Address addr = p->ObjectAreaStart(); | 44 for (Address addr = p->ObjectAreaStart(); |
| (...skipping 355 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 398 } | 400 } |
| 399 | 401 |
| 400 CHECK(!lo->IsEmpty()); | 402 CHECK(!lo->IsEmpty()); |
| 401 | 403 |
| 402 CHECK(lo->AllocateRaw(lo_size, NOT_EXECUTABLE).IsRetry()); | 404 CHECK(lo->AllocateRaw(lo_size, NOT_EXECUTABLE).IsRetry()); |
| 403 } | 405 } |
| 404 | 406 |
| 405 | 407 |
| 406 TEST(SizeOfFirstPageIsLargeEnough) { | 408 TEST(SizeOfFirstPageIsLargeEnough) { |
| 407 if (i::FLAG_always_opt) return; | 409 if (i::FLAG_always_opt) return; |
| 410 // Bootstrapping without a snapshot causes more allocations. |
| 411 if (!i::Snapshot::HaveASnapshotToStartFrom()) return; |
| 408 CcTest::InitializeVM(); | 412 CcTest::InitializeVM(); |
| 409 Isolate* isolate = CcTest::i_isolate(); | 413 Isolate* isolate = CcTest::i_isolate(); |
| 410 | 414 |
| 411 // Freshly initialized VM gets by with one page per space. | 415 // Freshly initialized VM gets by with one page per space. |
| 412 for (int i = FIRST_PAGED_SPACE; i <= LAST_PAGED_SPACE; i++) { | 416 for (int i = FIRST_PAGED_SPACE; i <= LAST_PAGED_SPACE; i++) { |
| 413 // Debug code can be very large, so skip CODE_SPACE if we are generating it. | 417 // Debug code can be very large, so skip CODE_SPACE if we are generating it. |
| 414 if (i == CODE_SPACE && i::FLAG_debug_code) continue; | 418 if (i == CODE_SPACE && i::FLAG_debug_code) continue; |
| 415 CHECK_EQ(1, isolate->heap()->paged_space(i)->CountTotalPages()); | 419 CHECK_EQ(1, isolate->heap()->paged_space(i)->CountTotalPages()); |
| 416 } | 420 } |
| 417 | 421 |
| 418 // Executing the empty script gets by with one page per space. | 422 // Executing the empty script gets by with one page per space. |
| 419 HandleScope scope(isolate); | 423 HandleScope scope(isolate); |
| 420 CompileRun("/*empty*/"); | 424 CompileRun("/*empty*/"); |
| 421 for (int i = FIRST_PAGED_SPACE; i <= LAST_PAGED_SPACE; i++) { | 425 for (int i = FIRST_PAGED_SPACE; i <= LAST_PAGED_SPACE; i++) { |
| 422 // Debug code can be very large, so skip CODE_SPACE if we are generating it. | 426 // Debug code can be very large, so skip CODE_SPACE if we are generating it. |
| 423 if (i == CODE_SPACE && i::FLAG_debug_code) continue; | 427 if (i == CODE_SPACE && i::FLAG_debug_code) continue; |
| 424 CHECK_EQ(1, isolate->heap()->paged_space(i)->CountTotalPages()); | 428 CHECK_EQ(1, isolate->heap()->paged_space(i)->CountTotalPages()); |
| 425 } | 429 } |
| 426 | 430 |
| 427 // No large objects required to perform the above steps. | 431 // No large objects required to perform the above steps. |
| 428 CHECK(isolate->heap()->lo_space()->IsEmpty()); | 432 CHECK(isolate->heap()->lo_space()->IsEmpty()); |
| 429 } | 433 } |
| OLD | NEW |