Lines Matching defs:Top
382 auto &Top = TS.back();
383 auto I = find_if(Top.first->Callees,
385 if (I == Top.first->Callees.end()) {
388 auto N = createTrieNode(R.TId, R.FuncId, Top.first);
389 Top.first->Callees.emplace_back(N);
391 // Top may be invalidated after this statement.
447 void printStack(raw_ostream &OS, const StackTrieNode *Top,
452 for (auto *F = Top; F != nullptr; F = F->Parent)
569 auto *Top = S.pop_back_val();
570 printSingleStack<AggType>(OS, FN, ReportThread, ThreadId, Top);
571 for (const auto *C : Top->Callees)
606 // - Top 10 stacks by count
607 // - Top 10 stacks by aggregate duration
622 auto *Top = S.pop_back_val();
626 if (!Top->ExtraData.TerminalDurations.empty()) {
629 std::accumulate(Top->ExtraData.TerminalDurations.begin(),
630 Top->ExtraData.TerminalDurations.end(), 0uLL);
632 auto E = std::make_pair(Top, TopSum);
640 std::make_pair(Top, Top->ExtraData.TerminalDurations.size());
649 for (const auto *C : Top->Callees)
657 OS << "Top 10 Stacks by leaf sum:\n\n";
663 OS << "Top 10 Stacks by leaf count:\n\n";