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: Joern Rennecke <amylaar at redhat dot com>
- Subject: Re: Flow analysis and optimization with computed gotos
- From: Richard Henderson <rth at redhat dot com>
- Date: Tue, 5 Dec 2000 11:16:04 -0800
- Cc: Brad Lucier <lucier at math dot purdue dot edu>, Michael Matz <matzmich at cs dot tu-berlin dot de>, gcc at gcc dot gnu dot org, feeley at iro dot umontreal dot ca, hosking at cs dot purdue dot edu, Andrew Macleod <amacleod at redhat dot com>
- References: <20001205002825.A31454@redhat.com> <200012051526.eB5FQce28927@tantra.cygnus.co.uk>
On Tue, Dec 05, 2000 at 03:26:38PM +0000, Joern Rennecke wrote:
> We can still pretend to work on the entire graph, and thus get all
> subgraphs.
But part of the problem with Brad's test cases is the relatively
complete connectivity of the graph. For such examples it would
seem to be most efficient to actually operate on the subgraphs.
r~