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
|
/* Any copyright is dedicated to the Public Domain.
http://creativecommons.org/publicdomain/zero/1.0/ */
"use strict";
// Test that the HeapAnalyses{Client,Worker} can take censuses by
// "allocationStack" and return a CensusTreeNode.
const BREAKDOWN = {
by: "objectClass",
then: {
by: "allocationStack",
then: { by: "count", count: true, bytes: true },
noStack: { by: "count", count: true, bytes: true },
},
other: { by: "count", count: true, bytes: true },
};
add_task(async function () {
const g = newGlobal();
const dbg = new Debugger(g);
// 5 allocation markers with no stack.
g.eval(`
this.markers = [];
for (var i = 0; i < 5; i++) {
markers.push(allocationMarker());
}
`);
dbg.memory.allocationSamplingProbability = 1;
dbg.memory.trackingAllocationSites = true;
// 5 allocation markers at 5 stacks.
g.eval(`
(function shouldHaveCountOfOne() {
markers.push(allocationMarker());
markers.push(allocationMarker());
markers.push(allocationMarker());
markers.push(allocationMarker());
markers.push(allocationMarker());
}());
`);
// 5 allocation markers at 1 stack.
g.eval(`
(function shouldHaveCountOfFive() {
for (var i = 0; i < 5; i++) {
markers.push(allocationMarker());
}
}());
`);
const snapshotFilePath = saveNewHeapSnapshot({ debugger: dbg });
const client = new HeapAnalysesClient();
await client.readHeapSnapshot(snapshotFilePath);
ok(true, "Should have read the heap snapshot");
const { report } = await client.takeCensus(snapshotFilePath, {
breakdown: BREAKDOWN,
});
const { report: treeNode } = await client.takeCensus(
snapshotFilePath,
{
breakdown: BREAKDOWN,
},
{
asTreeNode: true,
}
);
const markers = treeNode.children.find(c => c.name === "AllocationMarker");
ok(markers);
const noStack = markers.children.find(c => c.name === "noStack");
equal(noStack.count, 5);
let numShouldHaveFiveFound = 0;
let numShouldHaveOneFound = 0;
function walk(node) {
if (node.children) {
node.children.forEach(walk);
}
if (!isSavedFrame(node.name)) {
return;
}
if (node.name.functionDisplayName === "shouldHaveCountOfFive") {
equal(node.count, 5, "shouldHaveCountOfFive should have count of five");
numShouldHaveFiveFound++;
}
if (node.name.functionDisplayName === "shouldHaveCountOfOne") {
equal(node.count, 1, "shouldHaveCountOfOne should have count of one");
numShouldHaveOneFound++;
}
}
markers.children.forEach(walk);
equal(numShouldHaveFiveFound, 1);
equal(numShouldHaveOneFound, 5);
compareCensusViewData(
BREAKDOWN,
report,
treeNode,
"Returning census as a tree node represents same data as the report"
);
client.destroy();
});
|
