| /art/compiler/optimizing/ |
| D | induction_var_analysis.cc | 411 InductionInfo* initial = LookupInfo(loop, phi->InputAt(0)); in ClassifyNonTrivial() local
412 if (initial == nullptr || initial->induction_class != kInvariant) { in ClassifyNonTrivial()
429 initial, in ClassifyNonTrivial()
465 HInstruction* divc = GetShiftConstant(loop, instruction, initial); in ClassifyNonTrivial()
493 induction = CreateInduction(kLinear, kNop, induction, initial, /*fetch*/ nullptr, type_); in ClassifyNonTrivial()
712 InductionInfo* initial = LookupInfo(loop, entry_phi->InputAt(0)); in SolvePhiAllInputs() local
713 return CreateInduction(kPeriodic, kNop, a, initial, /*fetch*/ nullptr, type_); in SolvePhiAllInputs()
751 InductionInfo* initial = LookupInfo(loop, entry_phi->InputAt(0)); in SolveAddSub() local
754 return CreateInduction(kPolynomial, kNop, new_a, initial, /*fetch*/ nullptr, type_); in SolveAddSub()
772 InductionInfo* initial = LookupInfo(loop, entry_phi->InputAt(0)); in SolveAddSub() local
[all …]
|
| D | nodes.cc | 961 void HBasicBlock::ReplaceAndRemovePhiWith(HPhi* initial, HPhi* replacement) { in ReplaceAndRemovePhiWith() argument
962 DCHECK(initial->GetBlock() == this); in ReplaceAndRemovePhiWith()
963 InsertPhiAfter(replacement, initial); in ReplaceAndRemovePhiWith()
964 initial->ReplaceWith(replacement); in ReplaceAndRemovePhiWith()
965 RemovePhi(initial); in ReplaceAndRemovePhiWith()
968 void HBasicBlock::ReplaceAndRemoveInstructionWith(HInstruction* initial, in ReplaceAndRemoveInstructionWith() argument
970 DCHECK(initial->GetBlock() == this); in ReplaceAndRemoveInstructionWith()
971 if (initial->IsControlFlow()) { in ReplaceAndRemoveInstructionWith()
976 DCHECK_EQ(initial->GetBlock(), this); in ReplaceAndRemoveInstructionWith()
977 DCHECK_EQ(initial->GetType(), DataType::Type::kVoid); in ReplaceAndRemoveInstructionWith()
[all …]
|
| D | bounds_check_elimination_test.cc | 360 int initial, in BuildSSAGraph1() argument
370 HInstruction* constant_initial = graph->GetIntConstant(initial); in BuildSSAGraph1()
475 int initial, in BuildSSAGraph2() argument
485 HInstruction* constant_initial = graph->GetIntConstant(initial); in BuildSSAGraph2()
585 int initial, in BuildSSAGraph3() argument
593 HInstruction* constant_initial = graph->GetIntConstant(initial); in BuildSSAGraph3()
688 int initial, in BuildSSAGraph4() argument
697 HInstruction* constant_initial = graph->GetIntConstant(initial); in BuildSSAGraph4()
|
| D | induction_var_analysis.h | 243 InductionInfo* initial);
|
| D | induction_var_range_test.cc | 221 int32_t initial, in CreateWrapAround() argument
225 CreateConst(initial), in CreateWrapAround()
232 HInductionVarAnalysis::InductionInfo* CreateWrapAround(int32_t initial, int32_t lo, int32_t hi) { in CreateWrapAround() argument
233 return CreateWrapAround(initial, CreateRange(lo, hi)); in CreateWrapAround()
|
| D | bounds_check_elimination.cc | 371 HInstruction* initial, in MonotonicValueRange() argument
378 initial_(initial), in MonotonicValueRange()
|
| D | nodes.h | 1222 void ReplaceAndRemovePhiWith(HPhi* initial, HPhi* replacement);
1224 void ReplaceAndRemoveInstructionWith(HInstruction* initial,
|
| /art/test/522-checker-regression-monitor-exit/smali/ |
| D | Test.smali | 20 ## CHECK-START: int Test.synchronizedHashCode(java.lang.Object) dead_code_elimination$initial (befo…
24 ## CHECK-START: int Test.synchronizedHashCode(java.lang.Object) dead_code_elimination$initial (afte…
|
| /art/test/996-breakpoint-obsolete/ |
| D | expected.txt | 12 Setting initial breakpoint on redefined method.
|
| /art/test/588-checker-irreducib-lifetime-hole/smali/ |
| D | IrreducibleLoop.smali | 19 ## CHECK-START-X86: int IrreducibleLoop.simpleLoop1(int) dead_code_elimination$initial (before)
59 ## CHECK-START-X86: int IrreducibleLoop.simpleLoop2(int) dead_code_elimination$initial (before)
|
| /art/test/802-deoptimization/smali/ |
| D | catch_handler_on_entry.smali | 14 # return its result: this is the initial value of v1 because "v1 = v1 / 1".
|
| /art/test/1949-short-dex-file/ |
| D | info.txt | 20 This test tries to get the JIT to read out-of-bounds on the initial dex file by getting it to
|
| /art/test/559-checker-irreducible-loop/smali/ |
| D | IrreducibleLoop.smali | 31 ## CHECK-START: int IrreducibleLoop.simpleLoop(int) dead_code_elimination$initial (before)
68 ## CHECK-START: int IrreducibleLoop.lse(int, Main) dead_code_elimination$initial (after)
104 ## CHECK-START: int IrreducibleLoop.dce(int) dead_code_elimination$initial (before)
107 ## CHECK-START: int IrreducibleLoop.dce(int) dead_code_elimination$initial (after)
|
| /art/test/564-checker-irreducible-loop/smali/ |
| D | IrreducibleLoop.smali | 19 ## CHECK-START-X86: int IrreducibleLoop.simpleLoop(int) dead_code_elimination$initial (before)
|
| /art/test/046-reflect/ |
| D | expected.txt | 47 pubLong initial value is 1122334455667788
|
| /art/test/565-checker-doublenegbitwise/smali/ |
| D | SmaliTests.smali | 205 # This is a regression test. The initial logic was inserting the new bitwise
705 # This is a regression test. The initial logic was inserting the new bitwise
|
| /art/test/510-checker-try-catch/smali/ |
| D | Builder.smali | 1363 ## CHECK-START: int Builder.testSynchronized(java.lang.Object) dead_code_elimination$initial (after)
|