3 ms·
I see. This indeed adds a lot more complexity to the GC as it will have to check every integer or type that "looks" like a reference. Does this also mean that
by kenshiro_o 13y ago
I see. This indeed adds a lot more complexity to the GC as it will have to check every integer or type that "looks" like a reference.
Does this also mean that GC times will likely be longer in Go 1.3? There is not much detailed info about the Go runtime (like we do have for Java for instance) so it would great for the Go maintainers to publish a more in-depth reference of the internals of the language in version 1.3 /
- cpeterso 13y agoPrecise (or "exactly rooted") GC should have shorter GC pause times because the runtime knows where to look for references to GC objects, rather than scanning stacks and the heap for bytes that might look like a pointer. The problem is that writing code to use precise GC is more cumbersome because you have to worry about extra bookkeeping code for every pointer reference to a GC'd object.
- deleted 13y ago[deleted]
- fulafel 13y agoConservative is where you check every word that looks like a pointer. But it's simpler, it's just brute force.