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
|
/* Any copyright is dedicated to the Public Domain.
http://creativecommons.org/publicdomain/zero/1.0/ */
"use strict";
// Check byte counts produced by takeCensus.
//
// Ported from js/src/jit-test/tests/debug/Memory-take Census-10.js
function run_test() {
const g = newGlobal();
const dbg = new Debugger(g);
const sizeOfAM = byteSize(allocationMarker());
// Allocate a single allocation marker, and check that we can find it.
g.eval("var hold = allocationMarker();");
let census = saveHeapSnapshotAndTakeCensus(dbg, {
breakdown: { by: "objectClass" },
});
equal(census.AllocationMarker.count, 1);
equal(census.AllocationMarker.bytes, sizeOfAM);
g.hold = null;
g.eval(` // 1
var objs = []; // 2
function fnerd() { // 3
objs.push(allocationMarker()); // 4
for (let i = 0; i < 10; i++) // 5
objs.push(allocationMarker()); // 6
} // 7
`);
dbg.memory.allocationSamplingProbability = 1;
dbg.memory.trackingAllocationSites = true;
g.fnerd();
dbg.memory.trackingAllocationSites = false;
census = saveHeapSnapshotAndTakeCensus(dbg, {
breakdown: { by: "objectClass", then: { by: "allocationStack" } },
});
let seen = 0;
census.AllocationMarker.forEach((v, k) => {
equal(k.functionDisplayName, "fnerd");
switch (k.line) {
case 4:
equal(v.count, 1);
equal(v.bytes, sizeOfAM);
seen++;
break;
case 6:
equal(v.count, 10);
equal(v.bytes, 10 * sizeOfAM);
seen++;
break;
default:
dumpn("Unexpected stack:");
k.toString()
.split(/\n/g)
.forEach(s => dumpn(s));
ok(false);
break;
}
});
equal(seen, 2);
do_test_finished();
}
|
