Flow analysis and optimization with computed gotos

[Jamie Lokier]

Richard Henderson wrote:
> 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.

A fast and simple algorithm that might be worth implementing for other
reasons:

   R. Johnson and D. Pearson and K. Pingali, "The program structure tree:
   Computing control regions in linear time".  In Proc. the SIGPLAN '94
   Conference on Program Language Design and Implementation, June 1994.

   ftp://ftp.cs.cornell.edu/pub/pidgin/TyphoonCompiler/papers-ps/94-pldi.ps

-- Jamie