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]

Re: SSA for Trees - PRE implementation

From: "Daniel Berlin" <dberlin@dberlin.org>
> >   I've recently attempted an SSA PRE implementation based on the
Kennedy, et.al. paper and met with significant difficulties.
> Non-surprising :P

Daniel,
Quick question then, did you find the SSA PRE implementation any better than
the lazy code motion (LCM) and Morel-Renvoise algorithms that are already
part of GCC?  In the end, will it have been any easier to implement, will it
be any faster or produce better code?  I guess the real question is ... Do
you see it eventually replacing the either existing PRE pass?

Sid
Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]