HomeSort by relevance Sort by last modified time
    Searched defs:LookAhead (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/tools/gn/
parser.cc 140 bool Parser::LookAhead(Token::Type type) {
147 if (!LookAhead(type))
291 if (LookAhead(Token::LEFT_PAREN)) {
304 if (LookAhead(Token::LEFT_BRACE)) {
388 while (!LookAhead(stop_before)) {
450 if (LookAhead(Token::LEFT_BRACE)) {
452 } else if (LookAhead(Token::IF)) {
454 } else if (LookAhead(Token::BLOCK_COMMENT)) {
481 if (LookAhead(Token::RIGHT_BRACE)) {
  /external/llvm/lib/MC/MCParser/
AsmLexer.cpp 221 const char *LookAhead = CurPtr;
223 if (isdigit(*LookAhead)) {
224 ++LookAhead;
225 } else if (isxdigit(*LookAhead)) {
227 FirstHex = LookAhead;
228 ++LookAhead;
233 bool isHex = *LookAhead == 'h' || *LookAhead == 'H';
234 CurPtr = isHex || !FirstHex ? LookAhead : FirstHex;
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 887 unsigned LookAhead = std::min((unsigned)Sequence.size(),
889 if (LookAhead == 0)
892 std::vector<SUnit*>::const_iterator I = (Sequence.end() - LookAhead);
    [all...]
  /external/clang/include/clang/Lex/
Preprocessor.h 416 /// lookahead. They are "lexed" by the CachingLex() method.
843 /// LookAhead(0) returns the next token that would be returned by Lex(),
844 /// LookAhead(1) returns the token after it, etc. This returns norma
    [all...]

Completed in 91 milliseconds