37   std::vector<std::unique_ptr<CallChainNode>> children;  member
47   std::vector<std::unique_ptr<NodeT>> children;  member
54     NodeT* p = FindMatchingNode(children, callchain[0], is_same_sample);  in AddCallChain()
57       children.push_back(std::move(new_node));  in AddCallChain()
76         NodeT* np = FindMatchingNode(p->children, callchain[callchain_pos], is_same_sample);  in AddCallChain()
83       p->children.push_back(std::move(new_node));  in AddCallChain()
90     queue.push(&children);  in SortByPeriod()
96         if (!node->children.empty()) {  in SortByPeriod()
97           queue.push(&node->children);  in SortByPeriod()
128     child->children = std::move(parent->children);  in SplitNode()
132     parent->children.clear();  in SplitNode()
133     parent->children.push_back(std::move(child));  in SplitNode()