Bob Wilson 84bd6b0c31 Re-commit my previous SSAUpdater changes. The previous version naively tried ... to determine where to place PHIs by iteratively comparing reaching definitions at each block. That was just plain wrong. This version now computes the dominator tree within the subset of the CFG where PHIs may need to be placed, and then places the PHIs in the iterated dominance frontier of each definition. The rest of the patch is mostly the same, with a few more performance improvements added in. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@101612 91177308-0d34-0410-b5e6-96231b3b80d8		2010-04-17 03:08:24 +00:00
..
ABCD
ADCE
ArgumentPromotion
BlockPlacement
BranchFolding
CodeExtractor
CodeGenPrepare
ConstantMerge
ConstProp
DeadArgElim
DeadStoreElimination
FunctionAttrs
GlobalDCE
GlobalOpt
GVN	Re-commit my previous SSAUpdater changes. The previous version naively tried	2010-04-17 03:08:24 +00:00
IndVarSimplify
Inline	Disable inlining of recursive calls. It can complicate tailcallelim and	2010-04-16 16:01:18 +00:00
InstCombine
Internalize
IPConstantProp
JumpThreading
LCSSA
LICM
LoopDeletion
LoopIndexSplit
LoopRotate
LoopSimplify
LoopStrengthReduce
LoopUnroll
LoopUnswitch
LowerInvoke
LowerSetJmp
LowerSwitch
Mem2Reg
MemCpyOpt
MergeFunc
PruneEH
Reassociate
ScalarRepl
SCCP
SimplifyCFG
SimplifyLibCalls
SRETPromotion
SSI
StripSymbols
TailCallElim
TailDup