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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
// Copyright (c) 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
'use strict';
base.requireStylesheet('tcmalloc.heap_instance_track');
base.require('base.sorted_array_utils');
base.require('tracing.tracks.stacked_bars_track');
base.require('tracing.tracks.object_instance_track');
base.require('tracing.color_scheme');
base.require('ui');
base.exportTo('tcmalloc', function() {
var EventPresenter = tracing.EventPresenter;
/**
* A track that displays heap memory data.
* @constructor
* @extends {StackedBarsTrack}
*/
var HeapInstanceTrack = ui.define(
'heap-instance-track', tracing.tracks.StackedBarsTrack);
HeapInstanceTrack.prototype = {
__proto__: tracing.tracks.StackedBarsTrack.prototype,
decorate: function(viewport) {
tracing.tracks.StackedBarsTrack.prototype.decorate.call(this, viewport);
this.classList.add('heap-instance-track');
this.objectInstance_ = null;
},
set objectInstances(objectInstances) {
if (!objectInstances) {
this.objectInstance_ = [];
return;
}
if (objectInstances.length != 1)
throw new Error('Bad object instance count.');
this.objectInstance_ = objectInstances[0];
this.maxBytes_ = this.computeMaxBytes_(
this.objectInstance_.snapshots);
},
computeMaxBytes_: function(snapshots) {
var maxBytes = 0;
for (var i = 0; i < snapshots.length; i++) {
var snapshot = snapshots[i];
// Sum all the current allocations in this snapshot.
var traceNames = Object.keys(snapshot.heap_.children);
var sumBytes = 0;
for (var j = 0; j < traceNames.length; j++) {
sumBytes += snapshot.heap_.children[traceNames[j]].currentBytes;
}
// Keep track of the maximum across all snapshots.
if (sumBytes > maxBytes)
maxBytes = sumBytes;
}
return maxBytes;
},
get height() {
return window.getComputedStyle(this).height;
},
set height(height) {
this.style.height = height;
},
draw: function(type, viewLWorld, viewRWorld) {
switch (type) {
case tracing.tracks.DrawType.SLICE:
this.drawSlices_(viewLWorld, viewRWorld);
break;
}
},
drawSlices_: function(viewLWorld, viewRWorld) {
var ctx = this.context();
var pixelRatio = window.devicePixelRatio || 1;
var bounds = this.getBoundingClientRect();
var width = bounds.width * pixelRatio;
var height = bounds.height * pixelRatio;
// Culling parameters.
var dt = this.viewport.currentDisplayTransform;
// Scale by the size of the largest snapshot.
var maxBytes = this.maxBytes_;
var objectSnapshots = this.objectInstance_.snapshots;
var lowIndex = base.findLowIndexInSortedArray(
objectSnapshots,
function(snapshot) {
return snapshot.ts;
},
viewLWorld);
// Assure that the stack with the left edge off screen still gets drawn
if (lowIndex > 0)
lowIndex -= 1;
for (var i = lowIndex; i < objectSnapshots.length; ++i) {
var snapshot = objectSnapshots[i];
var left = snapshot.ts;
if (left > viewRWorld)
break;
var leftView = dt.xWorldToView(left);
if (leftView < 0)
leftView = 0;
// Compute the edges for the column graph bar.
var right;
if (i != objectSnapshots.length - 1) {
right = objectSnapshots[i + 1].ts;
} else {
// If this is the last snaphot of multiple snapshots, use the width of
// the previous snapshot for the width.
if (objectSnapshots.length > 1)
right = objectSnapshots[i].ts + (objectSnapshots[i].ts -
objectSnapshots[i - 1].ts);
else
// If there's only one snapshot, use max bounds as the width.
right = this.objectInstance_.parent.model.bounds.max;
}
var rightView = dt.xWorldToView(right);
if (rightView > width)
rightView = width;
// Floor the bounds to avoid a small gap between stacks.
leftView = Math.floor(leftView);
rightView = Math.floor(rightView);
// Draw a stacked bar graph. Largest item is stored first in the
// heap data structure, so iterate backwards. Likewise draw from
// the bottom of the bar upwards.
var currentY = height;
var keys = Object.keys(snapshot.heap_.children);
for (var k = keys.length - 1; k >= 0; k--) {
var trace = snapshot.heap_.children[keys[k]];
if (this.objectInstance_.selectedTraces &&
this.objectInstance_.selectedTraces.length > 0 &&
this.objectInstance_.selectedTraces[0] == keys[k]) {
// A trace selected in the analysis view is bright yellow.
ctx.fillStyle = 'rgb(239, 248, 206)';
} else
ctx.fillStyle = EventPresenter.getBarSnapshotColor(snapshot, k);
var barHeight = height * trace.currentBytes / maxBytes;
ctx.fillRect(leftView, currentY - barHeight,
Math.max(rightView - leftView, 1), barHeight);
currentY -= barHeight;
}
}
ctx.lineWidth = 1;
}
};
tracing.tracks.ObjectInstanceTrack.register(
'memory::Heap', HeapInstanceTrack);
return {
HeapInstanceTrack: HeapInstanceTrack
};
});
|
