Go: How Does the Garbage Collector Mark the Memory?

Vincent Blanchon
Nov 3 · 5 min read
Illustration created for “A Journey With Go”, made from the original Go Gopher, created by Renee French.

ℹ️ This article is based on Go 1.13. The notions about memory management discussed here are explained in my article “Go: Memory Management and Allocation.”

The Go garbage collector is responsible for collecting the memory that is not in use anymore. The implemented algorithm is a concurrent tri-color mark and sweep collector. In this article, we will see in detail the marking phase, along with the usage of the different colors.

You can find more information about the different types of garbage collector in “Visualizing Garbage Collection Algorithms” by Ken Fox.

Marking phase

This phase performs a scan of the memory to know which blocks are still in use by our code and which ones should be collected.

However, since the garbage collector can run concurrently with our Go program, it needs a way to detect potential changes in the memory while scanning. To tackle that potential issue, an algorithm of write barrier is implemented and will allow Go to track any pointer changes. The only condition to enable write barriers is to stop the program for a short time, also called “Stop the World”:

Go also starts, at the beginning of the process, a marking worker per processor that help with marking the memory.

Then, once the roots have been enqueued for processing, the marking phase can start traversing and coloring the memory.

Let’s now take an example with a simple program that will allow us to follow the steps done during the marking phase:

Since the struct subStruct does not contain any pointer, it is stored in a span dedicated to objects with no reference to other objects:

structs with no pointer are stored in different spans

This makes the job of the garbage collector easier since it does not have to scan this span when marking the memory.

Once the allocations are done, our program forces the garbage collector to run for a cycle. Here is the workflow:

memory scan

The garbage collector starts from the stack and follows pointers recursively to go through the memory. Spans that are marked as no scan stop the scanning. However, this process is not done by the same goroutine; each pointer is enqueued in a work pool. Then, the background mark workers seen previously dequeue works from this pool, scan the objects and then enqueue the pointers found in it:

garbage collector work pool

Coloring

The workers now need a way to track which memory has been scanned or not. The garbage collector uses a tri-color algorithm that works as follows:

  • all objects are considered white at the beginning
  • the root objects (stacks, heap, global variables) will be colored in grey

Once this primary step is done, the garbage collector will:

  • pic a grey object, color it as black
  • follow all the pointers from this object and color all referenced objects in grey

Then, it will repeat those two steps until there are no more objects to color. From this point, the objects are either black or white. The white set represents objects that are not referenced by any other object and ready to be collected.

Here is a representation of it using the previous example:

As a first state, all objects are considered white. Then, the objects are traversed and the ones reachable will turn grey. If an object is in a span marked as no scan, it can be painted in black since it does not need to be scanned:

Grey objects are now enqueued to be scanned and turn black:

The same thing happens for the objects enqueue until there are no more objects to process:

At the end of the process, black objects are the ones in-use in memory when white objects are the ones to be collected. As we can see, since the instance of struct2 has been created in an anonymous function and is not reachable from the stack, it stays white and can be cleaned.

The colors are internally implemented thanks to a bitmap attribute in each span called gcmarkBits that traces the scan with setting to 1 the corresponding bit:

color implementation with a bitmap

As we can see, the black and the grey color works the same way. The difference in the process is that the grey color enqueues an object to be scanned when black objects end the chain.

The garbage finally stops the world, flushes the changes made on each write barrier to the work pool and performs the remaining marking.

You can find more details about the concurrent processes and the marking phase in the garbage collector in my article “Go: How Does the Garbage Collector Watch Your Application.”

Runtime profiler

The tools provided by Go allow us to visualize all those steps and see the impact of the garbage collector in our programs. Running our code with the tracing enabled provides a big picture of the previous steps. Here are the traces:

traces of the garbage collector

The cycle of life of the marking worker can also be visualized in the tracer at the goroutine level. Here an example with the goroutine #33, which is waiting in background first before starting to mark the memory.

marking worker

A Journey With Go

A Journey With Go Language Programming

Vincent Blanchon

Written by

French Gopher in Dubai

A Journey With Go

A Journey With Go Language Programming

Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch
Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore
Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just $5/month. Upgrade