Nick Lewycky 40cc524ede Add ABCD, a generalized implementation of the Elimination of Array Bounds ... Checks on Demand algorithm which looks at arbitrary branches instead of loop iterations. This is GSoC work by Andre Tavares with only editorial changes applied! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@85382 91177308-0d34-0410-b5e6-96231b3b80d8		2009-10-28 07:03:15 +00:00
..
ABCD.cpp	Add ABCD, a generalized implementation of the Elimination of Array Bounds	2009-10-28 07:03:15 +00:00
ADCE.cpp
BasicBlockPlacement.cpp
CMakeLists.txt
CodeGenLICM.cpp
CodeGenPrepare.cpp
CondPropagate.cpp
ConstantProp.cpp
DCE.cpp
DeadStoreElimination.cpp
GEPSplitter.cpp
GVN.cpp	Rename MallocFreeHelper as MemoryBuiltins	2009-10-27 20:05:49 +00:00
IndVarSimplify.cpp
InstructionCombining.cpp
JumpThreading.cpp
LICM.cpp
LoopDeletion.cpp
LoopIndexSplit.cpp
LoopRotation.cpp
LoopStrengthReduce.cpp
LoopUnroll.cpp
LoopUnswitch.cpp
Makefile
MemCpyOptimizer.cpp
Reassociate.cpp
Reg2Mem.cpp
Scalar.cpp
ScalarReplAggregates.cpp
SCCP.cpp
SCCVN.cpp
SimplifyCFGPass.cpp
SimplifyHalfPowrLibCalls.cpp
SimplifyLibCalls.cpp
TailDuplication.cpp
TailRecursionElimination.cpp