Lines Matching refs:Tokens

35   for (const auto &N : Line.Tokens) {  in forEachToken()
49 Result.Tokens.push_back(std::make_unique<LineNode>()); in MacroCallReconstructor()
64 assert(Result.Tokens.size() == 1 && Result.Tokens.front()->Children.size() == 1); in takeResult()
66 createUnwrappedLine(*Result.Tokens.front()->Children.front(), Level); in takeResult()
67 assert(!Final.Tokens.empty()); in takeResult()
162 (!ActiveReconstructedLines.back()->Tokens.empty() && in prepareParent()
163 Parent == ActiveReconstructedLines.back()->Tokens.back()->Tok)) { in prepareParent()
166 while (ActiveReconstructedLines.back()->Tokens.empty() || in prepareParent()
167 (Parent != ActiveReconstructedLines.back()->Tokens.back()->Tok && in prepareParent()
168 ActiveReconstructedLines.back()->Tokens.back()->Tok != in prepareParent()
174 ActiveReconstructedLines.back()->Tokens.back()->Children.push_back( in prepareParent()
177 &*ActiveReconstructedLines.back()->Tokens.back()->Children.back()); in prepareParent()
178 } else if (parentLine().Tokens.back()->Tok != Parent) { in prepareParent()
181 while (Parent != parentLine().Tokens.back()->Tok && in prepareParent()
182 parentLine().Tokens.back()->Tok && in prepareParent()
183 parentLine().Tokens.back()->Tok != OpenMacroParent) { in prepareParent()
234 } else if (!currentLine()->Tokens.empty()) { in reconstruct()
239 currentLine()->Tokens.back()->Tok; in reconstruct()
244 if (!(*I)->Tokens.empty()) { in reconstruct()
245 SpelledParentToReconstructedParent[Token] = (*I)->Tokens.back()->Tok; in reconstruct()
292 {ID, IU->second->Tokens.begin(), IU->second->Tokens.end()}); in startReconstruction()
419 currentLine(), parentLine().Tokens.back()->Tok, Token)); in processNextReconstructed()
439 [MacroCallStructure.back().Line->Tokens.back()->Tok] = Token; in processNextReconstructed()
475 assert(Result.Tokens.size() == 1 && !Result.Tokens.front()->Children.empty()); in finalize()
482 LineNode &Top = *Result.Tokens.front(); in finalize()
486 LineNode *Last = (*I)->Tokens.back().get(); in finalize()
496 Last = Last->Children.back()->Tokens.back().get(); in finalize()
505 L->Tokens.push_back(std::make_unique<LineNode>(Token)); in appendToken()
513 for (const auto &N : Line.Tokens) { in createUnwrappedLine()
514 Result.Tokens.push_back(N->Tok); in createUnwrappedLine()
515 UnwrappedLineNode &Current = Result.Tokens.back(); in createUnwrappedLine()
517 if (Child->Tokens.empty()) in createUnwrappedLine()
523 Result.Tokens.splice(Result.Tokens.end(), in createUnwrappedLine()
524 Current.Children.front().Tokens); in createUnwrappedLine()
534 for (const auto &N : Line.Tokens) { in debug()