Searched defs:inputs (Results 1 - 14 of 14) sorted by relevance
/art/compiler/optimizing/ |
H A D | pretty_printer.h | 43 HConstInputsRef inputs = instruction->GetInputs(); local 44 if (!inputs.empty()) { 47 for (const HInstruction* input : inputs) {
|
H A D | pc_relative_fixups_x86.cc | 223 HInputsRef inputs = invoke->GetInputs(); local 224 for (size_t i = 0; i < inputs.size(); i++) { 225 HConstant* input = inputs[i]->AsConstant();
|
H A D | ssa_builder.cc | 122 // Find a candidate primitive type for `phi` by merging the type of its inputs. 141 // Previous inputs were integral, this one is not but is of the same size. 159 // still discover conflict whilst typing the individual inputs in TypeInputsOfPhi. 164 // Replace inputs of `phi` to match its type. Return false if conflict is identified. 168 // We do not need to retype ambiguous inputs because they are always constructed 179 HInputsRef inputs = phi->GetInputs(); local 180 for (size_t i = 0; i < inputs.size(); ++i) { 181 HInstruction* input = inputs[i]; 202 // All inputs either matched the type of the phi or we successfully replaced 208 // Attempt to set the primitive type of `phi` to match its inputs 618 HInputsRef inputs = phi->GetInputs(); local [all...] |
H A D | ssa_liveness_analysis.cc | 109 HInputsRef inputs = current->GetInputs(); local 110 for (size_t i = 0; i < inputs.size(); ++i) { 111 HInstruction* input = inputs[i]; 128 // `input` is inlined into `current`. Walk over its inputs and record 140 // Do a post order visit, adding inputs of instructions live in the block where 146 // Set phi inputs of successors of this block corresponding to this block 157 // as inputs (verified by GraphChecker). Their raw binary value must 190 // or at the same liveness position of inputs. 210 // Process inputs of instructions. 380 HInputsRef inputs local 421 HInputsRef inputs = defined_by_->GetInputs(); local [all...] |
H A D | graph_visualizer.cc | 544 HConstInputsRef inputs = instruction->GetInputs(); local 545 if (!inputs.empty()) { 547 for (const HInstruction* input : inputs) {
|
H A D | register_allocator_linear_scan.cc | 624 // re-use the registers used by the inputs of that instruciton, based on the 630 HInputsRef inputs = defined_by->GetInputs(); local 631 for (size_t i = 0; i < inputs.size(); ++i) { 635 LiveInterval* interval = inputs[i]->GetLiveInterval()->GetLastSibling();
|
H A D | induction_var_analysis.cc | 411 // Match all phi inputs from input_index onwards exactly. 412 HInputsRef inputs = phi->GetInputs(); local 413 DCHECK_LT(input_index, inputs.size()); 414 InductionInfo* a = LookupInfo(loop, inputs[input_index]); 415 for (size_t i = input_index + 1, n = inputs.size() - adjust_input_size; i < n; i++) { 416 InductionInfo* b = LookupInfo(loop, inputs[i]); 429 // Two linear or two polynomial inputs can be combined too. Other combinations fail. 494 // but multiplied result. Two non-invariant inputs cannot be multiplied, however. 540 // Match all phi inputs from input_index onwards exactly. 541 HInputsRef inputs local [all...] |
H A D | loop_optimization.cc | 1164 HInputsRef inputs = invoke->GetInputs(); local 1165 for (size_t index = 0; index < inputs.size(); ++index) { 1166 new_invoke->SetArgumentAt(index, vector_map_->Get(inputs[index]));
|
H A D | reference_type_propagation.cc | 889 // NullConstant inputs are ignored during merging as they do not provide any useful information. 890 // If all the inputs are NullConstants then the type of the phi will be set to Object. 894 HInputsRef inputs = instr->GetInputs(); local 896 while (first_input_index_not_null < inputs.size() && 897 inputs[first_input_index_not_null]->IsNullConstant()) { 900 if (first_input_index_not_null == inputs.size()) { 901 // All inputs are NullConstants, set the type to object. 915 for (size_t i = first_input_index_not_null + 1; i < inputs.size(); i++) { 916 if (inputs[i]->IsNullConstant()) { 919 new_rti = MergeTypes(new_rti, inputs[ [all...] |
H A D | bounds_check_elimination.cc | 912 HConstInputsRef inputs = phi->GetInputs(); local 914 const HInstruction* input1 = inputs[1]; 917 for (size_t i = 2; i < inputs.size(); ++i) { 920 if (input1 != inputs[i]) {
|
H A D | code_generator.cc | 123 HConstInputsRef inputs = instruction->GetInputs(); local 124 for (size_t i = 0; i < inputs.size(); ++i) { 125 DCHECK(CheckType(inputs[i]->GetType(), locations->InAt(i))) 126 << inputs[i]->GetType() << " " << locations->InAt(i);
|
H A D | inliner.cc | 867 // Insert before setting the kind, as setting the kind affects the inputs. 1018 // that will have the `invoke_instruction and the `return_replacement` as inputs. 1239 HInputsRef inputs = invoke_instruction->GetInputs(); local 1240 for (size_t index = 0; index != inputs.size(); ++index) { 1241 new_invoke->SetArgumentAt(index, inputs[index]); 1953 // actual inputs has a more specific reference type than the type declared in 2011 // TODO: we could be more precise by merging the phi inputs but that requires
|
H A D | register_allocator_graph_color.cc | 853 // fixed inputs to a call (which will be clobbered) and other fixed inputs (which 1147 HInputsRef inputs = defined_by->GetInputs(); local 1148 for (size_t i = 0; i < inputs.size(); ++i) { 1149 if (inputs[i]->GetLiveInterval()->GetSiblingAt(def_position) == input_interval) { 1333 // Coalesce phi inputs with the corresponding output. 1337 HInputsRef inputs = defined_by->GetInputs(); local 1339 for (size_t i = 0, e = inputs.size(); i < e; ++i) { 1342 LiveInterval* input_interval = inputs[i]->GetLiveInterval()->GetSiblingAt(position); 1373 // re-use the registers used by the inputs o 1379 HInputsRef inputs = defined_by->GetInputs(); local [all...] |
H A D | nodes.cc | 769 HInputsRef inputs = instruction->GetInputs(); local 770 for (size_t i = 0; i < inputs.size(); ++i) { 771 inputs[i]->AddUseAt(instruction, i); 1136 // Update indexes in use nodes of inputs that have been pushed further back by the insert(). 1146 // Update indexes in use nodes of inputs that have been pulled forward by the erase(). 1350 HConstInputsRef inputs = GetInputs(); 1352 if (inputs.size() != other_inputs.size()) return false; 1353 for (size_t i = 0; i != inputs.size(); ++i) { 1354 if (inputs[i] != other_inputs[i]) return false; 1716 // instruction from catch phi uses, together with inputs o [all...] |
Completed in 176 milliseconds