blob: ad95776cbe544e2c37abf6c0c5fd7f6d768d6ed1 [file] [log] [blame]
Ben Murdochb8a8cc12014-11-26 15:28:44 +00001// 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
3// found in the LICENSE file.
4
5#ifndef V8_HEAP_SNAPSHOT_GENERATOR_INL_H_
6#define V8_HEAP_SNAPSHOT_GENERATOR_INL_H_
7
8#include "src/heap-snapshot-generator.h"
9
10namespace v8 {
11namespace internal {
12
13
14HeapEntry* HeapGraphEdge::from() const {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040015 return &snapshot()->entries()[from_index()];
Ben Murdochb8a8cc12014-11-26 15:28:44 +000016}
17
18
19HeapSnapshot* HeapGraphEdge::snapshot() const {
20 return to_entry_->snapshot();
21}
22
23
24int HeapEntry::index() const {
25 return static_cast<int>(this - &snapshot_->entries().first());
26}
27
28
29int HeapEntry::set_children_index(int index) {
30 children_index_ = index;
31 int next_index = index + children_count_;
32 children_count_ = 0;
33 return next_index;
34}
35
36
37HeapGraphEdge** HeapEntry::children_arr() {
38 DCHECK(children_index_ >= 0);
39 SLOW_DCHECK(children_index_ < snapshot_->children().length() ||
40 (children_index_ == snapshot_->children().length() &&
41 children_count_ == 0));
42 return &snapshot_->children().first() + children_index_;
43}
44
45
46} } // namespace v8::internal
47
48#endif // V8_HEAP_SNAPSHOT_GENERATOR_INL_H_