Lines Matching refs:TS
365 auto &TS = ThreadStackMap[R.TId];
377 if (TS.empty()) {
379 TS.emplace_back(Root ? Root : createTrieNode(R.TId, R.FuncId, nullptr),
384 auto &Top = TS.back();
394 TS.emplace_back(N, R.TSC);
398 TS.emplace_back(*I, R.TSC);
411 if (TS.empty()) {
418 reverse(TS), [&](const std::pair<StackTrieNode *, uint64_t> &E) {
422 if (FunctionEntryMatch == TS.rend()) {
430 for (auto &E : make_range(I, TS.end() - 1))
433 auto &Deepest = TS.back();
440 TS.erase(I, TS.end());