[profview] Add runtime-entry top-down tree.

tools/profview/profile-utils.js

 // Copyright 2017 the V8 project 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"
 
 let codeKinds = [
     "UNKNOWN",
     "CPPCOMP",
     "CPPGC",
@@ skipping 112 matching lines @@
     paths.push(pathIndex, depth, 1);
   }
 }
 
 function findNextFrame(file, stack, stackPos, step, filter) {
   let codeId = -1;
   let code = null;
   while (stackPos >= 0 && stackPos < stack.length) {
     codeId = stack[stackPos];
     code = codeId >= 0 ? file.code[codeId] : undefined;
+
     if (filter) {
       let type = code ? code.type : undefined;
       let kind = code ? code.kind : undefined;
       if (filter(type, kind)) return stackPos;
     }
     stackPos += step;
   }
   return -1;
 }
 
@@ skipping 48 matching lines @@
   return {
       name : name,
       codeId: -1,
       type : "CAT",
       children : [],
       ownTicks : 0,
       ticks : 0
   };
 }
 
+class RuntimeCallTreeProcessor {
+  constructor() {
+    this.tree = createEmptyNode("root");
+    this.tree.delayedExpansion = { frameList : [], ascending : false };
+  }
+
+  addStack(file, tickIndex) {
+    this.tree.ticks++;
+
+    let stack = file.ticks[tickIndex].s;
+    let i;
+    for (i = 0; i < stack.length; i += 2) {
+      let codeId = stack[i];
+      if (codeId < 0) return;
+      let code = file.code[codeId];
+      if (code.type !== "CPP" && code.type !== "SHARED_LIB") {
+        i -= 2;
+        break;
+      }
+    }
+    if (i < 0 || i >= stack.length) return;
+    addOrUpdateChildNode(this.tree, file, tickIndex, i, false);
+  }
+}
+
 class PlainCallTreeProcessor {
   constructor(filter, isBottomUp) {
     this.filter = filter;
     this.tree = createEmptyNode("root");
     this.tree.delayedExpansion = { frameList : [], ascending : isBottomUp };
     this.isBottomUp = isBottomUp;
   }
 
   addStack(file, tickIndex) {
     let stack = file.ticks[tickIndex].s;
@@ skipping 348 matching lines @@
   return {
     functionCount,
     optimizedFunctionCount,
     deoptimizedFunctionCount,
     optimizations,
     eagerDeoptimizations,
     lazyDeoptimizations,
     softDeoptimizations,
   };
 }