| commit | 43d273db094c46eefceb6a27748c515aafdee7aa | |
| author | Nick Lewycky <nicholas@mxc.ca> | |
| Wed, 28 Oct 2009 07:03:15 +0000 (28 07:03 +0000) | ||
| committer | Nick Lewycky <nicholas@mxc.ca> | |
| Wed, 28 Oct 2009 07:03:15 +0000 (28 07:03 +0000) | ||
| tree | d3e2f3d6d5f54d108a452f947445975a899dfbf9 | treesnapshot (tar.gz zip) |
| parent | fa281b8ec7167ba67ddcc8d441f6ff1685c83998 | commitdiff |
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
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
| include/llvm/LinkAllPasses.h | diffblobblamehistory | |
| include/llvm/Transforms/Scalar.h | diffblobblamehistory | |
| lib/Transforms/Scalar/ABCD.cpp | [new file with mode: 0644] | blob |