Fuse compare with branch at graph building time.

runtime/vm/intermediate_language_ia32.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/globals.h"  // Needed here to get TARGET_ARCH_IA32.
 #if defined(TARGET_ARCH_IA32)
 
 #include "vm/intermediate_language.h"
 
 #include "lib/error.h"
@@ skipping 185 matching lines @@
   const intptr_t kNumInputs = 2;
   if (receiver_class_id() != kObject) {
     ASSERT((receiver_class_id() == kSmi) || (receiver_class_id() == kDouble));
     const intptr_t kNumTemps = 1;
     LocationSummary* locs = new LocationSummary(kNumInputs,
                                                 kNumTemps,
                                                 LocationSummary::kNoCall);
     locs->set_in(0, Location::RequiresRegister());
     locs->set_in(1, Location::RequiresRegister());
     locs->set_temp(0, Location::RequiresRegister());
-    if (!is_fused_with_branch()) {
-      locs->set_out(Location::RequiresRegister());
-    }
+    locs->set_out(Location::RequiresRegister());
     return locs;
   }
   if (HasICData() && (ic_data()->NumberOfChecks() > 0)) {
     const intptr_t kNumTemps = 1;
     LocationSummary* locs = new LocationSummary(kNumInputs,
                                                 kNumTemps,
                                                 LocationSummary::kCall);
     locs->set_in(0, Location::RequiresRegister());
     locs->set_in(1, Location::RequiresRegister());
     locs->set_temp(0, Location::RequiresRegister());
-    if (!is_fused_with_branch()) {
-      locs->set_out(Location::RegisterLocation(EAX));
-    }
+    locs->set_out(Location::RegisterLocation(EAX));
     return locs;
   }
   const intptr_t kNumTemps = 0;
   LocationSummary* locs = new LocationSummary(kNumInputs,
                                               kNumTemps,
                                               LocationSummary::kCall);
   locs->set_in(0, Location::RequiresRegister());
   locs->set_in(1, Location::RequiresRegister());
-  if (!is_fused_with_branch()) {
-    locs->set_out(Location::RegisterLocation(EAX));
-  }
+  locs->set_out(Location::RegisterLocation(EAX));
   return locs;
 }
 
 
 // Optional integer arguments can often be null. Null is not collected
 // by IC data. TODO(srdjan): Shall we collect null classes in ICData as well?
 static void EmitSmiEqualityCompare(FlowGraphCompiler* compiler,
                                    EqualityCompareComp* comp) {
   Register left = comp->locs()->in(0).reg();
   Register right = comp->locs()->in(1).reg();
   Register temp = comp->locs()->temp(0).reg();
   Label* deopt = compiler->AddDeoptStub(comp->cid(),
                                         comp->token_pos(),
                                         comp->try_index(),
                                         kDeoptSmiCompareSmi,
                                         left,
                                         right);
   __ movl(temp, left);
   __ orl(temp, right);
   __ testl(temp, Immediate(kSmiTagMask));
   __ j(NOT_ZERO, deopt);
   __ cmpl(left, right);
-  if (comp->is_fused_with_branch()) {
-    comp->fused_with_branch()->EmitBranchOnCondition(compiler, EQUAL);
-  } else {
-    Register result = comp->locs()->out().reg();
-    Label load_true, done;
-    __ j(EQUAL, &load_true, Assembler::kNearJump);
-    __ LoadObject(result, compiler->bool_false());
-    __ jmp(&done, Assembler::kNearJump);
-    __ Bind(&load_true);
-    __ LoadObject(result, compiler->bool_true());
-    __ Bind(&done);
-  }
+  Register result = comp->locs()->out().reg();
+  Label load_true, done;
+  __ j(EQUAL, &load_true, Assembler::kNearJump);
+  __ LoadObject(result, compiler->bool_false());
+  __ jmp(&done, Assembler::kNearJump);
+  __ Bind(&load_true);
+  __ LoadObject(result, compiler->bool_true());
+  __ Bind(&done);
 }
 
 
 // TODO(srdjan): Add support for mixed Smi/Double equality
 // (see LoadDoubleOrSmiToXmm).
 static void EmitDoubleEqualityCompare(FlowGraphCompiler* compiler,
                                       EqualityCompareComp* comp) {
   Register left = comp->locs()->in(0).reg();
   Register right = comp->locs()->in(1).reg();
   Register temp = comp->locs()->temp(0).reg();
   Label* deopt = compiler->AddDeoptStub(comp->cid(),
                                         comp->token_pos(),
                                         comp->try_index(),
                                         kDeoptDoubleCompareDouble,
                                         left,
                                         right);
   Label done, is_false, is_true;
   __ CompareClassId(left, kDouble, temp);
   __ j(NOT_EQUAL, deopt);
   __ CompareClassId(right, kDouble, temp);
   __ j(NOT_EQUAL, deopt);
   __ movsd(XMM0, FieldAddress(left, Double::value_offset()));
   __ movsd(XMM1, FieldAddress(right, Double::value_offset()));
-  if (comp->is_fused_with_branch()) {
-    compiler->EmitDoubleCompareBranch(
-        EQUAL, XMM0, XMM1, comp->fused_with_branch());
-  } else {
-    compiler->EmitDoubleCompareBool(
-        EQUAL, XMM0, XMM1, comp->locs()->out().reg());
-  }
+  compiler->EmitDoubleCompareBool(
+      EQUAL, XMM0, XMM1, comp->locs()->out().reg());
 }
 
 
 static void EmitEqualityAsInstanceCall(FlowGraphCompiler* compiler,
                                        EqualityCompareComp* comp) {
   compiler->AddCurrentDescriptor(PcDescriptors::kDeopt,
                                  comp->cid(),
                                  comp->token_pos(),
                                  comp->try_index());
   const String& operator_name = String::ZoneHandle(String::NewSymbol("=="));
   const int kNumberOfArguments = 2;
   const Array& kNoArgumentNames = Array::Handle();
   const int kNumArgumentsChecked = 2;
 
   compiler->GenerateInstanceCall(comp->cid(),
                                  comp->token_pos(),
                                  comp->try_index(),
                                  operator_name,
                                  kNumberOfArguments,
                                  kNoArgumentNames,
                                  kNumArgumentsChecked);
-  ASSERT(comp->is_fused_with_branch() || (comp->locs()->out().reg() == EAX));
-
-  if (comp->is_fused_with_branch()) {
-    __ CompareObject(EAX, compiler->bool_true());
-    comp->fused_with_branch()->EmitBranchOnCondition(compiler, EQUAL);
-  }
+  ASSERT(comp->locs()->out().reg() == EAX);
 }
 
 
 static void EmitEqualityAsPolymorphicCall(FlowGraphCompiler* compiler,
-                                          EqualityCompareComp* comp,
-                                          Register left,
-                                          Register right) {
-  ASSERT(comp->HasICData());
-  const ICData& ic_data = ICData::Handle(comp->ic_data()->AsUnaryClassChecks());
+                                          const ICData& orig_ic_data,
+                                          const LocationSummary& locs,
+                                          BranchInstr* branch,
+                                          Token::Kind kind,
+                                          intptr_t cid,
+                                          intptr_t token_pos,
+                                          intptr_t try_index) {
+  const ICData& ic_data = ICData::Handle(orig_ic_data.AsUnaryClassChecks());
   ASSERT(ic_data.NumberOfChecks() > 0);
   ASSERT(ic_data.num_args_tested() == 1);
-  Label* deopt = compiler->AddDeoptStub(comp->cid(),
-                                        comp->token_pos(),
-                                        comp->try_index(),
+  Label* deopt = compiler->AddDeoptStub(cid,
+                                        token_pos,
+                                        try_index,
                                         kDeoptEquality);
+  Register left = locs.in(0).reg();
+  Register right = locs.in(1).reg();
   __ testl(left, Immediate(kSmiTagMask));
-  Register temp = comp->locs()->temp(0).reg();
+  Register temp = locs.temp(0).reg();
   if (ic_data.GetReceiverClassIdAt(0) == kSmi) {
     Label done, load_class_id;
     __ j(NOT_ZERO, &load_class_id, Assembler::kNearJump);
     __ movl(temp, Immediate(kSmi));
     __ jmp(&done, Assembler::kNearJump);
     __ Bind(&load_class_id);
     __ LoadClassId(temp, left);
     __ Bind(&done);
   } else {
     __ j(ZERO, deopt);  // Smi deopts.
     __ LoadClassId(temp, left);
   }
+  Condition cond = (kind == Token::kEQ) ? EQUAL : NOT_EQUAL;
   Label done;
   for (intptr_t i = 0; i < ic_data.NumberOfChecks(); i++) {
     ASSERT((ic_data.GetReceiverClassIdAt(i) != kSmi) || (i == 0));
     Label next_test;
     __ cmpl(temp, Immediate(ic_data.GetReceiverClassIdAt(i)));
     __ j(NOT_EQUAL, &next_test, Assembler::kNearJump);
     const Function& target = Function::ZoneHandle(ic_data.GetTargetAt(i));
     ObjectStore* object_store = Isolate::Current()->object_store();
     if (target.owner() == object_store->object_class()) {
       // Object.== is same as ===.
       __ Drop(2);
       __ cmpl(left, right);
-      if (comp->is_fused_with_branch()) {
-        comp->fused_with_branch()->EmitBranchOnCondition(compiler, EQUAL);
+      if (branch != NULL) {
+        branch->EmitBranchOnCondition(compiler, cond);
       } else {
         // This case should be rare.
-        Register result = comp->locs()->out().reg();
+        Register result = locs.out().reg();
         Label load_true;
-        __ j(EQUAL, &load_true, Assembler::kNearJump);
+        __ j(cond, &load_true, Assembler::kNearJump);
         __ LoadObject(result, compiler->bool_false());
         __ jmp(&done);
         __ Bind(&load_true);
         __ LoadObject(result, compiler->bool_true());
       }
     } else {
       const int kNumberOfArguments = 2;
       const Array& kNoArgumentNames = Array::Handle();
-      compiler->GenerateStaticCall(comp->cid(),
-                                   comp->token_pos(),
-                                   comp->try_index(),
+      compiler->GenerateStaticCall(cid,
+                                   token_pos,
+                                   try_index,
                                    target,
                                    kNumberOfArguments,
                                    kNoArgumentNames);
-      ASSERT(comp->is_fused_with_branch() ||
-            (comp->locs()->out().reg() == EAX));
-      if (comp->is_fused_with_branch()) {
+      if (branch != NULL) {
         __ CompareObject(EAX, compiler->bool_true());
-        comp->fused_with_branch()->EmitBranchOnCondition(compiler, EQUAL);
+        branch->EmitBranchOnCondition(compiler, cond);
       }
     }
     __ jmp(&done);
     __ Bind(&next_test);
   }
   // Fall through leads to deoptimization
   __ jmp(deopt);
   __ Bind(&done);
 }
 
 
 // First test if receiver is NULL, in which case === is applied.
 // If type feedback was provided (lists of <class-id, target>), do a
 // type by type check (either === or static call to the operator.
 static void EmitGenericEqualityCompare(FlowGraphCompiler* compiler,
-                                       EqualityCompareComp* comp) {
-  Register left = comp->locs()->in(0).reg();
-  Register right = comp->locs()->in(1).reg();
+                                       const LocationSummary& locs,
+                                       Token::Kind kind,
+                                       BranchInstr* branch,
+                                       const ICData& ic_data,
+                                       intptr_t cid,
+                                       intptr_t token_pos,
+                                       intptr_t try_index) {
+  ASSERT(!ic_data.IsNull() && (ic_data.NumberOfChecks() > 0));
+  Register left = locs.in(0).reg();
+  Register right = locs.in(1).reg();
   const Immediate raw_null =
       Immediate(reinterpret_cast<intptr_t>(Object::null()));
   Label done, non_null_compare;
   __ cmpl(left, raw_null);
   __ j(NOT_EQUAL, &non_null_compare, Assembler::kNearJump);
   // Comparison with NULL is "===".
   __ cmpl(left, right);
-  if (comp->is_fused_with_branch()) {
-    comp->fused_with_branch()->EmitBranchOnCondition(compiler, EQUAL);
+  Condition cond = (kind == Token::kEQ) ? EQUAL : NOT_EQUAL;
+  if (branch != NULL) {
+    branch->EmitBranchOnCondition(compiler, cond);
   } else {
-    Register result = comp->locs()->out().reg();
+    Register result = locs.out().reg();
     Label load_true;
-    __ j(EQUAL, &load_true, Assembler::kNearJump);
+    __ j(cond, &load_true, Assembler::kNearJump);
     __ LoadObject(result, compiler->bool_false());
     __ jmp(&done);
     __ Bind(&load_true);
     __ LoadObject(result, compiler->bool_true());
   }
   __ jmp(&done);
-
   __ Bind(&non_null_compare);  // Receiver is not null.
   __ pushl(left);
   __ pushl(right);
-  if (comp->HasICData() && (comp->ic_data()->NumberOfChecks() > 0)) {
-    EmitEqualityAsPolymorphicCall(compiler, comp, left, right);
-  } else {
-    EmitEqualityAsInstanceCall(compiler, comp);
-  }
+  EmitEqualityAsPolymorphicCall(compiler, ic_data, locs, branch, kind,
+                                cid, token_pos, try_index);
   __ Bind(&done);
 }
 
 
 void EqualityCompareComp::EmitNativeCode(FlowGraphCompiler* compiler) {
   if (receiver_class_id() == kSmi) {
     EmitSmiEqualityCompare(compiler, this);
     return;
   }
   if (receiver_class_id() == kDouble) {
     EmitDoubleEqualityCompare(compiler, this);
     return;
   }
-  EmitGenericEqualityCompare(compiler, this);
+  if (HasICData() && (ic_data()->NumberOfChecks() > 0)) {
+    EmitGenericEqualityCompare(compiler, *locs(), Token::kEQ, NULL,
+                               *ic_data(), cid(), token_pos(), try_index());
+  } else {
+    Register left = locs()->in(0).reg();
+    Register right = locs()->in(1).reg();
+    __ pushl(left);
+    __ pushl(right);
+    EmitEqualityAsInstanceCall(compiler, this);
+  }
 }
 
 
 LocationSummary* RelationalOpComp::MakeLocationSummary() const {
   if ((operands_class_id() == kSmi) || (operands_class_id() == kDouble)) {
     const intptr_t kNumInputs = 2;
     const intptr_t kNumTemps = 1;
     LocationSummary* summary = new LocationSummary(kNumInputs,
                                                    kNumTemps,
                                                    LocationSummary::kNoCall);
     summary->set_in(0, Location::RequiresRegister());
     summary->set_in(1, Location::RequiresRegister());
-    if (!is_fused_with_branch()) {
-      summary->set_out(Location::RequiresRegister());
-    }
+    summary->set_out(Location::RequiresRegister());
     summary->set_temp(0, Location::RequiresRegister());
     return summary;
   }
-  ASSERT(!is_fused_with_branch());
   ASSERT(operands_class_id() == kObject);
   return MakeCallSummary();
 }
 
 
 static Condition TokenKindToSmiCondition(Token::Kind kind) {
   switch (kind) {
     case Token::kEQ: return EQUAL;
     case Token::kNE: return NOT_EQUAL;
     case Token::kLT: return LESS;
     case Token::kGT: return GREATER;
     case Token::kLTE: return LESS_EQUAL;
     case Token::kGTE: return  GREATER_EQUAL;
     default:
       UNREACHABLE();
       return OVERFLOW;
   }
 }
 
 
-static void EmitSmiRelationalOp(FlowGraphCompiler* compiler,
-                                RelationalOpComp* comp) {
-  Register left = comp->locs()->in(0).reg();
-  Register right = comp->locs()->in(1).reg();
-  Register temp = comp->locs()->temp(0).reg();
-  Label* deopt = compiler->AddDeoptStub(comp->cid(),
-                                        comp->token_pos(),
-                                        comp->try_index(),
+static void EmitSmiComparisonOp(FlowGraphCompiler* compiler,
+                                const LocationSummary& locs,
+                                Token::Kind kind,
+                                BranchInstr* branch,
+                                intptr_t cid,
+                                intptr_t token_pos,
+                                intptr_t try_index) {
+  Register left = locs.in(0).reg();
+  Register right = locs.in(1).reg();
+  Register temp = locs.temp(0).reg();
+  Label* deopt = compiler->AddDeoptStub(cid,
+                                        token_pos,
+                                        try_index,
                                         kDeoptSmiCompareSmi,
                                         left,
                                         right);
   __ movl(temp, left);
   __ orl(temp, right);
   __ testl(temp, Immediate(kSmiTagMask));
   __ j(NOT_ZERO, deopt);
 
-  Condition true_condition = TokenKindToSmiCondition(comp->kind());
+  Condition true_condition = TokenKindToSmiCondition(kind);
   __ cmpl(left, right);
 
-  if (comp->is_fused_with_branch()) {
-    comp->fused_with_branch()->EmitBranchOnCondition(compiler, true_condition);
+  if (branch != NULL) {
+    branch->EmitBranchOnCondition(compiler, true_condition);
   } else {
-    Register result = comp->locs()->out().reg();
+    Register result = locs.out().reg();
     Label done, is_true;
     __ j(true_condition, &is_true);
     __ LoadObject(result, compiler->bool_false());
     __ jmp(&done);
     __ Bind(&is_true);
     __ LoadObject(result, compiler->bool_true());
     __ Bind(&done);
   }
 }
 
 
 static Condition TokenKindToDoubleCondition(Token::Kind kind) {
   switch (kind) {
     case Token::kEQ: return EQUAL;
+    case Token::kNE: return NOT_EQUAL;
     case Token::kLT: return BELOW;
     case Token::kGT: return ABOVE;
     case Token::kLTE: return BELOW_EQUAL;
     case Token::kGTE: return ABOVE_EQUAL;
     default:
       UNREACHABLE();
       return OVERFLOW;
   }
 }
 
 
-static void EmitDoubleRelationalOp(FlowGraphCompiler* compiler,
-                                   RelationalOpComp* comp) {
-  Register left = comp->locs()->in(0).reg();
-  Register right = comp->locs()->in(1).reg();
+static void EmitDoubleComparisonOp(FlowGraphCompiler* compiler,
+                                   const LocationSummary& locs,
+                                   Token::Kind kind,
+                                   BranchInstr* branch,
+                                   intptr_t cid,
+                                   intptr_t token_pos,
+                                   intptr_t try_index) {
+  Register left = locs.in(0).reg();
+  Register right = locs.in(1).reg();
   // TODO(srdjan): temp is only needed if a conversion Smi->Double occurs.
-  Register temp = comp->locs()->temp(0).reg();
-  Label* deopt = compiler->AddDeoptStub(comp->cid(),
-                                        comp->token_pos(),
-                                        comp->try_index(),
+  Register temp = locs.temp(0).reg();
+  Label* deopt = compiler->AddDeoptStub(cid,
+                                        token_pos,
+                                        try_index,
                                         kDeoptDoubleComparison,
                                         left,
                                         right);
   compiler->LoadDoubleOrSmiToXmm(XMM0, left, temp, deopt);
   compiler->LoadDoubleOrSmiToXmm(XMM1, right, temp, deopt);
 
-  Condition true_condition = TokenKindToDoubleCondition(comp->kind());
-  if (comp->is_fused_with_branch()) {
+  Condition true_condition = TokenKindToDoubleCondition(kind);
+  if (branch != NULL) {
     compiler->EmitDoubleCompareBranch(
-        true_condition, XMM0, XMM1, comp->fused_with_branch());
+        true_condition, XMM0, XMM1, branch);
   } else {
     compiler->EmitDoubleCompareBool(
-        true_condition, XMM0, XMM1, comp->locs()->out().reg());
+        true_condition, XMM0, XMM1, locs.out().reg());
   }
 }
 
 
 void RelationalOpComp::EmitNativeCode(FlowGraphCompiler* compiler) {
   if (operands_class_id() == kSmi) {
-    EmitSmiRelationalOp(compiler, this);
+    EmitSmiComparisonOp(compiler, *locs(), kind(), NULL,
+                        cid(), token_pos(), try_index());
     return;
   }
   if (operands_class_id() == kDouble) {
-    EmitDoubleRelationalOp(compiler, this);
+    EmitDoubleComparisonOp(compiler, *locs(), kind(), NULL,
+                           cid(), token_pos(), try_index());
     return;
   }
   if (HasICData() && (ic_data()->NumberOfChecks() > 0)) {
     Label* deopt = compiler->AddDeoptStub(cid(),
                                           token_pos(),
                                           try_index(),
                                           kDeoptRelationalOp);
     // Load receiver into EAX, class into EDI.
     Label done;
     const intptr_t kNumArguments = 2;
@@ skipping 1440 matching lines @@
     compiler->GenerateStaticCall(instance_call()->cid(),
                                  instance_call()->token_pos(),
                                  instance_call()->try_index(),
                                  target,
                                  instance_call()->ArgumentCount(),
                                  instance_call()->argument_names());
   }
   __ Bind(&done);
 }
 
+
+// TODO(srdjan): Move to shared.
+static bool ICDataWithBothClassIds(const ICData& ic_data, intptr_t class_id) {
+  if (ic_data.num_args_tested() != 2) return false;
+  if (ic_data.NumberOfChecks() != 1) return false;
+  Function& target = Function::Handle();
+  GrowableArray<intptr_t> class_ids;
+  ic_data.GetCheckAt(0, &class_ids, &target);
+  return (class_ids[0] == class_id) && (class_ids[1] == class_id);
+}
+
+
+LocationSummary* BranchInstr::MakeLocationSummary() const {
+  if ((kind() == Token::kEQ_STRICT) || (kind() == Token::kNE_STRICT)) {
+    const int kNumInputs = 2;
+    const int kNumTemps = 0;
+    LocationSummary* locs = new LocationSummary(kNumInputs,
+                                                kNumTemps,
+                                                LocationSummary::kNoCall);
+    locs->set_in(0, Location::RequiresRegister());
+    locs->set_in(1, Location::RequiresRegister());
+    return locs;
+  }
+  if (HasICData() && (ic_data()->NumberOfChecks() > 0)) {
+    if (ICDataWithBothClassIds(*ic_data(), kSmi) ||
+        ICDataWithBothClassIds(*ic_data(), kDouble)) {
+      const intptr_t kNumInputs = 2;
+      const intptr_t kNumTemps = 1;
+      LocationSummary* summary = new LocationSummary(kNumInputs,
+                                                     kNumTemps,
+                                                     LocationSummary::kNoCall);
+      summary->set_in(0, Location::RequiresRegister());
+      summary->set_in(1, Location::RequiresRegister());
+      summary->set_temp(0, Location::RequiresRegister());
+      return summary;
+    }
+    if ((kind() == Token::kEQ) || (kind() == Token::kNE)) {
+      const intptr_t kNumInputs = 2;
+      const intptr_t kNumTemps = 1;
+      LocationSummary* locs = new LocationSummary(kNumInputs,
+                                                  kNumTemps,
+                                                  LocationSummary::kCall);
+      locs->set_in(0, Location::RequiresRegister());
+      locs->set_in(1, Location::RequiresRegister());
+      locs->set_temp(0, Location::RequiresRegister());
+      return locs;
+    }
+    // Otherwise polymorphic dispatch.
+  }
+  // Call.
+  LocationSummary* result = new LocationSummary(0, 0, LocationSummary::kCall);
+  result->set_out(Location::RegisterLocation(EAX));
+  return result;
+}
+
+
+void BranchInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
+  if ((kind() == Token::kEQ_STRICT) || (kind() == Token::kNE_STRICT)) {
+    Register left = locs()->in(0).reg();
+    Register right = locs()->in(1).reg();
+    __ cmpl(left, right);
+    Condition cond = (kind() == Token::kEQ_STRICT) ? EQUAL : NOT_EQUAL;
+    EmitBranchOnCondition(compiler, cond);
+    return;
+  }
+  // Relational or equality.
+  if (HasICData() && (ic_data()->NumberOfChecks() > 0)) {
+    if (ICDataWithBothClassIds(*ic_data(), kSmi)) {
+      EmitSmiComparisonOp(compiler, *locs(), kind(), this,
+                          cid(), token_pos(), try_index());
+      return;
+    }
+    if (ICDataWithBothClassIds(*ic_data(), kDouble)) {
+      EmitDoubleComparisonOp(compiler, *locs(), kind(), this,
+                             cid(), token_pos(), try_index());
+      return;
+    }
+    // TODO(srdjan): Add Smi/Double, Double/Smi comparisons.
+    if ((kind() == Token::kEQ) || (kind() == Token::kNE)) {
+      EmitGenericEqualityCompare(compiler, *locs(), kind(), this, *ic_data(),
+                                 cid(), token_pos(), try_index());
+      return;
+    }
+    // Otherwise polymorphic dispatch?
+  }
+  // Not equal is always split into '==' and negate,
+  Condition branch_condition = (kind() == Token::kNE) ? NOT_EQUAL : EQUAL;
+  Token::Kind call_kind = (kind() == Token::kNE) ? Token::kEQ : kind();
+  const String& function_name =
+      String::ZoneHandle(String::NewSymbol(Token::Str(call_kind)));
+  compiler->AddCurrentDescriptor(PcDescriptors::kDeopt,
+                                 cid(),
+                                 token_pos(),
+                                 try_index());
+  const intptr_t kNumArguments = 2;
+  const intptr_t kNumArgsChecked = 2;  // Type-feedback.
+  compiler->GenerateInstanceCall(cid(),
+                                 token_pos(),
+                                 try_index(),
+                                 function_name,
+                                 kNumArguments,
+                                 Array::ZoneHandle(),  // No optional arguments.
+                                 kNumArgsChecked);
+  ASSERT(locs()->out().reg() == EAX);
+  __ CompareObject(locs()->out().reg(), compiler->bool_true());
+  EmitBranchOnCondition(compiler, branch_condition);
+}
+
 }  // namespace dart
 
 #undef __
 
 #endif  // defined TARGET_ARCH_X64