| /external/v8/src/compiler/ |
| dead-code-elimination.cc | 43 int const input_count = node->InputCount(); local
44 DCHECK_LE(1, input_count);
46 for (int i = 0; i < input_count; ++i) {
56 } else if (live_input_count < input_count) {
61 DCHECK_EQ(input_count, live_input_count);
68 int const input_count = node->InputCount(); local
69 DCHECK_LE(1, input_count);
77 for (int i = 0; i < input_count; ++i) {
86 DCHECK_EQ(input_count + 1, use->InputCount());
112 DCHECK_LE(live_input_count, input_count);
[all...] |
| common-operator-reducer.cc | 198 int const input_count = node->InputCount() - 1; local
199 DCHECK_LE(1, input_count);
200 Node* const merge = node->InputAt(input_count);
202 DCHECK_EQ(input_count, merge->InputCount());
205 for (int i = 1; i < input_count; ++i) {
222 int const input_count = node->InputCount() - 1; local
223 DCHECK_LE(1, input_count);
224 Node* const merge = node->InputAt(input_count);
226 DCHECK_EQ(input_count, merge->InputCount());
227 if (input_count == 2)
[all...] |
| redundancy-elimination.cc | 176 int const input_count = node->op()->EffectInputCount(); local
177 for (int i = 0; i < input_count; ++i) {
186 for (int i = 1; i < input_count; ++i) {
|
| state-values-utils.cc | 112 int input_count = static_cast<int>(count); local
113 node = graph()->NewNode(common()->StateValues(input_count), input_count,
|
| js-inlining-heuristic.cc | 187 int const input_count = node->InputCount(); local
188 Node** inputs = graph()->zone()->NewArray<Node*>(input_count);
189 for (int i = 0; i < input_count; ++i) {
210 inputs[input_count - 1] = if_successes[i];
211 calls[i] = graph()->NewNode(node->op(), input_count, inputs);
|
| node-properties.cc | 348 int input_count = node->op()->ValueInputCount(); local
349 for (int index = 0; index < input_count; ++index) {
|
| node.cc | 52 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count,
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; ++current)
120 int const input_count = node->InputCount(); local
153 int input_count = InputCount(); local
[all...] |
| osr.cc | 244 int const input_count = end->InputCount(); local
245 for (int i = 0; i < input_count; ++i) {
|
| verifier.cc | 107 int input_count = value_count + context_count + frame_state_count; local
109 input_count += effect_count + control_count;
111 CHECK_EQ(input_count, node->InputCount());
181 CHECK_EQ(0, input_count);
277 CHECK_EQ(control_count, input_count);
300 CHECK_EQ(2, input_count);
315 CHECK_EQ(2, input_count);
324 CHECK_EQ(1, input_count);
343 CHECK_EQ(0, input_count);
349 CHECK_EQ(0, input_count);
[all...] |
| js-inlining.cc | 208 int const input_count = static_cast<int>(controls.size()); local
209 Node* control_output = graph()->NewNode(common()->Merge(input_count),
210 input_count, &controls.front());
214 common()->Phi(MachineRepresentation::kTagged, input_count),
217 graph()->NewNode(common()->EffectPhi(input_count),
|
| load-elimination.cc | 776 int const input_count = node->op()->EffectInputCount(); local
777 for (int i = 1; i < input_count; ++i) {
785 for (int i = 1; i < input_count; ++i) {
[all...] |
| memory-optimizer.cc | 471 int const input_count = node->InputCount() - 1; local
472 DCHECK_LT(0, input_count);
473 Node* const control = node->InputAt(input_count);
489 if (it->second.size() == static_cast<size_t>(input_count)) {
|
| raw-machine-assembler.cc | 176 int input_count = param_count + 1; local
177 Node** buffer = zone()->NewArray<Node*>(input_count);
183 return AddNode(common()->Call(desc), input_count, buffer);
192 int input_count = param_count + 2; local
193 Node** buffer = zone()->NewArray<Node*>(input_count);
200 return AddNode(common()->Call(desc), input_count, buffer);
298 int input_count = param_count + 1; local
299 Node** buffer = zone()->NewArray<Node*>(input_count);
305 Node* tail_call = MakeNode(common()->TailCall(desc), input_count, buffer);
555 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count,
[all...] |
| js-native-context-specialization.cc | 1576 int const input_count = 1 + map_input_count + 1 + 1; local
[all...] |
| escape-analysis.cc | 1589 int input_count = static_cast<int>(cache_->fields().size()); local
[all...] |
| instruction-selector.cc | 156 size_t input_count = arraysize(inputs); local
157 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
170 size_t input_count = arraysize(inputs); local
171 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
182 size_t input_count = arraysize(inputs); local
183 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
194 size_t input_count = arraysize(inputs); local
195 return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
207 size_t input_count = arraysize(inputs); local
208 return Emit(opcode, output_count, &output, input_count, inputs, temp_count
501 int const input_count = input->op()->ValueInputCount(); local
615 size_t input_count() const { return descriptor->InputCount(); } function in struct:v8::internal::compiler::CallBuffer
750 size_t input_count = static_cast<size_t>(buffer->input_count()); member in namespace:v8::internal::compiler
1508 size_t input_count = 2 + sw.value_range; local
1527 size_t input_count = 2 + sw.case_count * 2; local
1772 const int input_count = node->op()->ValueInputCount(); local
1967 const int input_count = linkage()->GetIncomingDescriptor()->ReturnCount() == 0 local
1990 size_t input_count = arraysize(inputs); local
2000 size_t input_count = arraysize(inputs); local
[all...] |
| /frameworks/base/media/mca/filterfw/jni/ |
| jni_native_program.cpp | 143 const int input_count = env->GetArrayLength(inputs); local
144 std::vector<const char*> input_buffers(input_count, NULL);
145 std::vector<int> input_sizes(input_count, 0);
146 for (int i = 0 ; i < input_count; ++i) {
|
| jni_shader_program.cpp | 99 const int input_count = env->GetArrayLength(inputs); local
100 for (int i = 0; i < input_count; ++i) {
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| desktop_region_unittest.cc | 264 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/mesa3d/src/gallium/drivers/r300/ |
| r300_emit.c | 1004 unsigned input_count = MAX2(util_bitcount(code->InputsRead), 1); local
[all...] |
| /external/v8/src/compiler/arm/ |
| instruction-selector-arm.cc | 218 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++] = g.Label(cont->true_block())
262 DCHECK_GE(arraysize(inputs), input_count); local
338 size_t input_count = 2; local
434 size_t input_count = 0; local
497 size_t input_count = 0; local
532 size_t input_count; local
570 size_t input_count = 0; local
862 size_t input_count = 2; local
880 DCHECK_GE(arraysize(inputs), input_count); local
1792 size_t input_count = 0; local
1832 DCHECK_GE(arraysize(inputs), input_count); local
2244 size_t input_count = 0; local
[all...] |
| /external/v8/src/compiler/ia32/ |
| instruction-selector-ia32.cc | 87 size_t* input_count) {
102 inputs[(*input_count)++] = UseRegister(base);
105 inputs[(*input_count)++] = UseRegister(index);
107 inputs[(*input_count)++] = TempImmediate(displacement);
120 inputs[(*input_count)++] = TempImmediate(displacement);
127 inputs[(*input_count)++] = UseRegister(index);
129 inputs[(*input_count)++] = TempImmediate(displacement);
139 inputs[(*input_count)++] = TempImmediate(displacement);
148 size_t* input_count) {
154 m.displacement_mode(), inputs, input_count);
246 size_t input_count = 0; local
272 size_t input_count = 0; local
343 size_t input_count = 0; local
472 size_t input_count = 0; local
512 DCHECK_GE(arraysize(inputs), input_count); local
606 size_t input_count = 0; local
612 DCHECK_GE(arraysize(inputs), input_count); local
802 size_t input_count = 0; local
808 DCHECK_GE(arraysize(inputs), input_count); local
1191 size_t input_count = 0; local
1711 size_t input_count = 0; local
[all...] |
| /external/v8/src/compiler/mips/ |
| instruction-selector-mips.cc | 168 size_t input_count = 0; local
172 if (TryMatchImmediate(selector, &opcode, m.right().node(), &input_count,
175 input_count++;
179 &input_count, &inputs[1])) {
182 input_count++;
184 inputs[input_count++] = g.UseRegister(m.left().node());
185 inputs[input_count++] = g.UseOperand(m.right().node(), opcode);
189 inputs[input_count++] = g.Label(cont->true_block());
190 inputs[input_count++] = g.Label(cont->false_block());
205 DCHECK_NE(0u, input_count);
207 DCHECK_GE(arraysize(inputs), input_count); local
303 size_t input_count = 0; local
[all...] |
| /external/v8/src/compiler/mips64/ |
| instruction-selector-mips64.cc | 227 size_t input_count = 0; local
231 if (TryMatchImmediate(selector, &opcode, m.right().node(), &input_count,
234 input_count++;
238 &input_count, &inputs[1])) {
241 input_count++;
243 inputs[input_count++] = g.UseRegister(m.left().node());
244 inputs[input_count++] = g.UseOperand(m.right().node(), opcode);
248 inputs[input_count++] = g.Label(cont->true_block());
249 inputs[input_count++] = g.Label(cont->false_block());
264 DCHECK_NE(0u, input_count);
266 DCHECK_GE(arraysize(inputs), input_count); local
371 size_t input_count = 0; local
[all...] |
| /external/v8/src/compiler/ppc/ |
| instruction-selector-ppc.cc | 125 size_t input_count = 0; local
129 inputs[input_count++] = g.UseRegister(m.left().node());
130 inputs[input_count++] = g.UseOperand(m.right().node(), operand_mode);
133 inputs[input_count++] = g.Label(cont->true_block());
134 inputs[input_count++] = g.Label(cont->false_block());
149 DCHECK_NE(0u, input_count);
151 DCHECK_GE(arraysize(inputs), input_count); local
156 selector->EmitDeoptimize(opcode, output_count, outputs, input_count, inputs,
159 selector->Emit(opcode, output_count, outputs, input_count, inputs);
251 size_t input_count = 0 local
2070 size_t input_count = 0; local
[all...] |
