Will tree-ssa be GCC 3.5?

[Richard Kenner]

    CSE is an example of a pass that I want to see significantly simplified.

Most of the complexity in CSE is due to code that chooses the best form for
an insn given costs and valid operands for a machine.  That's not going
to be affected by tree-ssa.  I think it'll need nearly all of the current
hash table mechanism to do that.  The "around branches" and related stuff
*should* indeed certainly disappear, but we thought (at least I did) that
it could go away when gcse was written and that turned out not to be the
case.  So I'm a bit more skeptical that this will be any different.  In any
event, though that code takes up a significant fraction of the compile
*time*, it's not a particularly *complex* part of CSE.