35   std::vector<std::unique_ptr<CallChainNode>> children;  member
45   std::vector<std::unique_ptr<NodeT>> children;  member
53     NodeT* p = FindMatchingNode(children, callchain[0], is_same_sample);  in AddCallChain()
56       children.push_back(std::move(new_node));  in AddCallChain()
76         NodeT* np = FindMatchingNode(p->children, callchain[callchain_pos],  in AddCallChain()
85       p->children.push_back(std::move(new_node));  in AddCallChain()
92     queue.push(&children);  in SortByPeriod()
98         if (!node->children.empty()) {  in SortByPeriod()
99           queue.push(&node->children);  in SortByPeriod()
133     child->children = std::move(parent->children);  in SplitNode()
137     parent->children.clear();  in SplitNode()
138     parent->children.push_back(std::move(child));  in SplitNode()