Home
last modified time | relevance | path

Searched refs:control (Results 1 – 14 of 14) sorted by relevance

/art/tools/amm/
DREADME.md5 and control. AMM can be thought of as a Java heap dump augmented with models
6 for non-Java allocations that app developers have some control of.
/art/test/402-optimizing-control-flow/
Dinfo.txt1 A set of tests for testing control flow instructions on the optimizing compiler.
/art/test/081-hot-exceptions/
Dinfo.txt3 cause a control flow change to deviate from the current method.
/art/test/541-regression-inlined-deopt/
Dinfo.txt3 control over vregs because the previous test 449 would pass because the vreg
/art/test/988-method-trace/
Dexpected.txt133control-0000>, <control-0000>, <control-0000>, <control-0000>, <control-0000>, <control-0000>, <co…
236control-0000>, <control-0000>, <control-0000>, <control-0000>, <control-0000>, <control-0000>, <co…
/art/test/546-regression-simplify-catch/smali/
DTestCase.smali19 # because it did expect at least a control-flow instruction (b/25494450).
39 # Test simplification of a dead catch block with some code but no control-flow
/art/test/960-default-smali/
Dexpected.txt19 C-virtual A.SayHiTwice()='You don't control me'
20 C-virtual C.SayHiTwice()='You don't control me'
21 C-interface Greeter.SayHiTwice()='You don't control me'
/art/compiler/optimizing/
Dinduction_var_analysis.cc120 HInstruction* control = guard->GetLastInstruction(); in IsGuardedBy() local
121 if (!control->IsIf()) { in IsGuardedBy()
124 HIf* ifs = control->AsIf(); in IsGuardedBy()
893 HInstruction* control = loop->GetHeader()->GetLastInstruction(); in VisitControl() local
894 if (control->IsIf()) { in VisitControl()
895 HIf* ifs = control->AsIf(); in VisitControl()
1047 HInstruction* control = loop->GetHeader()->GetLastInstruction(); in VisitTripCount() local
1049 DCHECK(control->IsIf()); in VisitTripCount()
1050 AssignInfo(loop, control, CreateTripCount(tcKind, trip_count, taken_test, type)); in VisitTripCount()
Dinduction_var_analysis_test.cc177 HInstruction* control = loop_header_[d]->GetLastInstruction(); in GetTripCount() local
178 DCHECK(control->IsIf()); in GetTripCount()
179 return GetInductionInfo(control, d); in GetTripCount()
Dbounds_check_elimination.cc1665 HInstruction* control = loop->GetHeader()->GetLastInstruction(); in CanHandleInfiniteLoop() local
1666 if (control->IsIf()) { in CanHandleInfiniteLoop()
1667 HInstruction* if_expr = control->AsIf()->InputAt(0); in CanHandleInfiniteLoop()
/art/
DNOTICE29 other entities that control, are controlled by, or are under common
30 control with that entity. For the purposes of this definition,
31 "control" means (i) the power, direct or indirect, to cause the
69 communication on electronic mailing lists, source code control systems,
/art/tools/checker/
DREADME2 state of the control-flow graph before and after each optimization pass
/art/test/510-checker-try-catch/smali/
DSsaBuilder.smali178 # This constant reaches Return via the normal control-flow path and both
DBuilder.smali234 # Test that multiple try-exit blocks are generated if (normal) control flow can
613 # Test control flow that enters a try block, leaves it and returns again.