This is the mail archive of the
mailing list for the GCC project.
Re: SSA for Trees - PRE implementation
From: "Daniel Berlin" <firstname.lastname@example.org>
> > I've recently attempted an SSA PRE implementation based on the
Kennedy, et.al. paper and met with significant difficulties.
> Non-surprising :P
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?