Displaying 1 result from an estimated 1 matches for "numbackedg".
Did you mean:
numbackedges
2014 Aug 30
2
[LLVMdev] Loop vectorizer preamble
...ere should be cases when we don't need to check for
overflow. In a well-formed loop, which this should be at this point, there
is an increment of the indvar before the backedge. If this increment is
marked 'nuw', we should be guaranteed that we don't get an overflow when
calculating numBackedges + 1.
Also, many many loops don't have a single point-test for exit (x != 0).
Instead, they have a greater-than or less-than condition. If this is the
case, we should be able to elide all of our logic with Count and just count
down until the test is broken. For example:
for (i = 0; i < n;...