Require ResultCid specification in every computation, that way we can differentiate between computa…

runtime/vm/flow_graph_optimizer.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/flow_graph_optimizer.h"
 
 #include "vm/cha.h"
 #include "vm/flow_graph_builder.h"
 #include "vm/hash_map.h"
 #include "vm/il_printer.h"
@@ skipping 904 matching lines @@
   if (current_iterator()->Current() == bind) {
     // Current bind was not removed.
     // Cache propagated computation type.
     AbstractType& computation_type =
         AbstractType::Handle(bind->computation()->CompileType());
     bool changed = bind->SetPropagatedType(computation_type);
     if (changed) {
       still_changing_ = true;
     }
     // Propagate class ids.
-    intptr_t cid = bind->computation()->ResultCid();
+    const intptr_t cid = bind->computation()->ResultCid();
     changed = bind->SetPropagatedCid(cid);
     if (changed) {
       still_changing_ = true;
     }
   }
 }
 
 
 void FlowGraphTypePropagator::VisitPhi(PhiInstr* phi) {
   // We could set the propagated type of the phi to the least upper bound of its
@@ skipping 127 matching lines @@
       DirectChainedHashMap<BindInstr*> child_map(*map);  // Copy map.
       OptimizeRecursive(child, &child_map);
     } else {
       OptimizeRecursive(child, map);  // Reuse map for the last child.
     }
   }
 }
 
 
 }  // namespace dart