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