Chris Lattner 6cdf2ea98e implement the first part of PR8882: when lowering an inbounds ... gep to explicit addressing, we know that none of the intermediate computation overflows. This could use review: it seems that the shifts certainly wouldn't overflow, but could the intermediate adds overflow if there is a negative index? Previously the testcase would instcombine to: define i1 @test(i64 %i) { %p1.idx.mask = and i64 %i, 4611686018427387903 %cmp = icmp eq i64 %p1.idx.mask, 1000 ret i1 %cmp } now we get: define i1 @test(i64 %i) { %cmp = icmp eq i64 %i, 1000 ret i1 %cmp } git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@125271 91177308-0d34-0410-b5e6-96231b3b80d8		2011-02-10 07:11:16 +00:00
..
Hello	Since the Hello pass is built as a loadable dynamic library, don't try to convert it to new-style registration yet.	2010-10-07 00:31:16 +00:00
InstCombine	implement the first part of PR8882: when lowering an inbounds	2011-02-10 07:11:16 +00:00
Instrumentation	Implementation of path profiling.	2011-01-29 01:09:53 +00:00
IPO	When removing a function from the function set and adding it to deferred, we	2011-02-09 06:32:02 +00:00
Scalar	Revert this in an attempt to bring the builders back.	2011-02-10 01:48:24 +00:00
Utils	SimplifyCFG: Track the number of used icmps when turning a icmp chain into a switch. If we used only one icmp, don't turn it into a switch.	2011-02-07 22:37:28 +00:00
Makefile	Revert r100896 and around - this breaks the only mingw32 buildbot we have.	2010-04-15 19:51:42 +00:00