Dan Gohman e5aceed168 Simplify [su]max(MAX, n) to MAX. This comes up in loop tripcount ... computations in loops with multiple exits. Adjust the testcase for PR4436 so that the relevant portion isn't optimized away. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@74073 91177308-0d34-0410-b5e6-96231b3b80d8		2009-06-24 14:46:22 +00:00
..
ADCE
ArgumentPromotion
BlockPlacement
BranchFolding
CodeExtractor
CodeGenPrepare
CondProp
ConstantMerge
ConstProp	Expand this test to handle more cases (remainder and shifts) of zero.	2009-06-21 01:56:41 +00:00
DeadArgElim
DeadStoreElimination
FunctionAttrs
GlobalDCE
GlobalOpt
GVN
GVNPRE
IndMemRem
IndVarSimplify	Simplify [su]max(MAX, n) to MAX. This comes up in loop tripcount	2009-06-24 14:46:22 +00:00
Inline
InstCombine	Generalize the zext(trunc(t) & C) instcombine to work even with	2009-06-18 16:30:21 +00:00
Internalize
IPConstantProp
JumpThreading	make jump threading handle lexically identical compare instructions	2009-06-19 16:27:56 +00:00
LCSSA
LICM
LoopDeletion
LoopIndexSplit
LoopRotate
LoopSimplify
LoopStrengthReduce	Tweak this test to be a little less unusual.	2009-06-20 00:40:56 +00:00
LoopUnroll
LoopUnswitch
LowerInvoke
LowerSetJmp
LowerSwitch
Mem2Reg
MemCpyOpt
MergeFunc
PredicateSimplifier
PruneEH
RaiseAllocations
Reassociate
ScalarRepl
SCCP
SimplifyCFG
SimplifyLibCalls	part of PR4405: disable a contentious optimization for	2009-06-19 04:17:36 +00:00
SRETPromotion
StripSymbols
TailCallElim	Improve tail call elim to move loads above readonly calls	2009-06-19 04:22:16 +00:00
TailDup