[Isolates] RegExpStack and memory allocation limits (statics #6)

test/cctest/test-spaces.cc

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 72 matching lines @@
   CHECK(p->OffsetToAddress(Page::kPageSize) == p->ObjectAreaEnd());
 
   // test region marking
   VerifyRegionMarking(page_start);
 
   DeleteArray(mem);
 }
 
 
 TEST(MemoryAllocator) {
+  OS::Setup();
   Isolate* isolate = Isolate::Current();
 
   CHECK(isolate->heap()->ConfigureHeapDefault());
   CHECK(isolate->memory_allocator()->Setup(isolate->heap()->MaxReserved()));
 
   OldSpace faked_space(isolate->heap()->MaxReserved(), OLD_POINTER_SPACE,
                        NOT_EXECUTABLE);
   int total_pages = 0;
   int requested = 2;
   int allocated;
@@ skipping 41 matching lines @@
   // Freeing pages in the first chunk starting at the first page should free
   // the first chunk and return an invalid page.
   Page* invalid_page = isolate->memory_allocator()->FreePages(first_page);
   CHECK(!invalid_page->is_valid());
 
   isolate->memory_allocator()->TearDown();
 }
 
 
 TEST(NewSpace) {
+  OS::Setup();
   CHECK(HEAP->ConfigureHeapDefault());
   CHECK(Isolate::Current()->memory_allocator()->Setup(HEAP->MaxReserved()));
 
   NewSpace new_space;
 
   void* chunk =
       Isolate::Current()->memory_allocator()->ReserveInitialChunk(
           4 * HEAP->ReservedSemiSpaceSize());
   CHECK(chunk != NULL);
   Address start = RoundUp(static_cast<Address>(chunk),
                           2 * HEAP->ReservedSemiSpaceSize());
   CHECK(new_space.Setup(start, 2 * HEAP->ReservedSemiSpaceSize()));
   CHECK(new_space.HasBeenSetup());
 
   while (new_space.Available() >= Page::kMaxHeapObjectSize) {
     Object* obj = new_space.AllocateRaw(Page::kMaxHeapObjectSize);
     CHECK(!obj->IsFailure());
     CHECK(new_space.Contains(HeapObject::cast(obj)));
   }
 
   new_space.TearDown();
   Isolate::Current()->memory_allocator()->TearDown();
 }
 
 
 TEST(OldSpace) {
+  OS::Setup();
   CHECK(HEAP->ConfigureHeapDefault());
   CHECK(Isolate::Current()->memory_allocator()->Setup(HEAP->MaxReserved()));
 
   OldSpace* s = new OldSpace(HEAP->MaxOldGenerationSize(),
                              OLD_POINTER_SPACE,
                              NOT_EXECUTABLE);
   CHECK(s != NULL);
 
   void* chunk =
       Isolate::Current()->memory_allocator()->ReserveInitialChunk(
           4 * HEAP->ReservedSemiSpaceSize());
   CHECK(chunk != NULL);
   Address start = static_cast<Address>(chunk);
   size_t size = RoundUp(start, 2 * HEAP->ReservedSemiSpaceSize()) - start;
 
   CHECK(s->Setup(start, size));
 
   while (s->Available() > 0) {
     Object* obj = s->AllocateRaw(Page::kMaxHeapObjectSize);
     CHECK(!obj->IsFailure());
   }
 
   s->TearDown();
   delete s;
   Isolate::Current()->memory_allocator()->TearDown();
 }
 
 
 TEST(LargeObjectSpace) {
+  OS::Setup();
   CHECK(HEAP->Setup(false));
 
   LargeObjectSpace* lo = HEAP->lo_space();
   CHECK(lo != NULL);
 
   Map* faked_map = reinterpret_cast<Map*>(HeapObject::FromAddress(0));
   int lo_size = Page::kPageSize;
 
   Object* obj = lo->AllocateRaw(lo_size);
   CHECK(!obj->IsFailure());
@@ skipping 19 matching lines @@
   CHECK(!lo->IsEmpty());
 
   obj = lo->AllocateRaw(lo_size);
   CHECK(obj->IsFailure());
 
   lo->TearDown();
   delete lo;
 
   Isolate::Current()->memory_allocator()->TearDown();
 }