/external/v8/test/unittests/compiler/arm64/ |
D | instruction-selector-arm64-unittest.cc | 348 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 365 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() 378 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() 404 EXPECT_EQ(3U, s[0]->InputCount()); in TEST_P() 419 EXPECT_EQ(3U, s[0]->InputCount()); in TEST_P() 445 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 460 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() 479 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() 510 EXPECT_EQ(3U, s[0]->InputCount()); in TEST_P() 528 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() [all …]
|
/external/v8/src/compiler/ |
D | node.cc | 120 int const input_count = node->InputCount(); in Clone() 153 int input_count = InputCount(); in AppendInput() 187 DCHECK_LT(index, InputCount()); in InsertInput() 188 AppendInput(zone, InputAt(InputCount() - 1)); in InsertInput() 189 for (int i = InputCount() - 1; i > index; --i) { in InsertInput() 199 DCHECK_LT(index, InputCount()); in RemoveInput() 200 for (; index < InputCount() - 1; ++index) { in RemoveInput() 203 TrimInputCount(InputCount() - 1); in RemoveInput() 223 void Node::NullAllInputs() { ClearInputs(0, InputCount()); } in NullAllInputs() 227 int current_count = InputCount(); in TrimInputCount() [all …]
|
D | value-numbering-reducer.cc | 19 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount()); in HashCode() 20 for (int j = 0; j < node->InputCount(); ++j) { in HashCode() 33 if (a->InputCount() != b->InputCount()) return false; in Equals() 34 for (int j = 0; j < a->InputCount(); ++j) { in Equals()
|
D | node-matchers.cc | 36 if (merge->InputCount() != 2) return; in DiamondMatcher() 39 if (input0->InputCount() != 1) return; in DiamondMatcher() 41 if (input1->InputCount() != 1) return; in DiamondMatcher()
|
D | common-operator-reducer.cc | 138 if (node->InputCount() == 2) { in ReduceMerge() 165 int const input_count = node->InputCount() - 1; in ReduceEffectPhi() 169 DCHECK_EQ(input_count, merge->InputCount()); in ReduceEffectPhi() 189 int const input_count = node->InputCount() - 1; in ReducePhi() 193 DCHECK_EQ(input_count, merge->InputCount()); in ReducePhi() 284 int const control_input_count = control->InputCount(); in ReduceReturn() 286 DCHECK_EQ(control_input_count, value->InputCount() - 1); in ReduceReturn() 287 DCHECK_EQ(control_input_count, effect->InputCount() - 1); in ReduceReturn() 289 DCHECK_NE(0, graph()->end()->InputCount()); in ReduceReturn()
|
D | osr.cc | 88 if (orig->InputCount() == 0 || orig->opcode() == IrOpcode::kParameter || in PeelOuterLoopsForOsr() 100 copy = graph->NewNode(orig->op(), orig->InputCount(), &tmp_inputs[0]); in PeelOuterLoopsForOsr() 112 for (int j = 0; j < copy->InputCount(); j++) { in PeelOuterLoopsForOsr() 135 for (int i = 1; i < loop_header->InputCount(); i++) { in PeelOuterLoopsForOsr() 235 int const input_count = end->InputCount(); in PeelOuterLoopsForOsr() 240 NodeProperties::ChangeOp(end, common->End(end->InputCount())); in PeelOuterLoopsForOsr() 300 int const live_input_count = osr_loop->InputCount() - 1; in Deconstruct()
|
D | dead-code-elimination.cc | 41 int const input_count = node->InputCount(); in ReduceEnd() 66 int const input_count = node->InputCount(); in ReduceLoopOrMerge() 84 DCHECK_EQ(input_count + 1, use->InputCount()); in ReduceLoopOrMerge()
|
D | graph-replay.cc | 30 for (int i = 0; i < node->InputCount(); ++i) { in PrintReplay() 38 for (int i = 0; i < node->InputCount(); i++) { in PrintReplay()
|
D | loop-peeling.cc | 130 Insert(node, graph->NewNode(node->op(), node->InputCount(), &inputs[0])); in CopyNodes() 136 for (int i = 0; i < copy->InputCount(); i++) { in CopyNodes() 230 int backedges = loop_node->InputCount() - 1; in Peel() 235 for (int i = 1; i < loop_node->InputCount(); i++) { in Peel()
|
D | node.h | 48 bool IsDead() const { return InputCount() > 0 && !InputAt(0); } in IsDead() 60 int InputCount() const { in InputCount() function 69 if (index < 0 || index >= InputCount()) { \ 356 DCHECK_LT(index, use_->from()->InputCount()); in index() 429 return Node::InputEdges::iterator(this->node_, this->node_->InputCount()); in end() 472 return const_iterator(this->node_, this->node_->InputCount()); in end()
|
D | graph-reducer.cc | 117 int start = entry.input_index < node->InputCount() ? entry.input_index : 0; in ReduceTop() 118 for (int i = start; i < node->InputCount(); i++) { in ReduceTop() 142 for (int i = 0; i < node->InputCount(); ++i) { in ReduceTop()
|
D | state-values-utils.cc | 47 if (key->count != static_cast<size_t>(node->InputCount())) { in IsKeysEqualToNode() 246 if (index >= node->InputCount()) { in Advance() 304 for (int i = 0; i < node_->InputCount(); i++) { in size()
|
D | simplified-operator-reducer.cc | 120 DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op)); in Change() 121 DCHECK_LE(1, node->InputCount()); in Change()
|
D | linkage.cc | 77 << "s" << d.StackParameterCount() << "i" << d.InputCount() << "f" in operator <<() 101 if (other_input < other->InputCount()) { in CanTailCall() 108 if (current_input < InputCount()) { in CanTailCall() 212 for (size_t i = 0; i < InputCount(); ++i) { in UsesOnlyRegisters()
|
/external/v8/test/unittests/compiler/x64/ |
D | instruction-selector-x64-unittest.cc | 23 EXPECT_EQ(1U, s[0]->InputCount()); in TEST_F() 61 EXPECT_EQ(1U, s[0]->InputCount()); in TEST_F() 120 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 135 EXPECT_EQ(3U, s[0]->InputCount()); in TEST_P() 223 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 240 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 265 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 287 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 305 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 322 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() [all …]
|
/external/v8/test/unittests/compiler/arm/ |
D | instruction-selector-arm-unittest.cc | 157 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 171 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() 182 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_P() 201 EXPECT_EQ(3U, s[0]->InputCount()); in TEST_P() 214 EXPECT_EQ(3U, s[0]->InputCount()); in TEST_P() 233 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_P() 249 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_P() 375 ASSERT_EQ(5U, s[0]->InputCount()); in TEST_P() 398 ASSERT_EQ(5U, s[0]->InputCount()); in TEST_P() 553 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() [all …]
|
/external/v8/test/unittests/compiler/mips64/ |
D | instruction-selector-mips64-unittest.cc | 304 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 327 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 350 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 375 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 392 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 416 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 434 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 450 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 461 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 476 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() [all …]
|
/external/v8/test/unittests/compiler/ia32/ |
D | instruction-selector-ia32-unittest.cc | 40 ASSERT_EQ(1U, s[0]->InputCount()); in TEST_F() 42 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 53 ASSERT_EQ(1U, s[0]->InputCount()); in TEST_F() 55 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 81 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 97 EXPECT_EQ(1U, s[0]->InputCount()); in TEST_F() 108 EXPECT_EQ(1U, s[0]->InputCount()); in TEST_F() 127 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 131 ASSERT_EQ(2U, s[1]->InputCount()); in TEST_F() 146 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() [all …]
|
/external/v8/test/unittests/compiler/mips/ |
D | instruction-selector-mips-unittest.cc | 287 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 313 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 341 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 368 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 385 ASSERT_EQ(3U, s[0]->InputCount()); in TEST_F() 404 ASSERT_EQ(2U, s[0]->InputCount()); in TEST_F() 429 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_P() 445 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_F() 454 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_F() 468 EXPECT_EQ(2U, s[0]->InputCount()); in TEST_F() [all …]
|
/external/v8/test/unittests/compiler/ |
D | graph-reducer-unittest.cc | 66 EXPECT_EQ(0, node->InputCount()); in Reduce() 70 EXPECT_EQ(1, node->InputCount()); in Reduce() 74 EXPECT_EQ(2, node->InputCount()); in Reduce() 91 EXPECT_EQ(0, node->InputCount()); in Reduce() 94 EXPECT_EQ(1, node->InputCount()); in Reduce() 97 EXPECT_EQ(2, node->InputCount()); in Reduce() 117 EXPECT_EQ(0, node->InputCount()); in Reduce() 136 EXPECT_EQ(0, node->InputCount()); in Reduce() 153 EXPECT_EQ(1, node->InputCount()); in Reduce() 167 EXPECT_EQ(1, node->InputCount()); in Reduce() [all …]
|
D | instruction-selector-unittest.cc | 81 for (size_t i = 0; i < instr->InputCount(); ++i) { in Build() 169 EXPECT_EQ(1U, s[1]->InputCount()); in TARGET_TEST_F() 181 EXPECT_EQ(1U, s[1]->InputCount()); in TARGET_TEST_F() 195 EXPECT_EQ(1U, s[1]->InputCount()); in TARGET_TEST_F() 211 EXPECT_EQ(1U, s[1]->InputCount()); in TARGET_TEST_F() 256 ASSERT_EQ(1U, s[1]->InputCount()); in TARGET_TEST_F() 346 EXPECT_EQ(i1->InputCount(), i2->InputCount()); in TARGET_TEST_F() 466 ASSERT_EQ(num_operands, call_instr->InputCount()); in TARGET_TEST_F() 580 EXPECT_EQ(num_operands, call_instr->InputCount()); in TARGET_TEST_F()
|
D | node-unittest.cc | 38 EXPECT_EQ(0, node->InputCount()); in TEST_F() 48 EXPECT_EQ(0, n0->InputCount()); in TEST_F() 53 EXPECT_EQ(1, n1->InputCount()); in TEST_F() 60 EXPECT_EQ(2, n2->InputCount()); in TEST_F() 250 EXPECT_EQ(size, node->InputCount()); in TEST_F()
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/otvalid/ |
D | otvcommn.c | 787 FT_UInt BacktrackCount, InputCount, LookaheadCount; in otv_x_ux_y_uy_z_uz_p_sp() local 801 InputCount = FT_NEXT_USHORT( p ); in otv_x_ux_y_uy_z_uz_p_sp() 802 if ( InputCount == 0 ) in otv_x_ux_y_uy_z_uz_p_sp() 805 OTV_TRACE(( " (InputCount = %d)\n", InputCount )); in otv_x_ux_y_uy_z_uz_p_sp() 807 OTV_LIMIT_CHECK( InputCount * 2 ); in otv_x_ux_y_uy_z_uz_p_sp() 808 p += ( InputCount - 1 ) * 2; in otv_x_ux_y_uy_z_uz_p_sp() 825 if ( FT_NEXT_USHORT( p ) >= InputCount ) in otv_x_ux_y_uy_z_uz_p_sp()
|
/external/v8/src/compiler/x64/ |
D | instruction-scheduler-x64.cc | 134 DCHECK(instr->InputCount() >= 1); in GetTargetInstructionFlags() 144 DCHECK(instr->InputCount() >= 1); in GetTargetInstructionFlags()
|
/external/v8/test/cctest/compiler/ |
D | test-osr.cc | 29 CHECK_EQ(count, node->InputCount()); in CheckInputs() 84 CHECK_EQ(loop->InputCount(), count); in NewOsrPhi() 107 NodeProperties::ChangeOp(loop, common.Loop(loop->InputCount())); in NewLoop() 308 loop->ReplaceInput(loop->InputCount() - 1, if_true); in While() 312 that.loop->ReplaceInput(that.loop->InputCount() - 1, exit); in Nest() 317 if (loop->InputCount() == 2) { in Phi() 471 int count = loop->InputCount(); in MakeCounter()
|