Home
last modified time | relevance | path

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

12

/external/v8/src/compiler/
Dvalue-numbering-reducer-unittest.cc66 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) { in TEST_F()
67 const SimpleOperator op1(static_cast<Operator::Opcode>(input_count), in TEST_F()
69 static_cast<int>(input_count), 1, "op"); in TEST_F()
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F()
74 const SimpleOperator op2(static_cast<Operator::Opcode>(input_count), in TEST_F()
76 static_cast<int>(input_count), 1, "op"); in TEST_F()
77 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs); in TEST_F()
94 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) { in TEST_F()
96 static_cast<int>(input_count), 1, "op1"); in TEST_F()
97 Node* n = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F()
[all …]
Dgraph.cc24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) { in NewNode() argument
25 DCHECK_LE(op->InputCount(), input_count); in NewNode()
26 Node* result = Node::New(this, input_count, inputs); in NewNode()
Dsimplified-operator.cc133 #define PURE(Name, properties, input_count) \ argument
137 input_count, 1, #Name) {} \
153 #define PURE(Name, properties, input_count) \ argument
167 #define ACCESS(Name, Type, properties, input_count, output_count) \ argument
171 input_count, output_count, #Name, access); \
Dgeneric-node-inl.h19 GenericNode<B, S>::GenericNode(GenericGraphBase* graph, int input_count) in GenericNode() argument
21 input_count_(input_count), in GenericNode()
226 S* GenericNode<B, S>::New(GenericGraphBase* graph, int input_count, in New() argument
229 size_t inputs_size = input_count * sizeof(Input); in New()
230 size_t uses_size = input_count * sizeof(Use); in New()
234 S* result = new (buffer) S(graph, input_count); in New()
240 for (int current = 0; current < input_count; ++current) { in New()
Doperator.cc15 int input_count, int output_count, in SimpleOperator() argument
18 input_count_(input_count), in SimpleOperator()
Dinstruction-selector.cc94 size_t input_count = arraysize(inputs); in Emit() local
95 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
108 size_t input_count = arraysize(inputs); in Emit() local
109 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
120 size_t input_count = arraysize(inputs); in Emit() local
121 return Emit(opcode, output_count, &output, input_count, inputs, temp_count, in Emit()
128 size_t input_count, InstructionOperand** inputs, size_t temp_count, in Emit() argument
132 input_count, inputs, temp_count, temps); in Emit()
245 pushed_nodes.reserve(input_count()); in CallBuffer()
246 instruction_args.reserve(input_count() + frame_state_value_count()); in CallBuffer()
[all …]
Dnode.h52 Node(GenericGraphBase* graph, int input_count) in Node() argument
53 : GenericNode<NodeData, Node>(graph, input_count) {} in Node()
Doperator.h110 SimpleOperator(Opcode opcode, Properties properties, int input_count,
217 Operator1(Opcode opcode, Properties properties, int input_count,
220 input_count_(input_count),
Dinstruction.h444 size_t input_count, InstructionOperand** inputs, in New() argument
448 DCHECK(input_count == 0 || inputs != NULL); in New()
453 (output_count + input_count + temp_count - 1) * in New()
456 opcode, output_count, outputs, input_count, inputs, temp_count, temps); in New()
508 InstructionOperand** outputs, size_t input_count, in Instruction() argument
513 InputCountField::encode(input_count) | in Instruction()
520 for (size_t i = 0; i < input_count; ++i) { in Instruction()
524 operands_[output_count + input_count + i] = temps[i]; in Instruction()
Dverifier.cc72 int input_count = value_count + context_count + frame_state_count + in Pre() local
74 CHECK_EQ(input_count, node->InputCount()); in Pre()
132 CHECK_EQ(0, input_count); in Pre()
173 CHECK_EQ(1, input_count); in Pre()
190 CHECK_EQ(0, input_count); in Pre()
Dgeneric-node.h60 inline void TrimInputCount(int input_count);
95 static S* New(GenericGraphBase* graph, int input_count, S** inputs);
131 GenericNode(GenericGraphBase* graph, int input_count);
Dmachine-operator.cc144 #define PURE(Name, properties, input_count, output_count) \ argument
148 input_count, output_count, #Name) {} \
199 #define PURE(Name, properties, input_count, output_count) \ argument
Draw-machine-assembler.cc152 Node* RawMachineAssembler::MakeNode(const Operator* op, int input_count, in MakeNode() argument
156 Node* node = graph()->NewNode(op, input_count, inputs); in MakeNode()
Dsimplified-operator-unittest.cc42 #define PURE(Name, properties, input_count) \ argument
45 Operator::kPure | properties, input_count \
Dschedule.h97 BasicBlock(GenericGraphBase* graph, int input_count) in BasicBlock() argument
98 : GenericNode<BasicBlockData, BasicBlock>(graph, input_count) {} in BasicBlock()
Dgraph.h28 Node* NewNode(const Operator* op, int input_count, Node** inputs);
Dmachine-operator-unittest.cc185 #define PURE(Name, input_count, output_count) \ argument
187 &MachineOperatorBuilder::Name, IrOpcode::k##Name, input_count, \
Dinstruction-selector.h56 InstructionOperand** outputs, size_t input_count,
Dinstruction-selector-impl.h344 size_t input_count() const { return descriptor->InputCount(); } in input_count() function
/external/v8/src/compiler/arm/
Dinstruction-selector-arm.cc235 size_t input_count = 0; in VisitBinop() local
240 &input_count, &inputs[1])) { in VisitBinop()
242 input_count++; in VisitBinop()
244 m.left().node(), &input_count, in VisitBinop()
248 input_count++; in VisitBinop()
251 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
252 inputs[input_count++] = g.UseRegister(m.right().node()); in VisitBinop()
256 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
257 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
265 DCHECK_NE(0, input_count); in VisitBinop()
[all …]
/external/v8/src/compiler/ia32/
Dinstruction-selector-ia32.cc170 size_t input_count = 0; in VisitBinop() local
178 inputs[input_count++] = g.Use(m.left().node()); in VisitBinop()
179 inputs[input_count++] = g.UseImmediate(m.right().node()); in VisitBinop()
181 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
182 inputs[input_count++] = g.Use(m.right().node()); in VisitBinop()
186 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
187 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
196 DCHECK_NE(0, input_count); in VisitBinop()
198 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
202 outputs, input_count, inputs); in VisitBinop()
/external/v8/src/compiler/x64/
Dinstruction-selector-x64.cc182 size_t input_count = 0; in VisitBinop() local
190 inputs[input_count++] = g.Use(m.left().node()); in VisitBinop()
191 inputs[input_count++] = g.UseImmediate(m.right().node()); in VisitBinop()
193 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
194 inputs[input_count++] = g.Use(m.right().node()); in VisitBinop()
198 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
199 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
207 DCHECK_NE(0, input_count); in VisitBinop()
209 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
213 outputs, input_count, inputs); in VisitBinop()
/external/v8/src/compiler/arm64/
Dinstruction-selector-arm64.cc121 size_t input_count = 0; in VisitBinop() local
125 inputs[input_count++] = g.UseRegister(m.left().node()); in VisitBinop()
126 inputs[input_count++] = g.UseOperand(m.right().node(), operand_mode); in VisitBinop()
129 inputs[input_count++] = g.Label(cont->true_block()); in VisitBinop()
130 inputs[input_count++] = g.Label(cont->false_block()); in VisitBinop()
138 DCHECK_NE(0, input_count); in VisitBinop()
140 DCHECK_GE(arraysize(inputs), input_count); in VisitBinop()
144 outputs, input_count, inputs); in VisitBinop()
/external/lldb/source/Commands/
DCommandObjectThread.cpp79 int32_t input_count = Args::StringToSInt32 (option_arg, -1, 0, &success); in SetOptionValue() local
82 if (input_count < -1) in SetOptionValue()
85 m_count = input_count; in SetOptionValue()
/external/v8/test/cctest/compiler/
Dtest-node.cc73 int input_count = 0; in TEST() local
75 input_count++; in TEST()
77 CHECK_EQ(0, input_count); in TEST()

12