Chris Lattner 992efb0378 Step #2 to improve trip count analysis for loops like this: ... void f(int* begin, int* end) { std::fill(begin, end, 0); } which turns into a != exit expression where one pointer is strided and (thanks to step #1) known to not overflow, and the other is loop invariant. The observation here is that, though the IV is strided by 4 in this case, that the IV *has* to become equal to the end value. It cannot "miss" the end value by stepping over it, because if it did, the strided IV expression would eventually wrap around. Handle this by turning A != B into "A-B != 0" where the A-B part is known to be NUW. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@123131 91177308-0d34-0410-b5e6-96231b3b80d8		2011-01-09 22:26:35 +00:00
..
llvm	Step #2 to improve trip count analysis for loops like this:	2011-01-09 22:26:35 +00:00
llvm-c	Do not include DataTypes.h in llvm-c/lto.h.	2011-01-07 22:26:25 +00:00