| 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 // DOM events handlers are reported as OTHER / EXTERNAL entries. | 88 // DOM events handlers are reported as OTHER / EXTERNAL entries. |
| 89 // To avoid confusing people, let's put all these entries into | 89 // To avoid confusing people, let's put all these entries into |
| 90 // one bucket. | 90 // one bucket. |
| 91 case OTHER: | 91 case OTHER: |
| 92 case EXTERNAL: | 92 case EXTERNAL: |
| 93 return program_entry_; | 93 return program_entry_; |
| 94 default: return NULL; | 94 default: return NULL; |
| 95 } | 95 } |
| 96 } | 96 } |
| 97 | 97 |
| 98 | |
| 99 HeapEntry* HeapGraphEdge::from() const { | |
| 100 return &snapshot()->entries()[from_index_]; | |
| 101 } | |
| 102 | |
| 103 | |
| 104 HeapSnapshot* HeapGraphEdge::snapshot() const { | |
| 105 return to_entry_->snapshot(); | |
| 106 } | |
| 107 | |
| 108 | |
| 109 int HeapEntry::index() const { | |
| 110 return static_cast<int>(this - &snapshot_->entries().first()); | |
| 111 } | |
| 112 | |
| 113 | |
| 114 int HeapEntry::set_children_index(int index) { | |
| 115 children_index_ = index; | |
| 116 int next_index = index + children_count_; | |
| 117 children_count_ = 0; | |
| 118 return next_index; | |
| 119 } | |
| 120 | |
| 121 | |
| 122 HeapGraphEdge** HeapEntry::children_arr() { | |
| 123 ASSERT(children_index_ >= 0); | |
| 124 return &snapshot_->children()[children_index_]; | |
| 125 } | |
| 126 | |
| 127 | |
| 128 SnapshotObjectId HeapObjectsMap::GetNthGcSubrootId(int delta) { | |
| 129 return kGcRootsFirstSubrootId + delta * kObjectIdStep; | |
| 130 } | |
| 131 | |
| 132 | |
| 133 HeapObject* V8HeapExplorer::GetNthGcSubrootObject(int delta) { | |
| 134 return reinterpret_cast<HeapObject*>( | |
| 135 reinterpret_cast<char*>(kFirstGcSubrootObject) + | |
| 136 delta * HeapObjectsMap::kObjectIdStep); | |
| 137 } | |
| 138 | |
| 139 | |
| 140 int V8HeapExplorer::GetGcSubrootOrder(HeapObject* subroot) { | |
| 141 return static_cast<int>( | |
| 142 (reinterpret_cast<char*>(subroot) - | |
| 143 reinterpret_cast<char*>(kFirstGcSubrootObject)) / | |
| 144 HeapObjectsMap::kObjectIdStep); | |
| 145 } | |
| 146 | |
| 147 } } // namespace v8::internal | 98 } } // namespace v8::internal |
| 148 | 99 |
| 149 #endif // V8_PROFILE_GENERATOR_INL_H_ | 100 #endif // V8_PROFILE_GENERATOR_INL_H_ |
| OLD | NEW |