Searched refs:dead (Results 1 – 23 of 23) sorted by relevance
/art/test/546-regression-simplify-catch/smali/ |
D | TestCase.smali | 18 # Test simplification of an empty, dead catch block. Compiler used to segfault 39 # Test simplification of a dead catch block with some code but no control-flow 61 # Test simplification of a dead catch block with normal-predecessors but 62 # starting with a move-exception. Verifier does not check trivially dead code 81 # Test simplification of a live catch block with dead normal-predecessors and 82 # starting with a move-exception. Verifier does not check trivially dead code 94 # Trivially dead predecessor block.
|
/art/test/480-checker-dead-blocks/ |
D | info.txt | 1 Test removal of dead blocks.
|
/art/test/140-dce-regression/ |
D | info.txt | 1 Regression test for quick dead code elimination.
|
/art/test/543-checker-dce-trycatch/smali/ |
D | TestCase.smali | 26 # Test a case when one entering TryBoundary is dead but the rest of the try 71 # Test a case when one exiting TryBoundary is dead but the rest of the try 204 # Test that DCE removes catch phi uses of instructions defined in dead try blocks. 245 const v1, 0xa # dead catch phi input, defined in entry block (HInstruction) 246 add-int v2, p0, p1 # dead catch phi input, defined in the dead block (HInstruction) 251 # v3 = Phi [Add, 0xf] # dead catch phi input, defined in the dead block (HPhi) 278 # dead try blocks. 311 const v1, 0xa # dead catch phi input, defined in entry block 312 const v2, 0xf # dead catch phi input, defined in entry block
|
/art/test/591-checker-regression-dead-loop/ |
D | info.txt | 1 Regression test for Optimizing's dead block elimination which used to remove
|
/art/test/596-checker-dead-phi/ |
D | info.txt | 1 Regression test for optimizing where we used to replace a dead loop
|
/art/test/546-regression-simplify-catch/ |
D | info.txt | 1 Tests simplification of catch blocks in the presence of trivially dead code
|
/art/test/516-dead-move-result/ |
D | info.txt | 3 because it was dead code.
|
/art/test/473-remove-dead-block/ |
D | info.txt | 1 Regression test for optimizing's dead block removing:
|
/art/test/618-checker-induction/src/ |
D | Main.java | 146 int dead = 0; in deadInduction() local 149 dead += 5; in deadInduction() 188 int dead = 0; in deadSequence() local 193 dead += i; in deadSequence() 212 int dead = 0; in deadCycleWithException() local 218 dead += a[k]; in deadCycleWithException()
|
/art/test/435-new-instance/ |
D | info.txt | 6 This also verifies that we don't remove dead (code) new-instances which may
|
/art/test/706-jit-skip-compilation/ |
D | info.txt | 2 dead dex code. For not compilable methods we don't gather samples and we don't
|
/art/test/800-smali/smali/ |
D | b_22411633_1.smali | 23 # Some more random work, technically dead, but reachable.
|
D | b_21863767.smali | 24 # The following is dead code but used to crash the compiler.
|
/art/test/501-null-constant-dce/smali/ |
D | DCE.smali | 23 # so that the compiler sees the null constant as dead code.
|
/art/test/520-equivalent-phi/smali/ |
D | Equivalent.smali | 30 # we would consider the phi equivalent reference of v0, as dead,
|
/art/test/503-dead-instructions/smali/ |
D | DeadInstructions.smali | 27 # Provide more arguments than we should. Because this is dead
|
/art/test/435-try-finally-without-catch/ |
D | info.txt | 21 optimizing compiler considered this (these) as dead block(s) and
|
/art/test/552-checker-primitive-typeprop/smali/ |
D | SsaBuilder.smali | 18 # Check that a dead phi with a live equivalent is replaced in an environment. The
|
/art/test/596-checker-dead-phi/smali/ |
D | IrreducibleLoop.smali | 20 # not adjacent. This revealed a bug in our SSA builder, where a dead loop phi would
|
/art/test/594-checker-irreducible-linorder/smali/ |
D | IrreducibleLoop.smali | 43 # Trivially dead code to ensure linear order verification skips removed blocks (b/28252537).
|
/art/test/510-checker-try-catch/smali/ |
D | SsaBuilder.smali | 202 # Tests that dead catch blocks are removed.
|
D | Builder.smali | 1340 # Test a (dead) try block which flows out of the method. The block will be
|