1 // Copyright 2011 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
30 #include "src/base/platform/platform.h"
31 #include "src/snapshot.h"
33 #include "test/cctest/cctest.h"
36 using namespace v8::internal;
39 static void VerifyRegionMarking(Address page_start) {
40 #ifdef ENABLE_CARDMARKING_WRITE_BARRIER
41 Page* p = Page::FromAddress(page_start);
43 p->SetRegionMarks(Page::kAllRegionsCleanMarks);
45 for (Address addr = p->ObjectAreaStart();
46 addr < p->ObjectAreaEnd();
47 addr += kPointerSize) {
48 CHECK(!Page::FromAddress(addr)->IsRegionDirty(addr));
51 for (Address addr = p->ObjectAreaStart();
52 addr < p->ObjectAreaEnd();
53 addr += kPointerSize) {
54 Page::FromAddress(addr)->MarkRegionDirty(addr);
57 for (Address addr = p->ObjectAreaStart();
58 addr < p->ObjectAreaEnd();
59 addr += kPointerSize) {
60 CHECK(Page::FromAddress(addr)->IsRegionDirty(addr));
67 // TODO(gc) you can no longer allocate pages like this. Details are hidden.
70 byte* mem = NewArray<byte>(2*Page::kPageSize);
73 Address start = reinterpret_cast<Address>(mem);
74 Address page_start = RoundUp(start, Page::kPageSize);
76 Page* p = Page::FromAddress(page_start);
77 // Initialized Page has heap pointer, normally set by memory_allocator.
78 p->heap_ = CcTest::heap();
79 CHECK(p->address() == page_start);
83 p->SetIsLargeObjectPage(false);
84 CHECK(!p->next_page()->is_valid());
86 CHECK(p->ObjectAreaStart() == page_start + Page::kObjectStartOffset);
87 CHECK(p->ObjectAreaEnd() == page_start + Page::kPageSize);
89 CHECK(p->Offset(page_start + Page::kObjectStartOffset) ==
90 Page::kObjectStartOffset);
91 CHECK(p->Offset(page_start + Page::kPageSize) == Page::kPageSize);
93 CHECK(p->OffsetToAddress(Page::kObjectStartOffset) == p->ObjectAreaStart());
94 CHECK(p->OffsetToAddress(Page::kPageSize) == p->ObjectAreaEnd());
96 // test region marking
97 VerifyRegionMarking(page_start);
107 // Temporarily sets a given allocator in an isolate.
108 class TestMemoryAllocatorScope {
110 TestMemoryAllocatorScope(Isolate* isolate, MemoryAllocator* allocator)
112 old_allocator_(isolate->memory_allocator_) {
113 isolate->memory_allocator_ = allocator;
116 ~TestMemoryAllocatorScope() {
117 isolate_->memory_allocator_ = old_allocator_;
122 MemoryAllocator* old_allocator_;
124 DISALLOW_COPY_AND_ASSIGN(TestMemoryAllocatorScope);
128 // Temporarily sets a given code range in an isolate.
129 class TestCodeRangeScope {
131 TestCodeRangeScope(Isolate* isolate, CodeRange* code_range)
133 old_code_range_(isolate->code_range_) {
134 isolate->code_range_ = code_range;
137 ~TestCodeRangeScope() {
138 isolate_->code_range_ = old_code_range_;
143 CodeRange* old_code_range_;
145 DISALLOW_COPY_AND_ASSIGN(TestCodeRangeScope);
148 } } // namespace v8::internal
151 static void VerifyMemoryChunk(Isolate* isolate,
153 CodeRange* code_range,
154 size_t reserve_area_size,
155 size_t commit_area_size,
156 size_t second_commit_area_size,
157 Executability executable) {
158 MemoryAllocator* memory_allocator = new MemoryAllocator(isolate);
159 CHECK(memory_allocator->SetUp(heap->MaxReserved(),
160 heap->MaxExecutableSize()));
161 TestMemoryAllocatorScope test_allocator_scope(isolate, memory_allocator);
162 TestCodeRangeScope test_code_range_scope(isolate, code_range);
164 size_t header_size = (executable == EXECUTABLE)
165 ? MemoryAllocator::CodePageGuardStartOffset()
166 : MemoryChunk::kObjectStartOffset;
167 size_t guard_size = (executable == EXECUTABLE)
168 ? MemoryAllocator::CodePageGuardSize()
171 MemoryChunk* memory_chunk = memory_allocator->AllocateChunk(reserve_area_size,
175 size_t alignment = code_range != NULL && code_range->valid() ?
176 MemoryChunk::kAlignment : v8::base::OS::CommitPageSize();
177 size_t reserved_size =
178 ((executable == EXECUTABLE))
179 ? RoundUp(header_size + guard_size + reserve_area_size + guard_size,
181 : RoundUp(header_size + reserve_area_size,
182 v8::base::OS::CommitPageSize());
183 CHECK(memory_chunk->size() == reserved_size);
184 CHECK(memory_chunk->area_start() < memory_chunk->address() +
185 memory_chunk->size());
186 CHECK(memory_chunk->area_end() <= memory_chunk->address() +
187 memory_chunk->size());
188 CHECK(static_cast<size_t>(memory_chunk->area_size()) == commit_area_size);
190 Address area_start = memory_chunk->area_start();
192 memory_chunk->CommitArea(second_commit_area_size);
193 CHECK(area_start == memory_chunk->area_start());
194 CHECK(memory_chunk->area_start() < memory_chunk->address() +
195 memory_chunk->size());
196 CHECK(memory_chunk->area_end() <= memory_chunk->address() +
197 memory_chunk->size());
198 CHECK(static_cast<size_t>(memory_chunk->area_size()) ==
199 second_commit_area_size);
201 memory_allocator->Free(memory_chunk);
202 memory_allocator->TearDown();
203 delete memory_allocator;
208 Isolate* isolate = CcTest::i_isolate();
209 Heap* heap = isolate->heap();
210 MemoryAllocator* memory_allocator = new MemoryAllocator(isolate);
212 memory_allocator->SetUp(heap->MaxReserved(), heap->MaxExecutableSize()));
213 TestMemoryAllocatorScope test_allocator_scope(isolate, memory_allocator);
214 CodeRange* code_range = new CodeRange(isolate);
215 const size_t code_range_size = 4 * MB;
216 if (!code_range->SetUp(
218 RoundUp(v8::base::OS::CommitPageSize() * kReservedCodeRangePages,
219 MemoryChunk::kAlignment) +
220 v8::internal::MemoryAllocator::CodePageAreaSize())) {
225 address = code_range->AllocateRawMemory(code_range_size - 2 * MB,
226 code_range_size - 2 * MB, &size);
227 CHECK(address != NULL);
228 Address null_address;
230 null_address = code_range->AllocateRawMemory(
231 code_range_size - MB, code_range_size - MB, &null_size);
232 CHECK(null_address == NULL);
233 code_range->FreeRawMemory(address, size);
235 memory_allocator->TearDown();
236 delete memory_allocator;
240 static unsigned int Pseudorandom() {
241 static uint32_t lo = 2345;
242 lo = 18273 * (lo & 0xFFFFF) + (lo >> 16);
248 Isolate* isolate = CcTest::i_isolate();
249 Heap* heap = isolate->heap();
251 size_t reserve_area_size = 1 * MB;
252 size_t initial_commit_area_size, second_commit_area_size;
254 for (int i = 0; i < 100; i++) {
255 initial_commit_area_size = Pseudorandom();
256 second_commit_area_size = Pseudorandom();
259 CodeRange* code_range = new CodeRange(isolate);
260 const size_t code_range_size = 32 * MB;
261 if (!code_range->SetUp(code_range_size)) return;
263 VerifyMemoryChunk(isolate,
267 initial_commit_area_size,
268 second_commit_area_size,
271 VerifyMemoryChunk(isolate,
275 initial_commit_area_size,
276 second_commit_area_size,
280 // Without CodeRange.
282 VerifyMemoryChunk(isolate,
286 initial_commit_area_size,
287 second_commit_area_size,
290 VerifyMemoryChunk(isolate,
294 initial_commit_area_size,
295 second_commit_area_size,
301 TEST(MemoryAllocator) {
302 Isolate* isolate = CcTest::i_isolate();
303 Heap* heap = isolate->heap();
305 MemoryAllocator* memory_allocator = new MemoryAllocator(isolate);
306 CHECK(memory_allocator->SetUp(heap->MaxReserved(),
307 heap->MaxExecutableSize()));
310 OldSpace faked_space(heap,
314 Page* first_page = memory_allocator->AllocatePage(
315 faked_space.AreaSize(), &faked_space, NOT_EXECUTABLE);
317 first_page->InsertAfter(faked_space.anchor()->prev_page());
318 CHECK(first_page->is_valid());
319 CHECK(first_page->next_page() == faked_space.anchor());
322 for (Page* p = first_page; p != faked_space.anchor(); p = p->next_page()) {
323 CHECK(p->owner() == &faked_space);
326 // Again, we should get n or n - 1 pages.
327 Page* other = memory_allocator->AllocatePage(
328 faked_space.AreaSize(), &faked_space, NOT_EXECUTABLE);
329 CHECK(other->is_valid());
331 other->InsertAfter(first_page);
333 for (Page* p = first_page; p != faked_space.anchor(); p = p->next_page()) {
334 CHECK(p->owner() == &faked_space);
337 CHECK(total_pages == page_count);
339 Page* second_page = first_page->next_page();
340 CHECK(second_page->is_valid());
341 memory_allocator->Free(first_page);
342 memory_allocator->Free(second_page);
343 memory_allocator->TearDown();
344 delete memory_allocator;
349 Isolate* isolate = CcTest::i_isolate();
350 Heap* heap = isolate->heap();
351 MemoryAllocator* memory_allocator = new MemoryAllocator(isolate);
352 CHECK(memory_allocator->SetUp(heap->MaxReserved(),
353 heap->MaxExecutableSize()));
354 TestMemoryAllocatorScope test_scope(isolate, memory_allocator);
356 NewSpace new_space(heap);
358 CHECK(new_space.SetUp(CcTest::heap()->ReservedSemiSpaceSize(),
359 CcTest::heap()->ReservedSemiSpaceSize()));
360 CHECK(new_space.HasBeenSetUp());
362 while (new_space.Available() >= Page::kMaxRegularHeapObjectSize) {
363 Object* obj = new_space.AllocateRaw(
364 Page::kMaxRegularHeapObjectSize).ToObjectChecked();
365 CHECK(new_space.Contains(HeapObject::cast(obj)));
368 new_space.TearDown();
369 memory_allocator->TearDown();
370 delete memory_allocator;
375 Isolate* isolate = CcTest::i_isolate();
376 Heap* heap = isolate->heap();
377 MemoryAllocator* memory_allocator = new MemoryAllocator(isolate);
378 CHECK(memory_allocator->SetUp(heap->MaxReserved(),
379 heap->MaxExecutableSize()));
380 TestMemoryAllocatorScope test_scope(isolate, memory_allocator);
382 OldSpace* s = new OldSpace(heap,
383 heap->MaxOldGenerationSize(),
390 while (s->Available() > 0) {
391 s->AllocateRaw(Page::kMaxRegularHeapObjectSize).ToObjectChecked();
396 memory_allocator->TearDown();
397 delete memory_allocator;
401 TEST(LargeObjectSpace) {
402 v8::V8::Initialize();
404 LargeObjectSpace* lo = CcTest::heap()->lo_space();
407 int lo_size = Page::kPageSize;
409 Object* obj = lo->AllocateRaw(lo_size, NOT_EXECUTABLE).ToObjectChecked();
410 CHECK(obj->IsHeapObject());
412 HeapObject* ho = HeapObject::cast(obj);
414 CHECK(lo->Contains(HeapObject::cast(obj)));
416 CHECK(lo->FindObject(ho->address()) == obj);
418 CHECK(lo->Contains(ho));
421 intptr_t available = lo->Available();
422 { AllocationResult allocation = lo->AllocateRaw(lo_size, NOT_EXECUTABLE);
423 if (allocation.IsRetry()) break;
425 CHECK(lo->Available() < available);
428 CHECK(!lo->IsEmpty());
430 CHECK(lo->AllocateRaw(lo_size, NOT_EXECUTABLE).IsRetry());
434 TEST(SizeOfFirstPageIsLargeEnough) {
435 if (i::FLAG_always_opt) return;
436 // Bootstrapping without a snapshot causes more allocations.
437 if (!i::Snapshot::HaveASnapshotToStartFrom()) return;
438 CcTest::InitializeVM();
439 Isolate* isolate = CcTest::i_isolate();
441 // Freshly initialized VM gets by with one page per space.
442 for (int i = FIRST_PAGED_SPACE; i <= LAST_PAGED_SPACE; i++) {
443 // Debug code can be very large, so skip CODE_SPACE if we are generating it.
444 if (i == CODE_SPACE && i::FLAG_debug_code) continue;
445 CHECK_EQ(1, isolate->heap()->paged_space(i)->CountTotalPages());
448 // Executing the empty script gets by with one page per space.
449 HandleScope scope(isolate);
450 CompileRun("/*empty*/");
451 for (int i = FIRST_PAGED_SPACE; i <= LAST_PAGED_SPACE; i++) {
452 // Debug code can be very large, so skip CODE_SPACE if we are generating it.
453 if (i == CODE_SPACE && i::FLAG_debug_code) continue;
454 CHECK_EQ(1, isolate->heap()->paged_space(i)->CountTotalPages());
457 // No large objects required to perform the above steps.
458 CHECK(isolate->heap()->lo_space()->IsEmpty());
462 UNINITIALIZED_TEST(NewSpaceGrowsToTargetCapacity) {
463 FLAG_target_semi_space_size = 2;
464 if (FLAG_optimize_for_size) return;
466 v8::Isolate* isolate = v8::Isolate::New();
468 v8::Isolate::Scope isolate_scope(isolate);
469 v8::HandleScope handle_scope(isolate);
470 v8::Context::New(isolate)->Enter();
472 Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
474 NewSpace* new_space = i_isolate->heap()->new_space();
476 // This test doesn't work if we start with a non-default new space
478 if (new_space->InitialTotalCapacity() == Page::kPageSize) {
479 CHECK(new_space->CommittedMemory() == new_space->InitialTotalCapacity());
481 // Fill up the first (and only) page of the semi space.
482 FillCurrentPage(new_space);
484 // Try to allocate out of the new space. A new page should be added and
486 // allocation should succeed.
487 v8::internal::AllocationResult allocation = new_space->AllocateRaw(80);
488 CHECK(!allocation.IsRetry());
489 CHECK(new_space->CommittedMemory() == 2 * Page::kPageSize);
491 // Turn the allocation into a proper object so isolate teardown won't
493 HeapObject* free_space = NULL;
494 CHECK(allocation.To(&free_space));
495 new_space->heap()->CreateFillerObjectAt(free_space->address(), 80);