On Fri, Feb 29, 2008 at 11:51 PM, Diego Novillo <[EMAIL PROTECTED]> wrote: > If we are not going to use a rewriting SSA form, I believe that the > original problems we had with RTL-SSA can be avoided.
The nice thing about birth points would be that most RTL optimizers can look through NOPs (amazingly ;-). That's a big plus IMHO. I am not sure what would happen if GCC would start using FUD chains. Is it like in SSA that every register is assigned only once? That would break all RTL optimizers that look at lexical equivalence of expressions, like e.g. all optimizations in gcse.c. When faced with a PHI node, those optimizers would punt and lose. Gr. Steven
