This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [RFC] Improve Tree-SSA if-conversion - convergence of efforts
- From: Michael Matz <matz at suse dot de>
- To: Tehila Meyzels <TEHILA at il dot ibm dot com>
- Cc: Daniel Berlin <dberlin at dberlin dot org>, dpatel at apple dot com, gcc at gcc dot gnu dot org, gcc-patches at gcc dot gnu dot org, Revital1 Eres <ERES at il dot ibm dot com>, trevor_smigiel at playstation dot sony dot com, Ulrich Weigand <Ulrich dot Weigand at de dot ibm dot com>, Victor Kaplansky <VICTORK at il dot ibm dot com>
- Date: Mon, 6 Aug 2007 16:30:59 +0200 (CEST)
- Subject: Re: [RFC] Improve Tree-SSA if-conversion - convergence of efforts
- References: <OF518A220D.E0270B9E-ONC225732F.0042D2FE-C225732F.004321C7@il.ibm.com>
Hi,
On Mon, 6 Aug 2007, Tehila Meyzels wrote:
> > in if-conv (or phi-opt), but in ssa-sink (or some similar transformation
> > which can or can not use value numbers and the like).
>
> OK.
>
> And what's your opinion WRT conditional loads/stores?
> Since you've sent your conditional store transformation patch,
> I guess the meaning could be rewriting it on the top of tree-if-conv.
Actually I'm not so sure about that. I found the phi-opt infrastructure
much better suited to do the necessary pattern matching, so I only
thought of the conditional store replacement as enabling transformation.
Also tree-if-conv only handles loops (and only inner ones), not general
conditional patterns. Something which might be fixable with some amount
of work, but the phi-opt infrastructure simply was already there.
Ciao,
Michael.