From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3498dd887729ed19
X-Google-Attributes: gid103376,public
From: kenner@lab.ultra.nyu.edu (Richard Kenner)
Subject: Re: Garbage Collection in Ada
Date: 1996/10/17
Message-ID: <545tfj$236@news.nyu.edu>#1/1
X-Deja-AN: 190172454
references: <dewar.845470908@merv> <EACHUS.96Oct16204717@spectre.mitre.org>
 <dewar.845559320@merv>
organization: New York University Ultracomputer Research Lab
newsgroups: comp.lang.ada
Date: 1996-10-17T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <dewar.845559320@merv> dewar@merv.cs.nyu.edu (Robert Dewar) writes:
>We follow the GCC model of trampolines (remember that GNU-C already has
>nested procedures, using a static chain). The trampoline is a small bit
>of code in the stack frame that loads the right static link and jumps
>to the right place.

I should add to this that not all systems need a trampoline.  For example,
on some systems (e.g., Alpha/VMS and RS/6000) a pointer to a function is
actually a pointer to a descriptor for the function.  This discriptor
contains space for a static chain.  On those systems, what gets put
on the stack and pointed to is a copy of the descriptor, not executable code.