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