Provide baseline for new GC infrastructure.

src/heap-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 174 matching lines @@
 bool Heap::ShouldBePromoted(Address old_address, int object_size) {
   // An object should be promoted if:
   // - the object has survived a scavenge operation or
   // - to space is already 25% full.
   return old_address < new_space_.age_mark()
       || (new_space_.Size() + object_size) >= (new_space_.Capacity() >> 2);
 }
 
 
 void Heap::RecordWrite(Address address, int offset) {
+  if (FLAG_new_gc) return;
   if (new_space_.Contains(address)) return;
   ASSERT(!new_space_.FromSpaceContains(address));
   SLOW_ASSERT(Contains(address + offset));
   Page::FromAddress(address)->MarkRegionDirty(address + offset);
 }
 
 
 void Heap::RecordWrites(Address address, int start, int len) {
+  if (FLAG_new_gc) return;
   if (new_space_.Contains(address)) return;
   ASSERT(!new_space_.FromSpaceContains(address));
   Page* page = Page::FromAddress(address);
   page->SetRegionMarks(page->GetRegionMarks() |
       page->GetRegionMaskForSpan(address + start, len * kPointerSize));
 }
 
 
 OldSpace* Heap::TargetSpace(HeapObject* object) {
   InstanceType type = object->map()->instance_type();
@@ skipping 33 matching lines @@
   ASSERT(IsAligned(byte_size, kPointerSize));
   CopyWords(reinterpret_cast<Object**>(dst),
             reinterpret_cast<Object**>(src),
             byte_size / kPointerSize);
 }
 
 
 void Heap::CopyBlockToOldSpaceAndUpdateRegionMarks(Address dst,
                                                    Address src,
                                                    int byte_size) {
+  if (FLAG_new_gc) {
+    CopyBlock(dst, src, byte_size);
+    return;
+  }
+
   ASSERT(IsAligned(byte_size, kPointerSize));
 
   Page* page = Page::FromAddress(dst);
   uint32_t marks = page->GetRegionMarks();
 
   for (int remaining = byte_size / kPointerSize;
        remaining > 0;
        remaining--) {
     Memory::Object_at(dst) = Memory::Object_at(src);
 
@@ skipping 32 matching lines @@
 }
 
 
 void Heap::MoveBlockToOldSpaceAndUpdateRegionMarks(Address dst,
                                                    Address src,
                                                    int byte_size) {
   ASSERT(IsAligned(byte_size, kPointerSize));
   ASSERT((dst >= (src + byte_size)) ||
          ((OffsetFrom(src) - OffsetFrom(dst)) >= kPointerSize));
 
-  CopyBlockToOldSpaceAndUpdateRegionMarks(dst, src, byte_size);
+  if (FLAG_new_gc) {
+    MoveBlock(dst, src, byte_size);
+  } else {
+    CopyBlockToOldSpaceAndUpdateRegionMarks(dst, src, byte_size);
+  }
 }
 
 
 void Heap::ScavengeObject(HeapObject** p, HeapObject* object) {
   ASSERT(InFromSpace(object));
 
   // We use the first word (where the map pointer usually is) of a heap
   // object to record the forwarding pointer.  A forwarding pointer can
   // point to an old space, the code space, or the to space of the new
   // generation.
@@ skipping 181 matching lines @@
 
 
 void ExternalStringTable::ShrinkNewStrings(int position) {
   new_space_strings_.Rewind(position);
   Verify();
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_HEAP_INL_H_