Preprocessor.cpp revision 50f6af7a6d6951a63f3da7d4c5a7d3965bf73b63
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 const MemoryBuffer *Buffer = SourceMgr.getMemoryBufferForFile(File); 236 if (!Buffer) 237 return true; 238 239 // Find the byte position of the truncation point. 240 const char *Position = Buffer->getBufferStart(); 241 for (unsigned Line = 1; Line < TruncateAtLine; ++Line) { 242 for (; *Position; ++Position) { 243 if (*Position != '\r' && *Position != '\n') 244 continue; 245 246 // Eat \r\n or \n\r as a single line. 247 if ((Position[1] == '\r' || Position[1] == '\n') && 248 Position[0] != Position[1]) 249 ++Position; 250 ++Position; 251 break; 252 } 253 } 254 255 Position += TruncateAtColumn - 1; 256 257 // Truncate the buffer. 258 if (Position < Buffer->getBufferEnd()) { 259 MemoryBuffer *TruncatedBuffer 260 = MemoryBuffer::getMemBufferCopy(Buffer->getBufferStart(), Position, 261 Buffer->getBufferIdentifier()); 262 SourceMgr.overrideFileContents(File, TruncatedBuffer); 263 } 264 265 return false; 266} 267 268bool Preprocessor::isCodeCompletionFile(SourceLocation FileLoc) const { 269 return CodeCompletionFile && FileLoc.isFileID() && 270 SourceMgr.getFileEntryForID(SourceMgr.getFileID(FileLoc)) 271 == CodeCompletionFile; 272} 273 274//===----------------------------------------------------------------------===// 275// Token Spelling 276//===----------------------------------------------------------------------===// 277 278/// getSpelling() - Return the 'spelling' of this token. The spelling of a 279/// token are the characters used to represent the token in the source file 280/// after trigraph expansion and escaped-newline folding. In particular, this 281/// wants to get the true, uncanonicalized, spelling of things like digraphs 282/// UCNs, etc. 283std::string Preprocessor::getSpelling(const Token &Tok, 284 const SourceManager &SourceMgr, 285 const LangOptions &Features, 286 bool *Invalid) { 287 assert((int)Tok.getLength() >= 0 && "Token character range is bogus!"); 288 289 // If this token contains nothing interesting, return it directly. 290 bool CharDataInvalid = false; 291 const char* TokStart = SourceMgr.getCharacterData(Tok.getLocation(), 292 &CharDataInvalid); 293 if (Invalid) 294 *Invalid = CharDataInvalid; 295 if (CharDataInvalid) 296 return std::string(); 297 298 if (!Tok.needsCleaning()) 299 return std::string(TokStart, TokStart+Tok.getLength()); 300 301 std::string Result; 302 Result.reserve(Tok.getLength()); 303 304 // Otherwise, hard case, relex the characters into the string. 305 for (const char *Ptr = TokStart, *End = TokStart+Tok.getLength(); 306 Ptr != End; ) { 307 unsigned CharSize; 308 Result.push_back(Lexer::getCharAndSizeNoWarn(Ptr, CharSize, Features)); 309 Ptr += CharSize; 310 } 311 assert(Result.size() != unsigned(Tok.getLength()) && 312 "NeedsCleaning flag set on something that didn't need cleaning!"); 313 return Result; 314} 315 316/// getSpelling() - Return the 'spelling' of this token. The spelling of a 317/// token are the characters used to represent the token in the source file 318/// after trigraph expansion and escaped-newline folding. In particular, this 319/// wants to get the true, uncanonicalized, spelling of things like digraphs 320/// UCNs, etc. 321std::string Preprocessor::getSpelling(const Token &Tok, bool *Invalid) const { 322 return getSpelling(Tok, SourceMgr, Features, Invalid); 323} 324 325/// getSpelling - This method is used to get the spelling of a token into a 326/// preallocated buffer, instead of as an std::string. The caller is required 327/// to allocate enough space for the token, which is guaranteed to be at least 328/// Tok.getLength() bytes long. The actual length of the token is returned. 329/// 330/// Note that this method may do two possible things: it may either fill in 331/// the buffer specified with characters, or it may *change the input pointer* 332/// to point to a constant buffer with the data already in it (avoiding a 333/// copy). The caller is not allowed to modify the returned buffer pointer 334/// if an internal buffer is returned. 335unsigned Preprocessor::getSpelling(const Token &Tok, 336 const char *&Buffer, bool *Invalid) const { 337 assert((int)Tok.getLength() >= 0 && "Token character range is bogus!"); 338 339 // If this token is an identifier, just return the string from the identifier 340 // table, which is very quick. 341 if (const IdentifierInfo *II = Tok.getIdentifierInfo()) { 342 Buffer = II->getNameStart(); 343 return II->getLength(); 344 } 345 346 // Otherwise, compute the start of the token in the input lexer buffer. 347 const char *TokStart = 0; 348 349 if (Tok.isLiteral()) 350 TokStart = Tok.getLiteralData(); 351 352 if (TokStart == 0) { 353 bool CharDataInvalid = false; 354 TokStart = SourceMgr.getCharacterData(Tok.getLocation(), &CharDataInvalid); 355 if (Invalid) 356 *Invalid = CharDataInvalid; 357 if (CharDataInvalid) { 358 Buffer = ""; 359 return 0; 360 } 361 } 362 363 // If this token contains nothing interesting, return it directly. 364 if (!Tok.needsCleaning()) { 365 Buffer = TokStart; 366 return Tok.getLength(); 367 } 368 369 // Otherwise, hard case, relex the characters into the string. 370 char *OutBuf = const_cast<char*>(Buffer); 371 for (const char *Ptr = TokStart, *End = TokStart+Tok.getLength(); 372 Ptr != End; ) { 373 unsigned CharSize; 374 *OutBuf++ = Lexer::getCharAndSizeNoWarn(Ptr, CharSize, Features); 375 Ptr += CharSize; 376 } 377 assert(unsigned(OutBuf-Buffer) != Tok.getLength() && 378 "NeedsCleaning flag set on something that didn't need cleaning!"); 379 380 return OutBuf-Buffer; 381} 382 383/// getSpelling - This method is used to get the spelling of a token into a 384/// SmallVector. Note that the returned StringRef may not point to the 385/// supplied buffer if a copy can be avoided. 386llvm::StringRef Preprocessor::getSpelling(const Token &Tok, 387 llvm::SmallVectorImpl<char> &Buffer, 388 bool *Invalid) const { 389 // Try the fast path. 390 if (const IdentifierInfo *II = Tok.getIdentifierInfo()) 391 return II->getName(); 392 393 // Resize the buffer if we need to copy into it. 394 if (Tok.needsCleaning()) 395 Buffer.resize(Tok.getLength()); 396 397 const char *Ptr = Buffer.data(); 398 unsigned Len = getSpelling(Tok, Ptr, Invalid); 399 return llvm::StringRef(Ptr, Len); 400} 401 402/// CreateString - Plop the specified string into a scratch buffer and return a 403/// location for it. If specified, the source location provides a source 404/// location for the token. 405void Preprocessor::CreateString(const char *Buf, unsigned Len, Token &Tok, 406 SourceLocation InstantiationLoc) { 407 Tok.setLength(Len); 408 409 const char *DestPtr; 410 SourceLocation Loc = ScratchBuf->getToken(Buf, Len, DestPtr); 411 412 if (InstantiationLoc.isValid()) 413 Loc = SourceMgr.createInstantiationLoc(Loc, InstantiationLoc, 414 InstantiationLoc, Len); 415 Tok.setLocation(Loc); 416 417 // If this is a literal token, set the pointer data. 418 if (Tok.isLiteral()) 419 Tok.setLiteralData(DestPtr); 420} 421 422 423/// AdvanceToTokenCharacter - Given a location that specifies the start of a 424/// token, return a new location that specifies a character within the token. 425SourceLocation Preprocessor::AdvanceToTokenCharacter(SourceLocation TokStart, 426 unsigned CharNo) { 427 // Figure out how many physical characters away the specified instantiation 428 // character is. This needs to take into consideration newlines and 429 // trigraphs. 430 const char *TokPtr = SourceMgr.getCharacterData(TokStart); 431 432 // If they request the first char of the token, we're trivially done. 433 if (CharNo == 0 && Lexer::isObviouslySimpleCharacter(*TokPtr)) 434 return TokStart; 435 436 unsigned PhysOffset = 0; 437 438 // The usual case is that tokens don't contain anything interesting. Skip 439 // over the uninteresting characters. If a token only consists of simple 440 // chars, this method is extremely fast. 441 while (Lexer::isObviouslySimpleCharacter(*TokPtr)) { 442 if (CharNo == 0) 443 return TokStart.getFileLocWithOffset(PhysOffset); 444 ++TokPtr, --CharNo, ++PhysOffset; 445 } 446 447 // If we have a character that may be a trigraph or escaped newline, use a 448 // lexer to parse it correctly. 449 for (; CharNo; --CharNo) { 450 unsigned Size; 451 Lexer::getCharAndSizeNoWarn(TokPtr, Size, Features); 452 TokPtr += Size; 453 PhysOffset += Size; 454 } 455 456 // Final detail: if we end up on an escaped newline, we want to return the 457 // location of the actual byte of the token. For example foo\<newline>bar 458 // advanced by 3 should return the location of b, not of \\. One compounding 459 // detail of this is that the escape may be made by a trigraph. 460 if (!Lexer::isObviouslySimpleCharacter(*TokPtr)) 461 PhysOffset += Lexer::SkipEscapedNewLines(TokPtr)-TokPtr; 462 463 return TokStart.getFileLocWithOffset(PhysOffset); 464} 465 466SourceLocation Preprocessor::getLocForEndOfToken(SourceLocation Loc, 467 unsigned Offset) { 468 if (Loc.isInvalid() || !Loc.isFileID()) 469 return SourceLocation(); 470 471 unsigned Len = Lexer::MeasureTokenLength(Loc, getSourceManager(), Features); 472 if (Len > Offset) 473 Len = Len - Offset; 474 else 475 return Loc; 476 477 return AdvanceToTokenCharacter(Loc, Len); 478} 479 480 481 482//===----------------------------------------------------------------------===// 483// Preprocessor Initialization Methods 484//===----------------------------------------------------------------------===// 485 486 487/// EnterMainSourceFile - Enter the specified FileID as the main source file, 488/// which implicitly adds the builtin defines etc. 489void Preprocessor::EnterMainSourceFile() { 490 // We do not allow the preprocessor to reenter the main file. Doing so will 491 // cause FileID's to accumulate information from both runs (e.g. #line 492 // information) and predefined macros aren't guaranteed to be set properly. 493 assert(NumEnteredSourceFiles == 0 && "Cannot reenter the main file!"); 494 FileID MainFileID = SourceMgr.getMainFileID(); 495 496 // Enter the main file source buffer. 497 std::string ErrorStr; 498 bool Res = EnterSourceFile(MainFileID, 0, ErrorStr); 499 assert(!Res && "Entering main file should not fail!"); 500 501 // Tell the header info that the main file was entered. If the file is later 502 // #imported, it won't be re-entered. 503 if (const FileEntry *FE = SourceMgr.getFileEntryForID(MainFileID)) 504 HeaderInfo.IncrementIncludeCount(FE); 505 506 // Preprocess Predefines to populate the initial preprocessor state. 507 llvm::MemoryBuffer *SB = 508 llvm::MemoryBuffer::getMemBufferCopy(Predefines.data(), 509 Predefines.data() + Predefines.size(), 510 "<built-in>"); 511 assert(SB && "Cannot fail to create predefined source buffer"); 512 FileID FID = SourceMgr.createFileIDForMemBuffer(SB); 513 assert(!FID.isInvalid() && "Could not create FileID for predefines?"); 514 515 // Start parsing the predefines. 516 Res = EnterSourceFile(FID, 0, ErrorStr); 517 assert(!Res && "Entering predefines should not fail!"); 518} 519 520 521//===----------------------------------------------------------------------===// 522// Lexer Event Handling. 523//===----------------------------------------------------------------------===// 524 525/// LookUpIdentifierInfo - Given a tok::identifier token, look up the 526/// identifier information for the token and install it into the token. 527IdentifierInfo *Preprocessor::LookUpIdentifierInfo(Token &Identifier, 528 const char *BufPtr) const { 529 assert(Identifier.is(tok::identifier) && "Not an identifier!"); 530 assert(Identifier.getIdentifierInfo() == 0 && "Identinfo already exists!"); 531 532 // Look up this token, see if it is a macro, or if it is a language keyword. 533 IdentifierInfo *II; 534 if (BufPtr && !Identifier.needsCleaning()) { 535 // No cleaning needed, just use the characters from the lexed buffer. 536 II = getIdentifierInfo(llvm::StringRef(BufPtr, Identifier.getLength())); 537 } else { 538 // Cleaning needed, alloca a buffer, clean into it, then use the buffer. 539 llvm::SmallString<64> IdentifierBuffer; 540 llvm::StringRef CleanedStr = getSpelling(Identifier, IdentifierBuffer); 541 II = getIdentifierInfo(CleanedStr); 542 } 543 Identifier.setIdentifierInfo(II); 544 return II; 545} 546 547 548/// HandleIdentifier - This callback is invoked when the lexer reads an 549/// identifier. This callback looks up the identifier in the map and/or 550/// potentially macro expands it or turns it into a named token (like 'for'). 551/// 552/// Note that callers of this method are guarded by checking the 553/// IdentifierInfo's 'isHandleIdentifierCase' bit. If this method changes, the 554/// IdentifierInfo methods that compute these properties will need to change to 555/// match. 556void Preprocessor::HandleIdentifier(Token &Identifier) { 557 assert(Identifier.getIdentifierInfo() && 558 "Can't handle identifiers without identifier info!"); 559 560 IdentifierInfo &II = *Identifier.getIdentifierInfo(); 561 562 // If this identifier was poisoned, and if it was not produced from a macro 563 // expansion, emit an error. 564 if (II.isPoisoned() && CurPPLexer) { 565 if (&II != Ident__VA_ARGS__) // We warn about __VA_ARGS__ with poisoning. 566 Diag(Identifier, diag::err_pp_used_poisoned_id); 567 else 568 Diag(Identifier, diag::ext_pp_bad_vaargs_use); 569 } 570 571 // If this is a macro to be expanded, do it. 572 if (MacroInfo *MI = getMacroInfo(&II)) { 573 if (!DisableMacroExpansion && !Identifier.isExpandDisabled()) { 574 if (MI->isEnabled()) { 575 if (!HandleMacroExpandedIdentifier(Identifier, MI)) 576 return; 577 } else { 578 // C99 6.10.3.4p2 says that a disabled macro may never again be 579 // expanded, even if it's in a context where it could be expanded in the 580 // future. 581 Identifier.setFlag(Token::DisableExpand); 582 } 583 } 584 } 585 586 // C++ 2.11p2: If this is an alternative representation of a C++ operator, 587 // then we act as if it is the actual operator and not the textual 588 // representation of it. 589 if (II.isCPlusPlusOperatorKeyword()) 590 Identifier.setIdentifierInfo(0); 591 592 // If this is an extension token, diagnose its use. 593 // We avoid diagnosing tokens that originate from macro definitions. 594 // FIXME: This warning is disabled in cases where it shouldn't be, 595 // like "#define TY typeof", "TY(1) x". 596 if (II.isExtensionToken() && !DisableMacroExpansion) 597 Diag(Identifier, diag::ext_token_used); 598} 599 600void Preprocessor::AddCommentHandler(CommentHandler *Handler) { 601 assert(Handler && "NULL comment handler"); 602 assert(std::find(CommentHandlers.begin(), CommentHandlers.end(), Handler) == 603 CommentHandlers.end() && "Comment handler already registered"); 604 CommentHandlers.push_back(Handler); 605} 606 607void Preprocessor::RemoveCommentHandler(CommentHandler *Handler) { 608 std::vector<CommentHandler *>::iterator Pos 609 = std::find(CommentHandlers.begin(), CommentHandlers.end(), Handler); 610 assert(Pos != CommentHandlers.end() && "Comment handler not registered"); 611 CommentHandlers.erase(Pos); 612} 613 614bool Preprocessor::HandleComment(Token &result, SourceRange Comment) { 615 bool AnyPendingTokens = false; 616 for (std::vector<CommentHandler *>::iterator H = CommentHandlers.begin(), 617 HEnd = CommentHandlers.end(); 618 H != HEnd; ++H) { 619 if ((*H)->HandleComment(*this, Comment)) 620 AnyPendingTokens = true; 621 } 622 if (!AnyPendingTokens || getCommentRetentionState()) 623 return false; 624 Lex(result); 625 return true; 626} 627 628CommentHandler::~CommentHandler() { } 629