Lines Matching defs:node
111 static const v8::HeapGraphNode* GetProperty(const v8::HeapGraphNode* node,
114 for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
115 const v8::HeapGraphEdge* prop = node->GetChild(i);
124 static bool HasString(const v8::HeapGraphNode* node, const char* contents) {
125 for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
126 const v8::HeapGraphEdge* prop = node->GetChild(i);
127 const v8::HeapGraphNode* node = prop->GetToNode();
128 if (node->GetType() == v8::HeapGraphNode::kString) {
129 v8::String::Utf8Value node_name(node->GetName());
362 const v8::HeapGraphNode* node = prop->GetToNode();
363 if (node->GetType() == v8::HeapGraphNode::kArray) {
364 if (HasString(node, "x")) {
372 const v8::HeapGraphNode* node = prop->GetToNode();
373 if (node->GetType() == v8::HeapGraphNode::kArray) {
374 if (HasString(node, "x")) {
851 // Get node and edge "member" offsets.
1185 const v8::HeapGraphNode* node,
1188 CHECK_EQ(node, snapshot->GetNodeById(node->GetId()));
1189 for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
1190 const v8::HeapGraphEdge* prop = node->GetChild(i);
1248 const v8::HeapGraphNode* node =
1250 CHECK_EQ(NULL, node);
1376 const v8::HeapGraphNode* node = parent->GetChild(i)->GetToNode();
1377 if (node->GetType() == type && strcmp(name,
1379 reinterpret_cast<const i::HeapEntry*>(node))->name()) == 0) {
1380 return node;
1906 bool HasWeakEdge(const v8::HeapGraphNode* node) {
1907 for (int i = 0; i < node->GetChildrenCount(); ++i) {
1908 const v8::HeapGraphEdge* handle_edge = node->GetChild(i);
2193 const v8::HeapGraphNode* node = snapshot->GetRoot();
2195 int i, count = node->GetChildrenCount();
2197 const v8::HeapGraphEdge* edge = node->GetChild(i);
2204 node = to_node;
2210 node;
2229 const v8::HeapGraphNode* node = GetNodeByPath(snapshot,
2231 CHECK_NE(NULL, node);
2238 node = GetNodeByPath(snapshot, builtin_path1, ARRAY_SIZE(builtin_path1));
2239 CHECK_NE(NULL, node);
2246 node = GetNodeByPath(snapshot, builtin_path2, ARRAY_SIZE(builtin_path2));
2247 CHECK_NE(NULL, node);
2248 v8::String::Utf8Value node_name(node->GetName());
2297 AllocationTraceNode* node = tracker->trace_tree()->root();
2298 for (int i = 0; node != NULL && i < names.length(); i++) {
2300 Vector<AllocationTraceNode*> children = node->children();
2301 node = NULL;
2307 node = children[j];
2312 return node;
2338 AllocationTraceNode* node =
2340 CHECK_NE(NULL, node);
2341 CHECK_GE(node->allocation_count(), 2);
2342 CHECK_GE(node->allocation_size(), 4 * 5);
2366 AllocationTraceNode* node =
2368 CHECK_NE(NULL, node);
2369 CHECK_GE(node->allocation_count(), 100);
2370 CHECK_GE(node->allocation_size(), 4 * node->allocation_count());
2415 AllocationTraceNode* node =
2417 CHECK_NE(NULL, node);
2418 CHECK_GE(node->allocation_count(), 100);
2419 CHECK_GE(node->allocation_size(), 4 * node->allocation_count());
2441 AllocationTraceNode* node =
2443 CHECK_NE(NULL, node);
2444 CHECK_LT(node->allocation_count(), 100);
2471 AllocationTraceNode* node =
2473 CHECK_NE(NULL, node);
2474 CHECK_GE(node->allocation_count(), 2);
2475 CHECK_GE(node->allocation_size(), 4 * node->allocation_count());
2506 const v8::HeapGraphNode* node) {
2511 if (parent->GetChild(j)->GetToNode() == node) {
