| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 120 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 131 return Vector<HeapGraphEdge*>(children_arr(), children_count_); } | 131 return Vector<HeapGraphEdge*>(children_arr(), children_count_); } |
| 132 | 132 |
| 133 void SetIndexedReference( | 133 void SetIndexedReference( |
| 134 HeapGraphEdge::Type type, int index, HeapEntry* entry); | 134 HeapGraphEdge::Type type, int index, HeapEntry* entry); |
| 135 void SetNamedReference( | 135 void SetNamedReference( |
| 136 HeapGraphEdge::Type type, const char* name, HeapEntry* entry); | 136 HeapGraphEdge::Type type, const char* name, HeapEntry* entry); |
| 137 | 137 |
| 138 void Print( | 138 void Print( |
| 139 const char* prefix, const char* edge_name, int max_depth, int indent); | 139 const char* prefix, const char* edge_name, int max_depth, int indent); |
| 140 | 140 |
| 141 Handle<HeapObject> GetHeapObject(); | |
| 142 | |
| 143 private: | 141 private: |
| 144 INLINE(HeapGraphEdge** children_arr()); | 142 INLINE(HeapGraphEdge** children_arr()); |
| 145 const char* TypeAsString(); | 143 const char* TypeAsString(); |
| 146 | 144 |
| 147 unsigned type_: 4; | 145 unsigned type_: 4; |
| 148 int children_count_: 28; | 146 int children_count_: 28; |
| 149 int children_index_; | 147 int children_index_; |
| 150 int self_size_; | 148 int self_size_; |
| 151 SnapshotObjectId id_; | 149 SnapshotObjectId id_; |
| 152 HeapSnapshot* snapshot_; | 150 HeapSnapshot* snapshot_; |
| (...skipping 483 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 636 friend class HeapSnapshotJSONSerializerEnumerator; | 634 friend class HeapSnapshotJSONSerializerEnumerator; |
| 637 friend class HeapSnapshotJSONSerializerIterator; | 635 friend class HeapSnapshotJSONSerializerIterator; |
| 638 | 636 |
| 639 DISALLOW_COPY_AND_ASSIGN(HeapSnapshotJSONSerializer); | 637 DISALLOW_COPY_AND_ASSIGN(HeapSnapshotJSONSerializer); |
| 640 }; | 638 }; |
| 641 | 639 |
| 642 | 640 |
| 643 } } // namespace v8::internal | 641 } } // namespace v8::internal |
| 644 | 642 |
| 645 #endif // V8_HEAP_SNAPSHOT_GENERATOR_H_ | 643 #endif // V8_HEAP_SNAPSHOT_GENERATOR_H_ |
| OLD | NEW |