On Tue, 3 Sep 2013 12:31:50, Richard Biener wrote:
> On Fri, Aug 30, 2013 at 6:43 PM, Bernd Edlinger
> wrote:
>> Now I think this is good opportunity for a simple heuristic:
>>
>> If a statement is at loop level 1 we can move it out of the loop,
>> regardless of the fact, that it may invoke undefi
On Fri, Aug 30, 2013 at 6:43 PM, Bernd Edlinger
wrote:
> On Thu, 29 Aug 2013 11:54:22, Richard Biener wrote:
>> On Wed, Aug 28, 2013 at 11:24 PM, Bernd Edlinger
>> wrote:
>>> The lim pass (aka loop invariant motion) can move conditional expressions
>>> with
>>> possible undefined behavior out of
On Thu, 29 Aug 2013 11:54:22, Richard Biener wrote:
> On Wed, Aug 28, 2013 at 11:24 PM, Bernd Edlinger
> wrote:
>> The lim pass (aka loop invariant motion) can move conditional expressions
>> with
>> possible undefined behavior out of the if statement inside a loop which may
>> cause the
>> loop
On Wed, Aug 28, 2013 at 11:24 PM, Bernd Edlinger
wrote:
> The lim pass (aka loop invariant motion) can move conditional expressions
> with possible undefined behavior out of the if statement inside a loop which
> may cause the loop optimization to silently generate wrong code as PR
> tree-optim