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

To: Richard Henderson <rth at redhat dot com>
Subject: Re: Flow analysis and optimization with computed gotos
From: Jamie Lokier <egcs at tantalophile dot demon dot co dot uk>
Date: Sat, 9 Dec 2000 11:42:05 +0100
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: <Pine.GSO.4.21.0012032302070.26391-200000@platon> <200012050730.eB57UGd08804@polya.math.purdue.edu> <20001205002825.A31454@redhat.com>

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

References:
- Re: Flow analysis and optimization with computed gotos
  - From: Michael Matz
- Re: Flow analysis and optimization with computed gotos
  - From: Brad Lucier
- Re: Flow analysis and optimization with computed gotos
  - From: Richard Henderson

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