At 7:45 PM -0400 6/13/02, Melvin Smith wrote:
I do not like the fact that we have to use keyed access at a low level
to accomplish this, so I hope we consider adding random access
to stacks.
It's on the list--it's just never gotten implemented. Time to fix
that, I think. We've added (or are
I've just committed the 3rd revision of the Parrot intermediate compiler.
Angel Faus has added register spilling to work with the graph-coloring
allocator. Currently we spill regs to an array in P31. Given that we don't
have random access stacks, this is the only fast way to do this.
Much thanks
