Searched refs:path_to_child (Results 1 – 2 of 2) sorted by relevance
205 for (const auto& path_to_child : *global_root->children()) { in ComputeSharedFootprintFromGraph()207 Node* global_node = path_to_child.second; in ComputeSharedFootprintFromGraph()359 for (const auto& path_to_child : *node->children()) { in MarkImplicitWeakParentsRecursively()360 MarkImplicitWeakParentsRecursively(path_to_child.second); in MarkImplicitWeakParentsRecursively()361 all_children_weak = all_children_weak && path_to_child.second->is_weak(); in MarkImplicitWeakParentsRecursively()400 for (const auto& path_to_child : *node->children()) { in MarkWeakOwnersAndChildrenRecursively()401 MarkWeakOwnersAndChildrenRecursively(path_to_child.second, visited); in MarkWeakOwnersAndChildrenRecursively()474 for (auto& path_to_child : *node->children()) { in AggregateNumericWithNameForNode()475 auto* entries = path_to_child.second->entries(); in AggregateNumericWithNameForNode()504 for (const auto& path_to_child : *node->children()) { in AggregateNumericsRecursively()[all …]
730 def _search_for_child_node(self, parent_id, path_to_child): argument752 if not path_to_child:756 if child.local_name == path_to_child[0]:757 return self._search_for_child_node(child.node_id, path_to_child[1:])