[vm, gc] Require a safepoint for heap iteration.

runtime/vm/object_graph_test.cc

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/object_graph.h"
 #include "platform/assert.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
@@ skipping 40 matching lines @@
   a.SetAt(10, b);
   b.SetAt(0, c);
   b.SetAt(1, d);
   a.SetAt(11, d);
   intptr_t a_size = a.raw()->Size();
   intptr_t b_size = b.raw()->Size();
   intptr_t c_size = c.raw()->Size();
   intptr_t d_size = d.raw()->Size();
   {
     // No more allocation; raw pointers ahead.
-    NoSafepointScope no_safepoint_scope;
+    SafepointOperationScope safepoint(thread);
     RawObject* b_raw = b.raw();
     // Clear handles to cut unintended retained paths.
     b = Array::null();
     c = Array::null();
     d = Array::null();
     ObjectGraph graph(thread);
     {
-      HeapIterationScope iteration_scope(true);
+      HeapIterationScope iteration_scope(thread, true);
       {
         // Compare count and size when 'b' is/isn't skipped.
         CounterVisitor with(Object::null(), Object::null());
         graph.IterateObjectsFrom(a, &with);
         CounterVisitor without(b_raw, a.raw());
         graph.IterateObjectsFrom(a, &without);
         // Only 'b' and 'c' were cut off.
         EXPECT_EQ(2, with.count() - without.count());
         EXPECT_EQ(b_size + c_size, with.size() - without.size());
       }
@@ skipping 52 matching lines @@
       Array& expected_a = Array::Handle();
       expected_a ^= path.At(4);
       EXPECT(expected_c.raw() == c.raw());
       EXPECT(expected_b.raw() == a.At(10));
       EXPECT(expected_a.raw() == a.raw());
     }
   }
 }
 
 }  // namespace dart