Lines Matching refs:children
383 return node->children()->at(child_idx_);
386 return child_idx_ < node->children()->length();
995 Vector<HeapGraphEdge> children = entry->children();
996 for (int i = 0; i < children.length(); ++i) {
997 if (children[i].type() == HeapGraphEdge::kShortcut) continue;
998 HeapEntry* child = children[i].to();
1037 Vector<HeapGraphEdge> ch = children();
1126 Vector<HeapGraphEdge> children = curr->children();
1127 for (int i = 0; i < children.length(); ++i) {
1128 if (children[i].type() == HeapGraphEdge::kShortcut) continue;
1129 HeapEntry* child = children[i].to();
2605 Vector<HeapGraphEdge> children = entry->children();
2607 for (int i = 0; i < children.length(); ++i) {
2608 if (children[i].type() == HeapGraphEdge::kShortcut) continue;
2609 HeapEntry* child = children[i].to();
2700 // children, to sum up total sizes we "bubble" node's self size
2897 Vector<HeapGraphEdge> children = entry->children();
2899 writer_->AddNumber(children.length());
2900 for (int i = 0; i < children.length(); ++i) {
2901 SerializeEdge(&children[i]);
2923 "," JSON_S("children"))
2974 prev_heap_entry->children().length() * edge_fields_count;
