Skip to content

Comment on Conservative GC can be faster than precise GCparent

Comments

If the compiler puts out a stack map that is conservative, then the GC scan will be effectively conservative. The compiler has to compensate for that somehow. If a temporary location is in the stackmap, such that the value in it is a dead value before a function call, the compiler has to insert an instruction to null out that temporary location.

And the same can of course be done under conservative GC...

But it won't, because people implement conservative GCs when they are not in control of all the pieces, like the compilers used for some parts of their run-time.

The point of the post is that conservative GC can be useful for reasons other than that simple lack of control.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.