Use PassiveObject were possible.

runtime/vm/object.cc

 // Copyright (c) 2012, 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.h"
 
 #include "include/dart_api.h"
 #include "platform/assert.h"
 #include "vm/assembler.h"
 #include "vm/cpu.h"
@@ skipping 13083 matching lines @@
 }
 
 
 RawObject* Instance::Evaluate(const String& expr,
                               const Array& param_names,
                               const Array& param_values) const {
   const Class& cls = Class::Handle(clazz());
   const Function& eval_func =
       Function::Handle(EvaluateHelper(cls, expr, param_names, false));
   const Array& args = Array::Handle(Array::New(1 + param_values.Length()));
-  Object& param = Object::Handle();
+  PassiveObject& param = PassiveObject::Handle();
   args.SetAt(0, *this);
   for (intptr_t i = 0; i < param_values.Length(); i++) {
     param = param_values.At(i);
     args.SetAt(i + 1, param);
   }
-  const Object& result =
-      Object::Handle(DartEntry::InvokeFunction(eval_func, args));
-  return result.raw();
+  return DartEntry::InvokeFunction(eval_func, args);
 }
 
 
 RawObject* Instance::HashCode() const {
   // TODO(koda): Optimize for all builtin classes and all classes
   // that do not override hashCode.
   return DartLibraryCalls::HashCode(*this);
 }
 
 
@@ skipping 210 matching lines @@
     other_type_arguments = other.arguments();
   }
   return cls.IsSubtypeOf(type_arguments, other_class, other_type_arguments,
                          bound_error);
 }
 
 
 bool Instance::OperatorEquals(const Instance& other) const {
   // TODO(koda): Optimize for all builtin classes and all classes
   // that do not override operator==.
-  const Object& result =
-      Object::Handle(DartLibraryCalls::Equals(*this, other));
-  return result.raw() == Object::bool_true().raw();
+  return DartLibraryCalls::Equals(*this, other) == Object::bool_true().raw();
 }
 
 
 bool Instance::IsIdenticalTo(const Instance& other) const {
   if (raw() == other.raw()) return true;
   if (IsInteger() && other.IsInteger()) {
     return Integer::Cast(*this).Equals(other);
   }
   if (IsDouble() && other.IsDouble()) {
     return Double::Cast(*this).CanonicalizeEquals(other);
@@ skipping 4758 matching lines @@
       Object& element = Object::Handle(At(index));
       jselement.AddProperty("value", element);
     }
   }
 }
 
 
 RawArray* Array::Grow(const Array& source,
                       intptr_t new_length,
                       Heap::Space space) {
-  const Array& result = Array::Handle(Array::New(new_length, space));
+  Isolate* isolate = Isolate::Current();
+  const Array& result = Array::Handle(isolate, Array::New(new_length, space));
   intptr_t len = 0;
   if (!source.IsNull()) {
     len = source.Length();
-    result.SetTypeArguments(TypeArguments::Handle(source.GetTypeArguments()));
+    result.SetTypeArguments(
+        TypeArguments::Handle(isolate, source.GetTypeArguments()));
   }
   ASSERT(new_length >= len);  // Cannot copy 'source' into new array.
   ASSERT(new_length != len);  // Unnecessary copying of array.
-  Object& obj = Object::Handle();
+  PassiveObject& obj = PassiveObject::Handle(isolate);
   for (int i = 0; i < len; i++) {
     obj = source.At(i);
     result.SetAt(i, obj);
   }
   return result.raw();
 }
 
 
 RawArray* Array::MakeArray(const GrowableObjectArray& growable_array) {
   ASSERT(!growable_array.IsNull());
@@ skipping 99 matching lines @@
       Array::Handle(Array::Grow(contents, new_capacity, space));
   StorePointer(&(raw_ptr()->data_), new_contents.raw());
 }
 
 
 RawObject* GrowableObjectArray::RemoveLast() const {
   ASSERT(!IsNull());
   ASSERT(Length() > 0);
   intptr_t index = Length() - 1;
   const Array& contents = Array::Handle(data());
-  const Object& obj = Object::Handle(contents.At(index));
+  const PassiveObject& obj = PassiveObject::Handle(contents.At(index));
   contents.SetAt(index, Object::null_object());
   SetLength(index);
   return obj.raw();
 }
 
 
 bool GrowableObjectArray::CanonicalizeEquals(const Instance& other) const {
   // If both handles point to the same raw instance they are equal.
   if (this->raw() == other.raw()) {
     return true;
@@ skipping 141 matching lines @@
   if (!map.UpdateOrInsert(key, value)) {
     SetModified();
   }
   StorePointer(&raw_ptr()->data_, map.Release().raw());
 }
 
 
 RawObject* LinkedHashMap::LookUp(const Object& key) const {
   ASSERT(!IsNull());
   EnumIndexDefaultMap map(data());
-  const Object& result = Object::Handle(map.GetOrNull(key));
-  ASSERT(map.Release().raw() == data());
-  return result.raw();
+  {
+    NoGCScope no_gc;
+    RawObject* result = map.GetOrNull(key);
+    ASSERT(map.Release().raw() == data());
+    return result;
+  }
 }
 
 
 bool LinkedHashMap::Contains(const Object& key) const {
   ASSERT(!IsNull());
   EnumIndexDefaultMap map(data());
   bool result = map.ContainsKey(key);
   ASSERT(map.Release().raw() == data());
   return result;
 }
 
 
 RawObject* LinkedHashMap::Remove(const Object& key) const {
   ASSERT(!IsNull());
   EnumIndexDefaultMap map(data());
   // TODO(koda): Make 'Remove' also return the old value.
-  const Object& result = Object::Handle(map.GetOrNull(key));
+  const PassiveObject& result = PassiveObject::Handle(map.GetOrNull(key));
   if (map.Remove(key)) {
     SetModified();
   }
   StorePointer(&raw_ptr()->data_, map.Release().raw());
   return result.raw();
 }
 
 
 void LinkedHashMap::Clear() const {
   ASSERT(!IsNull());
@@ skipping 655 matching lines @@
   intptr_t old_length = Length();
   intptr_t new_length = old_length + pc_offset_list.Length() - start_index;
   if (new_length == old_length) {
     // Nothing to append. Avoid work and an assert that growing arrays always
     // increases their size.
     return;
   }
 
   // Grow the arrays for code, pc_offset pairs to accommodate the new stack
   // frames.
-  Array& code_array = Array::Handle(raw_ptr()->code_array_);
-  Array& pc_offset_array = Array::Handle(raw_ptr()->pc_offset_array_);
+  Isolate* isolate = Isolate::Current();
+  Array& code_array = Array::Handle(isolate, raw_ptr()->code_array_);
+  Array& pc_offset_array = Array::Handle(isolate, raw_ptr()->pc_offset_array_);
   code_array = Array::Grow(code_array, new_length);
   pc_offset_array = Array::Grow(pc_offset_array, new_length);
   set_code_array(code_array);
   set_pc_offset_array(pc_offset_array);
   // Now append the new function and code list to the existing arrays.
   intptr_t j = start_index;
-  Object& obj = Object::Handle();
+  PassiveObject& obj = PassiveObject::Handle(isolate);
   for (intptr_t i = old_length; i < new_length; i++, j++) {
     obj = code_list.At(j);
     code_array.SetAt(i, obj);
     obj = pc_offset_list.At(j);
     pc_offset_array.SetAt(i, obj);
   }
 }
 
 
 void Stacktrace::SetCatchStacktrace(const Array& code_array,
@@ skipping 452 matching lines @@
   return tag_label.ToCString();
 }
 
 
 void UserTag::PrintJSONImpl(JSONStream* stream, bool ref) const {
   Instance::PrintJSONImpl(stream, ref);
 }
 
 
 }  // namespace dart