| /art/test/551-checker-shifter-operand/src/ |
| D | Main.java | 932 long inputs[] = { in main() local
953 for (int i = 0; i < inputs.length; i++) { in main()
954 $opt$noinline$testNeg((int)inputs[i]); in main()
955 for (int j = 0; j < inputs.length; j++) { in main()
956 $opt$noinline$testAnd(inputs[i], inputs[j]); in main()
957 $opt$noinline$testOr((int)inputs[i], (int)inputs[j]); in main()
958 $opt$noinline$testXor(inputs[i], inputs[j]); in main()
960 $opt$validateExtendByte(inputs[i], (byte)inputs[j]); in main()
961 $opt$validateExtendChar(inputs[i], (char)inputs[j]); in main()
962 $opt$validateExtendShort(inputs[i], (short)inputs[j]); in main()
[all …]
|
| /art/test/472-type-propagation/ |
| D | info.txt | 2 If a phi requests its inputs to be of a certain type, the inputs need
|
| /art/test/531-regression-debugphi/smali/ |
| D | TestCase.smali | 24 # - update inputs of PrimNot PhiA
66 # - PhiA: PrimVoid + PrimNot (PrimInt inputs)
67 # - PhiB: PrimVoid + PrimNot (PrimInt inputs)
72 # - update inputs of PrimNot PhiB ; add PrimNot PhiA to worklist
75 # - PrimNot PhiA: update inputs, no equivalent created
76 # - PrimInt PhiA: update inputs, set to PrimNot, use instead of PrimNot PhiA
|
| /art/compiler/optimizing/ |
| D | pretty_printer.h | 43 HConstInputsRef inputs = instruction->GetInputs(); in PrintPostInstruction() local
44 if (!inputs.empty()) { in PrintPostInstruction()
47 for (const HInstruction* input : inputs) { in PrintPostInstruction()
|
| D | ssa_liveness_analysis.cc | 109 HInputsRef inputs = current->GetInputs(); in RecursivelyProcessInputs() local
110 for (size_t i = 0; i < inputs.size(); ++i) { in RecursivelyProcessInputs()
111 HInstruction* input = inputs[i]; in RecursivelyProcessInputs()
380 HInputsRef inputs = user->GetInputs(); in FindFirstRegisterHint() local
381 for (size_t i = 0; i < inputs.size(); ++i) { in FindFirstRegisterHint()
385 Location location = inputs[i]->GetLiveInterval()->GetLocationAt( in FindFirstRegisterHint()
421 HInputsRef inputs = defined_by_->GetInputs(); in FindHintAtDefinition() local
422 for (size_t i = 0; i < inputs.size(); ++i) { in FindHintAtDefinition()
424 LiveInterval* input_interval = inputs[i]->GetLiveInterval()->GetSiblingAt(end - 1); in FindHintAtDefinition()
|
| D | ssa_builder.cc | 179 HInputsRef inputs = phi->GetInputs(); in TypeInputsOfPhi() local
180 for (size_t i = 0; i < inputs.size(); ++i) { in TypeInputsOfPhi()
181 HInstruction* input = inputs[i]; in TypeInputsOfPhi()
618 HInputsRef inputs = phi->GetInputs(); in GetFloatDoubleOrReferenceEquivalentOfPhi() local
620 new (allocator) HPhi(allocator, phi->GetRegNumber(), inputs.size(), type); in GetFloatDoubleOrReferenceEquivalentOfPhi()
624 for (size_t i = 0; i < inputs.size(); ++i) { in GetFloatDoubleOrReferenceEquivalentOfPhi()
625 new_input_records[i] = HUserRecord<HInstruction*>(inputs[i]); in GetFloatDoubleOrReferenceEquivalentOfPhi()
|
| D | pc_relative_fixups_x86.cc | 223 HInputsRef inputs = invoke->GetInputs(); in HandleInvoke() local
224 for (size_t i = 0; i < inputs.size(); i++) { in HandleInvoke()
225 HConstant* input = inputs[i]->AsConstant(); in HandleInvoke()
|
| D | induction_var_analysis.cc | 412 HInputsRef inputs = phi->GetInputs(); in TransferPhi() local
413 DCHECK_LT(input_index, inputs.size()); in TransferPhi()
414 InductionInfo* a = LookupInfo(loop, inputs[input_index]); in TransferPhi()
415 for (size_t i = input_index + 1, n = inputs.size() - adjust_input_size; i < n; i++) { in TransferPhi()
416 InductionInfo* b = LookupInfo(loop, inputs[i]); in TransferPhi()
541 HInputsRef inputs = phi->GetInputs(); in SolvePhi() local
542 DCHECK_LT(input_index, inputs.size()); in SolvePhi()
543 auto ita = cycle_.find(inputs[input_index]); in SolvePhi()
545 for (size_t i = input_index + 1, n = inputs.size() - adjust_input_size; i < n; i++) { in SolvePhi()
546 auto itb = cycle_.find(inputs[i]); in SolvePhi()
|
| D | reference_type_propagation.cc | 894 HInputsRef inputs = instr->GetInputs(); in UpdatePhi() local
896 while (first_input_index_not_null < inputs.size() && in UpdatePhi()
897 inputs[first_input_index_not_null]->IsNullConstant()) { in UpdatePhi()
900 if (first_input_index_not_null == inputs.size()) { in UpdatePhi()
915 for (size_t i = first_input_index_not_null + 1; i < inputs.size(); i++) { in UpdatePhi()
916 if (inputs[i]->IsNullConstant()) { in UpdatePhi()
919 new_rti = MergeTypes(new_rti, inputs[i]->GetReferenceTypeInfo()); in UpdatePhi()
|
| D | register_allocator_graph_color.cc | 1147 HInputsRef inputs = defined_by->GetInputs(); in CheckInputOutputCanOverlap() local
1148 for (size_t i = 0; i < inputs.size(); ++i) { in CheckInputOutputCanOverlap()
1149 if (inputs[i]->GetLiveInterval()->GetSiblingAt(def_position) == input_interval) { in CheckInputOutputCanOverlap()
1337 HInputsRef inputs = defined_by->GetInputs(); in FindCoalesceOpportunities() local
1339 for (size_t i = 0, e = inputs.size(); i < e; ++i) { in FindCoalesceOpportunities()
1342 LiveInterval* input_interval = inputs[i]->GetLiveInterval()->GetSiblingAt(position); in FindCoalesceOpportunities()
1379 HInputsRef inputs = defined_by->GetInputs(); in FindCoalesceOpportunities() local
1380 for (size_t i = 0; i < inputs.size(); ++i) { in FindCoalesceOpportunities()
1384 LiveInterval* input_interval = inputs[i]->GetLiveInterval()->GetSiblingAt(def_point); in FindCoalesceOpportunities()
|
| D | graph_visualizer.cc | 544 HConstInputsRef inputs = instruction->GetInputs(); in PrintInstruction() local
545 if (!inputs.empty()) { in PrintInstruction()
547 for (const HInstruction* input : inputs) { in PrintInstruction()
|
| D | register_allocator_linear_scan.cc | 630 HInputsRef inputs = defined_by->GetInputs(); in TryAllocateFreeReg() local
631 for (size_t i = 0; i < inputs.size(); ++i) { in TryAllocateFreeReg()
635 LiveInterval* interval = inputs[i]->GetLiveInterval()->GetLastSibling(); in TryAllocateFreeReg()
|
| D | code_generator.cc | 123 HConstInputsRef inputs = instruction->GetInputs(); in CheckTypeConsistency() local
124 for (size_t i = 0; i < inputs.size(); ++i) { in CheckTypeConsistency()
125 DCHECK(CheckType(inputs[i]->GetType(), locations->InAt(i))) in CheckTypeConsistency()
126 << inputs[i]->GetType() << " " << locations->InAt(i); in CheckTypeConsistency()
|
| /art/test/566-checker-codegen-select/ |
| D | info.txt | 1 Test the use positions of inputs of non-materialized conditions.
|
| /art/test/565-checker-condition-liveness/ |
| D | info.txt | 1 Test the use positions of inputs of non-materialized conditions.
|
| /art/test/554-checker-rtp-checkcast/ |
| D | info.txt | 1 Tests that phis with check-casted reference type inputs are typed.
|
| /art/test/586-checker-null-array-get/ |
| D | info.txt | 2 that used to merge two array gets that have the same inputs but
|
| /art/test/800-smali/smali/ |
| D | b_27799205_1.smali | 13 # Make v0, v1 and v2 null. We'll use v0 as a merge of the inputs, v1 as null, and v2 as 0.
|
| D | b_27799205_2.smali | 13 # Make v0, v1 and v2 null. We'll use v0 as a merge of the inputs, v1 as null, and v2 as 0.
|
| D | b_27799205_4.smali | 15 # Make v0, v1 and v2 null. We'll use v0 as a merge of the inputs, v1 as null, and v2 as 0.
|
| D | b_27799205_5.smali | 15 # Make v0, v1 and v2 null. We'll use v0 as a merge of the inputs, v1 as null, and v2 as 0.
|
| D | b_27799205_3.smali | 15 # Make v0, v1 and v2 null. We'll use v0 as a merge of the inputs, v1 as null, and v2 as 0.
|
| /art/tools/jfuzz/ |
| D | README.md | 110 Mutation-based fuzz testing applies small random changes to existing inputs
113 layered approaches generate random inputs that are subsequently mutated at
|
| /art/test/552-checker-primitive-typeprop/smali/ |
| D | ArraySet.smali | 20 # on the replaced inputs.
|
| /art/test/622-simplifyifs-exception-edges/smali/ |
| D | Test.smali | 65 # of the catch Phi's inputs. For catch blocks these two arrays are unrelated, so
|