mirror of
https://github.com/nodejs/node.git
synced 2025-05-01 08:42:45 +00:00
92fa0fcdb7
This patch: - Refactors the `MemoryRetainer` API so that the impementer no longer calls `TrackThis()` that sets the size of node on the top of the stack, which may be hard to understand. Instead now they implements `SelfSize()` to provide their self sizes. Also documents the API in the header. - Refactors `MemoryTracker` so it calls `MemoryInfoName()` and `SelfSize()` of `MemoryRetainer` to retrieve info about them, and separate `node_names` and `edge_names` so the edges can be properly named with reference names and the nodes can be named with class names. (Previously the nodes are named with reference names while the edges are all indexed and appear as array elements). - Adds `SET_MEMORY_INFO_NAME()`, `SET_SELF_SIZE()` and `SET_NO_MEMORY_INFO()` convenience macros - Fixes a few `MemoryInfo` calls in some `MemoryRetainers` to track their references properly. - Refactors the heapdump tests to check both node names and edge names, distinguishing between wrapped JS nodes (without prefixes) and embedder wrappers (prefixed with `Node / `). PR-URL: https://github.com/nodejs/node/pull/23072 Reviewed-By: Anna Henningsen <anna@addaleax.net>
87 lines
2.3 KiB
JavaScript
87 lines
2.3 KiB
JavaScript
'use strict';
|
|
|
|
process.emitWarning(
|
|
'These APIs are exposed only for testing and are not ' +
|
|
'tracked by any versioning system or deprecation process.',
|
|
'internal/test/heap');
|
|
|
|
const { createHeapDump, buildEmbedderGraph } = internalBinding('heap_utils');
|
|
const assert = require('assert');
|
|
|
|
// This is not suitable for production code. It creates a full V8 heap dump,
|
|
// parses it as JSON, and then creates complex objects from it, leading
|
|
// to significantly increased memory usage.
|
|
function createJSHeapDump() {
|
|
const dump = createHeapDump();
|
|
const meta = dump.snapshot.meta;
|
|
|
|
const nodes =
|
|
readHeapInfo(dump.nodes, meta.node_fields, meta.node_types, dump.strings);
|
|
const edges =
|
|
readHeapInfo(dump.edges, meta.edge_fields, meta.edge_types, dump.strings);
|
|
|
|
for (const node of nodes) {
|
|
node.incomingEdges = [];
|
|
node.outgoingEdges = [];
|
|
}
|
|
|
|
let fromNodeIndex = 0;
|
|
let edgeIndex = 0;
|
|
for (const { type, name_or_index, to_node } of edges) {
|
|
while (edgeIndex === nodes[fromNodeIndex].edge_count) {
|
|
edgeIndex = 0;
|
|
fromNodeIndex++;
|
|
}
|
|
const toNode = nodes[to_node / meta.node_fields.length];
|
|
const fromNode = nodes[fromNodeIndex];
|
|
const edge = {
|
|
type,
|
|
to: toNode,
|
|
from: fromNode,
|
|
name: typeof name_or_index === 'string' ? name_or_index : null
|
|
};
|
|
toNode.incomingEdges.push(edge);
|
|
fromNode.outgoingEdges.push(edge);
|
|
edgeIndex++;
|
|
}
|
|
|
|
for (const node of nodes)
|
|
assert.strictEqual(node.edge_count, node.outgoingEdges.length);
|
|
|
|
return nodes;
|
|
}
|
|
|
|
function readHeapInfo(raw, fields, types, strings) {
|
|
const items = [];
|
|
|
|
for (var i = 0; i < raw.length; i += fields.length) {
|
|
const item = {};
|
|
for (var j = 0; j < fields.length; j++) {
|
|
const name = fields[j];
|
|
let type = types[j];
|
|
if (Array.isArray(type)) {
|
|
item[name] = type[raw[i + j]];
|
|
} else if (name === 'name_or_index') { // type === 'string_or_number'
|
|
if (item.type === 'element' || item.type === 'hidden')
|
|
type = 'number';
|
|
else
|
|
type = 'string';
|
|
}
|
|
|
|
if (type === 'string') {
|
|
item[name] = strings[raw[i + j]];
|
|
} else if (type === 'number' || type === 'node') {
|
|
item[name] = raw[i + j];
|
|
}
|
|
}
|
|
items.push(item);
|
|
}
|
|
|
|
return items;
|
|
}
|
|
|
|
module.exports = {
|
|
createJSHeapDump,
|
|
buildEmbedderGraph
|
|
};
|