Hi all, the following paper describes a variant of the root-finding approach we use for the framework GC:
http://citeseer.ist.psu.edu/henderson02accurate.html They use a "shadow stack" as well, but keep all their GCed locals always in it: The tradeoffs are slightly different than ours. They reach performance quite similar to that of the Boehm GC with a simple semispace collector. Chris Lattner told me that this is how LLVM lowers GC operations currently (since no backend directly supports the GC primitives in a better way). Cheers, Carl Friedrich _______________________________________________ [email protected] http://codespeak.net/mailman/listinfo/pypy-dev
