This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Maintaining/representing def-use/use-def information
- From: Chris Lattner <sabre at nondot dot org>
- To: Daniel Berlin <dberlin at dberlin dot org>
- Cc: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>,Jeff Law <law at redhat dot com>, Andrew MacLeod <amacleod at redhat dot com>,gcc mailing list <gcc at gcc dot gnu dot org>
- Date: Mon, 15 Dec 2003 16:07:12 -0600 (CST)
- Subject: Re: [tree-ssa] Maintaining/representing def-use/use-def information
On Mon, 15 Dec 2003, Daniel Berlin wrote:
> > There are ways around this, but the SSAPRE papers have several fairly
> > severe bugs and ommissions in them. This information is not really
> > needed
> > for implementing PRE on SSA form.
> >
>
> Yes, you could do E-Path PRE, but it's harder to extend it to perform
> strength reduction or load speculation.
Yup, and FWIW, LLVM uses an e-path based formulation of PRE on SSA form.
-Chris
--
http://llvm.cs.uiuc.edu/
http://www.nondot.org/~sabre/Projects/