This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Lazy updating of stmt operands
- From: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>
- To: Andrew MacLeod <amacleod at redhat dot com>
- Cc: Chris Lattner <sabre at nondot dot org>, Jeff Law <law at redhat dot com>,gcc mailing list <gcc at gcc dot gnu dot org>
- Date: Fri, 12 Dec 2003 20:24:59 +0100
- Subject: Re: [tree-ssa] Lazy updating of stmt operands
- References: <Pine.LNX.4.44.0312112134170.5198-100000@nondot.org> <1071256652.14001.265.camel@p4>
Hello,
> I suspect the loop optimizations are going to fall into the same
> category as CCP in that they are going to be interested in the immediate
> uses of only a partial subset of variables most of the time. I think its
> far more efficient to calculate those when you need them/know what they
> are, and possibly maintain just those def->uses.
hardly; you still must scan all statements to find the uses, so I don't
see where you would want to get the extra efficiency.
Zdenek