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
|
/*
* Copyright (C) 2011 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.
*/
function LeaksParserWorker() {
this.profile = this._createNode("top level");
}
LeaksParserWorker.prototype = {
addLeaksFile: function(leaksText) {
this._incorporateLeaks(this._parseLeaks(leaksText));
},
_parseLeaks: function(text) {
var leaks = [];
var currentSize = 0;
text.split("\n").forEach(function(line) {
var match = /^Leak:.*\ssize=(\d+)\s/.exec(line);
if (match) {
currentSize = parseInt(match[1], 10);
return;
}
if (!/^\s+Call stack:/.test(line))
return;
// The first frame is not really a frame at all ("Call stack: thread 0xNNNNN:"), so we omit it.
leaks.push({ size: currentSize, stack: line.split(" | ").slice(1).map(function(str) { return str.trim(); }) });
currentSize = 0;
});
return leaks;
},
_createNode: function(functionName) {
return {
functionName: functionName,
selfTime: 0,
totalTime: 0,
averageTime: 0,
numberOfCalls: 0,
children: [],
childrenByName: {},
callUID: functionName,
};
},
// This function creates a fake "profile" from a set of leak stacks. "selfTime" is the number of
// stacks in which this function was at the top (in theory, only functions like malloc should have a
// non-zero selfTime). "totalTime" is the number of stacks which contain this function (and thus is
// the number of leaks that occurred in or beneath this function).
// FIXME: This is expensive! Can we parallelize it?
_incorporateLeaks: function(leaks) {
var self = this;
leaks.forEach(function(leak) {
leak.stack.reduce(function(node, frame, index, array) {
var childNode;
if (frame in node.childrenByName)
childNode = node.childrenByName[frame];
else {
childNode = self._createNode(frame);
childNode.head = self.profile;
node.childrenByName[frame] = childNode;
node.children.push(childNode);
}
if (index === array.length - 1)
childNode.selfTime += leak.size;
childNode.totalTime += leak.size;
++childNode.numberOfCalls;
return childNode;
}, self.profile);
});
self.profile.totalTime = self.profile.children.reduce(function(sum, child) { return sum + child.totalTime; }, 0);
},
};
var parser = new LeaksParserWorker();
onmessage = function(e) {
parser.addLeaksFile(e.data);
postMessage(parser.profile);
}
|
