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