llvm-6502/test/Transforms/SimplifyCFG
Eli Friedman b1a6eab655 PR9450: Make switch optimization in SimplifyCFG not dependent on the ordering
of pointers in an std::map.



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@127650 91177308-0d34-0410-b5e6-96231b3b80d8
2011-03-15 02:23:35 +00:00
..
2002-05-05-EmptyBlockMerge.ll
2002-05-21-PHIElimination.ll
2002-06-24-PHINode.ll
2002-09-24-PHIAssertion.ll
2003-03-07-DominateProblem.ll
2003-08-05-InvokeCrash.ll
2003-08-05-MishandleInvoke.ll
2003-08-17-BranchFold.ll
2003-08-17-BranchFoldOrdering.ll
2003-08-17-FoldSwitch-dbg.ll
2003-08-17-FoldSwitch.ll
2004-12-10-SimplifyCFGCrash.ll
2005-06-16-PHICrash.ll
2005-08-01-PHIUpdateFail.ll
2005-08-03-PHIFactorCrash.ll
2005-10-02-InvokeSimplify.ll
2005-12-03-IncorrectPHIFold.ll
2006-02-17-InfiniteUnroll.ll
2006-06-12-InfLoop.ll
2006-08-03-Crash.ll
2006-10-19-UncondDiv.ll
2006-10-29-InvokeCrash.ll
2006-12-08-Ptr-ICmp-Branch.ll
2007-11-22-InvokeNoUnwind.ll
2007-12-21-Crash.ll
2008-01-02-hoist-fp-add.ll
2008-04-23-MergeMultipleResultRet.ll
2008-04-27-MultipleReturnCrash.ll Correct bogus module triple specifications. 2010-08-30 10:48:29 +00:00
2008-05-16-PHIBlockMerge.ll Fix mistyped CHECK lines. 2011-03-09 22:07:31 +00:00
2008-07-13-InfLoopMiscompile.ll
2008-09-08-MultiplePred.ll
2008-09-17-SpeculativeHoist.ll
2008-10-03-SpeculativelyExecuteBeforePHI.ll
2008-12-06-SingleEntryPhi.ll
2008-12-16-DCECond.ll
2009-01-18-PHIPropCrash.ll
2009-01-19-UnconditionalTrappingConstantExpr.ll
2009-03-05-Speculative-Hoist-Dbg.ll
2009-05-12-externweak.ll
2009-06-15-InvokeCrash.ll
2010-03-30-InvokeCrash.ll
2010-10-24-OnlyUnwindInEntry.ll Fix PR8445: a block with no predecessors may be the entry block, in which case 2010-10-24 12:23:30 +00:00
2011-03-08-UnreachableUse.ll PR9420; an instruction before an unreachable is guaranteed not to have any 2011-03-09 00:48:33 +00:00
basictest.ll Re-apply r124518 with fix. Watch out for invalidated iterator. 2011-01-29 04:46:23 +00:00
branch_fold_dbg.ll
branch-branch-dbginfo.ll
branch-cond-merge.ll
branch-cond-prop.ll
branch-fold-test.ll
branch-fold.ll
branch-phi-thread.ll
BrUnwind.ll
dbginfo.ll
DeadSetCC.ll
dg.exp
duplicate-phis.ll
EqualPHIEdgeBlockMerge.ll
hoist-common-code.dbg.ll
hoist-common-code.ll
HoistCode.ll
indirectbr.ll Teach SimplifyCFG to turn 2010-12-05 18:29:03 +00:00
invoke_unwind.ll make these tests a bit less fragile 2010-12-13 05:10:30 +00:00
iterative-simplify.ll
MagicPointer.ll Re-apply r124518 with fix. Watch out for invalidated iterator. 2011-01-29 04:46:23 +00:00
noreturn-call.ll
PhiBlockMerge2.ll
PhiBlockMerge.ll fix two significant issues with FoldTwoEntryPHINode: 2010-12-14 08:01:53 +00:00
PhiEliminate2.ll
PhiEliminate.ll - Insert new instructions before DomBlock's terminator, 2010-12-14 08:46:09 +00:00
PhiNoEliminate.ll
return-merge.ll
select-gep.ll Revert "SimplifyCFG: GEPs with just one non-constant index are also cheap." 2011-02-25 10:33:33 +00:00
speculate-with-offset.ll Factor out Instruction::isSafeToSpeculativelyExecute's code for 2010-11-11 21:23:25 +00:00
SpeculativeExec.ll
switch_create.ll SimplifyCFG: Track the number of used icmps when turning a icmp chain into a switch. If we used only one icmp, don't turn it into a switch. 2011-02-07 22:37:28 +00:00
switch_formation.dbg.ll SimplifyCFG: Track the number of used icmps when turning a icmp chain into a switch. If we used only one icmp, don't turn it into a switch. 2011-02-07 22:37:28 +00:00
switch_switch_fold_dbginfo.ll
switch_switch_fold.ll
switch_thread.ll
switch-on-const-select.ll Teach SimplifyCFG that (switch (select cond, X, Y)) is better expressed as a branch. 2011-02-28 09:44:07 +00:00
switch-simplify-crash.ll
switch-to-icmp.ll SimplifyCFG: Track the number of used icmps when turning a icmp chain into a switch. If we used only one icmp, don't turn it into a switch. 2011-02-07 22:37:28 +00:00
trapping-load-unreachable.ll Test case for r105914. 2010-06-13 16:16:54 +00:00
two-entry-phi-return.dbg.ll
two-entry-phi-return.ll
UncondBranchToReturn.ll
UnreachableEliminate.ll PR9450: Make switch optimization in SimplifyCFG not dependent on the ordering 2011-03-15 02:23:35 +00:00