| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 266 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 277 uint64_t GetId() const; | 277 uint64_t GetId() const; |
| 278 | 278 |
| 279 /** Returns node's own size, in bytes. */ | 279 /** Returns node's own size, in bytes. */ |
| 280 int GetSelfSize() const; | 280 int GetSelfSize() const; |
| 281 | 281 |
| 282 /** | 282 /** |
| 283 * Returns node's retained size, in bytes. That is, self + sizes of | 283 * Returns node's retained size, in bytes. That is, self + sizes of |
| 284 * the objects that are reachable only from this object. In other | 284 * the objects that are reachable only from this object. In other |
| 285 * words, the size of memory that will be reclaimed having this node | 285 * words, the size of memory that will be reclaimed having this node |
| 286 * collected. | 286 * collected. |
| 287 * | |
| 288 * Exact retained size calculation has O(N) (number of nodes) | |
| 289 * computational complexity, while approximate has O(1). It is | |
| 290 * assumed that initially heap profiling tools provide approximate | |
| 291 * sizes for all nodes, and then exact sizes are calculated for the | |
| 292 * most 'interesting' nodes. | |
| 293 */ | 287 */ |
| 294 int GetRetainedSize(bool exact) const; | 288 int GetRetainedSize() const; |
| 295 | 289 |
| 296 /** Returns child nodes count of the node. */ | 290 /** Returns child nodes count of the node. */ |
| 297 int GetChildrenCount() const; | 291 int GetChildrenCount() const; |
| 298 | 292 |
| 299 /** Retrieves a child by index. */ | 293 /** Retrieves a child by index. */ |
| 300 const HeapGraphEdge* GetChild(int index) const; | 294 const HeapGraphEdge* GetChild(int index) const; |
| 301 | 295 |
| 302 /** Returns retainer nodes count of the node. */ | 296 /** Returns retainer nodes count of the node. */ |
| 303 int GetRetainersCount() const; | 297 int GetRetainersCount() const; |
| 304 | 298 |
| (...skipping 208 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 513 }; | 507 }; |
| 514 | 508 |
| 515 | 509 |
| 516 } // namespace v8 | 510 } // namespace v8 |
| 517 | 511 |
| 518 | 512 |
| 519 #undef V8EXPORT | 513 #undef V8EXPORT |
| 520 | 514 |
| 521 | 515 |
| 522 #endif // V8_V8_PROFILER_H_ | 516 #endif // V8_V8_PROFILER_H_ |
| OLD | NEW |