<div dir="ltr"><br><div class="gmail_extra"><br><div class="gmail_quote">On Fri, Sep 16, 2016 at 4:05 PM, Sanjoy Das <span dir="ltr"><<a href="mailto:sanjoy@playingwithpointers.com" target="_blank">sanjoy@playingwithpointers.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">Hi Kevin,<span class="gmail-"><br></span><br>
<br>
If "x + 1" and "x + 3" cannot be proven to overflow then the loop no<br>
longer has a constant trip count of "2".</blockquote><div>If we apply "<span style="font-size:12.8px">Assuming compiler assumes program is free of UB", can above requirement be relaxed?</span></div><div><span style="font-size:12.8px"><br></span></div><div><span style="font-size:12.8px">-Kevin</span></div><div> </div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><span class="gmail-HOEnZb"><font color="#888888"><br>
<br>
-- Sanjoy<br>
</font></span></blockquote></div><br></div></div>