/external/v8/src/compiler/ |
dead-code-elimination.cc | 41 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...] |
common-operator-reducer.cc | 192 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 == 2) [all...] |
control-flow-optimizer.cc | 159 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; ++index) [all...] |
osr.cc | 235 int const input_count = end->InputCount(); local 236 for (int i = 0; i < input_count; ++i) {
|
redundancy-elimination.cc | 155 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) {
|
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.cc | 161 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),
|
memory-optimizer.cc | 432 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)) {
|
node-properties.cc | 418 int input_count = node->op()->ValueInputCount(); local 419 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...] |
verifier.cc | 119 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...] |
raw-machine-assembler.cc | 148 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, [all...] |
escape-analysis.cc | 1534 int input_count = static_cast<int>(cache_->fields().size()); local [all...] |
/external/v8/test/unittests/compiler/ |
value-numbering-reducer-unittest.cc | 80 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), inputs) [all...] |
instruction-sequence-unittest.cc | 170 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);
|
/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/opencv3/modules/video/test/ |
test_accum.cpp | 77 int i, input_count = (int)test_array[INPUT].size(); local 83 for( i = 0; i < input_count; i++ )
|
/external/v8/test/unittests/compiler/ia32/ |
instruction-selector-ia32-unittest.cc | 610 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/ |
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);
|
/art/compiler/optimizing/ |
reference_type_propagation.cc | 826 size_t input_count = instr->InputCount(); local [all...] |
/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()) 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/arm64/ |
instruction-selector-arm64.cc | 332 size_t input_count = 0; local 345 inputs[input_count++] = g.UseRegister(left_node); 346 inputs[input_count++] = g.UseImmediate(right_node); 349 inputs[input_count++] = g.UseRegister(right_node); 350 inputs[input_count++] = g.UseImmediate(left_node); 354 input_count += 2; 359 input_count += 2; 363 inputs[input_count++] = g.UseRegisterOrImmediateZero(left_node); 364 inputs[input_count++] = g.UseRegister(m_shift.left().node()); 365 inputs[input_count++] = g.UseImmediate(m_shift.right().node()) 393 DCHECK_GE(arraysize(inputs), input_count); local 458 size_t input_count = 0; local 529 size_t input_count = 0; local 565 size_t input_count = 0; local 2516 size_t input_count = 0; local [all...] |
/external/v8/src/compiler/ia32/ |
instruction-selector-ia32.cc | 86 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); 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...] |