mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
Bug 698930 (part 1) - Always show negative numbers in about:memory, and highlight them. r=jlebar.
--HG-- extra : rebase_source : f2f0c985b8cc7d20d08b20c79f173b58409358d0
This commit is contained in:
Nicholas Nethercote
parent
c7b6d7ccdc
commit
7d733f3d91
@ -73,7 +73,7 @@ body.non-verbose pre.tree {
|
||||
color: #004;
|
||||
}
|
||||
|
||||
.mrStar {
|
||||
.mrNote {
|
||||
color: #604;
|
||||
}
|
||||
|
||||
@ -98,3 +98,9 @@ body.non-verbose pre.tree {
|
||||
.hidden {
|
||||
display: none;
|
||||
}
|
||||
|
||||
.invalid {
|
||||
color: #fff;
|
||||
background-color: #f00;
|
||||
}
|
||||
|
||||
|
||||
@ -671,6 +671,11 @@ function sortTreeAndInsertAggregateNodes(aTotalBytes, aT)
|
||||
sortTreeAndInsertAggregateNodes(aTotalBytes, aT._kids[i]);
|
||||
}
|
||||
|
||||
// Global variable indicating if we've seen any invalid values for this
|
||||
// process; it holds the paths of any such reporters. Reset for each new
|
||||
// process.
|
||||
var gProcessInvalidValues = [];
|
||||
|
||||
function genWarningText(aHasKnownHeapAllocated, aHasMozMallocUsableSize)
|
||||
{
|
||||
var warningText = "";
|
||||
@ -698,6 +703,25 @@ function genWarningText(aHasKnownHeapAllocated, aHasMozMallocUsableSize)
|
||||
"by individual memory reporters and so will fall under " +
|
||||
"'heap-unclassified'.</p>\n\n";
|
||||
}
|
||||
|
||||
if (gProcessInvalidValues.length > 0) {
|
||||
warningText +=
|
||||
"<div class='accuracyWarning'>" +
|
||||
"<p>WARNING: the following values are negative or unreasonably " +
|
||||
"large.</p>\n" +
|
||||
"<ul>";
|
||||
for (var i = 0; i < gProcessInvalidValues.length; i++) {
|
||||
warningText += " <li>" + prepName(gProcessInvalidValues[i]) + "</li>\n";
|
||||
}
|
||||
warningText +=
|
||||
"</ul>" +
|
||||
"<p>This indicates a defect in one or more memory reporters. The " +
|
||||
"invalid values are highlighted, but you may need to expand one " +
|
||||
"or more sub-trees to see them.</p>\n\n" +
|
||||
"</div>";
|
||||
gProcessInvalidValues = []; // reset for the next process
|
||||
}
|
||||
|
||||
return warningText;
|
||||
}
|
||||
|
||||
@ -719,13 +743,6 @@ function genProcessText(aProcess, aReporters, aHasMozMallocUsableSize)
|
||||
sortTreeAndInsertAggregateNodes(explicitTree._amount, explicitTree);
|
||||
var explicitText = genTreeText(explicitTree, aProcess);
|
||||
|
||||
// Generate any warnings about inaccuracies due to platform limitations.
|
||||
// The newlines give nice spacing if we cut+paste into a text buffer.
|
||||
var warningText = "";
|
||||
var accuracyTagText = "<p class='accuracyWarning'>";
|
||||
var warningText =
|
||||
genWarningText(hasKnownHeapAllocated, aHasMozMallocUsableSize);
|
||||
|
||||
// We only show these breakdown trees in verbose mode.
|
||||
var mapTreeText = "";
|
||||
kMapTreePaths.forEach(function(t) {
|
||||
@ -747,12 +764,35 @@ function genProcessText(aProcess, aReporters, aHasMozMallocUsableSize)
|
||||
// looks at all the reporters which aren't part of a tree.
|
||||
var otherText = genOtherText(aReporters, aProcess);
|
||||
|
||||
// Generate any warnings about inaccuracies due to platform limitations.
|
||||
// This must come after generating all the text. The newlines give nice
|
||||
// spacing if we cut+paste into a text buffer.
|
||||
var warningText = "";
|
||||
var warningText =
|
||||
genWarningText(hasKnownHeapAllocated, aHasMozMallocUsableSize);
|
||||
|
||||
// The newlines give nice spacing if we cut+paste into a text buffer.
|
||||
return "<h1>" + aProcess + " Process</h1>\n\n" +
|
||||
warningText + explicitText + mapTreeText + otherText +
|
||||
"<hr></hr>";
|
||||
}
|
||||
|
||||
/**
|
||||
* Determines if a number has a negative sign when converted to a string.
|
||||
* Works even for -0.
|
||||
*
|
||||
* @param aN
|
||||
* The number.
|
||||
* @return A boolean.
|
||||
*/
|
||||
function hasNegativeSign(aN)
|
||||
{
|
||||
if (aN === 0) { // this succeeds for 0 and -0
|
||||
return 1 / aN === -Infinity; // this succeeds for -0
|
||||
}
|
||||
return aN < 0;
|
||||
}
|
||||
|
||||
/**
|
||||
* Formats an int as a human-readable string.
|
||||
*
|
||||
@ -763,7 +803,7 @@ function genProcessText(aProcess, aReporters, aHasMozMallocUsableSize)
|
||||
function formatInt(aN)
|
||||
{
|
||||
var neg = false;
|
||||
if (aN < 0) {
|
||||
if (hasNegativeSign(aN)) {
|
||||
neg = true;
|
||||
aN = -aN;
|
||||
}
|
||||
@ -804,7 +844,8 @@ function formatBytes(aBytes)
|
||||
} else {
|
||||
var mbytes = (aBytes / (1024 * 1024)).toFixed(2);
|
||||
var a = String(mbytes).split(".");
|
||||
s = formatInt(a[0]) + "." + a[1] + " " + unit;
|
||||
// If the argument to formatInt() is -0, it will print the negative sign.
|
||||
s = formatInt(Number(a[0])) + "." + a[1] + " " + unit;
|
||||
}
|
||||
return s;
|
||||
}
|
||||
@ -889,9 +930,11 @@ const kHorizontal = "\u2500",
|
||||
kUpAndRight = "\u2514",
|
||||
kVerticalAndRight = "\u251c";
|
||||
|
||||
function genMrValueText(aValue)
|
||||
function genMrValueText(aValue, aIsInvalid)
|
||||
{
|
||||
return "<span class='mrValue'>" + aValue + " </span>";
|
||||
return aIsInvalid ?
|
||||
"<span class='mrValue invalid'>" + aValue + "</span>" :
|
||||
"<span class='mrValue'>" + aValue + "</span>";
|
||||
}
|
||||
|
||||
function kindToString(aKind)
|
||||
@ -932,19 +975,19 @@ function prepDesc(aStr)
|
||||
}
|
||||
|
||||
function genMrNameText(aKind, aShowSubtrees, aHasKids, aDesc, aName,
|
||||
aHasProblem, aNMerged)
|
||||
aHasProblem, aIsInvalid, aNMerged)
|
||||
{
|
||||
var text = "";
|
||||
if (aHasKids) {
|
||||
if (aShowSubtrees) {
|
||||
text += "<span class='mrSep hidden'>++ </span>";
|
||||
text += "<span class='mrSep'>-- </span>";
|
||||
text += "<span class='mrSep hidden'> ++ </span>";
|
||||
text += "<span class='mrSep'> -- </span>";
|
||||
} else {
|
||||
text += "<span class='mrSep'>++ </span>";
|
||||
text += "<span class='mrSep hidden'>-- </span>";
|
||||
text += "<span class='mrSep'> ++ </span>";
|
||||
text += "<span class='mrSep hidden'> -- </span>";
|
||||
}
|
||||
} else {
|
||||
text += "<span class='mrSep'>" + kHorizontal + kHorizontal + " </span>";
|
||||
text += "<span class='mrSep'> " + kHorizontal + kHorizontal + " </span>";
|
||||
}
|
||||
text += "<span class='mrName' title='" +
|
||||
kindToString(aKind) + prepDesc(aDesc) + "'>" +
|
||||
@ -952,12 +995,18 @@ function genMrNameText(aKind, aShowSubtrees, aHasKids, aDesc, aName,
|
||||
if (aHasProblem) {
|
||||
const problemDesc =
|
||||
"Warning: this memory reporter was unable to compute a useful value. ";
|
||||
text += "<span class='mrStar' title=\"" + problemDesc + "\"> [*]</span>";
|
||||
text += "<span class='mrNote' title=\"" + problemDesc + "\"> [*]</span>";
|
||||
}
|
||||
if (aIsInvalid) {
|
||||
const invalidDesc =
|
||||
"Warning: this value is invalid and indicates a bug in one or more " +
|
||||
"memory reporters. ";
|
||||
text += "<span class='mrNote' title=\"" + invalidDesc + "\"> [?!]</span>";
|
||||
}
|
||||
if (aNMerged) {
|
||||
const dupDesc = "This value is the sum of " + aNMerged +
|
||||
" memory reporters that all have the same path.";
|
||||
text += "<span class='mrStar' title=\"" + dupDesc + "\"> [" +
|
||||
text += "<span class='mrNote' title=\"" + dupDesc + "\"> [" +
|
||||
aNMerged + "]</span>";
|
||||
}
|
||||
return text + '\n';
|
||||
@ -975,7 +1024,7 @@ function toggle(aEvent)
|
||||
{
|
||||
// This relies on each line being a span that contains at least five spans:
|
||||
// mrValue, mrPerc, mrSep ('++'), mrSep ('--'), mrName, and then zero or more
|
||||
// mrStars. All whitespace must be within one of these spans for this
|
||||
// mrNotes. All whitespace must be within one of these spans for this
|
||||
// function to find the right nodes. And the span containing the children of
|
||||
// this line must immediately follow. Assertions check this.
|
||||
|
||||
@ -1053,6 +1102,15 @@ function genTreeText(aT, aProcess)
|
||||
return s;
|
||||
}
|
||||
|
||||
// Determine if we should show the sub-tree below this entry; this
|
||||
// involves reinstating any previous toggling of the sub-tree.
|
||||
var path = aPrePath + aT._name;
|
||||
var treeId = aProcess + ":" + escapeAll(path);
|
||||
var showSubtrees = !aT._hideKids;
|
||||
if (gToggles[treeId]) {
|
||||
showSubtrees = !showSubtrees;
|
||||
}
|
||||
|
||||
// Generate the indent.
|
||||
var indent = "<span class='treeLine'>";
|
||||
if (aIndentGuide.length > 0) {
|
||||
@ -1075,24 +1133,24 @@ function genTreeText(aT, aProcess)
|
||||
}
|
||||
indent += "</span>";
|
||||
|
||||
// Generate the percentage, and determine if we should show subtrees.
|
||||
// Generate the percentage; detect and record invalid values at the same
|
||||
// time.
|
||||
var percText = "";
|
||||
var showSubtrees = !aT._hideKids;
|
||||
var tIsInvalid = false;
|
||||
if (aT._amount === treeBytes) {
|
||||
percText = "100.0";
|
||||
} else {
|
||||
var perc = (100 * aT._amount / treeBytes);
|
||||
if (!(0 <= perc && perc <= 100)) {
|
||||
tIsInvalid = true;
|
||||
gProcessInvalidValues.push(path);
|
||||
}
|
||||
percText = (100 * aT._amount / treeBytes).toFixed(2);
|
||||
percText = pad(percText, 5, '0');
|
||||
}
|
||||
percText = "<span class='mrPerc'>(" + percText + "%) </span>";
|
||||
|
||||
// Reinstate any previous toggling of this sub-tree.
|
||||
var path = aPrePath + aT._name;
|
||||
var treeId = escapeAll(aProcess + ":" + path);
|
||||
if (gToggles[treeId]) {
|
||||
showSubtrees = !showSubtrees;
|
||||
}
|
||||
percText = tIsInvalid ?
|
||||
"<span class='mrPerc invalid'> (" + percText + "%)</span>" :
|
||||
"<span class='mrPerc'> (" + percText + "%)</span>";
|
||||
|
||||
// We don't want to show '(nonheap)' on a tree like 'map/vsize', since the
|
||||
// whole tree is non-heap.
|
||||
@ -1109,9 +1167,9 @@ function genTreeText(aT, aProcess)
|
||||
text +=
|
||||
"<span onclick='toggle(event)' class='hasKids' id='" + treeId + "'>";
|
||||
}
|
||||
text += genMrValueText(tString) + percText;
|
||||
text += genMrValueText(tString, tIsInvalid) + percText;
|
||||
text += genMrNameText(kind, showSubtrees, hasKids, aT._description,
|
||||
aT._name, aT._hasProblem, aT._nMerged);
|
||||
aT._name, aT._hasProblem, tIsInvalid, aT._nMerged);
|
||||
if (hasKids) {
|
||||
var hiddenText = showSubtrees ? "" : " hidden";
|
||||
// The 'kids' class is just used for sanity checking in toggle().
|
||||
@ -1152,7 +1210,7 @@ function OtherReporter(aPath, aUnits, aAmount, aDescription,
|
||||
|
||||
OtherReporter.prototype = {
|
||||
toString: function() {
|
||||
switch(this._units) {
|
||||
switch (this._units) {
|
||||
case UNITS_BYTES: return formatBytes(this._amount);
|
||||
case UNITS_COUNT:
|
||||
case UNITS_COUNT_CUMULATIVE: return formatInt(this._amount);
|
||||
@ -1160,6 +1218,19 @@ OtherReporter.prototype = {
|
||||
default:
|
||||
assert(false, "bad units in OtherReporter.toString");
|
||||
}
|
||||
},
|
||||
|
||||
isInvalid: function() {
|
||||
var n = this._amount;
|
||||
switch (this._units) {
|
||||
case UNITS_BYTES:
|
||||
case UNITS_COUNT:
|
||||
case UNITS_COUNT_CUMULATIVE: return (n !== kUnknown && n < 0);
|
||||
case UNITS_PERCENTAGE: return (n !== kUnknown &&
|
||||
!(0 <= n && n <= 10000));
|
||||
default:
|
||||
assert(false, "bad units in OtherReporter.isInvalid");
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
@ -1189,7 +1260,7 @@ function genOtherText(aReportersByProcess, aProcess)
|
||||
var r = aReportersByProcess[path];
|
||||
if (!r._done) {
|
||||
assert(r._kind === KIND_OTHER, "_kind !== KIND_OTHER for " + r._path);
|
||||
assert(r.nMerged === undefined); // we don't allow dup'd OTHER reporters
|
||||
assert(r._nMerged === undefined); // we don't allow dup'd OTHER reporters
|
||||
var hasProblem = false;
|
||||
if (r._amount === kUnknown) {
|
||||
hasProblem = true;
|
||||
@ -1207,10 +1278,14 @@ function genOtherText(aReportersByProcess, aProcess)
|
||||
var text = "";
|
||||
for (var i = 0; i < otherReporters.length; i++) {
|
||||
var o = otherReporters[i];
|
||||
text += genMrValueText(pad(o.asString, maxStringLength, ' '));
|
||||
var oIsInvalid = o.isInvalid();
|
||||
if (oIsInvalid) {
|
||||
gProcessInvalidValues.push(o._path);
|
||||
}
|
||||
text += genMrValueText(pad(o.asString, maxStringLength, ' '), oIsInvalid);
|
||||
text += genMrNameText(KIND_OTHER, /* showSubtrees = */true,
|
||||
/* hasKids = */false, o._description, o._path,
|
||||
o._hasProblem);
|
||||
o._hasProblem, oIsInvalid);
|
||||
}
|
||||
|
||||
return genSectionMarkup('other', text);
|
||||
|
||||
@ -166,7 +166,36 @@
|
||||
f("3rd", "explicit/a/d", HEAP, kUnknown),
|
||||
f("3rd", "explicit/a/d", HEAP, kUnknown), // dup: merge
|
||||
f("3rd", "explicit/b", NONHEAP, kUnknown),
|
||||
f("3rd", "other1", OTHER, kUnknown)
|
||||
f2("3rd", "other1", OTHER, BYTES, kUnknown),
|
||||
f2("3rd", "other2", OTHER, COUNT, kUnknown),
|
||||
f2("3rd", "other3", OTHER, COUNT_CUMULATIVE, kUnknown),
|
||||
f2("3rd", "other4", OTHER, PERCENTAGE, kUnknown),
|
||||
|
||||
// Invalid values (negative, too-big) should be identified.
|
||||
f("4th", "heap-allocated", OTHER, 100 * MB),
|
||||
f("4th", "explicit/js/compartment(http:\\\\too-big.com\\)/stuff",
|
||||
HEAP, 150 * MB),
|
||||
f("4th", "explicit/ok", HEAP, 5 * MB),
|
||||
f("4th", "explicit/neg1", NONHEAP, -2 * MB),
|
||||
// -111 becomes "-0.00MB" in non-verbose mode, and getting the negative
|
||||
// sign in there correctly is non-trivial.
|
||||
f2("4th", "other1", OTHER, BYTES, -111),
|
||||
f2("4th", "other2", OTHER, BYTES, -222 * MB),
|
||||
f2("4th", "other3", OTHER, COUNT, -333),
|
||||
f2("4th", "other4", OTHER, COUNT_CUMULATIVE, -444),
|
||||
f2("4th", "other5", OTHER, PERCENTAGE, -555),
|
||||
// Escaping should again prevent this script from running when the name
|
||||
// is printed in the warning.
|
||||
f2("4th", "other6-danger<script>window.alert(1)</script>",
|
||||
OTHER, PERCENTAGE, 66666),
|
||||
|
||||
// If a negative value is within a collapsed sub-tree in non-verbose mode,
|
||||
// we should still get the warning at the top.
|
||||
f("5th", "heap-allocated", OTHER, 100 * MB),
|
||||
f("5th", "explicit/big", HEAP, 99 * MB),
|
||||
f("5th", "explicit/a/pos", HEAP, 40 * KB),
|
||||
f("5th", "explicit/a/neg1", NONHEAP, -20 * KB),
|
||||
f("5th", "explicit/a/neg2", NONHEAP, -10 * KB)
|
||||
];
|
||||
for (var i = 0; i < fakeReporters2.length; i++) {
|
||||
mgr.registerReporter(fakeReporters2[i]);
|
||||
@ -175,8 +204,8 @@
|
||||
]]>
|
||||
</script>
|
||||
|
||||
<iframe id="amFrame" height="300" src="about:memory"></iframe>
|
||||
<iframe id="amvFrame" height="300" src="about:memory?verbose"></iframe>
|
||||
<iframe id="amFrame" height="400" src="about:memory"></iframe>
|
||||
<iframe id="amvFrame" height="400" src="about:memory?verbose"></iframe>
|
||||
|
||||
<script type="application/javascript">
|
||||
<![CDATA[
|
||||
@ -247,6 +276,58 @@ Explicit Allocations\n\
|
||||
Other Measurements\n\
|
||||
0.00 MB ── heap-allocated [*]\n\
|
||||
0.00 MB ── other1 [*]\n\
|
||||
0 ── other2 [*]\n\
|
||||
0 ── other3 [*]\n\
|
||||
0.00% ── other4 [*]\n\
|
||||
\n\
|
||||
4th Process\n\
|
||||
\n\
|
||||
WARNING: the following values are negative or unreasonably large.\n\
|
||||
explicit/js\n\
|
||||
explicit/js/compartment(http://too-big.com/)\n\
|
||||
explicit/js/compartment(http://too-big.com/)/stuff\n\
|
||||
explicit/(2 tiny)\n\
|
||||
explicit/(2 tiny)/neg1\n\
|
||||
explicit/(2 tiny)/heap-unclassified\n\
|
||||
other1\n\
|
||||
other2\n\
|
||||
other3\n\
|
||||
other4\n\
|
||||
other5\n\
|
||||
other6-danger<script>window.alert(1)</script>\n\
|
||||
This indicates a defect in one or more memory reporters. The invalid values are highlighted, but you may need to expand one or more sub-trees to see them.\n\
|
||||
\n\
|
||||
Explicit Allocations\n\
|
||||
98.00 MB (100.0%) -- explicit\n\
|
||||
├──150.00 MB (153.06%) -- js [?!]\n\
|
||||
│ └──150.00 MB (153.06%) -- compartment(http://too-big.com/) [?!]\n\
|
||||
│ └──150.00 MB (153.06%) ── stuff [?!]\n\
|
||||
├───5.00 MB (05.10%) ── ok\n\
|
||||
└──-57.00 MB (-58.16%) ++ (2 tiny) [?!]\n\
|
||||
\n\
|
||||
Other Measurements\n\
|
||||
100.00 MB ── heap-allocated\n\
|
||||
-0.00 MB ── other1 [?!]\n\
|
||||
-222.00 MB ── other2 [?!]\n\
|
||||
-333 ── other3 [?!]\n\
|
||||
-444 ── other4 [?!]\n\
|
||||
-5.55% ── other5 [?!]\n\
|
||||
666.66% ── other6-danger<script>window.alert(1)</script> [?!]\n\
|
||||
\n\
|
||||
5th Process\n\
|
||||
\n\
|
||||
WARNING: the following values are negative or unreasonably large.\n\
|
||||
explicit/(2 tiny)/a/neg2\n\
|
||||
explicit/(2 tiny)/a/neg1\n\
|
||||
This indicates a defect in one or more memory reporters. The invalid values are highlighted, but you may need to expand one or more sub-trees to see them.\n\
|
||||
\n\
|
||||
Explicit Allocations\n\
|
||||
99.97 MB (100.0%) -- explicit\n\
|
||||
├──99.00 MB (99.03%) ── big\n\
|
||||
└───0.97 MB (00.97%) ++ (2 tiny)\n\
|
||||
\n\
|
||||
Other Measurements\n\
|
||||
100.00 MB ── heap-allocated\n\
|
||||
\n\
|
||||
";
|
||||
|
||||
@ -332,8 +413,64 @@ Explicit Allocations\n\
|
||||
└────────────0 B (00.00%) ── heap-unclassified [*]\n\
|
||||
\n\
|
||||
Other Measurements\n\
|
||||
0 B ── heap-allocated [*]\n\
|
||||
0 B ── other1 [*]\n\
|
||||
0 B ── heap-allocated [*]\n\
|
||||
0 B ── other1 [*]\n\
|
||||
0 ── other2 [*]\n\
|
||||
0 ── other3 [*]\n\
|
||||
0.00% ── other4 [*]\n\
|
||||
\n\
|
||||
4th Process\n\
|
||||
\n\
|
||||
WARNING: the following values are negative or unreasonably large.\n\
|
||||
explicit/js\n\
|
||||
explicit/js/compartment(http://too-big.com/)\n\
|
||||
explicit/js/compartment(http://too-big.com/)/stuff\n\
|
||||
explicit/neg1\n\
|
||||
explicit/heap-unclassified\n\
|
||||
other1\n\
|
||||
other2\n\
|
||||
other3\n\
|
||||
other4\n\
|
||||
other5\n\
|
||||
other6-danger<script>window.alert(1)</script>\n\
|
||||
This indicates a defect in one or more memory reporters. The invalid values are highlighted, but you may need to expand one or more sub-trees to see them.\n\
|
||||
\n\
|
||||
Explicit Allocations\n\
|
||||
102,760,448 B (100.0%) -- explicit\n\
|
||||
├──157,286,400 B (153.06%) -- js [?!]\n\
|
||||
│ └──157,286,400 B (153.06%) -- compartment(http://too-big.com/) [?!]\n\
|
||||
│ └──157,286,400 B (153.06%) ── stuff [?!]\n\
|
||||
├────5,242,880 B (05.10%) ── ok\n\
|
||||
├───-2,097,152 B (-2.04%) ── neg1 [?!]\n\
|
||||
└──-57,671,680 B (-56.12%) ── heap-unclassified [?!]\n\
|
||||
\n\
|
||||
Other Measurements\n\
|
||||
104,857,600 B ── heap-allocated\n\
|
||||
-111 B ── other1 [?!]\n\
|
||||
-232,783,872 B ── other2 [?!]\n\
|
||||
-333 ── other3 [?!]\n\
|
||||
-444 ── other4 [?!]\n\
|
||||
-5.55% ── other5 [?!]\n\
|
||||
666.66% ── other6-danger<script>window.alert(1)</script> [?!]\n\
|
||||
\n\
|
||||
5th Process\n\
|
||||
\n\
|
||||
WARNING: the following values are negative or unreasonably large.\n\
|
||||
explicit/a/neg2\n\
|
||||
explicit/a/neg1\n\
|
||||
This indicates a defect in one or more memory reporters. The invalid values are highlighted, but you may need to expand one or more sub-trees to see them.\n\
|
||||
\n\
|
||||
Explicit Allocations\n\
|
||||
104,826,880 B (100.0%) -- explicit\n\
|
||||
├──103,809,024 B (99.03%) ── big\n\
|
||||
├────1,007,616 B (00.96%) ── heap-unclassified\n\
|
||||
└───────10,240 B (00.01%) -- a\n\
|
||||
├──40,960 B (00.04%) ── pos\n\
|
||||
├──-10,240 B (-0.01%) ── neg2 [?!]\n\
|
||||
└──-20,480 B (-0.02%) ── neg1 [?!]\n\
|
||||
\n\
|
||||
Other Measurements\n\
|
||||
104,857,600 B ── heap-allocated\n\
|
||||
\n\
|
||||
"
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user