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
|
/*
* Copyright (C) 2014, 2015 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
WI.NetworkTimelineOverviewGraph = class NetworkTimelineOverviewGraph extends WI.TimelineOverviewGraph
{
constructor(timeline, timelineOverview)
{
super(timelineOverview);
this.element.classList.add("network");
timeline.addEventListener(WI.Timeline.Event.RecordAdded, this._networkTimelineRecordAdded, this);
timeline.addEventListener(WI.Timeline.Event.TimesUpdated, this.needsLayout, this);
this.reset();
for (let record of timeline.records)
this._processRecord(record);
}
// Public
reset()
{
super.reset();
this._nextDumpRow = 0;
this._timelineRecordGridRows = [];
for (let i = 0; i < WI.NetworkTimelineOverviewGraph.MaximumRowCount; ++i)
this._timelineRecordGridRows.push([]);
this.element.removeChildren();
for (let rowRecords of this._timelineRecordGridRows) {
rowRecords.__element = document.createElement("div");
rowRecords.__element.classList.add("graph-row");
this.element.appendChild(rowRecords.__element);
rowRecords.__recordBars = [];
}
}
// Protected
layout()
{
super.layout();
if (this.hidden)
return;
let secondsPerPixel = this.timelineOverview.secondsPerPixel;
let recordBarIndex = 0;
function createBar(rowElement, rowRecordBars, records, renderMode)
{
let timelineRecordBar = rowRecordBars[recordBarIndex];
if (!timelineRecordBar)
timelineRecordBar = rowRecordBars[recordBarIndex] = new WI.TimelineRecordBar(this, records, renderMode);
else {
timelineRecordBar.renderMode = renderMode;
timelineRecordBar.records = records;
}
timelineRecordBar.refresh(this);
if (!timelineRecordBar.element.parentNode)
rowElement.appendChild(timelineRecordBar.element);
++recordBarIndex;
}
for (let rowRecords of this._timelineRecordGridRows) {
let rowElement = rowRecords.__element;
let rowRecordBars = rowRecords.__recordBars;
recordBarIndex = 0;
WI.TimelineRecordBar.createCombinedBars(rowRecords, secondsPerPixel, this, createBar.bind(this, rowElement, rowRecordBars));
// Remove the remaining unused TimelineRecordBars.
for (; recordBarIndex < rowRecordBars.length; ++recordBarIndex) {
rowRecordBars[recordBarIndex].records = null;
rowRecordBars[recordBarIndex].element.remove();
}
}
}
// Private
_networkTimelineRecordAdded(event)
{
let resourceTimelineRecord = event.data.record;
console.assert(resourceTimelineRecord instanceof WI.ResourceTimelineRecord);
this._processRecord(resourceTimelineRecord);
this.needsLayout();
}
_processRecord(resourceTimelineRecord)
{
let compareByStartTime = (a, b) => a.startTime - b.startTime;
let minimumBarPaddingTime = WI.TimelineOverview.MinimumDurationPerPixel * (WI.TimelineRecordBar.MinimumWidthPixels + WI.TimelineRecordBar.MinimumMarginPixels);
// Try to find a row that has room and does not overlap a previous record.
let foundRowForRecord = false;
for (let i = 0; i < this._timelineRecordGridRows.length; ++i) {
let rowRecords = this._timelineRecordGridRows[i];
let lastRecord = rowRecords.lastValue;
if (!lastRecord || lastRecord.endTime + minimumBarPaddingTime <= resourceTimelineRecord.startTime) {
insertObjectIntoSortedArray(resourceTimelineRecord, rowRecords, compareByStartTime);
this._nextDumpRow = i + 1;
foundRowForRecord = true;
break;
}
}
if (!foundRowForRecord) {
// Try to find a row that does not overlap a previous record's active time, but it can overlap the inactive time.
for (let i = 0; i < this._timelineRecordGridRows.length; ++i) {
let rowRecords = this._timelineRecordGridRows[i];
let lastRecord = rowRecords.lastValue;
console.assert(lastRecord);
if (lastRecord.activeStartTime + minimumBarPaddingTime <= resourceTimelineRecord.startTime) {
insertObjectIntoSortedArray(resourceTimelineRecord, rowRecords, compareByStartTime);
this._nextDumpRow = i + 1;
foundRowForRecord = true;
break;
}
}
}
// We didn't find a empty spot, so dump into the designated dump row.
if (!foundRowForRecord) {
if (this._nextDumpRow >= WI.NetworkTimelineOverviewGraph.MaximumRowCount)
this._nextDumpRow = 0;
insertObjectIntoSortedArray(resourceTimelineRecord, this._timelineRecordGridRows[this._nextDumpRow++], compareByStartTime);
}
}
};
WI.NetworkTimelineOverviewGraph.MaximumRowCount = 6;
|
