aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/Bitcode/Reader/BitcodeReader.h
diff options
context:
space:
mode:
authorNick Lewycky <nicholas@mxc.ca>2009-10-28 07:03:15 +0000
committerNick Lewycky <nicholas@mxc.ca>2009-10-28 07:03:15 +0000
commit175308c43e49bfeb56e8aefb52eedc2139665cf7 (patch)
tree9558dc9c49fc92be704f952a1160b7f8ffd22f26 /llvm/lib/Bitcode/Reader/BitcodeReader.h
parentec6d7c945d8bacfdbc244288b42015b4fed1f3ec (diff)
downloadllvm-175308c43e49bfeb56e8aefb52eedc2139665cf7.zip
llvm-175308c43e49bfeb56e8aefb52eedc2139665cf7.tar.gz
llvm-175308c43e49bfeb56e8aefb52eedc2139665cf7.tar.bz2
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! llvm-svn: 85382
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.h')
0 files changed, 0 insertions, 0 deletions