![]() |
v8 10.2.154 (node 18.16.0)
V8 is Google's open source JavaScript engine
|
#include <v8-profiler.h>
Public Types | |
enum | SerializationFormat { kJSON = 0 } |
Public Member Functions | |
const HeapGraphNode * | GetRoot () const |
const HeapGraphNode * | GetNodeById (SnapshotObjectId id) const |
int | GetNodesCount () const |
const HeapGraphNode * | GetNode (int index) const |
SnapshotObjectId | GetMaxSnapshotJSObjectId () const |
void | Delete () |
void | Serialize (OutputStream *stream, SerializationFormat format=kJSON) const |
HeapSnapshots record the state of the JS heap at some moment.
Definition at line 608 of file v8-profiler.h.
enum SerializationFormat |
Enumerator | |
---|---|
kJSON |
Definition at line 610 of file v8-profiler.h.
void Delete | ( | ) |
Deletes the snapshot and removes it from HeapProfiler's list. All pointers to nodes, edges and paths previously returned become invalid.
SnapshotObjectId GetMaxSnapshotJSObjectId | ( | ) | const |
Returns a max seen JS object Id.
const HeapGraphNode * GetNode | ( | int | index | ) | const |
Returns a node by index.
const HeapGraphNode * GetNodeById | ( | SnapshotObjectId | id | ) | const |
Returns a node by its id.
int GetNodesCount | ( | ) | const |
Returns total nodes count in the snapshot.
const HeapGraphNode * GetRoot | ( | ) | const |
Returns the root node of the heap graph.
void Serialize | ( | OutputStream * | stream, |
SerializationFormat | format = kJSON |
||
) | const |
Prepare a serialized representation of the snapshot. The result is written into the stream provided in chunks of specified size. The total length of the serialized snapshot is unknown in advance, it can be roughly equal to JS heap size (that means, it can be really big - tens of megabytes).
For the JSON format, heap contents are represented as an object with the following structure:
{ snapshot: { title: "...", uid: nnn, meta: { meta-info }, node_count: nnn, edge_count: nnn }, nodes: [nodes array], edges: [edges array], strings: [strings array] }
Nodes reference strings, other nodes, and edges by their indexes in corresponding arrays.