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 87 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 355 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 444 matching lines @@
 }
 
 
 EMIT_NATIVE_CODE(CheckClassId, 1) {
   intptr_t cid = __ AddConstant(Smi::Handle(Smi::New(cid_)));
   __ CheckClassId(locs()->in(0).reg(), cid);
   compiler->EmitDeopt(deopt_id(), ICData::kDeoptCheckClass);
 }
 
 
+EMIT_NATIVE_CODE(CheckClass, 1) {
+  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]);
+      __ CheckDenseSwitch(value, may_be_smi);
+      __ Nop(__ AddConstant(Smi::Handle(Smi::New(cids_[0]))));
+      __ Nop(__ AddConstant(Smi::Handle(Smi::New(ComputeCidMask()))));
+    } else {
+      GrowableArray<CidTarget> sorted_ic_data;
+      FlowGraphCompiler::SortICDataByCount(unary_checks(),
+                                           &sorted_ic_data,
+                                           /* drop_smi = */ true);
+      ASSERT(sorted_ic_data.length() >= 1);
+      if (sorted_ic_data.length() == 1) {
+        __ CheckCid(value, may_be_smi);
+        __ Nop(__ AddConstant(Smi::Handle(Smi::New(sorted_ic_data[0].cid))));
+      } else {
+        const Array& sorted_smi_cids =
+            Array::Handle(Array::New(sorted_ic_data.length(), Heap::kOld));
+        for (intptr_t i = 0; i < sorted_ic_data.length(); i++) {
+          sorted_smi_cids.SetAt(i,
+              Smi::Handle(Smi::New(sorted_ic_data[i].cid)));
+        }
+        __ CheckCids(value, may_be_smi);
+        __ Nop(__ AddConstant(sorted_smi_cids));

[Vyacheslav Egorov (Google), 2016/06/29 17:11:06]

I suggest just embedding them into the code instead of having an array on the
side. 

I don't think we are saving any memory by doing this. 

Embed CIDs by truncating them to 16bits.

You can have a helper that bails out of optimized compilation if CID is not
16bit.

[zra, 2016/06/29 22:19:18]

Done.

+      }
+    }
+  }
+  compiler->EmitDeopt(deopt_id(),
+                  ICData::kDeoptCheckClass,

[Vyacheslav Egorov (Google), 2016/06/29 17:11:06]

indentation

[zra, 2016/06/29 22:19:17]

Done.

+                  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