Preprocessor.cpp revision 043266b2bba2ad36f59130168d4a64287213e277
1//===--- Preprocess.cpp - C Language Family Preprocessor Implementation ---===//
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//  This file implements the Preprocessor interface.
11//
12//===----------------------------------------------------------------------===//
13//
14// Options to support:
15//   -H       - Print the name of each header file used.
16//   -d[DNI] - Dump various things.
17//   -fworking-directory - #line's with preprocessor's working dir.
18//   -fpreprocessed
19//   -dependency-file,-M,-MM,-MF,-MG,-MP,-MT,-MQ,-MD,-MMD
20//   -W*
21//   -w
22//
23// Messages to emit:
24//   "Multiple include guards may be useful for:\n"
25//
26//===----------------------------------------------------------------------===//
27
28#include "clang/Lex/Preprocessor.h"
29#include "MacroArgs.h"
30#include "clang/Lex/ExternalPreprocessorSource.h"
31#include "clang/Lex/HeaderSearch.h"
32#include "clang/Lex/MacroInfo.h"
33#include "clang/Lex/Pragma.h"
34#include "clang/Lex/PreprocessingRecord.h"
35#include "clang/Lex/ScratchBuffer.h"
36#include "clang/Lex/LexDiagnostic.h"
37#include "clang/Lex/CodeCompletionHandler.h"
38#include "clang/Basic/SourceManager.h"
39#include "clang/Basic/FileManager.h"
40#include "clang/Basic/TargetInfo.h"
41#include "llvm/ADT/APFloat.h"
42#include "llvm/ADT/SmallVector.h"
43#include "llvm/Support/MemoryBuffer.h"
44#include "llvm/Support/raw_ostream.h"
45using namespace clang;
46
47//===----------------------------------------------------------------------===//
48ExternalPreprocessorSource::~ExternalPreprocessorSource() { }
49
50Preprocessor::Preprocessor(Diagnostic &diags, const LangOptions &opts,
51                           const TargetInfo &target, SourceManager &SM,
52                           HeaderSearch &Headers,
53                           IdentifierInfoLookup* IILookup,
54                           bool OwnsHeaders)
55  : Diags(&diags), Features(opts), Target(target),FileMgr(Headers.getFileMgr()),
56    SourceMgr(SM), HeaderInfo(Headers), ExternalSource(0),
57    Identifiers(opts, IILookup), BuiltinInfo(Target), CodeComplete(0),
58    CodeCompletionFile(0), SkipMainFilePreamble(0, true), CurPPLexer(0),
59    CurDirLookup(0), Callbacks(0), MacroArgCache(0), Record(0) {
60  ScratchBuf = new ScratchBuffer(SourceMgr);
61  CounterValue = 0; // __COUNTER__ starts at 0.
62  OwnsHeaderSearch = OwnsHeaders;
63
64  // Clear stats.
65  NumDirectives = NumDefined = NumUndefined = NumPragma = 0;
66  NumIf = NumElse = NumEndif = 0;
67  NumEnteredSourceFiles = 0;
68  NumMacroExpanded = NumFnMacroExpanded = NumBuiltinMacroExpanded = 0;
69  NumFastMacroExpanded = NumTokenPaste = NumFastTokenPaste = 0;
70  MaxIncludeStackDepth = 0;
71  NumSkipped = 0;
72
73  // Default to discarding comments.
74  KeepComments = false;
75  KeepMacroComments = false;
76
77  // Macro expansion is enabled.
78  DisableMacroExpansion = false;
79  InMacroArgs = false;
80  NumCachedTokenLexers = 0;
81
82  CachedLexPos = 0;
83
84  // We haven't read anything from the external source.
85  ReadMacrosFromExternalSource = false;
86
87  // "Poison" __VA_ARGS__, which can only appear in the expansion of a macro.
88  // This gets unpoisoned where it is allowed.
89  (Ident__VA_ARGS__ = getIdentifierInfo("__VA_ARGS__"))->setIsPoisoned();
90
91  // Initialize the pragma handlers.
92  PragmaHandlers = new PragmaNamespace(llvm::StringRef());
93  RegisterBuiltinPragmas();
94
95  // Initialize builtin macros like __LINE__ and friends.
96  RegisterBuiltinMacros();
97}
98
99Preprocessor::~Preprocessor() {
100  assert(BacktrackPositions.empty() && "EnableBacktrack/Backtrack imbalance!");
101
102  while (!IncludeMacroStack.empty()) {
103    delete IncludeMacroStack.back().TheLexer;
104    delete IncludeMacroStack.back().TheTokenLexer;
105    IncludeMacroStack.pop_back();
106  }
107
108  // Free any macro definitions.
109  for (llvm::DenseMap<IdentifierInfo*, MacroInfo*>::iterator I =
110       Macros.begin(), E = Macros.end(); I != E; ++I) {
111    // We don't need to free the MacroInfo objects directly.  These
112    // will be released when the BumpPtrAllocator 'BP' object gets
113    // destroyed.  We still need to run the dtor, however, to free
114    // memory alocated by MacroInfo.
115    I->second->Destroy();
116    I->first->setHasMacroDefinition(false);
117  }
118  for (std::vector<MacroInfo*>::iterator I = MICache.begin(),
119                                         E = MICache.end(); I != E; ++I) {
120    // We don't need to free the MacroInfo objects directly.  These
121    // will be released when the BumpPtrAllocator 'BP' object gets
122    // destroyed.  We still need to run the dtor, however, to free
123    // memory alocated by MacroInfo.
124    (*I)->Destroy();
125  }
126
127  // Free any cached macro expanders.
128  for (unsigned i = 0, e = NumCachedTokenLexers; i != e; ++i)
129    delete TokenLexerCache[i];
130
131  // Free any cached MacroArgs.
132  for (MacroArgs *ArgList = MacroArgCache; ArgList; )
133    ArgList = ArgList->deallocate();
134
135  // Release pragma information.
136  delete PragmaHandlers;
137
138  // Delete the scratch buffer info.
139  delete ScratchBuf;
140
141  // Delete the header search info, if we own it.
142  if (OwnsHeaderSearch)
143    delete &HeaderInfo;
144
145  delete Callbacks;
146}
147
148void Preprocessor::setPTHManager(PTHManager* pm) {
149  PTH.reset(pm);
150  FileMgr.addStatCache(PTH->createStatCache());
151}
152
153void Preprocessor::DumpToken(const Token &Tok, bool DumpFlags) const {
154  llvm::errs() << tok::getTokenName(Tok.getKind()) << " '"
155               << getSpelling(Tok) << "'";
156
157  if (!DumpFlags) return;
158
159  llvm::errs() << "\t";
160  if (Tok.isAtStartOfLine())
161    llvm::errs() << " [StartOfLine]";
162  if (Tok.hasLeadingSpace())
163    llvm::errs() << " [LeadingSpace]";
164  if (Tok.isExpandDisabled())
165    llvm::errs() << " [ExpandDisabled]";
166  if (Tok.needsCleaning()) {
167    const char *Start = SourceMgr.getCharacterData(Tok.getLocation());
168    llvm::errs() << " [UnClean='" << llvm::StringRef(Start, Tok.getLength())
169                 << "']";
170  }
171
172  llvm::errs() << "\tLoc=<";
173  DumpLocation(Tok.getLocation());
174  llvm::errs() << ">";
175}
176
177void Preprocessor::DumpLocation(SourceLocation Loc) const {
178  Loc.dump(SourceMgr);
179}
180
181void Preprocessor::DumpMacro(const MacroInfo &MI) const {
182  llvm::errs() << "MACRO: ";
183  for (unsigned i = 0, e = MI.getNumTokens(); i != e; ++i) {
184    DumpToken(MI.getReplacementToken(i));
185    llvm::errs() << "  ";
186  }
187  llvm::errs() << "\n";
188}
189
190void Preprocessor::PrintStats() {
191  llvm::errs() << "\n*** Preprocessor Stats:\n";
192  llvm::errs() << NumDirectives << " directives found:\n";
193  llvm::errs() << "  " << NumDefined << " #define.\n";
194  llvm::errs() << "  " << NumUndefined << " #undef.\n";
195  llvm::errs() << "  #include/#include_next/#import:\n";
196  llvm::errs() << "    " << NumEnteredSourceFiles << " source files entered.\n";
197  llvm::errs() << "    " << MaxIncludeStackDepth << " max include stack depth\n";
198  llvm::errs() << "  " << NumIf << " #if/#ifndef/#ifdef.\n";
199  llvm::errs() << "  " << NumElse << " #else/#elif.\n";
200  llvm::errs() << "  " << NumEndif << " #endif.\n";
201  llvm::errs() << "  " << NumPragma << " #pragma.\n";
202  llvm::errs() << NumSkipped << " #if/#ifndef#ifdef regions skipped\n";
203
204  llvm::errs() << NumMacroExpanded << "/" << NumFnMacroExpanded << "/"
205             << NumBuiltinMacroExpanded << " obj/fn/builtin macros expanded, "
206             << NumFastMacroExpanded << " on the fast path.\n";
207  llvm::errs() << (NumFastTokenPaste+NumTokenPaste)
208             << " token paste (##) operations performed, "
209             << NumFastTokenPaste << " on the fast path.\n";
210}
211
212Preprocessor::macro_iterator
213Preprocessor::macro_begin(bool IncludeExternalMacros) const {
214  if (IncludeExternalMacros && ExternalSource &&
215      !ReadMacrosFromExternalSource) {
216    ReadMacrosFromExternalSource = true;
217    ExternalSource->ReadDefinedMacros();
218  }
219
220  return Macros.begin();
221}
222
223Preprocessor::macro_iterator
224Preprocessor::macro_end(bool IncludeExternalMacros) const {
225  if (IncludeExternalMacros && ExternalSource &&
226      !ReadMacrosFromExternalSource) {
227    ReadMacrosFromExternalSource = true;
228    ExternalSource->ReadDefinedMacros();
229  }
230
231  return Macros.end();
232}
233
234bool Preprocessor::SetCodeCompletionPoint(const FileEntry *File,
235                                          unsigned TruncateAtLine,
236                                          unsigned TruncateAtColumn) {
237  using llvm::MemoryBuffer;
238
239  CodeCompletionFile = File;
240
241  // Okay to clear out the code-completion point by passing NULL.
242  if (!CodeCompletionFile)
243    return false;
244
245  // Load the actual file's contents.
246  bool Invalid = false;
247  const MemoryBuffer *Buffer = SourceMgr.getMemoryBufferForFile(File, &Invalid);
248  if (Invalid)
249    return true;
250
251  // Find the byte position of the truncation point.
252  const char *Position = Buffer->getBufferStart();
253  for (unsigned Line = 1; Line < TruncateAtLine; ++Line) {
254    for (; *Position; ++Position) {
255      if (*Position != '\r' && *Position != '\n')
256        continue;
257
258      // Eat \r\n or \n\r as a single line.
259      if ((Position[1] == '\r' || Position[1] == '\n') &&
260          Position[0] != Position[1])
261        ++Position;
262      ++Position;
263      break;
264    }
265  }
266
267  Position += TruncateAtColumn - 1;
268
269  // Truncate the buffer.
270  if (Position < Buffer->getBufferEnd()) {
271    llvm::StringRef Data(Buffer->getBufferStart(),
272                         Position-Buffer->getBufferStart());
273    MemoryBuffer *TruncatedBuffer
274      = MemoryBuffer::getMemBufferCopy(Data, Buffer->getBufferIdentifier());
275    SourceMgr.overrideFileContents(File, TruncatedBuffer);
276  }
277
278  return false;
279}
280
281bool Preprocessor::isCodeCompletionFile(SourceLocation FileLoc) const {
282  return CodeCompletionFile && FileLoc.isFileID() &&
283    SourceMgr.getFileEntryForID(SourceMgr.getFileID(FileLoc))
284      == CodeCompletionFile;
285}
286
287void Preprocessor::CodeCompleteNaturalLanguage() {
288  SetCodeCompletionPoint(0, 0, 0);
289  getDiagnostics().setSuppressAllDiagnostics(true);
290  if (CodeComplete)
291    CodeComplete->CodeCompleteNaturalLanguage();
292}
293
294//===----------------------------------------------------------------------===//
295// Token Spelling
296//===----------------------------------------------------------------------===//
297
298/// getSpelling() - Return the 'spelling' of this token.  The spelling of a
299/// token are the characters used to represent the token in the source file
300/// after trigraph expansion and escaped-newline folding.  In particular, this
301/// wants to get the true, uncanonicalized, spelling of things like digraphs
302/// UCNs, etc.
303std::string Preprocessor::getSpelling(const Token &Tok,
304                                      const SourceManager &SourceMgr,
305                                      const LangOptions &Features,
306                                      bool *Invalid) {
307  assert((int)Tok.getLength() >= 0 && "Token character range is bogus!");
308
309  // If this token contains nothing interesting, return it directly.
310  bool CharDataInvalid = false;
311  const char* TokStart = SourceMgr.getCharacterData(Tok.getLocation(),
312                                                    &CharDataInvalid);
313  if (Invalid)
314    *Invalid = CharDataInvalid;
315  if (CharDataInvalid)
316    return std::string();
317
318  if (!Tok.needsCleaning())
319    return std::string(TokStart, TokStart+Tok.getLength());
320
321  std::string Result;
322  Result.reserve(Tok.getLength());
323
324  // Otherwise, hard case, relex the characters into the string.
325  for (const char *Ptr = TokStart, *End = TokStart+Tok.getLength();
326       Ptr != End; ) {
327    unsigned CharSize;
328    Result.push_back(Lexer::getCharAndSizeNoWarn(Ptr, CharSize, Features));
329    Ptr += CharSize;
330  }
331  assert(Result.size() != unsigned(Tok.getLength()) &&
332         "NeedsCleaning flag set on something that didn't need cleaning!");
333  return Result;
334}
335
336/// getSpelling() - Return the 'spelling' of this token.  The spelling of a
337/// token are the characters used to represent the token in the source file
338/// after trigraph expansion and escaped-newline folding.  In particular, this
339/// wants to get the true, uncanonicalized, spelling of things like digraphs
340/// UCNs, etc.
341std::string Preprocessor::getSpelling(const Token &Tok, bool *Invalid) const {
342  return getSpelling(Tok, SourceMgr, Features, Invalid);
343}
344
345/// getSpelling - This method is used to get the spelling of a token into a
346/// preallocated buffer, instead of as an std::string.  The caller is required
347/// to allocate enough space for the token, which is guaranteed to be at least
348/// Tok.getLength() bytes long.  The actual length of the token is returned.
349///
350/// Note that this method may do two possible things: it may either fill in
351/// the buffer specified with characters, or it may *change the input pointer*
352/// to point to a constant buffer with the data already in it (avoiding a
353/// copy).  The caller is not allowed to modify the returned buffer pointer
354/// if an internal buffer is returned.
355unsigned Preprocessor::getSpelling(const Token &Tok,
356                                   const char *&Buffer, bool *Invalid) const {
357  assert((int)Tok.getLength() >= 0 && "Token character range is bogus!");
358
359  // If this token is an identifier, just return the string from the identifier
360  // table, which is very quick.
361  if (const IdentifierInfo *II = Tok.getIdentifierInfo()) {
362    Buffer = II->getNameStart();
363    return II->getLength();
364  }
365
366  // Otherwise, compute the start of the token in the input lexer buffer.
367  const char *TokStart = 0;
368
369  if (Tok.isLiteral())
370    TokStart = Tok.getLiteralData();
371
372  if (TokStart == 0) {
373    bool CharDataInvalid = false;
374    TokStart = SourceMgr.getCharacterData(Tok.getLocation(), &CharDataInvalid);
375    if (Invalid)
376      *Invalid = CharDataInvalid;
377    if (CharDataInvalid) {
378      Buffer = "";
379      return 0;
380    }
381  }
382
383  // If this token contains nothing interesting, return it directly.
384  if (!Tok.needsCleaning()) {
385    Buffer = TokStart;
386    return Tok.getLength();
387  }
388
389  // Otherwise, hard case, relex the characters into the string.
390  char *OutBuf = const_cast<char*>(Buffer);
391  for (const char *Ptr = TokStart, *End = TokStart+Tok.getLength();
392       Ptr != End; ) {
393    unsigned CharSize;
394    *OutBuf++ = Lexer::getCharAndSizeNoWarn(Ptr, CharSize, Features);
395    Ptr += CharSize;
396  }
397  assert(unsigned(OutBuf-Buffer) != Tok.getLength() &&
398         "NeedsCleaning flag set on something that didn't need cleaning!");
399
400  return OutBuf-Buffer;
401}
402
403/// getSpelling - This method is used to get the spelling of a token into a
404/// SmallVector. Note that the returned StringRef may not point to the
405/// supplied buffer if a copy can be avoided.
406llvm::StringRef Preprocessor::getSpelling(const Token &Tok,
407                                          llvm::SmallVectorImpl<char> &Buffer,
408                                          bool *Invalid) const {
409  // Try the fast path.
410  if (const IdentifierInfo *II = Tok.getIdentifierInfo())
411    return II->getName();
412
413  // Resize the buffer if we need to copy into it.
414  if (Tok.needsCleaning())
415    Buffer.resize(Tok.getLength());
416
417  const char *Ptr = Buffer.data();
418  unsigned Len = getSpelling(Tok, Ptr, Invalid);
419  return llvm::StringRef(Ptr, Len);
420}
421
422/// CreateString - Plop the specified string into a scratch buffer and return a
423/// location for it.  If specified, the source location provides a source
424/// location for the token.
425void Preprocessor::CreateString(const char *Buf, unsigned Len, Token &Tok,
426                                SourceLocation InstantiationLoc) {
427  Tok.setLength(Len);
428
429  const char *DestPtr;
430  SourceLocation Loc = ScratchBuf->getToken(Buf, Len, DestPtr);
431
432  if (InstantiationLoc.isValid())
433    Loc = SourceMgr.createInstantiationLoc(Loc, InstantiationLoc,
434                                           InstantiationLoc, Len);
435  Tok.setLocation(Loc);
436
437  // If this is a literal token, set the pointer data.
438  if (Tok.isLiteral())
439    Tok.setLiteralData(DestPtr);
440}
441
442
443/// AdvanceToTokenCharacter - Given a location that specifies the start of a
444/// token, return a new location that specifies a character within the token.
445SourceLocation Preprocessor::AdvanceToTokenCharacter(SourceLocation TokStart,
446                                                     unsigned CharNo) {
447  // Figure out how many physical characters away the specified instantiation
448  // character is.  This needs to take into consideration newlines and
449  // trigraphs.
450  bool Invalid = false;
451  const char *TokPtr = SourceMgr.getCharacterData(TokStart, &Invalid);
452
453  // If they request the first char of the token, we're trivially done.
454  if (Invalid || (CharNo == 0 && Lexer::isObviouslySimpleCharacter(*TokPtr)))
455    return TokStart;
456
457  unsigned PhysOffset = 0;
458
459  // The usual case is that tokens don't contain anything interesting.  Skip
460  // over the uninteresting characters.  If a token only consists of simple
461  // chars, this method is extremely fast.
462  while (Lexer::isObviouslySimpleCharacter(*TokPtr)) {
463    if (CharNo == 0)
464      return TokStart.getFileLocWithOffset(PhysOffset);
465    ++TokPtr, --CharNo, ++PhysOffset;
466  }
467
468  // If we have a character that may be a trigraph or escaped newline, use a
469  // lexer to parse it correctly.
470  for (; CharNo; --CharNo) {
471    unsigned Size;
472    Lexer::getCharAndSizeNoWarn(TokPtr, Size, Features);
473    TokPtr += Size;
474    PhysOffset += Size;
475  }
476
477  // Final detail: if we end up on an escaped newline, we want to return the
478  // location of the actual byte of the token.  For example foo\<newline>bar
479  // advanced by 3 should return the location of b, not of \\.  One compounding
480  // detail of this is that the escape may be made by a trigraph.
481  if (!Lexer::isObviouslySimpleCharacter(*TokPtr))
482    PhysOffset += Lexer::SkipEscapedNewLines(TokPtr)-TokPtr;
483
484  return TokStart.getFileLocWithOffset(PhysOffset);
485}
486
487SourceLocation Preprocessor::getLocForEndOfToken(SourceLocation Loc,
488                                                 unsigned Offset) {
489  if (Loc.isInvalid() || !Loc.isFileID())
490    return SourceLocation();
491
492  unsigned Len = Lexer::MeasureTokenLength(Loc, getSourceManager(), Features);
493  if (Len > Offset)
494    Len = Len - Offset;
495  else
496    return Loc;
497
498  return AdvanceToTokenCharacter(Loc, Len);
499}
500
501
502
503//===----------------------------------------------------------------------===//
504// Preprocessor Initialization Methods
505//===----------------------------------------------------------------------===//
506
507
508/// EnterMainSourceFile - Enter the specified FileID as the main source file,
509/// which implicitly adds the builtin defines etc.
510void Preprocessor::EnterMainSourceFile() {
511  // We do not allow the preprocessor to reenter the main file.  Doing so will
512  // cause FileID's to accumulate information from both runs (e.g. #line
513  // information) and predefined macros aren't guaranteed to be set properly.
514  assert(NumEnteredSourceFiles == 0 && "Cannot reenter the main file!");
515  FileID MainFileID = SourceMgr.getMainFileID();
516
517  // Enter the main file source buffer.
518  EnterSourceFile(MainFileID, 0, SourceLocation());
519
520  // If we've been asked to skip bytes in the main file (e.g., as part of a
521  // precompiled preamble), do so now.
522  if (SkipMainFilePreamble.first > 0)
523    CurLexer->SkipBytes(SkipMainFilePreamble.first,
524                        SkipMainFilePreamble.second);
525
526  // Tell the header info that the main file was entered.  If the file is later
527  // #imported, it won't be re-entered.
528  if (const FileEntry *FE = SourceMgr.getFileEntryForID(MainFileID))
529    HeaderInfo.IncrementIncludeCount(FE);
530
531  // Preprocess Predefines to populate the initial preprocessor state.
532  llvm::MemoryBuffer *SB =
533    llvm::MemoryBuffer::getMemBufferCopy(Predefines, "<built-in>");
534  assert(SB && "Cannot create predefined source buffer");
535  FileID FID = SourceMgr.createFileIDForMemBuffer(SB);
536  assert(!FID.isInvalid() && "Could not create FileID for predefines?");
537
538  // Start parsing the predefines.
539  EnterSourceFile(FID, 0, SourceLocation());
540}
541
542void Preprocessor::EndSourceFile() {
543  // Notify the client that we reached the end of the source file.
544  if (Callbacks)
545    Callbacks->EndOfMainFile();
546}
547
548//===----------------------------------------------------------------------===//
549// Lexer Event Handling.
550//===----------------------------------------------------------------------===//
551
552/// LookUpIdentifierInfo - Given a tok::identifier token, look up the
553/// identifier information for the token and install it into the token.
554IdentifierInfo *Preprocessor::LookUpIdentifierInfo(Token &Identifier,
555                                                   const char *BufPtr) const {
556  assert(Identifier.is(tok::identifier) && "Not an identifier!");
557  assert(Identifier.getIdentifierInfo() == 0 && "Identinfo already exists!");
558
559  // Look up this token, see if it is a macro, or if it is a language keyword.
560  IdentifierInfo *II;
561  if (BufPtr && !Identifier.needsCleaning()) {
562    // No cleaning needed, just use the characters from the lexed buffer.
563    II = getIdentifierInfo(llvm::StringRef(BufPtr, Identifier.getLength()));
564  } else {
565    // Cleaning needed, alloca a buffer, clean into it, then use the buffer.
566    llvm::SmallString<64> IdentifierBuffer;
567    llvm::StringRef CleanedStr = getSpelling(Identifier, IdentifierBuffer);
568    II = getIdentifierInfo(CleanedStr);
569  }
570  Identifier.setIdentifierInfo(II);
571  return II;
572}
573
574
575/// HandleIdentifier - This callback is invoked when the lexer reads an
576/// identifier.  This callback looks up the identifier in the map and/or
577/// potentially macro expands it or turns it into a named token (like 'for').
578///
579/// Note that callers of this method are guarded by checking the
580/// IdentifierInfo's 'isHandleIdentifierCase' bit.  If this method changes, the
581/// IdentifierInfo methods that compute these properties will need to change to
582/// match.
583void Preprocessor::HandleIdentifier(Token &Identifier) {
584  assert(Identifier.getIdentifierInfo() &&
585         "Can't handle identifiers without identifier info!");
586
587  IdentifierInfo &II = *Identifier.getIdentifierInfo();
588
589  // If this identifier was poisoned, and if it was not produced from a macro
590  // expansion, emit an error.
591  if (II.isPoisoned() && CurPPLexer) {
592    if (&II != Ident__VA_ARGS__)   // We warn about __VA_ARGS__ with poisoning.
593      Diag(Identifier, diag::err_pp_used_poisoned_id);
594    else
595      Diag(Identifier, diag::ext_pp_bad_vaargs_use);
596  }
597
598  // If this is a macro to be expanded, do it.
599  if (MacroInfo *MI = getMacroInfo(&II)) {
600    if (!DisableMacroExpansion && !Identifier.isExpandDisabled()) {
601      if (MI->isEnabled()) {
602        if (!HandleMacroExpandedIdentifier(Identifier, MI))
603          return;
604      } else {
605        // C99 6.10.3.4p2 says that a disabled macro may never again be
606        // expanded, even if it's in a context where it could be expanded in the
607        // future.
608        Identifier.setFlag(Token::DisableExpand);
609      }
610    }
611  }
612
613  // C++ 2.11p2: If this is an alternative representation of a C++ operator,
614  // then we act as if it is the actual operator and not the textual
615  // representation of it.
616  if (II.isCPlusPlusOperatorKeyword())
617    Identifier.setIdentifierInfo(0);
618
619  // If this is an extension token, diagnose its use.
620  // We avoid diagnosing tokens that originate from macro definitions.
621  // FIXME: This warning is disabled in cases where it shouldn't be,
622  // like "#define TY typeof", "TY(1) x".
623  if (II.isExtensionToken() && !DisableMacroExpansion)
624    Diag(Identifier, diag::ext_token_used);
625}
626
627void Preprocessor::AddCommentHandler(CommentHandler *Handler) {
628  assert(Handler && "NULL comment handler");
629  assert(std::find(CommentHandlers.begin(), CommentHandlers.end(), Handler) ==
630         CommentHandlers.end() && "Comment handler already registered");
631  CommentHandlers.push_back(Handler);
632}
633
634void Preprocessor::RemoveCommentHandler(CommentHandler *Handler) {
635  std::vector<CommentHandler *>::iterator Pos
636  = std::find(CommentHandlers.begin(), CommentHandlers.end(), Handler);
637  assert(Pos != CommentHandlers.end() && "Comment handler not registered");
638  CommentHandlers.erase(Pos);
639}
640
641bool Preprocessor::HandleComment(Token &result, SourceRange Comment) {
642  bool AnyPendingTokens = false;
643  for (std::vector<CommentHandler *>::iterator H = CommentHandlers.begin(),
644       HEnd = CommentHandlers.end();
645       H != HEnd; ++H) {
646    if ((*H)->HandleComment(*this, Comment))
647      AnyPendingTokens = true;
648  }
649  if (!AnyPendingTokens || getCommentRetentionState())
650    return false;
651  Lex(result);
652  return true;
653}
654
655CommentHandler::~CommentHandler() { }
656
657CodeCompletionHandler::~CodeCompletionHandler() { }
658
659void Preprocessor::createPreprocessingRecord() {
660  if (Record)
661    return;
662
663  Record = new PreprocessingRecord;
664  addPPCallbacks(Record);
665}
666