[heap] Black allocation.

src/heap/store-buffer.cc

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/heap/store-buffer.h"
 
 #include <algorithm>
 
 #include "src/counters.h"
 #include "src/heap/incremental-marking.h"
@@ skipping 361 matching lines @@
   Compact();
   Address* new_top = old_start_;
   for (Address* current = old_start_; current < old_top_; current++) {
     Address addr = *current;
     Object** slot = reinterpret_cast<Object**>(addr);
     Object* object = *slot;
     if (heap_->InNewSpace(object) && object->IsHeapObject()) {
       // If the target object is not black, the source slot must be part
       // of a non-black (dead) object.
       HeapObject* heap_object = HeapObject::cast(object);
-      if (Marking::IsBlack(Marking::MarkBitFrom(heap_object)) &&
-          heap_->mark_compact_collector()->IsSlotInLiveObject(addr)) {
+      Page* heap_object_page = Page::FromAddress(heap_object->address());
+      if (heap_object_page->IsFlagSet(Page::BLACK_PAGE) ||
+          (Marking::IsBlack(Marking::MarkBitFrom(heap_object)) &&
+           heap_->mark_compact_collector()->IsSlotInLiveObject(addr))) {
         *new_top++ = addr;
       }
     }
   }
   old_top_ = new_top;
   ClearFilteringHashSets();
 
   // Don't scan on scavenge dead large objects.
   LargeObjectIterator it(heap_->lo_space());
   for (HeapObject* object = it.Next(); object != NULL; object = it.Next()) {
@@ skipping 221 matching lines @@
       DCHECK(start_of_current_page_ != store_buffer_->Top());
       store_buffer_->SetTop(start_of_current_page_);
     }
   } else {
     UNREACHABLE();
   }
 }
 
 }  // namespace internal
 }  // namespace v8