On Wed, Nov 13, 2013 at 6:05 AM, Ben Kloosterman <[email protected]> wrote:
> On Tue, Nov 12, 2013 at 11:03 PM, Jonathan S. Shapiro <[email protected]>wrote: > >> 2. Stack is modeled as a non-dense linear sequence of bump-allocated >> objects. Non-reference data may intervene between these objects. The cost >> of this is that per-line metadata must be maintained so that object start >> positions can be located. >> > >> I kind of favoured this at first but if you have a 32 bit Vtable these > can be put down in 1 word which will not be much more than setting a bit > and a bit set will be an add for reference using methods. > Unfortunately not. There is a computation needed to find the metadata byte, and then a second computation to determine which bit to set. The bit tracking idea definitely has marginal overhead. > Its important to note we are talking about function as objects here as you > say. > I wasn't talking about functions as objects. I was talking about the structure of the stack. > Obviously you have to handle end of block /start of block (probably dummy >> calls that do nothing with a header). >> > I wasn't assuming a size-alterable stack. That's a separate issue. shap
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
