Name Description Size
Allocator.cpp = CanGC 28029
Allocator.h 3376
AllocKind.h GC-internal definition of GC cell kinds. 12090
ArenaList-inl.h 7940
ArenaList.h GC-internal definitions of ArenaList and associated heap data structures. 12874
AtomMarking-inl.h 3012
AtomMarking.cpp 9800
AtomMarking.h 3072
Barrier.cpp static 7772
Barrier.h 41941
Cell.h namespace JS 27477
ClearEdgesTracer.h 748
Compacting.cpp Implementation of compacting GC. 31716
FinalizationObservers.cpp GC support for FinalizationRegistry and WeakRef objects. 15658
FinalizationObservers.h 4449
FindSCCs.h Find the strongly connected components of a graph using Tarjan's algorithm, and return them in topological order. Nodes derive from GraphNodeBase and add target edge pointers to sourceNode.gcGraphEdges to describe the graph: struct MyGraphNode : public GraphNodeBase<MyGraphNode> { ... } MyGraphNode node1, node2, node3; node1.gcGraphEdges.put(node2); // Error checking elided. node2.gcGraphEdges.put(node3); node3.gcGraphEdges.put(node2); ComponentFinder<MyGraphNode> finder; finder.addNode(node1); finder.addNode(node2); finder.addNode(node3); MyGraphNode* result = finder.getResultsList(); 5313
GC-inl.h 11195
GC.cpp 146518
GC.h JS engine garbage collector API. 5790
GCAPI.cpp API functions and methods used by the rest of SpiderMonkey and by embeddings. 20431
GCContext-inl.h 1091
GCContext.h GCContext is by GC operations that can run on or off the main thread. Its main function is to provide methods to free memory and update memory accounting. For convenience, it also has delete_ convenience methods that also call destructors. It is passed to finalizers and other sweep-phase hooks as JSContext is not available off the main thread. 7723
GCEnum.h GC-internal enum definitions. 5435
GCInternals.h GC-internal definitions. 10105
GCLock.h GC-internal classes for acquiring and releasing the GC lock. 2940
GCMarker.h When the mark stack is full, the GC does not call js::TraceChildren to mark the reachable "children" of the thing. Rather the thing is put aside and js::TraceChildren is called later when the mark stack is empty. To implement such delayed marking of the children with minimal overhead for the normal case of sufficient stack, we link arenas into a list using Arena::setNextDelayedMarkingArena(). The head of the list is stored in GCMarker::delayedMarkingList. GCMarker::delayMarkingChildren() adds arenas to the list as necessary while markAllDelayedChildren() pops the arenas from the stack until it is empty. 18286
GCParallelTask.cpp 5555
GCParallelTask.h ArgTs 6119
GCProbes.h This interface can be used to insert probes for GC related events. The code must be built with JS_GC_PROBES for these probes to be called from JIT code. 1279
GCRuntime.h 47069 12841
HashUtil.h Used to add entries to a js::HashMap or HashSet where the key depends on a GC thing that may be moved by generational or compacting GC between the call to lookupForAdd() and relookupOrAdd(). 2529
Heap-inl.h 2045
Heap.cpp Tenured heap management. This file contains method definitions for the following classes for code that is not specific to a particular phase of GC: - Arena - ArenaList - FreeLists - ArenaLists - TenuredChunk - ChunkPool 17933
Heap.h The minimum cell size ends up as twice the cell alignment because the mark bitmap contains one bit per CellBytesPerMarkBit bytes (which is equal to CellAlignBytes) and we need two mark bits per cell. 26070
IteratorUtils.h Create an iterator that yields the values from IteratorB(a) for all a in IteratorA(). Equivalent to nested for loops over IteratorA and IteratorB where IteratorB is constructed with a value from IteratorA. 2577
Marking-inl.h static 5690
Marking.cpp clang-format off 104876
Marking.h Marking and sweeping APIs for use by implementations of different GC cell kinds. 5072
MaybeRooted.h Template types for use in generic code: to use Rooted/Handle/MutableHandle in cases where GC may occur, or to use mock versions of those types that perform no rooting or root list manipulation when GC cannot occur. 3652
Memory.cpp System allocation functions generally require the allocation size to be an integer multiple of the page size of the running process. 34246
Memory.h gc_Memory_h 3314 1451
Nursery-inl.h safe - used for value in comparison above 5664
Nursery.cpp 60050
Nursery.h Key Header text 25631
NurseryAwareHashMap.h 7120
ObjectKind-inl.h GC-internal helper functions for getting the AllocKind used to allocate a JSObject and related information. 5378
ParallelWork.h namespace gc 3959
Policy.h JS Garbage Collector. 3026
Pretenuring.cpp 13433
Pretenuring.h Pretenuring. Some kinds of GC cells can be allocated in either the nursery or the tenured heap. The pretenuring system decides where to allocate such cells based on their expected lifetime with the aim of minimising total collection time. Lifetime is predicted based on data gathered about the cells' allocation site. This data is gathered in the middle JIT tiers, after code has stopped executing in the interpreter and before we generate fully optimized code. 8842
PrivateIterators-inl.h GC-internal iterators for various data structures. 4145
PublicIterators.cpp 8954
PublicIterators.h Iterators for various data structures. 4680
RelocationOverlay.h GC-internal definition of relocation overlay used while moving cells. 1691
Rooting.h namespace js 4021
RootMarking.cpp 15176
Scheduling.cpp We may start to collect a zone before its trigger threshold is reached if GCRuntime::maybeGC() is called for that zone or we start collecting other zones. These eager threshold factors are not configurable. 32037
Scheduling.h 36867
Statistics.cpp If this fails, then you can either delete this assertion and allow all larger-numbered reasons to pile up in the last telemetry bucket, or switch to GC_REASON_3 and bump the max value. 51958
Statistics.h Number of zones collected in this GC. 18398
StoreBuffer-inl.h static 2403
StoreBuffer.cpp 6991
StoreBuffer.h BufferableRef represents an abstract reference for use in the generational GC's remembered set. Entries in the store buffer that cannot be represented with the simple pointer-to-a-pointer scheme must derive from this class and use the generic store buffer interface. A single BufferableRef entry in the generic buffer can represent many entries in the remembered set. For example js::OrderedHashTableRef represents all the incoming edges corresponding to keys in an ordered hash table. 20110
Sweeping.cpp Implementation of GC sweeping. In the SpiderMonkey GC, 'sweeping' is used to mean two things: - updating data structures to remove pointers to dead GC things and updating pointers to moved GC things - finalizing dead GC things Furthermore, the GC carries out gray and weak marking after the start of the sweep phase. This is also implemented in this file. 72751
Tenuring.cpp Implementation of nursery eviction (tenuring). 33735
Tenuring.h 4303
Tracer.cpp Public Tracing API **************************************************** 7719
Tracer.h 15039
Verifier.cpp Write barrier verification The next few functions are for write barrier verification. The VerifyBarriers function is a shorthand. It checks if a verification phase is currently running. If not, it starts one. Otherwise, it ends the current phase and starts a new one. The user can adjust the frequency of verifications, which causes VerifyBarriers to be a no-op all but one out of N calls. However, if the |always| parameter is true, it starts a new phase no matter what. Pre-Barrier Verifier: When StartVerifyBarriers is called, a snapshot is taken of all objects in the GC heap and saved in an explicit graph data structure. Later, EndVerifyBarriers traverses the heap again. Any pointer values that were in the snapshot and are no longer found must be marked; otherwise an assertion triggers. Note that we must not GC in between starting and finishing a verification phase. 31256
WeakMap-inl.h namespace detail 15473
WeakMap.cpp 4810
WeakMap.h 12489
WeakMapPtr.cpp 3177
Zone-inl.h static 3020
Zone.cpp 29130
Zone.h 21212
ZoneAllocator.h Public header for allocating memory associated with GC things. 10299