[llvm-dev] SCEV cannot compute the trip count of Simple loop

[Kevin Choi via llvm-dev]

On Fri, Sep 16, 2016 at 4:05 PM, Sanjoy Das <sanjoy at playingwithpointers.com>
wrote:

> Hi Kevin,
>
>
> If "x + 1" and "x + 3" cannot be proven to overflow then the loop no
> longer has a constant trip count of "2".

If we apply "Assuming compiler assumes program is free of UB", can above
requirement be relaxed?

-Kevin


>
>
> -- Sanjoy
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20160916/6b0d6be8/attachment.html>