This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: constructing webs from ssa.
- From: Jeffrey A Law <law at redhat dot com>
- To: Sanjiv Kumar Gupta <sanjivkumargupta at yahoo dot com>
- Cc: gcc at gcc dot gnu dot org
- Date: Tue, 12 Oct 2004 09:49:49 -0600
- Subject: Re: constructing webs from ssa.
- Organization: Red Hat, Inc
- References: <20041012100645.5398.qmail@web61109.mail.yahoo.com>
- Reply-to: law at redhat dot com
On Tue, 2004-10-12 at 04:06, Sanjiv Kumar Gupta wrote:
> 1. make a web for each du-chain.
> 2. combine those webs that have a 'common use', and
> this
> 'common use' can only be a phi-function.
>
> that's all we need to do for computing webs from ssa.
Right. However, it's often beneficial to be able to construct
webs in just a region of the function. ie, construct the webs
for the innermost loops, use the webs for some kind of optimization,
then construct webs for the parent loop nest and so on.
So, if you're pondering writing some code to create webs, you might
keep keep that in mind.
jeff