Flow analysis and optimization with computed gotos

[Richard Henderson]

On Tue, Dec 05, 2000 at 02:30:15AM -0500, Brad Lucier wrote:
> In these cases I'd be happier if these abnormal critical edges were
> just ignored, if that would be possible, and gcse performed on the
> subgraphs that do not involve these edges.

This sounds like an extraordinarily reasonable idea.

Certainly this scheme seems much easier than figuring out how
to work around the edges after the fact.  Plus you'll get some
measure of cross-block optimization on your subgraphs that you
weren't getting on your larger functions.

We'd need modifications to the gcse/lcm code to allow it to work
on subgraphs (which would likely reduce max memory footprint at
the same time).  We'd also need code to appropriately partition
the CFG; presumably there are well-known algorithms for doing this.



r~