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
This commit is contained in:
Nick Lewycky 2009-10-28 07:03:15 +00:00
parent c59420867e
commit 40cc524ede
3 changed files with 1115 additions and 0 deletions

View File

@ -142,6 +142,7 @@ namespace {
(void) llvm::createSSIEverythingPass();
(void) llvm::createGEPSplitterPass();
(void) llvm::createSCCVNPass();
(void) llvm::createABCDPass();
(void)new llvm::IntervalPartition();
(void)new llvm::FindUsedTypes();

View File

@ -344,6 +344,12 @@ FunctionPass *createGEPSplitterPass();
//
FunctionPass *createSCCVNPass();
//===----------------------------------------------------------------------===//
//
// ABCD - Elimination of Array Bounds Checks on Demand
//
FunctionPass *createABCDPass();
} // End llvm namespace
#endif

File diff suppressed because it is too large Load Diff