40   typedef CallChainNode<EntryT> NodeT;  typedef
45   std::vector<std::unique_ptr<NodeT>> children;
53     NodeT* p = FindMatchingNode(children, callchain[0], is_same_sample);  in AddCallChain()
55       std::unique_ptr<NodeT> new_node = AllocateNode(callchain, 0, period, 0);  in AddCallChain()
76         NodeT* np = FindMatchingNode(p->children, callchain[callchain_pos],  in AddCallChain()
83       std::unique_ptr<NodeT> new_node =  in AddCallChain()
91     std::queue<std::vector<std::unique_ptr<NodeT>>*> queue;  in SortByPeriod()
94       std::vector<std::unique_ptr<NodeT>>* v = queue.front();  in SortByPeriod()
106   NodeT* FindMatchingNode(  in FindMatchingNode()
107       const std::vector<std::unique_ptr<NodeT>>& nodes, const EntryT* sample,  in FindMatchingNode()
118       NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start,  in GetMatchingLengthInNode()
130   void SplitNode(NodeT* parent, size_t parent_length) {  in SplitNode()
131     std::unique_ptr<NodeT> child = AllocateNode(  in SplitNode()
141   std::unique_ptr<NodeT> AllocateNode(const std::vector<EntryT*>& chain,  in AllocateNode()
144     std::unique_ptr<NodeT> node(new NodeT);  in AllocateNode()
153   static bool CompareNodeByPeriod(const std::unique_ptr<NodeT>& n1,  in CompareNodeByPeriod()
154                                   const std::unique_ptr<NodeT>& n2) {  in CompareNodeByPeriod()