This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Flow analysis and optimization with computed gotos
- To: rth at redhat dot com (Richard Henderson)
- Subject: Re: Flow analysis and optimization with computed gotos
- From: Joern Rennecke <amylaar at redhat dot com>
- Date: Tue, 5 Dec 2000 15:26:38 +0000 (GMT)
- Cc: lucier at math dot purdue dot edu (Brad Lucier), matzmich at cs dot tu-berlin dot de (Michael Matz), gcc at gcc dot gnu dot org, feeley at iro dot umontreal dot ca, hosking at cs dot purdue dot edu, amacleod at redhat dot com (Andrew Macleod)
> 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.
If we handle the abnormal edges as killing all expressions, this will
automatically partition the graph into as many subgraphs as necessary.
We can still pretend to work on the entire graph, and thus get all
subgraphs.