llvm-6502/test/Transforms
Dan Gohman 850f791abc Fill in some holes in ScalarEvolution's loop iteration condition
analysis. This allows indvars to emit a simpler loop trip count
expression.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@76085 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-16 17:34:36 +00:00
..
ADCE
ArgumentPromotion
BlockPlacement
BranchFolding
CodeExtractor
CodeGenPrepare
CondProp
ConstantMerge
ConstProp Remove the vicmp and vfcmp instructions. Because we never had a release with 2009-07-08 03:04:38 +00:00
DeadArgElim
DeadStoreElimination
FunctionAttrs
GlobalDCE
GlobalOpt
GVN Move the re-sort of invalidated NonLocalPointerDeps cache earlier 2009-07-13 17:14:23 +00:00
GVNPRE
IndMemRem
IndVarSimplify Fill in some holes in ScalarEvolution's loop iteration condition 2009-07-16 17:34:36 +00:00
Inline
InstCombine Don't restrict the set of instructions where we try to constant-fold the 2009-07-15 22:13:34 +00:00
Internalize
IPConstantProp
JumpThreading
LCSSA
LICM
LoopDeletion
LoopIndexSplit
LoopRotate
LoopSimplify
LoopStrengthReduce
LoopUnroll
LoopUnswitch
LowerInvoke
LowerSetJmp
LowerSwitch
Mem2Reg
MemCpyOpt
MergeFunc
PredicateSimplifier
PruneEH
RaiseAllocations
Reassociate
ScalarRepl
SCCP
SimplifyCFG Revert 75571; I'm convinced this isn't the right thing to do. 2009-07-14 17:48:25 +00:00
SimplifyLibCalls
SRETPromotion
SSI There's no need to consider PHI nodes in the same block as the instruction 2009-07-09 15:59:27 +00:00
StripSymbols
TailCallElim
TailDup