Home
last modified time | relevance | path

Searched refs:input_count (Results 1 – 25 of 49) sorted by relevance

12

/external/v8/src/compiler/
Ddead-code-elimination.cc41 int const input_count = node->InputCount(); in ReduceEnd() local
42 DCHECK_LE(1, input_count); in ReduceEnd()
44 for (int i = 0; i < input_count; ++i) { in ReduceEnd()
54 } else if (live_input_count < input_count) { in ReduceEnd()
59 DCHECK_EQ(input_count, live_input_count); in ReduceEnd()
66 int const input_count = node->InputCount(); in ReduceLoopOrMerge() local
67 DCHECK_LE(1, input_count); in ReduceLoopOrMerge()
75 for (int i = 0; i < input_count; ++i) { in ReduceLoopOrMerge()
84 DCHECK_EQ(input_count + 1, use->InputCount()); in ReduceLoopOrMerge()
107 DCHECK_LE(live_input_count, input_count); in ReduceLoopOrMerge()
[all …]
Dcommon-operator.cc352 #define CACHED_END(input_count) \ argument
353 EndOperator<input_count> kEnd##input_count##Operator;
365 #define CACHED_RETURN(input_count) \ argument
366 ReturnOperator<input_count> kReturn##input_count##Operator;
391 #define CACHED_EFFECT_PHI(input_count) \ argument
392 EffectPhiOperator<input_count> kEffectPhi##input_count##Operator;
418 #define CACHED_LOOP(input_count) \ argument
419 LoopOperator<input_count> kLoop##input_count##Operator;
431 #define CACHED_MERGE(input_count) \ argument
432 MergeOperator<input_count> kMerge##input_count##Operator;
[all …]
Dnode.cc52 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count, in New() argument
61 for (int i = 0; i < input_count; i++) { in New()
69 if (input_count > kMaxInlineCapacity) { in New()
72 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count; in New()
81 outline->count_ = input_count; in New()
88 int capacity = input_count; in New()
91 capacity = std::min(input_count + 3, max); in New()
99 node = new (node_buffer) Node(id, op, input_count, capacity); in New()
106 for (int current = 0; current < input_count; ++current) { in New()
120 int const input_count = node->InputCount(); in Clone() local
[all …]
Dcontrol-flow-optimizer.cc159 int const input_count = merge->op()->ControlInputCount(); in TryCloneBranch() local
160 DCHECK_LE(1, input_count); in TryCloneBranch()
161 Node** const inputs = zone()->NewArray<Node*>(2 * input_count); in TryCloneBranch()
163 Node** const merge_false_inputs = &inputs[input_count]; in TryCloneBranch()
164 for (int index = 0; index < input_count; ++index) { in TryCloneBranch()
172 Node* const merge_true = graph()->NewNode(common()->Merge(input_count), in TryCloneBranch()
173 input_count, merge_true_inputs); in TryCloneBranch()
174 Node* const merge_false = graph()->NewNode(common()->Merge(input_count), in TryCloneBranch()
175 input_count, merge_false_inputs); in TryCloneBranch()
177 for (int index = 0; index < input_count; ++index) { in TryCloneBranch()
[all …]
Draw-machine-assembler.cc148 int input_count = param_count + 1; in CallN() local
149 Node** buffer = zone()->NewArray<Node*>(input_count); in CallN()
155 return AddNode(common()->Call(desc), input_count, buffer); in CallN()
165 int input_count = param_count + 2; in CallNWithFrameState() local
166 Node** buffer = zone()->NewArray<Node*>(input_count); in CallNWithFrameState()
173 return AddNode(common()->Call(desc), input_count, buffer); in CallNWithFrameState()
257 int input_count = param_count + 1; in TailCallN() local
258 Node** buffer = zone()->NewArray<Node*>(input_count); in TailCallN()
264 Node* tail_call = MakeNode(common()->TailCall(desc), input_count, buffer); in TailCallN()
467 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count, in Phi() argument
[all …]
Dgraph.cc45 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, in NewNode() argument
47 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete); in NewNode()
52 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, in NewNodeUnchecked() argument
55 Node::New(zone(), NextNodeId(), op, input_count, inputs, incomplete); in NewNodeUnchecked()
Dcommon-operator-reducer.cc192 int const input_count = node->InputCount() - 1; in ReduceEffectPhi() local
193 DCHECK_LE(1, input_count); in ReduceEffectPhi()
194 Node* const merge = node->InputAt(input_count); in ReduceEffectPhi()
196 DCHECK_EQ(input_count, merge->InputCount()); in ReduceEffectPhi()
199 for (int i = 1; i < input_count; ++i) { in ReduceEffectPhi()
216 int const input_count = node->InputCount() - 1; in ReducePhi() local
217 DCHECK_LE(1, input_count); in ReducePhi()
218 Node* const merge = node->InputAt(input_count); in ReducePhi()
220 DCHECK_EQ(input_count, merge->InputCount()); in ReducePhi()
221 if (input_count == 2) { in ReducePhi()
[all …]
Dinstruction-selector.cc148 size_t input_count = arraysize(inputs); in Emit() local
149 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
162 size_t input_count = arraysize(inputs); in Emit() local
163 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
174 size_t input_count = arraysize(inputs); in Emit() local
175 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
186 size_t input_count = arraysize(inputs); in Emit() local
187 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
199 size_t input_count = arraysize(inputs); in Emit() local
200 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
[all …]
Dverifier.cc119 int input_count = value_count + context_count + frame_state_count; in Check() local
121 input_count += effect_count + control_count; in Check()
123 CHECK_EQ(input_count, node->InputCount()); in Check()
179 CHECK_EQ(0, input_count); in Check()
275 CHECK_EQ(control_count, input_count); in Check()
298 CHECK_EQ(2, input_count); in Check()
313 CHECK_EQ(2, input_count); in Check()
322 CHECK_EQ(1, input_count); in Check()
336 CHECK_EQ(0, input_count); in Check()
342 CHECK_EQ(0, input_count); in Check()
[all …]
Dredundancy-elimination.cc155 int const input_count = node->op()->EffectInputCount(); in ReduceEffectPhi() local
156 for (int i = 0; i < input_count; ++i) { in ReduceEffectPhi()
165 for (int i = 1; i < input_count; ++i) { in ReduceEffectPhi()
Djs-inlining.cc161 int const input_count = static_cast<int>(controls.size()); in InlineCall() local
163 jsgraph_->common()->Merge(input_count), input_count, &controls.front()); in InlineCall()
167 jsgraph_->common()->Phi(MachineRepresentation::kTagged, input_count), in InlineCall()
170 jsgraph_->common()->EffectPhi(input_count), in InlineCall()
Dstate-values-utils.cc112 int input_count = static_cast<int>(count); in GetValuesNodeFromCache() local
113 node = graph()->NewNode(common()->StateValues(input_count), input_count, in GetValuesNodeFromCache()
Dgraph.h56 Node* NewNodeUnchecked(const Operator* op, int input_count,
60 Node* NewNode(const Operator* op, int input_count, Node* const* inputs,
/external/v8/test/unittests/compiler/
Dvalue-numbering-reducer-unittest.cc80 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) { in TEST_F()
81 const TestOperator op1(static_cast<Operator::Opcode>(input_count), in TEST_F()
82 Operator::kIdempotent, input_count, 1); in TEST_F()
83 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F()
87 const TestOperator op2(static_cast<Operator::Opcode>(input_count), in TEST_F()
88 Operator::kIdempotent, input_count, 1); in TEST_F()
89 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs); in TEST_F()
105 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) { in TEST_F()
106 const TestOperator op1(1, Operator::kIdempotent, input_count, 1); in TEST_F()
107 Node* n = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F()
[all …]
Ddead-code-elimination-unittest.cc154 TRACED_FORRANGE(int, input_count, 1, kMaxInputs - 1) { in TEST_F()
155 for (int i = 0; i < input_count; ++i) { in TEST_F()
159 graph()->NewNode(common()->End(input_count), input_count, inputs)); in TEST_F()
172 TRACED_FORRANGE(int, input_count, 1, kMaxInputs - 1) { in TEST_F()
173 for (int i = 0; i < input_count; ++i) { in TEST_F()
177 graph()->NewNode(common()->Merge(input_count), input_count, inputs)); in TEST_F()
242 TRACED_FORRANGE(int, input_count, 1, kMaxInputs - 1) { in TEST_F()
244 for (int i = 1; i < input_count; ++i) { in TEST_F()
248 graph()->NewNode(common()->Loop(input_count), input_count, inputs)); in TEST_F()
257 TRACED_FORRANGE(int, input_count, 1, kMaxInputs - 1) { in TEST_F()
[all …]
Dcommon-operator-unittest.cc174 TRACED_FOREACH(size_t, input_count, kInputCounts) { in TEST_F()
175 const Operator* const op = common()->End(input_count); in TEST_F()
180 EXPECT_EQ(input_count, static_cast<uint32_t>(op->ControlInputCount())); in TEST_F()
181 EXPECT_EQ(input_count, static_cast<uint32_t>( in TEST_F()
191 TRACED_FOREACH(int, input_count, kArguments) { in TEST_F()
192 const Operator* const op = common()->Return(input_count); in TEST_F()
195 EXPECT_EQ(input_count, op->ValueInputCount()); in TEST_F()
198 EXPECT_EQ(2 + input_count, OperatorProperties::GetTotalInputCount(op)); in TEST_F()
Dinstruction-sequence-unittest.cc170 size_t input_count = 0; in Phi() local
171 for (; input_count < arraysize(inputs); ++input_count) { in Phi()
172 if (inputs[input_count].value_ == kNoValue) break; in Phi()
174 CHECK(input_count > 0); in Phi()
175 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); in Phi()
176 for (size_t i = 0; i < input_count; ++i) { in Phi()
185 size_t input_count) { in Phi() argument
186 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count); in Phi()
/external/v8/src/compiler/ia32/
Dinstruction-selector-ia32.cc86 size_t* input_count) { in GenerateMemoryOperandInputs() argument
98 inputs[(*input_count)++] = UseRegister(base); in GenerateMemoryOperandInputs()
101 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
103 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
116 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
123 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
125 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
135 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
144 size_t* input_count) { in GetEffectiveAddressMemoryOperand() argument
149 m.displacement(), inputs, input_count); in GetEffectiveAddressMemoryOperand()
[all …]
/external/v8/src/compiler/x87/
Dinstruction-selector-x87.cc90 size_t* input_count) { in GenerateMemoryOperandInputs() argument
102 inputs[(*input_count)++] = UseRegister(base); in GenerateMemoryOperandInputs()
105 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
107 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
120 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
127 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
129 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
139 inputs[(*input_count)++] = TempImmediate(displacement); in GenerateMemoryOperandInputs()
148 size_t* input_count) { in GetEffectiveAddressMemoryOperand() argument
153 m.displacement(), inputs, input_count); in GetEffectiveAddressMemoryOperand()
[all …]
/external/v8/src/compiler/x64/
Dinstruction-selector-x64.cc74 size_t* input_count) { in GenerateMemoryOperandInputs() argument
77 inputs[(*input_count)++] = UseRegister(base); in GenerateMemoryOperandInputs()
80 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
82 inputs[(*input_count)++] = UseImmediate(displacement); in GenerateMemoryOperandInputs()
95 inputs[(*input_count)++] = UseImmediate(displacement); in GenerateMemoryOperandInputs()
102 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
104 inputs[(*input_count)++] = UseImmediate(displacement); in GenerateMemoryOperandInputs()
114 inputs[(*input_count)++] = UseRegister(index); in GenerateMemoryOperandInputs()
123 size_t* input_count) { in GetEffectiveAddressMemoryOperand() argument
128 m.displacement(), inputs, input_count); in GetEffectiveAddressMemoryOperand()
[all …]
/external/v8/src/compiler/arm/
Dinstruction-selector-arm.cc218 size_t input_count = 0; in VisitBinop() local
232 inputs[input_count++] = input; in VisitBinop()
233 inputs[input_count++] = input; in VisitBinop()
235 &input_count, &inputs[1])) { in VisitBinop()
237 input_count++; in VisitBinop()
239 m.left().node(), &input_count, in VisitBinop()
243 input_count++; in VisitBinop()
246 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
247 inputs[input_count++] = g.UseRegister(m.right().node()); in VisitBinop()
251 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
[all …]
/external/v8/src/compiler/arm64/
Dinstruction-selector-arm64.cc332 size_t input_count = 0; in VisitBinop() local
345 inputs[input_count++] = g.UseRegister(left_node); in VisitBinop()
346 inputs[input_count++] = g.UseImmediate(right_node); in VisitBinop()
349 inputs[input_count++] = g.UseRegister(right_node); in VisitBinop()
350 inputs[input_count++] = g.UseImmediate(left_node); in VisitBinop()
354 input_count += 2; in VisitBinop()
359 input_count += 2; in VisitBinop()
363 inputs[input_count++] = g.UseRegisterOrImmediateZero(left_node); in VisitBinop()
364 inputs[input_count++] = g.UseRegister(m_shift.left().node()); in VisitBinop()
365 inputs[input_count++] = g.UseImmediate(m_shift.right().node()); in VisitBinop()
[all …]
/external/v8/src/compiler/s390/
Dinstruction-selector-s390.cc119 size_t input_count = 0; in VisitBinop() local
123 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
124 inputs[input_count++] = g.UseOperand(m.right().node(), operand_mode); in VisitBinop()
127 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
128 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
136 DCHECK_NE(0u, input_count); in VisitBinop()
138 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
143 selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs, in VisitBinop()
146 selector->Emit(opcode, output_count, outputs, input_count, inputs); in VisitBinop()
227 size_t input_count = 0; in VisitStore() local
[all …]
/external/v8/src/compiler/ppc/
Dinstruction-selector-ppc.cc125 size_t input_count = 0; in VisitBinop() local
129 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
130 inputs[input_count++] = g.UseOperand(m.right().node(), operand_mode); in VisitBinop()
133 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
134 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
142 DCHECK_NE(0u, input_count); in VisitBinop()
144 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
149 selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs, in VisitBinop()
152 selector->Emit(opcode, output_count, outputs, input_count, inputs); in VisitBinop()
236 size_t input_count = 0; in VisitStore() local
[all …]
/external/v8/src/compiler/mips/
Dinstruction-selector-mips.cc95 size_t input_count = 0; in VisitBinop() local
99 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
100 inputs[input_count++] = g.UseOperand(m.right().node(), opcode); in VisitBinop()
103 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
104 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
112 DCHECK_NE(0u, input_count); in VisitBinop()
114 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
119 selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs, in VisitBinop()
122 selector->Emit(opcode, output_count, outputs, input_count, inputs); in VisitBinop()
194 size_t input_count = 0; in VisitStore() local
[all …]

12