🚀 go-pugleaf

Dick Menninger <Dick.Menninger@daytonoh.attgis.com> wrote:

[snip]

>Also, how about the case of several of these in one stack frame.
>The "start" (i.e., address) of some is affected by the size of others
>rather than just being an offset into the stack frame from the frame
>pointer.  That makes the solution messier to do and starts favoring
>the various heap schemes for this as preserving fixed frame offsets
>is usually a very good thing to do.

I remember the old TI 990 Pascal (God am I getting old.)

Dynamically sized arrays could be placed on the stack.  If there were
multiples, the sum of all the sizes was was subtracted (added?) to the
stack pointer and then a pointer to the appropriate place in this
stack frame was where you found the array.  Of course, all of this was
done automatically.

Ralph Shnelvar      "We make tape drives work like disk drives"
President           http://www.ecnet.com/tpd/index.html
TAPEDISK Corporation


[Moderator's note: this discussion is still relevant to the design of
C++, but it's beginning to edge in a different direction.  Please
think about which newsgroup(s) your response belongs in.  mha]

---
[ comp.std.c++ is moderated.  Submission address: std-c++@ncar.ucar.edu.
  Contact address: std-c++-request@ncar.ucar.edu.  The moderation policy
  is summarized in http://dogbert.lbl.gov/~matt/std-c++/policy.html. ]