This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Other format: | [Raw text] |
On Mon, 15 Dec 2003, Daniel Berlin wrote:It was easy?On Dec 15, 2003, at 5:07 PM, Chris Lattner wrote: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.I remember looking at it. Did I mention we can do LFTR too :P.
Something I've never understood about the SSAPRE paper and subsequent
extensions: why does it make sense to incorporate things like LFTR into
PRE? I understand the idea of integrating load/store motion into it, but
LFTR? It seems like a simplish problem. What am I missing?
a = b * 5 if (whatever) { b = b + 1 } a = b * 5
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |