Propagate class ids using existing type propagation framework.

runtime/vm/intermediate_language.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/intermediate_language.h"
 
 #include "vm/bit_vector.h"
 #include "vm/dart_entry.h"
 #include "vm/flow_graph_allocator.h"
 #include "vm/flow_graph_builder.h"
@@ skipping 311 matching lines @@
 
 
 RawAbstractType* BindInstr::CompileType() const {
   ASSERT(!HasPropagatedType());
   // The compile type may be requested when building the flow graph, i.e. before
   // type propagation has occurred.
   return computation()->CompileType();
 }
 
 
+intptr_t BindInstr::GetPropagatedCid() {
+  if (has_propagated_cid()) return propagated_cid();
+  intptr_t cid = computation()->ResultCid();
+  ASSERT(cid != kIllegalCid);
+  SetPropagatedCid(cid);
+  return cid;
+}
+
 void BindInstr::RecordAssignedVars(BitVector* assigned_vars,
                                    intptr_t fixed_parameter_count) {
   computation()->RecordAssignedVars(assigned_vars, fixed_parameter_count);
 }
 
 
 // ==== Postorder graph traversal.
 void GraphEntryInstr::DiscoverBlocks(
     BlockEntryInstr* current_block,
     GrowableArray<BlockEntryInstr*>* preorder,
@@ skipping 219 matching lines @@
   }
   if (value().IsInstance()) {
     return Instance::Cast(value()).GetType();
   } else {
     ASSERT(value().IsAbstractTypeArguments());
     return AbstractType::null();
   }
 }
 
 
+intptr_t ConstantVal::ResultCid() const {
+  if (value().IsNull()) {
+    return kNullCid;
+  }
+  if (value().IsInstance()) {
+    return Class::Handle(value().clazz()).id();
+  } else {
+    ASSERT(value().IsAbstractTypeArguments());
+    return kDynamicCid;
+  }
+}
+
+
 RawAbstractType* UseVal::CompileType() const {
   if (definition()->HasPropagatedType()) {
     return definition()->PropagatedType();
   }
   // The compile type may be requested when building the flow graph, i.e. before
   // type propagation has occurred. To avoid repeatedly computing the compile
   // type of the definition, we store it as initial propagated type.
   AbstractType& type = AbstractType::Handle(definition()->CompileType());
   definition()->SetPropagatedType(type);
   return type.raw();
 }
 
 
+intptr_t UseVal::ResultCid() const {
+  return definition()->GetPropagatedCid();
+}
+
+
 RawAbstractType* AssertAssignableComp::CompileType() const {
   const AbstractType& value_compile_type =
       AbstractType::Handle(value()->CompileType());
   if (!value_compile_type.IsNull() &&
       value_compile_type.IsMoreSpecificThan(dst_type(), NULL)) {
     return value_compile_type.raw();
   }
   return dst_type().raw();
 }
 
@@ skipping 720 matching lines @@
   if (compiler->is_ssa()) {
     ASSERT(locs()->in(0).IsRegister());
     __ PushRegister(locs()->in(0).reg());
   }
 }
 
 
 #undef __
 
 }  // namespace dart