DBC: CheckClassInstr

runtime/vm/intermediate_language_dbc.cc

 // Copyright (c) 2016, 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_DBC.
 #if defined(TARGET_ARCH_DBC)
 
 #include "vm/intermediate_language.h"
 
 #include "vm/cpu.h"
@@ skipping 84 matching lines @@
   M(ExtractNthOutput)                                                          \
   M(BinaryUint32Op)                                                            \
   M(ShiftUint32Op)                                                             \
   M(UnaryUint32Op)                                                             \
   M(UnboxedIntConverter)                                                       \
   M(GrowRegExpStack)                                                           \
   M(BoxInteger32)                                                              \
   M(UnboxInteger32)                                                            \
   M(CheckedSmiOp)                                                              \
   M(CheckArrayBound)                                                           \
-  M(CheckClass)                                                                \
   M(TestSmi)                                                                   \
   M(RelationalOp)                                                              \
   M(EqualityCompare)                                                           \
   M(LoadIndexed)
 
 // Location summaries actually are not used by the unoptimizing DBC compiler
 // because we don't allocate any registers.
 static LocationSummary* CreateLocationSummary(
     Zone* zone,
     intptr_t num_inputs,
@@ skipping 381 matching lines @@
   return comparison()->locs();
 }
 
 
 void BranchInstr::EmitNativeCode(FlowGraphCompiler* compiler) {
   comparison()->EmitBranchCode(compiler, this);
 }
 
 
 EMIT_NATIVE_CODE(Goto, 0) {
+  if (!compiler->is_optimizing()) {
+    // Add a deoptimization descriptor for deoptimizing instructions that
+    // may be inserted before this instruction.
+    compiler->AddCurrentDescriptor(RawPcDescriptors::kDeopt,
+                                   GetDeoptId(),
+                                   TokenPosition::kNoSource);
+  }
   if (HasParallelMove()) {
     compiler->parallel_move_resolver()->EmitNativeCode(parallel_move());
   }
   // We can fall through if the successor is the next block in the list.
   // Otherwise, we need a jump.
   if (!compiler->CanFallThroughTo(successor())) {
     __ Jump(compiler->GetJumpLabel(successor()));
   }
 }
 
@@ skipping 459 matching lines @@
     compiler->EmitDeopt(deopt_id(), ICData::kDeoptBinaryDoubleOp,
                         licm_hoisted_ ? ICData::kHoisted : 0);
     __ CheckSmi(right);
   }
   compiler->EmitDeopt(deopt_id(), ICData::kDeoptBinaryDoubleOp,
                       licm_hoisted_ ? ICData::kHoisted : 0);
 }
 
 
 EMIT_NATIVE_CODE(CheckClassId, 1) {
-  intptr_t cid = __ AddConstant(Smi::Handle(Smi::New(cid_)));
-  __ CheckClassId(locs()->in(0).reg(), cid);
+  if (!Utils::IsUint(16, cid_)) {
+#if defined(PRODUCT)
+    compiler->Bailout("CheckClassInstr::EmitNativeCode");
+#else  // defined(PRODUCT)
+    compiler->Bailout(ToCString());
+#endif  // defined(PRODUCT)
+  }
+  __ CheckClassId(locs()->in(0).reg(), cid_);
   compiler->EmitDeopt(deopt_id(), ICData::kDeoptCheckClass);
 }
 
 
+EMIT_NATIVE_CODE(CheckClass, 1) {
+#if defined(PRODUCT)
+  const char* bailout_msg = "CheckClassInstr::EmitNativeCode";
+#else  // defined(PRODUCT)
+  const char* bailout_msg = ToCString();
+#endif  // defined(PRODUCT)
+  const Register value = locs()->in(0).reg();
+  if (IsNullCheck()) {
+    ASSERT(DeoptIfNull() || DeoptIfNotNull());
+    if (DeoptIfNull()) {
+      __ IfEqNull(value);
+    } else {
+      __ IfNeNull(value);
+    }
+  } else {
+    ASSERT((unary_checks().GetReceiverClassIdAt(0) != kSmiCid) ||
+           (unary_checks().NumberOfChecks() > 1));
+    const intptr_t may_be_smi =
+        (unary_checks().GetReceiverClassIdAt(0) == kSmiCid) ? 1 : 0;
+    if (IsDenseSwitch()) {
+      ASSERT(cids_[0] < cids_[cids_.length() - 1]);
+      const intptr_t low_cid = cids_[0];
+      if (!Utils::IsUint(16, low_cid)) {
+        compiler->Bailout(bailout_msg);
+      }
+      const intptr_t cid_mask = ComputeCidMask();
+      __ CheckDenseSwitch(value, may_be_smi);
+      __ Nop(low_cid);
+      __ Nop(__ AddConstant(Smi::Handle(Smi::New(cid_mask))));
+    } else {
+      GrowableArray<CidTarget> sorted_ic_data;
+      FlowGraphCompiler::SortICDataByCount(unary_checks(),
+                                           &sorted_ic_data,
+                                           /* drop_smi = */ true);
+      const intptr_t sorted_length = sorted_ic_data.length();
+      ASSERT(sorted_length >= 1);
+      if (sorted_length == 1) {
+        const intptr_t cid = sorted_ic_data[0].cid;
+        if (!Utils::IsUint(16, cid)) {
+          compiler->Bailout(bailout_msg);
+        }
+        __ CheckClassId(value, cid);

[Vyacheslav Egorov (Google), 2016/06/30 08:04:13]

I don't think this is correct if may_be_smi is true - if maybe smi is true then
there are two cids to check. 

[zra, 2016/06/30 15:30:53]

Okay. I'm just going to put this back to how it was in the previous
revision---passing may_be_smi and putting the cid in the following Nop.

[Vyacheslav Egorov (Google), 2016/06/30 15:32:09]

You can just emit CheckCids instead.

+      } else {
+        if (!Utils::IsUint(8, sorted_length)) {
+          compiler->Bailout(bailout_msg);
+        }
+        __ CheckCids(value, may_be_smi, sorted_length);
+        for (intptr_t i = 0; i < sorted_length; i++) {
+          const intptr_t cid = sorted_ic_data[i].cid;
+          if (!Utils::IsUint(16, cid)) {

[Vyacheslav Egorov (Google), 2016/06/30 08:04:13]

This should really be a helper, e.g. on compiler

uint16_t cid = compiler->ToEmbeddableCid(intptr_t cid)

+            compiler->Bailout(bailout_msg);
+          }
+          __ Nop(cid);
+        }
+      }
+    }
+  }
+  compiler->EmitDeopt(deopt_id(),
+                      ICData::kDeoptCheckClass,
+                      licm_hoisted_ ? ICData::kHoisted : 0);
+}
+
+
 EMIT_NATIVE_CODE(BinarySmiOp, 2, Location::RequiresRegister()) {
   const Register left = locs()->in(0).reg();
   const Register right = locs()->in(1).reg();
   const Register out = locs()->out(0).reg();
   const bool can_deopt = CanDeoptimize();
   bool needs_nop = false;
   switch (op_kind()) {
     case Token::kADD:
       __ Add(out, left, right);
       needs_nop = true;
@@ skipping 33 matching lines @@
     case Token::kSHL:
       __ Shl(out, left, right);
       needs_nop = true;
       break;
     default:
       UNREACHABLE();
   }
   if (can_deopt) {
     compiler->EmitDeopt(deopt_id(), ICData::kDeoptBinarySmiOp);
   } else if (needs_nop) {
-    __ Nop();
+    __ Nop(0);
   }
 }
 
 
 EMIT_NATIVE_CODE(UnarySmiOp, 1, Location::RequiresRegister()) {
   switch (op_kind()) {
     case Token::kNEGATE: {
       __ Neg(locs()->out(0).reg(), locs()->in(0).reg());
       compiler->EmitDeopt(deopt_id(), ICData::kDeoptUnaryOp);
       break;
     }
     case Token::kBIT_NOT:
       __ BitNot(locs()->out(0).reg(), locs()->in(0).reg());
       break;
     default:
       UNREACHABLE();
   }
 }
 
 }  // namespace dart
 
 #endif  // defined TARGET_ARCH_DBC