Switch UnreachableObjectsFilter to use Marking instead of InstrusiveMarking.

src/liveobjectlist.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 1067 matching lines @@
     lol->Sort();
     lol = lol->prev_;
   }
 }
 
 
 // Counts the number of objects in the heap.
 static int CountHeapObjects() {
   int count = 0;
   // Iterate over all the heap spaces and count the number of objects.
-  HeapIterator iterator(HeapIterator::kFilterFreeListNodes);
+  HeapIterator iterator;
   HeapObject* heap_obj = NULL;
   while ((heap_obj = iterator.next()) != NULL) {
     count++;
   }
   return count;
 }
 
 
 // Captures a current snapshot of all objects in the heap.
 MaybeObject* LiveObjectList::Capture() {
@@ skipping 16 matching lines @@
   // Create a lol large enough to track all the objects.
   lol = new LiveObjectList(last_lol, count);
   if (lol == NULL) {
     return NULL;  // No memory to proceed.
   }
 
   // The HeapIterator needs to be in its own scope because it disables
   // allocation, and we need allocate below.
   {
     // Iterate over all the heap spaces and add the objects.
-    HeapIterator iterator(HeapIterator::kFilterFreeListNodes);
+    HeapIterator iterator;
     HeapObject* heap_obj = NULL;
     bool failed = false;
     while (!failed && (heap_obj = iterator.next()) != NULL) {
       failed = !lol->Add(heap_obj);
       size += heap_obj->Size();
     }
     ASSERT(!failed);
 
     lol->Sort();
 
@@ skipping 1370 matching lines @@
   //    and specified match_heap_exactly = true.
 
   int number_of_heap_objects = 0;
   int number_of_matches = 0;
   int number_not_in_heap = total_count;
   int number_not_in_lol = 0;
 
   OS::Print("  Start verify ...\n");
   OS::Print("  Verifying ...");
   Flush();
-  HeapIterator iterator(HeapIterator::kFilterFreeListNodes);
+  HeapIterator iterator;
   HeapObject* heap_obj = NULL;
   while ((heap_obj = iterator.next()) != NULL) {
     number_of_heap_objects++;
 
     // Check if the heap_obj is in the lol.
     Element key;
     key.obj_ = heap_obj;
 
     Element* result = reinterpret_cast<Element*>(
         bsearch(&key, elements, total_count, sizeof(Element),
@@ skipping 95 matching lines @@
                 i++, heap_obj, Heap::new_space()->FromSpaceStart());
     }
   }
 }
 #endif  // VERIFY_LOL
 
 
 } }  // namespace v8::internal
 
 #endif  // LIVE_OBJECT_LIST