Lines Matching refs:children
390 return node->children()->at(child_idx_);
393 return child_idx_ < node->children()->length();
990 children()[child_index].Init(child_index, type, name, entry);
1000 children()[child_index].Init(child_index, type, index, entry);
1007 children()[child_index].Init(child_index, index, entry);
1036 Vector<HeapGraphEdge> ch = children();
2767 Object*** children = group->children_;
2769 Object* child = *children[j];
3175 Vector<HeapGraphEdge> children = entry->children();
3177 for (int i = 0; i < children.length(); ++i) {
3178 if (children[i].type() == HeapGraphEdge::kShortcut) continue;
3179 HeapEntry* child = children[i].to();
3222 // Mark the root direct children as affected.
3223 Vector<HeapGraphEdge> children = entries[root_index]->children();
3224 for (int i = 0; i < children.length(); ++i) {
3225 affected[children[i].to()->ordered_index()] = true;
3256 Vector<HeapGraphEdge> children = entries[i]->children();
3257 for (int j = 0; j < children.length(); ++j) {
3258 affected[children[j].to()->ordered_index()] = true;
3283 // children, to sum up total sizes we "bubble" node's self size
3532 Vector<HeapGraphEdge> children = entry->children();
3539 STATIC_CHECK(sizeof(int) == sizeof(children.length())); // NOLINT
3547 children.length());
3551 for (int i = 0; i < children.length(); ++i) {
3552 SerializeEdge(&children[i]);
3574 "," JSON_S("children"))
3627 prev_heap_entry->children().length() * edge_fields_count;
