/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) { 200 DCHECK_LT(index, InputCount()); 202 AppendInput(zone, InputAt(Max(InputCount() - count, 0))); 204 for (int i = InputCount() - count - 1; i >= Max(index, count); --i) { 215 DCHECK_LT(index, InputCount()); 216 for (; index < InputCount() - 1; ++index) [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 | 20 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount()); 34 if (a->InputCount() != b->InputCount()) return false;
|
int64-lowering.cc | 51 if (top.input_index == top.node->InputCount()) { 168 if (node->InputCount() > 2) { 223 if (node->InputCount() > 3) { 257 DCHECK(node->InputCount() == 1); 310 DCHECK(node->InputCount() == 2); 324 DCHECK(node->InputCount() == 1); 331 DCHECK(node->InputCount() == 2); 351 DCHECK(node->InputCount() == 2); 371 DCHECK(node->InputCount() == 2); 391 DCHECK(node->InputCount() == 2) [all...] |
tail-call-optimization.cc | 69 DCHECK_EQ(4, node->InputCount());
|
osr.cc | 96 if (orig->InputCount() == 0 || orig->opcode() == IrOpcode::kParameter || 109 copy = graph->NewNode(orig->op(), orig->InputCount(), &tmp_inputs[0]); 121 for (int j = 0; j < copy->InputCount(); j++) { 144 for (int i = 1; i < loop_header->InputCount(); i++) { 244 int const input_count = end->InputCount(); 249 NodeProperties::ChangeOp(end, common->End(end->InputCount())); 327 int const live_input_count = osr_loop->InputCount() - 1;
|
simd-scalar-lowering.cc | 47 if (top.input_index == top.node->InputCount()) { 159 if (node->InputCount() > 2) { 160 DCHECK(node->InputCount() > 3); 189 DCHECK(node->InputCount() > 2); 197 if (node->InputCount() > 3) { 198 DCHECK(node->InputCount() > 4); 224 DCHECK(node->InputCount() == 2); 249 DCHECK(node->InputCount() == 1); 412 DCHECK_EQ(2, node->InputCount());
|
loop-peeling.cc | 132 Node* copy = graph->NewNode(node->op(), node->InputCount(), &inputs[0]); 142 for (int i = 0; i < copy->InputCount(); i++) { 234 int backedges = loop_node->InputCount() - 1; 239 for (int i = 1; i < loop_node->InputCount(); i++) {
|
loop-variable-optimizer.cc | 218 for (int i = 1; i < node->InputCount(); i++) { 358 induction_var->phi()->InputCount() - 1, 363 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); 367 graph()->zone(), induction_var->phi()->InputCount() - 1, bound.bound); 371 common()->InductionVariablePhi(induction_var->phi()->InputCount() - 1));
|
register-allocator-verifier.cc | 18 return instr->InputCount() + instr->OutputCount() + instr->TempCount(); 69 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { 80 CHECK(instr->InputCount() > 0); 130 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) { 524 for (size_t i = 0; i < instr->InputCount(); ++i, ++count) {
|
common-operator-reducer.cc | 171 if (node->InputCount() == 2) { 203 DCHECK_EQ(effect_input_count, merge->InputCount()); 228 DCHECK_EQ(value_input_count, merge->InputCount()); 337 DCHECK_NE(0, graph()->end()->InputCount());
|
linkage.cc | 49 << "s" << d.StackParameterCount() << "i" << d.InputCount() << "f" 79 for (size_t i = 0; i < InputCount(); ++i) { 91 for (size_t i = 0; i < tail_caller->InputCount(); ++i) { 198 for (size_t i = 0; i < InputCount(); ++i) {
|
node-matchers.h | 287 if (node->InputCount() < 2) return; 481 if (node->InputCount() < 2) return; 705 DCHECK_EQ(3, phi->InputCount()); 712 DCHECK_EQ(3, phi->InputCount());
|
simplified-operator-reducer.cc | 225 DCHECK_EQ(node->InputCount(), OperatorProperties::GetTotalInputCount(op)); 226 DCHECK_LE(1, node->InputCount());
|
loop-analysis.cc | 198 Node* merge = node->InputAt(node->InputCount() - 1); 215 for (int i = 0; i < node->InputCount(); i++) { 259 if (node->InputCount() <= 1) continue;
|
move-optimizer.cc | 189 for (size_t i = 0; i < instruction->InputCount(); ++i) { 223 for (size_t i = 0; i < from->InputCount(); ++i) { 395 for (size_t i = 0; i < last_instr->InputCount(); ++i) {
|
node.h | 61 int InputCount() const { 70 if (index < 0 || index >= InputCount()) { \ 374 DCHECK_LT(index, use_->from()->InputCount());
|
/external/v8/src/compiler/x64/ |
instruction-scheduler-x64.cc | 152 DCHECK(instr->InputCount() >= 1); 162 DCHECK(instr->InputCount() >= 1);
|
code-generator-x64.cc | [all...] |
/external/v8/src/crankshaft/ |
lithium-inl.h | 62 : instr_(instr), limit_(instr->InputCount()), current_(0) {
|
/art/compiler/optimizing/ |
locations.cc | 32 : inputs_(instruction->InputCount(),
|
common_arm.h | 140 DCHECK_EQ(instr->InputCount(), 1u); 154 DCHECK_EQ(instr->InputCount(), 1u);
|
dead_code_elimination.cc | 208 // Note that phi->InputCount() may change inside the loop. 209 for (size_t i = 0; i < phi->InputCount();) { 245 if (phi->InputCount() == 1) {
|
prepare_for_register_allocation.cc | 189 DCHECK_EQ(1u, constructor_fence->InputCount());
|