🚀 Visualizing memory management in V8 Engine (JavaScript, NodeJS, Deno, WebAssembly)

Please follow me on Twitter for updates and let me know if something can be improved in the post.

In this multi-part series, I aim to demystify the concepts behind memory management and take a deeper look at memory management in some of the modern programming languages. I hope the series would give you some insights into what is happening under the hood of these languages in terms of memory management.

In this chapter, we will look at the memory management of the V8 Engine for ECMAScript and WebAssembly, used by runtimes like NodeJS, Deno & Electron and web browsers like Chrome, Chromium, Brave, Opera, and Microsoft Edge. Since JavaScript is an interpreted language, it needs an engine to interpret and execute code. The V8 engine interprets JavaScript and compiles it down to native machine code. V8 is written in C++ and can be embedded in any C++ application.

If you haven’t read the first part of this series, please read it first as I explained the difference between the Stack and Heap memory there which would be useful to understand this chapter.

V8 memory structure

First, let us see what the memory structure of the V8 engine is. Since JavaScript is single-threaded V8 also uses a single process per JavaScript context and hence if you use service workers it will spawn a new V8 process per worker. A running program is always represented by some allocated memory in the V8 process and this is called Resident Set. This is further divided into different segments as below:

This is slightly similar to the JVM memory structure we saw in the previous chapter. Let us see what the different segments are for:

Heap Memory

This is where V8 stores objects or dynamic data. This is the biggest block of memory area and this is where Garbage Collection(GC) takes place. The entire heap memory is not garbage collected, only the Young and Old space is managed by garbage collection. Heap is further divided into below:

New Space : New space or “Young generation” is where new objects live and most of these objects are short-lived. This space is small and has two semi-space , similar to S0 & S1 in JVM. This space is managed by the “Scavenger(Minor GC)” , we will look at it later. The size of the new space can be controlled using the --min_semi_space_size (Initial) and --max_semi_space_size (Max) V8 flags.

: New space or is where new objects live and most of these objects are short-lived. This space is small and has two , similar to & in JVM. This space is managed by the , we will look at it later. The size of the new space can be controlled using the (Initial) and (Max) V8 flags. Old Space : Old space or “Old generation” is where objects that survived the “New space” for two minor GC cycles are moved to. This space is managed up by the Major GC(Mark-Sweep & Mark-Compact)” , we will look at it later. The size of old space can be controlled using the --initial_old_space_size (Initial) and --max_old_space_size (Max) V8 flags. This space is divided into two: Old pointer space : Contains survived objects that have pointers to other objects. Old data space : Contains objects that just contain data(no pointer to other objects). Strings, boxed numbers, and arrays of unboxed doubles are moved here after surviving in “New space” for two minor GC cycles.

: Old space or is where objects that survived the “New space” for two minor GC cycles are moved to. This space is managed up by the , we will look at it later. The size of old space can be controlled using the (Initial) and (Max) V8 flags. This space is divided into two: Large object space : This is where objects which are larger than the size limits of other spaces live. Each object gets its own [mmap](https://en.wikipedia.org/wiki/Mmap)'d region of memory. Large objects are never moved by the garbage collector.

: This is where objects which are larger than the size limits of other spaces live. Each object gets its own region of memory. Large objects are never moved by the garbage collector. Code-space : This is where the Just In Time(JIT) compiler stores compiled code Blocks. This is the only space with executable memory (although Codes may be allocated in “Large object space”, and those are executable, too).

: This is where the compiler stores compiled code Blocks. This is the only space with executable memory (although may be allocated in “Large object space”, and those are executable, too). Cell space, property cell space, and map space: These spaces contain Cells , PropertyCells , and Maps , respectively. Each of these spaces contains objects which are all the same size and has some constraints on what kind of objects they point to, which simplifies collection.

Each of these spaces is composed of a set of pages. A Page is a contiguous chunk of memory allocated from the operating system with mmap (or [MapViewOfFile](https://docs.microsoft.com/en-us/windows/win32/api/memoryapi/nf-memoryapi-mapviewoffile) on Windows). Each page is 1MB in size, except for Large object space.

Stack

This is the stack memory area and there is one stack per V8 process. This is where static data including method/function frames, primitive values, and pointers to objects are stored. The stack memory limit can be set using the --stack_size V8 flag.

V8 memory usage (Stack vs Heap)

Now that we are clear about how memory is organized let’s see how the most important parts of it are used when a program is executed.

Let’s use the below JavaScript program, the code is not optimized for correctness hence ignore issues like unnecessary intermediatory variables and such, the focus is to visualize stack and heap memory usage.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 class Employee { constructor ( name , salary , sales ) { this . name = name ; this . salary = salary ; this . sales = sales ; } } const BONUS_PERCENTAGE = 10 ; function getBonusPercentage ( salary ) { const percentage = ( salary * BONUS_PERCENTAGE ) / 100 ; return percentage ; } function findEmployeeBonus ( salary , noOfSales ) { const bonusPercentage = getBonusPercentage ( salary ); const bonus = bonusPercentage * noOfSales ; return bonus ; } let john = new Employee ( " John " , 5000 , 5 ); john . bonus = findEmployeeBonus ( john . salary , john . sales ); console . log ( john . bonus );

Click on the slides and move forward/backward using arrow keys to see how the above program is executed and how the stack and heap memory is used:

Note: If the slides look cut off at edges, then click on the title of the slide or here to open it directly in SpeakerDeck.

As you can see:

Global scope is kept in a “Global frame” on the Stack

is kept in a “Global frame” on the Stack Every function call is added to the stack memory as a frame-block

All local variables including arguments and the return value is saved within the function frame-block on the Stack

All primitive types like int & string are stored directly on the Stack. This applies to global scope as well and yes String is a primitive type in JavaScript

& are stored directly on the Stack. This applies to global scope as well and yes String is a primitive type in JavaScript All object types like Employee & Function are created on the Heap and is referenced from the Stack using Stack pointers. Functions are just objects in JavaScript. This applies to global scope as well

& are created on the Heap and is referenced from the Stack using Stack pointers. Functions are just objects in JavaScript. This applies to global scope as well Functions called from the current function is pushed on top of the Stack

When a function returns its frame is removed from the Stack

Once the main process is complete, the objects on the Heap do not have any more pointers from Stack and becomes orphan

Unless you make a copy explicitly, all object references within other objects are done using reference pointers

The Stack as you can see is automatically managed and is done so by the operating system rather than V8 itself. Hence we do not have to worry much about the Stack. The Heap, on the other hand, is not automatically managed by the OS and since its the biggest memory space and holds dynamic data, it could grow exponentially causing our program to run out of memory over time. It also becomes fragmented over time slowing down applications. This is where garbage collection comes in.

Distinguishing pointers and data on the heap is important for garbage collection and V8 uses the “Tagged pointers” approach for this - in this approach, it reserves a bit at the end of each word to indicate whether it is pointer or data. This approach requires limited compiler support, but it’s simple to implement while being fairly efficient.

V8 Memory management: Garbage collection

Now that we know how V8 allocates memory, let us see how it automatically manages the Heap memory which is very important for the performance of an application. When a program tries to allocate more memory on the Heap than that is freely available(depending on the V8 flags set) we encounter out of memory errors. An incorrectly managed heap could also cause a memory leak.

V8 manages the heap memory by garbage collection. In simple terms, it frees the memory used by orphan objects, i.e, objects that are no longer referenced from the Stack directly or indirectly(via a reference in another object) to make space for new object creation.

Orinoco is the codename of the V8 GC project to make use of parallel, incremental and concurrent techniques for garbage collection, to free the main thread.

The garbage collector in V8 is responsible for reclaiming the unused memory for reuse by the V8 process.

V8 garbage collectors are generational(Objects in Heap are grouped by their age and cleared at different stages). There are two stages and three different algorithms used for garbage collection by V8:

Minor GC (Scavenger)

This type of GC keeps the young or new generation space compact and clean. Objects are allocated in new-space, which is fairly small (between 1 and 8 MB, depending on behavior heuristics). Allocation in “new space” is very cheap: there is an allocation pointer which we increment whenever we want to reserve space for a new object. When the allocation pointer reaches the end of the new space, minor GC is triggered. This process is also called Scavenger and it implements Cheney’s algorithm. It occurs frequently and uses parallel helper threads and is very fast.

Let us look at the minor GC process:

The new space is divided into two equal-sized semi-spaces: to-space and from-space. Most allocations are made in from-space (except certain kinds of objects, such as executable Codes which are always allocated in old-space). When from-space fills up the minor GC is triggered.

Click on the slides and move forward/backward using arrow keys to see the process:

Note: If the slides look cut off at edges, then click on the title of the slide or here to open it directly in SpeakerDeck.

Let us assume that there are already objects on the “from-space” when we start(Blocks 01 to 06 marked as used memory) The process creates a new object(07) V8 tries to get required memory from from-space, but there is no free space in there to accommodate our object and hence V8 triggers minor GC Minor GC recursively traverses the object graph in “from-space” starting from stack pointers(GC roots) to find objects that are used or alive(Used memory). These objects are moved to a page in the “to-space”. Any objects reference by these objects are also moved to this page in “to-space” and their pointers are updated. This is repeated until all the objects in “from-space” are scanned. By end of this, the “to-space” is automatically compacted reducing fragmentation Minor GC now empties the “from-space” as any remaining object here is garbage Minor GC swaps the “to-space” and “from-space”, all the objects are now in “from-space” and the “to-space” is empty The new object is allocated memory in the “from-space” Let us assume that some time has passed and there are more objects on the “from-space” now(Blocks 07 to 09 marked as used memory) The application creates a new object(10) V8 tries to get required memory from “from-space”, but there is no free space in there to accommodate our object and hence V8 triggers second minor GC The above process is repeated and any alive objects that survived second minor GC is moved to the “Old space”. First-time survivors are moved to the “to-space” and remaining garbage is cleared from “from-space” Minor GC swaps the “to-space” and “from-space”, all the objects are now in “from-space” and the “to-space” is empty The new object is allocated memory in the “from-space”

So we saw how minor GC reclaims space from the young generation and keeps it compact. It is a stop-the-world process but it’s so fast and efficient that it is negligible most of the time. Since this process doesn’t scan objects in the “old space” for any reference in the “new space” it uses a register of all pointers from old space to new space. This is recorded to the store buffer by a process called write barriers.

Major GC

This type of GC keeps the old generation space compact and clean. This is triggered when V8 decides there is not enough old space, based on a dynamically computed limit, as it gets filled up from minor GC cycles.

The Scavenger algorithm is perfect for small data size but is impractical for large heap, as the old space, as it has memory overhead and hence major GC is done using the Mark-Sweep-Compact algorithm. It uses a tri-color(white-grey-black) marking system. Hence major GC is a three-step process and the third step is executed depending on a fragmentation heuristic.

Marking : First step, common for both algorithms, where garbage collector identifies which objects are in use and which ones are not in use. The objects in use or reachable from GC roots(Stack pointers) recursively are marked as alive. It’s technically a depth-first-search of the heap which can be considered as a directed graph

: First step, common for both algorithms, where garbage collector identifies which objects are in use and which ones are not in use. The objects in use or reachable from GC roots(Stack pointers) recursively are marked as alive. It’s technically a depth-first-search of the heap which can be considered as a directed graph Sweeping : The garbage collector traverses the heap and makes note of the memory address of any object that is not marked alive. This space is now marked as free in the free-list and can be used to store other objects

: The garbage collector traverses the heap and makes note of the memory address of any object that is not marked alive. This space is now marked as free in the free-list and can be used to store other objects Compacting: After sweeping, if required, all the survived objects will be moved to be together. This will decrease fragmentation and increase the performance of allocation of memory to newer objects

This type of GC is also referred to us stop-the-world GC as they introduce pause-times in the process while performing GC. To avoid this V8 uses techniques like

Incremental GC : GC is done in multiple incremental steps instead of one.

: GC is done in multiple incremental steps instead of one. Concurrent marking : Marking is done concurrently using multiple helper threads without affecting the main JavaScript thread. Write barriers are used to keep track of new references between objects that JavaScript creates while the helpers are marking concurrently.

: Marking is done concurrently using multiple helper threads without affecting the main JavaScript thread. Write barriers are used to keep track of new references between objects that JavaScript creates while the helpers are marking concurrently. Concurrent sweeping/compacting : Sweeping and compacting are done in helper threads concurrently without affecting the main JavaScript thread.

: Sweeping and compacting are done in helper threads concurrently without affecting the main JavaScript thread. Lazy sweeping. Lazy sweeping involves delaying the deletion of garbage in pages until the memory is required.

Let us look at the major GC process:

Let us assume that many minor GC cycles have passed and the old space is almost full and V8 decides to trigger a “Major GC” Major GC recursively traverses the object graph starting from stack pointers to mark objects that are used as alive(Used memory) and remaining objects as garbage(Orphans) in the old space. This is done using multiple concurrent helper threads and each helper follows a pointer. This does not affect the main JS thread. When concurrent marking is done or if memory limit is reached the GC does a mark finalization step using the main thread. This introduces a small pause-time. Major GC now marks all orphan object’s memory as free using concurrent sweep threads. Parallel compaction tasks are also triggered to move related blocks of memory to the same page to avoid fragmentation. Pointers are updated during these steps.

Conclusion

This post should give you an overview of the V8 memory structure and memory management. This is not exhaustive, there are a lot more advanced concepts and you can learn about them from v8.dev. But for most JS/WebAssembly developers this level of information would be sufficient and I hope it helps you write better code, considering these in mind, for more performant applications and keeping these in mind would help you to avoid the next memory leak issue you might encounter otherwise.

I hope you had fun learning about the V8 internals, stay tuned for the next post in the series.

References

If you like this article, please leave a like or a comment.

You can follow me on Twitter and LinkedIn.

Also published at Dev.to