Improve equality operation (inline, direct calls).

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/flow_graph_builder.h"
 #include "vm/il_printer.h"
 #include "vm/object_store.h"
 
@@ skipping 605 matching lines @@
 
 
 void FlowGraphOptimizer::VisitStrictCompareComp(StrictCompareComp* comp) {
   // TODO(vegorov): recognize the pattern with BooleanNegate between comparsion
   // and a branch.
   TryFuseComparisonWithBranch(comp);
 }
 
 
 void FlowGraphOptimizer::VisitEqualityCompare(EqualityCompareComp* comp) {
-  if (!comp->HasICData()) return;
-  const ICData& ic_data = *comp->ic_data();
-  if (ic_data.NumberOfChecks() != 1) return;
-  ASSERT(HasOneTarget(ic_data));
-  if (HasTwoSmi(ic_data)) {
-    comp->set_operands_class_id(kSmi);
-  } else {
-    return;
+  const intptr_t kMaxChecks = 4;
+  if (comp->ic_data()->num_args_tested() <= kMaxChecks) {
+    ZoneGrowableArray<intptr_t>* class_ids =
+        new ZoneGrowableArray<intptr_t>();
+    ZoneGrowableArray<Function*>* targets =
+        new ZoneGrowableArray<Function*>();
+    ExtractClassIdsAndTargets(*comp->ic_data(), class_ids, targets);
+    comp->SetPolymorphicTargets(class_ids, targets);
   }
+
   // TODO(vegorov): recognize the pattern with BooleanNegate between comparsion
   // and a branch.
   TryFuseComparisonWithBranch(comp);
 }
 
 
 void FlowGraphOptimizer::VisitDo(DoInstr* instr) {
   instr->computation()->Accept(this);
 }
 
 
 void FlowGraphOptimizer::VisitBind(BindInstr* instr) {
   instr->computation()->Accept(this);
 }
 
 
 }  // namespace dart