Home
last modified time | relevance | path

Searched refs:edge_name (Results 1 - 8 of 8) sorted by relevance

/third_party/node/src/
H A Dmemory_tracker-inl.h11 // Fallback edge_name if node_name is not available, or "" if edge_name
13 inline const char* GetNodeName(const char* node_name, const char* edge_name) { in GetNodeName() argument
17 if (edge_name != nullptr) { in GetNodeName()
18 return edge_name; in GetNodeName()
85 void MemoryTracker::TrackFieldWithSize(const char* edge_name, in TrackFieldWithSize() argument
88 if (size > 0) AddNode(GetNodeName(node_name, edge_name), size, edge_name); in TrackFieldWithSize() local
91 void MemoryTracker::TrackInlineFieldWithSize(const char* edge_name, in TrackInlineFieldWithSize() argument
94 if (size > 0) AddNode(GetNodeName(node_name, edge_name), siz in TrackInlineFieldWithSize() local
99 TrackField(const char* edge_name, const MemoryRetainer& value, const char* node_name) TrackField() argument
105 TrackField(const char* edge_name, const MemoryRetainer* value, const char* node_name) TrackField() argument
111 graph_->AddEdge(CurrentNode(), it->second, edge_name); TrackField() local
118 TrackField(const char* edge_name, const std::unique_ptr<T, D>& value, const char* node_name) TrackField() argument
128 TrackField(const char* edge_name, const std::shared_ptr<T>& value, const char* node_name) TrackField() argument
138 TrackField(const char* edge_name, const BaseObjectPtrImpl<T, kIsWeak>& value, const char* node_name) TrackField() argument
146 TrackField(const char* edge_name, const T& value, const char* node_name, const char* element_name, bool subtract_from_self) TrackField() argument
159 PushNode(GetNodeName(node_name, edge_name), sizeof(T), edge_name); TrackField() local
168 TrackField(const char* edge_name, const std::queue<T>& value, const char* node_name, const char* element_name) TrackField() argument
184 TrackField(const char* edge_name, const T& value, const char* node_name) TrackField() argument
192 TrackField(const char* edge_name, const std::pair<T, U>& value, const char* node_name) TrackField() argument
207 TrackField(const char* edge_name, const std::basic_string<T>& value, const char* node_name) TrackField() argument
214 TrackField(const char* edge_name, const v8::Eternal<T>& value, const char* node_name) TrackField() argument
221 TrackField(const char* edge_name, const v8::PersistentBase<T>& value, const char* node_name) TrackField() argument
229 TrackField(const char* edge_name, const v8::Local<T>& value, const char* node_name) TrackField() argument
233 graph_->AddEdge(CurrentNode(), graph_->V8Node(value), edge_name); TrackField() local
237 TrackField(const char* edge_name, const MallocedBuffer<T>& value, const char* node_name) TrackField() argument
243 TrackField(const char* edge_name, const v8::BackingStore* value, const char* node_name) TrackField() argument
273 Track(const MemoryRetainer* retainer, const char* edge_name) Track() argument
279 graph_->AddEdge(CurrentNode(), it->second, edge_name); Track() local
290 TrackInlineField(const MemoryRetainer* retainer, const char* edge_name) TrackInlineField() argument
302 AddNode(const MemoryRetainer* retainer, const char* edge_name) AddNode() argument
312 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); AddNode() local
322 AddNode(const char* node_name, size_t size, const char* edge_name) AddNode() argument
328 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); AddNode() local
333 PushNode(const MemoryRetainer* retainer, const char* edge_name) PushNode() argument
340 PushNode(const char* node_name, size_t size, const char* edge_name) PushNode() argument
[all...]
H A Dmemory_tracker.h144 inline void TrackFieldWithSize(const char* edge_name,
147 inline void TrackInlineFieldWithSize(const char* edge_name,
153 inline void TrackField(const char* edge_name,
158 inline void TrackField(const char* edge_name,
163 void TrackField(const char* edge_name,
174 inline void TrackField(const char* edge_name,
180 inline void TrackField(const char* edge_name,
185 inline void TrackField(const char* edge_name,
192 inline void TrackField(const char* edge_name,
195 inline void TrackField(const char* edge_name,
[all...]
H A Dheap_utils.cc183 const char* edge_name = edge.first; in CreateObject() local
184 if (edge_name != nullptr) { in CreateObject()
185 if (!String::NewFromUtf8(isolate_, edge_name) in CreateObject()
/third_party/node/test/pummel/
H A Dtest-heapdump-inspector.js12 { node_name: 'Node / InspectorSession', edge_name: 'session' },
32 { node_name: 'Node / InspectorSession', edge_name: 'session' },
33 { node_name: 'Connection', edge_name: 'native_to_javascript' },
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc68 const char* InternalizeEdgeName(std::string edge_name) { in InternalizeEdgeName() argument
69 const size_t edge_name_len = edge_name.length(); in InternalizeEdgeName()
72 snprintf(named_edge_str, edge_name_len + 1, "%s", edge_name.c_str()); in InternalizeEdgeName()
442 const std::string& edge_name) { in AddEdge()
456 if (!edge_name.empty()) { in AddEdge()
458 parent.get_node()->InternalizeEdgeName(edge_name)); in AddEdge()
465 const std::string& edge_name) { in AddEdge()
474 if (!edge_name.empty()) { in AddEdge()
476 parent.get_node()->InternalizeEdgeName(edge_name)); in AddEdge()
486 if (!ref.WrapperClassId() || !edge_name in AddEdge()
441 AddEdge(State& parent, const HeapObjectHeader& header, const std::string& edge_name) AddEdge() argument
464 AddEdge(State& parent, const TracedReferenceBase& ref, const std::string& edge_name) AddEdge() argument
519 AddRootEdge(RootState& root, State& child, std::string edge_name) AddRootEdge() argument
712 set_edge_name(std::string edge_name) set_edge_name() argument
[all...]
/third_party/node/test/common/
H A Dheap.js91 function isEdge(edge, { node_name, edge_name }) {
92 if (edge_name !== undefined && edge.name !== edge_name) {
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator.cc308 void HeapEntry::Print(const char* prefix, const char* edge_name, int max_depth, in Print() argument
312 prefix, edge_name); in Print()
332 edge_name = index.begin(); in Print()
336 edge_name = edge.name(); in Print()
343 edge_name = edge.name(); in Print()
346 edge_name = edge.name(); in Print()
354 edge_name = edge.name(); in Print()
358 edge_name = edge.name(); in Print()
363 edge.to()->Print(edge_prefix, edge_name, max_depth, indent + 2); in Print()
1270 const char* edge_name in ExtractEphemeronHashTableReferences() local
[all...]
H A Dheap-snapshot-generator.h183 V8_EXPORT_PRIVATE void Print(const char* prefix, const char* edge_name,

Completed in 10 milliseconds