On Sun, Aug 4, 2013 at 6:24 PM, David Jeske <[email protected]> wrote:
> > On Aug 4, 2013 2:50 PM, "Jonathan S. Shapiro" <[email protected]> wrote: > > Yes. This "one, maybe two" problem is an example of a region whose size > is not statically boundable. Such regions may indeed need GC, though it's > at least a very fast, generational-style GC that does not have to consider > pointers from tenured space to new space. > > ... What is the difference between this and young generation scavenge? > Seems the same to me. > One requires a scavenge. The other usually doesn't. > To me it seems we are discussing (a) statically sized regions... Which > are already handled well by the stack, and (b) dynamic regions which need > GC that are already handled well by young generation scavenge. > It's not that black and white, and while regions can go on the stack, you have to *do* the region analysis to learn which items can safely be stack allocated. shap
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
