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,e5eb8ca5dcea2827
X-Google-Attributes: gid103376,public
From: Hyman Rosen <hymie@prolifics.com>
Subject: Re: Ada OO Mechanism
Date: 1999/06/08
Message-ID: <t7iu8yz5u5.fsf@calumny.jyacc.com>#1/1
X-Deja-AN: 487253293
Sender: hymie@calumny.jyacc.com
References: <7i05aq$rgl$1@news.orbitworld.net> <7i17gj$1u1k@news2.newsguy.com>
 <t7lneeqlzf.fsf@calumny.jyacc.com> <7icgkg$k4q$1@nnrp1.deja.com>
 <t7g14mqe7b.fsf@calumny.jyacc.com> <3749E9EC.2842436A@aasaa.ofe.org>
 <7id2eo$fag@drn.newsguy.com> <3749FF7D.F17CE16A@aasaa.ofe.org>
 <umq4sl1h66q.fsf@maestro.clustra.com> <374AC676.F7AE0772@lmco.com>
 <t7iu9hrqpw.fsf@calumny.jyacc.com> <7ieuja$5v9@news1.newsguy.com>
 <t7675gswiv.fsf@calumny.jyacc.com> <7ifd6l$bmf@sjx-ixn1.ix.netcom.com>
 <t7zp2sr6yf.fsf@calumny.jyacc.c <t7r9nmz8ou.fsf@calumny.jyacc.com>
 <1999Jun8.175959.1@eisner>
Content-Type: text/plain; charset=us-ascii
X-Complaints-To: abuse@panix.com
X-Trace: news.panix.com 928880694 27721 209.49.126.226 (8 Jun 1999 22:24:53
 GMT)
Organization: PANIX Public Access Internet and UNIX, NYC
Mime-Version: 1.0
User-Agent: Gnus/5.070084 (Pterodactyl Gnus v0.84) Emacs/20.3
NNTP-Posting-Date: 8 Jun 1999 22:24:53 GMT
Newsgroups: comp.lang.ada
Date: 1999-06-08T22:24:53+00:00
List-Id: <comp.lang.ada>

kilgallen@eisner.decus.org (Larry Kilgallen) writes:
> At a more basic level, storing a variable length structure on the stack
> requires that the machine code alter the amount of stack consumed on
> one call from the next.  Many other languages do not have programmer-
> visible constructs that do such a run-time determination, so perhaps
> that is what makes the concept seem strange.

They also don't have functions which return variable-length objects.
Where does the function return value live between the time the
function returns and the time that space is allocated for the variable
on the stack, using the size information in the return value?