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 1991 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2002 | 2002 |
2003 | 2003 |
2004 void V8HeapExplorer::ExtractMapReferences(int entry, Map* map) { | 2004 void V8HeapExplorer::ExtractMapReferences(int entry, Map* map) { |
2005 SetInternalReference(map, entry, | 2005 SetInternalReference(map, entry, |
2006 "prototype", map->prototype(), Map::kPrototypeOffset); | 2006 "prototype", map->prototype(), Map::kPrototypeOffset); |
2007 SetInternalReference(map, entry, | 2007 SetInternalReference(map, entry, |
2008 "constructor", map->constructor(), | 2008 "constructor", map->constructor(), |
2009 Map::kConstructorOffset); | 2009 Map::kConstructorOffset); |
2010 if (map->HasTransitionArray()) { | 2010 if (map->HasTransitionArray()) { |
2011 TransitionArray* transitions = map->transitions(); | 2011 TransitionArray* transitions = map->transitions(); |
2012 JSGlobalPropertyCell* pointer = transitions->descriptors_pointer(); | |
2013 DescriptorArray* descriptors = transitions->descriptors(); | 2012 DescriptorArray* descriptors = transitions->descriptors(); |
2014 TagObject(descriptors, "(map descriptors)"); | 2013 TagObject(descriptors, "(map descriptors)"); |
2015 SetInternalReference(pointer, entry, | 2014 SetInternalReference(transitions, entry, |
2016 "descriptors", descriptors, | 2015 "descriptors", descriptors, |
2017 JSGlobalPropertyCell::kValueOffset); | 2016 TransitionArray::kDescriptorsOffset); |
2018 IndexedReferencesExtractor pointer_refs(this, pointer, entry); | |
2019 pointer->Iterate(&pointer_refs); | |
2020 | 2017 |
2021 Object* back_pointer = transitions->back_pointer_storage(); | 2018 Object* back_pointer = transitions->back_pointer_storage(); |
2022 TagObject(transitions->back_pointer_storage(), "(back pointer)"); | 2019 TagObject(transitions->back_pointer_storage(), "(back pointer)"); |
2023 SetInternalReference(transitions, entry, | 2020 SetInternalReference(transitions, entry, |
2024 "backpointer", back_pointer, | 2021 "backpointer", back_pointer, |
2025 TransitionArray::kBackPointerStorageOffset); | 2022 TransitionArray::kBackPointerStorageOffset); |
2026 IndexedReferencesExtractor transitions_refs(this, transitions, entry); | 2023 IndexedReferencesExtractor transitions_refs(this, transitions, entry); |
2027 transitions->Iterate(&transitions_refs); | 2024 transitions->Iterate(&transitions_refs); |
2028 | 2025 |
2029 TagObject(transitions, "(transition array)"); | 2026 TagObject(transitions, "(transition array)"); |
(...skipping 1551 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3581 | 3578 |
3582 | 3579 |
3583 void HeapSnapshotJSONSerializer::SortHashMap( | 3580 void HeapSnapshotJSONSerializer::SortHashMap( |
3584 HashMap* map, List<HashMap::Entry*>* sorted_entries) { | 3581 HashMap* map, List<HashMap::Entry*>* sorted_entries) { |
3585 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) | 3582 for (HashMap::Entry* p = map->Start(); p != NULL; p = map->Next(p)) |
3586 sorted_entries->Add(p); | 3583 sorted_entries->Add(p); |
3587 sorted_entries->Sort(SortUsingEntryValue); | 3584 sorted_entries->Sort(SortUsingEntryValue); |
3588 } | 3585 } |
3589 | 3586 |
3590 } } // namespace v8::internal | 3587 } } // namespace v8::internal |
OLD | NEW |