diff options
author | Matt A. Tobin <email@mattatobin.com> | 2020-02-22 17:32:39 -0500 |
---|---|---|
committer | Matt A. Tobin <email@mattatobin.com> | 2020-02-22 17:32:39 -0500 |
commit | 4e2e9be6abed3225406b466099e397acc0f914d2 (patch) | |
tree | 023551018892b8e76ae80e63a08d9d6a27c21a77 /devtools/shared/heapsnapshot/tests/unit/test_census_filtering_05.js | |
parent | a7888b8cf20691a4090715ab9b055ec3cb75f5e8 (diff) | |
download | UXP-4e2e9be6abed3225406b466099e397acc0f914d2.tar UXP-4e2e9be6abed3225406b466099e397acc0f914d2.tar.gz UXP-4e2e9be6abed3225406b466099e397acc0f914d2.tar.lz UXP-4e2e9be6abed3225406b466099e397acc0f914d2.tar.xz UXP-4e2e9be6abed3225406b466099e397acc0f914d2.zip |
Reclassify heapsnapshot and nsJSInspector as not part of devtools
This resolves Issue #316
Diffstat (limited to 'devtools/shared/heapsnapshot/tests/unit/test_census_filtering_05.js')
-rw-r--r-- | devtools/shared/heapsnapshot/tests/unit/test_census_filtering_05.js | 71 |
1 files changed, 0 insertions, 71 deletions
diff --git a/devtools/shared/heapsnapshot/tests/unit/test_census_filtering_05.js b/devtools/shared/heapsnapshot/tests/unit/test_census_filtering_05.js deleted file mode 100644 index 1d1f4fa55..000000000 --- a/devtools/shared/heapsnapshot/tests/unit/test_census_filtering_05.js +++ /dev/null @@ -1,71 +0,0 @@ -/* Any copyright is dedicated to the Public Domain. - http://creativecommons.org/publicdomain/zero/1.0/ */ - -// 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 (let child of node.children) { - ok(child.bytes <= lastSelfBytes, `${child.bytes} <= ${lastSelfBytes}`); - lastSelfBytes = child.bytes; - assertSortedBySelf(child); - } - } - }(tree)); -} |