| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 1167 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1178 } | 1178 } |
| 1179 | 1179 |
| 1180 | 1180 |
| 1181 void HeapSnapshot::ClearPaint() { | 1181 void HeapSnapshot::ClearPaint() { |
| 1182 entries_.Iterate(HeapEntryClearPaint); | 1182 entries_.Iterate(HeapEntryClearPaint); |
| 1183 } | 1183 } |
| 1184 | 1184 |
| 1185 | 1185 |
| 1186 HeapEntry* HeapSnapshot::AddRootEntry(int children_count) { | 1186 HeapEntry* HeapSnapshot::AddRootEntry(int children_count) { |
| 1187 ASSERT(root_entry_ == NULL); | 1187 ASSERT(root_entry_ == NULL); |
| 1188 ASSERT(entries_.is_empty()); // Root entry must be the first one. | 1188 ASSERT(entries_.is_empty()); // Root entry must be the first one. |
| 1189 return (root_entry_ = AddEntry(HeapEntry::kObject, | 1189 return (root_entry_ = AddEntry(HeapEntry::kObject, |
| 1190 "", | 1190 "", |
| 1191 HeapObjectsMap::kInternalRootObjectId, | 1191 HeapObjectsMap::kInternalRootObjectId, |
| 1192 0, | 1192 0, |
| 1193 children_count, | 1193 children_count, |
| 1194 0)); | 1194 0)); |
| 1195 } | 1195 } |
| 1196 | 1196 |
| 1197 | 1197 |
| 1198 HeapEntry* HeapSnapshot::AddGcRootsEntry(int children_count, | 1198 HeapEntry* HeapSnapshot::AddGcRootsEntry(int children_count, |
| (...skipping 2557 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3756 | 3756 |
| 3757 | 3757 |
| 3758 void HeapSnapshotJSONSerializer::SortHashMap( | 3758 void HeapSnapshotJSONSerializer::SortHashMap( |
| 3759 HashMap* map, List<HashMap::Entry*>* sorted_entries) { | 3759 HashMap* map, List<HashMap::Entry*>* sorted_entries) { |
| 3760 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) | 3760 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) |
| 3761 sorted_entries->Add(p); | 3761 sorted_entries->Add(p); |
| 3762 sorted_entries->Sort(SortUsingEntryValue); | 3762 sorted_entries->Sort(SortUsingEntryValue); |
| 3763 } | 3763 } |
| 3764 | 3764 |
| 3765 } } // namespace v8::internal | 3765 } } // namespace v8::internal |
| OLD | NEW |