|Heap Allocated Stack Frame x86 Compiler? firstname.lastname@example.org (Bruce) (2002-09-03)|
|Re: Heap Allocated Stack Frame x86 Compiler? email@example.com (Stephen J. Bevan) (2002-09-08)|
|Re: Heap Allocated Stack Frame x86 Compiler? firstname.lastname@example.org (Peter \Firefly\Lund) (2002-09-08)|
|Re: Heap Allocated Stack Frame x86 Compiler? email@example.com.OZ.AU (Fergus Henderson) (2002-09-08)|
|Re: Heap Allocated Stack Frame x86 Compiler? firstname.lastname@example.org (Ira Baxter) (2002-09-08)|
|Re: Heap Allocated Stack Frame x86 Compiler? email@example.com (Paolo Bonzini) (2002-09-12)|
|From:||"Ira Baxter" <firstname.lastname@example.org>|
|Date:||8 Sep 2002 22:57:44 -0400|
|Posted-Date:||08 Sep 2002 22:57:44 EDT|
"Bruce" <email@example.com> wrote in message
> Is there a compiler available that will create native x86 code that
> makes no use of the stack. Instead it could dynamically allocate space
> for a stack frame on the heap and then set the EBP and ESP registers
> and then use the stack as normal.
> I searched the internet but all I can find are langauges such as
> python and PicoC that run on top of virtual machines.
> A C compiler would be ideal but any language would do.
> [I doubt there are any 386 compilers that do heap allocation of
> individual call frames, since you need a stack anyway to handle
> interrupts ..... -John]
Our PARLANSE programming language allocates all working storage on the
heap, by doing exactly what Bruce said. (You can't use a single
global stack when you have a parallel program). That means you have
to have fast stack frame allocation and deallocation procedures to
implement this, which we do by providing per-processor queues of
frames of various sizes. We pay a 5-10% penalty for calling functions
this way for functions the size of FIBONACCI, etc.
It seems a bit odd to say "it doesn't use the stack" when ESP is
explicitly involved. It is true that it isn't using the "big stack
model" assumed by most flat-address space OSes like Uniz and W/NT.
PARLANSE is very C-like in capability with all kinds of additional
parallelism facilities, including exception handling that works
cheaply and cleanly across parallelism boundaries. However, Bruce
didn't say what he really wanted to do, so it isn't clear that
PARLANSE will really satisfy his needs. See the website for a few
Ira Baxter, Ph.D. CTO Semantic Designs
Return to the
Search the comp.compilers archives again.