On Tue, May 22, 2012 at 2:50 PM, Ulrich Weigand wrote:
> Richard Guenther wrote:
>
>> Btw, reassoc (and your patch?) would have the issue that for
>> a + (b + c) - a it would yield b + c as result which is not an atom
>> (but still ok, since it is a pre-existing value that is computed in the IL
>>
Richard Guenther wrote:
> Btw, reassoc (and your patch?) would have the issue that for
> a + (b + c) - a it would yield b + c as result which is not an atom
> (but still ok, since it is a pre-existing value that is computed in the IL
> already). The simple forwprop matching catches this as it doe
Hi,
On Tue, 22 May 2012, Richard Guenther wrote:
> > I had thought of that as well. But it is not quite that simple -- the
> > problem is that tree-ssa-reassoc.c as part of its core algorithm
> > reassociates
> > expressions all the time while even still building up the tree, see e.g.
> > linea
On Tue, May 22, 2012 at 2:04 PM, Richard Guenther
wrote:
> On Tue, May 22, 2012 at 1:58 PM, Ulrich Weigand wrote:
>> Richard Guenther wrote:
>>> On Fri, May 18, 2012 at 10:27 PM, Ulrich Weigand
>>> wrote:
>>> > The following patch rewrites associate_plusminus to remove all the
>>> > explicitly
On Tue, May 22, 2012 at 1:58 PM, Ulrich Weigand wrote:
> Richard Guenther wrote:
>> On Fri, May 18, 2012 at 10:27 PM, Ulrich Weigand wrote:
>> > The following patch rewrites associate_plusminus to remove all the
>> > explicitly coded special cases, and instead performs a scan of the
>> > plus/min
Richard Guenther wrote:
> On Fri, May 18, 2012 at 10:27 PM, Ulrich Weigand wrote:
> > The following patch rewrites associate_plusminus to remove all the
> > explicitly coded special cases, and instead performs a scan of the
> > plus/minus tree similar to what is done in tree-ssa-reassoc (and also
On Fri, May 18, 2012 at 10:27 PM, Ulrich Weigand wrote:
> Richard Guenther wrote:
>> On Thu, Mar 8, 2012 at 3:29 PM, Ulrich Weigand wrote:
>> > - Should I try to improve forwprop to handle casts and additional re-
>> > association cases until it handles the above expression?
>>
>> Yes, ideally by
On Fri, May 18, 2012 at 11:13 PM, Robert Dewar wrote:
> On 5/18/2012 4:27 PM, Ulrich Weigand wrote:
>
>> I finally got some time to look into this in detail. The various special-
>> case transforms in associate_plusminus all transform a plus/minus
>> expression
>> tree into either a single operan
On 5/18/2012 4:27 PM, Ulrich Weigand wrote:
I finally got some time to look into this in detail. The various special-
case transforms in associate_plusminus all transform a plus/minus expression
tree into either a single operand, a negated operand, or a single plus or
minus of two operands. Th
Richard Guenther wrote:
> On Thu, Mar 8, 2012 at 3:29 PM, Ulrich Weigand wrote:
> > - Should I try to improve forwprop to handle casts and additional re-
> > association cases until it handles the above expression?
>
> Yes, ideally by trying to sub-divide this task into separate profitable
> tran
10 matches
Mail list logo
