profile.js 30.1 KB
Newer Older
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
// 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.

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
// TODO: move to separate modules
class SourcePosition {
  constructor(script, line, column) {
    this.script = script;
    this.line = line;
    this.column = column;
    this.entries = [];
  }
  addEntry(entry) {
    this.entries.push(entry);
  }
}

class Script {

  constructor(id, name, source) {
    this.id = id;
    this.name = name;
    this.source = source;
    this.sourcePositions = [];
    // Map<line, Map<column, SourcePosition>>
    this.lineToColumn = new Map();
  }

  addSourcePosition(line, column, entry) {
    let sourcePosition = this.lineToColumn.get(line)?.get(column);
    if (sourcePosition === undefined) {
      sourcePosition = new SourcePosition(this, line, column, )
      this.#addSourcePosition(line, column, sourcePosition);
    }
    sourcePosition.addEntry(entry);
    return sourcePosition;
  }

  #addSourcePosition(line, column, sourcePosition) {
    let columnToSourcePosition;
    if (this.lineToColumn.has(line)) {
      columnToSourcePosition = this.lineToColumn.get(line);
    } else {
      columnToSourcePosition = new Map();
      this.lineToColumn.set(line, columnToSourcePosition);
    }
    this.sourcePositions.push(sourcePosition);
    columnToSourcePosition.set(column, sourcePosition);
  }
}
74 75 76 77 78 79 80

/**
 * Creates a profile object for processing profiling-related events
 * and calculating function execution times.
 *
 * @constructor
 */
81 82 83 84
function Profile() {
  this.codeMap_ = new CodeMap();
  this.topDownTree_ = new CallTree();
  this.bottomUpTree_ = new CallTree();
85
  this.c_entries_ = {};
86
  this.ticks_ = [];
87 88
  this.scripts_ = [];
  this.urlToScript_ = new Map();
89 90 91 92 93 94 95 96 97
};


/**
 * Returns whether a function with the specified name must be skipped.
 * Should be overriden by subclasses.
 *
 * @param {string} name Function name.
 */
98
Profile.prototype.skipThisFunction = function (name) {
99 100 101 102
  return false;
};


103 104 105 106 107 108
/**
 * Enum for profiler operations that involve looking up existing
 * code entries.
 *
 * @enum {number}
 */
109
Profile.Operation = {
110
  MOVE: 0,
111 112
  DELETE: 1,
  TICK: 2
113 114 115
};


116 117 118 119 120 121 122 123 124 125 126 127
/**
 * Enum for code state regarding its dynamic optimization.
 *
 * @enum {number}
 */
Profile.CodeState = {
  COMPILED: 0,
  OPTIMIZABLE: 1,
  OPTIMIZED: 2
};


128 129 130
/**
 * Called whenever the specified operation has failed finding a function
 * containing the specified address. Should be overriden by subclasses.
131
 * See the Profile.Operation enum for the list of
132
 * possible operations.
133
 *
134
 * @param {number} operation Operation.
135
 * @param {number} addr Address of the unknown code.
136 137 138
 * @param {number} opt_stackPos If an unknown address is encountered
 *     during stack strace processing, specifies a position of the frame
 *     containing the address.
139
 */
140 141
Profile.prototype.handleUnknownCode = function (
  operation, addr, opt_stackPos) {
142 143 144 145
};


/**
146 147 148 149 150 151
 * Registers a library.
 *
 * @param {string} name Code entry name.
 * @param {number} startAddr Starting address.
 * @param {number} endAddr Ending address.
 */
152 153
Profile.prototype.addLibrary = function (
  name, startAddr, endAddr) {
154
  var entry = new CodeMap.CodeEntry(
155
    endAddr - startAddr, name, 'SHARED_LIB');
156 157 158 159 160 161 162
  this.codeMap_.addLibrary(startAddr, entry);
  return entry;
};


/**
 * Registers statically compiled code entry.
163 164 165 166 167
 *
 * @param {string} name Code entry name.
 * @param {number} startAddr Starting address.
 * @param {number} endAddr Ending address.
 */
168 169
Profile.prototype.addStaticCode = function (
  name, startAddr, endAddr) {
170
  var entry = new CodeMap.CodeEntry(
171
    endAddr - startAddr, name, 'CPP');
172 173
  this.codeMap_.addStaticCode(startAddr, entry);
  return entry;
174 175 176 177 178 179 180 181 182 183 184
};


/**
 * Registers dynamic (JIT-compiled) code entry.
 *
 * @param {string} type Code entry type.
 * @param {string} name Code entry name.
 * @param {number} start Starting address.
 * @param {number} size Code entry size.
 */
185 186
Profile.prototype.addCode = function (
  type, name, timestamp, start, size) {
187
  var entry = new Profile.DynamicCodeEntry(size, type, name);
188 189
  this.codeMap_.addCode(start, entry);
  return entry;
190 191 192
};


193
/**
194
 * Registers dynamic (JIT-compiled) code entry.
195
 *
196 197 198 199 200 201 202
 * @param {string} type Code entry type.
 * @param {string} name Code entry name.
 * @param {number} start Starting address.
 * @param {number} size Code entry size.
 * @param {number} funcAddr Shared function object address.
 * @param {Profile.CodeState} state Optimization state.
 */
203 204
Profile.prototype.addFuncCode = function (
  type, name, timestamp, start, size, funcAddr, state) {
205 206 207 208 209 210 211 212 213
  // As code and functions are in the same address space,
  // it is safe to put them in a single code map.
  var func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
  if (!func) {
    func = new Profile.FunctionEntry(name);
    this.codeMap_.addCode(funcAddr, func);
  } else if (func.name !== name) {
    // Function object has been overwritten with a new one.
    func.name = name;
214
  }
215
  var entry = this.codeMap_.findDynamicEntryByStartAddress(start);
216 217 218 219
  if (entry) {
    if (entry.size === size && entry.func === func) {
      // Entry state has changed.
      entry.state = state;
220 221 222
    } else {
      this.codeMap_.deleteCode(start);
      entry = null;
223
    }
224 225
  }
  if (!entry) {
226 227
    entry = new Profile.DynamicFuncCodeEntry(size, type, func, state);
    this.codeMap_.addCode(start, entry);
228
  }
229
  return entry;
230 231 232
};


233 234 235 236 237 238
/**
 * Reports about moving of a dynamic code entry.
 *
 * @param {number} from Current code entry address.
 * @param {number} to New code entry address.
 */
239
Profile.prototype.moveCode = function (from, to) {
240 241 242
  try {
    this.codeMap_.moveCode(from, to);
  } catch (e) {
243
    this.handleUnknownCode(Profile.Operation.MOVE, from);
244 245 246
  }
};

247 248 249
Profile.prototype.deoptCode = function (
  timestamp, code, inliningId, scriptOffset, bailoutType,
  sourcePositionText, deoptReasonText) {
250
};
251

252 253 254 255 256
/**
 * Reports about deletion of a dynamic code entry.
 *
 * @param {number} start Starting address.
 */
257
Profile.prototype.deleteCode = function (start) {
258 259 260 261 262 263 264
  try {
    this.codeMap_.deleteCode(start);
  } catch (e) {
    this.handleUnknownCode(Profile.Operation.DELETE, start);
  }
};

265 266 267
/**
 * Adds source positions for given code.
 */
268 269 270
Profile.prototype.addSourcePositions = function (
  start, script, startPos, endPos, sourcePositions, inliningPositions,
  inlinedFunctions) {
271 272 273 274 275 276
  // CLI does not need source code => ignore.
};

/**
 * Adds script source code.
 */
277 278 279 280
Profile.prototype.addScriptSource = function (id, url, source) {
  const script = new Script(id, url, source);
  this.scripts_[id] = script;
  this.urlToScript_.set(url, script);
281 282 283 284 285 286 287 288
};


/**
 * Adds script source code.
 */
Profile.prototype.getScript = function (url) {
  return this.urlToScript_.get(url);
289
};
290

291 292 293 294 295 296
/**
 * Reports about moving of a dynamic code entry.
 *
 * @param {number} from Current code entry address.
 * @param {number} to New code entry address.
 */
297
Profile.prototype.moveFunc = function (from, to) {
298 299 300 301 302 303
  if (this.codeMap_.findDynamicEntryByStartAddress(from)) {
    this.codeMap_.moveCode(from, to);
  }
};


304 305 306 307 308
/**
 * Retrieves a code entry by an address.
 *
 * @param {number} addr Entry address.
 */
309
Profile.prototype.findEntry = function (addr) {
310 311 312 313
  return this.codeMap_.findEntry(addr);
};


314 315 316 317 318 319
/**
 * Records a tick event. Stack must contain a sequence of
 * addresses starting with the program counter value.
 *
 * @param {Array<number>} stack Stack sample.
 */
320
Profile.prototype.recordTick = function (time_ns, vmState, stack) {
321 322 323 324 325 326 327 328 329 330 331 332 333
  var processedStack = this.resolveAndFilterFuncs_(stack);
  this.bottomUpTree_.addPath(processedStack);
  processedStack.reverse();
  this.topDownTree_.addPath(processedStack);
};


/**
 * Translates addresses into function names and filters unneeded
 * functions.
 *
 * @param {Array<number>} stack Stack sample.
 */
334
Profile.prototype.resolveAndFilterFuncs_ = function (stack) {
335
  var result = [];
336 337
  var last_seen_c_function = '';
  var look_for_first_c_function = false;
338 339 340 341
  for (var i = 0; i < stack.length; ++i) {
    var entry = this.codeMap_.findEntry(stack[i]);
    if (entry) {
      var name = entry.getName();
jkummerow's avatar
jkummerow committed
342
      if (i === 0 && (entry.type === 'CPP' || entry.type === 'SHARED_LIB')) {
343 344
        look_for_first_c_function = true;
      }
jkummerow's avatar
jkummerow committed
345 346
      if (look_for_first_c_function && entry.type === 'CPP') {
        last_seen_c_function = name;
347
      }
348 349 350 351
      if (!this.skipThisFunction(name)) {
        result.push(name);
      }
    } else {
jkummerow's avatar
jkummerow committed
352 353 354 355
      this.handleUnknownCode(Profile.Operation.TICK, stack[i], i);
      if (i === 0) result.push("UNKNOWN");
    }
    if (look_for_first_c_function &&
356 357 358
      i > 0 &&
      (!entry || entry.type !== 'CPP') &&
      last_seen_c_function !== '') {
jkummerow's avatar
jkummerow committed
359 360 361 362 363
      if (this.c_entries_[last_seen_c_function] === undefined) {
        this.c_entries_[last_seen_c_function] = 0;
      }
      this.c_entries_[last_seen_c_function]++;
      look_for_first_c_function = false;  // Found it, we're done.
364 365 366 367 368 369 370
    }
  }
  return result;
};


/**
371
 * Performs a BF traversal of the top down call graph.
372
 *
373
 * @param {function(CallTree.Node)} f Visitor function.
374
 */
375
Profile.prototype.traverseTopDownTree = function (f) {
376 377 378 379 380
  this.topDownTree_.traverse(f);
};


/**
381
 * Performs a BF traversal of the bottom up call graph.
382
 *
383
 * @param {function(CallTree.Node)} f Visitor function.
384
 */
385
Profile.prototype.traverseBottomUpTree = function (f) {
386 387 388 389
  this.bottomUpTree_.traverse(f);
};


390
/**
391 392
 * Calculates a top down profile for a node with the specified label.
 * If no name specified, returns the whole top down calls tree.
393
 *
394
 * @param {string} opt_label Node label.
395
 */
396
Profile.prototype.getTopDownProfile = function (opt_label) {
397 398 399 400 401 402 403 404 405 406
  return this.getTreeProfile_(this.topDownTree_, opt_label);
};


/**
 * Calculates a bottom up profile for a node with the specified label.
 * If no name specified, returns the whole bottom up calls tree.
 *
 * @param {string} opt_label Node label.
 */
407
Profile.prototype.getBottomUpProfile = function (opt_label) {
408
  return this.getTreeProfile_(this.bottomUpTree_, opt_label);
409 410 411 412
};


/**
413
 * Helper function for calculating a tree profile.
414
 *
415
 * @param {Profile.CallTree} tree Call tree.
416
 * @param {string} opt_label Node label.
417
 */
418
Profile.prototype.getTreeProfile_ = function (tree, opt_label) {
419 420 421
  if (!opt_label) {
    tree.computeTotalWeights();
    return tree;
422
  } else {
423 424 425
    var subTree = tree.cloneSubtree(opt_label);
    subTree.computeTotalWeights();
    return subTree;
426 427 428 429
  }
};


430
/**
431 432
 * Calculates a flat profile of callees starting from a node with
 * the specified label. If no name specified, starts from the root.
433
 *
434
 * @param {string} opt_label Starting node label.
435
 */
436
Profile.prototype.getFlatProfile = function (opt_label) {
437 438
  var counters = new CallTree();
  var rootLabel = opt_label || CallTree.ROOT_NODE_LABEL;
439
  var precs = {};
440 441 442
  precs[rootLabel] = 0;
  var root = counters.findOrAddChild(rootLabel);

443 444 445 446 447 448
  this.topDownTree_.computeTotalWeights();
  this.topDownTree_.traverseInDepth(
    function onEnter(node) {
      if (!(node.label in precs)) {
        precs[node.label] = 0;
      }
449 450 451 452 453 454 455 456 457 458 459 460 461
      var nodeLabelIsRootLabel = node.label == rootLabel;
      if (nodeLabelIsRootLabel || precs[rootLabel] > 0) {
        if (precs[rootLabel] == 0) {
          root.selfWeight += node.selfWeight;
          root.totalWeight += node.totalWeight;
        } else {
          var rec = root.findOrAddChild(node.label);
          rec.selfWeight += node.selfWeight;
          if (nodeLabelIsRootLabel || precs[node.label] == 0) {
            rec.totalWeight += node.totalWeight;
          }
        }
        precs[node.label]++;
462 463 464
      }
    },
    function onExit(node) {
465 466 467
      if (node.label == rootLabel || precs[rootLabel] > 0) {
        precs[node.label]--;
      }
468
    },
469 470 471 472 473 474 475 476 477 478 479 480
    null);

  if (!opt_label) {
    // If we have created a flat profile for the whole program, we don't
    // need an explicit root in it. Thus, replace the counters tree
    // root with the node corresponding to the whole program.
    counters.root_ = root;
  } else {
    // Propagate weights so percents can be calculated correctly.
    counters.getRoot().selfWeight = root.selfWeight;
    counters.getRoot().totalWeight = root.totalWeight;
  }
481
  return counters;
482 483 484
};


485
Profile.CEntryNode = function (name, ticks) {
486 487 488 489 490
  this.name = name;
  this.ticks = ticks;
}


491
Profile.prototype.getCEntryProfile = function () {
492 493 494 495 496 497 498 499
  var result = [new Profile.CEntryNode("TOTAL", 0)];
  var total_ticks = 0;
  for (var f in this.c_entries_) {
    var ticks = this.c_entries_[f];
    total_ticks += ticks;
    result.push(new Profile.CEntryNode(f, ticks));
  }
  result[0].ticks = total_ticks;  // Sorting will keep this at index 0.
500
  result.sort(function (n1, n2) {
501 502 503 504 505 506
    return n2.ticks - n1.ticks || (n2.name < n1.name ? -1 : 1)
  });
  return result;
}


507 508 509
/**
 * Cleans up function entries that are not referenced by code entries.
 */
510
Profile.prototype.cleanUpFuncEntries = function () {
511 512 513 514 515 516 517 518 519 520 521 522 523 524
  var referencedFuncEntries = [];
  var entries = this.codeMap_.getAllDynamicEntriesWithAddresses();
  for (var i = 0, l = entries.length; i < l; ++i) {
    if (entries[i][1].constructor === Profile.FunctionEntry) {
      entries[i][1].used = false;
    }
  }
  for (var i = 0, l = entries.length; i < l; ++i) {
    if ("func" in entries[i][1]) {
      entries[i][1].func.used = true;
    }
  }
  for (var i = 0, l = entries.length; i < l; ++i) {
    if (entries[i][1].constructor === Profile.FunctionEntry &&
525
      !entries[i][1].used) {
526 527 528 529 530 531
      this.codeMap_.deleteCode(entries[i][0]);
    }
  }
};


532 533 534 535 536 537 538 539
/**
 * Creates a dynamic code entry.
 *
 * @param {number} size Code size.
 * @param {string} type Code type.
 * @param {string} name Function name.
 * @constructor
 */
540
Profile.DynamicCodeEntry = function (size, type, name) {
541
  CodeMap.CodeEntry.call(this, size, name, type);
542 543 544 545 546 547
};


/**
 * Returns node name.
 */
548
Profile.DynamicCodeEntry.prototype.getName = function () {
549
  return this.type + ': ' + this.name;
550 551 552
};


553 554 555
/**
 * Returns raw node name (without type decoration).
 */
556
Profile.DynamicCodeEntry.prototype.getRawName = function () {
557 558 559 560
  return this.name;
};


561
Profile.DynamicCodeEntry.prototype.isJSFunction = function () {
562 563 564 565
  return false;
};


566
Profile.DynamicCodeEntry.prototype.toString = function () {
567 568 569 570
  return this.getName() + ': ' + this.size.toString(16);
};


571 572 573 574 575 576 577 578 579
/**
 * Creates a dynamic code entry.
 *
 * @param {number} size Code size.
 * @param {string} type Code type.
 * @param {Profile.FunctionEntry} func Shared function entry.
 * @param {Profile.CodeState} state Code optimization state.
 * @constructor
 */
580
Profile.DynamicFuncCodeEntry = function (size, type, func, state) {
581
  CodeMap.CodeEntry.call(this, size, '', type);
582 583 584 585 586 587
  this.func = func;
  this.state = state;
};

Profile.DynamicFuncCodeEntry.STATE_PREFIX = ["", "~", "*"];

588 589 590
/**
 * Returns state.
 */
591
Profile.DynamicFuncCodeEntry.prototype.getState = function () {
592 593 594
  return Profile.DynamicFuncCodeEntry.STATE_PREFIX[this.state];
};

595 596 597
/**
 * Returns node name.
 */
598
Profile.DynamicFuncCodeEntry.prototype.getName = function () {
599
  var name = this.func.getName();
600
  return this.type + ': ' + this.getState() + name;
601 602 603 604 605 606
};


/**
 * Returns raw node name (without type decoration).
 */
607
Profile.DynamicFuncCodeEntry.prototype.getRawName = function () {
608 609 610 611
  return this.func.getName();
};


612
Profile.DynamicFuncCodeEntry.prototype.isJSFunction = function () {
613 614 615 616
  return true;
};


617
Profile.DynamicFuncCodeEntry.prototype.toString = function () {
618 619 620 621
  return this.getName() + ': ' + this.size.toString(16);
};


622 623 624 625 626 627
/**
 * Creates a shared function object entry.
 *
 * @param {string} name Function name.
 * @constructor
 */
628
Profile.FunctionEntry = function (name) {
629 630 631 632 633 634 635
  CodeMap.CodeEntry.call(this, 0, name);
};


/**
 * Returns node name.
 */
636
Profile.FunctionEntry.prototype.getName = function () {
637 638 639 640 641 642 643 644
  var name = this.name;
  if (name.length == 0) {
    name = '<anonymous>';
  } else if (name.charAt(0) == ' ') {
    // An anonymous function with location: " aaa.js:10".
    name = '<anonymous>' + name;
  }
  return name;
645 646
};

647
Profile.FunctionEntry.prototype.toString = CodeMap.CodeEntry.prototype.toString;
648

649 650 651 652 653
/**
 * Constructs a call graph.
 *
 * @constructor
 */
654 655
function CallTree() {
  this.root_ = new CallTree.Node(
656
    CallTree.ROOT_NODE_LABEL);
657 658 659
};


660 661 662
/**
 * The label of the root node.
 */
663
CallTree.ROOT_NODE_LABEL = '';
664 665


666 667 668
/**
 * @private
 */
669
CallTree.prototype.totalsComputed_ = false;
670 671


672 673 674
/**
 * Returns the tree root.
 */
675
CallTree.prototype.getRoot = function () {
676 677 678 679
  return this.root_;
};


680 681 682 683 684
/**
 * Adds the specified call path, constructing nodes as necessary.
 *
 * @param {Array<string>} path Call path.
 */
685
CallTree.prototype.addPath = function (path) {
686 687 688 689 690 691 692 693 694 695 696 697
  if (path.length == 0) {
    return;
  }
  var curr = this.root_;
  for (var i = 0; i < path.length; ++i) {
    curr = curr.findOrAddChild(path[i]);
  }
  curr.selfWeight++;
  this.totalsComputed_ = false;
};


698 699 700 701 702 703 704
/**
 * Finds an immediate child of the specified parent with the specified
 * label, creates a child node if necessary. If a parent node isn't
 * specified, uses tree root.
 *
 * @param {string} label Child node label.
 */
705
CallTree.prototype.findOrAddChild = function (label) {
706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725
  return this.root_.findOrAddChild(label);
};


/**
 * Creates a subtree by cloning and merging all subtrees rooted at nodes
 * with a given label. E.g. cloning the following call tree on label 'A'
 * will give the following result:
 *
 *           <A>--<B>                                     <B>
 *          /                                            /
 *     <root>             == clone on 'A' ==>  <root>--<A>
 *          \                                            \
 *           <C>--<A>--<D>                                <D>
 *
 * And <A>'s selfWeight will be the sum of selfWeights of <A>'s from the
 * source call tree.
 *
 * @param {string} label The label of the new root node.
 */
726
CallTree.prototype.cloneSubtree = function (label) {
727
  var subTree = new CallTree();
728
  this.traverse(function (node, parent) {
729 730 731 732 733 734 735 736
    if (!parent && node.label != label) {
      return null;
    }
    var child = (parent ? parent : subTree).findOrAddChild(node.label);
    child.selfWeight += node.selfWeight;
    return child;
  });
  return subTree;
737 738 739
};


740 741 742
/**
 * Computes total weights in the call graph.
 */
743
CallTree.prototype.computeTotalWeights = function () {
744 745 746 747 748 749 750 751 752
  if (this.totalsComputed_) {
    return;
  }
  this.root_.computeTotalWeight();
  this.totalsComputed_ = true;
};


/**
753 754 755
 * Traverses the call graph in preorder. This function can be used for
 * building optionally modified tree clones. This is the boilerplate code
 * for this scenario:
756
 *
757 758 759 760 761 762 763
 * callTree.traverse(function(node, parentClone) {
 *   var nodeClone = cloneNode(node);
 *   if (parentClone)
 *     parentClone.addChild(nodeClone);
 *   return nodeClone;
 * });
 *
764
 * @param {function(CallTree.Node, *)} f Visitor function.
765
 *    The second parameter is the result of calling 'f' on the parent node.
766
 */
767
CallTree.prototype.traverse = function (f) {
768
  var pairsToProcess = new ConsArray();
769
  pairsToProcess.concat([{ node: this.root_, param: null }]);
770 771
  while (!pairsToProcess.atEnd()) {
    var pair = pairsToProcess.next();
772 773
    var node = pair.node;
    var newParam = f(node, pair.param);
774 775
    var morePairsToProcess = [];
    node.forEachChild(function (child) {
776 777
      morePairsToProcess.push({ node: child, param: newParam });
    });
778
    pairsToProcess.concat(morePairsToProcess);
779 780 781 782 783 784 785
  }
};


/**
 * Performs an indepth call graph traversal.
 *
786
 * @param {function(CallTree.Node)} enter A function called
787
 *     prior to visiting node's children.
788
 * @param {function(CallTree.Node)} exit A function called
789 790
 *     after visiting node's children.
 */
791
CallTree.prototype.traverseInDepth = function (enter, exit) {
792 793 794 795 796
  function traverse(node) {
    enter(node);
    node.forEachChild(traverse);
    exit(node);
  }
797
  traverse(this.root_);
798 799 800 801 802 803 804
};


/**
 * Constructs a call graph node.
 *
 * @param {string} label Node label.
805
 * @param {CallTree.Node} opt_parent Node parent.
806
 */
807
CallTree.Node = function (label, opt_parent) {
808 809 810 811 812 813 814 815 816 817 818
  this.label = label;
  this.parent = opt_parent;
  this.children = {};
};


/**
 * Node self weight (how many times this node was the last node in
 * a call path).
 * @type {number}
 */
819
CallTree.Node.prototype.selfWeight = 0;
820 821 822 823 824 825


/**
 * Node total weight (includes weights of all children).
 * @type {number}
 */
826
CallTree.Node.prototype.totalWeight = 0;
827 828 829 830 831 832 833


/**
 * Adds a child node.
 *
 * @param {string} label Child node label.
 */
834
CallTree.Node.prototype.addChild = function (label) {
835
  var child = new CallTree.Node(label, this);
836 837 838 839 840 841 842 843
  this.children[label] = child;
  return child;
};


/**
 * Computes node's total weight.
 */
844
CallTree.Node.prototype.computeTotalWeight =
845 846 847 848 849 850 851
  function () {
    var totalWeight = this.selfWeight;
    this.forEachChild(function (child) {
      totalWeight += child.computeTotalWeight();
    });
    return this.totalWeight = totalWeight;
  };
852 853 854 855 856


/**
 * Returns all node's children as an array.
 */
857
CallTree.Node.prototype.exportChildren = function () {
858 859 860 861 862 863 864 865 866 867 868
  var result = [];
  this.forEachChild(function (node) { result.push(node); });
  return result;
};


/**
 * Finds an immediate child with the specified label.
 *
 * @param {string} label Child node label.
 */
869
CallTree.Node.prototype.findChild = function (label) {
870 871 872 873 874 875 876 877 878 879
  return this.children[label] || null;
};


/**
 * Finds an immediate child with the specified label, creates a child
 * node if necessary.
 *
 * @param {string} label Child node label.
 */
880
CallTree.Node.prototype.findOrAddChild = function (label) {
881 882 883 884 885 886 887
  return this.findChild(label) || this.addChild(label);
};


/**
 * Calls the specified function for every child.
 *
888
 * @param {function(CallTree.Node)} f Visitor function.
889
 */
890
CallTree.Node.prototype.forEachChild = function (f) {
891 892 893 894 895 896 897 898 899
  for (var c in this.children) {
    f(this.children[c]);
  }
};


/**
 * Walks up from the current node up to the call tree root.
 *
900
 * @param {function(CallTree.Node)} f Visitor function.
901
 */
902
CallTree.Node.prototype.walkUpToRoot = function (f) {
903 904 905 906 907 908 909 910 911 912
  for (var curr = this; curr != null; curr = curr.parent) {
    f(curr);
  }
};


/**
 * Tries to find a node with the specified path.
 *
 * @param {Array<string>} labels The path.
913
 * @param {function(CallTree.Node)} opt_f Visitor function.
914
 */
915 916
CallTree.Node.prototype.descendToChild = function (
  labels, opt_f) {
917 918 919 920 921 922 923 924 925
  for (var pos = 0, curr = this; pos < labels.length && curr != null; pos++) {
    var child = curr.findChild(labels[pos]);
    if (opt_f) {
      opt_f(child, pos);
    }
    curr = child;
  }
  return curr;
};
926 927 928 929 930 931

function JsonProfile() {
  this.codeMap_ = new CodeMap();
  this.codeEntries_ = [];
  this.functionEntries_ = [];
  this.ticks_ = [];
932
  this.scripts_ = [];
933 934
}

935 936
JsonProfile.prototype.addLibrary = function (
  name, startAddr, endAddr) {
937
  var entry = new CodeMap.CodeEntry(
938
    endAddr - startAddr, name, 'SHARED_LIB');
939 940 941
  this.codeMap_.addLibrary(startAddr, entry);

  entry.codeId = this.codeEntries_.length;
942
  this.codeEntries_.push({ name: entry.name, type: entry.type });
943 944 945
  return entry;
};

946 947
JsonProfile.prototype.addStaticCode = function (
  name, startAddr, endAddr) {
948
  var entry = new CodeMap.CodeEntry(
949
    endAddr - startAddr, name, 'CPP');
950 951 952
  this.codeMap_.addStaticCode(startAddr, entry);

  entry.codeId = this.codeEntries_.length;
953
  this.codeEntries_.push({ name: entry.name, type: entry.type });
954 955 956
  return entry;
};

957 958
JsonProfile.prototype.addCode = function (
  kind, name, timestamp, start, size) {
959 960 961 962 963 964 965 966
  let codeId = this.codeEntries_.length;
  // Find out if we have a static code entry for the code. If yes, we will
  // make sure it is written to the JSON file just once.
  let staticEntry = this.codeMap_.findAddress(start);
  if (staticEntry && staticEntry.entry.type === 'CPP') {
    codeId = staticEntry.entry.codeId;
  }

967 968 969
  var entry = new CodeMap.CodeEntry(size, name, 'CODE');
  this.codeMap_.addCode(start, entry);

970 971
  entry.codeId = codeId;
  this.codeEntries_[codeId] = {
972
    name: entry.name,
973
    timestamp: timestamp,
974 975
    type: entry.type,
    kind: kind
976
  };
977 978 979 980

  return entry;
};

981 982
JsonProfile.prototype.addFuncCode = function (
  kind, name, timestamp, start, size, funcAddr, state) {
983 984 985 986 987 988 989 990
  // As code and functions are in the same address space,
  // it is safe to put them in a single code map.
  var func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
  if (!func) {
    var func = new CodeMap.CodeEntry(0, name, 'SFI');
    this.codeMap_.addCode(funcAddr, func);

    func.funcId = this.functionEntries_.length;
991
    this.functionEntries_.push({ name: name, codes: [] });
992 993 994 995 996
  } else if (func.name !== name) {
    // Function object has been overwritten with a new one.
    func.name = name;

    func.funcId = this.functionEntries_.length;
997
    this.functionEntries_.push({ name: name, codes: [] });
998 999 1000 1001 1002 1003 1004
  }
  // TODO(jarin): Insert the code object into the SFI's code list.
  var entry = this.codeMap_.findDynamicEntryByStartAddress(start);
  if (entry) {
    if (entry.size === size && entry.func === func) {
      // Entry state has changed.
      entry.state = state;
1005 1006 1007
    } else {
      this.codeMap_.deleteCode(start);
      entry = null;
1008
    }
1009 1010 1011
  }
  if (!entry) {
    entry = new CodeMap.CodeEntry(size, name, 'JS');
1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
    this.codeMap_.addCode(start, entry);

    entry.codeId = this.codeEntries_.length;

    this.functionEntries_[func.funcId].codes.push(entry.codeId);

    if (state === 0) {
      kind = "Builtin";
    } else if (state === 1) {
      kind = "Unopt";
    } else if (state === 2) {
      kind = "Opt";
    }

    this.codeEntries_.push({
1027 1028 1029 1030 1031
      name: entry.name,
      type: entry.type,
      kind: kind,
      func: func.funcId,
      tm: timestamp
1032 1033 1034 1035 1036
    });
  }
  return entry;
};

1037
JsonProfile.prototype.moveCode = function (from, to) {
1038 1039 1040 1041 1042 1043 1044
  try {
    this.codeMap_.moveCode(from, to);
  } catch (e) {
    printErr("Move: unknown source " + from);
  }
};

1045 1046 1047
JsonProfile.prototype.addSourcePositions = function (
  start, script, startPos, endPos, sourcePositions, inliningPositions,
  inlinedFunctions) {
1048 1049 1050 1051
  var entry = this.codeMap_.findDynamicEntryByStartAddress(start);
  if (!entry) return;
  var codeId = entry.codeId;

1052
  // Resolve the inlined functions list.
1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069
  if (inlinedFunctions.length > 0) {
    inlinedFunctions = inlinedFunctions.substring(1).split("S");
    for (var i = 0; i < inlinedFunctions.length; i++) {
      var funcAddr = parseInt(inlinedFunctions[i]);
      var func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
      if (!func || func.funcId === undefined) {
        printErr("Could not find function " + inlinedFunctions[i]);
        inlinedFunctions[i] = null;
      } else {
        inlinedFunctions[i] = func.funcId;
      }
    }
  } else {
    inlinedFunctions = [];
  }

  this.codeEntries_[entry.codeId].source = {
1070 1071 1072 1073 1074 1075
    script: script,
    start: startPos,
    end: endPos,
    positions: sourcePositions,
    inlined: inliningPositions,
    fns: inlinedFunctions
1076 1077 1078
  };
};

1079 1080
JsonProfile.prototype.addScriptSource = function (id, url, source) {
  this.scripts_[id] = new Script(id, url, source);
1081 1082 1083
};


1084 1085 1086
JsonProfile.prototype.deoptCode = function (
  timestamp, code, inliningId, scriptOffset, bailoutType,
  sourcePositionText, deoptReasonText) {
1087 1088 1089 1090 1091 1092 1093 1094
  let entry = this.codeMap_.findDynamicEntryByStartAddress(code);
  if (entry) {
    let codeId = entry.codeId;
    if (!this.codeEntries_[codeId].deopt) {
      // Only add the deopt if there was no deopt before.
      // The subsequent deoptimizations should be lazy deopts for
      // other on-stack activations.
      this.codeEntries_[codeId].deopt = {
1095 1096 1097 1098 1099 1100
        tm: timestamp,
        inliningId: inliningId,
        scriptOffset: scriptOffset,
        posText: sourcePositionText,
        reason: deoptReasonText,
        bailoutType: bailoutType
1101 1102 1103 1104 1105
      };
    }
  }
};

1106
JsonProfile.prototype.deleteCode = function (start) {
1107 1108 1109 1110 1111 1112 1113
  try {
    this.codeMap_.deleteCode(start);
  } catch (e) {
    printErr("Delete: unknown address " + start);
  }
};

1114
JsonProfile.prototype.moveFunc = function (from, to) {
1115 1116 1117 1118 1119
  if (this.codeMap_.findDynamicEntryByStartAddress(from)) {
    this.codeMap_.moveCode(from, to);
  }
};

1120
JsonProfile.prototype.findEntry = function (addr) {
1121 1122 1123
  return this.codeMap_.findEntry(addr);
};

1124
JsonProfile.prototype.recordTick = function (time_ns, vmState, stack) {
1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135
  // TODO(jarin) Resolve the frame-less case (when top of stack is
  // known code).
  var processedStack = [];
  for (var i = 0; i < stack.length; i++) {
    var resolved = this.codeMap_.findAddress(stack[i]);
    if (resolved) {
      processedStack.push(resolved.entry.codeId, resolved.offset);
    } else {
      processedStack.push(-1, stack[i]);
    }
  }
1136
  this.ticks_.push({ tm: time_ns, vm: vmState, s: processedStack });
1137 1138
};

1139 1140 1141 1142
function writeJson(s) {
  write(JSON.stringify(s, null, 2));
}

1143
JsonProfile.prototype.writeJson = function () {
1144 1145 1146
  // Write out the JSON in a partially manual way to avoid creating too-large
  // strings in one JSON.stringify call when there are a lot of ticks.
  write('{\n')
1147 1148 1149 1150 1151 1152 1153 1154 1155

  write('  "code": ');
  writeJson(this.codeEntries_);
  write(',\n');

  write('  "functions": ');
  writeJson(this.functionEntries_);
  write(',\n');

1156 1157
  write('  "ticks": [\n');
  for (var i = 0; i < this.ticks_.length; i++) {
1158 1159
    write('    ');
    writeJson(this.ticks_[i]);
1160 1161 1162 1163 1164 1165
    if (i < this.ticks_.length - 1) {
      write(',\n');
    } else {
      write('\n');
    }
  }
1166 1167 1168 1169 1170
  write('  ],\n');

  write('  "scripts": ');
  writeJson(this.scripts_);

1171
  write('}\n');
1172
};