1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
|
#ifndef SRC_MEMORY_TRACKER_INL_H_
#define SRC_MEMORY_TRACKER_INL_H_
#if defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS
#include "memory_tracker.h"
namespace node {
// Fallback edge_name if node_name is not available, or "" if edge_name
// is not available either.
inline const char* GetNodeName(const char* node_name, const char* edge_name) {
if (node_name != nullptr) {
return node_name;
}
if (edge_name != nullptr) {
return edge_name;
}
return "";
}
class MemoryRetainerNode : public v8::EmbedderGraph::Node {
public:
inline MemoryRetainerNode(MemoryTracker* tracker,
const MemoryRetainer* retainer)
: retainer_(retainer) {
CHECK_NOT_NULL(retainer_);
v8::HandleScope handle_scope(tracker->isolate());
v8::Local<v8::Object> obj = retainer_->WrappedObject();
if (!obj.IsEmpty()) wrapper_node_ = tracker->graph()->V8Node(obj);
name_ = retainer_->MemoryInfoName();
size_ = retainer_->SelfSize();
}
inline MemoryRetainerNode(MemoryTracker* tracker,
const char* name,
size_t size,
bool is_root_node = false)
: retainer_(nullptr) {
name_ = name;
size_ = size;
is_root_node_ = is_root_node;
}
const char* Name() override { return name_.c_str(); }
const char* NamePrefix() override { return "Node /"; }
size_t SizeInBytes() override { return size_; }
// TODO(addaleax): Merging this with the "official" WrapperNode() method
// seems to lose accuracy, e.g. SizeInBytes() is disregarded.
// Figure out whether to do anything about that.
Node* JSWrapperNode() { return wrapper_node_; }
bool IsRootNode() override {
if (retainer_ != nullptr) {
return retainer_->IsRootNode();
}
return is_root_node_;
}
private:
friend class MemoryTracker;
// If retainer_ is not nullptr, then it must have a wrapper_node_,
// and we have
// name_ == retainer_->MemoryInfoName()
// size_ == retainer_->SelfSize()
// is_root_node_ == retainer_->IsRootNode()
const MemoryRetainer* retainer_;
Node* wrapper_node_ = nullptr;
// Otherwise (retainer == nullptr), we set these fields in an ad-hoc way
bool is_root_node_ = false;
std::string name_;
size_t size_ = 0;
};
void MemoryTracker::TrackFieldWithSize(const char* edge_name,
size_t size,
const char* node_name) {
if (size > 0) AddNode(GetNodeName(node_name, edge_name), size, edge_name);
}
void MemoryTracker::TrackField(const char* edge_name,
const MemoryRetainer& value,
const char* node_name) {
TrackField(edge_name, &value);
}
void MemoryTracker::TrackField(const char* edge_name,
const MemoryRetainer* value,
const char* node_name) {
if (value == nullptr) return;
auto it = seen_.find(value);
if (it != seen_.end()) {
graph_->AddEdge(CurrentNode(), it->second, edge_name);
} else {
Track(value, edge_name);
}
}
template <typename T>
void MemoryTracker::TrackField(const char* edge_name,
const std::unique_ptr<T>& value,
const char* node_name) {
if (value.get() == nullptr) {
return;
}
TrackField(edge_name, value.get(), node_name);
}
template <typename T, typename Iterator>
void MemoryTracker::TrackField(const char* edge_name,
const T& value,
const char* node_name,
const char* element_name,
bool subtract_from_self) {
// If the container is empty, the size has been accounted into the parent's
// self size
if (value.begin() == value.end()) return;
// Fall back to edge name if node names are not provided
if (CurrentNode() != nullptr && subtract_from_self) {
// Shift the self size of this container out to a separate node
CurrentNode()->size_ -= sizeof(T);
}
PushNode(GetNodeName(node_name, edge_name), sizeof(T), edge_name);
for (Iterator it = value.begin(); it != value.end(); ++it) {
// Use nullptr as edge names so the elements appear as indexed properties
TrackField(nullptr, *it, element_name);
}
PopNode();
}
template <typename T>
void MemoryTracker::TrackField(const char* edge_name,
const std::queue<T>& value,
const char* node_name,
const char* element_name) {
struct ContainerGetter : public std::queue<T> {
static const typename std::queue<T>::container_type& Get(
const std::queue<T>& value) {
return value.*&ContainerGetter::c;
}
};
const auto& container = ContainerGetter::Get(value);
TrackField(edge_name, container, node_name, element_name);
}
template <typename T, typename test_for_number, typename dummy>
void MemoryTracker::TrackField(const char* edge_name,
const T& value,
const char* node_name) {
// For numbers, creating new nodes is not worth the overhead.
CurrentNode()->size_ += sizeof(T);
}
template <typename T, typename U>
void MemoryTracker::TrackField(const char* edge_name,
const std::pair<T, U>& value,
const char* node_name) {
PushNode(node_name == nullptr ? "pair" : node_name,
sizeof(const std::pair<T, U>),
edge_name);
// TODO(joyeecheung): special case if one of these is a number type
// that meets the test_for_number trait so that their sizes don't get
// merged into the pair node
TrackField("first", value.first);
TrackField("second", value.second);
PopNode();
}
template <typename T>
void MemoryTracker::TrackField(const char* edge_name,
const std::basic_string<T>& value,
const char* node_name) {
TrackFieldWithSize(edge_name, value.size() * sizeof(T), "std::basic_string");
}
template <typename T>
void MemoryTracker::TrackField(const char* edge_name,
const v8::Eternal<T>& value,
const char* node_name) {
TrackField(edge_name, value.Get(isolate_));
}
template <typename T, typename Traits>
void MemoryTracker::TrackField(const char* edge_name,
const v8::Persistent<T, Traits>& value,
const char* node_name) {
TrackField(edge_name, value.Get(isolate_));
}
template <typename T>
void MemoryTracker::TrackField(const char* edge_name,
const v8::Local<T>& value,
const char* node_name) {
if (!value.IsEmpty())
graph_->AddEdge(CurrentNode(), graph_->V8Node(value), edge_name);
}
template <typename T>
void MemoryTracker::TrackField(const char* edge_name,
const MallocedBuffer<T>& value,
const char* node_name) {
TrackFieldWithSize(edge_name, value.size, "MallocedBuffer");
}
void MemoryTracker::TrackField(const char* name,
const uv_buf_t& value,
const char* node_name) {
TrackFieldWithSize(name, value.len, "uv_buf_t");
}
void MemoryTracker::TrackField(const char* name,
const uv_timer_t& value,
const char* node_name) {
TrackFieldWithSize(name, sizeof(value), "uv_timer_t");
}
void MemoryTracker::TrackField(const char* name,
const uv_async_t& value,
const char* node_name) {
TrackFieldWithSize(name, sizeof(value), "uv_async_t");
}
template <class NativeT, class V8T>
void MemoryTracker::TrackField(const char* name,
const AliasedBuffer<NativeT, V8T>& value,
const char* node_name) {
TrackField(name, value.GetJSArray(), "AliasedBuffer");
}
void MemoryTracker::Track(const MemoryRetainer* retainer,
const char* edge_name) {
v8::HandleScope handle_scope(isolate_);
auto it = seen_.find(retainer);
if (it != seen_.end()) {
if (CurrentNode() != nullptr) {
graph_->AddEdge(CurrentNode(), it->second, edge_name);
}
return; // It has already been tracked, no need to call MemoryInfo again
}
MemoryRetainerNode* n = PushNode(retainer, edge_name);
retainer->MemoryInfo(this);
CHECK_EQ(CurrentNode(), n);
CHECK_NE(n->size_, 0);
PopNode();
}
void MemoryTracker::TrackInlineField(const MemoryRetainer* retainer,
const char* edge_name) {
Track(retainer, edge_name);
CHECK(CurrentNode());
CurrentNode()->size_ -= retainer->SelfSize();
}
MemoryRetainerNode* MemoryTracker::CurrentNode() const {
if (node_stack_.empty()) return nullptr;
return node_stack_.top();
}
MemoryRetainerNode* MemoryTracker::AddNode(const MemoryRetainer* retainer,
const char* edge_name) {
auto it = seen_.find(retainer);
if (it != seen_.end()) {
return it->second;
}
MemoryRetainerNode* n = new MemoryRetainerNode(this, retainer);
graph_->AddNode(std::unique_ptr<v8::EmbedderGraph::Node>(n));
seen_[retainer] = n;
if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name);
if (n->JSWrapperNode() != nullptr) {
graph_->AddEdge(n, n->JSWrapperNode(), "wrapped");
graph_->AddEdge(n->JSWrapperNode(), n, "wrapper");
}
return n;
}
MemoryRetainerNode* MemoryTracker::AddNode(const char* node_name,
size_t size,
const char* edge_name) {
MemoryRetainerNode* n = new MemoryRetainerNode(this, node_name, size);
graph_->AddNode(std::unique_ptr<v8::EmbedderGraph::Node>(n));
if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name);
return n;
}
MemoryRetainerNode* MemoryTracker::PushNode(const MemoryRetainer* retainer,
const char* edge_name) {
MemoryRetainerNode* n = AddNode(retainer, edge_name);
node_stack_.push(n);
return n;
}
MemoryRetainerNode* MemoryTracker::PushNode(const char* node_name,
size_t size,
const char* edge_name) {
MemoryRetainerNode* n = AddNode(node_name, size, edge_name);
node_stack_.push(n);
return n;
}
void MemoryTracker::PopNode() {
node_stack_.pop();
}
} // namespace node
#endif // defined(NODE_WANT_INTERNALS) && NODE_WANT_INTERNALS
#endif // SRC_MEMORY_TRACKER_INL_H_
|