| 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 { |
| (...skipping 25 matching lines...) Expand all Loading... |
| 36 | 36 |
| 37 HeapGraphEdge** HeapEntry::children_arr() { | 37 HeapGraphEdge** HeapEntry::children_arr() { |
| 38 DCHECK(children_index_ >= 0); | 38 DCHECK(children_index_ >= 0); |
| 39 SLOW_DCHECK(children_index_ < snapshot_->children().length() || | 39 SLOW_DCHECK(children_index_ < snapshot_->children().length() || |
| 40 (children_index_ == snapshot_->children().length() && | 40 (children_index_ == snapshot_->children().length() && |
| 41 children_count_ == 0)); | 41 children_count_ == 0)); |
| 42 return &snapshot_->children().first() + children_index_; | 42 return &snapshot_->children().first() + children_index_; |
| 43 } | 43 } |
| 44 | 44 |
| 45 | 45 |
| 46 } } // namespace v8::internal | 46 } // namespace internal |
| 47 } // namespace v8 |
| 47 | 48 |
| 48 #endif // V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ | 49 #endif // V8_PROFILER_HEAP_SNAPSHOT_GENERATOR_INL_H_ |
| OLD | NEW |