2013-02-21 12:10:40 +00:00
|
|
|
// Copyright 2013 the V8 project authors. All rights reserved.
|
2014-04-29 06:42:26 +00:00
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
2013-02-21 12:10:40 +00:00
|
|
|
|
|
|
|
#ifndef V8_HEAP_SNAPSHOT_GENERATOR_INL_H_
|
|
|
|
#define V8_HEAP_SNAPSHOT_GENERATOR_INL_H_
|
|
|
|
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "src/heap-snapshot-generator.h"
|
2013-02-21 12:10:40 +00:00
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
|
|
|
|
HeapEntry* HeapGraphEdge::from() const {
|
|
|
|
return &snapshot()->entries()[from_index_];
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
HeapSnapshot* HeapGraphEdge::snapshot() const {
|
|
|
|
return to_entry_->snapshot();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int HeapEntry::index() const {
|
|
|
|
return static_cast<int>(this - &snapshot_->entries().first());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int HeapEntry::set_children_index(int index) {
|
|
|
|
children_index_ = index;
|
|
|
|
int next_index = index + children_count_;
|
|
|
|
children_count_ = 0;
|
|
|
|
return next_index;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
HeapGraphEdge** HeapEntry::children_arr() {
|
2014-08-04 11:34:54 +00:00
|
|
|
DCHECK(children_index_ >= 0);
|
|
|
|
SLOW_DCHECK(children_index_ < snapshot_->children().length() ||
|
2013-12-20 07:33:22 +00:00
|
|
|
(children_index_ == snapshot_->children().length() &&
|
|
|
|
children_count_ == 0));
|
|
|
|
return &snapshot_->children().first() + children_index_;
|
2013-02-21 12:10:40 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
} } // namespace v8::internal
|
|
|
|
|
|
|
|
#endif // V8_HEAP_SNAPSHOT_GENERATOR_INL_H_
|