| /external/v8/src/compiler/ |
| node-matchers.cc | 36 if (merge->InputCount() != 2) return;
39 if (input0->InputCount() != 1) return;
41 if (input1->InputCount() != 1) return;
|
| node.cc | 120 int const input_count = node->InputCount();
153 int input_count = InputCount();
187 DCHECK_LT(index, InputCount());
188 AppendInput(zone, InputAt(InputCount() - 1));
189 for (int i = InputCount() - 1; i > index; --i) {
199 DCHECK_LT(index, InputCount());
200 for (; index < InputCount() - 1; ++index) {
203 TrimInputCount(InputCount() - 1);
223 void Node::NullAllInputs() { ClearInputs(0, InputCount()); }
227 int current_count = InputCount();
[all...] |
| graph-replay.cc | 30 for (int i = 0; i < node->InputCount(); ++i) {
38 for (int i = 0; i < node->InputCount(); i++) {
|
| value-numbering-reducer.cc | 19 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount());
20 for (int j = 0; j < node->InputCount(); ++j) {
33 if (a->InputCount() != b->InputCount()) return false;
34 for (int j = 0; j < a->InputCount(); ++j) {
|
| dead-code-elimination.cc | 41 int const input_count = node->InputCount();
66 int const input_count = node->InputCount();
84 DCHECK_EQ(input_count + 1, use->InputCount());
|
| tail-call-optimization.cc | 65 DCHECK_EQ(3, node->InputCount());
|
| osr.cc | 88 if (orig->InputCount() == 0 || orig->opcode() == IrOpcode::kParameter ||
100 copy = graph->NewNode(orig->op(), orig->InputCount(), &tmp_inputs[0]);
112 for (int j = 0; j < copy->InputCount(); j++) {
135 for (int i = 1; i < loop_header->InputCount(); i++) {
235 int const input_count = end->InputCount();
240 NodeProperties::ChangeOp(end, common->End(end->InputCount()));
300 int const live_input_count = osr_loop->InputCount() - 1;
|
| common-operator-reducer.cc | 138 if (node->InputCount() == 2) {
165 int const input_count = node->InputCount() - 1;
169 DCHECK_EQ(input_count, merge->InputCount());
189 int const input_count = node->InputCount() - 1;
193 DCHECK_EQ(input_count, merge->InputCount());
284 int const control_input_count = control->InputCount();
286 DCHECK_EQ(control_input_count, value->InputCount() - 1);
287 DCHECK_EQ(control_input_count, effect->InputCount() - 1);
289 DCHECK_NE(0, graph()->end()->InputCount());
|
| node.h | 48 bool IsDead() const { return InputCount() > 0 && !InputAt(0); }
60 int InputCount() const {
69 if (index < 0 || index >= InputCount()) { \
356 DCHECK_LT(index, use_->from()->InputCount());
429 return Node::InputEdges::iterator(this->node_, this->node_->InputCount());
472 return const_iterator(this->node_, this->node_->InputCount());
|
| simplified-operator-reducer.cc | 120 DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op));
121 DCHECK_LE(1, node->InputCount());
|
| loop-peeling.cc | 130 Insert(node, graph->NewNode(node->op(), node->InputCount(), &inputs[0]));
136 for (int i = 0; i < copy->InputCount(); i++) {
230 int backedges = loop_node->InputCount() - 1;
235 for (int i = 1; i < loop_node->InputCount(); i++) {
|
| graph-reducer.cc | 117 int start = entry.input_index < node->InputCount() ? entry.input_index : 0;
118 for (int i = start; i < node->InputCount(); i++) {
142 for (int i = 0; i < node->InputCount(); ++i) {
|
| /external/v8/test/unittests/compiler/arm64/ |
| instruction-selector-arm64-unittest.cc | 348 EXPECT_EQ(2U, s[0]->InputCount());
365 ASSERT_EQ(2U, s[0]->InputCount());
378 ASSERT_EQ(2U, s[0]->InputCount());
404 EXPECT_EQ(3U, s[0]->InputCount());
419 EXPECT_EQ(3U, s[0]->InputCount());
445 EXPECT_EQ(2U, s[0]->InputCount());
460 ASSERT_EQ(2U, s[0]->InputCount());
479 ASSERT_EQ(2U, s[0]->InputCount());
510 EXPECT_EQ(3U, s[0]->InputCount());
528 ASSERT_EQ(2U, s[0]->InputCount());
[all...] |
| /external/v8/test/unittests/compiler/arm/ |
| instruction-selector-arm-unittest.cc | 157 EXPECT_EQ(2U, s[0]->InputCount());
171 ASSERT_EQ(2U, s[0]->InputCount());
182 ASSERT_EQ(2U, s[0]->InputCount());
201 EXPECT_EQ(3U, s[0]->InputCount());
214 EXPECT_EQ(3U, s[0]->InputCount());
233 ASSERT_EQ(3U, s[0]->InputCount());
249 ASSERT_EQ(3U, s[0]->InputCount());
375 ASSERT_EQ(5U, s[0]->InputCount());
398 ASSERT_EQ(5U, s[0]->InputCount());
553 EXPECT_EQ(2U, s[0]->InputCount());
[all...] |
| /external/v8/test/unittests/compiler/ia32/ |
| instruction-selector-ia32-unittest.cc | 40 ASSERT_EQ(1U, s[0]->InputCount());
42 ASSERT_EQ(2U, s[0]->InputCount());
53 ASSERT_EQ(1U, s[0]->InputCount());
55 ASSERT_EQ(2U, s[0]->InputCount());
81 ASSERT_EQ(2U, s[0]->InputCount());
97 EXPECT_EQ(1U, s[0]->InputCount());
108 EXPECT_EQ(1U, s[0]->InputCount());
127 ASSERT_EQ(2U, s[0]->InputCount());
131 ASSERT_EQ(2U, s[1]->InputCount());
146 ASSERT_EQ(2U, s[0]->InputCount());
[all...] |
| /external/v8/test/unittests/compiler/x64/ |
| instruction-selector-x64-unittest.cc | 23 EXPECT_EQ(1U, s[0]->InputCount());
61 EXPECT_EQ(1U, s[0]->InputCount());
120 EXPECT_EQ(2U, s[0]->InputCount());
135 EXPECT_EQ(3U, s[0]->InputCount());
223 ASSERT_EQ(2U, s[0]->InputCount());
240 ASSERT_EQ(2U, s[0]->InputCount());
265 ASSERT_EQ(2U, s[0]->InputCount());
287 ASSERT_EQ(2U, s[0]->InputCount());
305 ASSERT_EQ(2U, s[0]->InputCount());
322 ASSERT_EQ(2U, s[0]->InputCount());
[all...] |
| /external/v8/test/unittests/compiler/mips64/ |
| instruction-selector-mips64-unittest.cc | 304 EXPECT_EQ(2U, s[0]->InputCount());
327 EXPECT_EQ(2U, s[0]->InputCount());
350 EXPECT_EQ(2U, s[0]->InputCount());
375 ASSERT_EQ(3U, s[0]->InputCount());
392 ASSERT_EQ(3U, s[0]->InputCount());
416 ASSERT_EQ(3U, s[0]->InputCount());
434 ASSERT_EQ(3U, s[0]->InputCount());
450 ASSERT_EQ(3U, s[0]->InputCount());
461 ASSERT_EQ(3U, s[0]->InputCount());
476 ASSERT_EQ(3U, s[0]->InputCount());
[all...] |
| /external/v8/test/unittests/compiler/mips/ |
| instruction-selector-mips-unittest.cc | 287 EXPECT_EQ(2U, s[0]->InputCount());
313 EXPECT_EQ(2U, s[0]->InputCount());
341 EXPECT_EQ(2U, s[0]->InputCount());
368 ASSERT_EQ(3U, s[0]->InputCount());
385 ASSERT_EQ(3U, s[0]->InputCount());
404 ASSERT_EQ(2U, s[0]->InputCount());
429 EXPECT_EQ(2U, s[0]->InputCount());
445 EXPECT_EQ(2U, s[0]->InputCount());
454 EXPECT_EQ(2U, s[0]->InputCount());
468 EXPECT_EQ(2U, s[0]->InputCount());
[all...] |
| /external/v8/src/compiler/x64/ |
| instruction-scheduler-x64.cc | 134 DCHECK(instr->InputCount() >= 1);
144 DCHECK(instr->InputCount() >= 1);
|
| /external/v8/test/unittests/compiler/ |
| graph-reducer-unittest.cc | 66 EXPECT_EQ(0, node->InputCount());
70 EXPECT_EQ(1, node->InputCount());
74 EXPECT_EQ(2, node->InputCount());
91 EXPECT_EQ(0, node->InputCount());
94 EXPECT_EQ(1, node->InputCount());
97 EXPECT_EQ(2, node->InputCount());
117 EXPECT_EQ(0, node->InputCount());
136 EXPECT_EQ(0, node->InputCount());
153 EXPECT_EQ(1, node->InputCount());
167 EXPECT_EQ(1, node->InputCount());
[all...] |
| node-unittest.cc | 38 EXPECT_EQ(0, node->InputCount());
48 EXPECT_EQ(0, n0->InputCount());
53 EXPECT_EQ(1, n1->InputCount());
60 EXPECT_EQ(2, n2->InputCount());
250 EXPECT_EQ(size, node->InputCount());
|
| /external/v8/src/crankshaft/ |
| lithium-inl.h | 60 : instr_(instr), limit_(instr->InputCount()), current_(0) {
|
| /art/compiler/optimizing/ |
| graph_checker.cc | 367 if ((use_index >= user->InputCount()) || (user->InputAt(use_index) != instruction)) {
390 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) {
493 size_t last_input_index = invoke->InputCount() - 1;
677 insn1->InputCount() == insn2->InputCount()) {
684 for (size_t i = 0, e = insn1->InputCount(); i < e; ++i) {
708 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
732 size_t input_count_this = phi->InputCount();
740 size_t input_count_next = next_phi->InputCount();
[all...] |
| ssa_phi_elimination.cc | 105 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) {
162 for (size_t j = 0; j < phi->InputCount(); ++j) {
184 for (size_t j = 0; j < current->InputCount(); ++j) {
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/otvalid/ |
| otvcommn.c | 787 FT_UInt BacktrackCount, InputCount, LookaheadCount;
801 InputCount = FT_NEXT_USHORT( p );
802 if ( InputCount == 0 )
805 OTV_TRACE(( " (InputCount = %d)\n", InputCount ));
807 OTV_LIMIT_CHECK( InputCount * 2 );
808 p += ( InputCount - 1 ) * 2;
825 if ( FT_NEXT_USHORT( p ) >= InputCount )
|
