Re: Code folding from JSR/RTS -> {Local}

preston@ariel.rice.edu (Preston Briggs)
Fri, 3 May 91 05:51:29 GMT

          From comp.compilers
Related articles
Code folding from JSR/RTS -> {Local} carter@cs.wisc.edu (1991-05-01)
Re: Code folding from JSR/RTS -> {Local} byron@archone.tamu.edu (1991-05-02)
Re: Code folding from JSR/RTS -> {Local} pardo@june.cs.washington.edu (1991-05-02)
Re: Code folding from JSR/RTS -> {Local} preston@ariel.rice.edu (1991-05-03)
Re: Code folding from JSR/RTS -> {Local} deutsch@lix.polytechnique.fr (1991-05-13)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@ariel.rice.edu (Preston Briggs)
Keywords: optimize, architecture, bibliography
Organization: Rice University, Houston
References: <7524@ecs.soton.ac.uk> <1991May1.035622.25021@daffy.cs.wisc.edu> <1991May2.212633.6893@beaver.cs.washington.edu>
Date: Fri, 3 May 91 05:51:29 GMT

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
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.