Add a stub_code_space in the heap alongside code_space so that stub code generation happens here an…

vm/heap.cc

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/heap.h"
 
 #include "platform/assert.h"
 #include "platform/utils.h"
 #include "vm/compiler_stats.h"
 #include "vm/flags.h"
@@ skipping 13 matching lines @@
 DEFINE_FLAG(bool, verify_after_gc, false,
             "Enables heap verification after GC.");
 DEFINE_FLAG(bool, gc_at_alloc, false, "GC at every allocation.");
 DEFINE_FLAG(int, new_gen_heap_size, 32, "new gen heap size in MB,"
             "e.g: --new_gen_heap_size=64 allocates a 64MB new gen heap");
 DEFINE_FLAG(int, old_gen_heap_size, Heap::kHeapSizeInMB,
             "old gen heap size in MB,"
             "e.g: --old_gen_heap_size=1024 allocates a 1024MB old gen heap");
 DEFINE_FLAG(int, code_heap_size, Heap::kCodeHeapSizeInMB,
             "code heap size in MB,"
-            "e.g: --code_heap_size=8 allocates a 8MB old gen heap");
+            "e.g: --code_heap_size=8 allocates a 8MB code heap");
+DEFINE_FLAG(int, stub_code_heap_size, Heap::kStubCodeHeapSizeInKB,
+            "stub code heap size in KB,"
+            "e.g: --code_heap_size=256 allocates a 256KB stub code heap");

[Ivan Posva, 2012/04/26 15:09:01]

Mismatch in flag comment.

[siva, 2012/04/26 16:51:42]

Done.

 
 Heap::Heap() {
   new_space_ = new Scavenger(this,
                              (FLAG_new_gen_heap_size * MB),
                              kNewObjectAlignmentOffset);
   old_space_ = new PageSpace(this, (FLAG_old_gen_heap_size * MB));
   code_space_ = new PageSpace(this, (FLAG_code_heap_size * MB), true);
+  stub_code_space_ = new PageSpace(this, (FLAG_stub_code_heap_size * KB), true);
 }
 
 
 Heap::~Heap() {
   delete new_space_;
   delete old_space_;
   delete code_space_;
+  delete stub_code_space_;
 }
 
 
 uword Heap::AllocateNew(intptr_t size) {
   ASSERT(Isolate::Current()->no_gc_scope_depth() == 0);
   uword addr = new_space_->TryAllocate(size);
   if (addr != 0) {
     return addr;
   }
   CollectGarbage(kNew);
   if (FLAG_verbose_gc) {
-    OS::PrintErr("New space (%dk) Old space (%dk) Code space (%dk)\n",
+    OS::PrintErr("New space (%dk) Old space (%dk) "
+                 "Code space (%dk) Stub Code space(%dk)\n",
                  (new_space_->in_use() / KB),
                  (old_space_->in_use() / KB),
-                 (code_space_->in_use() / KB));
+                 (code_space_->in_use() / KB),
+                 (stub_code_space_->in_use() / KB));
   }
   addr = new_space_->TryAllocate(size);
   if (addr != 0) {
     return addr;
   }
   return AllocateOld(size);
 }
 
 
 uword Heap::AllocateOld(intptr_t size) {
   ASSERT(Isolate::Current()->no_gc_scope_depth() == 0);
   uword addr = old_space_->TryAllocate(size);
   if (addr == 0) {
     CollectAllGarbage();
     if (FLAG_verbose_gc) {
-      OS::PrintErr("New space (%dk) Old space (%dk) Code space (%dk)\n",
+      OS::PrintErr("New space (%dk) Old space (%dk) "
+                   "Code space (%dk) Stub Code space(%dk)\n",
                    (new_space_->in_use() / KB),
                    (old_space_->in_use() / KB),
-                   (code_space_->in_use() / KB));
+                   (code_space_->in_use() / KB),
+                   (stub_code_space_->in_use() / KB));
     }
     addr = old_space_->TryAllocate(size);
     if (addr == 0) {
       // TODO(cshapiro): Support possible heap growth and OOM exception.
       FATAL("Exhausted heap space.");
     }
   }
   return addr;
 }
 
 
-uword Heap::AllocateCode(intptr_t size) {
+uword Heap::AllocateCode(PageSpace* space, intptr_t size) {
   ASSERT(Isolate::Current()->no_gc_scope_depth() == 0);
   ASSERT(Utils::IsAligned(size, OS::PreferredCodeAlignment()));
-  uword addr = code_space_->TryAllocate(size);
+  uword addr = space->TryAllocate(size);
   if (addr == 0) {
     // TODO(iposva): Support GC.
     FATAL("Exhausted code heap space.");
   }
   if (FLAG_compiler_stats) {
     CompilerStats::code_allocated += size;
   }
   return addr;
 }
 
 
 bool Heap::Contains(uword addr) const {
   return new_space_->Contains(addr) ||
       old_space_->Contains(addr) ||
-      code_space_->Contains(addr);
+      code_space_->Contains(addr) ||
+      stub_code_space_->Contains(addr);
 }
 
 
 bool Heap::CodeContains(uword addr) const {
   return code_space_->Contains(addr);
 }
 
 
+bool Heap::StubCodeContains(uword addr) const {
+  return stub_code_space_->Contains(addr);
+}
+
+
 void Heap::IterateNewPointers(ObjectPointerVisitor* visitor) {
   new_space_->VisitObjectPointers(visitor);
 }
 
 
 void Heap::IterateOldPointers(ObjectPointerVisitor* visitor) {
   old_space_->VisitObjectPointers(visitor);
   code_space_->VisitObjectPointers(visitor);
+  stub_code_space_->VisitObjectPointers(visitor);
 }
 
 
 void Heap::IterateCodePointers(ObjectPointerVisitor* visitor) {
   code_space_->VisitObjectPointers(visitor);
 }
 
 
+void Heap::IterateStubCodePointers(ObjectPointerVisitor* visitor) {
+  stub_code_space_->VisitObjectPointers(visitor);
+}
+
+
 RawInstructions* Heap::FindObjectInCodeSpace(FindObjectVisitor* visitor) {
   // The code heap can only have RawInstructions objects.
   RawObject* raw_obj = code_space_->FindObject(visitor);
   ASSERT((raw_obj == Object::null()) ||
          (raw_obj->ptr()->class_->ptr()->instance_kind_ == kInstructions));
   return reinterpret_cast<RawInstructions*>(raw_obj);
 }
 
 
+RawInstructions* Heap::FindObjectInStubCodeSpace(FindObjectVisitor* visitor) {
+  // The stub code heap can only have RawInstructions objects.
+  RawObject* raw_obj = stub_code_space_->FindObject(visitor);
+  ASSERT((raw_obj == Object::null()) ||
+         (raw_obj->ptr()->class_->ptr()->instance_kind_ == kInstructions));
+  return reinterpret_cast<RawInstructions*>(raw_obj);
+}
+
+
 void Heap::CollectGarbage(Space space, ApiCallbacks api_callbacks) {
   bool invoke_api_callbacks = (api_callbacks == kInvokeApiCallbacks);
   switch (space) {
     case kNew:
       new_space_->Scavenge(invoke_api_callbacks);
       break;
     case kOld:
       old_space_->MarkSweep(invoke_api_callbacks);
       break;
-    case kExecutable:
+    case kDartCode:
       UNIMPLEMENTED();
       code_space_->MarkSweep(invoke_api_callbacks);
       break;
+    case kStubCode:
+      UNIMPLEMENTED();
+      stub_code_space_->MarkSweep(invoke_api_callbacks);
+      break;
     default:
       UNREACHABLE();
   }
 }
 
 
 void Heap::CollectGarbage(Space space) {
   ApiCallbacks api_callbacks;
-  if (space == kNew || space == kExecutable) {
+  if (space == kOld) {
+    api_callbacks = kInvokeApiCallbacks;
+  } else {
     api_callbacks = kIgnoreApiCallbacks;
-  } else {
-    api_callbacks = kInvokeApiCallbacks;
   }
   CollectGarbage(space, api_callbacks);
 }
 
 
 void Heap::CollectAllGarbage() {
   new_space_->Scavenge(kInvokeApiCallbacks);
   old_space_->MarkSweep(kInvokeApiCallbacks);
   // TODO(iposva): Merge old and code space.
   // code_space_->MarkSweep(kInvokeApiCallbacks);
+  // stub_code_space_->MarkSweep(kInvokeApiCallbacks);
 }
 
 
 uword Heap::TopAddress() {
   return reinterpret_cast<uword>(new_space_->TopAddress());
 }
 
 
 uword Heap::EndAddress() {
   return reinterpret_cast<uword>(new_space_->EndAddress());
 }
 
 
 void Heap::Init(Isolate* isolate) {
   ASSERT(isolate->heap() == NULL);
   Heap* heap = new Heap();
   isolate->set_heap(heap);
 }
 
 
 bool Heap::Verify() const {
   VerifyPointersVisitor visitor;
   new_space_->VisitObjectPointers(&visitor);
   old_space_->VisitObjectPointers(&visitor);
   code_space_->VisitObjectPointers(&visitor);
+  stub_code_space_->VisitObjectPointers(&visitor);
   // Only returning a value so that Heap::Validate can be called from an ASSERT.
   return true;
 }
 
 
 #if defined(DEBUG)
 NoGCScope::NoGCScope() : StackResource(Isolate::Current()) {
   isolate()->IncrementNoGCScopeDepth();
 }
 
 
 NoGCScope::~NoGCScope() {
   isolate()->DecrementNoGCScopeDepth();
 }
 #endif  // defined(DEBUG)
 
 }  // namespace dart