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 |
(...skipping 350 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
361 0)); | 361 0)); |
362 TestMemoryAllocatorScope test_scope(isolate, memory_allocator); | 362 TestMemoryAllocatorScope test_scope(isolate, memory_allocator); |
363 | 363 |
364 NewSpace new_space(heap); | 364 NewSpace new_space(heap); |
365 | 365 |
366 CHECK(new_space.SetUp(CcTest::heap()->InitialSemiSpaceSize(), | 366 CHECK(new_space.SetUp(CcTest::heap()->InitialSemiSpaceSize(), |
367 CcTest::heap()->InitialSemiSpaceSize())); | 367 CcTest::heap()->InitialSemiSpaceSize())); |
368 CHECK(new_space.HasBeenSetUp()); | 368 CHECK(new_space.HasBeenSetUp()); |
369 | 369 |
370 while (new_space.Available() >= kMaxRegularHeapObjectSize) { | 370 while (new_space.Available() >= kMaxRegularHeapObjectSize) { |
371 Object* obj = new_space.AllocateRawUnaligned(kMaxRegularHeapObjectSize) | 371 CHECK(new_space.Contains( |
372 .ToObjectChecked(); | 372 new_space.AllocateRawUnaligned(kMaxRegularHeapObjectSize) |
373 CHECK(new_space.Contains(HeapObject::cast(obj))); | 373 .ToObjectChecked())); |
374 } | 374 } |
375 | 375 |
376 new_space.TearDown(); | 376 new_space.TearDown(); |
377 memory_allocator->TearDown(); | 377 memory_allocator->TearDown(); |
378 delete memory_allocator; | 378 delete memory_allocator; |
379 } | 379 } |
380 | 380 |
381 | 381 |
382 TEST(OldSpace) { | 382 TEST(OldSpace) { |
383 Isolate* isolate = CcTest::i_isolate(); | 383 Isolate* isolate = CcTest::i_isolate(); |
(...skipping 405 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
789 HeapObject* filler = | 789 HeapObject* filler = |
790 HeapObject::FromAddress(array->address() + array->Size()); | 790 HeapObject::FromAddress(array->address() + array->Size()); |
791 CHECK_EQ(filler->map(), CcTest::heap()->two_pointer_filler_map()); | 791 CHECK_EQ(filler->map(), CcTest::heap()->two_pointer_filler_map()); |
792 | 792 |
793 const size_t shrinked = page->ShrinkToHighWaterMark(); | 793 const size_t shrinked = page->ShrinkToHighWaterMark(); |
794 CHECK_EQ(0, shrinked); | 794 CHECK_EQ(0, shrinked); |
795 } | 795 } |
796 | 796 |
797 } // namespace internal | 797 } // namespace internal |
798 } // namespace v8 | 798 } // namespace v8 |
OLD | NEW |