Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!world!iecc!compilers-sender
From: preston@ariel.rice.edu (Preston Briggs)
Newsgroups: comp.compilers
Subject: Re: Code folding from JSR/RTS -> {Local}
Keywords: optimize, architecture, bibliography
Message-ID: <1991May3.055129.29367@rice.edu>
Date: 3 May 91 05:51:29 GMT
References: <7524@ecs.soton.ac.uk> <1991May1.035622.25021@daffy.cs.wisc.edu> <1991May2.212633.6893@beaver.cs.washington.edu>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: preston@ariel.rice.edu (Preston Briggs)
Organization: Rice University, Houston
Lines: 22
Approved: compilers@iecc.cambridge.ma.us

pardo@june.cs.washington.edu (David Keppel) writes:

>The cost of stack pointer update is, of course, larger than no update.  For
>larger procedures the cost is minimal.  Smaller procedures can be inlined
>and/or values just kept in registers.  It would be possible to do flow
>analysis and do one stack pointer update for several nested calls; I know of
>no such work but it's conceptually easy.

Tom Murtagh has been working on this for a while.
See, for example

	A Less Dynamic Memory Allocation Scheme for Algol-Like Languages
	Thomas P. Murtagh
	POPL 11, 1984

It seems like he's done further papers on the subject (with C. Ruggerie?), but
I can't find them right off.

Preston Briggs
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.