HomeSort by relevance Sort by last modified time
    Searched full:input_count (Results 1 - 25 of 33) sorted by null

1 2

  /external/v8/src/compiler/
operator.cc 15 int input_count, int output_count,
18 input_count_(input_count),
value-numbering-reducer-unittest.cc 66 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) {
67 const SimpleOperator op1(static_cast<Operator::Opcode>(input_count),
69 static_cast<int>(input_count), 1, "op");
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs);
74 const SimpleOperator op2(static_cast<Operator::Opcode>(input_count),
76 static_cast<int>(input_count), 1, "op");
77 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs);
94 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) {
96 static_cast<int>(input_count), 1, "op1");
97 Node* n = graph()->NewNode(&op1, static_cast<int>(input_count), inputs)
    [all...]
graph.cc 24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) {
25 DCHECK_LE(op->InputCount(), input_count);
26 Node* result = Node::New(this, input_count, inputs);
generic-node-inl.h 19 GenericNode<B, S>::GenericNode(GenericGraphBase* graph, int input_count)
21 input_count_(input_count),
226 S* GenericNode<B, S>::New(GenericGraphBase* graph, int input_count,
229 size_t inputs_size = input_count * sizeof(Input);
230 size_t uses_size = input_count * sizeof(Use);
234 S* result = new (buffer) S(graph, input_count);
240 for (int current = 0; current < input_count; ++current) {
simplified-operator.cc 133 #define PURE(Name, properties, input_count) \
137 input_count, 1, #Name) {} \
153 #define PURE(Name, properties, input_count) \
167 #define ACCESS(Name, Type, properties, input_count, output_count) \
171 input_count, output_count, #Name, access); \
node.h 52 Node(GenericGraphBase* graph, int input_count)
53 : GenericNode<NodeData, Node>(graph, input_count) {}
raw-machine-assembler.cc 152 Node* RawMachineAssembler::MakeNode(const Operator* op, int input_count,
156 Node* node = graph()->NewNode(op, input_count, inputs);
instruction-selector.cc 94 size_t input_count = arraysize(inputs); local
95 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
108 size_t input_count = arraysize(inputs); local
109 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
120 size_t input_count = arraysize(inputs); local
121 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
128 size_t input_count, InstructionOperand** inputs, size_t temp_count,
132 input_count, inputs, temp_count, temps);
245 pushed_nodes.reserve(input_count());
246 instruction_args.reserve(input_count() + frame_state_value_count())
325 size_t input_count = static_cast<size_t>(buffer->input_count()); local
    [all...]
generic-node.h 60 inline void TrimInputCount(int input_count);
95 static S* New(GenericGraphBase* graph, int input_count, S** inputs);
131 GenericNode(GenericGraphBase* graph, int input_count);
machine-operator.cc 144 #define PURE(Name, properties, input_count, output_count) \
148 input_count, output_count, #Name) {} \
199 #define PURE(Name, properties, input_count, output_count) \
operator.h 110 SimpleOperator(Opcode opcode, Properties properties, int input_count,
217 Operator1(Opcode opcode, Properties properties, int input_count,
220 input_count_(input_count),
graph.h 28 Node* NewNode(const Operator* op, int input_count, Node** inputs);
instruction.h 444 size_t input_count, InstructionOperand** inputs,
448 DCHECK(input_count == 0 || inputs != NULL);
453 (output_count + input_count + temp_count - 1) *
456 opcode, output_count, outputs, input_count, inputs, temp_count, temps);
508 InstructionOperand** outputs, size_t input_count,
513 InputCountField::encode(input_count) |
520 for (size_t i = 0; i < input_count; ++i) {
524 operands_[output_count + input_count + i] = temps[i];
verifier.cc 72 int input_count = value_count + context_count + frame_state_count + local
74 CHECK_EQ(input_count, node->InputCount());
132 CHECK_EQ(0, input_count);
173 CHECK_EQ(1, input_count);
190 CHECK_EQ(0, input_count);
simplified-operator-unittest.cc 42 #define PURE(Name, properties, input_count) \
45 Operator::kPure | properties, input_count \
  /frameworks/base/media/mca/filterpacks/native/imageproc/
to_rgba.c 23 int input_count,
28 if (input_count != 1)
54 int input_count,
59 if (input_count != 1)
86 int input_count,
91 if (input_count != 1)
118 int input_count,
123 if (input_count != 1)
invert.c 23 int input_count,
28 if (input_count != 1)
brightness.c 51 int input_count,
56 if (input_count != 1) {
57 LOGE("Brightness: Incorrect input count! Expected 1 but got %d!", input_count);
contrast.c 46 int input_count,
51 if (input_count != 1) {
52 LOGE("Contrast: Incorrect input count! Expected 1 but got %d!", input_count);
  /external/v8/src/compiler/arm/
instruction-selector-arm.cc 235 size_t input_count = 0; local
240 &input_count, &inputs[1])) {
242 input_count++;
244 m.left().node(), &input_count,
248 input_count++;
251 inputs[input_count++] = g.UseRegister(m.left().node());
252 inputs[input_count++] = g.UseRegister(m.right().node());
256 inputs[input_count++] = g.Label(cont->true_block());
257 inputs[input_count++] = g.Label(cont->false_block());
265 DCHECK_NE(0, input_count);
267 DCHECK_GE(arraysize(inputs), input_count); local
479 size_t input_count = 2; local
497 DCHECK_GE(arraysize(inputs), input_count); local
852 size_t input_count = 0; local
880 DCHECK_GE(arraysize(inputs), input_count); local
    [all...]
  /frameworks/base/media/mca/filterfw/jni/
jni_native_program.cpp 142 const int input_count = env->GetArrayLength(inputs); local
143 std::vector<const char*> input_buffers(input_count, NULL);
144 std::vector<int> input_sizes(input_count, 0);
145 for (int i = 0 ; i < input_count; ++i) {
jni_shader_program.cpp 106 const int input_count = env->GetArrayLength(inputs); local
107 for (int i = 0; i < input_count; ++i) {
  /external/v8/src/compiler/ia32/
instruction-selector-ia32.cc 170 size_t input_count = 0; local
178 inputs[input_count++] = g.Use(m.left().node());
179 inputs[input_count++] = g.UseImmediate(m.right().node());
181 inputs[input_count++] = g.UseRegister(m.left().node());
182 inputs[input_count++] = g.Use(m.right().node());
186 inputs[input_count++] = g.Label(cont->true_block());
187 inputs[input_count++] = g.Label(cont->false_block());
196 DCHECK_NE(0, input_count);
198 DCHECK_GE(arraysize(inputs), input_count); local
202 outputs, input_count, inputs)
    [all...]
  /external/v8/src/compiler/arm64/
instruction-selector-arm64.cc 121 size_t input_count = 0; local
125 inputs[input_count++] = g.UseRegister(m.left().node());
126 inputs[input_count++] = g.UseOperand(m.right().node(), operand_mode);
129 inputs[input_count++] = g.Label(cont->true_block());
130 inputs[input_count++] = g.Label(cont->false_block());
138 DCHECK_NE(0, input_count);
140 DCHECK_GE(arraysize(inputs), input_count); local
144 outputs, input_count, inputs);
  /external/v8/src/compiler/x64/
instruction-selector-x64.cc 182 size_t input_count = 0; local
190 inputs[input_count++] = g.Use(m.left().node());
191 inputs[input_count++] = g.UseImmediate(m.right().node());
193 inputs[input_count++] = g.UseRegister(m.left().node());
194 inputs[input_count++] = g.Use(m.right().node());
198 inputs[input_count++] = g.Label(cont->true_block());
199 inputs[input_count++] = g.Label(cont->false_block());
207 DCHECK_NE(0, input_count);
209 DCHECK_GE(arraysize(inputs), input_count); local
213 outputs, input_count, inputs)
    [all...]

Completed in 709 milliseconds

1 2