Preserve marking bits across scavenges if incremental marker is running.

src/incremental-marking.cc

 // Copyright 2011 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 145 matching lines @@
           CodeStub::IncrementalMarkingRecordWrite) {
         Object* e = stubs->ValueAt(i);
         if (e->IsCode()) {
           IncrementalMarkingRecordWriteStub::Patch(Code::cast(e), enable);
         }
       }
     }
   }
 }
 
+static VirtualMemory* marking_stack_memory = NULL;
+
+static void EnsureMarkingStackIsCommitted() {
+  if (marking_stack_memory == NULL) {
+    marking_stack_memory = new VirtualMemory(4*MB);
+    marking_stack_memory->Commit(
+        reinterpret_cast<Address>(marking_stack_memory->address()),
+        marking_stack_memory->size(),
+        false);  // Not executable.
+  }
+}
+
 
 void IncrementalMarking::Start() {
   if (FLAG_trace_incremental_marking) {
     PrintF("[IncrementalMarking] Start\n");
   }
   ASSERT(FLAG_incremental_marking);
   ASSERT(state_ == STOPPED);
   state_ = MARKING;
 
   PatchIncrementalMarkingRecordWriteStubs(true);
 
-  Heap::EnsureFromSpaceIsCommitted();
+  // Heap::EnsureFromSpaceIsCommitted();
+  EnsureMarkingStackIsCommitted();
 
   // Initialize marking stack.
-  marking_stack_.Initialize(Heap::new_space()->FromSpaceLow(),
-                            Heap::new_space()->FromSpaceHigh());
+  Address addr = static_cast<Address>(marking_stack_memory->address());
+  marking_stack_.Initialize(addr,
+                            addr + marking_stack_memory->size());
 
   // Clear markbits.
-  Address new_space_bottom = Heap::new_space()->bottom();
-  uintptr_t new_space_size =
-      RoundUp(Heap::new_space()->top() - new_space_bottom, 32 * kPointerSize);
-
-  Marking::ClearRange(new_space_bottom, new_space_size);
+  Address new_space_low = Heap::new_space()->ToSpaceLow();
+  Address new_space_high = Heap::new_space()->ToSpaceHigh();
+  Marking::ClearRange(new_space_low,
+                      static_cast<int>(new_space_high - new_space_low));
 
   ClearMarkbits();
 
 #ifdef DEBUG
   VerifyMarkbitsAreClean();
 #endif
 
   // Mark strong roots grey.
   IncrementalMarkingRootMarkingVisitor visitor;
   Heap::IterateStrongRoots(&visitor, VISIT_ONLY_STRONG);
 
   // Ready to start incremental marking.
   if (FLAG_trace_incremental_marking) {
     PrintF("[IncrementalMarking] Running\n");
   }
 }
 
 
+void IncrementalMarking::PrepareForScavenge() {
+  if (IsStopped()) return;
+
+  Address new_space_low = Heap::new_space()->FromSpaceLow();
+  Address new_space_high = Heap::new_space()->FromSpaceHigh();
+  Marking::ClearRange(new_space_low,
+                      static_cast<int>(new_space_high - new_space_low));
+}
+
+
+void IncrementalMarking::UpdateMarkingStackAfterScavenge() {
+  if (IsStopped()) return;
+
+  HeapObject** current = marking_stack_.low();
+  HeapObject** top = marking_stack_.top();
+  HeapObject** new_top = current;
+
+  while (current < top) {
+    HeapObject* obj = *current++;
+    if (Heap::InNewSpace(obj)) {
+      MapWord map_word = obj->map_word();
+      if (map_word.IsForwardingAddress()) {
+        HeapObject* dest = map_word.ToForwardingAddress();
+        MarkWhiteObjectGrey(dest, Marking::MarkBitFrom(dest));
+        *new_top++ = dest;
+        ASSERT(Color(obj) == Color(dest));
+      }
+    } else {
+      *new_top++ = obj;
+    }
+  }
+
+  marking_stack_.set_top(new_top);
+}
+
+
 void IncrementalMarking::Hurry() {
   if (state() == MARKING) {
     double start = 0.0;
     if (FLAG_trace_incremental_marking) {
       PrintF("[IncrementalMarking] Hurry\n");
       start = OS::TimeCurrentMillis();
     }
     // TODO(gc) hurry can mark objects it encounters black as mutator
     // was stopped.
     Map* filler_map = Heap::one_pointer_filler_map();
@@ skipping 30 matching lines @@
   state_ = COMPLETE;
   // We completed marking.
   if (FLAG_trace_incremental_marking) {
     PrintF("[IncrementalMarking] Complete (normal)\n");
   }
   StackGuard::RequestGC();
 }
 
 
 void IncrementalMarking::Step(intptr_t allocated_bytes) {
-  if (state_ == MARKING) {
+  if (state_ == MARKING && Heap::gc_state() == Heap::NOT_IN_GC) {
     allocated += allocated_bytes;
 
     if (allocated >= kAllocatedThreshold) {
       intptr_t bytes_to_process = allocated * kAllocationMarkingFactor;
       int count = 0;
-      double start = 0;
-      if (FLAG_trace_incremental_marking) {
-        PrintF("[IncrementalMarking] Marking %d bytes\n", bytes_to_process);
-        start = OS::TimeCurrentMillis();
-      }
 
       Map* filler_map = Heap::one_pointer_filler_map();
       while (!marking_stack_.is_empty() && bytes_to_process > 0) {
         HeapObject* obj = marking_stack_.Pop();
 
         // Explicitly skip one word fillers. Incremental markbit patterns are
         // correct only for objects that occupy at least two words.
         if (obj->map() != filler_map) {
           ASSERT(IsGrey(Marking::MarkBitFrom(obj)));
           Map* map = obj->map();
           int size = obj->SizeFromMap(map);
           bytes_to_process -= size;
           MarkBit map_mark_bit = Marking::MarkBitFrom(map);
           if (IsWhite(map_mark_bit)) WhiteToGrey(map, map_mark_bit);
           obj->IterateBody(map->instance_type(), size, &marking_visitor);
           MarkBit obj_mark_bit = Marking::MarkBitFrom(obj);
           MarkBlack(obj_mark_bit);
         }
         count++;
       }
-      if (FLAG_trace_incremental_marking) {
-        double end = OS::TimeCurrentMillis();
-        PrintF("[IncrementalMarking]     %d objects marked, spent %d ms\n",
-               count,
-               static_cast<int>(end - start));
-      }
       allocated = 0;
       if (marking_stack_.is_empty()) MarkingComplete();
     }
   }
 }
 
 
 } }  // namespace v8::internal