Show live objects with given allocation call stack

Source/devtools/front_end/HeapSnapshot.js

 /*
  * Copyright (C) 2011 Google 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:
  *
  *     * 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
@@ skipping 755 matching lines @@
         var nodes = this._nodes;
         var nodesLength = nodes.length;
         var nodeFieldCount = this._nodeFieldCount;
         var node = this.rootNode();
         var liveObjects = {};
         for (var nodeIndex = 0; nodeIndex < nodesLength; nodeIndex += nodeFieldCount) {
             node.nodeIndex = nodeIndex;
             var traceNodeId = node.traceNodeId();
             var stats = liveObjects[traceNodeId];
             if (!stats) {
-                liveObjects[traceNodeId] = stats = { count: 0, size: 0};
+                liveObjects[traceNodeId] = stats = { count: 0, size: 0, ids: []};
             }
             stats.count++;
             stats.size += node.selfSize();
+            stats.ids.push(node.id());
         }
         this._allocationProfile = new WebInspector.AllocationProfile(profile, liveObjects);
         this._progress.updateStatus("Done");
     }
 }
 
 /**
  * @constructor
  */
 function HeapSnapshotMetainfo()
@@ skipping 215 matching lines @@
     },
 
     /**
      * @param {!WebInspector.HeapSnapshotCommon.NodeFilter} nodeFilter
      * @return {!Object.<string, !WebInspector.HeapSnapshotCommon.Aggregate>}
      */
     aggregatesWithFilter: function(nodeFilter)
     {
         var minNodeId = nodeFilter.minNodeId;
         var maxNodeId = nodeFilter.maxNodeId;
+        var allocationNodeId = nodeFilter.allocationNodeId;
         var key;
         var filter;
-        /**
-         * @param {!WebInspector.HeapSnapshotNode} node
-         * @return boolean
-         */
-        function filterById(node)
-        {
-            var id = node.id();
-            return id > minNodeId && id <= maxNodeId;
-        }
-        if (typeof minNodeId === "number") {
+        if (typeof allocationNodeId === "number") {
+            filter = this._createAllocationStackFilter(allocationNodeId);
+        } else if (typeof minNodeId === "number" && typeof maxNodeId === "number") {
             key = minNodeId + ".." + maxNodeId;
-            filter = filterById;
+            filter = this._createNodeIdFilter(minNodeId, maxNodeId);
         } else {
             key = "allObjects";
         }
         return this.aggregates(false, key, filter);
     },
 
     /**
+     * @param {number} minNodeId
+     * @param {number} maxNodeId
+     * @return {function(!WebInspector.HeapSnapshotNode):boolean}
+     */
+    _createNodeIdFilter: function(minNodeId, maxNodeId)
+    {
+        /**
+         * @param {!WebInspector.HeapSnapshotNode} node
+         * @return boolean
+         */
+        function nodeIdFilter(node)
+        {
+            var id = node.id();
+            return id > minNodeId && id <= maxNodeId;
+        }
+        return nodeIdFilter;
+    },
+
+    /**
+     * @param {number} bottomUpAllocationNodeId
+     * @return {function(!WebInspector.HeapSnapshotNode):boolean|undefined}
+     */
+    _createAllocationStackFilter: function(bottomUpAllocationNodeId)
+    {
+        var traceIds = this._allocationProfile.traceIds(bottomUpAllocationNodeId);
+        if (!traceIds.length)
+            return undefined;
+        var set = {};
+        for (var i = 0; i < traceIds.length; i++)
+            set[traceIds[i]] = true;
+        /**
+         * @param {!WebInspector.HeapSnapshotNode} node
+         * @return boolean
+         */
+        function traceIdFilter(node)
+        {
+            return !!set[node.traceNodeId()];
+        };
+        return traceIdFilter;
+    },
+
+    /**
      * @param {boolean} sortedIndexes
-     * @param {string} key
+     * @param {string=} key
      * @param {function(!WebInspector.HeapSnapshotNode):boolean=} filter
      * @return {!Object.<string, !WebInspector.HeapSnapshotCommon.Aggregate>}
      */
     aggregates: function(sortedIndexes, key, filter)
     {
-        var aggregatesByClassName = this._aggregates[key];
+        var aggregatesByClassName = key && this._aggregates[key];
         if (!aggregatesByClassName) {
             var aggregates = this._buildAggregates(filter);
             this._calculateClassesRetainedSize(aggregates.aggregatesByClassIndex, filter);
             aggregatesByClassName = aggregates.aggregatesByClassName;
-            this._aggregates[key] = aggregatesByClassName;
+            if (key)
+                this._aggregates[key] = aggregatesByClassName;
         }
 
-        if (sortedIndexes && !this._aggregatesSortedFlags[key]) {
+        if (sortedIndexes && (!key || !this._aggregatesSortedFlags[key])) {
             this._sortAggregateIndexes(aggregatesByClassName);
-            this._aggregatesSortedFlags[key] = sortedIndexes;
+            if (key)
+                this._aggregatesSortedFlags[key] = sortedIndexes;
         }
         return aggregatesByClassName;
     },
 
     /**
      * @return {!Array.<!WebInspector.HeapSnapshotCommon.SerializedAllocationNode>}
      */
     allocationTracesTops: function()
     {
         return this._allocationProfile.serializeTraceTops();
@@ skipping 1158 matching lines @@
      * @param {number} windowRight
      */
     sort: function(comparator, leftBound, rightBound, windowLeft, windowRight)
     {
         this._iterationOrder.sortRange(this._buildCompareFunction(comparator), leftBound, rightBound, windowLeft, windowRight);
     },
 
     __proto__: WebInspector.HeapSnapshotFilteredOrderedIterator.prototype
 }