2020-09-28 13:50:56 +00:00
|
|
|
// Copyright 2009 the V8 project authors. All rights reserved.
|
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * 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.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
|
|
|
|
// OWNER OR 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.
|
|
|
|
|
|
|
|
import { ConsArray } from "./consarray.mjs";
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates a Profile View builder object.
|
|
|
|
*
|
|
|
|
* @param {number} samplingRate Number of ms between profiler ticks.
|
|
|
|
* @constructor
|
|
|
|
*/
|
|
|
|
export function ViewBuilder(samplingRate) {
|
|
|
|
this.samplingRate = samplingRate;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Builds a profile view for the specified call tree.
|
|
|
|
*
|
|
|
|
* @param {CallTree} callTree A call tree.
|
|
|
|
* @param {boolean} opt_bottomUpViewWeights Whether remapping
|
|
|
|
* of self weights for a bottom up view is needed.
|
|
|
|
*/
|
|
|
|
ViewBuilder.prototype.buildView = function(
|
|
|
|
callTree, opt_bottomUpViewWeights) {
|
2020-11-10 11:47:40 +00:00
|
|
|
let head;
|
|
|
|
const samplingRate = this.samplingRate;
|
|
|
|
const createViewNode = this.createViewNode;
|
2020-09-28 13:50:56 +00:00
|
|
|
callTree.traverse(function(node, viewParent) {
|
2020-11-10 11:47:40 +00:00
|
|
|
const totalWeight = node.totalWeight * samplingRate;
|
|
|
|
let selfWeight = node.selfWeight * samplingRate;
|
2020-09-28 13:50:56 +00:00
|
|
|
if (opt_bottomUpViewWeights === true) {
|
|
|
|
if (viewParent === head) {
|
|
|
|
selfWeight = totalWeight;
|
|
|
|
} else {
|
|
|
|
selfWeight = 0;
|
|
|
|
}
|
|
|
|
}
|
2020-11-10 11:47:40 +00:00
|
|
|
const viewNode = createViewNode(node.label, totalWeight, selfWeight, head);
|
2020-09-28 13:50:56 +00:00
|
|
|
if (viewParent) {
|
|
|
|
viewParent.addChild(viewNode);
|
|
|
|
} else {
|
|
|
|
head = viewNode;
|
|
|
|
}
|
|
|
|
return viewNode;
|
|
|
|
});
|
2020-11-10 11:47:40 +00:00
|
|
|
const view = this.createView(head);
|
2020-09-28 13:50:56 +00:00
|
|
|
return view;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Factory method for a profile view.
|
|
|
|
*
|
|
|
|
* @param {ProfileView.Node} head View head node.
|
|
|
|
* @return {ProfileView} Profile view.
|
|
|
|
*/
|
2020-11-10 11:47:40 +00:00
|
|
|
ViewBuilder.prototype.createView = head => new ProfileView(head);
|
2020-09-28 13:50:56 +00:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Factory method for a profile view node.
|
|
|
|
*
|
|
|
|
* @param {string} internalFuncName A fully qualified function name.
|
|
|
|
* @param {number} totalTime Amount of time that application spent in the
|
|
|
|
* corresponding function and its descendants (not that depending on
|
|
|
|
* profile they can be either callees or callers.)
|
|
|
|
* @param {number} selfTime Amount of time that application spent in the
|
|
|
|
* corresponding function only.
|
|
|
|
* @param {ProfileView.Node} head Profile view head.
|
|
|
|
* @return {ProfileView.Node} Profile view node.
|
|
|
|
*/
|
2020-11-10 11:47:40 +00:00
|
|
|
ViewBuilder.prototype.createViewNode = (
|
|
|
|
funcName, totalTime, selfTime, head) =>
|
|
|
|
new ProfileView.Node(
|
|
|
|
funcName, totalTime, selfTime, head)
|
|
|
|
;
|
2020-09-28 13:50:56 +00:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Creates a Profile View object. It allows to perform sorting
|
|
|
|
* and filtering actions on the profile.
|
|
|
|
*
|
|
|
|
* @param {ProfileView.Node} head Head (root) node.
|
|
|
|
* @constructor
|
|
|
|
*/
|
|
|
|
export function ProfileView(head) {
|
|
|
|
this.head = head;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sorts the profile view using the specified sort function.
|
|
|
|
*
|
|
|
|
* @param {function(ProfileView.Node,
|
|
|
|
* ProfileView.Node):number} sortFunc A sorting
|
|
|
|
* functions. Must comply with Array.sort sorting function requirements.
|
|
|
|
*/
|
|
|
|
ProfileView.prototype.sort = function(sortFunc) {
|
|
|
|
this.traverse(function (node) {
|
|
|
|
node.sortChildren(sortFunc);
|
|
|
|
});
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Traverses profile view nodes in preorder.
|
|
|
|
*
|
|
|
|
* @param {function(ProfileView.Node)} f Visitor function.
|
|
|
|
*/
|
|
|
|
ProfileView.prototype.traverse = function(f) {
|
2020-11-10 11:47:40 +00:00
|
|
|
const nodesToTraverse = new ConsArray();
|
2020-09-28 13:50:56 +00:00
|
|
|
nodesToTraverse.concat([this.head]);
|
|
|
|
while (!nodesToTraverse.atEnd()) {
|
2020-11-10 11:47:40 +00:00
|
|
|
const node = nodesToTraverse.next();
|
2020-09-28 13:50:56 +00:00
|
|
|
f(node);
|
|
|
|
nodesToTraverse.concat(node.children);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Constructs a Profile View node object. Each node object corresponds to
|
|
|
|
* a function call.
|
|
|
|
*
|
|
|
|
* @param {string} internalFuncName A fully qualified function name.
|
|
|
|
* @param {number} totalTime Amount of time that application spent in the
|
|
|
|
* corresponding function and its descendants (not that depending on
|
|
|
|
* profile they can be either callees or callers.)
|
|
|
|
* @param {number} selfTime Amount of time that application spent in the
|
|
|
|
* corresponding function only.
|
|
|
|
* @param {ProfileView.Node} head Profile view head.
|
|
|
|
* @constructor
|
|
|
|
*/
|
|
|
|
ProfileView.Node = function(
|
|
|
|
internalFuncName, totalTime, selfTime, head) {
|
|
|
|
this.internalFuncName = internalFuncName;
|
|
|
|
this.totalTime = totalTime;
|
|
|
|
this.selfTime = selfTime;
|
|
|
|
this.head = head;
|
|
|
|
this.parent = null;
|
|
|
|
this.children = [];
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a share of the function's total time in its parent's total time.
|
|
|
|
*/
|
|
|
|
ProfileView.Node.prototype.__defineGetter__(
|
|
|
|
'parentTotalPercent',
|
|
|
|
function() { return this.totalTime /
|
|
|
|
(this.parent ? this.parent.totalTime : this.totalTime) * 100.0; });
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Adds a child to the node.
|
|
|
|
*
|
|
|
|
* @param {ProfileView.Node} node Child node.
|
|
|
|
*/
|
|
|
|
ProfileView.Node.prototype.addChild = function(node) {
|
|
|
|
node.parent = this;
|
|
|
|
this.children.push(node);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Sorts all the node's children recursively.
|
|
|
|
*
|
|
|
|
* @param {function(ProfileView.Node,
|
|
|
|
* ProfileView.Node):number} sortFunc A sorting
|
|
|
|
* functions. Must comply with Array.sort sorting function requirements.
|
|
|
|
*/
|
|
|
|
ProfileView.Node.prototype.sortChildren = function(
|
|
|
|
sortFunc) {
|
|
|
|
this.children.sort(sortFunc);
|
|
|
|
};
|