[m-dev.] Reuse question

[Peter Ross]

On Tue, Oct 03, 2000 at 11:21:58AM +1100, Fergus Henderson wrote:
> On 02-Oct-2000, Peter Ross <petdr at miscrit.be> wrote:
> > On Mon, Oct 02, 2000 at 04:08:20PM +0200, Peter Ross wrote:
> > > On Mon, Oct 02, 2000 at 06:38:33AM -0700, Ralph Becket wrote:
> > > > How low-level does the reuse analysis go?  It would be nice if, when
> > > > mapping over a list of cells that are then up for reuse, the list cells
> > > > were updated in place.
> > > > 
> > > Yes the current analysis detects that there is reuse available there
> > > provided that the original list is never needed again.
> > 
> > I lied the current analysis doesn't mark it for reuse because the
> > predicate contains an higher order call.  Higher order calls are
> > currently handled by setting the possible aliasing to top (everything is
> > possibly aliased with everything else).
> 
> If you compile with appropriate optimization enabled (e.g.
> -O6 --intermodule-optimization), the compiler should specialize
> the code for list__map, and convert the higher-order call into a first-order
> call.
> 
> Is reuse analysis getting done before higher-order specialization?
> 
Reuse analysis is the last operation of the middle_pass.

Pete
--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------