OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ | 5 #ifndef V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ |
6 #define V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ | 6 #define V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ |
7 | 7 |
8 #include "src/profiler/heap-snapshot-generator.h" | 8 #include "src/profiler/heap-snapshot-generator.h" |
9 | 9 |
10 namespace v8 { | 10 namespace v8 { |
11 namespace internal { | 11 namespace internal { |
12 | 12 |
13 | 13 |
14 HeapEntry* HeapGraphEdge::from() const { | 14 HeapEntry* HeapGraphEdge::from() const { |
15 return &snapshot()->entries()[from_index()]; | 15 return &snapshot()->entries()[from_index()]; |
16 } | 16 } |
17 | 17 |
18 | 18 |
| 19 Isolate* HeapGraphEdge::isolate() const { |
| 20 return snapshot()->profiler()->isolate(); |
| 21 } |
| 22 |
| 23 |
19 HeapSnapshot* HeapGraphEdge::snapshot() const { | 24 HeapSnapshot* HeapGraphEdge::snapshot() const { |
20 return to_entry_->snapshot(); | 25 return to_entry_->snapshot(); |
21 } | 26 } |
22 | 27 |
23 | 28 |
24 int HeapEntry::index() const { | 29 int HeapEntry::index() const { |
25 return static_cast<int>(this - &snapshot_->entries().first()); | 30 return static_cast<int>(this - &snapshot_->entries().first()); |
26 } | 31 } |
27 | 32 |
28 | 33 |
29 int HeapEntry::set_children_index(int index) { | 34 int HeapEntry::set_children_index(int index) { |
30 children_index_ = index; | 35 children_index_ = index; |
31 int next_index = index + children_count_; | 36 int next_index = index + children_count_; |
32 children_count_ = 0; | 37 children_count_ = 0; |
33 return next_index; | 38 return next_index; |
34 } | 39 } |
35 | 40 |
36 | 41 |
37 HeapGraphEdge** HeapEntry::children_arr() { | 42 HeapGraphEdge** HeapEntry::children_arr() { |
38 DCHECK(children_index_ >= 0); | 43 DCHECK(children_index_ >= 0); |
39 SLOW_DCHECK(children_index_ < snapshot_->children().length() || | 44 SLOW_DCHECK(children_index_ < snapshot_->children().length() || |
40 (children_index_ == snapshot_->children().length() && | 45 (children_index_ == snapshot_->children().length() && |
41 children_count_ == 0)); | 46 children_count_ == 0)); |
42 return &snapshot_->children().first() + children_index_; | 47 return &snapshot_->children().first() + children_index_; |
43 } | 48 } |
44 | 49 |
45 | 50 |
| 51 Isolate* HeapEntry::isolate() const { return snapshot_->profiler()->isolate(); } |
| 52 |
46 } // namespace internal | 53 } // namespace internal |
47 } // namespace v8 | 54 } // namespace v8 |
48 | 55 |
49 #endif // V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ | 56 #endif // V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ |
OLD | NEW |