Searched defs:input_count (Results 1 - 25 of 37) sorted by relevance

12

/external/v8/src/compiler/
H A Ddead-code-elimination.cc41 int const input_count = node->InputCount(); local
42 DCHECK_LE(1, input_count);
44 for (int i = 0; i < input_count; ++i) {
54 } else if (live_input_count < input_count) {
59 DCHECK_EQ(input_count, live_input_count);
66 int const input_count = node->InputCount(); local
67 DCHECK_LE(1, input_count);
75 for (int i = 0; i < input_count; ++i) {
84 DCHECK_EQ(input_count + 1, use->InputCount());
107 DCHECK_LE(live_input_count, input_count);
[all...]
H A Dgraph.cc45 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, argument
47 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete);
52 Node* Graph::NewNodeUnchecked(const Operator* op, int input_count, argument
55 Node::New(zone(), NextNodeId(), op, input_count, inputs, incomplete);
H A Dcommon-operator-reducer.cc192 int const input_count = node->InputCount() - 1; local
193 DCHECK_LE(1, input_count);
194 Node* const merge = node->InputAt(input_count);
196 DCHECK_EQ(input_count, merge->InputCount());
199 for (int i = 1; i < input_count; ++i) {
216 int const input_count = node->InputCount() - 1; local
217 DCHECK_LE(1, input_count);
218 Node* const merge = node->InputAt(input_count);
220 DCHECK_EQ(input_count, merge->InputCount());
221 if (input_count
[all...]
H A Dcontrol-flow-optimizer.cc159 int const input_count = merge->op()->ControlInputCount(); local
160 DCHECK_LE(1, input_count);
161 Node** const inputs = zone()->NewArray<Node*>(2 * input_count);
163 Node** const merge_false_inputs = &inputs[input_count];
164 for (int index = 0; index < input_count; ++index) {
172 Node* const merge_true = graph()->NewNode(common()->Merge(input_count),
173 input_count, merge_true_inputs);
174 Node* const merge_false = graph()->NewNode(common()->Merge(input_count),
175 input_count, merge_false_inputs);
177 for (int index = 0; index < input_count;
[all...]
H A Dredundancy-elimination.cc155 int const input_count = node->op()->EffectInputCount(); local
156 for (int i = 0; i < input_count; ++i) {
165 for (int i = 1; i < input_count; ++i) {
H A Djs-inlining.cc161 int const input_count = static_cast<int>(controls.size()); local
163 jsgraph_->common()->Merge(input_count), input_count, &controls.front());
167 jsgraph_->common()->Phi(MachineRepresentation::kTagged, input_count),
170 jsgraph_->common()->EffectPhi(input_count),
H A Dnode-properties.cc418 int input_count = node->op()->ValueInputCount(); local
419 for (int index = 0; index < input_count; ++index) {
H A Dosr.cc235 int const input_count = end->InputCount(); local
236 for (int i = 0; i < input_count; ++i) {
H A Dstate-values-utils.cc112 int input_count = static_cast<int>(count); local
113 node = graph()->NewNode(common()->StateValues(input_count), input_count,
H A Dmemory-optimizer.cc432 int const input_count = node->InputCount() - 1; local
433 DCHECK_LT(0, input_count);
434 Node* const control = node->InputAt(input_count);
450 if (it->second.size() == static_cast<size_t>(input_count)) {
H A Dnode.cc52 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count, argument
61 for (int i = 0; i < input_count; i++) {
69 if (input_count > kMaxInlineCapacity) {
72 has_extensible_inputs ? input_count + kMaxInlineCapacity : input_count;
81 outline->count_ = input_count;
88 int capacity = input_count;
91 capacity = std::min(input_count + 3, max);
99 node = new (node_buffer) Node(id, op, input_count, capacity);
106 for (int current = 0; current < input_count;
120 int const input_count = node->InputCount(); local
153 int input_count = InputCount(); local
[all...]
H A Dverifier.cc119 int input_count = value_count + context_count + frame_state_count; local
121 input_count += effect_count + control_count;
123 CHECK_EQ(input_count, node->InputCount());
179 CHECK_EQ(0, input_count);
275 CHECK_EQ(control_count, input_count);
298 CHECK_EQ(2, input_count);
313 CHECK_EQ(2, input_count);
322 CHECK_EQ(1, input_count);
336 CHECK_EQ(0, input_count);
342 CHECK_EQ(0, input_count);
[all...]
H A Draw-machine-assembler.cc148 int input_count = param_count + 1; local
149 Node** buffer = zone()->NewArray<Node*>(input_count);
155 return AddNode(common()->Call(desc), input_count, buffer);
165 int input_count = param_count + 2; local
166 Node** buffer = zone()->NewArray<Node*>(input_count);
173 return AddNode(common()->Call(desc), input_count, buffer);
257 int input_count = param_count + 1; local
258 Node** buffer = zone()->NewArray<Node*>(input_count);
264 Node* tail_call = MakeNode(common()->TailCall(desc), input_count, buffer);
467 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count, argument
483 AddNode(const Operator* op, int input_count, Node* const* inputs) argument
492 MakeNode(const Operator* op, int input_count, Node* const* inputs) argument
[all...]
H A Dinstruction.cc272 InstructionOperand* outputs, size_t input_count,
277 InputCountField::encode(input_count) |
289 for (size_t i = 0; i < input_count; ++i) {
552 size_t input_count)
555 operands_(input_count, InstructionOperand::kInvalidVirtualRegister,
271 Instruction(InstructionCode opcode, size_t output_count, InstructionOperand* outputs, size_t input_count, InstructionOperand* inputs, size_t temp_count, InstructionOperand* temps) argument
551 PhiInstruction(Zone* zone, int virtual_register, size_t input_count) argument
H A Descape-analysis.cc1534 int input_count = static_cast<int>(cache_->fields().size()); local
1536 graph()->NewNode(common()->ObjectState(input_count, vobj->id()),
1537 input_count, &cache_->fields().front());
H A Dinstruction-selector.cc148 size_t input_count = arraysize(inputs); local
149 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
162 size_t input_count = arraysize(inputs); local
163 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
174 size_t input_count = arraysize(inputs); local
175 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
186 size_t input_count = arraysize(inputs); local
187 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
199 size_t input_count = arraysize(inputs); local
200 return Emit(opcode, output_count, &output, input_count, input
205 Emit( InstructionCode opcode, size_t output_count, InstructionOperand* outputs, size_t input_count, InstructionOperand* inputs, size_t temp_count, InstructionOperand* temps) argument
513 size_t input_count() const { return descriptor->InputCount(); } function in struct:v8::internal::compiler::CallBuffer
649 size_t input_count = static_cast<size_t>(buffer->input_count()); member in namespace:v8::internal::compiler
1323 size_t input_count = 2 + sw.value_range; local
1342 size_t input_count = 2 + sw.case_count * 2; local
1575 const int input_count = node->op()->ValueInputCount(); local
1836 size_t input_count = arraysize(inputs); local
1841 EmitDeoptimize( InstructionCode opcode, size_t output_count, InstructionOperand* outputs, size_t input_count, InstructionOperand* inputs, Node* frame_state) argument
[all...]
/external/v8/test/cctest/compiler/
H A Dtest-node.cc93 void CheckInputs(Node* node, Node** inputs, int input_count) { argument
94 CHECK_EQ(input_count, node->InputCount());
96 for (int i = 0; i < static_cast<int>(input_count); i++) {
108 for (int i = 0; i < static_cast<int>(input_count); i++) {
/external/v8/test/unittests/compiler/
H A Dvalue-numbering-reducer-unittest.cc80 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) {
81 const TestOperator op1(static_cast<Operator::Opcode>(input_count),
82 Operator::kIdempotent, input_count, 1); local
83 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs);
87 const TestOperator op2(static_cast<Operator::Opcode>(input_count),
88 Operator::kIdempotent, input_count, 1); local
89 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs);
105 TRACED_FORRANGE(size_t, input_count, 0, arraysize(inputs)) {
106 const TestOperator op1(1, Operator::kIdempotent, input_count, 1);
107 Node* n = graph()->NewNode(&op1, static_cast<int>(input_count), input
[all...]
H A Dinstruction-sequence-unittest.cc170 size_t input_count = 0; local
171 for (; input_count < arraysize(inputs); ++input_count) {
172 if (inputs[input_count].value_ == kNoValue) break;
174 CHECK(input_count > 0);
175 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count);
176 for (size_t i = 0; i < input_count; ++i) {
185 size_t input_count) {
186 auto phi = new (zone()) PhiInstruction(zone(), NewReg().value_, input_count);
184 Phi(VReg incoming_vreg_0, size_t input_count) argument
/external/v8/test/unittests/compiler/ia32/
H A Dinstruction-selector-ia32-unittest.cc610 unsigned input_count = InputCountForLea(s[0]->addressing_mode()); local
611 ASSERT_EQ(input_count, s[0]->InputCount());
614 s[0]->InputAt(input_count - 1)->kind());
615 EXPECT_EQ(imm, s.ToInt32(s[0]->InputAt(input_count - 1)));
/external/webrtc/webrtc/modules/desktop_capture/
H A Ddesktop_region_unittest.cc264 int input_count; member in struct:webrtc::Case
301 r.AddRects(cases[i].input_rects, cases[i].input_count);
306 for (int j = cases[i].input_count - 1; j >= 0; --j) {
375 int input_count; member in struct:webrtc::Case
396 DesktopRegion r(cases[i].input_rects, cases[i].input_count);
/external/lldb/source/Commands/
H A DCommandObjectThread.cpp79 int32_t input_count = Args::StringToSInt32 (option_arg, -1, 0, &success); local
82 if (input_count < -1)
85 m_count = input_count;
/external/mesa3d/src/gallium/drivers/r300/
H A Dr300_emit.c1004 unsigned input_count = MAX2(util_bitcount(code->InputsRead), 1); local
1008 unsigned pvs_num_slots = MIN3(vtx_mem_size / input_count,
/external/v8/src/compiler/arm/
H A Dinstruction-selector-arm.cc218 size_t input_count = 0; local
232 inputs[input_count++] = input;
233 inputs[input_count++] = input;
235 &input_count, &inputs[1])) {
237 input_count++;
239 m.left().node(), &input_count,
243 input_count++;
246 inputs[input_count++] = g.UseRegister(m.left().node());
247 inputs[input_count++] = g.UseRegister(m.right().node());
251 inputs[input_count
269 DCHECK_GE(arraysize(inputs), input_count); local
350 size_t input_count = 0; local
414 size_t input_count = 0; local
449 size_t input_count = 0; local
736 size_t input_count = 2; local
754 DCHECK_GE(arraysize(inputs), input_count); local
1571 size_t input_count = 0; local
1598 DCHECK_GE(arraysize(inputs), input_count); local
1963 size_t input_count = 0; local
[all...]
/external/v8/src/compiler/ia32/
H A Dinstruction-selector-ia32.cc86 size_t* input_count) {
98 inputs[(*input_count)++] = UseRegister(base);
101 inputs[(*input_count)++] = UseRegister(index);
103 inputs[(*input_count)++] = TempImmediate(displacement);
116 inputs[(*input_count)++] = TempImmediate(displacement);
123 inputs[(*input_count)++] = UseRegister(index);
125 inputs[(*input_count)++] = TempImmediate(displacement);
135 inputs[(*input_count)++] = TempImmediate(displacement);
144 size_t* input_count) {
149 m.displacement(), inputs, input_count);
83 GenerateMemoryOperandInputs(Node* index, int scale, Node* base, Node* displacement_node, InstructionOperand inputs[], size_t* input_count) argument
142 GetEffectiveAddressMemoryOperand(Node* node, InstructionOperand inputs[], size_t* input_count) argument
239 size_t input_count = 0; local
261 size_t input_count = 0; local
330 size_t input_count = 0; local
450 size_t input_count = 0; local
490 DCHECK_GE(arraysize(inputs), input_count); local
583 size_t input_count = 0; local
588 DCHECK_GE(arraysize(inputs), input_count); local
744 size_t input_count = 0; local
749 DCHECK_GE(arraysize(inputs), input_count); local
1150 size_t input_count = 0; local
1642 size_t input_count = 0; local
[all...]

Completed in 2028 milliseconds

12