384       auto &Top = TS.back();  in accountRecord()  local
385       auto I = find_if(Top.first->Callees,  in accountRecord()
387       if (I == Top.first->Callees.end()) {  in accountRecord()
390         auto N = createTrieNode(R.TId, R.FuncId, Top.first);  in accountRecord()
391         Top.first->Callees.emplace_back(N);  in accountRecord()
449   void printStack(raw_ostream &OS, const StackTrieNode *Top,  in printStack()  argument
454     for (auto *F = Top; F != nullptr; F = F->Parent)  in printStack()
570         auto *Top = S.pop_back_val();  in printAll()  local
571         printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top);  in printAll()
572         for (const auto *C : Top->Callees)  in printAll()
623         auto *Top = S.pop_back_val();  in print()  local
627         if (!Top->ExtraData.TerminalDurations.empty()) {  in print()
630               std::accumulate(Top->ExtraData.TerminalDurations.begin(),  in print()
631                               Top->ExtraData.TerminalDurations.end(), 0uLL);  in print()
633             auto E = std::make_pair(Top, TopSum);  in print()
641                 std::make_pair(Top, Top->ExtraData.TerminalDurations.size());  in print()
648         for (const auto *C : Top->Callees)  in print()