[patch] Cleanups needed for tree SSA work (part 1)

[Diego Novillo]

On Thu, 21 Jun 2001, Daniel Berlin wrote:

> Diego,
> Since i'm assuming you've done some testing on various pieces of code,
> i'm curious. Do we end up with more or less or about the same number of
> basic blocks on the trees, as we do for the same tree in RTL?
> 
It depends greatly on the control structure of the function.  A
tree CFG will create several header blocks that we should be able
to remove.  OTOH, rtl CFGs may have more jumps and have more IL
elements per block.

At the moment, CFGs for trees are bulkier than their rtl
counter-parts.

A *very* rough count from bootstrapping GCC resulted in:

10561 functions.
2299 (22%) functions where nodes(tree) < 0.8 x nodes(rtl).
1769 (17%) functions where nodes(tree) ~= nodes(rtl).
6493 (61%) functions where nodes(tree) > 1.2 x nodes(rtl).


Diego.