Home
last modified time | relevance | path

Searched refs:CachedLexPos (Results 1 – 4 of 4) sorted by relevance

/external/clang/lib/Lex/
DPPCaching.cpp27 BacktrackPositions.push_back(CachedLexPos); in EnableBacktrackAtThisPos()
43 CachedLexPos = BacktrackPositions.back(); in Backtrack()
52 if (CachedLexPos < CachedTokens.size()) { in CachingLex()
53 Result = CachedTokens[CachedLexPos++]; in CachingLex()
64 ++CachedLexPos; in CachingLex()
68 if (CachedLexPos < CachedTokens.size()) { in CachingLex()
73 CachedLexPos = 0; in CachingLex()
87 assert(CachedLexPos + N > CachedTokens.size() && "Confused caching."); in PeekAhead()
89 for (unsigned C = CachedLexPos + N - CachedTokens.size(); C > 0; --C) { in PeekAhead()
99 assert(CachedLexPos != 0 && "Expected to have some cached tokens"); in AnnotatePreviousCachedTokens()
[all …]
DPPLexerChange.cpp195 if (CachedLexPos < CachedTokens.size()) { in EnterTokenStream()
198 CachedTokens.insert(CachedTokens.begin() + CachedLexPos, in EnterTokenStream()
DPreprocessor.cpp110 CachedLexPos = 0; in Preprocessor()
/external/clang/include/clang/Lex/
DPreprocessor.h626 CachedTokensTy::size_type CachedLexPos; variable
1154 if (CachedLexPos + N < CachedTokens.size()) in LookAhead()
1155 return CachedTokens[CachedLexPos+N]; in LookAhead()
1168 assert(signed(CachedLexPos) - signed(N) >= signed(BacktrackPositions.back()) in RevertCachedTokens()
1170 assert(signed(CachedLexPos) - signed(N) >= 0 && in RevertCachedTokens()
1172 CachedLexPos -= N; in RevertCachedTokens()
1181 CachedTokens.insert(CachedTokens.begin()+CachedLexPos, Tok); in EnterToken()
1194 if (CachedLexPos != 0 && isBacktrackEnabled()) in AnnotateCachedTokens()
1201 assert(CachedLexPos != 0); in getLastCachedTokenLocation()
1202 return CachedTokens[CachedLexPos-1].getLastLoc(); in getLastCachedTokenLocation()
[all …]