Lines Matching refs:TS
363 auto &TS = ThreadStackMap[R.TId];
375 if (TS.empty()) {
377 TS.emplace_back(Root ? Root : createTrieNode(R.TId, R.FuncId, nullptr),
382 auto &Top = TS.back();
392 TS.emplace_back(N, R.TSC);
396 TS.emplace_back(*I, R.TSC);
409 if (TS.empty()) {
416 reverse(TS), [&](const std::pair<StackTrieNode *, uint64_t> &E) {
420 if (FunctionEntryMatch == TS.rend()) {
428 for (auto &E : make_range(I, TS.end() - 1))
431 auto &Deepest = TS.back();
438 TS.erase(I, TS.end());