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
|
/* Any copyright is dedicated to the Public Domain.
http://creativecommons.org/publicdomain/zero/1.0/ */
"use strict";
// Test that filtered and inverted allocation stack census trees are sorted
// properly.
function run_test() {
const countBreakdown = { by: "count", count: true, bytes: true };
const BREAKDOWN = {
by: "allocationStack",
then: countBreakdown,
noStack: countBreakdown,
};
const stacks = [];
function foo(depth = 1) {
stacks.push(saveStack(depth));
bar(depth + 1);
baz(depth + 1);
stacks.push(saveStack(depth));
}
function bar(depth = 1) {
stacks.push(saveStack(depth));
stacks.push(saveStack(depth));
}
function baz(depth = 1) {
stacks.push(saveStack(depth));
bang(depth + 1);
stacks.push(saveStack(depth));
}
function bang(depth = 1) {
stacks.push(saveStack(depth));
stacks.push(saveStack(depth));
stacks.push(saveStack(depth));
}
foo();
bar();
baz();
bang();
const REPORT = new Map(
stacks.map((s, i) => {
return [
s,
{
count: i + 1,
bytes: (i + 1) * 10,
},
];
})
);
const tree = censusReportToCensusTreeNode(BREAKDOWN, REPORT, {
filter: "baz",
invert: true,
});
dumpn("tree = " + JSON.stringify(tree, savedFrameReplacer, 4));
(function assertSortedBySelf(node) {
if (node.children) {
let lastSelfBytes = Infinity;
for (const child of node.children) {
Assert.lessOrEqual(
child.bytes,
lastSelfBytes,
`${child.bytes} <= ${lastSelfBytes}`
);
lastSelfBytes = child.bytes;
assertSortedBySelf(child);
}
}
})(tree);
}
|
