Add a smi-check instruction for arithmetic smi operations.

runtime/vm/intermediate_language_x64.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_X64.
 #if defined(TARGET_ARCH_X64)
 
 #include "vm/intermediate_language.h"
 
 #include "lib/error.h"
@@ skipping 1424 matching lines @@
         new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall);
     summary->set_in(0, Location::RegisterLocation(RAX));
     summary->set_in(1, Location::RegisterLocation(RCX));
     summary->set_out(Location::SameAsFirstInput());
     summary->set_temp(0, Location::RegisterLocation(RBX));
     // Will be used for for sign extension.
     summary->set_temp(1, Location::RegisterLocation(RDX));
     summary->set_temp(2, Location::RequiresRegister());
     return summary;
   } else if (op_kind() == Token::kSHR) {
-    const intptr_t kNumTemps = 1;
+    const intptr_t kNumTemps = 0;
     LocationSummary* summary =
         new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall);
     summary->set_in(0, Location::RequiresRegister());
     summary->set_in(1, Location::RegisterLocation(RCX));
     summary->set_out(Location::SameAsFirstInput());
-    summary->set_temp(0, Location::RequiresRegister());
     return summary;
   } else if (op_kind() == Token::kSHL) {
     // Two Smi operands can easily overflow into Mint.
     const intptr_t kNumTemps = 2;
     LocationSummary* summary =
         new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kCall);
     summary->set_in(0, Location::RegisterLocation(RAX));
     summary->set_in(1, Location::RegisterLocation(RDX));
     summary->set_out(Location::RegisterLocation(RAX));
     summary->set_temp(0, Location::RegisterLocation(RBX));
     summary->set_temp(1, Location::RegisterLocation(RCX));
     return summary;
   } else {
-    const intptr_t kNumTemps = 1;
+    const intptr_t kNumTemps = 0;
     LocationSummary* summary =
         new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall);
     summary->set_in(0, Location::RequiresRegister());
     summary->set_in(1, Location::RequiresRegister());
     summary->set_out(Location::SameAsFirstInput());
-    summary->set_temp(0, Location::RequiresRegister());
     return summary;
   }
 }
 
 
 void BinarySmiOpComp::EmitNativeCode(FlowGraphCompiler* compiler) {
   Register left = locs()->in(0).reg();
   Register right = locs()->in(1).reg();
   Register result = locs()->out().reg();
-  Register temp = locs()->temp(0).reg();
   ASSERT(left == result);
-  const bool left_is_smi = this->left()->ResultCid() == kSmiCid;
-  const bool right_is_smi = this->right()->ResultCid() == kSmiCid;
-  bool can_deopt;
+  Label* deopt = NULL;
   switch (op_kind()) {
     case Token::kBIT_AND:
     case Token::kBIT_OR:
     case Token::kBIT_XOR:
-      can_deopt = !(right_is_smi && left_is_smi);
+      // Can't deoptimize. Arguments are already checked for smi.
       break;
     default:
-      can_deopt = true;
-  }
-  Label* deopt = NULL;
-  if (can_deopt) {
-    deopt = compiler->AddDeoptStub(instance_call()->deopt_id(),
-                                   instance_call()->try_index(),
-                                   kDeoptBinarySmiOp);
-  }
-  if (!left_is_smi || !right_is_smi) {
-    __ movq(temp, left);
-    __ orq(temp, right);
-    __ testq(temp, Immediate(kSmiTagMask));
-    __ j(NOT_ZERO, deopt);
+      deopt = compiler->AddDeoptStub(instance_call()->deopt_id(),
+                                     instance_call()->try_index(),
+                                     kDeoptBinarySmiOp);
   }
   switch (op_kind()) {
     case Token::kADD: {
       __ addq(left, right);
       __ j(OVERFLOW, deopt);
       break;
     }
     case Token::kSUB: {
       __ subq(left, right);
       __ j(OVERFLOW, deopt);
@@ skipping 14 matching lines @@
       // No overflow check.
       __ orq(left, right);
       break;
     }
     case Token::kBIT_XOR: {
       // No overflow check.
       __ xorq(left, right);
       break;
     }
     case Token::kTRUNCDIV: {
+      Register temp = locs()->temp(0).reg();
       // Handle divide by zero in runtime.
       // Deoptimization requires that temp and right are preserved.
       __ testq(right, right);
       __ j(ZERO, deopt);
       ASSERT(left == RAX);
       ASSERT((right != RDX) && (right != RAX));
       ASSERT((temp != RDX) && (temp != RAX));
       ASSERT(locs()->temp(1).reg() == RDX);
       ASSERT(result == RAX);
       Register right_temp = locs()->temp(2).reg();
@@ skipping 20 matching lines @@
       __ j(LESS, &count_ok, Assembler::kNearJump);
       __ movq(right, kCountLimit);
       __ Bind(&count_ok);
       ASSERT(right == RCX);  // Count must be in RCX
       __ SmiUntag(left);
       __ sarq(left, right);
       __ SmiTag(left);
       break;
     }
     case Token::kSHL: {
+      Register temp = locs()->temp(0).reg();
       Label call_method, done;
       // Check if count too large for handling it inlined.
       __ movq(temp, left);
       __ cmpq(right,
           Immediate(reinterpret_cast<int64_t>(Smi::New(Smi::kBits))));
       __ j(ABOVE_EQUAL, &call_method, Assembler::kNearJump);
       Register right_temp = locs()->temp(1).reg();
       ASSERT(right_temp == RCX);  // Count must be in RCX
       __ movq(right_temp, right);
       __ SmiUntag(right_temp);
@@ skipping 608 matching lines @@
       if (use_near_jump) {
         __ j(EQUAL, &is_ok, Assembler::kNearJump);
       } else {
         __ j(EQUAL, &is_ok);
       }
     }
   }
   __ Bind(&is_ok);
 }
 
+
+LocationSummary* CheckSmiComp::MakeLocationSummary() const {
+  const intptr_t kNumInputs = 1;
+  const intptr_t kNumTemps = 0;
+  LocationSummary* summary =
+      new LocationSummary(kNumInputs, kNumTemps, LocationSummary::kNoCall);
+  summary->set_in(0, Location::RequiresRegister());
+  return summary;
+}
+
+
+void CheckSmiComp::EmitNativeCode(FlowGraphCompiler* compiler) {
+  Register value = locs()->in(0).reg();
+  Label* deopt = compiler->AddDeoptStub(deopt_id(),
+                                        try_index(),
+                                        kDeoptCheckSmi);
+  __ testq(value, Immediate(kSmiTagMask));
+  __ j(NOT_ZERO, deopt);
+}
+
+
 }  // namespace dart
 
 #undef __
 
 #endif  // defined TARGET_ARCH_X64