-
-
Notifications
You must be signed in to change notification settings - Fork 156
/
HeapSnapshot.js
141 lines (127 loc) · 3.84 KB
/
HeapSnapshot.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
/* V8 heap snapshot manipulator.
*
* ### constructor
*
* |Name |Desc |
* |-------|----------------|
* |profile|Profile to parse|
*
* ### nodes
*
* Parsed nodes.
*
* ### edges
*
* Parsed edges.
*/
/* example
* const fs = require('fs');
* const data = fs.readFileSync('path/to/heapsnapshot', 'utf8');
* const heapSnapshot = new HeapSnapshot(data);
* let totalSize = 0;
* heapSnapshot.nodes.forEach(node => (totalSize += node.selfSize));
* console.log(totalSize);
*/
/* module
* env: all
* test: node
* since: 1.31.0
*/
/* typescript
* export declare class HeapSnapshot {
* nodes: LinkedList;
* edges: LinkedList;
* constructor(profile: any);
* }
*/
_('Class toBool camelCase LinkedList isStr each map');
exports = Class({
initialize: function HeapSnapshot(profile) {
if (isStr(profile)) {
profile = JSON.parse(profile);
}
this.nodes = new LinkedList();
this.edges = new LinkedList();
const snapshot = profile.snapshot;
const meta = snapshot.meta;
this.nodeFields = map(meta.node_fields, camelCase);
this.nodeTypes = meta.node_types[this.nodeFields.indexOf('type')];
this.edgeFields = map(meta.edge_fields, camelCase);
this.edgeTypes = meta.edge_types[this.edgeFields.indexOf('type')];
this._init(profile);
},
_init(profile) {
const { nodes, edges, strings } = profile;
const { nodeFields, edgeFields } = this;
let curEdgeIdx = 0;
const nodeFieldCount = nodeFields.length;
const edgeFieldCount = edgeFields.length;
const nodeMap = {};
for (let i = 0, len = nodes.length; i < len; i += nodeFieldCount) {
const node = new Node(this);
node.init(nodes.slice(i, i + nodeFieldCount), strings);
this.nodes.push(node);
nodeMap[i] = node;
}
this.nodes.forEach(node => {
const edgeCount = node.edgeCount;
delete node.edgeCount;
const maxEdgeIdx = curEdgeIdx + edgeCount * edgeFieldCount;
for (let i = curEdgeIdx; i < maxEdgeIdx; i += edgeFieldCount) {
const edge = new Edge(this, node);
edge.init(edges.slice(i, i + edgeFieldCount), strings, nodeMap);
this.edges.push(edge);
}
curEdgeIdx = maxEdgeIdx;
});
}
});
const Node = Class({
initialize: function Node(heapSnapshot) {
this._heapSnapshot = heapSnapshot;
},
init(fields, strings) {
const heapSnapshot = this._heapSnapshot;
const { nodeFields, nodeTypes } = heapSnapshot;
each(nodeFields, (field, idx) => {
let val = fields[idx];
switch (field) {
case 'name':
val = strings[val];
break;
case 'detachedness':
val = toBool(val);
break;
case 'type':
val = nodeTypes[val];
break;
}
this[field] = val;
});
}
});
const Edge = Class({
initialize: function Edge(heapSnapshot, fromNode) {
this._heapSnapshot = heapSnapshot;
this.fromNode = fromNode;
},
init(fields, strings, nodeMap) {
const heapSnapshot = this._heapSnapshot;
const { edgeFields, edgeTypes } = heapSnapshot;
each(edgeFields, (field, idx) => {
let val = fields[idx];
switch (field) {
case 'nameOrIndex':
val = strings[val];
break;
case 'type':
val = edgeTypes[val];
break;
case 'toNode':
val = nodeMap[val];
break;
}
this[field] = val;
});
}
});