27   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()
100   assert(CachedTokens[CachedLexPos-1].getLastLoc() == Tok.getAnnotationEndLoc()  in AnnotatePreviousCachedTokens()
105   for (CachedTokensTy::size_type i = CachedLexPos; i != 0; --i) {  in AnnotatePreviousCachedTokens()
111       if (i < CachedLexPos)  in AnnotatePreviousCachedTokens()
112         CachedTokens.erase(AnnotBegin + 1, CachedTokens.begin() + CachedLexPos);  in AnnotatePreviousCachedTokens()
114       CachedLexPos = i;  in AnnotatePreviousCachedTokens()
122   if (!CachedLexPos)  in IsPreviousCachedToken()
125   const Token LastCachedTok = CachedTokens[CachedLexPos - 1];  in IsPreviousCachedToken()
139   assert(CachedLexPos != 0 && "Expected to have some cached tokens");  in ReplacePreviousCachedToken()
140   CachedTokens.insert(CachedTokens.begin() + CachedLexPos - 1, NewToks.begin(),  in ReplacePreviousCachedToken()
142   CachedTokens.erase(CachedTokens.begin() + CachedLexPos - 1 + NewToks.size());  in ReplacePreviousCachedToken()
143   CachedLexPos += NewToks.size() - 1;  in ReplacePreviousCachedToken()