Provide baseline for new GC infrastructure.

src/spaces-inl.h

 // 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 96 matching lines @@
   mc_first_forwarded = allocation_watermark;
 }
 
 
 Address Page::CachedAllocationWatermark() {
   return mc_first_forwarded;
 }
 
 
 uint32_t Page::GetRegionMarks() {
-  return dirty_regions_;
+  return FLAG_new_gc ? kAllRegionsDirtyMarks : dirty_regions_;
 }
 
 
 void Page::SetRegionMarks(uint32_t marks) {
-  dirty_regions_ = marks;
+  if (!FLAG_new_gc) dirty_regions_ = marks;
 }
 
 
 int Page::GetRegionNumberForAddress(Address addr) {
   // Each page is divided into 256 byte regions. Each region has a corresponding
   // dirty mark bit in the page header. Region can contain intergenerational
   // references iff its dirty mark is set.
   // A normal 8K page contains exactly 32 regions so all region marks fit
   // into 32-bit integer field. To calculate a region number we just divide
   // offset inside page by region size.
@@ skipping 382 matching lines @@
 
 bool FreeListNode::IsFreeListNode(HeapObject* object) {
   return object->map() == Heap::raw_unchecked_byte_array_map()
       || object->map() == Heap::raw_unchecked_one_pointer_filler_map()
       || object->map() == Heap::raw_unchecked_two_pointer_filler_map();
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_INL_H_