1# GC 2 3Garbage Collection (GC) is a process that identifies and reclaims memory no longer in use by a program. It aims to free up unused memory space. Modern programming languages implement two primary types of GC algorithms: reference counting and tracing GC. 4 5## GC Algorithm Overview 6 7### Types of GC 8 9#### Reference Counting 10When object A is referenced by object B, A's reference count increases by 1. Conversely, when the reference is removed, A's reference count decreases by 1. When A's reference count reaches 0, object A is reclaimed. 11 12- Pros: Reference counting is simple to implement and allows for immediate memory reclamation, avoiding a dedicated Stop The World (STW) phase where the application is paused. 13- Cons: The extra counting step during object manipulation increases the overhead of memory allocation and assignment, affecting performance. Most critically, it fails to handle circular references. 14 15``` 16class Parent { 17 constructor() { 18 this.child = null; 19 } 20 child: Child | null = null; 21} 22 23class Child { 24 constructor() { 25 this.parent = null; 26 } 27 parent: Parent | null = null; 28} 29 30function main() { 31 let parent: Parent = new Parent(); 32 let child: Child = new Child(); 33 parent.child = child; 34 child.parent = parent; 35} 36``` 37In the example above, parent holds a reference to child, and child holds a reference to parent. This circular reference means that neither object's reference count will reach zero, even after the **main** function ends, resulting in a memory leak. 38 39#### Tracking GC 40 41 42 43Tracing GC identifies live objects by traversing the object graph starting from root objects, which include stack objects and global objects that are guaranteed to be alive. Objects referenced by these root objects are also considered live. The traversal marks all reachable objects (blue) as live, whereas unreachable objects (yellow) are considered garbage. 44 45- Pros: Tracing GC solves the circular reference problem and does not incur additional overhead during memory allocation and assignment. 46- Cons: Tracing GC is more complex than reference counting and introduces a brief STW phase. Additionally, GC can be delayed, leading to floating garbage. 47 48Given the limitations of reference counting, especially the critical issue of circular references, ArkTS Runtime uses tracing GC. 49 50### Types of Tracing GC 51 52Tracing GC algorithms identify garbage by traversing the object graph. Based on the collection method, tracing GC can be categorized into three basic types: mark-sweep, mark-copy, and mark-compact. In the diagrams below, blue indicates live objects, whereas yellow indicates garbage. 53 54#### Mark-Sweep Collection 55 56 57 58After traversing the object graph, the algorithm clears the contents of unreachable objects and places them in a free list for future allocations. 59This approach is highly efficient as it does not move objects. However, it can lead to memory fragmentation, reducing allocation efficiency and potentially preventing the allocation of large objects despite ample free memory. 60 61#### Mark-Copy Collection 62 63 64 65During the traversal of the object graph, reachable objects are copied to a new, contiguous memory space. After the traversal, the old memory space is reclaimed entirely. 66This approach eliminates memory fragmentation and completes the GC process in a single traversal, making it efficient. However, it requires reserving half of the memory space to ensure all live objects can be copied, resulting in lower space utilization. 67 68#### Mark-Compact Collection 69 70 71 72After the traversal, live objects (blue) are copied to the beginning of the current space (or a designated area), and the copied objects are reclaimed and placed in the free list. 73This approach addresses memory fragmentation without wasting half of the memory space, though it incurs higher performance overhead when compared with mark-copy collection. 74 75### HPP GC 76 77High Performance Partial Garbage Collection (HPP GC) is designed for high performance in partial GC, leveraging generational models, hybrid algorithms, and optimized GC processes. In terms of algorithms, HPP GC uses different collection approaches based on different object regions. 78 79#### Generational Model 80 81ArkTS Runtime uses a traditional generational model, categorizing objects based on their lifetimes. Given that most newly allocated objects are short-lived and collected during the first GC cycle, whereas objects surviving multiple GC cycles are likely to remain alive, ArkTS Runtime divides objects into young and old generations, allocating them to separate spaces. 82 83 84 85Newly allocated objects are placed in the **from** space of Young Space. After surviving one GC cycle, they are moved to the **to** space, which then swaps roles with the **from** space. Objects surviving another GC cycle are copied to Old Space. 86 87#### Hybrid Algorithm 88 89HPP GC employs a hybrid algorithm combining mark-copy, mark-compact, and mark-sweep, tailored to the characteristics of young and old generation objects. 90 91- Mark-copy for young generation 92Given the short lifetimes, small size, and frequent collection of young generation objects, ArkTS Runtime uses the mark-copy algorithm to efficiently reclaim memory for these objects. 93- Mark-compact + mark-sweep for old generation 94Based on the characteristics of old generation objects, a heuristic collection set (CSet) algorithm is used. The fundamental idea behind this algorithm is to collect the sizes of live objects in each region during the marking phase. During the collection phase, ArkTS Runtime uses mark-compact for regions with fewer live objects and lower collection costs, but mark-sweep for the remaining regions. 95 96The collection policies are as follows: 97 98- Identifies regions with live object sizes below a threshold, places them in the initial CSet, and sorts them by liveness (survival rate = live object size/region size). 99 100- Selects a final CSet based on a predefined number of regions for compaction. 101 102- Sweeps the remaining regions. 103 104This heuristic approach combines the benefits of mark-compact and mark-sweep algorithms, addressing memory fragmentation while maintaining performance. 105 106#### Process Optimization 107 108HPP GC introduces extensive concurrency and parallelism optimizations to minimize the impact on application performance. The GC process includes concurrent and parallel marking, sweeping, evacuation, updating, and clearing tasks. 109 110## Heap Structure and Parameters 111 112### Heap Structure 113 114 115 116- Semi Space: space for storing young generation, that is, newly created objects with low survival rates. The copying algorithm is used to reclaim memory. 117- Old Space: space for storing old generation, that is, objects that survive multiple GC cycles. Multiple algorithms are used for memory reclamation. 118- Huge Object Space: dedicated regions for storing large objects. 119- Read Only Space: space for storing read-only data at runtime. 120- Non-Movable Space: space for storing non-movable objects. 121- Snapshot Space: space for storing heap snapshots. 122- Machine Code Space: space for storing machine codes. 123 124Each space is managed in regions, which are the units requested from the memory allocator. 125 126### Parameters 127 128> **NOTE** 129> 130> Parameters not marked as configurable are system-defined and cannot be adjusted by developers. 131 132Based on the total heap size ranges (64 MB to 128 MB, 128 MB to 256 MB, or greater than 256 MB), the system sets different sizes for the following parameters. If a parameter has a single value in the range, it remains constant regardless of the total heap size. The default total heap size for mobile phones is greater than 256 MB. 133You can use related APIs to query memory information by referring to [HiDebug API Reference](../reference/apis-performance-analysis-kit/js-apis-hidebug.md). 134 135#### Heap Size Parameters 136 137| Name| Value or Value Range| Description| 138| --- | --- | --- | 139| HeapSize | 448 MB| Default total heap size for the main thread. The value is adjusted for low-memory devices based on the actual memory pool size.| 140| SemiSpaceSize | 2–4 MB/2–8 MB/2–16 MB| Size of Semi Space.| 141| NonmovableSpaceSize | 2 MB/6 MB/64 MB | Size of Non-Movable Space.| 142| SnapshotSpaceSize | 512 KB| Size of Snapshot Space.| 143| MachineCodeSpaceSize | 2 MB| Size of Machine Code Space.| 144 145#### Worker Thread Heap Limit 146 147| Name| Value| Description| 148| --- | --- | --- | 149| HeapSize | 768 MB | Heap size for worker threads.| 150 151#### Parameters of Semi Space 152The heap contains two Semi Spaces for copying. 153 154| Name| Value or Value Range| Description| 155| --- | --- | --- | 156| semiSpaceSize | 2–4 MB/2–8 MB/2–16 MB| Size of Semi Space. The value varies according to the total heap size.| 157| semiSpaceTriggerConcurrentMark | 1 M/1.5 M/1.5 M| Threshold for independently triggering concurrent marking in Semi Space for the first time.| 158| semiSpaceStepOvershootSize| 2 MB | Maximum overshoot size of Semi Space.| 159 160#### Parameters of Old Space and Huge Object Space 161Both spaces are initialized to the remaining unallocated heap size. By default, the upper limit of OldSpaceSize of the main thread on mobile phones approaches 350 MB. 162 163| Name| Value or Value Range| Description| 164| --- | --- | --- | 165| oldSpaceOvershootSize | 4 MB/8 MB/8 MB | Maximum overshoot size of Old Space.| 166 167#### Parameters of Other Spaces 168 169| Name| Value or Value Range| Description| 170| --- | --- | --- | 171| defaultReadOnlySpaceSize | 256 KB | Default size of Read Only Space.| 172| defaultNonMovableSpaceSize | 2 MB/6 MB/64 MB | Default size of Non-Movable Space.| 173| defaultSnapshotSpaceSize | 512 KB/512 KB/ 4 MB | Default size of Snapshot Space.| 174| defaultMachineCodeSpaceSize | 2 MB/2 MB/8 MB | Default size of Machine Code Space.| 175 176#### Interpreter Stack Size 177 178| Name| Value or Value Range| Description| 179| --- | --- | --- | 180| maxStackSize | 128 KB| Maximum size of the interpreter stack.| 181 182#### Concurrency Parameters 183 184| Name| Value| Description| 185| --- | --- | --- | 186| gcThreadNum | 7 | Number of GC threads. The default value is 7. You can set this parameter using **gc-thread-num**.| 187| MIN_TASKPOOL_THREAD_NUM | 3 | Minimum number of threads in the thread pool.| 188| MAX_TASKPOOL_THREAD_NUM | 7 | Maximum number of threads in the thread pool.| 189 190Note: The thread pool is used to execute concurrent tasks in the GC process. During thread pool initialization, all the three parameters need to be considered. If **gcThreadNum** is negative, the number of threads in the initialized thread pool is the number of CPU cores divided by 2. 191 192#### Other Parameters 193 194| Name| Value| Description| 195| --- | --- | --- | 196| minAllocLimitGrowingStep | 2 M/4 M/8 M| Minimum growth step of **oldSpace**, **heapObject**, and **globalNative** when the heap size is recalculated.| 197| minGrowingStep | 4 M/8 M/16 M| Minimum growth step of **oldSpace**.| 198| longPauseTime | 40 ms| Threshold for identifying long GC pauses, which trigger detailed GC log printing for analysis. It can be set using **gc-long-paused-time**.| 199 200### Additional: The native total memory limit for ArrayBuffer within a single VM is set to 4 GB. 201 202## GC Process 203 204 205 206### Types of HPP GC 207 208#### Young GC 209 210- **When to trigger**: The young GC threshold ranges from 2 MB to 16 MB, and it can be adjusted dynamically based on the allocation speed and survival rate. 211- **Description**: primarily collects newly allocated objects in Semi Space. 212- **Scenario**: foreground 213- **Log keywords**: [ HPP YoungGC ] 214 215#### Old GC 216 217- **When to trigger**: The old GC threshold ranges from 20 MB to 300 MB. Typically, the threshold of the first old GC is about 20 MB, and the threshold for subsequent old GC operations is adjusted based on the survival rate and memory usage. 218- **Description**: compacts and compresses the young generation space and parts of the old generation space while sweeping other spaces. It occurs less frequently than young GC, with a longer duration (approximately 5 ms to 10 ms) due to full marking. 219- **Scenario**: foreground 220- **Log keywords**: [ HPP OldGC ] 221 222#### Full GC 223 224- **When to trigger**: Full GC is not triggered based on the memory threshold. After the application transitions to the background, full GC is triggered if the predicted reclaimable object size exceeds 2 MB. You can also trigger full GC using the DumpHeapSnapshot and AllocationTracker tools or calling native interfaces and ArkTS interfaces. 225- **Description**: fully compacts both young and old generations, maximizing memory reclamation in performance-insensitive scenarios. 226- **Scenario**: background 227- **Log keywords**: [ CompressGC ] 228 229Subsequent Smart GC or IDLE GC selections are made from the above three types of GC. 230 231### Trigger Strategies 232 233#### Space Threshold Triggering 234 235- Functions: **AllocateYoungOrHugeObject**, **AllocateHugeObject**, and other allocation-related functions 236- Restriction parameters: corresponding space thresholds 237- Description: GC is triggered when object allocation reaches the space threshold. 238- Log keywords: **GCReason::ALLOCATION_LIMIT** 239 240#### Native Binding Size Triggering 241 242- Functions: **GlobalNativeSizeLargerThanLimit** 243- Restriction parameters: **globalSpaceNativeLimit** 244- Description: It affects the decision for performing full marking and concurrent marking. 245 246#### Background Switch Triggering 247 248- Functions: **ChangeGCParams** 249- Description: Full GC is triggered when the application switches to the background. 250- Log keywords: **app is inBackground**, **app is not inBackground**, and 251 **GCReason::SWITCH_BACKGROUND** 252 253### Execution Strategies 254 255#### Concurrent Marking 256 257- Function: **TryTriggerConcurrentMarking** 258- Description: attempts to trigger concurrent marking and delegate the task of marking objects to the thread pool to reduce the suspension time of the UI main thread. 259- Log keywords: **fullMarkRequested**, **trigger full mark**, **Trigger the first full mark**, **Trigger full mark**, **Trigger the first semi mark**, and **Trigger semi mark** 260 261#### Adjusting Thresholds Before and After New Space GC 262 263- Function: **AdjustCapacity** 264- Description: adjusts the Semi Space trigger threshold after GC to optimize space structure. 265- Log keywords: There is no direct log. The GC statistics logs show dynamic adjustments to young space thresholds before and after GC. 266 267#### Adjusting Threshold After First Old GC 268 269- Function: **AdjustOldSpaceLimit** 270- Description: adjusts the Old Space threshold based on the minimum growth step and average survival rate. 271- Log keyword: **AdjustOldSpaceLimit** 272 273#### Adjusting Old Space/Global Space Thresholds and Growth Factors After Subsequent Old GCs 274 275- Function: **RecomputeLimits** 276- Description: recalculates and adjusts **newOldSpaceLimit**, **newGlobalSpaceLimit**, **globalSpaceNativeLimit**, and growth factors based on current GC statistics. 277- Log keyword: **RecomputeLimits** 278 279#### CSet Selection Strategies for Partial GC 280 281- Function: **OldSpace::SelectCSet()** 282- Description: selects regions with fewer live objects and lower collection costs for partial GC. 283- Typical Logs 284 - Select CSet failure: number is too few 285 - Max evacuation size is 6_MB. The CSet region number 286 - Select CSet success: number is 287 288## SharedHeap 289 290### Shared Heap Structure 291 292 293 294- Shared Old Space: shared space for storing general shared objects. The young generation and old generation are not distinguished in the shared heap. 295- Shared Huge Object Space: shared space for storing large objects. A separate region is used for each large object. 296- Shared Read Only Space: shared space for storing read-only data at runtime. 297- Shared Non-Movable Space: shared space for storing non-movable objects. 298 299Note: The shared heap is designed for objects shared across threads to improve efficiency and save memory. It does not belong to any single thread and stores objects with shared value. It typically has higher survival rates and does not involve Semi Space. 300 301## Features 302 303### Smart GC 304 305#### Description 306 307In performance-sensitive scenarios, the GC trigger threshold of the thread is temporarily adjusted to the maximum heap size (448 MB for the main thread by default), minimizing GC-triggered frame drops. (Smart GC does not take effect for the Worker thread and TaskPool thread.) However, if a performance-sensitive scenario persists too long and object allocation reaches the maximum heap size, GC is triggered, potentially resulting in longer GC times due to accumulated objects. 308 309#### Performance-Sensitive Scenarios 310 311- Application cold start 312- Application scrolling 313- Page transitions via clicks 314- Jumbo frame 315 316Currently, this feature is managed by the system, and third-party applications do not have APIs to directly call this feature. 317 318Log keyword: **SmartGC** 319 320#### Interaction Process 321 322 323 324Mark performance-sensitive scenarios by tagging the heap upon entry and exit to avoid unnecessary GCs and maintain high performance. 325 326## Log Interpretation 327 328### Enabling Full Logs 329 330By default, detailed GC logs are printed only when GC duration exceeds 40 ms. To enable logs for all GC executions, run commands on the device. 331 332**Example** 333 334```shell 335# Enable full GC logs with parameter 0x905d. Disable full GC logs and revert to the default value (0x105c). 336hdc shell param set persist.ark.properties 0x905d 337# Reboot to apply changes. 338hdc shell reboot 339``` 340 341### Typical Logs 342 343The following logs represent a complete GC execution, with variations based on the type of GC. You can search for the keyword [gc] in the exported log file to view GC-related logs. You can also check for the keyword ArkCompiler to view more comprehensive VM-related logs. 344 345``` 346// Pre-GC object size (region size) -> Post-GC object size (region size), total duration (+concurrentMark duration), GC trigger reason. 347C03F00/ArkCompiler: [gc] [ CompressGC ] 26.1164 (35) -> 7.10049 (10.5) MB, 160.626(+0)ms, Switch to background 348// Various states during GC execution and application name. 349C03F00/ArkCompiler: [gc] IsInBackground: 1; SensitiveStatus: 0; OnStartupEvent: 0; BundleName: com.example.demo; 350// Duration statistics for each GC phase. 351C03F00/ArkCompiler: [gc] /***************** GC Duration statistic: ****************/ 352C03F00/ArkCompiler: [gc] TotalGC: 160.626 ms 353C03F00/ArkCompiler: Initialize: 0.179 ms 354C03F00/ArkCompiler: Mark: 159.204 ms 355C03F00/ArkCompiler: MarkRoots: 6.925 ms 356C03F00/ArkCompiler: ProcessMarkStack: 158.99 ms 357C03F00/ArkCompiler: Sweep: 0.957 ms 358C03F00/ArkCompiler: Finish: 0.277 ms 359// Memory usage statistics after GC. 360C03F00/ArkCompiler: [gc] /****************** GC Memory statistic: *****************/ 361C03F00/ArkCompiler: [gc] AllSpaces used: 7270.9KB committed: 10752KB 362C03F00/ArkCompiler: ActiveSemiSpace used: 0KB committed: 256KB 363C03F00/ArkCompiler: OldSpace used: 4966.9KB committed: 5888KB 364C03F00/ArkCompiler: HugeObjectSpace used: 2304KB committed: 2304KB 365C03F00/ArkCompiler: NonMovableSpace used: 0KB committed: 2304KB 366C03F00/ArkCompiler: MachineCodeSpace used: 0KB committed: 0KB 367C03F00/ArkCompiler: HugeMachineCodeSpace used: 0KB committed: 0KB 368C03F00/ArkCompiler: SnapshotSpace used: 0KB committed: 0KB 369C03F00/ArkCompiler: AppSpawnSpace used: 4736.34KB committed: 4864KB 370C03F00/ArkCompiler: [gc] Anno memory usage size: 45 MB 371C03F00/ArkCompiler: Native memory usage size:2.99652 MB 372C03F00/ArkCompiler: NativeBindingSize: 0.577148KB 373C03F00/ArkCompiler: ArrayBufferNativeSize: 0.0117188KB 374C03F00/ArkCompiler: RegExpByteCodeNativeSize:0.280273KB 375C03F00/ArkCompiler: ChunkNativeSize: 19096 KB 376C03F00/ArkCompiler: [gc] Heap alive rate: 0.202871 377// Summary statistics for this type of GC in the VM. 378C03F00/ArkCompiler: [gc] /***************** GC summary statistic: *****************/ 379C03F00/ArkCompiler: [gc] CompressGC occurs count 6 380C03F00/ArkCompiler: CompressGC max pause: 2672.33 ms 381C03F00/ArkCompiler: CompressGC min pause: 160.626 ms 382C03F00/ArkCompiler: CompressGC average pause:1076.06 ms 383C03F00/ArkCompiler: Heap average alive rate: 0.635325 384``` 385 386- GC type, which can be [HPP YoungGC], [HPP OldGC], [CompressGC], and [SharedGC]. 387- **TotalGC**: total duration. The following lists the duration for each phase, including Initialize, Mark, MarkRoots, ProcessMarkStack, Sweep, and Finish. The actual phases may vary depending on the GC process. 388- **IsInBackground**: specifies whether the application is in the background (**1**) or foreground (**0**). 389- **SensitiveStatus**: specifies whether the application is in a sensitive scenario (**1**) or not (**0**). 390- **OnStartupEvent**: specifies whether the application is in a cold start scenario (**1**) or not (**0**). 391- **used**: actual memory usage of allocated objects. 392- **committed**: actual memory allocated to the heap. Since memory spaces are allocated in regions that are not always fully utilized by objects, **committed** is greater than or equal to **used**. For Huge Space, these values are equal because each object occupies a separate region. 393- **Anno memory usage size**: total memory usage of all heaps in the process, including heap and shared heap. 394- **Native memory usage size**: total native memory usage of the process. 395- **NativeBindingSize**: native memory usage of objects bound to the heap. 396- **ArrayBufferNativeSize**: native memory usage of array buffers requested by the process. 397- **RegExpByteCodeNativeSize**: native memory usage of regular expression bytecode requested by the process. 398- **ChunkNativeSize**: native memory usage of chunks requested by the process. 399- **Heap alive rate**: survival rate of objects in the heap. 400 401## GC Developer Debugging Interfaces 402 403> **NOTE** 404> 405> The following interfaces are for debugging purposes only and are not official SDK interfaces. They should not be used in production applications. 406 407### ArkTools.hintGC() 408 409- Invocation: **ArkTools.hintGC()** 410- Type: ArkTS interface 411- Description: triggers the VM to assess whether a full GC should be executed. Full GC is initiated in the background or if the expected memory survival rate is below a threshold. It will not trigger in sensitive scenarios. 412- Use case: developers prompting the system to perform GC. 413- Log keywords: There is no direct log. Only external trigger (**GCReason::TRIGGER_BY_JS**) can be found. 414 415 416Usage example: 417 418```ts 419// Declare the interface first. 420declare class ArkTools { 421 static hintGC(): void; 422} 423 424@Entry 425@Component 426struct Index { 427 @State message: string = 'Hello World'; 428 build() { 429 Row() { 430 Column() { 431 Text(this.message) 432 .fontSize(50) 433 .fontWeight(FontWeight.Bold) 434 Button("Trigger Hint GC").onClick((event: ClickEvent) => { 435 ArkTools.hintGC(); // Call the method directly. 436 }) 437 } 438 .width('100%') 439 } 440 .height('100%') 441} 442} 443``` 444