This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa, RFC] CFG transparent RTL expansion
- From: Andrew MacLeod <amacleod at redhat dot com>
- To: Jeff Law <law at redhat dot com>
- Cc: Jan Hubicka <jh at suse dot cz>, gcc mailing list <gcc at gcc dot gnu dot org>, gcc-patches <gcc-patches at gcc dot gnu dot org>, Richard Henderson <rth at redhat dot com>, Diego Novillo <dnovillo at redhat dot com>
- Date: 19 Dec 2003 12:01:54 -0500
- Subject: Re: [tree-ssa, RFC] CFG transparent RTL expansion
- References: <200312191623.hBJGNtMA030130@speedy.slc.redhat.com>
On Fri, 2003-12-19 at 11:23, law@redhat.com wrote:
> In message <1071801428.21456.162.camel@p4>, Andrew MacLeod writes:
> >This implements something which isnt actually used yet (ie, no
> >collection emitted/done). If I read it correctly, just a proof of
> >concept of a persistant CFG. So lets skip to how it would actually be
> >used. And excuse my lackof knowledge about how gcc collects profile info
> >:-)
> Another potential use would be to detect when the tree->rtl lowering
> process creates new blocks. This _may_ be interesting in that it may
> be an indication that rather than a block-local CSE we may want to run
> something a little more extensive.
>
> If it's not obvious, I'm thinking about how we start trimming down the
> first stage RTL optimizers -- knowing if new blocks were created may be
> useful in determining which early RTL optimizers to run or what mode to
> run them in (block-local or extended-basic-blocks).
Yeah, Since the driving force behind keeping the CFG live through rtl is
to keep profiling information, we should try to list other things that
would either benefit from this, or be impacted so that we have multiple
reasons.
Andrew