On Mon, Nov 7, 2011 at 5:07 PM, Kai Tietz wrote:
> 2011/11/7 Richard Guenther :
>> On Sun, Nov 6, 2011 at 11:17 PM, Kai Tietz wrote:
>>> Hello,
>>>
>>> the second patch extends the tree-ssa-ifcombine pass so, that it chains up
>>> simple if-and/or-if patterns via associative bitwise-and/or opera
2011/11/7 Richard Guenther :
> On Sun, Nov 6, 2011 at 11:17 PM, Kai Tietz wrote:
>> Hello,
>>
>> the second patch extends the tree-ssa-ifcombine pass so, that it chains up
>> simple if-and/or-if patterns via associative bitwise-and/or operations.
>> This allows for example optimization for case
On Sun, Nov 6, 2011 at 11:17 PM, Kai Tietz wrote:
> Hello,
>
> the second patch extends the tree-ssa-ifcombine pass so, that it chains up
> simple if-and/or-if patterns via associative bitwise-and/or operations. This
> allows for example optimization for cases like:
>
> if (c == 0) return 2;
>
Hello,
the second patch extends the tree-ssa-ifcombine pass so, that it chains up
simple if-and/or-if patterns via associative bitwise-and/or operations. This
allows for example optimization for cases like:
if (c == 0) return 2;
if (c == 1) return 2;
if (c == 2) return 2;
...
as now reassocia
