[profiler] Graphical front-end for tick processor.

tools/codemap.js

 // 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
@@ skipping 157 matching lines @@
 CodeMap.prototype.isAddressBelongsTo_ = function(addr, node) {
   return addr >= node.key && addr < (node.key + node.value.size);
 };
 
 
 /**
  * @private
  */
 CodeMap.prototype.findInTree_ = function(tree, addr) {
   var node = tree.findGreatestLessThan(addr);
-  return node && this.isAddressBelongsTo_(addr, node) ? node.value : null;
+  return node && this.isAddressBelongsTo_(addr, node) ? node : null;
 };
 
 
 /**
  * Finds a code entry that contains the specified address. Both static and
- * dynamic code entries are considered.
+ * dynamic code entries are considered. Returns the code entry and the offset
+ * within the entry.
  *
  * @param {number} addr Address.
  */
-CodeMap.prototype.findEntry = function(addr) {
+CodeMap.prototype.findAddress = function(addr) {
   var pageAddr = addr >>> CodeMap.PAGE_ALIGNMENT;
   if (pageAddr in this.pages_) {
     // Static code entries can contain "holes" of unnamed code.
     // In this case, the whole library is assigned to this address.
-    return this.findInTree_(this.statics_, addr) ||
-        this.findInTree_(this.libraries_, addr);
+    var result = this.findInTree_(this.statics_, addr);
+    if (!result) {
+      result = this.findInTree_(this.libraries_, addr);
+      if (!result) return null;
+    }
+    return { entry : result.value, offset : addr - result.key };
   }
   var min = this.dynamics_.findMin();
   var max = this.dynamics_.findMax();
   if (max != null && addr < (max.key + max.value.size) && addr >= min.key) {
     var dynaEntry = this.findInTree_(this.dynamics_, addr);
     if (dynaEntry == null) return null;
     // Dedupe entry name.
-    if (!dynaEntry.nameUpdated_) {
-      dynaEntry.name = this.dynamicsNameGen_.getName(dynaEntry.name);
-      dynaEntry.nameUpdated_ = true;
+    var entry = dynaEntry.value;
+    if (!entry.nameUpdated_) {
+      entry.name = this.dynamicsNameGen_.getName(entry.name);
+      entry.nameUpdated_ = true;
     }
-    return dynaEntry;
+    return { entry : entry, offset : addr - dynaEntry.key };
   }
   return null;
 };
 
 
 /**
+ * Finds a code entry that contains the specified address. Both static and
+ * dynamic code entries are considered.
+ *
+ * @param {number} addr Address.
+ */
+CodeMap.prototype.findEntry = function(addr) {
+  var result = this.findAddress(addr);
+  return result ? result.entry : null;
+};
+
+
+/**
  * Returns a dynamic code entry using its starting address.
  *
  * @param {number} addr Address.
  */
 CodeMap.prototype.findDynamicEntryByStartAddress =
     function(addr) {
   var node = this.dynamics_.find(addr);
   return node ? node.value : null;
 };
 
@@ skipping 70 matching lines @@
 
 
 CodeMap.NameGenerator.prototype.getName = function(name) {
   if (!(name in this.knownNames_)) {
     this.knownNames_[name] = 0;
     return name;
   }
   var count = ++this.knownNames_[name];
   return name + ' {' + count + '}';
 };