DevTools: don't spam console with messages about unreachable objects in heap snapshot

Source/devtools/front_end/heap_snapshot_worker/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 1550 matching lines @@
                 } else {
                     // Done with all the node children
                     nodeOrdinal2PostOrderIndex[nodeOrdinal] = postOrderIndex;
                     postOrderIndex2NodeOrdinal[postOrderIndex++] = nodeOrdinal;
                     --stackTop;
                 }
             }
 
             if (postOrderIndex === nodeCount || iteration > 1)
                 break;
-            var errors = new WebInspector.HeapSnapshotProblemReport("Error: Corrupted snapshot. " + (nodeCount - postOrderIndex) + " nodes are unreachable from the root:");
+            var errors = new WebInspector.HeapSnapshotProblemReport("Heap snapshot: " + (nodeCount - postOrderIndex) + " nodes are unreachable from the root. Following nodes have only weak retainers:");
             var dumpNode = this.rootNode();
             // Remove root from the result (last node in the array) and put it at the bottom of the stack so that it is
             // visited after all orphan nodes and their subgraphs.
             --postOrderIndex;
             stackTop = 0;
             stackNodes[0] = rootNodeOrdinal;
             stackCurrentEdge[0] = firstEdgeIndexes[rootNodeOrdinal + 1]; // no need to reiterate its edges
             for (var i = 0; i < nodeCount; ++i) {
                 if (!visited[i]) {
                     dumpNode.nodeIndex = i * nodeFieldCount;
                     // Add all nodes that have only weak retainers to traverse their subgraphs.
                     if (this._hasOnlyWeakRetainers(i)) {
                         stackNodes[++stackTop] = i;
                         stackCurrentEdge[stackTop] = firstEdgeIndexes[i];
                         visited[i] = 1;
-                        errors.addError(dumpNode.name() + " @" + dumpNode.id() + " - node has only weak retainers.");
-                    } else {
                         errors.addError(dumpNode.name() + " @" + dumpNode.id());
                     }
                 }
             }
-            this._progress.reportProblem(errors.toString());
+            console.warn(errors.toString());
         }
 
         // If we already processed all orphan nodes that have only weak retainers and still have some orphans...
         if (postOrderIndex !== nodeCount) {
-            var errors = new WebInspector.HeapSnapshotProblemReport("Error: Still found " + (nodeCount - postOrderIndex) + " unreachable nodes:");
+            var errors = new WebInspector.HeapSnapshotProblemReport("Still found " + (nodeCount - postOrderIndex) + " unreachable nodes in heap snapshot:");
             var dumpNode = this.rootNode();
             // Remove root from the result (last node in the array) and put it at the bottom of the stack so that it is
             // visited after all orphan nodes and their subgraphs.
             --postOrderIndex;
             for (var i = 0; i < nodeCount; ++i) {
                 if (visited[i])
                     continue;
                 dumpNode.nodeIndex = i * nodeFieldCount;
                 errors.addError(dumpNode.name() + " @" + dumpNode.id());
                 // Fix it by giving the node a postorder index anyway.
                 nodeOrdinal2PostOrderIndex[i] = postOrderIndex;
                 postOrderIndex2NodeOrdinal[postOrderIndex++] = i;
             }
             nodeOrdinal2PostOrderIndex[rootNodeOrdinal] = postOrderIndex;
             postOrderIndex2NodeOrdinal[postOrderIndex++] = rootNodeOrdinal;
-            this._progress.reportProblem(errors.toString());
+            console.warn(errors.toString());
         }
 
         return {postOrderIndex2NodeOrdinal: postOrderIndex2NodeOrdinal, nodeOrdinal2PostOrderIndex: nodeOrdinal2PostOrderIndex};
     },
 
     /**
      * @param {number} nodeOrdinal
      * @return {boolean}
      */
     _hasOnlyWeakRetainers: function(nodeOrdinal)
@@ skipping 733 matching lines @@
      * @param {number} windowRight
      */
     sort: function(comparator, leftBound, rightBound, windowLeft, windowRight)
     {
         this._iterationOrder.sortRange(this._buildCompareFunction(comparator), leftBound, rightBound, windowLeft, windowRight);
     },
 
     __proto__: WebInspector.HeapSnapshotItemProvider.prototype
 }