-//===--- MacroExpansion.cpp - Top level Macro Expansion -------------------===//\r
-//\r
-// The LLVM Compiler Infrastructure\r
-//\r
-// This file is distributed under the University of Illinois Open Source\r
-// License. See LICENSE.TXT for details.\r
-//\r
-//===----------------------------------------------------------------------===//\r
-//\r
-// This file implements the top level handling of macro expasion for the\r
-// preprocessor.\r
-//\r
-//===----------------------------------------------------------------------===//\r
-\r
-#include "clang/Lex/Preprocessor.h"\r
-#include "MacroArgs.h"\r
-#include "clang/Lex/MacroInfo.h"\r
-#include "clang/Basic/SourceManager.h"\r
-#include "clang/Basic/FileManager.h"\r
-#include "clang/Basic/TargetInfo.h"\r
-#include "clang/Lex/LexDiagnostic.h"\r
-#include "clang/Lex/CodeCompletionHandler.h"\r
-#include "clang/Lex/ExternalPreprocessorSource.h"\r
-#include "clang/Lex/LiteralSupport.h"\r
-#include "llvm/ADT/StringSwitch.h"\r
-#include "llvm/ADT/STLExtras.h"\r
-#include "llvm/Config/llvm-config.h"\r
-#include "llvm/Support/raw_ostream.h"\r
-#include "llvm/Support/ErrorHandling.h"\r
-#include <cstdio>\r
-#include <ctime>\r
-using namespace clang;\r
-\r
-MacroInfo *Preprocessor::getInfoForMacro(IdentifierInfo *II) const {\r
- assert(II->hasMacroDefinition() && "Identifier is not a macro!");\r
-\r
- macro_iterator Pos = Macros.find(II);\r
- if (Pos == Macros.end()) {\r
- // Load this macro from the external source.\r
- getExternalSource()->LoadMacroDefinition(II);\r
- Pos = Macros.find(II);\r
- }\r
- assert(Pos != Macros.end() && "Identifier macro info is missing!");\r
- assert(Pos->second->getUndefLoc().isInvalid() && "Macro is undefined!");\r
- return Pos->second;\r
-}\r
-\r
-/// setMacroInfo - Specify a macro for this identifier.\r
-///\r
-void Preprocessor::setMacroInfo(IdentifierInfo *II, MacroInfo *MI,\r
- bool LoadedFromAST) {\r
- assert(MI && "MacroInfo should be non-zero!");\r
- MI->setPreviousDefinition(Macros[II]);\r
- Macros[II] = MI;\r
- II->setHasMacroDefinition(true);\r
- if (II->isFromAST() && !LoadedFromAST)\r
- II->setChangedSinceDeserialization();\r
-}\r
-\r
-/// \brief Undefine a macro for this identifier.\r
-void Preprocessor::clearMacroInfo(IdentifierInfo *II) {\r
- assert(II->hasMacroDefinition() && "Macro is not defined!");\r
- assert(Macros[II]->getUndefLoc().isValid() && "Macro is still defined!");\r
- II->setHasMacroDefinition(false);\r
- if (II->isFromAST())\r
- II->setChangedSinceDeserialization();\r
-}\r
-\r
-/// RegisterBuiltinMacro - Register the specified identifier in the identifier\r
-/// table and mark it as a builtin macro to be expanded.\r
-static IdentifierInfo *RegisterBuiltinMacro(Preprocessor &PP, const char *Name){\r
- // Get the identifier.\r
- IdentifierInfo *Id = PP.getIdentifierInfo(Name);\r
-\r
- // Mark it as being a macro that is builtin.\r
- MacroInfo *MI = PP.AllocateMacroInfo(SourceLocation());\r
- MI->setIsBuiltinMacro();\r
- PP.setMacroInfo(Id, MI);\r
- return Id;\r
-}\r
-\r
-\r
-/// RegisterBuiltinMacros - Register builtin macros, such as __LINE__ with the\r
-/// identifier table.\r
-void Preprocessor::RegisterBuiltinMacros() {\r
- Ident__LINE__ = RegisterBuiltinMacro(*this, "__LINE__");\r
- Ident__FILE__ = RegisterBuiltinMacro(*this, "__FILE__");\r
- Ident__DATE__ = RegisterBuiltinMacro(*this, "__DATE__");\r
- Ident__TIME__ = RegisterBuiltinMacro(*this, "__TIME__");\r
- Ident__COUNTER__ = RegisterBuiltinMacro(*this, "__COUNTER__");\r
- Ident_Pragma = RegisterBuiltinMacro(*this, "_Pragma");\r
-\r
- // GCC Extensions.\r
- Ident__BASE_FILE__ = RegisterBuiltinMacro(*this, "__BASE_FILE__");\r
- Ident__INCLUDE_LEVEL__ = RegisterBuiltinMacro(*this, "__INCLUDE_LEVEL__");\r
- Ident__TIMESTAMP__ = RegisterBuiltinMacro(*this, "__TIMESTAMP__");\r
-\r
- // Clang Extensions.\r
- Ident__has_feature = RegisterBuiltinMacro(*this, "__has_feature");\r
- Ident__has_extension = RegisterBuiltinMacro(*this, "__has_extension");\r
- Ident__has_builtin = RegisterBuiltinMacro(*this, "__has_builtin");\r
- Ident__has_attribute = RegisterBuiltinMacro(*this, "__has_attribute");\r
- Ident__has_include = RegisterBuiltinMacro(*this, "__has_include");\r
- Ident__has_include_next = RegisterBuiltinMacro(*this, "__has_include_next");\r
- Ident__has_warning = RegisterBuiltinMacro(*this, "__has_warning");\r
-\r
- // Microsoft Extensions.\r
- if (LangOpts.MicrosoftExt) \r
- Ident__pragma = RegisterBuiltinMacro(*this, "__pragma");\r
- else\r
- Ident__pragma = 0;\r
-}\r
-\r
-/// isTrivialSingleTokenExpansion - Return true if MI, which has a single token\r
-/// in its expansion, currently expands to that token literally.\r
-static bool isTrivialSingleTokenExpansion(const MacroInfo *MI,\r
- const IdentifierInfo *MacroIdent,\r
- Preprocessor &PP) {\r
- IdentifierInfo *II = MI->getReplacementToken(0).getIdentifierInfo();\r
-\r
- // If the token isn't an identifier, it's always literally expanded.\r
- if (II == 0) return true;\r
-\r
- // If the information about this identifier is out of date, update it from\r
- // the external source.\r
- if (II->isOutOfDate())\r
- PP.getExternalSource()->updateOutOfDateIdentifier(*II);\r
-\r
- // If the identifier is a macro, and if that macro is enabled, it may be\r
- // expanded so it's not a trivial expansion.\r
- if (II->hasMacroDefinition() && PP.getMacroInfo(II)->isEnabled() &&\r
- // Fast expanding "#define X X" is ok, because X would be disabled.\r
- II != MacroIdent)\r
- return false;\r
-\r
- // If this is an object-like macro invocation, it is safe to trivially expand\r
- // it.\r
- if (MI->isObjectLike()) return true;\r
-\r
- // If this is a function-like macro invocation, it's safe to trivially expand\r
- // as long as the identifier is not a macro argument.\r
- for (MacroInfo::arg_iterator I = MI->arg_begin(), E = MI->arg_end();\r
- I != E; ++I)\r
- if (*I == II)\r
- return false; // Identifier is a macro argument.\r
-\r
- return true;\r
-}\r
-\r
-\r
-/// isNextPPTokenLParen - Determine whether the next preprocessor token to be\r
-/// lexed is a '('. If so, consume the token and return true, if not, this\r
-/// method should have no observable side-effect on the lexed tokens.\r
-bool Preprocessor::isNextPPTokenLParen() {\r
- // Do some quick tests for rejection cases.\r
- unsigned Val;\r
- if (CurLexer)\r
- Val = CurLexer->isNextPPTokenLParen();\r
- else if (CurPTHLexer)\r
- Val = CurPTHLexer->isNextPPTokenLParen();\r
- else\r
- Val = CurTokenLexer->isNextTokenLParen();\r
-\r
- if (Val == 2) {\r
- // We have run off the end. If it's a source file we don't\r
- // examine enclosing ones (C99 5.1.1.2p4). Otherwise walk up the\r
- // macro stack.\r
- if (CurPPLexer)\r
- return false;\r
- for (unsigned i = IncludeMacroStack.size(); i != 0; --i) {\r
- IncludeStackInfo &Entry = IncludeMacroStack[i-1];\r
- if (Entry.TheLexer)\r
- Val = Entry.TheLexer->isNextPPTokenLParen();\r
- else if (Entry.ThePTHLexer)\r
- Val = Entry.ThePTHLexer->isNextPPTokenLParen();\r
- else\r
- Val = Entry.TheTokenLexer->isNextTokenLParen();\r
-\r
- if (Val != 2)\r
- break;\r
-\r
- // Ran off the end of a source file?\r
- if (Entry.ThePPLexer)\r
- return false;\r
- }\r
- }\r
-\r
- // Okay, if we know that the token is a '(', lex it and return. Otherwise we\r
- // have found something that isn't a '(' or we found the end of the\r
- // translation unit. In either case, return false.\r
- return Val == 1;\r
-}\r
-\r
-/// HandleMacroExpandedIdentifier - If an identifier token is read that is to be\r
-/// expanded as a macro, handle it and return the next token as 'Identifier'.\r
-bool Preprocessor::HandleMacroExpandedIdentifier(Token &Identifier,\r
- MacroInfo *MI) {\r
- // If this is a macro expansion in the "#if !defined(x)" line for the file,\r
- // then the macro could expand to different things in other contexts, we need\r
- // to disable the optimization in this case.\r
- if (CurPPLexer) CurPPLexer->MIOpt.ExpandedMacro();\r
-\r
- // If this is a builtin macro, like __LINE__ or _Pragma, handle it specially.\r
- if (MI->isBuiltinMacro()) {\r
- if (Callbacks) Callbacks->MacroExpands(Identifier, MI,\r
- Identifier.getLocation());\r
- ExpandBuiltinMacro(Identifier);\r
- return false;\r
- }\r
-\r
- /// Args - If this is a function-like macro expansion, this contains,\r
- /// for each macro argument, the list of tokens that were provided to the\r
- /// invocation.\r
- MacroArgs *Args = 0;\r
-\r
- // Remember where the end of the expansion occurred. For an object-like\r
- // macro, this is the identifier. For a function-like macro, this is the ')'.\r
- SourceLocation ExpansionEnd = Identifier.getLocation();\r
-\r
- // If this is a function-like macro, read the arguments.\r
- if (MI->isFunctionLike()) {\r
- // C99 6.10.3p10: If the preprocessing token immediately after the macro\r
- // name isn't a '(', this macro should not be expanded.\r
- if (!isNextPPTokenLParen())\r
- return true;\r
-\r
- // Remember that we are now parsing the arguments to a macro invocation.\r
- // Preprocessor directives used inside macro arguments are not portable, and\r
- // this enables the warning.\r
- InMacroArgs = true;\r
- Args = ReadFunctionLikeMacroArgs(Identifier, MI, ExpansionEnd);\r
-\r
- // Finished parsing args.\r
- InMacroArgs = false;\r
-\r
- // If there was an error parsing the arguments, bail out.\r
- if (Args == 0) return false;\r
-\r
- ++NumFnMacroExpanded;\r
- } else {\r
- ++NumMacroExpanded;\r
- }\r
-\r
- // Notice that this macro has been used.\r
- markMacroAsUsed(MI);\r
-\r
- // Remember where the token is expanded.\r
- SourceLocation ExpandLoc = Identifier.getLocation();\r
- SourceRange ExpansionRange(ExpandLoc, ExpansionEnd);\r
-\r
- if (Callbacks) {\r
- if (InMacroArgs) {\r
- // We can have macro expansion inside a conditional directive while\r
- // reading the function macro arguments. To ensure, in that case, that\r
- // MacroExpands callbacks still happen in source order, queue this\r
- // callback to have it happen after the function macro callback.\r
- DelayedMacroExpandsCallbacks.push_back(\r
- MacroExpandsInfo(Identifier, MI, ExpansionRange));\r
- } else {\r
- Callbacks->MacroExpands(Identifier, MI, ExpansionRange);\r
- if (!DelayedMacroExpandsCallbacks.empty()) {\r
- for (unsigned i=0, e = DelayedMacroExpandsCallbacks.size(); i!=e; ++i) {\r
- MacroExpandsInfo &Info = DelayedMacroExpandsCallbacks[i];\r
- Callbacks->MacroExpands(Info.Tok, Info.MI, Info.Range);\r
- }\r
- DelayedMacroExpandsCallbacks.clear();\r
- }\r
- }\r
- }\r
- \r
- // If we started lexing a macro, enter the macro expansion body.\r
-\r
- // If this macro expands to no tokens, don't bother to push it onto the\r
- // expansion stack, only to take it right back off.\r
- if (MI->getNumTokens() == 0) {\r
- // No need for arg info.\r
- if (Args) Args->destroy(*this);\r
-\r
- // Ignore this macro use, just return the next token in the current\r
- // buffer.\r
- bool HadLeadingSpace = Identifier.hasLeadingSpace();\r
- bool IsAtStartOfLine = Identifier.isAtStartOfLine();\r
-\r
- Lex(Identifier);\r
-\r
- // If the identifier isn't on some OTHER line, inherit the leading\r
- // whitespace/first-on-a-line property of this token. This handles\r
- // stuff like "! XX," -> "! ," and " XX," -> " ,", when XX is\r
- // empty.\r
- if (!Identifier.isAtStartOfLine()) {\r
- if (IsAtStartOfLine) Identifier.setFlag(Token::StartOfLine);\r
- if (HadLeadingSpace) Identifier.setFlag(Token::LeadingSpace);\r
- }\r
- Identifier.setFlag(Token::LeadingEmptyMacro);\r
- ++NumFastMacroExpanded;\r
- return false;\r
-\r
- } else if (MI->getNumTokens() == 1 &&\r
- isTrivialSingleTokenExpansion(MI, Identifier.getIdentifierInfo(),\r
- *this)) {\r
- // Otherwise, if this macro expands into a single trivially-expanded\r
- // token: expand it now. This handles common cases like\r
- // "#define VAL 42".\r
-\r
- // No need for arg info.\r
- if (Args) Args->destroy(*this);\r
-\r
- // Propagate the isAtStartOfLine/hasLeadingSpace markers of the macro\r
- // identifier to the expanded token.\r
- bool isAtStartOfLine = Identifier.isAtStartOfLine();\r
- bool hasLeadingSpace = Identifier.hasLeadingSpace();\r
-\r
- // Replace the result token.\r
- Identifier = MI->getReplacementToken(0);\r
-\r
- // Restore the StartOfLine/LeadingSpace markers.\r
- Identifier.setFlagValue(Token::StartOfLine , isAtStartOfLine);\r
- Identifier.setFlagValue(Token::LeadingSpace, hasLeadingSpace);\r
-\r
- // Update the tokens location to include both its expansion and physical\r
- // locations.\r
- SourceLocation Loc =\r
- SourceMgr.createExpansionLoc(Identifier.getLocation(), ExpandLoc,\r
- ExpansionEnd,Identifier.getLength());\r
- Identifier.setLocation(Loc);\r
-\r
- // If this is a disabled macro or #define X X, we must mark the result as\r
- // unexpandable.\r
- if (IdentifierInfo *NewII = Identifier.getIdentifierInfo()) {\r
- if (MacroInfo *NewMI = getMacroInfo(NewII))\r
- if (!NewMI->isEnabled() || NewMI == MI) {\r
- Identifier.setFlag(Token::DisableExpand);\r
- Diag(Identifier, diag::pp_disabled_macro_expansion);\r
- }\r
- }\r
-\r
- // Since this is not an identifier token, it can't be macro expanded, so\r
- // we're done.\r
- ++NumFastMacroExpanded;\r
- return false;\r
- }\r
-\r
- // Start expanding the macro.\r
- EnterMacro(Identifier, ExpansionEnd, MI, Args);\r
-\r
- // Now that the macro is at the top of the include stack, ask the\r
- // preprocessor to read the next token from it.\r
- Lex(Identifier);\r
- return false;\r
-}\r
-\r
-/// ReadFunctionLikeMacroArgs - After reading "MACRO" and knowing that the next\r
-/// token is the '(' of the macro, this method is invoked to read all of the\r
-/// actual arguments specified for the macro invocation. This returns null on\r
-/// error.\r
-MacroArgs *Preprocessor::ReadFunctionLikeMacroArgs(Token &MacroName,\r
- MacroInfo *MI,\r
- SourceLocation &MacroEnd) {\r
- // The number of fixed arguments to parse.\r
- unsigned NumFixedArgsLeft = MI->getNumArgs();\r
- bool isVariadic = MI->isVariadic();\r
-\r
- // Outer loop, while there are more arguments, keep reading them.\r
- Token Tok;\r
-\r
- // Read arguments as unexpanded tokens. This avoids issues, e.g., where\r
- // an argument value in a macro could expand to ',' or '(' or ')'.\r
- LexUnexpandedToken(Tok);\r
- assert(Tok.is(tok::l_paren) && "Error computing l-paren-ness?");\r
-\r
- // ArgTokens - Build up a list of tokens that make up each argument. Each\r
- // argument is separated by an EOF token. Use a SmallVector so we can avoid\r
- // heap allocations in the common case.\r
- SmallVector<Token, 64> ArgTokens;\r
-\r
- unsigned NumActuals = 0;\r
- while (Tok.isNot(tok::r_paren)) {\r
- assert((Tok.is(tok::l_paren) || Tok.is(tok::comma)) &&\r
- "only expect argument separators here");\r
-\r
- unsigned ArgTokenStart = ArgTokens.size();\r
- SourceLocation ArgStartLoc = Tok.getLocation();\r
-\r
- // C99 6.10.3p11: Keep track of the number of l_parens we have seen. Note\r
- // that we already consumed the first one.\r
- unsigned NumParens = 0;\r
-\r
- while (1) {\r
- // Read arguments as unexpanded tokens. This avoids issues, e.g., where\r
- // an argument value in a macro could expand to ',' or '(' or ')'.\r
- LexUnexpandedToken(Tok);\r
-\r
- if (Tok.is(tok::eof) || Tok.is(tok::eod)) { // "#if f(<eof>" & "#if f(\n"\r
- Diag(MacroName, diag::err_unterm_macro_invoc);\r
- // Do not lose the EOF/EOD. Return it to the client.\r
- MacroName = Tok;\r
- return 0;\r
- } else if (Tok.is(tok::r_paren)) {\r
- // If we found the ) token, the macro arg list is done.\r
- if (NumParens-- == 0) {\r
- MacroEnd = Tok.getLocation();\r
- break;\r
- }\r
- } else if (Tok.is(tok::l_paren)) {\r
- ++NumParens;\r
- // In Microsoft-compatibility mode, commas from nested macro expan-\r
- // sions should not be considered as argument separators. We test\r
- // for this with the IgnoredComma token flag.\r
- } else if (Tok.is(tok::comma)\r
- && !(Tok.getFlags() & Token::IgnoredComma) && NumParens == 0) {\r
- // Comma ends this argument if there are more fixed arguments expected.\r
- // However, if this is a variadic macro, and this is part of the\r
- // variadic part, then the comma is just an argument token.\r
- if (!isVariadic) break;\r
- if (NumFixedArgsLeft > 1)\r
- break;\r
- } else if (Tok.is(tok::comment) && !KeepMacroComments) {\r
- // If this is a comment token in the argument list and we're just in\r
- // -C mode (not -CC mode), discard the comment.\r
- continue;\r
- } else if (Tok.getIdentifierInfo() != 0) {\r
- // Reading macro arguments can cause macros that we are currently\r
- // expanding from to be popped off the expansion stack. Doing so causes\r
- // them to be reenabled for expansion. Here we record whether any\r
- // identifiers we lex as macro arguments correspond to disabled macros.\r
- // If so, we mark the token as noexpand. This is a subtle aspect of\r
- // C99 6.10.3.4p2.\r
- if (MacroInfo *MI = getMacroInfo(Tok.getIdentifierInfo()))\r
- if (!MI->isEnabled())\r
- Tok.setFlag(Token::DisableExpand);\r
- } else if (Tok.is(tok::code_completion)) {\r
- if (CodeComplete)\r
- CodeComplete->CodeCompleteMacroArgument(MacroName.getIdentifierInfo(),\r
- MI, NumActuals);\r
- // Don't mark that we reached the code-completion point because the\r
- // parser is going to handle the token and there will be another\r
- // code-completion callback.\r
- }\r
-\r
- ArgTokens.push_back(Tok);\r
- }\r
-\r
- // If this was an empty argument list foo(), don't add this as an empty\r
- // argument.\r
- if (ArgTokens.empty() && Tok.getKind() == tok::r_paren)\r
- break;\r
-\r
- // If this is not a variadic macro, and too many args were specified, emit\r
- // an error.\r
- if (!isVariadic && NumFixedArgsLeft == 0) {\r
- if (ArgTokens.size() != ArgTokenStart)\r
- ArgStartLoc = ArgTokens[ArgTokenStart].getLocation();\r
-\r
- // Emit the diagnostic at the macro name in case there is a missing ).\r
- // Emitting it at the , could be far away from the macro name.\r
- Diag(ArgStartLoc, diag::err_too_many_args_in_macro_invoc);\r
- return 0;\r
- }\r
-\r
- // Empty arguments are standard in C99 and C++0x, and are supported as an extension in\r
- // other modes.\r
- if (ArgTokens.size() == ArgTokenStart && !LangOpts.C99)\r
- Diag(Tok, LangOpts.CPlusPlus0x ?\r
- diag::warn_cxx98_compat_empty_fnmacro_arg :\r
- diag::ext_empty_fnmacro_arg);\r
-\r
- // Add a marker EOF token to the end of the token list for this argument.\r
- Token EOFTok;\r
- EOFTok.startToken();\r
- EOFTok.setKind(tok::eof);\r
- EOFTok.setLocation(Tok.getLocation());\r
- EOFTok.setLength(0);\r
- ArgTokens.push_back(EOFTok);\r
- ++NumActuals;\r
- assert(NumFixedArgsLeft != 0 && "Too many arguments parsed");\r
- --NumFixedArgsLeft;\r
- }\r
-\r
- // Okay, we either found the r_paren. Check to see if we parsed too few\r
- // arguments.\r
- unsigned MinArgsExpected = MI->getNumArgs();\r
-\r
- // See MacroArgs instance var for description of this.\r
- bool isVarargsElided = false;\r
-\r
- if (NumActuals < MinArgsExpected) {\r
- // There are several cases where too few arguments is ok, handle them now.\r
- if (NumActuals == 0 && MinArgsExpected == 1) {\r
- // #define A(X) or #define A(...) ---> A()\r
-\r
- // If there is exactly one argument, and that argument is missing,\r
- // then we have an empty "()" argument empty list. This is fine, even if\r
- // the macro expects one argument (the argument is just empty).\r
- isVarargsElided = MI->isVariadic();\r
- } else if (MI->isVariadic() &&\r
- (NumActuals+1 == MinArgsExpected || // A(x, ...) -> A(X)\r
- (NumActuals == 0 && MinArgsExpected == 2))) {// A(x,...) -> A()\r
- // Varargs where the named vararg parameter is missing: OK as extension.\r
- // #define A(x, ...)\r
- // A("blah")\r
- Diag(Tok, diag::ext_missing_varargs_arg);\r
- Diag(MI->getDefinitionLoc(), diag::note_macro_here)\r
- << MacroName.getIdentifierInfo();\r
-\r
- // Remember this occurred, allowing us to elide the comma when used for\r
- // cases like:\r
- // #define A(x, foo...) blah(a, ## foo)\r
- // #define B(x, ...) blah(a, ## __VA_ARGS__)\r
- // #define C(...) blah(a, ## __VA_ARGS__)\r
- // A(x) B(x) C()\r
- isVarargsElided = true;\r
- } else {\r
- // Otherwise, emit the error.\r
- Diag(Tok, diag::err_too_few_args_in_macro_invoc);\r
- return 0;\r
- }\r
-\r
- // Add a marker EOF token to the end of the token list for this argument.\r
- SourceLocation EndLoc = Tok.getLocation();\r
- Tok.startToken();\r
- Tok.setKind(tok::eof);\r
- Tok.setLocation(EndLoc);\r
- Tok.setLength(0);\r
- ArgTokens.push_back(Tok);\r
-\r
- // If we expect two arguments, add both as empty.\r
- if (NumActuals == 0 && MinArgsExpected == 2)\r
- ArgTokens.push_back(Tok);\r
-\r
- } else if (NumActuals > MinArgsExpected && !MI->isVariadic()) {\r
- // Emit the diagnostic at the macro name in case there is a missing ).\r
- // Emitting it at the , could be far away from the macro name.\r
- Diag(MacroName, diag::err_too_many_args_in_macro_invoc);\r
- return 0;\r
- }\r
-\r
- return MacroArgs::create(MI, ArgTokens, isVarargsElided, *this);\r
-}\r
-\r
-/// \brief Keeps macro expanded tokens for TokenLexers.\r
-//\r
-/// Works like a stack; a TokenLexer adds the macro expanded tokens that is\r
-/// going to lex in the cache and when it finishes the tokens are removed\r
-/// from the end of the cache.\r
-Token *Preprocessor::cacheMacroExpandedTokens(TokenLexer *tokLexer,\r
- ArrayRef<Token> tokens) {\r
- assert(tokLexer);\r
- if (tokens.empty())\r
- return 0;\r
-\r
- size_t newIndex = MacroExpandedTokens.size();\r
- bool cacheNeedsToGrow = tokens.size() >\r
- MacroExpandedTokens.capacity()-MacroExpandedTokens.size(); \r
- MacroExpandedTokens.append(tokens.begin(), tokens.end());\r
-\r
- if (cacheNeedsToGrow) {\r
- // Go through all the TokenLexers whose 'Tokens' pointer points in the\r
- // buffer and update the pointers to the (potential) new buffer array.\r
- for (unsigned i = 0, e = MacroExpandingLexersStack.size(); i != e; ++i) {\r
- TokenLexer *prevLexer;\r
- size_t tokIndex;\r
- llvm::tie(prevLexer, tokIndex) = MacroExpandingLexersStack[i];\r
- prevLexer->Tokens = MacroExpandedTokens.data() + tokIndex;\r
- }\r
- }\r
-\r
- MacroExpandingLexersStack.push_back(std::make_pair(tokLexer, newIndex));\r
- return MacroExpandedTokens.data() + newIndex;\r
-}\r
-\r
-void Preprocessor::removeCachedMacroExpandedTokensOfLastLexer() {\r
- assert(!MacroExpandingLexersStack.empty());\r
- size_t tokIndex = MacroExpandingLexersStack.back().second;\r
- assert(tokIndex < MacroExpandedTokens.size());\r
- // Pop the cached macro expanded tokens from the end.\r
- MacroExpandedTokens.resize(tokIndex);\r
- MacroExpandingLexersStack.pop_back();\r
-}\r
-\r
-/// ComputeDATE_TIME - Compute the current time, enter it into the specified\r
-/// scratch buffer, then return DATELoc/TIMELoc locations with the position of\r
-/// the identifier tokens inserted.\r
-static void ComputeDATE_TIME(SourceLocation &DATELoc, SourceLocation &TIMELoc,\r
- Preprocessor &PP) {\r
- time_t TT = time(0);\r
- struct tm *TM = localtime(&TT);\r
-\r
- static const char * const Months[] = {\r
- "Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"\r
- };\r
-\r
- char TmpBuffer[32];\r
-#ifdef LLVM_ON_WIN32\r
- sprintf(TmpBuffer, "\"%s %2d %4d\"", Months[TM->tm_mon], TM->tm_mday,\r
- TM->tm_year+1900);\r
-#else\r
- snprintf(TmpBuffer, sizeof(TmpBuffer), "\"%s %2d %4d\"", Months[TM->tm_mon], TM->tm_mday,\r
- TM->tm_year+1900);\r
-#endif\r
-\r
- Token TmpTok;\r
- TmpTok.startToken();\r
- PP.CreateString(TmpBuffer, strlen(TmpBuffer), TmpTok);\r
- DATELoc = TmpTok.getLocation();\r
-\r
-#ifdef LLVM_ON_WIN32\r
- sprintf(TmpBuffer, "\"%02d:%02d:%02d\"", TM->tm_hour, TM->tm_min, TM->tm_sec);\r
-#else\r
- snprintf(TmpBuffer, sizeof(TmpBuffer), "\"%02d:%02d:%02d\"", TM->tm_hour, TM->tm_min, TM->tm_sec);\r
-#endif\r
- PP.CreateString(TmpBuffer, strlen(TmpBuffer), TmpTok);\r
- TIMELoc = TmpTok.getLocation();\r
-}\r
-\r
-\r
-/// HasFeature - Return true if we recognize and implement the feature\r
-/// specified by the identifier as a standard language feature.\r
-static bool HasFeature(const Preprocessor &PP, const IdentifierInfo *II) {\r
- const LangOptions &LangOpts = PP.getLangOpts();\r
- StringRef Feature = II->getName();\r
-\r
- // Normalize the feature name, __foo__ becomes foo.\r
- if (Feature.startswith("__") && Feature.endswith("__") && Feature.size() >= 4)\r
- Feature = Feature.substr(2, Feature.size() - 4);\r
-\r
- return llvm::StringSwitch<bool>(Feature)\r
- .Case("address_sanitizer", LangOpts.AddressSanitizer)\r
- .Case("attribute_analyzer_noreturn", true)\r
- .Case("attribute_availability", true)\r
- .Case("attribute_availability_with_message", true)\r
- .Case("attribute_cf_returns_not_retained", true)\r
- .Case("attribute_cf_returns_retained", true)\r
- .Case("attribute_deprecated_with_message", true)\r
- .Case("attribute_ext_vector_type", true)\r
- .Case("attribute_ns_returns_not_retained", true)\r
- .Case("attribute_ns_returns_retained", true)\r
- .Case("attribute_ns_consumes_self", true)\r
- .Case("attribute_ns_consumed", true)\r
- .Case("attribute_cf_consumed", true)\r
- .Case("attribute_objc_ivar_unused", true)\r
- .Case("attribute_objc_method_family", true)\r
- .Case("attribute_overloadable", true)\r
- .Case("attribute_unavailable_with_message", true)\r
- .Case("attribute_unused_on_fields", true)\r
- .Case("blocks", LangOpts.Blocks)\r
- .Case("cxx_exceptions", LangOpts.Exceptions)\r
- .Case("cxx_rtti", LangOpts.RTTI)\r
- .Case("enumerator_attributes", true)\r
- // Objective-C features\r
- .Case("objc_arr", LangOpts.ObjCAutoRefCount) // FIXME: REMOVE?\r
- .Case("objc_arc", LangOpts.ObjCAutoRefCount)\r
- .Case("objc_arc_weak", LangOpts.ObjCARCWeak)\r
- .Case("objc_default_synthesize_properties", LangOpts.ObjC2)\r
- .Case("objc_fixed_enum", LangOpts.ObjC2)\r
- .Case("objc_instancetype", LangOpts.ObjC2)\r
- .Case("objc_modules", LangOpts.ObjC2 && LangOpts.Modules)\r
- .Case("objc_nonfragile_abi", LangOpts.ObjCRuntime.isNonFragile())\r
- .Case("objc_weak_class", LangOpts.ObjCRuntime.hasWeakClassImport())\r
- .Case("ownership_holds", true)\r
- .Case("ownership_returns", true)\r
- .Case("ownership_takes", true)\r
- .Case("objc_bool", true)\r
- .Case("objc_subscripting", LangOpts.ObjCRuntime.isNonFragile())\r
- .Case("objc_array_literals", LangOpts.ObjC2)\r
- .Case("objc_dictionary_literals", LangOpts.ObjC2)\r
- .Case("objc_boxed_expressions", LangOpts.ObjC2)\r
- .Case("arc_cf_code_audited", true)\r
- // C11 features\r
- .Case("c_alignas", LangOpts.C11)\r
- .Case("c_atomic", LangOpts.C11)\r
- .Case("c_generic_selections", LangOpts.C11)\r
- .Case("c_static_assert", LangOpts.C11)\r
- // C++11 features\r
- .Case("cxx_access_control_sfinae", LangOpts.CPlusPlus0x)\r
- .Case("cxx_alias_templates", LangOpts.CPlusPlus0x)\r
- .Case("cxx_alignas", LangOpts.CPlusPlus0x)\r
- .Case("cxx_atomic", LangOpts.CPlusPlus0x)\r
- .Case("cxx_attributes", LangOpts.CPlusPlus0x)\r
- .Case("cxx_auto_type", LangOpts.CPlusPlus0x)\r
- .Case("cxx_constexpr", LangOpts.CPlusPlus0x)\r
- .Case("cxx_decltype", LangOpts.CPlusPlus0x)\r
- .Case("cxx_decltype_incomplete_return_types", LangOpts.CPlusPlus0x)\r
- .Case("cxx_default_function_template_args", LangOpts.CPlusPlus0x)\r
- .Case("cxx_defaulted_functions", LangOpts.CPlusPlus0x)\r
- .Case("cxx_delegating_constructors", LangOpts.CPlusPlus0x)\r
- .Case("cxx_deleted_functions", LangOpts.CPlusPlus0x)\r
- .Case("cxx_explicit_conversions", LangOpts.CPlusPlus0x)\r
- .Case("cxx_generalized_initializers", LangOpts.CPlusPlus0x)\r
- .Case("cxx_implicit_moves", LangOpts.CPlusPlus0x)\r
- //.Case("cxx_inheriting_constructors", false)\r
- .Case("cxx_inline_namespaces", LangOpts.CPlusPlus0x)\r
- .Case("cxx_lambdas", LangOpts.CPlusPlus0x)\r
- .Case("cxx_local_type_template_args", LangOpts.CPlusPlus0x)\r
- .Case("cxx_nonstatic_member_init", LangOpts.CPlusPlus0x)\r
- .Case("cxx_noexcept", LangOpts.CPlusPlus0x)\r
- .Case("cxx_nullptr", LangOpts.CPlusPlus0x)\r
- .Case("cxx_override_control", LangOpts.CPlusPlus0x)\r
- .Case("cxx_range_for", LangOpts.CPlusPlus0x)\r
- .Case("cxx_raw_string_literals", LangOpts.CPlusPlus0x)\r
- .Case("cxx_reference_qualified_functions", LangOpts.CPlusPlus0x)\r
- .Case("cxx_rvalue_references", LangOpts.CPlusPlus0x)\r
- .Case("cxx_strong_enums", LangOpts.CPlusPlus0x)\r
- .Case("cxx_static_assert", LangOpts.CPlusPlus0x)\r
- .Case("cxx_trailing_return", LangOpts.CPlusPlus0x)\r
- .Case("cxx_unicode_literals", LangOpts.CPlusPlus0x)\r
- .Case("cxx_unrestricted_unions", LangOpts.CPlusPlus0x)\r
- .Case("cxx_user_literals", LangOpts.CPlusPlus0x)\r
- .Case("cxx_variadic_templates", LangOpts.CPlusPlus0x)\r
- // Type traits\r
- .Case("has_nothrow_assign", LangOpts.CPlusPlus)\r
- .Case("has_nothrow_copy", LangOpts.CPlusPlus)\r
- .Case("has_nothrow_constructor", LangOpts.CPlusPlus)\r
- .Case("has_trivial_assign", LangOpts.CPlusPlus)\r
- .Case("has_trivial_copy", LangOpts.CPlusPlus)\r
- .Case("has_trivial_constructor", LangOpts.CPlusPlus)\r
- .Case("has_trivial_destructor", LangOpts.CPlusPlus)\r
- .Case("has_virtual_destructor", LangOpts.CPlusPlus)\r
- .Case("is_abstract", LangOpts.CPlusPlus)\r
- .Case("is_base_of", LangOpts.CPlusPlus)\r
- .Case("is_class", LangOpts.CPlusPlus)\r
- .Case("is_convertible_to", LangOpts.CPlusPlus)\r
- // __is_empty is available only if the horrible\r
- // "struct __is_empty" parsing hack hasn't been needed in this\r
- // translation unit. If it has, __is_empty reverts to a normal\r
- // identifier and __has_feature(is_empty) evaluates false.\r
- .Case("is_empty", LangOpts.CPlusPlus)\r
- .Case("is_enum", LangOpts.CPlusPlus)\r
- .Case("is_final", LangOpts.CPlusPlus)\r
- .Case("is_literal", LangOpts.CPlusPlus)\r
- .Case("is_standard_layout", LangOpts.CPlusPlus)\r
- .Case("is_pod", LangOpts.CPlusPlus)\r
- .Case("is_polymorphic", LangOpts.CPlusPlus)\r
- .Case("is_trivial", LangOpts.CPlusPlus)\r
- .Case("is_trivially_assignable", LangOpts.CPlusPlus)\r
- .Case("is_trivially_constructible", LangOpts.CPlusPlus)\r
- .Case("is_trivially_copyable", LangOpts.CPlusPlus)\r
- .Case("is_union", LangOpts.CPlusPlus)\r
- .Case("modules", LangOpts.Modules)\r
- .Case("tls", PP.getTargetInfo().isTLSSupported())\r
- .Case("underlying_type", LangOpts.CPlusPlus)\r
- .Default(false);\r
-}\r
-\r
-/// HasExtension - Return true if we recognize and implement the feature\r
-/// specified by the identifier, either as an extension or a standard language\r
-/// feature.\r
-static bool HasExtension(const Preprocessor &PP, const IdentifierInfo *II) {\r
- if (HasFeature(PP, II))\r
- return true;\r
-\r
- // If the use of an extension results in an error diagnostic, extensions are\r
- // effectively unavailable, so just return false here.\r
- if (PP.getDiagnostics().getExtensionHandlingBehavior() ==\r
- DiagnosticsEngine::Ext_Error)\r
- return false;\r
-\r
- const LangOptions &LangOpts = PP.getLangOpts();\r
- StringRef Extension = II->getName();\r
-\r
- // Normalize the extension name, __foo__ becomes foo.\r
- if (Extension.startswith("__") && Extension.endswith("__") &&\r
- Extension.size() >= 4)\r
- Extension = Extension.substr(2, Extension.size() - 4);\r
-\r
- // Because we inherit the feature list from HasFeature, this string switch\r
- // must be less restrictive than HasFeature's.\r
- return llvm::StringSwitch<bool>(Extension)\r
- // C11 features supported by other languages as extensions.\r
- .Case("c_alignas", true)\r
- .Case("c_atomic", true)\r
- .Case("c_generic_selections", true)\r
- .Case("c_static_assert", true)\r
- // C++0x features supported by other languages as extensions.\r
- .Case("cxx_atomic", LangOpts.CPlusPlus)\r
- .Case("cxx_deleted_functions", LangOpts.CPlusPlus)\r
- .Case("cxx_explicit_conversions", LangOpts.CPlusPlus)\r
- .Case("cxx_inline_namespaces", LangOpts.CPlusPlus)\r
- .Case("cxx_local_type_template_args", LangOpts.CPlusPlus)\r
- .Case("cxx_nonstatic_member_init", LangOpts.CPlusPlus)\r
- .Case("cxx_override_control", LangOpts.CPlusPlus)\r
- .Case("cxx_range_for", LangOpts.CPlusPlus)\r
- .Case("cxx_reference_qualified_functions", LangOpts.CPlusPlus)\r
- .Case("cxx_rvalue_references", LangOpts.CPlusPlus)\r
- .Default(false);\r
-}\r
-\r
-/// HasAttribute - Return true if we recognize and implement the attribute\r
-/// specified by the given identifier.\r
-static bool HasAttribute(const IdentifierInfo *II) {\r
- StringRef Name = II->getName();\r
- // Normalize the attribute name, __foo__ becomes foo.\r
- if (Name.startswith("__") && Name.endswith("__") && Name.size() >= 4)\r
- Name = Name.substr(2, Name.size() - 4);\r
-\r
- // FIXME: Do we need to handle namespaces here?\r
- return llvm::StringSwitch<bool>(Name)\r
-#include "clang/Lex/AttrSpellings.inc"\r
- .Default(false);\r
-}\r
-\r
-/// EvaluateHasIncludeCommon - Process a '__has_include("path")'\r
-/// or '__has_include_next("path")' expression.\r
-/// Returns true if successful.\r
-static bool EvaluateHasIncludeCommon(Token &Tok,\r
- IdentifierInfo *II, Preprocessor &PP,\r
- const DirectoryLookup *LookupFrom) {\r
- SourceLocation LParenLoc;\r
-\r
- // Get '('.\r
- PP.LexNonComment(Tok);\r
-\r
- // Ensure we have a '('.\r
- if (Tok.isNot(tok::l_paren)) {\r
- PP.Diag(Tok.getLocation(), diag::err_pp_missing_lparen) << II->getName();\r
- return false;\r
- }\r
-\r
- // Save '(' location for possible missing ')' message.\r
- LParenLoc = Tok.getLocation();\r
-\r
- // Get the file name.\r
- PP.getCurrentLexer()->LexIncludeFilename(Tok);\r
-\r
- // Reserve a buffer to get the spelling.\r
- SmallString<128> FilenameBuffer;\r
- StringRef Filename;\r
- SourceLocation EndLoc;\r
- \r
- switch (Tok.getKind()) {\r
- case tok::eod:\r
- // If the token kind is EOD, the error has already been diagnosed.\r
- return false;\r
-\r
- case tok::angle_string_literal:\r
- case tok::string_literal: {\r
- bool Invalid = false;\r
- Filename = PP.getSpelling(Tok, FilenameBuffer, &Invalid);\r
- if (Invalid)\r
- return false;\r
- break;\r
- }\r
-\r
- case tok::less:\r
- // This could be a <foo/bar.h> file coming from a macro expansion. In this\r
- // case, glue the tokens together into FilenameBuffer and interpret those.\r
- FilenameBuffer.push_back('<');\r
- if (PP.ConcatenateIncludeName(FilenameBuffer, EndLoc))\r
- return false; // Found <eod> but no ">"? Diagnostic already emitted.\r
- Filename = FilenameBuffer.str();\r
- break;\r
- default:\r
- PP.Diag(Tok.getLocation(), diag::err_pp_expects_filename);\r
- return false;\r
- }\r
-\r
- // Get ')'.\r
- PP.LexNonComment(Tok);\r
-\r
- // Ensure we have a trailing ).\r
- if (Tok.isNot(tok::r_paren)) {\r
- PP.Diag(Tok.getLocation(), diag::err_pp_missing_rparen) << II->getName();\r
- PP.Diag(LParenLoc, diag::note_matching) << "(";\r
- return false;\r
- }\r
-\r
- bool isAngled = PP.GetIncludeFilenameSpelling(Tok.getLocation(), Filename);\r
- // If GetIncludeFilenameSpelling set the start ptr to null, there was an\r
- // error.\r
- if (Filename.empty())\r
- return false;\r
-\r
- // Search include directories.\r
- const DirectoryLookup *CurDir;\r
- const FileEntry *File =\r
- PP.LookupFile(Filename, isAngled, LookupFrom, CurDir, NULL, NULL, NULL);\r
-\r
- // Get the result value. A result of true means the file exists.\r
- return File != 0;\r
-}\r
-\r
-/// EvaluateHasInclude - Process a '__has_include("path")' expression.\r
-/// Returns true if successful.\r
-static bool EvaluateHasInclude(Token &Tok, IdentifierInfo *II,\r
- Preprocessor &PP) {\r
- return EvaluateHasIncludeCommon(Tok, II, PP, NULL);\r
-}\r
-\r
-/// EvaluateHasIncludeNext - Process '__has_include_next("path")' expression.\r
-/// Returns true if successful.\r
-static bool EvaluateHasIncludeNext(Token &Tok,\r
- IdentifierInfo *II, Preprocessor &PP) {\r
- // __has_include_next is like __has_include, except that we start\r
- // searching after the current found directory. If we can't do this,\r
- // issue a diagnostic.\r
- const DirectoryLookup *Lookup = PP.GetCurDirLookup();\r
- if (PP.isInPrimaryFile()) {\r
- Lookup = 0;\r
- PP.Diag(Tok, diag::pp_include_next_in_primary);\r
- } else if (Lookup == 0) {\r
- PP.Diag(Tok, diag::pp_include_next_absolute_path);\r
- } else {\r
- // Start looking up in the next directory.\r
- ++Lookup;\r
- }\r
-\r
- return EvaluateHasIncludeCommon(Tok, II, PP, Lookup);\r
-}\r
-\r
-/// ExpandBuiltinMacro - If an identifier token is read that is to be expanded\r
-/// as a builtin macro, handle it and return the next token as 'Tok'.\r
-void Preprocessor::ExpandBuiltinMacro(Token &Tok) {\r
- // Figure out which token this is.\r
- IdentifierInfo *II = Tok.getIdentifierInfo();\r
- assert(II && "Can't be a macro without id info!");\r
-\r
- // If this is an _Pragma or Microsoft __pragma directive, expand it,\r
- // invoke the pragma handler, then lex the token after it.\r
- if (II == Ident_Pragma)\r
- return Handle_Pragma(Tok);\r
- else if (II == Ident__pragma) // in non-MS mode this is null\r
- return HandleMicrosoft__pragma(Tok);\r
-\r
- ++NumBuiltinMacroExpanded;\r
-\r
- SmallString<128> TmpBuffer;\r
- llvm::raw_svector_ostream OS(TmpBuffer);\r
-\r
- // Set up the return result.\r
- Tok.setIdentifierInfo(0);\r
- Tok.clearFlag(Token::NeedsCleaning);\r
-\r
- if (II == Ident__LINE__) {\r
- // C99 6.10.8: "__LINE__: The presumed line number (within the current\r
- // source file) of the current source line (an integer constant)". This can\r
- // be affected by #line.\r
- SourceLocation Loc = Tok.getLocation();\r
-\r
- // Advance to the location of the first _, this might not be the first byte\r
- // of the token if it starts with an escaped newline.\r
- Loc = AdvanceToTokenCharacter(Loc, 0);\r
-\r
- // One wrinkle here is that GCC expands __LINE__ to location of the *end* of\r
- // a macro expansion. This doesn't matter for object-like macros, but\r
- // can matter for a function-like macro that expands to contain __LINE__.\r
- // Skip down through expansion points until we find a file loc for the\r
- // end of the expansion history.\r
- Loc = SourceMgr.getExpansionRange(Loc).second;\r
- PresumedLoc PLoc = SourceMgr.getPresumedLoc(Loc);\r
-\r
- // __LINE__ expands to a simple numeric value.\r
- OS << (PLoc.isValid()? PLoc.getLine() : 1);\r
- Tok.setKind(tok::numeric_constant);\r
- } else if (II == Ident__FILE__ || II == Ident__BASE_FILE__) {\r
- // C99 6.10.8: "__FILE__: The presumed name of the current source file (a\r
- // character string literal)". This can be affected by #line.\r
- PresumedLoc PLoc = SourceMgr.getPresumedLoc(Tok.getLocation());\r
-\r
- // __BASE_FILE__ is a GNU extension that returns the top of the presumed\r
- // #include stack instead of the current file.\r
- if (II == Ident__BASE_FILE__ && PLoc.isValid()) {\r
- SourceLocation NextLoc = PLoc.getIncludeLoc();\r
- while (NextLoc.isValid()) {\r
- PLoc = SourceMgr.getPresumedLoc(NextLoc);\r
- if (PLoc.isInvalid())\r
- break;\r
- \r
- NextLoc = PLoc.getIncludeLoc();\r
- }\r
- }\r
-\r
- // Escape this filename. Turn '\' -> '\\' '"' -> '\"'\r
- SmallString<128> FN;\r
- if (PLoc.isValid()) {\r
- FN += PLoc.getFilename();\r
- Lexer::Stringify(FN);\r
- OS << '"' << FN.str() << '"';\r
- }\r
- Tok.setKind(tok::string_literal);\r
- } else if (II == Ident__DATE__) {\r
- if (!DATELoc.isValid())\r
- ComputeDATE_TIME(DATELoc, TIMELoc, *this);\r
- Tok.setKind(tok::string_literal);\r
- Tok.setLength(strlen("\"Mmm dd yyyy\""));\r
- Tok.setLocation(SourceMgr.createExpansionLoc(DATELoc, Tok.getLocation(),\r
- Tok.getLocation(),\r
- Tok.getLength()));\r
- return;\r
- } else if (II == Ident__TIME__) {\r
- if (!TIMELoc.isValid())\r
- ComputeDATE_TIME(DATELoc, TIMELoc, *this);\r
- Tok.setKind(tok::string_literal);\r
- Tok.setLength(strlen("\"hh:mm:ss\""));\r
- Tok.setLocation(SourceMgr.createExpansionLoc(TIMELoc, Tok.getLocation(),\r
- Tok.getLocation(),\r
- Tok.getLength()));\r
- return;\r
- } else if (II == Ident__INCLUDE_LEVEL__) {\r
- // Compute the presumed include depth of this token. This can be affected\r
- // by GNU line markers.\r
- unsigned Depth = 0;\r
-\r
- PresumedLoc PLoc = SourceMgr.getPresumedLoc(Tok.getLocation());\r
- if (PLoc.isValid()) {\r
- PLoc = SourceMgr.getPresumedLoc(PLoc.getIncludeLoc());\r
- for (; PLoc.isValid(); ++Depth)\r
- PLoc = SourceMgr.getPresumedLoc(PLoc.getIncludeLoc());\r
- }\r
-\r
- // __INCLUDE_LEVEL__ expands to a simple numeric value.\r
- OS << Depth;\r
- Tok.setKind(tok::numeric_constant);\r
- } else if (II == Ident__TIMESTAMP__) {\r
- // MSVC, ICC, GCC, VisualAge C++ extension. The generated string should be\r
- // of the form "Ddd Mmm dd hh::mm::ss yyyy", which is returned by asctime.\r
-\r
- // Get the file that we are lexing out of. If we're currently lexing from\r
- // a macro, dig into the include stack.\r
- const FileEntry *CurFile = 0;\r
- PreprocessorLexer *TheLexer = getCurrentFileLexer();\r
-\r
- if (TheLexer)\r
- CurFile = SourceMgr.getFileEntryForID(TheLexer->getFileID());\r
-\r
- const char *Result;\r
- if (CurFile) {\r
- time_t TT = CurFile->getModificationTime();\r
- struct tm *TM = localtime(&TT);\r
- Result = asctime(TM);\r
- } else {\r
- Result = "??? ??? ?? ??:??:?? ????\n";\r
- }\r
- // Surround the string with " and strip the trailing newline.\r
- OS << '"' << StringRef(Result, strlen(Result)-1) << '"';\r
- Tok.setKind(tok::string_literal);\r
- } else if (II == Ident__COUNTER__) {\r
- // __COUNTER__ expands to a simple numeric value.\r
- OS << CounterValue++;\r
- Tok.setKind(tok::numeric_constant);\r
- } else if (II == Ident__has_feature ||\r
- II == Ident__has_extension ||\r
- II == Ident__has_builtin ||\r
- II == Ident__has_attribute) {\r
- // The argument to these builtins should be a parenthesized identifier.\r
- SourceLocation StartLoc = Tok.getLocation();\r
-\r
- bool IsValid = false;\r
- IdentifierInfo *FeatureII = 0;\r
-\r
- // Read the '('.\r
- Lex(Tok);\r
- if (Tok.is(tok::l_paren)) {\r
- // Read the identifier\r
- Lex(Tok);\r
- if (Tok.is(tok::identifier) || Tok.is(tok::kw_const)) {\r
- FeatureII = Tok.getIdentifierInfo();\r
-\r
- // Read the ')'.\r
- Lex(Tok);\r
- if (Tok.is(tok::r_paren))\r
- IsValid = true;\r
- }\r
- }\r
-\r
- bool Value = false;\r
- if (!IsValid)\r
- Diag(StartLoc, diag::err_feature_check_malformed);\r
- else if (II == Ident__has_builtin) {\r
- // Check for a builtin is trivial.\r
- Value = FeatureII->getBuiltinID() != 0;\r
- } else if (II == Ident__has_attribute)\r
- Value = HasAttribute(FeatureII);\r
- else if (II == Ident__has_extension)\r
- Value = HasExtension(*this, FeatureII);\r
- else {\r
- assert(II == Ident__has_feature && "Must be feature check");\r
- Value = HasFeature(*this, FeatureII);\r
- }\r
-\r
- OS << (int)Value;\r
- if (IsValid)\r
- Tok.setKind(tok::numeric_constant);\r
- } else if (II == Ident__has_include ||\r
- II == Ident__has_include_next) {\r
- // The argument to these two builtins should be a parenthesized\r
- // file name string literal using angle brackets (<>) or\r
- // double-quotes ("").\r
- bool Value;\r
- if (II == Ident__has_include)\r
- Value = EvaluateHasInclude(Tok, II, *this);\r
- else\r
- Value = EvaluateHasIncludeNext(Tok, II, *this);\r
- OS << (int)Value;\r
- Tok.setKind(tok::numeric_constant);\r
- } else if (II == Ident__has_warning) {\r
- // The argument should be a parenthesized string literal.\r
- // The argument to these builtins should be a parenthesized identifier.\r
- SourceLocation StartLoc = Tok.getLocation(); \r
- bool IsValid = false;\r
- bool Value = false;\r
- // Read the '('.\r
- Lex(Tok);\r
- do {\r
- if (Tok.is(tok::l_paren)) { \r
- // Read the string.\r
- Lex(Tok);\r
- \r
- // We need at least one string literal.\r
- if (!Tok.is(tok::string_literal)) {\r
- StartLoc = Tok.getLocation();\r
- IsValid = false;\r
- // Eat tokens until ')'.\r
- do Lex(Tok); while (!(Tok.is(tok::r_paren) || Tok.is(tok::eod)));\r
- break;\r
- }\r
- \r
- // String concatenation allows multiple strings, which can even come\r
- // from macro expansion.\r
- SmallVector<Token, 4> StrToks;\r
- while (Tok.is(tok::string_literal)) {\r
- // Complain about, and drop, any ud-suffix.\r
- if (Tok.hasUDSuffix())\r
- Diag(Tok, diag::err_invalid_string_udl);\r
- StrToks.push_back(Tok);\r
- LexUnexpandedToken(Tok);\r
- }\r
- \r
- // Is the end a ')'?\r
- if (!(IsValid = Tok.is(tok::r_paren)))\r
- break;\r
- \r
- // Concatenate and parse the strings.\r
- StringLiteralParser Literal(&StrToks[0], StrToks.size(), *this);\r
- assert(Literal.isAscii() && "Didn't allow wide strings in");\r
- if (Literal.hadError)\r
- break;\r
- if (Literal.Pascal) {\r
- Diag(Tok, diag::warn_pragma_diagnostic_invalid);\r
- break;\r
- }\r
- \r
- StringRef WarningName(Literal.GetString());\r
- \r
- if (WarningName.size() < 3 || WarningName[0] != '-' ||\r
- WarningName[1] != 'W') {\r
- Diag(StrToks[0].getLocation(), diag::warn_has_warning_invalid_option);\r
- break;\r
- }\r
- \r
- // Finally, check if the warning flags maps to a diagnostic group.\r
- // We construct a SmallVector here to talk to getDiagnosticIDs().\r
- // Although we don't use the result, this isn't a hot path, and not\r
- // worth special casing.\r
- llvm::SmallVector<diag::kind, 10> Diags;\r
- Value = !getDiagnostics().getDiagnosticIDs()->\r
- getDiagnosticsInGroup(WarningName.substr(2), Diags);\r
- }\r
- } while (false);\r
- \r
- if (!IsValid)\r
- Diag(StartLoc, diag::err_warning_check_malformed);\r
-\r
- OS << (int)Value;\r
- Tok.setKind(tok::numeric_constant);\r
- } else {\r
- llvm_unreachable("Unknown identifier!");\r
- }\r
- CreateString(OS.str().data(), OS.str().size(), Tok,\r
- Tok.getLocation(), Tok.getLocation());\r
-}\r
-\r
-void Preprocessor::markMacroAsUsed(MacroInfo *MI) {\r
- // If the 'used' status changed, and the macro requires 'unused' warning,\r
- // remove its SourceLocation from the warn-for-unused-macro locations.\r
- if (MI->isWarnIfUnused() && !MI->isUsed())\r
- WarnUnusedMacroLocs.erase(MI->getDefinitionLoc());\r
- MI->setIsUsed(true);\r
-}\r
+//===--- MacroExpansion.cpp - Top level Macro Expansion -------------------===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
+// This file implements the top level handling of macro expasion for the
+// preprocessor.
+//
+//===----------------------------------------------------------------------===//
+
+#include "clang/Lex/Preprocessor.h"
+#include "MacroArgs.h"
+#include "clang/Lex/MacroInfo.h"
+#include "clang/Basic/SourceManager.h"
+#include "clang/Basic/FileManager.h"
+#include "clang/Basic/TargetInfo.h"
+#include "clang/Lex/LexDiagnostic.h"
+#include "clang/Lex/CodeCompletionHandler.h"
+#include "clang/Lex/ExternalPreprocessorSource.h"
+#include "clang/Lex/LiteralSupport.h"
+#include "llvm/ADT/StringSwitch.h"
+#include "llvm/ADT/STLExtras.h"
+#include "llvm/Config/llvm-config.h"
+#include "llvm/Support/raw_ostream.h"
+#include "llvm/Support/ErrorHandling.h"
+#include <cstdio>
+#include <ctime>
+using namespace clang;
+
+MacroInfo *Preprocessor::getInfoForMacro(IdentifierInfo *II) const {
+ assert(II->hasMacroDefinition() && "Identifier is not a macro!");
+
+ macro_iterator Pos = Macros.find(II);
+ if (Pos == Macros.end()) {
+ // Load this macro from the external source.
+ getExternalSource()->LoadMacroDefinition(II);
+ Pos = Macros.find(II);
+ }
+ assert(Pos != Macros.end() && "Identifier macro info is missing!");
+ assert(Pos->second->getUndefLoc().isInvalid() && "Macro is undefined!");
+ return Pos->second;
+}
+
+/// setMacroInfo - Specify a macro for this identifier.
+///
+void Preprocessor::setMacroInfo(IdentifierInfo *II, MacroInfo *MI,
+ bool LoadedFromAST) {
+ assert(MI && "MacroInfo should be non-zero!");
+ MI->setPreviousDefinition(Macros[II]);
+ Macros[II] = MI;
+ II->setHasMacroDefinition(true);
+ if (II->isFromAST() && !LoadedFromAST)
+ II->setChangedSinceDeserialization();
+}
+
+/// \brief Undefine a macro for this identifier.
+void Preprocessor::clearMacroInfo(IdentifierInfo *II) {
+ assert(II->hasMacroDefinition() && "Macro is not defined!");
+ assert(Macros[II]->getUndefLoc().isValid() && "Macro is still defined!");
+ II->setHasMacroDefinition(false);
+ if (II->isFromAST())
+ II->setChangedSinceDeserialization();
+}
+
+/// RegisterBuiltinMacro - Register the specified identifier in the identifier
+/// table and mark it as a builtin macro to be expanded.
+static IdentifierInfo *RegisterBuiltinMacro(Preprocessor &PP, const char *Name){
+ // Get the identifier.
+ IdentifierInfo *Id = PP.getIdentifierInfo(Name);
+
+ // Mark it as being a macro that is builtin.
+ MacroInfo *MI = PP.AllocateMacroInfo(SourceLocation());
+ MI->setIsBuiltinMacro();
+ PP.setMacroInfo(Id, MI);
+ return Id;
+}
+
+
+/// RegisterBuiltinMacros - Register builtin macros, such as __LINE__ with the
+/// identifier table.
+void Preprocessor::RegisterBuiltinMacros() {
+ Ident__LINE__ = RegisterBuiltinMacro(*this, "__LINE__");
+ Ident__FILE__ = RegisterBuiltinMacro(*this, "__FILE__");
+ Ident__DATE__ = RegisterBuiltinMacro(*this, "__DATE__");
+ Ident__TIME__ = RegisterBuiltinMacro(*this, "__TIME__");
+ Ident__COUNTER__ = RegisterBuiltinMacro(*this, "__COUNTER__");
+ Ident_Pragma = RegisterBuiltinMacro(*this, "_Pragma");
+
+ // GCC Extensions.
+ Ident__BASE_FILE__ = RegisterBuiltinMacro(*this, "__BASE_FILE__");
+ Ident__INCLUDE_LEVEL__ = RegisterBuiltinMacro(*this, "__INCLUDE_LEVEL__");
+ Ident__TIMESTAMP__ = RegisterBuiltinMacro(*this, "__TIMESTAMP__");
+
+ // Clang Extensions.
+ Ident__has_feature = RegisterBuiltinMacro(*this, "__has_feature");
+ Ident__has_extension = RegisterBuiltinMacro(*this, "__has_extension");
+ Ident__has_builtin = RegisterBuiltinMacro(*this, "__has_builtin");
+ Ident__has_attribute = RegisterBuiltinMacro(*this, "__has_attribute");
+ Ident__has_include = RegisterBuiltinMacro(*this, "__has_include");
+ Ident__has_include_next = RegisterBuiltinMacro(*this, "__has_include_next");
+ Ident__has_warning = RegisterBuiltinMacro(*this, "__has_warning");
+
+ // Microsoft Extensions.
+ if (LangOpts.MicrosoftExt)
+ Ident__pragma = RegisterBuiltinMacro(*this, "__pragma");
+ else
+ Ident__pragma = 0;
+}
+
+/// isTrivialSingleTokenExpansion - Return true if MI, which has a single token
+/// in its expansion, currently expands to that token literally.
+static bool isTrivialSingleTokenExpansion(const MacroInfo *MI,
+ const IdentifierInfo *MacroIdent,
+ Preprocessor &PP) {
+ IdentifierInfo *II = MI->getReplacementToken(0).getIdentifierInfo();
+
+ // If the token isn't an identifier, it's always literally expanded.
+ if (II == 0) return true;
+
+ // If the information about this identifier is out of date, update it from
+ // the external source.
+ if (II->isOutOfDate())
+ PP.getExternalSource()->updateOutOfDateIdentifier(*II);
+
+ // If the identifier is a macro, and if that macro is enabled, it may be
+ // expanded so it's not a trivial expansion.
+ if (II->hasMacroDefinition() && PP.getMacroInfo(II)->isEnabled() &&
+ // Fast expanding "#define X X" is ok, because X would be disabled.
+ II != MacroIdent)
+ return false;
+
+ // If this is an object-like macro invocation, it is safe to trivially expand
+ // it.
+ if (MI->isObjectLike()) return true;
+
+ // If this is a function-like macro invocation, it's safe to trivially expand
+ // as long as the identifier is not a macro argument.
+ for (MacroInfo::arg_iterator I = MI->arg_begin(), E = MI->arg_end();
+ I != E; ++I)
+ if (*I == II)
+ return false; // Identifier is a macro argument.
+
+ return true;
+}
+
+
+/// isNextPPTokenLParen - Determine whether the next preprocessor token to be
+/// lexed is a '('. If so, consume the token and return true, if not, this
+/// method should have no observable side-effect on the lexed tokens.
+bool Preprocessor::isNextPPTokenLParen() {
+ // Do some quick tests for rejection cases.
+ unsigned Val;
+ if (CurLexer)
+ Val = CurLexer->isNextPPTokenLParen();
+ else if (CurPTHLexer)
+ Val = CurPTHLexer->isNextPPTokenLParen();
+ else
+ Val = CurTokenLexer->isNextTokenLParen();
+
+ if (Val == 2) {
+ // We have run off the end. If it's a source file we don't
+ // examine enclosing ones (C99 5.1.1.2p4). Otherwise walk up the
+ // macro stack.
+ if (CurPPLexer)
+ return false;
+ for (unsigned i = IncludeMacroStack.size(); i != 0; --i) {
+ IncludeStackInfo &Entry = IncludeMacroStack[i-1];
+ if (Entry.TheLexer)
+ Val = Entry.TheLexer->isNextPPTokenLParen();
+ else if (Entry.ThePTHLexer)
+ Val = Entry.ThePTHLexer->isNextPPTokenLParen();
+ else
+ Val = Entry.TheTokenLexer->isNextTokenLParen();
+
+ if (Val != 2)
+ break;
+
+ // Ran off the end of a source file?
+ if (Entry.ThePPLexer)
+ return false;
+ }
+ }
+
+ // Okay, if we know that the token is a '(', lex it and return. Otherwise we
+ // have found something that isn't a '(' or we found the end of the
+ // translation unit. In either case, return false.
+ return Val == 1;
+}
+
+/// HandleMacroExpandedIdentifier - If an identifier token is read that is to be
+/// expanded as a macro, handle it and return the next token as 'Identifier'.
+bool Preprocessor::HandleMacroExpandedIdentifier(Token &Identifier,
+ MacroInfo *MI) {
+ // If this is a macro expansion in the "#if !defined(x)" line for the file,
+ // then the macro could expand to different things in other contexts, we need
+ // to disable the optimization in this case.
+ if (CurPPLexer) CurPPLexer->MIOpt.ExpandedMacro();
+
+ // If this is a builtin macro, like __LINE__ or _Pragma, handle it specially.
+ if (MI->isBuiltinMacro()) {
+ if (Callbacks) Callbacks->MacroExpands(Identifier, MI,
+ Identifier.getLocation());
+ ExpandBuiltinMacro(Identifier);
+ return false;
+ }
+
+ /// Args - If this is a function-like macro expansion, this contains,
+ /// for each macro argument, the list of tokens that were provided to the
+ /// invocation.
+ MacroArgs *Args = 0;
+
+ // Remember where the end of the expansion occurred. For an object-like
+ // macro, this is the identifier. For a function-like macro, this is the ')'.
+ SourceLocation ExpansionEnd = Identifier.getLocation();
+
+ // If this is a function-like macro, read the arguments.
+ if (MI->isFunctionLike()) {
+ // C99 6.10.3p10: If the preprocessing token immediately after the macro
+ // name isn't a '(', this macro should not be expanded.
+ if (!isNextPPTokenLParen())
+ return true;
+
+ // Remember that we are now parsing the arguments to a macro invocation.
+ // Preprocessor directives used inside macro arguments are not portable, and
+ // this enables the warning.
+ InMacroArgs = true;
+ Args = ReadFunctionLikeMacroArgs(Identifier, MI, ExpansionEnd);
+
+ // Finished parsing args.
+ InMacroArgs = false;
+
+ // If there was an error parsing the arguments, bail out.
+ if (Args == 0) return false;
+
+ ++NumFnMacroExpanded;
+ } else {
+ ++NumMacroExpanded;
+ }
+
+ // Notice that this macro has been used.
+ markMacroAsUsed(MI);
+
+ // Remember where the token is expanded.
+ SourceLocation ExpandLoc = Identifier.getLocation();
+ SourceRange ExpansionRange(ExpandLoc, ExpansionEnd);
+
+ if (Callbacks) {
+ if (InMacroArgs) {
+ // We can have macro expansion inside a conditional directive while
+ // reading the function macro arguments. To ensure, in that case, that
+ // MacroExpands callbacks still happen in source order, queue this
+ // callback to have it happen after the function macro callback.
+ DelayedMacroExpandsCallbacks.push_back(
+ MacroExpandsInfo(Identifier, MI, ExpansionRange));
+ } else {
+ Callbacks->MacroExpands(Identifier, MI, ExpansionRange);
+ if (!DelayedMacroExpandsCallbacks.empty()) {
+ for (unsigned i=0, e = DelayedMacroExpandsCallbacks.size(); i!=e; ++i) {
+ MacroExpandsInfo &Info = DelayedMacroExpandsCallbacks[i];
+ Callbacks->MacroExpands(Info.Tok, Info.MI, Info.Range);
+ }
+ DelayedMacroExpandsCallbacks.clear();
+ }
+ }
+ }
+
+ // If we started lexing a macro, enter the macro expansion body.
+
+ // If this macro expands to no tokens, don't bother to push it onto the
+ // expansion stack, only to take it right back off.
+ if (MI->getNumTokens() == 0) {
+ // No need for arg info.
+ if (Args) Args->destroy(*this);
+
+ // Ignore this macro use, just return the next token in the current
+ // buffer.
+ bool HadLeadingSpace = Identifier.hasLeadingSpace();
+ bool IsAtStartOfLine = Identifier.isAtStartOfLine();
+
+ Lex(Identifier);
+
+ // If the identifier isn't on some OTHER line, inherit the leading
+ // whitespace/first-on-a-line property of this token. This handles
+ // stuff like "! XX," -> "! ," and " XX," -> " ,", when XX is
+ // empty.
+ if (!Identifier.isAtStartOfLine()) {
+ if (IsAtStartOfLine) Identifier.setFlag(Token::StartOfLine);
+ if (HadLeadingSpace) Identifier.setFlag(Token::LeadingSpace);
+ }
+ Identifier.setFlag(Token::LeadingEmptyMacro);
+ ++NumFastMacroExpanded;
+ return false;
+
+ } else if (MI->getNumTokens() == 1 &&
+ isTrivialSingleTokenExpansion(MI, Identifier.getIdentifierInfo(),
+ *this)) {
+ // Otherwise, if this macro expands into a single trivially-expanded
+ // token: expand it now. This handles common cases like
+ // "#define VAL 42".
+
+ // No need for arg info.
+ if (Args) Args->destroy(*this);
+
+ // Propagate the isAtStartOfLine/hasLeadingSpace markers of the macro
+ // identifier to the expanded token.
+ bool isAtStartOfLine = Identifier.isAtStartOfLine();
+ bool hasLeadingSpace = Identifier.hasLeadingSpace();
+
+ // Replace the result token.
+ Identifier = MI->getReplacementToken(0);
+
+ // Restore the StartOfLine/LeadingSpace markers.
+ Identifier.setFlagValue(Token::StartOfLine , isAtStartOfLine);
+ Identifier.setFlagValue(Token::LeadingSpace, hasLeadingSpace);
+
+ // Update the tokens location to include both its expansion and physical
+ // locations.
+ SourceLocation Loc =
+ SourceMgr.createExpansionLoc(Identifier.getLocation(), ExpandLoc,
+ ExpansionEnd,Identifier.getLength());
+ Identifier.setLocation(Loc);
+
+ // If this is a disabled macro or #define X X, we must mark the result as
+ // unexpandable.
+ if (IdentifierInfo *NewII = Identifier.getIdentifierInfo()) {
+ if (MacroInfo *NewMI = getMacroInfo(NewII))
+ if (!NewMI->isEnabled() || NewMI == MI) {
+ Identifier.setFlag(Token::DisableExpand);
+ Diag(Identifier, diag::pp_disabled_macro_expansion);
+ }
+ }
+
+ // Since this is not an identifier token, it can't be macro expanded, so
+ // we're done.
+ ++NumFastMacroExpanded;
+ return false;
+ }
+
+ // Start expanding the macro.
+ EnterMacro(Identifier, ExpansionEnd, MI, Args);
+
+ // Now that the macro is at the top of the include stack, ask the
+ // preprocessor to read the next token from it.
+ Lex(Identifier);
+ return false;
+}
+
+/// ReadFunctionLikeMacroArgs - After reading "MACRO" and knowing that the next
+/// token is the '(' of the macro, this method is invoked to read all of the
+/// actual arguments specified for the macro invocation. This returns null on
+/// error.
+MacroArgs *Preprocessor::ReadFunctionLikeMacroArgs(Token &MacroName,
+ MacroInfo *MI,
+ SourceLocation &MacroEnd) {
+ // The number of fixed arguments to parse.
+ unsigned NumFixedArgsLeft = MI->getNumArgs();
+ bool isVariadic = MI->isVariadic();
+
+ // Outer loop, while there are more arguments, keep reading them.
+ Token Tok;
+
+ // Read arguments as unexpanded tokens. This avoids issues, e.g., where
+ // an argument value in a macro could expand to ',' or '(' or ')'.
+ LexUnexpandedToken(Tok);
+ assert(Tok.is(tok::l_paren) && "Error computing l-paren-ness?");
+
+ // ArgTokens - Build up a list of tokens that make up each argument. Each
+ // argument is separated by an EOF token. Use a SmallVector so we can avoid
+ // heap allocations in the common case.
+ SmallVector<Token, 64> ArgTokens;
+
+ unsigned NumActuals = 0;
+ while (Tok.isNot(tok::r_paren)) {
+ assert((Tok.is(tok::l_paren) || Tok.is(tok::comma)) &&
+ "only expect argument separators here");
+
+ unsigned ArgTokenStart = ArgTokens.size();
+ SourceLocation ArgStartLoc = Tok.getLocation();
+
+ // C99 6.10.3p11: Keep track of the number of l_parens we have seen. Note
+ // that we already consumed the first one.
+ unsigned NumParens = 0;
+
+ while (1) {
+ // Read arguments as unexpanded tokens. This avoids issues, e.g., where
+ // an argument value in a macro could expand to ',' or '(' or ')'.
+ LexUnexpandedToken(Tok);
+
+ if (Tok.is(tok::eof) || Tok.is(tok::eod)) { // "#if f(<eof>" & "#if f(\n"
+ Diag(MacroName, diag::err_unterm_macro_invoc);
+ // Do not lose the EOF/EOD. Return it to the client.
+ MacroName = Tok;
+ return 0;
+ } else if (Tok.is(tok::r_paren)) {
+ // If we found the ) token, the macro arg list is done.
+ if (NumParens-- == 0) {
+ MacroEnd = Tok.getLocation();
+ break;
+ }
+ } else if (Tok.is(tok::l_paren)) {
+ ++NumParens;
+ // In Microsoft-compatibility mode, commas from nested macro expan-
+ // sions should not be considered as argument separators. We test
+ // for this with the IgnoredComma token flag.
+ } else if (Tok.is(tok::comma)
+ && !(Tok.getFlags() & Token::IgnoredComma) && NumParens == 0) {
+ // Comma ends this argument if there are more fixed arguments expected.
+ // However, if this is a variadic macro, and this is part of the
+ // variadic part, then the comma is just an argument token.
+ if (!isVariadic) break;
+ if (NumFixedArgsLeft > 1)
+ break;
+ } else if (Tok.is(tok::comment) && !KeepMacroComments) {
+ // If this is a comment token in the argument list and we're just in
+ // -C mode (not -CC mode), discard the comment.
+ continue;
+ } else if (Tok.getIdentifierInfo() != 0) {
+ // Reading macro arguments can cause macros that we are currently
+ // expanding from to be popped off the expansion stack. Doing so causes
+ // them to be reenabled for expansion. Here we record whether any
+ // identifiers we lex as macro arguments correspond to disabled macros.
+ // If so, we mark the token as noexpand. This is a subtle aspect of
+ // C99 6.10.3.4p2.
+ if (MacroInfo *MI = getMacroInfo(Tok.getIdentifierInfo()))
+ if (!MI->isEnabled())
+ Tok.setFlag(Token::DisableExpand);
+ } else if (Tok.is(tok::code_completion)) {
+ if (CodeComplete)
+ CodeComplete->CodeCompleteMacroArgument(MacroName.getIdentifierInfo(),
+ MI, NumActuals);
+ // Don't mark that we reached the code-completion point because the
+ // parser is going to handle the token and there will be another
+ // code-completion callback.
+ }
+
+ ArgTokens.push_back(Tok);
+ }
+
+ // If this was an empty argument list foo(), don't add this as an empty
+ // argument.
+ if (ArgTokens.empty() && Tok.getKind() == tok::r_paren)
+ break;
+
+ // If this is not a variadic macro, and too many args were specified, emit
+ // an error.
+ if (!isVariadic && NumFixedArgsLeft == 0) {
+ if (ArgTokens.size() != ArgTokenStart)
+ ArgStartLoc = ArgTokens[ArgTokenStart].getLocation();
+
+ // Emit the diagnostic at the macro name in case there is a missing ).
+ // Emitting it at the , could be far away from the macro name.
+ Diag(ArgStartLoc, diag::err_too_many_args_in_macro_invoc);
+ return 0;
+ }
+
+ // Empty arguments are standard in C99 and C++0x, and are supported as an extension in
+ // other modes.
+ if (ArgTokens.size() == ArgTokenStart && !LangOpts.C99)
+ Diag(Tok, LangOpts.CPlusPlus0x ?
+ diag::warn_cxx98_compat_empty_fnmacro_arg :
+ diag::ext_empty_fnmacro_arg);
+
+ // Add a marker EOF token to the end of the token list for this argument.
+ Token EOFTok;
+ EOFTok.startToken();
+ EOFTok.setKind(tok::eof);
+ EOFTok.setLocation(Tok.getLocation());
+ EOFTok.setLength(0);
+ ArgTokens.push_back(EOFTok);
+ ++NumActuals;
+ assert(NumFixedArgsLeft != 0 && "Too many arguments parsed");
+ --NumFixedArgsLeft;
+ }
+
+ // Okay, we either found the r_paren. Check to see if we parsed too few
+ // arguments.
+ unsigned MinArgsExpected = MI->getNumArgs();
+
+ // See MacroArgs instance var for description of this.
+ bool isVarargsElided = false;
+
+ if (NumActuals < MinArgsExpected) {
+ // There are several cases where too few arguments is ok, handle them now.
+ if (NumActuals == 0 && MinArgsExpected == 1) {
+ // #define A(X) or #define A(...) ---> A()
+
+ // If there is exactly one argument, and that argument is missing,
+ // then we have an empty "()" argument empty list. This is fine, even if
+ // the macro expects one argument (the argument is just empty).
+ isVarargsElided = MI->isVariadic();
+ } else if (MI->isVariadic() &&
+ (NumActuals+1 == MinArgsExpected || // A(x, ...) -> A(X)
+ (NumActuals == 0 && MinArgsExpected == 2))) {// A(x,...) -> A()
+ // Varargs where the named vararg parameter is missing: OK as extension.
+ // #define A(x, ...)
+ // A("blah")
+ Diag(Tok, diag::ext_missing_varargs_arg);
+ Diag(MI->getDefinitionLoc(), diag::note_macro_here)
+ << MacroName.getIdentifierInfo();
+
+ // Remember this occurred, allowing us to elide the comma when used for
+ // cases like:
+ // #define A(x, foo...) blah(a, ## foo)
+ // #define B(x, ...) blah(a, ## __VA_ARGS__)
+ // #define C(...) blah(a, ## __VA_ARGS__)
+ // A(x) B(x) C()
+ isVarargsElided = true;
+ } else {
+ // Otherwise, emit the error.
+ Diag(Tok, diag::err_too_few_args_in_macro_invoc);
+ return 0;
+ }
+
+ // Add a marker EOF token to the end of the token list for this argument.
+ SourceLocation EndLoc = Tok.getLocation();
+ Tok.startToken();
+ Tok.setKind(tok::eof);
+ Tok.setLocation(EndLoc);
+ Tok.setLength(0);
+ ArgTokens.push_back(Tok);
+
+ // If we expect two arguments, add both as empty.
+ if (NumActuals == 0 && MinArgsExpected == 2)
+ ArgTokens.push_back(Tok);
+
+ } else if (NumActuals > MinArgsExpected && !MI->isVariadic()) {
+ // Emit the diagnostic at the macro name in case there is a missing ).
+ // Emitting it at the , could be far away from the macro name.
+ Diag(MacroName, diag::err_too_many_args_in_macro_invoc);
+ return 0;
+ }
+
+ return MacroArgs::create(MI, ArgTokens, isVarargsElided, *this);
+}
+
+/// \brief Keeps macro expanded tokens for TokenLexers.
+//
+/// Works like a stack; a TokenLexer adds the macro expanded tokens that is
+/// going to lex in the cache and when it finishes the tokens are removed
+/// from the end of the cache.
+Token *Preprocessor::cacheMacroExpandedTokens(TokenLexer *tokLexer,
+ ArrayRef<Token> tokens) {
+ assert(tokLexer);
+ if (tokens.empty())
+ return 0;
+
+ size_t newIndex = MacroExpandedTokens.size();
+ bool cacheNeedsToGrow = tokens.size() >
+ MacroExpandedTokens.capacity()-MacroExpandedTokens.size();
+ MacroExpandedTokens.append(tokens.begin(), tokens.end());
+
+ if (cacheNeedsToGrow) {
+ // Go through all the TokenLexers whose 'Tokens' pointer points in the
+ // buffer and update the pointers to the (potential) new buffer array.
+ for (unsigned i = 0, e = MacroExpandingLexersStack.size(); i != e; ++i) {
+ TokenLexer *prevLexer;
+ size_t tokIndex;
+ llvm::tie(prevLexer, tokIndex) = MacroExpandingLexersStack[i];
+ prevLexer->Tokens = MacroExpandedTokens.data() + tokIndex;
+ }
+ }
+
+ MacroExpandingLexersStack.push_back(std::make_pair(tokLexer, newIndex));
+ return MacroExpandedTokens.data() + newIndex;
+}
+
+void Preprocessor::removeCachedMacroExpandedTokensOfLastLexer() {
+ assert(!MacroExpandingLexersStack.empty());
+ size_t tokIndex = MacroExpandingLexersStack.back().second;
+ assert(tokIndex < MacroExpandedTokens.size());
+ // Pop the cached macro expanded tokens from the end.
+ MacroExpandedTokens.resize(tokIndex);
+ MacroExpandingLexersStack.pop_back();
+}
+
+/// ComputeDATE_TIME - Compute the current time, enter it into the specified
+/// scratch buffer, then return DATELoc/TIMELoc locations with the position of
+/// the identifier tokens inserted.
+static void ComputeDATE_TIME(SourceLocation &DATELoc, SourceLocation &TIMELoc,
+ Preprocessor &PP) {
+ time_t TT = time(0);
+ struct tm *TM = localtime(&TT);
+
+ static const char * const Months[] = {
+ "Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"
+ };
+
+ char TmpBuffer[32];
+#ifdef LLVM_ON_WIN32
+ sprintf(TmpBuffer, "\"%s %2d %4d\"", Months[TM->tm_mon], TM->tm_mday,
+ TM->tm_year+1900);
+#else
+ snprintf(TmpBuffer, sizeof(TmpBuffer), "\"%s %2d %4d\"", Months[TM->tm_mon], TM->tm_mday,
+ TM->tm_year+1900);
+#endif
+
+ Token TmpTok;
+ TmpTok.startToken();
+ PP.CreateString(TmpBuffer, strlen(TmpBuffer), TmpTok);
+ DATELoc = TmpTok.getLocation();
+
+#ifdef LLVM_ON_WIN32
+ sprintf(TmpBuffer, "\"%02d:%02d:%02d\"", TM->tm_hour, TM->tm_min, TM->tm_sec);
+#else
+ snprintf(TmpBuffer, sizeof(TmpBuffer), "\"%02d:%02d:%02d\"", TM->tm_hour, TM->tm_min, TM->tm_sec);
+#endif
+ PP.CreateString(TmpBuffer, strlen(TmpBuffer), TmpTok);
+ TIMELoc = TmpTok.getLocation();
+}
+
+
+/// HasFeature - Return true if we recognize and implement the feature
+/// specified by the identifier as a standard language feature.
+static bool HasFeature(const Preprocessor &PP, const IdentifierInfo *II) {
+ const LangOptions &LangOpts = PP.getLangOpts();
+ StringRef Feature = II->getName();
+
+ // Normalize the feature name, __foo__ becomes foo.
+ if (Feature.startswith("__") && Feature.endswith("__") && Feature.size() >= 4)
+ Feature = Feature.substr(2, Feature.size() - 4);
+
+ return llvm::StringSwitch<bool>(Feature)
+ .Case("address_sanitizer", LangOpts.AddressSanitizer)
+ .Case("attribute_analyzer_noreturn", true)
+ .Case("attribute_availability", true)
+ .Case("attribute_availability_with_message", true)
+ .Case("attribute_cf_returns_not_retained", true)
+ .Case("attribute_cf_returns_retained", true)
+ .Case("attribute_deprecated_with_message", true)
+ .Case("attribute_ext_vector_type", true)
+ .Case("attribute_ns_returns_not_retained", true)
+ .Case("attribute_ns_returns_retained", true)
+ .Case("attribute_ns_consumes_self", true)
+ .Case("attribute_ns_consumed", true)
+ .Case("attribute_cf_consumed", true)
+ .Case("attribute_objc_ivar_unused", true)
+ .Case("attribute_objc_method_family", true)
+ .Case("attribute_overloadable", true)
+ .Case("attribute_unavailable_with_message", true)
+ .Case("attribute_unused_on_fields", true)
+ .Case("blocks", LangOpts.Blocks)
+ .Case("cxx_exceptions", LangOpts.Exceptions)
+ .Case("cxx_rtti", LangOpts.RTTI)
+ .Case("enumerator_attributes", true)
+ // Objective-C features
+ .Case("objc_arr", LangOpts.ObjCAutoRefCount) // FIXME: REMOVE?
+ .Case("objc_arc", LangOpts.ObjCAutoRefCount)
+ .Case("objc_arc_weak", LangOpts.ObjCARCWeak)
+ .Case("objc_default_synthesize_properties", LangOpts.ObjC2)
+ .Case("objc_fixed_enum", LangOpts.ObjC2)
+ .Case("objc_instancetype", LangOpts.ObjC2)
+ .Case("objc_modules", LangOpts.ObjC2 && LangOpts.Modules)
+ .Case("objc_nonfragile_abi", LangOpts.ObjCRuntime.isNonFragile())
+ .Case("objc_weak_class", LangOpts.ObjCRuntime.hasWeakClassImport())
+ .Case("ownership_holds", true)
+ .Case("ownership_returns", true)
+ .Case("ownership_takes", true)
+ .Case("objc_bool", true)
+ .Case("objc_subscripting", LangOpts.ObjCRuntime.isNonFragile())
+ .Case("objc_array_literals", LangOpts.ObjC2)
+ .Case("objc_dictionary_literals", LangOpts.ObjC2)
+ .Case("objc_boxed_expressions", LangOpts.ObjC2)
+ .Case("arc_cf_code_audited", true)
+ // C11 features
+ .Case("c_alignas", LangOpts.C11)
+ .Case("c_atomic", LangOpts.C11)
+ .Case("c_generic_selections", LangOpts.C11)
+ .Case("c_static_assert", LangOpts.C11)
+ // C++11 features
+ .Case("cxx_access_control_sfinae", LangOpts.CPlusPlus0x)
+ .Case("cxx_alias_templates", LangOpts.CPlusPlus0x)
+ .Case("cxx_alignas", LangOpts.CPlusPlus0x)
+ .Case("cxx_atomic", LangOpts.CPlusPlus0x)
+ .Case("cxx_attributes", LangOpts.CPlusPlus0x)
+ .Case("cxx_auto_type", LangOpts.CPlusPlus0x)
+ .Case("cxx_constexpr", LangOpts.CPlusPlus0x)
+ .Case("cxx_decltype", LangOpts.CPlusPlus0x)
+ .Case("cxx_decltype_incomplete_return_types", LangOpts.CPlusPlus0x)
+ .Case("cxx_default_function_template_args", LangOpts.CPlusPlus0x)
+ .Case("cxx_defaulted_functions", LangOpts.CPlusPlus0x)
+ .Case("cxx_delegating_constructors", LangOpts.CPlusPlus0x)
+ .Case("cxx_deleted_functions", LangOpts.CPlusPlus0x)
+ .Case("cxx_explicit_conversions", LangOpts.CPlusPlus0x)
+ .Case("cxx_generalized_initializers", LangOpts.CPlusPlus0x)
+ .Case("cxx_implicit_moves", LangOpts.CPlusPlus0x)
+ //.Case("cxx_inheriting_constructors", false)
+ .Case("cxx_inline_namespaces", LangOpts.CPlusPlus0x)
+ .Case("cxx_lambdas", LangOpts.CPlusPlus0x)
+ .Case("cxx_local_type_template_args", LangOpts.CPlusPlus0x)
+ .Case("cxx_nonstatic_member_init", LangOpts.CPlusPlus0x)
+ .Case("cxx_noexcept", LangOpts.CPlusPlus0x)
+ .Case("cxx_nullptr", LangOpts.CPlusPlus0x)
+ .Case("cxx_override_control", LangOpts.CPlusPlus0x)
+ .Case("cxx_range_for", LangOpts.CPlusPlus0x)
+ .Case("cxx_raw_string_literals", LangOpts.CPlusPlus0x)
+ .Case("cxx_reference_qualified_functions", LangOpts.CPlusPlus0x)
+ .Case("cxx_rvalue_references", LangOpts.CPlusPlus0x)
+ .Case("cxx_strong_enums", LangOpts.CPlusPlus0x)
+ .Case("cxx_static_assert", LangOpts.CPlusPlus0x)
+ .Case("cxx_trailing_return", LangOpts.CPlusPlus0x)
+ .Case("cxx_unicode_literals", LangOpts.CPlusPlus0x)
+ .Case("cxx_unrestricted_unions", LangOpts.CPlusPlus0x)
+ .Case("cxx_user_literals", LangOpts.CPlusPlus0x)
+ .Case("cxx_variadic_templates", LangOpts.CPlusPlus0x)
+ // Type traits
+ .Case("has_nothrow_assign", LangOpts.CPlusPlus)
+ .Case("has_nothrow_copy", LangOpts.CPlusPlus)
+ .Case("has_nothrow_constructor", LangOpts.CPlusPlus)
+ .Case("has_trivial_assign", LangOpts.CPlusPlus)
+ .Case("has_trivial_copy", LangOpts.CPlusPlus)
+ .Case("has_trivial_constructor", LangOpts.CPlusPlus)
+ .Case("has_trivial_destructor", LangOpts.CPlusPlus)
+ .Case("has_virtual_destructor", LangOpts.CPlusPlus)
+ .Case("is_abstract", LangOpts.CPlusPlus)
+ .Case("is_base_of", LangOpts.CPlusPlus)
+ .Case("is_class", LangOpts.CPlusPlus)
+ .Case("is_convertible_to", LangOpts.CPlusPlus)
+ // __is_empty is available only if the horrible
+ // "struct __is_empty" parsing hack hasn't been needed in this
+ // translation unit. If it has, __is_empty reverts to a normal
+ // identifier and __has_feature(is_empty) evaluates false.
+ .Case("is_empty", LangOpts.CPlusPlus)
+ .Case("is_enum", LangOpts.CPlusPlus)
+ .Case("is_final", LangOpts.CPlusPlus)
+ .Case("is_literal", LangOpts.CPlusPlus)
+ .Case("is_standard_layout", LangOpts.CPlusPlus)
+ .Case("is_pod", LangOpts.CPlusPlus)
+ .Case("is_polymorphic", LangOpts.CPlusPlus)
+ .Case("is_trivial", LangOpts.CPlusPlus)
+ .Case("is_trivially_assignable", LangOpts.CPlusPlus)
+ .Case("is_trivially_constructible", LangOpts.CPlusPlus)
+ .Case("is_trivially_copyable", LangOpts.CPlusPlus)
+ .Case("is_union", LangOpts.CPlusPlus)
+ .Case("modules", LangOpts.Modules)
+ .Case("tls", PP.getTargetInfo().isTLSSupported())
+ .Case("underlying_type", LangOpts.CPlusPlus)
+ .Default(false);
+}
+
+/// HasExtension - Return true if we recognize and implement the feature
+/// specified by the identifier, either as an extension or a standard language
+/// feature.
+static bool HasExtension(const Preprocessor &PP, const IdentifierInfo *II) {
+ if (HasFeature(PP, II))
+ return true;
+
+ // If the use of an extension results in an error diagnostic, extensions are
+ // effectively unavailable, so just return false here.
+ if (PP.getDiagnostics().getExtensionHandlingBehavior() ==
+ DiagnosticsEngine::Ext_Error)
+ return false;
+
+ const LangOptions &LangOpts = PP.getLangOpts();
+ StringRef Extension = II->getName();
+
+ // Normalize the extension name, __foo__ becomes foo.
+ if (Extension.startswith("__") && Extension.endswith("__") &&
+ Extension.size() >= 4)
+ Extension = Extension.substr(2, Extension.size() - 4);
+
+ // Because we inherit the feature list from HasFeature, this string switch
+ // must be less restrictive than HasFeature's.
+ return llvm::StringSwitch<bool>(Extension)
+ // C11 features supported by other languages as extensions.
+ .Case("c_alignas", true)
+ .Case("c_atomic", true)
+ .Case("c_generic_selections", true)
+ .Case("c_static_assert", true)
+ // C++0x features supported by other languages as extensions.
+ .Case("cxx_atomic", LangOpts.CPlusPlus)
+ .Case("cxx_deleted_functions", LangOpts.CPlusPlus)
+ .Case("cxx_explicit_conversions", LangOpts.CPlusPlus)
+ .Case("cxx_inline_namespaces", LangOpts.CPlusPlus)
+ .Case("cxx_local_type_template_args", LangOpts.CPlusPlus)
+ .Case("cxx_nonstatic_member_init", LangOpts.CPlusPlus)
+ .Case("cxx_override_control", LangOpts.CPlusPlus)
+ .Case("cxx_range_for", LangOpts.CPlusPlus)
+ .Case("cxx_reference_qualified_functions", LangOpts.CPlusPlus)
+ .Case("cxx_rvalue_references", LangOpts.CPlusPlus)
+ .Default(false);
+}
+
+/// HasAttribute - Return true if we recognize and implement the attribute
+/// specified by the given identifier.
+static bool HasAttribute(const IdentifierInfo *II) {
+ StringRef Name = II->getName();
+ // Normalize the attribute name, __foo__ becomes foo.
+ if (Name.startswith("__") && Name.endswith("__") && Name.size() >= 4)
+ Name = Name.substr(2, Name.size() - 4);
+
+ // FIXME: Do we need to handle namespaces here?
+ return llvm::StringSwitch<bool>(Name)
+#include "clang/Lex/AttrSpellings.inc"
+ .Default(false);
+}
+
+/// EvaluateHasIncludeCommon - Process a '__has_include("path")'
+/// or '__has_include_next("path")' expression.
+/// Returns true if successful.
+static bool EvaluateHasIncludeCommon(Token &Tok,
+ IdentifierInfo *II, Preprocessor &PP,
+ const DirectoryLookup *LookupFrom) {
+ SourceLocation LParenLoc;
+
+ // Get '('.
+ PP.LexNonComment(Tok);
+
+ // Ensure we have a '('.
+ if (Tok.isNot(tok::l_paren)) {
+ PP.Diag(Tok.getLocation(), diag::err_pp_missing_lparen) << II->getName();
+ return false;
+ }
+
+ // Save '(' location for possible missing ')' message.
+ LParenLoc = Tok.getLocation();
+
+ // Get the file name.
+ PP.getCurrentLexer()->LexIncludeFilename(Tok);
+
+ // Reserve a buffer to get the spelling.
+ SmallString<128> FilenameBuffer;
+ StringRef Filename;
+ SourceLocation EndLoc;
+
+ switch (Tok.getKind()) {
+ case tok::eod:
+ // If the token kind is EOD, the error has already been diagnosed.
+ return false;
+
+ case tok::angle_string_literal:
+ case tok::string_literal: {
+ bool Invalid = false;
+ Filename = PP.getSpelling(Tok, FilenameBuffer, &Invalid);
+ if (Invalid)
+ return false;
+ break;
+ }
+
+ case tok::less:
+ // This could be a <foo/bar.h> file coming from a macro expansion. In this
+ // case, glue the tokens together into FilenameBuffer and interpret those.
+ FilenameBuffer.push_back('<');
+ if (PP.ConcatenateIncludeName(FilenameBuffer, EndLoc))
+ return false; // Found <eod> but no ">"? Diagnostic already emitted.
+ Filename = FilenameBuffer.str();
+ break;
+ default:
+ PP.Diag(Tok.getLocation(), diag::err_pp_expects_filename);
+ return false;
+ }
+
+ // Get ')'.
+ PP.LexNonComment(Tok);
+
+ // Ensure we have a trailing ).
+ if (Tok.isNot(tok::r_paren)) {
+ PP.Diag(Tok.getLocation(), diag::err_pp_missing_rparen) << II->getName();
+ PP.Diag(LParenLoc, diag::note_matching) << "(";
+ return false;
+ }
+
+ bool isAngled = PP.GetIncludeFilenameSpelling(Tok.getLocation(), Filename);
+ // If GetIncludeFilenameSpelling set the start ptr to null, there was an
+ // error.
+ if (Filename.empty())
+ return false;
+
+ // Search include directories.
+ const DirectoryLookup *CurDir;
+ const FileEntry *File =
+ PP.LookupFile(Filename, isAngled, LookupFrom, CurDir, NULL, NULL, NULL);
+
+ // Get the result value. A result of true means the file exists.
+ return File != 0;
+}
+
+/// EvaluateHasInclude - Process a '__has_include("path")' expression.
+/// Returns true if successful.
+static bool EvaluateHasInclude(Token &Tok, IdentifierInfo *II,
+ Preprocessor &PP) {
+ return EvaluateHasIncludeCommon(Tok, II, PP, NULL);
+}
+
+/// EvaluateHasIncludeNext - Process '__has_include_next("path")' expression.
+/// Returns true if successful.
+static bool EvaluateHasIncludeNext(Token &Tok,
+ IdentifierInfo *II, Preprocessor &PP) {
+ // __has_include_next is like __has_include, except that we start
+ // searching after the current found directory. If we can't do this,
+ // issue a diagnostic.
+ const DirectoryLookup *Lookup = PP.GetCurDirLookup();
+ if (PP.isInPrimaryFile()) {
+ Lookup = 0;
+ PP.Diag(Tok, diag::pp_include_next_in_primary);
+ } else if (Lookup == 0) {
+ PP.Diag(Tok, diag::pp_include_next_absolute_path);
+ } else {
+ // Start looking up in the next directory.
+ ++Lookup;
+ }
+
+ return EvaluateHasIncludeCommon(Tok, II, PP, Lookup);
+}
+
+/// ExpandBuiltinMacro - If an identifier token is read that is to be expanded
+/// as a builtin macro, handle it and return the next token as 'Tok'.
+void Preprocessor::ExpandBuiltinMacro(Token &Tok) {
+ // Figure out which token this is.
+ IdentifierInfo *II = Tok.getIdentifierInfo();
+ assert(II && "Can't be a macro without id info!");
+
+ // If this is an _Pragma or Microsoft __pragma directive, expand it,
+ // invoke the pragma handler, then lex the token after it.
+ if (II == Ident_Pragma)
+ return Handle_Pragma(Tok);
+ else if (II == Ident__pragma) // in non-MS mode this is null
+ return HandleMicrosoft__pragma(Tok);
+
+ ++NumBuiltinMacroExpanded;
+
+ SmallString<128> TmpBuffer;
+ llvm::raw_svector_ostream OS(TmpBuffer);
+
+ // Set up the return result.
+ Tok.setIdentifierInfo(0);
+ Tok.clearFlag(Token::NeedsCleaning);
+
+ if (II == Ident__LINE__) {
+ // C99 6.10.8: "__LINE__: The presumed line number (within the current
+ // source file) of the current source line (an integer constant)". This can
+ // be affected by #line.
+ SourceLocation Loc = Tok.getLocation();
+
+ // Advance to the location of the first _, this might not be the first byte
+ // of the token if it starts with an escaped newline.
+ Loc = AdvanceToTokenCharacter(Loc, 0);
+
+ // One wrinkle here is that GCC expands __LINE__ to location of the *end* of
+ // a macro expansion. This doesn't matter for object-like macros, but
+ // can matter for a function-like macro that expands to contain __LINE__.
+ // Skip down through expansion points until we find a file loc for the
+ // end of the expansion history.
+ Loc = SourceMgr.getExpansionRange(Loc).second;
+ PresumedLoc PLoc = SourceMgr.getPresumedLoc(Loc);
+
+ // __LINE__ expands to a simple numeric value.
+ OS << (PLoc.isValid()? PLoc.getLine() : 1);
+ Tok.setKind(tok::numeric_constant);
+ } else if (II == Ident__FILE__ || II == Ident__BASE_FILE__) {
+ // C99 6.10.8: "__FILE__: The presumed name of the current source file (a
+ // character string literal)". This can be affected by #line.
+ PresumedLoc PLoc = SourceMgr.getPresumedLoc(Tok.getLocation());
+
+ // __BASE_FILE__ is a GNU extension that returns the top of the presumed
+ // #include stack instead of the current file.
+ if (II == Ident__BASE_FILE__ && PLoc.isValid()) {
+ SourceLocation NextLoc = PLoc.getIncludeLoc();
+ while (NextLoc.isValid()) {
+ PLoc = SourceMgr.getPresumedLoc(NextLoc);
+ if (PLoc.isInvalid())
+ break;
+
+ NextLoc = PLoc.getIncludeLoc();
+ }
+ }
+
+ // Escape this filename. Turn '\' -> '\\' '"' -> '\"'
+ SmallString<128> FN;
+ if (PLoc.isValid()) {
+ FN += PLoc.getFilename();
+ Lexer::Stringify(FN);
+ OS << '"' << FN.str() << '"';
+ }
+ Tok.setKind(tok::string_literal);
+ } else if (II == Ident__DATE__) {
+ if (!DATELoc.isValid())
+ ComputeDATE_TIME(DATELoc, TIMELoc, *this);
+ Tok.setKind(tok::string_literal);
+ Tok.setLength(strlen("\"Mmm dd yyyy\""));
+ Tok.setLocation(SourceMgr.createExpansionLoc(DATELoc, Tok.getLocation(),
+ Tok.getLocation(),
+ Tok.getLength()));
+ return;
+ } else if (II == Ident__TIME__) {
+ if (!TIMELoc.isValid())
+ ComputeDATE_TIME(DATELoc, TIMELoc, *this);
+ Tok.setKind(tok::string_literal);
+ Tok.setLength(strlen("\"hh:mm:ss\""));
+ Tok.setLocation(SourceMgr.createExpansionLoc(TIMELoc, Tok.getLocation(),
+ Tok.getLocation(),
+ Tok.getLength()));
+ return;
+ } else if (II == Ident__INCLUDE_LEVEL__) {
+ // Compute the presumed include depth of this token. This can be affected
+ // by GNU line markers.
+ unsigned Depth = 0;
+
+ PresumedLoc PLoc = SourceMgr.getPresumedLoc(Tok.getLocation());
+ if (PLoc.isValid()) {
+ PLoc = SourceMgr.getPresumedLoc(PLoc.getIncludeLoc());
+ for (; PLoc.isValid(); ++Depth)
+ PLoc = SourceMgr.getPresumedLoc(PLoc.getIncludeLoc());
+ }
+
+ // __INCLUDE_LEVEL__ expands to a simple numeric value.
+ OS << Depth;
+ Tok.setKind(tok::numeric_constant);
+ } else if (II == Ident__TIMESTAMP__) {
+ // MSVC, ICC, GCC, VisualAge C++ extension. The generated string should be
+ // of the form "Ddd Mmm dd hh::mm::ss yyyy", which is returned by asctime.
+
+ // Get the file that we are lexing out of. If we're currently lexing from
+ // a macro, dig into the include stack.
+ const FileEntry *CurFile = 0;
+ PreprocessorLexer *TheLexer = getCurrentFileLexer();
+
+ if (TheLexer)
+ CurFile = SourceMgr.getFileEntryForID(TheLexer->getFileID());
+
+ const char *Result;
+ if (CurFile) {
+ time_t TT = CurFile->getModificationTime();
+ struct tm *TM = localtime(&TT);
+ Result = asctime(TM);
+ } else {
+ Result = "??? ??? ?? ??:??:?? ????\n";
+ }
+ // Surround the string with " and strip the trailing newline.
+ OS << '"' << StringRef(Result, strlen(Result)-1) << '"';
+ Tok.setKind(tok::string_literal);
+ } else if (II == Ident__COUNTER__) {
+ // __COUNTER__ expands to a simple numeric value.
+ OS << CounterValue++;
+ Tok.setKind(tok::numeric_constant);
+ } else if (II == Ident__has_feature ||
+ II == Ident__has_extension ||
+ II == Ident__has_builtin ||
+ II == Ident__has_attribute) {
+ // The argument to these builtins should be a parenthesized identifier.
+ SourceLocation StartLoc = Tok.getLocation();
+
+ bool IsValid = false;
+ IdentifierInfo *FeatureII = 0;
+
+ // Read the '('.
+ Lex(Tok);
+ if (Tok.is(tok::l_paren)) {
+ // Read the identifier
+ Lex(Tok);
+ if (Tok.is(tok::identifier) || Tok.is(tok::kw_const)) {
+ FeatureII = Tok.getIdentifierInfo();
+
+ // Read the ')'.
+ Lex(Tok);
+ if (Tok.is(tok::r_paren))
+ IsValid = true;
+ }
+ }
+
+ bool Value = false;
+ if (!IsValid)
+ Diag(StartLoc, diag::err_feature_check_malformed);
+ else if (II == Ident__has_builtin) {
+ // Check for a builtin is trivial.
+ Value = FeatureII->getBuiltinID() != 0;
+ } else if (II == Ident__has_attribute)
+ Value = HasAttribute(FeatureII);
+ else if (II == Ident__has_extension)
+ Value = HasExtension(*this, FeatureII);
+ else {
+ assert(II == Ident__has_feature && "Must be feature check");
+ Value = HasFeature(*this, FeatureII);
+ }
+
+ OS << (int)Value;
+ if (IsValid)
+ Tok.setKind(tok::numeric_constant);
+ } else if (II == Ident__has_include ||
+ II == Ident__has_include_next) {
+ // The argument to these two builtins should be a parenthesized
+ // file name string literal using angle brackets (<>) or
+ // double-quotes ("").
+ bool Value;
+ if (II == Ident__has_include)
+ Value = EvaluateHasInclude(Tok, II, *this);
+ else
+ Value = EvaluateHasIncludeNext(Tok, II, *this);
+ OS << (int)Value;
+ Tok.setKind(tok::numeric_constant);
+ } else if (II == Ident__has_warning) {
+ // The argument should be a parenthesized string literal.
+ // The argument to these builtins should be a parenthesized identifier.
+ SourceLocation StartLoc = Tok.getLocation();
+ bool IsValid = false;
+ bool Value = false;
+ // Read the '('.
+ Lex(Tok);
+ do {
+ if (Tok.is(tok::l_paren)) {
+ // Read the string.
+ Lex(Tok);
+
+ // We need at least one string literal.
+ if (!Tok.is(tok::string_literal)) {
+ StartLoc = Tok.getLocation();
+ IsValid = false;
+ // Eat tokens until ')'.
+ do Lex(Tok); while (!(Tok.is(tok::r_paren) || Tok.is(tok::eod)));
+ break;
+ }
+
+ // String concatenation allows multiple strings, which can even come
+ // from macro expansion.
+ SmallVector<Token, 4> StrToks;
+ while (Tok.is(tok::string_literal)) {
+ // Complain about, and drop, any ud-suffix.
+ if (Tok.hasUDSuffix())
+ Diag(Tok, diag::err_invalid_string_udl);
+ StrToks.push_back(Tok);
+ LexUnexpandedToken(Tok);
+ }
+
+ // Is the end a ')'?
+ if (!(IsValid = Tok.is(tok::r_paren)))
+ break;
+
+ // Concatenate and parse the strings.
+ StringLiteralParser Literal(&StrToks[0], StrToks.size(), *this);
+ assert(Literal.isAscii() && "Didn't allow wide strings in");
+ if (Literal.hadError)
+ break;
+ if (Literal.Pascal) {
+ Diag(Tok, diag::warn_pragma_diagnostic_invalid);
+ break;
+ }
+
+ StringRef WarningName(Literal.GetString());
+
+ if (WarningName.size() < 3 || WarningName[0] != '-' ||
+ WarningName[1] != 'W') {
+ Diag(StrToks[0].getLocation(), diag::warn_has_warning_invalid_option);
+ break;
+ }
+
+ // Finally, check if the warning flags maps to a diagnostic group.
+ // We construct a SmallVector here to talk to getDiagnosticIDs().
+ // Although we don't use the result, this isn't a hot path, and not
+ // worth special casing.
+ llvm::SmallVector<diag::kind, 10> Diags;
+ Value = !getDiagnostics().getDiagnosticIDs()->
+ getDiagnosticsInGroup(WarningName.substr(2), Diags);
+ }
+ } while (false);
+
+ if (!IsValid)
+ Diag(StartLoc, diag::err_warning_check_malformed);
+
+ OS << (int)Value;
+ Tok.setKind(tok::numeric_constant);
+ } else {
+ llvm_unreachable("Unknown identifier!");
+ }
+ CreateString(OS.str().data(), OS.str().size(), Tok,
+ Tok.getLocation(), Tok.getLocation());
+}
+
+void Preprocessor::markMacroAsUsed(MacroInfo *MI) {
+ // If the 'used' status changed, and the macro requires 'unused' warning,
+ // remove its SourceLocation from the warn-for-unused-macro locations.
+ if (MI->isWarnIfUnused() && !MI->isUsed())
+ WarnUnusedMacroLocs.erase(MI->getDefinitionLoc());
+ MI->setIsUsed(true);
+}
projects / clang / commitdiff