LLVM  8.0.1
TGLexer.cpp
Go to the documentation of this file.
1 //===- TGLexer.cpp - Lexer for TableGen -----------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // Implement the Lexer for TableGen.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #include "TGLexer.h"
15 #include "llvm/ADT/StringSwitch.h"
16 #include "llvm/ADT/Twine.h"
17 #include "llvm/Config/config.h" // for strtoull()/strtoll() define
18 #include "llvm/Support/Compiler.h"
20 #include "llvm/Support/SourceMgr.h"
21 #include "llvm/TableGen/Error.h"
22 #include <algorithm>
23 #include <cctype>
24 #include <cerrno>
25 #include <cstdint>
26 #include <cstdio>
27 #include <cstdlib>
28 #include <cstring>
29 
30 using namespace llvm;
31 
32 namespace {
33 // A list of supported preprocessing directives with their
34 // internal token kinds and names.
35 struct {
37  const char *Word;
38 } PreprocessorDirs[] = {
39  { tgtok::Ifdef, "ifdef" },
40  { tgtok::Else, "else" },
41  { tgtok::Endif, "endif" },
42  { tgtok::Define, "define" }
43 };
44 } // end anonymous namespace
45 
47  CurBuffer = SrcMgr.getMainFileID();
48  CurBuf = SrcMgr.getMemoryBuffer(CurBuffer)->getBuffer();
49  CurPtr = CurBuf.begin();
50  TokStart = nullptr;
51 
52  // Pretend that we enter the "top-level" include file.
53  PrepIncludeStack.push_back(
54  make_unique<std::vector<PreprocessorControlDesc>>());
55 
56  // Put all macros defined in the command line into the DefinedMacros set.
57  std::for_each(Macros.begin(), Macros.end(),
58  [this](const std::string &MacroName) {
59  DefinedMacros.insert(MacroName);
60  });
61 }
62 
64  return SMLoc::getFromPointer(TokStart);
65 }
66 
67 /// ReturnError - Set the error to the specified string at the specified
68 /// location. This is defined to always return tgtok::Error.
69 tgtok::TokKind TGLexer::ReturnError(SMLoc Loc, const Twine &Msg) {
70  PrintError(Loc, Msg);
71  return tgtok::Error;
72 }
73 
74 tgtok::TokKind TGLexer::ReturnError(const char *Loc, const Twine &Msg) {
75  return ReturnError(SMLoc::getFromPointer(Loc), Msg);
76 }
77 
78 bool TGLexer::processEOF() {
79  SMLoc ParentIncludeLoc = SrcMgr.getParentIncludeLoc(CurBuffer);
80  if (ParentIncludeLoc != SMLoc()) {
81  // If prepExitInclude() detects a problem with the preprocessing
82  // control stack, it will return false. Pretend that we reached
83  // the final EOF and stop lexing more tokens by returning false
84  // to LexToken().
85  if (!prepExitInclude(false))
86  return false;
87 
88  CurBuffer = SrcMgr.FindBufferContainingLoc(ParentIncludeLoc);
89  CurBuf = SrcMgr.getMemoryBuffer(CurBuffer)->getBuffer();
90  CurPtr = ParentIncludeLoc.getPointer();
91  // Make sure TokStart points into the parent file's buffer.
92  // LexToken() assigns to it before calling getNextChar(),
93  // so it is pointing into the included file now.
94  TokStart = CurPtr;
95  return true;
96  }
97 
98  // Pretend that we exit the "top-level" include file.
99  // Note that in case of an error (e.g. control stack imbalance)
100  // the routine will issue a fatal error.
101  prepExitInclude(true);
102  return false;
103 }
104 
105 int TGLexer::getNextChar() {
106  char CurChar = *CurPtr++;
107  switch (CurChar) {
108  default:
109  return (unsigned char)CurChar;
110  case 0: {
111  // A nul character in the stream is either the end of the current buffer or
112  // a random nul in the file. Disambiguate that here.
113  if (CurPtr-1 != CurBuf.end())
114  return 0; // Just whitespace.
115 
116  // Otherwise, return end of file.
117  --CurPtr; // Another call to lex will return EOF again.
118  return EOF;
119  }
120  case '\n':
121  case '\r':
122  // Handle the newline character by ignoring it and incrementing the line
123  // count. However, be careful about 'dos style' files with \n\r in them.
124  // Only treat a \n\r or \r\n as a single line.
125  if ((*CurPtr == '\n' || (*CurPtr == '\r')) &&
126  *CurPtr != CurChar)
127  ++CurPtr; // Eat the two char newline sequence.
128  return '\n';
129  }
130 }
131 
132 int TGLexer::peekNextChar(int Index) const {
133  return *(CurPtr + Index);
134 }
135 
136 tgtok::TokKind TGLexer::LexToken(bool FileOrLineStart) {
137  TokStart = CurPtr;
138  // This always consumes at least one character.
139  int CurChar = getNextChar();
140 
141  switch (CurChar) {
142  default:
143  // Handle letters: [a-zA-Z_]
144  if (isalpha(CurChar) || CurChar == '_')
145  return LexIdentifier();
146 
147  // Unknown character, emit an error.
148  return ReturnError(TokStart, "Unexpected character");
149  case EOF:
150  // Lex next token, if we just left an include file.
151  // Note that leaving an include file means that the next
152  // symbol is located at the end of 'include "..."'
153  // construct, so LexToken() is called with default
154  // false parameter.
155  if (processEOF())
156  return LexToken();
157 
158  // Return EOF denoting the end of lexing.
159  return tgtok::Eof;
160 
161  case ':': return tgtok::colon;
162  case ';': return tgtok::semi;
163  case '.': return tgtok::period;
164  case ',': return tgtok::comma;
165  case '<': return tgtok::less;
166  case '>': return tgtok::greater;
167  case ']': return tgtok::r_square;
168  case '{': return tgtok::l_brace;
169  case '}': return tgtok::r_brace;
170  case '(': return tgtok::l_paren;
171  case ')': return tgtok::r_paren;
172  case '=': return tgtok::equal;
173  case '?': return tgtok::question;
174  case '#':
175  if (FileOrLineStart) {
176  tgtok::TokKind Kind = prepIsDirective();
177  if (Kind != tgtok::Error)
178  return lexPreprocessor(Kind);
179  }
180 
181  return tgtok::paste;
182 
183  case '\r':
184  PrintFatalError("getNextChar() must never return '\r'");
185  return tgtok::Error;
186 
187  case 0:
188  case ' ':
189  case '\t':
190  // Ignore whitespace.
191  return LexToken(FileOrLineStart);
192  case '\n':
193  // Ignore whitespace, and identify the new line.
194  return LexToken(true);
195  case '/':
196  // If this is the start of a // comment, skip until the end of the line or
197  // the end of the buffer.
198  if (*CurPtr == '/')
199  SkipBCPLComment();
200  else if (*CurPtr == '*') {
201  if (SkipCComment())
202  return tgtok::Error;
203  } else // Otherwise, this is an error.
204  return ReturnError(TokStart, "Unexpected character");
205  return LexToken(FileOrLineStart);
206  case '-': case '+':
207  case '0': case '1': case '2': case '3': case '4': case '5': case '6':
208  case '7': case '8': case '9': {
209  int NextChar = 0;
210  if (isdigit(CurChar)) {
211  // Allow identifiers to start with a number if it is followed by
212  // an identifier. This can happen with paste operations like
213  // foo#8i.
214  int i = 0;
215  do {
216  NextChar = peekNextChar(i++);
217  } while (isdigit(NextChar));
218 
219  if (NextChar == 'x' || NextChar == 'b') {
220  // If this is [0-9]b[01] or [0-9]x[0-9A-fa-f] this is most
221  // likely a number.
222  int NextNextChar = peekNextChar(i);
223  switch (NextNextChar) {
224  default:
225  break;
226  case '0': case '1':
227  if (NextChar == 'b')
228  return LexNumber();
230  case '2': case '3': case '4': case '5':
231  case '6': case '7': case '8': case '9':
232  case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
233  case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
234  if (NextChar == 'x')
235  return LexNumber();
236  break;
237  }
238  }
239  }
240 
241  if (isalpha(NextChar) || NextChar == '_')
242  return LexIdentifier();
243 
244  return LexNumber();
245  }
246  case '"': return LexString();
247  case '$': return LexVarName();
248  case '[': return LexBracket();
249  case '!': return LexExclaim();
250  }
251 }
252 
253 /// LexString - Lex "[^"]*"
254 tgtok::TokKind TGLexer::LexString() {
255  const char *StrStart = CurPtr;
256 
257  CurStrVal = "";
258 
259  while (*CurPtr != '"') {
260  // If we hit the end of the buffer, report an error.
261  if (*CurPtr == 0 && CurPtr == CurBuf.end())
262  return ReturnError(StrStart, "End of file in string literal");
263 
264  if (*CurPtr == '\n' || *CurPtr == '\r')
265  return ReturnError(StrStart, "End of line in string literal");
266 
267  if (*CurPtr != '\\') {
268  CurStrVal += *CurPtr++;
269  continue;
270  }
271 
272  ++CurPtr;
273 
274  switch (*CurPtr) {
275  case '\\': case '\'': case '"':
276  // These turn into their literal character.
277  CurStrVal += *CurPtr++;
278  break;
279  case 't':
280  CurStrVal += '\t';
281  ++CurPtr;
282  break;
283  case 'n':
284  CurStrVal += '\n';
285  ++CurPtr;
286  break;
287 
288  case '\n':
289  case '\r':
290  return ReturnError(CurPtr, "escaped newlines not supported in tblgen");
291 
292  // If we hit the end of the buffer, report an error.
293  case '\0':
294  if (CurPtr == CurBuf.end())
295  return ReturnError(StrStart, "End of file in string literal");
297  default:
298  return ReturnError(CurPtr, "invalid escape in string literal");
299  }
300  }
301 
302  ++CurPtr;
303  return tgtok::StrVal;
304 }
305 
306 tgtok::TokKind TGLexer::LexVarName() {
307  if (!isalpha(CurPtr[0]) && CurPtr[0] != '_')
308  return ReturnError(TokStart, "Invalid variable name");
309 
310  // Otherwise, we're ok, consume the rest of the characters.
311  const char *VarNameStart = CurPtr++;
312 
313  while (isalpha(*CurPtr) || isdigit(*CurPtr) || *CurPtr == '_')
314  ++CurPtr;
315 
316  CurStrVal.assign(VarNameStart, CurPtr);
317  return tgtok::VarName;
318 }
319 
320 tgtok::TokKind TGLexer::LexIdentifier() {
321  // The first letter is [a-zA-Z_].
322  const char *IdentStart = TokStart;
323 
324  // Match the rest of the identifier regex: [0-9a-zA-Z_]*
325  while (isalpha(*CurPtr) || isdigit(*CurPtr) || *CurPtr == '_')
326  ++CurPtr;
327 
328  // Check to see if this identifier is a keyword.
329  StringRef Str(IdentStart, CurPtr-IdentStart);
330 
331  if (Str == "include") {
332  if (LexInclude()) return tgtok::Error;
333  return Lex();
334  }
335 
337  .Case("int", tgtok::Int)
338  .Case("bit", tgtok::Bit)
339  .Case("bits", tgtok::Bits)
340  .Case("string", tgtok::String)
341  .Case("list", tgtok::List)
342  .Case("code", tgtok::Code)
343  .Case("dag", tgtok::Dag)
344  .Case("class", tgtok::Class)
345  .Case("def", tgtok::Def)
346  .Case("foreach", tgtok::Foreach)
347  .Case("defm", tgtok::Defm)
348  .Case("defset", tgtok::Defset)
349  .Case("multiclass", tgtok::MultiClass)
350  .Case("field", tgtok::Field)
351  .Case("let", tgtok::Let)
352  .Case("in", tgtok::In)
353  .Default(tgtok::Id);
354 
355  if (Kind == tgtok::Id)
356  CurStrVal.assign(Str.begin(), Str.end());
357  return Kind;
358 }
359 
360 /// LexInclude - We just read the "include" token. Get the string token that
361 /// comes next and enter the include.
362 bool TGLexer::LexInclude() {
363  // The token after the include must be a string.
364  tgtok::TokKind Tok = LexToken();
365  if (Tok == tgtok::Error) return true;
366  if (Tok != tgtok::StrVal) {
367  PrintError(getLoc(), "Expected filename after include");
368  return true;
369  }
370 
371  // Get the string.
372  std::string Filename = CurStrVal;
373  std::string IncludedFile;
374 
375  CurBuffer = SrcMgr.AddIncludeFile(Filename, SMLoc::getFromPointer(CurPtr),
376  IncludedFile);
377  if (!CurBuffer) {
378  PrintError(getLoc(), "Could not find include file '" + Filename + "'");
379  return true;
380  }
381 
382  DependenciesMapTy::const_iterator Found = Dependencies.find(IncludedFile);
383  if (Found != Dependencies.end()) {
384  PrintError(getLoc(),
385  "File '" + IncludedFile + "' has already been included.");
386  SrcMgr.PrintMessage(Found->second, SourceMgr::DK_Note,
387  "previously included here");
388  return true;
389  }
390  Dependencies.insert(std::make_pair(IncludedFile, getLoc()));
391  // Save the line number and lex buffer of the includer.
392  CurBuf = SrcMgr.getMemoryBuffer(CurBuffer)->getBuffer();
393  CurPtr = CurBuf.begin();
394 
395  PrepIncludeStack.push_back(
396  make_unique<std::vector<PreprocessorControlDesc>>());
397  return false;
398 }
399 
400 void TGLexer::SkipBCPLComment() {
401  ++CurPtr; // skip the second slash.
402  while (true) {
403  switch (*CurPtr) {
404  case '\n':
405  case '\r':
406  return; // Newline is end of comment.
407  case 0:
408  // If this is the end of the buffer, end the comment.
409  if (CurPtr == CurBuf.end())
410  return;
411  break;
412  }
413  // Otherwise, skip the character.
414  ++CurPtr;
415  }
416 }
417 
418 /// SkipCComment - This skips C-style /**/ comments. The only difference from C
419 /// is that we allow nesting.
420 bool TGLexer::SkipCComment() {
421  ++CurPtr; // skip the star.
422  unsigned CommentDepth = 1;
423 
424  while (true) {
425  int CurChar = getNextChar();
426  switch (CurChar) {
427  case EOF:
428  PrintError(TokStart, "Unterminated comment!");
429  return true;
430  case '*':
431  // End of the comment?
432  if (CurPtr[0] != '/') break;
433 
434  ++CurPtr; // End the */.
435  if (--CommentDepth == 0)
436  return false;
437  break;
438  case '/':
439  // Start of a nested comment?
440  if (CurPtr[0] != '*') break;
441  ++CurPtr;
442  ++CommentDepth;
443  break;
444  }
445  }
446 }
447 
448 /// LexNumber - Lex:
449 /// [-+]?[0-9]+
450 /// 0x[0-9a-fA-F]+
451 /// 0b[01]+
452 tgtok::TokKind TGLexer::LexNumber() {
453  if (CurPtr[-1] == '0') {
454  if (CurPtr[0] == 'x') {
455  ++CurPtr;
456  const char *NumStart = CurPtr;
457  while (isxdigit(CurPtr[0]))
458  ++CurPtr;
459 
460  // Requires at least one hex digit.
461  if (CurPtr == NumStart)
462  return ReturnError(TokStart, "Invalid hexadecimal number");
463 
464  errno = 0;
465  CurIntVal = strtoll(NumStart, nullptr, 16);
466  if (errno == EINVAL)
467  return ReturnError(TokStart, "Invalid hexadecimal number");
468  if (errno == ERANGE) {
469  errno = 0;
470  CurIntVal = (int64_t)strtoull(NumStart, nullptr, 16);
471  if (errno == EINVAL)
472  return ReturnError(TokStart, "Invalid hexadecimal number");
473  if (errno == ERANGE)
474  return ReturnError(TokStart, "Hexadecimal number out of range");
475  }
476  return tgtok::IntVal;
477  } else if (CurPtr[0] == 'b') {
478  ++CurPtr;
479  const char *NumStart = CurPtr;
480  while (CurPtr[0] == '0' || CurPtr[0] == '1')
481  ++CurPtr;
482 
483  // Requires at least one binary digit.
484  if (CurPtr == NumStart)
485  return ReturnError(CurPtr-2, "Invalid binary number");
486  CurIntVal = strtoll(NumStart, nullptr, 2);
487  return tgtok::BinaryIntVal;
488  }
489  }
490 
491  // Check for a sign without a digit.
492  if (!isdigit(CurPtr[0])) {
493  if (CurPtr[-1] == '-')
494  return tgtok::minus;
495  else if (CurPtr[-1] == '+')
496  return tgtok::plus;
497  }
498 
499  while (isdigit(CurPtr[0]))
500  ++CurPtr;
501  CurIntVal = strtoll(TokStart, nullptr, 10);
502  return tgtok::IntVal;
503 }
504 
505 /// LexBracket - We just read '['. If this is a code block, return it,
506 /// otherwise return the bracket. Match: '[' and '[{ ( [^}]+ | }[^]] )* }]'
507 tgtok::TokKind TGLexer::LexBracket() {
508  if (CurPtr[0] != '{')
509  return tgtok::l_square;
510  ++CurPtr;
511  const char *CodeStart = CurPtr;
512  while (true) {
513  int Char = getNextChar();
514  if (Char == EOF) break;
515 
516  if (Char != '}') continue;
517 
518  Char = getNextChar();
519  if (Char == EOF) break;
520  if (Char == ']') {
521  CurStrVal.assign(CodeStart, CurPtr-2);
522  return tgtok::CodeFragment;
523  }
524  }
525 
526  return ReturnError(CodeStart-2, "Unterminated Code Block");
527 }
528 
529 /// LexExclaim - Lex '!' and '![a-zA-Z]+'.
530 tgtok::TokKind TGLexer::LexExclaim() {
531  if (!isalpha(*CurPtr))
532  return ReturnError(CurPtr - 1, "Invalid \"!operator\"");
533 
534  const char *Start = CurPtr++;
535  while (isalpha(*CurPtr))
536  ++CurPtr;
537 
538  // Check to see which operator this is.
540  StringSwitch<tgtok::TokKind>(StringRef(Start, CurPtr - Start))
541  .Case("eq", tgtok::XEq)
542  .Case("ne", tgtok::XNe)
543  .Case("le", tgtok::XLe)
544  .Case("lt", tgtok::XLt)
545  .Case("ge", tgtok::XGe)
546  .Case("gt", tgtok::XGt)
547  .Case("if", tgtok::XIf)
548  .Case("isa", tgtok::XIsA)
549  .Case("head", tgtok::XHead)
550  .Case("tail", tgtok::XTail)
551  .Case("size", tgtok::XSize)
552  .Case("con", tgtok::XConcat)
553  .Case("dag", tgtok::XDag)
554  .Case("add", tgtok::XADD)
555  .Case("and", tgtok::XAND)
556  .Case("or", tgtok::XOR)
557  .Case("shl", tgtok::XSHL)
558  .Case("sra", tgtok::XSRA)
559  .Case("srl", tgtok::XSRL)
560  .Case("cast", tgtok::XCast)
561  .Case("empty", tgtok::XEmpty)
562  .Case("subst", tgtok::XSubst)
563  .Case("foldl", tgtok::XFoldl)
564  .Case("foreach", tgtok::XForEach)
565  .Case("listconcat", tgtok::XListConcat)
566  .Case("strconcat", tgtok::XStrConcat)
568 
569  return Kind != tgtok::Error ? Kind : ReturnError(Start-1, "Unknown operator");
570 }
571 
572 bool TGLexer::prepExitInclude(bool IncludeStackMustBeEmpty) {
573  // Report an error, if preprocessor control stack for the current
574  // file is not empty.
575  if (!PrepIncludeStack.back()->empty()) {
576  prepReportPreprocessorStackError();
577 
578  return false;
579  }
580 
581  // Pop the preprocessing controls from the include stack.
582  if (PrepIncludeStack.empty()) {
583  PrintFatalError("Preprocessor include stack is empty");
584  }
585 
586  PrepIncludeStack.pop_back();
587 
588  if (IncludeStackMustBeEmpty) {
589  if (!PrepIncludeStack.empty())
590  PrintFatalError("Preprocessor include stack is not empty");
591  } else {
592  if (PrepIncludeStack.empty())
593  PrintFatalError("Preprocessor include stack is empty");
594  }
595 
596  return true;
597 }
598 
599 tgtok::TokKind TGLexer::prepIsDirective() const {
600  for (unsigned ID = 0; ID < llvm::array_lengthof(PreprocessorDirs); ++ID) {
601  int NextChar = *CurPtr;
602  bool Match = true;
603  unsigned I = 0;
604  for (; I < strlen(PreprocessorDirs[ID].Word); ++I) {
605  if (NextChar != PreprocessorDirs[ID].Word[I]) {
606  Match = false;
607  break;
608  }
609 
610  NextChar = peekNextChar(I + 1);
611  }
612 
613  // Check for whitespace after the directive. If there is no whitespace,
614  // then we do not recognize it as a preprocessing directive.
615  if (Match) {
616  tgtok::TokKind Kind = PreprocessorDirs[ID].Kind;
617 
618  // New line and EOF may follow only #else/#endif. It will be reported
619  // as an error for #ifdef/#define after the call to prepLexMacroName().
620  if (NextChar == ' ' || NextChar == '\t' || NextChar == EOF ||
621  NextChar == '\n' ||
622  // It looks like TableGen does not support '\r' as the actual
623  // carriage return, e.g. getNextChar() treats a single '\r'
624  // as '\n'. So we do the same here.
625  NextChar == '\r')
626  return Kind;
627 
628  // Allow comments after some directives, e.g.:
629  // #else// OR #else/**/
630  // #endif// OR #endif/**/
631  //
632  // Note that we do allow comments after #ifdef/#define here, e.g.
633  // #ifdef/**/ AND #ifdef//
634  // #define/**/ AND #define//
635  //
636  // These cases will be reported as incorrect after calling
637  // prepLexMacroName(). We could have supported C-style comments
638  // after #ifdef/#define, but this would complicate the code
639  // for little benefit.
640  if (NextChar == '/') {
641  NextChar = peekNextChar(I + 1);
642 
643  if (NextChar == '*' || NextChar == '/')
644  return Kind;
645 
646  // Pretend that we do not recognize the directive.
647  }
648  }
649  }
650 
651  return tgtok::Error;
652 }
653 
654 bool TGLexer::prepEatPreprocessorDirective(tgtok::TokKind Kind) {
655  TokStart = CurPtr;
656 
657  for (unsigned ID = 0; ID < llvm::array_lengthof(PreprocessorDirs); ++ID)
658  if (PreprocessorDirs[ID].Kind == Kind) {
659  // Advance CurPtr to the end of the preprocessing word.
660  CurPtr += strlen(PreprocessorDirs[ID].Word);
661  return true;
662  }
663 
664  PrintFatalError("Unsupported preprocessing token in "
665  "prepEatPreprocessorDirective()");
666  return false;
667 }
668 
669 tgtok::TokKind TGLexer::lexPreprocessor(
670  tgtok::TokKind Kind, bool ReturnNextLiveToken) {
671 
672  // We must be looking at a preprocessing directive. Eat it!
673  if (!prepEatPreprocessorDirective(Kind))
674  PrintFatalError("lexPreprocessor() called for unknown "
675  "preprocessor directive");
676 
677  if (Kind == tgtok::Ifdef) {
678  StringRef MacroName = prepLexMacroName();
679  if (MacroName.empty())
680  return ReturnError(TokStart, "Expected macro name after #ifdef");
681 
682  bool MacroIsDefined = DefinedMacros.count(MacroName) != 0;
683 
684  // Regardless of whether we are processing tokens or not,
685  // we put the #ifdef control on stack.
686  PrepIncludeStack.back()->push_back(
687  {Kind, MacroIsDefined, SMLoc::getFromPointer(TokStart)});
688 
689  if (!prepSkipDirectiveEnd())
690  return ReturnError(CurPtr,
691  "Only comments are supported after #ifdef NAME");
692 
693  // If we were not processing tokens before this #ifdef,
694  // then just return back to the lines skipping code.
695  if (!ReturnNextLiveToken)
696  return Kind;
697 
698  // If we were processing tokens before this #ifdef,
699  // and the macro is defined, then just return the next token.
700  if (MacroIsDefined)
701  return LexToken();
702 
703  // We were processing tokens before this #ifdef, and the macro
704  // is not defined, so we have to start skipping the lines.
705  // If the skipping is successful, it will return the token following
706  // either #else or #endif corresponding to this #ifdef.
707  if (prepSkipRegion(ReturnNextLiveToken))
708  return LexToken();
709 
710  return tgtok::Error;
711  } else if (Kind == tgtok::Else) {
712  // Check if this #else is correct before calling prepSkipDirectiveEnd(),
713  // which will move CurPtr away from the beginning of #else.
714  if (PrepIncludeStack.back()->empty())
715  return ReturnError(TokStart, "#else without #ifdef");
716 
717  PreprocessorControlDesc IfdefEntry = PrepIncludeStack.back()->back();
718 
719  if (IfdefEntry.Kind != tgtok::Ifdef) {
720  PrintError(TokStart, "double #else");
721  return ReturnError(IfdefEntry.SrcPos, "Previous #else is here");
722  }
723 
724  // Replace the corresponding #ifdef's control with its negation
725  // on the control stack.
726  PrepIncludeStack.back()->pop_back();
727  PrepIncludeStack.back()->push_back(
728  {Kind, !IfdefEntry.IsDefined, SMLoc::getFromPointer(TokStart)});
729 
730  if (!prepSkipDirectiveEnd())
731  return ReturnError(CurPtr, "Only comments are supported after #else");
732 
733  // If we were processing tokens before this #else,
734  // we have to start skipping lines until the matching #endif.
735  if (ReturnNextLiveToken) {
736  if (prepSkipRegion(ReturnNextLiveToken))
737  return LexToken();
738 
739  return tgtok::Error;
740  }
741 
742  // Return to the lines skipping code.
743  return Kind;
744  } else if (Kind == tgtok::Endif) {
745  // Check if this #endif is correct before calling prepSkipDirectiveEnd(),
746  // which will move CurPtr away from the beginning of #endif.
747  if (PrepIncludeStack.back()->empty())
748  return ReturnError(TokStart, "#endif without #ifdef");
749 
750  auto &IfdefOrElseEntry = PrepIncludeStack.back()->back();
751 
752  if (IfdefOrElseEntry.Kind != tgtok::Ifdef &&
753  IfdefOrElseEntry.Kind != tgtok::Else) {
754  PrintFatalError("Invalid preprocessor control on the stack");
755  return tgtok::Error;
756  }
757 
758  if (!prepSkipDirectiveEnd())
759  return ReturnError(CurPtr, "Only comments are supported after #endif");
760 
761  PrepIncludeStack.back()->pop_back();
762 
763  // If we were processing tokens before this #endif, then
764  // we should continue it.
765  if (ReturnNextLiveToken) {
766  return LexToken();
767  }
768 
769  // Return to the lines skipping code.
770  return Kind;
771  } else if (Kind == tgtok::Define) {
772  StringRef MacroName = prepLexMacroName();
773  if (MacroName.empty())
774  return ReturnError(TokStart, "Expected macro name after #define");
775 
776  if (!DefinedMacros.insert(MacroName).second)
778  "Duplicate definition of macro: " + Twine(MacroName));
779 
780  if (!prepSkipDirectiveEnd())
781  return ReturnError(CurPtr,
782  "Only comments are supported after #define NAME");
783 
784  if (!ReturnNextLiveToken) {
785  PrintFatalError("#define must be ignored during the lines skipping");
786  return tgtok::Error;
787  }
788 
789  return LexToken();
790  }
791 
792  PrintFatalError("Preprocessing directive is not supported");
793  return tgtok::Error;
794 }
795 
796 bool TGLexer::prepSkipRegion(bool MustNeverBeFalse) {
797  if (!MustNeverBeFalse)
798  PrintFatalError("Invalid recursion.");
799 
800  do {
801  // Skip all symbols to the line end.
802  prepSkipToLineEnd();
803 
804  // Find the first non-whitespace symbol in the next line(s).
805  if (!prepSkipLineBegin())
806  return false;
807 
808  // If the first non-blank/comment symbol on the line is '#',
809  // it may be a start of preprocessing directive.
810  //
811  // If it is not '#' just go to the next line.
812  if (*CurPtr == '#')
813  ++CurPtr;
814  else
815  continue;
816 
817  tgtok::TokKind Kind = prepIsDirective();
818 
819  // If we did not find a preprocessing directive or it is #define,
820  // then just skip to the next line. We do not have to do anything
821  // for #define in the line-skipping mode.
822  if (Kind == tgtok::Error || Kind == tgtok::Define)
823  continue;
824 
825  tgtok::TokKind ProcessedKind = lexPreprocessor(Kind, false);
826 
827  // If lexPreprocessor() encountered an error during lexing this
828  // preprocessor idiom, then return false to the calling lexPreprocessor().
829  // This will force tgtok::Error to be returned to the tokens processing.
830  if (ProcessedKind == tgtok::Error)
831  return false;
832 
833  if (Kind != ProcessedKind)
834  PrintFatalError("prepIsDirective() and lexPreprocessor() "
835  "returned different token kinds");
836 
837  // If this preprocessing directive enables tokens processing,
838  // then return to the lexPreprocessor() and get to the next token.
839  // We can move from line-skipping mode to processing tokens only
840  // due to #else or #endif.
841  if (prepIsProcessingEnabled()) {
842  if (Kind != tgtok::Else && Kind != tgtok::Endif) {
843  PrintFatalError("Tokens processing was enabled by an unexpected "
844  "preprocessing directive");
845  return false;
846  }
847 
848  return true;
849  }
850  } while (CurPtr != CurBuf.end());
851 
852  // We have reached the end of the file, but never left the lines-skipping
853  // mode. This means there is no matching #endif.
854  prepReportPreprocessorStackError();
855  return false;
856 }
857 
858 StringRef TGLexer::prepLexMacroName() {
859  // Skip whitespaces between the preprocessing directive and the macro name.
860  while (*CurPtr == ' ' || *CurPtr == '\t')
861  ++CurPtr;
862 
863  TokStart = CurPtr;
864  // Macro names start with [a-zA-Z_].
865  if (*CurPtr != '_' && !isalpha(*CurPtr))
866  return "";
867 
868  // Match the rest of the identifier regex: [0-9a-zA-Z_]*
869  while (isalpha(*CurPtr) || isdigit(*CurPtr) || *CurPtr == '_')
870  ++CurPtr;
871 
872  return StringRef(TokStart, CurPtr - TokStart);
873 }
874 
875 bool TGLexer::prepSkipLineBegin() {
876  while (CurPtr != CurBuf.end()) {
877  switch (*CurPtr) {
878  case ' ':
879  case '\t':
880  case '\n':
881  case '\r':
882  break;
883 
884  case '/': {
885  int NextChar = peekNextChar(1);
886  if (NextChar == '*') {
887  // Skip C-style comment.
888  // Note that we do not care about skipping the C++-style comments.
889  // If the line contains "//", it may not contain any processable
890  // preprocessing directive. Just return CurPtr pointing to
891  // the first '/' in this case. We also do not care about
892  // incorrect symbols after the first '/' - we are in lines-skipping
893  // mode, so incorrect code is allowed to some extent.
894 
895  // Set TokStart to the beginning of the comment to enable proper
896  // diagnostic printing in case of error in SkipCComment().
897  TokStart = CurPtr;
898 
899  // CurPtr must point to '*' before call to SkipCComment().
900  ++CurPtr;
901  if (SkipCComment())
902  return false;
903  } else {
904  // CurPtr points to the non-whitespace '/'.
905  return true;
906  }
907 
908  // We must not increment CurPtr after the comment was lexed.
909  continue;
910  }
911 
912  default:
913  return true;
914  }
915 
916  ++CurPtr;
917  }
918 
919  // We have reached the end of the file. Return to the lines skipping
920  // code, and allow it to handle the EOF as needed.
921  return true;
922 }
923 
924 bool TGLexer::prepSkipDirectiveEnd() {
925  while (CurPtr != CurBuf.end()) {
926  switch (*CurPtr) {
927  case ' ':
928  case '\t':
929  break;
930 
931  case '\n':
932  case '\r':
933  return true;
934 
935  case '/': {
936  int NextChar = peekNextChar(1);
937  if (NextChar == '/') {
938  // Skip C++-style comment.
939  // We may just return true now, but let's skip to the line/buffer end
940  // to simplify the method specification.
941  ++CurPtr;
942  SkipBCPLComment();
943  } else if (NextChar == '*') {
944  // When we are skipping C-style comment at the end of a preprocessing
945  // directive, we can skip several lines. If any meaningful TD token
946  // follows the end of the C-style comment on the same line, it will
947  // be considered as an invalid usage of TD token.
948  // For example, we want to forbid usages like this one:
949  // #define MACRO class Class {}
950  // But with C-style comments we also disallow the following:
951  // #define MACRO /* This macro is used
952  // to ... */ class Class {}
953  // One can argue that this should be allowed, but it does not seem
954  // to be worth of the complication. Moreover, this matches
955  // the C preprocessor behavior.
956 
957  // Set TokStart to the beginning of the comment to enable proper
958  // diagnostic printer in case of error in SkipCComment().
959  TokStart = CurPtr;
960  ++CurPtr;
961  if (SkipCComment())
962  return false;
963  } else {
964  TokStart = CurPtr;
965  PrintError(CurPtr, "Unexpected character");
966  return false;
967  }
968 
969  // We must not increment CurPtr after the comment was lexed.
970  continue;
971  }
972 
973  default:
974  // Do not allow any non-whitespaces after the directive.
975  TokStart = CurPtr;
976  return false;
977  }
978 
979  ++CurPtr;
980  }
981 
982  return true;
983 }
984 
985 void TGLexer::prepSkipToLineEnd() {
986  while (*CurPtr != '\n' && *CurPtr != '\r' && CurPtr != CurBuf.end())
987  ++CurPtr;
988 }
989 
990 bool TGLexer::prepIsProcessingEnabled() {
991  for (auto I = PrepIncludeStack.back()->rbegin(),
992  E = PrepIncludeStack.back()->rend();
993  I != E; ++I) {
994  if (!I->IsDefined)
995  return false;
996  }
997 
998  return true;
999 }
1000 
1001 void TGLexer::prepReportPreprocessorStackError() {
1002  if (PrepIncludeStack.back()->empty())
1003  PrintFatalError("prepReportPreprocessorStackError() called with "
1004  "empty control stack");
1005 
1006  auto &PrepControl = PrepIncludeStack.back()->back();
1007  PrintError(CurBuf.end(), "Reached EOF without matching #endif");
1008  PrintError(PrepControl.SrcPos, "The latest preprocessor control is here");
1009 
1010  TokStart = CurPtr;
1011 }
SMLoc getLoc() const
Definition: TGLexer.cpp:63
unsigned FindBufferContainingLoc(SMLoc Loc) const
Return the ID of the buffer containing the specified location.
Definition: SourceMgr.cpp:62
StringRef getBuffer() const
Definition: MemoryBuffer.h:64
This class represents lattice values for constants.
Definition: AllocatorList.h:24
#define LLVM_FALLTHROUGH
Definition: Compiler.h:86
iterator begin() const
Definition: ArrayRef.h:137
SourceMgr SrcMgr
Definition: Error.cpp:24
std::enable_if<!std::is_array< T >::value, std::unique_ptr< T > >::type make_unique(Args &&... args)
Constructs a new T() with the given args and returns a unique_ptr<T> which owns the object...
Definition: STLExtras.h:1349
void PrintMessage(raw_ostream &OS, SMLoc Loc, DiagKind Kind, const Twine &Msg, ArrayRef< SMRange > Ranges=None, ArrayRef< SMFixIt > FixIts=None, bool ShowColors=true) const
Emit a message about the specified location with the specified string.
Definition: SourceMgr.cpp:248
Twine - A lightweight data structure for efficiently representing the concatenation of temporary valu...
Definition: Twine.h:81
support::ulittle32_t Word
Definition: IRSymtab.h:51
LLVM_NODISCARD LLVM_ATTRIBUTE_ALWAYS_INLINE R Default(T Value)
Definition: StringSwitch.h:203
const MemoryBuffer * getMemoryBuffer(unsigned i) const
Definition: SourceMgr.h:131
LLVM_NODISCARD LLVM_ATTRIBUTE_ALWAYS_INLINE bool empty() const
empty - Check if the string is empty.
Definition: StringRef.h:133
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory)...
Definition: APInt.h:33
unsigned getMainFileID() const
Definition: SourceMgr.h:140
const char * getPointer() const
Definition: SMLoc.h:35
A switch()-like statement whose cases are string literals.
Definition: StringSwitch.h:43
size_type count(StringRef Key) const
count - Return 1 if the element is in the map, 0 otherwise.
Definition: StringMap.h:359
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
TGLexer(SourceMgr &SrcMgr, ArrayRef< std::string > Macros)
Definition: TGLexer.cpp:46
void PrintWarning(ArrayRef< SMLoc > WarningLoc, const Twine &Msg)
Definition: Error.cpp:47
This owns the files read by a parser, handles include stacks, and handles diagnostic wrangling...
Definition: SourceMgr.h:42
tgtok::TokKind Lex()
Definition: TGLexer.h:99
std::pair< typename base::iterator, bool > insert(StringRef Key)
Definition: StringSet.h:38
constexpr size_t array_lengthof(T(&)[N])
Find the length of an array.
Definition: STLExtras.h:1044
iterator end() const
Definition: ArrayRef.h:138
LLVM_ATTRIBUTE_NORETURN void PrintFatalError(const Twine &Msg)
Definition: Error.cpp:67
LLVM_ATTRIBUTE_ALWAYS_INLINE StringSwitch & Case(StringLiteral S, T Value)
Definition: StringSwitch.h:70
iterator begin() const
Definition: StringRef.h:106
static SMLoc getFromPointer(const char *Ptr)
Definition: SMLoc.h:37
unsigned AddIncludeFile(const std::string &Filename, SMLoc IncludeLoc, std::string &IncludedFile)
Search for a file with the specified name in the current directory or in one of the IncludeDirs...
Definition: SourceMgr.cpp:41
SMLoc getParentIncludeLoc(unsigned i) const
Definition: SourceMgr.h:145
#define I(x, y, z)
Definition: MD5.cpp:58
const unsigned Kind
StringRef - Represent a constant reference to a string, i.e.
Definition: StringRef.h:49
UnaryPredicate for_each(R &&Range, UnaryPredicate P)
Provide wrappers to std::for_each which take ranges instead of having to pass begin/end explicitly...
Definition: STLExtras.h:1179
Represents a location in source code.
Definition: SMLoc.h:24
iterator end() const
Definition: StringRef.h:108
void PrintError(ArrayRef< SMLoc > ErrorLoc, const Twine &Msg)
Definition: Error.cpp:57