OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 12 matching lines...) Expand all Loading... |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 /** | 31 /** |
32 * @constructor | 32 * @constructor |
| 33 * @extends {WebInspector.HeapSnapshot} |
| 34 * @param {!Object} profile |
33 * @param {!WebInspector.HeapSnapshotProgress} progress | 35 * @param {!WebInspector.HeapSnapshotProgress} progress |
34 * @param {boolean} showHiddenData | 36 * @param {boolean} showHiddenData |
35 * @extends {WebInspector.HeapSnapshot} | |
36 */ | 37 */ |
37 WebInspector.JSHeapSnapshot = function(profile, progress, showHiddenData) | 38 WebInspector.JSHeapSnapshot = function(profile, progress, showHiddenData) |
38 { | 39 { |
39 this._nodeFlags = { // bit flags | 40 this._nodeFlags = { // bit flags |
40 canBeQueried: 1, | 41 canBeQueried: 1, |
41 detachedDOMTreeNode: 2, | 42 detachedDOMTreeNode: 2, |
42 pageObject: 4, // The idea is to track separately the objects owned by t
he page and the objects owned by debugger. | 43 pageObject: 4, // The idea is to track separately the objects owned by t
he page and the objects owned by debugger. |
43 | 44 |
44 visitedMarkerMask: 0x0ffff, // bits: 0,1111,1111,1111,1111 | 45 visitedMarkerMask: 0x0ffff, // bits: 0,1111,1111,1111,1111 |
45 visitedMarker: 0x10000 // bits: 1,0000,0000,0000,0000 | 46 visitedMarker: 0x10000 // bits: 1,0000,0000,0000,0000 |
(...skipping 768 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
814 * @return {boolean} | 815 * @return {boolean} |
815 */ | 816 */ |
816 isWeak: function() | 817 isWeak: function() |
817 { | 818 { |
818 return this._edge().isWeak(); | 819 return this._edge().isWeak(); |
819 }, | 820 }, |
820 | 821 |
821 __proto__: WebInspector.HeapSnapshotRetainerEdge.prototype | 822 __proto__: WebInspector.HeapSnapshotRetainerEdge.prototype |
822 } | 823 } |
823 | 824 |
OLD | NEW |