Lines Matching refs:HeapGraphEdge
58 class HeapGraphEdge {
61 kContextVariable = v8::HeapGraphEdge::kContextVariable,
62 kElement = v8::HeapGraphEdge::kElement,
63 kProperty = v8::HeapGraphEdge::kProperty,
64 kInternal = v8::HeapGraphEdge::kInternal,
65 kHidden = v8::HeapGraphEdge::kHidden,
66 kShortcut = v8::HeapGraphEdge::kShortcut,
67 kWeak = v8::HeapGraphEdge::kWeak
70 HeapGraphEdge(Type type, const char* name, HeapEntry* from, HeapEntry* to);
71 HeapGraphEdge(Type type, int index, HeapEntry* from, HeapEntry* to);
139 V8_INLINE void add_child(HeapGraphEdge* edge);
140 V8_INLINE HeapGraphEdge* child(int i);
161 void VerifyReference(HeapGraphEdge::Type type, HeapEntry* entry,
164 void SetIndexedReference(HeapGraphEdge::Type type, int index,
167 void SetNamedReference(HeapGraphEdge::Type type, const char* name,
171 HeapGraphEdge::Type type, HeapEntry* child,
177 void SetNamedAutoIndexReference(HeapGraphEdge::Type type,
187 V8_INLINE std::vector<HeapGraphEdge*>::iterator children_begin() const;
188 V8_INLINE std::vector<HeapGraphEdge*>::iterator children_end() const;
233 std::deque<HeapGraphEdge>& edges() { return edges_; }
234 const std::deque<HeapGraphEdge>& edges() const { return edges_; }
235 std::vector<HeapGraphEdge*>& children() { return children_; }
272 std::deque<HeapGraphEdge> edges_;
273 std::vector<HeapGraphEdge*> children_;
675 void SerializeEdge(HeapGraphEdge* edge, bool first_edge);