Chris Lattner 2663ffe751 Make RenamePass faster by making the 'is this a new phi node' ... check more intelligent. This speeds up mem2reg from 5.29s to 0.79s on a synthetic testcase with tons of predecessors and phi nodes. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@46767 91177308-0d34-0410-b5e6-96231b3b80d8		2008-02-05 21:26:23 +00:00
..
BasicBlockUtils.cpp
BasicInliner.cpp
BreakCriticalEdges.cpp
CloneFunction.cpp
CloneLoop.cpp
CloneModule.cpp
CloneTrace.cpp
CodeExtractor.cpp
DemoteRegToStack.cpp
InlineCost.cpp
InlineFunction.cpp
LCSSA.cpp
Local.cpp
LoopSimplify.cpp
LowerAllocations.cpp
LowerInvoke.cpp
LowerSelect.cpp
LowerSwitch.cpp
Makefile
Mem2Reg.cpp
PromoteMemoryToRegister.cpp
SimplifyCFG.cpp
UnifyFunctionExitNodes.cpp
ValueMapper.cpp