Owen Anderson ec3953ff95 When determining if we can fold (x >> C1) << C2, the bits that we need to verify are zero ... are not the low bits of x, but the bits that WILL be the low bits after the operation completes. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122529 91177308-0d34-0410-b5e6-96231b3b80d8		2010-12-23 23:56:24 +00:00
..
ADCE
ArgumentPromotion
BlockPlacement
BranchFolding
CodeExtractor
CodeGenPrepare	revert r122164, I'm going to go with a different approach.	2010-12-19 04:23:03 +00:00
ConstantMerge
ConstProp
CorrelatedValuePropagation	Fix PR8790, another instance where unreachable code can cause instruction simplification to fail,	2010-12-15 00:55:35 +00:00
DeadArgElim
DeadStoreElimination
FunctionAttrs
GlobalDCE
GlobalOpt
GVN	Give GVN back the ability to perform simple conditional propagation on conditional branch values.	2010-12-21 23:54:34 +00:00
IndVarSimplify
Inline	when eliding a byval copy due to inlining a readonly function, we have	2010-12-20 08:10:40 +00:00
InstCombine	When determining if we can fold (x >> C1) << C2, the bits that we need to verify are zero	2010-12-23 23:56:24 +00:00
InstSimplify	When determining whether the new instruction was already present in	2010-12-22 17:15:25 +00:00
Internalize
IPConstantProp
JumpThreading	Teach jump threading to "look through" a select when the branch direction of a terminator depends on it.	2010-12-15 09:51:20 +00:00
LCSSA
LICM	Enhance LICM to promote alias sets whose pointers themselves are stored,	2010-12-19 05:57:25 +00:00
LoopDeletion
LoopRotate
LoopSimplify
LoopStrengthReduce
LoopUnroll
LoopUnswitch
LowerAtomic
LowerInvoke
LowerSetJmp
LowerSwitch
Mem2Reg
MemCpyOpt
MergeFunc
PartialSpecialize
PruneEH
Reassociate
ScalarRepl
SCCP
SimplifyCFG	SimplifyCFG: Ranges can be larger than 64 bits. Fixes Release-selfhost build.	2010-12-17 10:48:14 +00:00
SimplifyLibCalls	Revert r64460. strtol and friends cannot be marked readonly, even with	2010-12-17 01:09:43 +00:00
Sink
SRETPromotion
StripSymbols
TailCallElim
TailDup