This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]

Re: Flow analysis and optimization with computed gotos


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~

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]