2008-03-09 12:10:46 +08:00
|
|
|
//===--- PPLexerChange.cpp - Handle changing lexers in the preprocessor ---===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements pieces of the Preprocessor interface that manage the
|
|
|
|
// current lexer stack.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "clang/Lex/Preprocessor.h"
|
2011-10-17 23:32:29 +08:00
|
|
|
#include "clang/Basic/FileManager.h"
|
2008-03-09 12:10:46 +08:00
|
|
|
#include "clang/Basic/SourceManager.h"
|
2012-12-04 17:13:33 +08:00
|
|
|
#include "clang/Lex/HeaderSearch.h"
|
|
|
|
#include "clang/Lex/LexDiagnostic.h"
|
|
|
|
#include "clang/Lex/MacroInfo.h"
|
2015-11-03 01:53:55 +08:00
|
|
|
#include "clang/Lex/PTHManager.h"
|
2012-12-04 17:13:33 +08:00
|
|
|
#include "llvm/ADT/StringSwitch.h"
|
2011-12-23 08:23:59 +08:00
|
|
|
#include "llvm/Support/FileSystem.h"
|
2008-11-20 15:56:33 +08:00
|
|
|
#include "llvm/Support/MemoryBuffer.h"
|
2013-06-12 06:15:02 +08:00
|
|
|
#include "llvm/Support/Path.h"
|
2008-03-09 12:10:46 +08:00
|
|
|
using namespace clang;
|
|
|
|
|
2015-10-20 21:23:58 +08:00
|
|
|
PPCallbacks::~PPCallbacks() {}
|
2008-03-09 12:10:46 +08:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2008-03-10 14:06:04 +08:00
|
|
|
// Miscellaneous Methods.
|
2008-03-09 12:10:46 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// isInPrimaryFile - Return true if we're in the top-level file, not in a
|
2012-06-22 13:36:05 +08:00
|
|
|
/// \#include. This looks through macro expansions and active _Pragma lexers.
|
2008-03-09 12:10:46 +08:00
|
|
|
bool Preprocessor::isInPrimaryFile() const {
|
2008-11-21 00:19:53 +08:00
|
|
|
if (IsFileLexer())
|
2008-03-09 12:10:46 +08:00
|
|
|
return IncludeMacroStack.empty();
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// If there are any stacked lexers, we're in a #include.
|
2008-11-21 00:19:53 +08:00
|
|
|
assert(IsFileLexer(IncludeMacroStack[0]) &&
|
2008-03-09 12:10:46 +08:00
|
|
|
"Top level include stack isn't our primary lexer?");
|
2017-09-18 12:55:31 +08:00
|
|
|
return std::none_of(
|
|
|
|
IncludeMacroStack.begin() + 1, IncludeMacroStack.end(),
|
2017-09-18 16:26:01 +08:00
|
|
|
[&](const IncludeStackInfo &ISI) -> bool { return IsFileLexer(ISI); });
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getCurrentLexer - Return the current file lexer being lexed from. Note
|
|
|
|
/// that this ignores any potentially active macro expansions and _Pragma
|
|
|
|
/// expansions going on at the time.
|
2008-11-20 09:49:44 +08:00
|
|
|
PreprocessorLexer *Preprocessor::getCurrentFileLexer() const {
|
2008-11-21 00:19:53 +08:00
|
|
|
if (IsFileLexer())
|
2008-11-20 09:49:44 +08:00
|
|
|
return CurPPLexer;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Look for a stacked lexer.
|
2016-10-26 21:06:13 +08:00
|
|
|
for (const IncludeStackInfo &ISI : llvm::reverse(IncludeMacroStack)) {
|
2008-11-21 00:19:53 +08:00
|
|
|
if (IsFileLexer(ISI))
|
2008-11-20 09:49:44 +08:00
|
|
|
return ISI.ThePPLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
2014-05-18 07:10:59 +08:00
|
|
|
return nullptr;
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
2008-03-10 14:06:04 +08:00
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Methods for Entering and Callbacks for leaving various contexts
|
|
|
|
//===----------------------------------------------------------------------===//
|
2008-03-09 12:10:46 +08:00
|
|
|
|
|
|
|
/// EnterSourceFile - Add a source file to the top of the include stack and
|
2009-11-30 01:07:16 +08:00
|
|
|
/// start lexing tokens from it instead of the current buffer.
|
2014-02-01 04:47:44 +08:00
|
|
|
bool Preprocessor::EnterSourceFile(FileID FID, const DirectoryLookup *CurDir,
|
|
|
|
SourceLocation Loc) {
|
2013-05-15 15:37:26 +08:00
|
|
|
assert(!CurTokenLexer && "Cannot #include a file inside a macro!");
|
2008-03-09 12:10:46 +08:00
|
|
|
++NumEnteredSourceFiles;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
if (MaxIncludeStackDepth < IncludeMacroStack.size())
|
|
|
|
MaxIncludeStackDepth = IncludeMacroStack.size();
|
|
|
|
|
2008-12-03 03:46:31 +08:00
|
|
|
if (PTH) {
|
2009-11-30 12:18:44 +08:00
|
|
|
if (PTHLexer *PL = PTH->CreateLexer(FID)) {
|
2014-02-01 04:47:44 +08:00
|
|
|
EnterSourceFileWithPTH(PL, CurDir);
|
|
|
|
return false;
|
2009-11-30 12:18:44 +08:00
|
|
|
}
|
2008-12-03 03:46:31 +08:00
|
|
|
}
|
2009-11-30 12:18:44 +08:00
|
|
|
|
|
|
|
// Get the MemoryBuffer for this FID, if it fails, we fail.
|
2010-03-17 04:01:30 +08:00
|
|
|
bool Invalid = false;
|
2010-04-21 04:35:58 +08:00
|
|
|
const llvm::MemoryBuffer *InputFile =
|
|
|
|
getSourceManager().getBuffer(FID, Loc, &Invalid);
|
|
|
|
if (Invalid) {
|
|
|
|
SourceLocation FileStart = SourceMgr.getLocForStartOfFile(FID);
|
|
|
|
Diag(Loc, diag::err_pp_error_opening_file)
|
|
|
|
<< std::string(SourceMgr.getBufferName(FileStart)) << "";
|
2014-02-01 04:47:44 +08:00
|
|
|
return true;
|
2010-04-21 04:35:58 +08:00
|
|
|
}
|
2011-09-04 11:32:15 +08:00
|
|
|
|
|
|
|
if (isCodeCompletionEnabled() &&
|
|
|
|
SourceMgr.getFileEntryForID(FID) == CodeCompletionFile) {
|
|
|
|
CodeCompletionFileLoc = SourceMgr.getLocForStartOfFile(FID);
|
|
|
|
CodeCompletionLoc =
|
2011-09-20 04:40:19 +08:00
|
|
|
CodeCompletionFileLoc.getLocWithOffset(CodeCompletionOffset);
|
2011-09-04 11:32:15 +08:00
|
|
|
}
|
|
|
|
|
2014-02-01 04:47:44 +08:00
|
|
|
EnterSourceFileWithLexer(new Lexer(FID, InputFile, *this), CurDir);
|
|
|
|
return false;
|
2009-09-09 23:08:12 +08:00
|
|
|
}
|
2008-09-27 04:12:23 +08:00
|
|
|
|
2008-12-03 03:46:31 +08:00
|
|
|
/// EnterSourceFileWithLexer - Add a source file to the top of the include stack
|
|
|
|
/// and start lexing tokens from it instead of the current buffer.
|
2009-09-09 23:08:12 +08:00
|
|
|
void Preprocessor::EnterSourceFileWithLexer(Lexer *TheLexer,
|
2014-02-01 04:47:44 +08:00
|
|
|
const DirectoryLookup *CurDir) {
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Add the current lexer to the include stack.
|
2008-11-20 05:57:25 +08:00
|
|
|
if (CurPPLexer || CurTokenLexer)
|
2008-11-14 00:51:03 +08:00
|
|
|
PushIncludeMacroStack();
|
|
|
|
|
2008-11-14 01:11:24 +08:00
|
|
|
CurLexer.reset(TheLexer);
|
2008-11-18 08:12:49 +08:00
|
|
|
CurPPLexer = TheLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
CurDirLookup = CurDir;
|
2017-05-04 08:29:54 +08:00
|
|
|
CurLexerSubmodule = nullptr;
|
2011-09-08 07:11:54 +08:00
|
|
|
if (CurLexerKind != CLK_LexAfterModuleImport)
|
|
|
|
CurLexerKind = CLK_Lexer;
|
2015-11-08 00:35:07 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Notify the client, if desired, that we are in a new source file.
|
|
|
|
if (Callbacks && !CurLexer->Is_PragmaLexer) {
|
2008-10-27 09:19:25 +08:00
|
|
|
SrcMgr::CharacteristicKind FileType =
|
2008-09-27 05:18:42 +08:00
|
|
|
SourceMgr.getFileCharacteristic(CurLexer->getFileLoc());
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
Callbacks->FileChanged(CurLexer->getFileLoc(),
|
|
|
|
PPCallbacks::EnterFile, FileType);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-12-03 03:46:31 +08:00
|
|
|
/// EnterSourceFileWithPTH - Add a source file to the top of the include stack
|
|
|
|
/// and start getting tokens from it using the PTH cache.
|
2009-09-09 23:08:12 +08:00
|
|
|
void Preprocessor::EnterSourceFileWithPTH(PTHLexer *PL,
|
2014-02-01 04:47:44 +08:00
|
|
|
const DirectoryLookup *CurDir) {
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-12-03 03:46:31 +08:00
|
|
|
if (CurPPLexer || CurTokenLexer)
|
|
|
|
PushIncludeMacroStack();
|
2008-03-09 12:10:46 +08:00
|
|
|
|
2008-12-03 03:46:31 +08:00
|
|
|
CurDirLookup = CurDir;
|
|
|
|
CurPTHLexer.reset(PL);
|
|
|
|
CurPPLexer = CurPTHLexer.get();
|
2017-05-04 08:29:54 +08:00
|
|
|
CurLexerSubmodule = nullptr;
|
2011-09-08 07:11:54 +08:00
|
|
|
if (CurLexerKind != CLK_LexAfterModuleImport)
|
|
|
|
CurLexerKind = CLK_PTHLexer;
|
|
|
|
|
2008-12-03 03:46:31 +08:00
|
|
|
// Notify the client, if desired, that we are in a new source file.
|
|
|
|
if (Callbacks) {
|
2009-01-17 14:22:33 +08:00
|
|
|
FileID FID = CurPPLexer->getFileID();
|
2009-01-19 16:01:53 +08:00
|
|
|
SourceLocation EnterLoc = SourceMgr.getLocForStartOfFile(FID);
|
|
|
|
SrcMgr::CharacteristicKind FileType =
|
|
|
|
SourceMgr.getFileCharacteristic(EnterLoc);
|
|
|
|
Callbacks->FileChanged(EnterLoc, PPCallbacks::EnterFile, FileType);
|
2008-12-03 03:46:31 +08:00
|
|
|
}
|
|
|
|
}
|
2008-03-09 12:10:46 +08:00
|
|
|
|
|
|
|
/// EnterMacro - Add a Macro to the top of the include stack and start lexing
|
|
|
|
/// tokens from it instead of the current buffer.
|
2009-02-16 04:52:18 +08:00
|
|
|
void Preprocessor::EnterMacro(Token &Tok, SourceLocation ILEnd,
|
2012-08-30 21:38:46 +08:00
|
|
|
MacroInfo *Macro, MacroArgs *Args) {
|
2014-08-30 03:36:52 +08:00
|
|
|
std::unique_ptr<TokenLexer> TokLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
if (NumCachedTokenLexers == 0) {
|
2014-08-30 03:36:52 +08:00
|
|
|
TokLexer = llvm::make_unique<TokenLexer>(Tok, ILEnd, Macro, Args, *this);
|
2008-03-09 12:10:46 +08:00
|
|
|
} else {
|
2014-08-30 03:36:52 +08:00
|
|
|
TokLexer = std::move(TokenLexerCache[--NumCachedTokenLexers]);
|
2012-12-22 12:48:10 +08:00
|
|
|
TokLexer->Init(Tok, ILEnd, Macro, Args);
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
2012-12-22 12:48:10 +08:00
|
|
|
|
|
|
|
PushIncludeMacroStack();
|
2014-05-18 07:10:59 +08:00
|
|
|
CurDirLookup = nullptr;
|
2014-08-30 03:36:52 +08:00
|
|
|
CurTokenLexer = std::move(TokLexer);
|
2011-09-08 07:11:54 +08:00
|
|
|
if (CurLexerKind != CLK_LexAfterModuleImport)
|
|
|
|
CurLexerKind = CLK_TokenLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// EnterTokenStream - Add a "macro" context to the top of the include stack,
|
2008-03-10 14:06:04 +08:00
|
|
|
/// which will cause the lexer to start returning the specified tokens.
|
|
|
|
///
|
|
|
|
/// If DisableMacroExpansion is true, tokens lexed from the token stream will
|
|
|
|
/// not be subject to further macro expansion. Otherwise, these tokens will
|
|
|
|
/// be re-macro-expanded when/if expansion is enabled.
|
|
|
|
///
|
|
|
|
/// If OwnsTokens is false, this method assumes that the specified stream of
|
|
|
|
/// tokens has a permanent owner somewhere, so they do not need to be copied.
|
|
|
|
/// If it is true, it assumes the array of tokens is allocated with new[] and
|
|
|
|
/// must be freed.
|
|
|
|
///
|
|
|
|
void Preprocessor::EnterTokenStream(const Token *Toks, unsigned NumToks,
|
|
|
|
bool DisableMacroExpansion,
|
|
|
|
bool OwnsTokens) {
|
2014-09-24 05:05:52 +08:00
|
|
|
if (CurLexerKind == CLK_CachingLexer) {
|
|
|
|
if (CachedLexPos < CachedTokens.size()) {
|
|
|
|
// We're entering tokens into the middle of our cached token stream. We
|
|
|
|
// can't represent that, so just insert the tokens into the buffer.
|
|
|
|
CachedTokens.insert(CachedTokens.begin() + CachedLexPos,
|
|
|
|
Toks, Toks + NumToks);
|
|
|
|
if (OwnsTokens)
|
|
|
|
delete [] Toks;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// New tokens are at the end of the cached token sequnece; insert the
|
|
|
|
// token stream underneath the caching lexer.
|
|
|
|
ExitCachingLexMode();
|
|
|
|
EnterTokenStream(Toks, NumToks, DisableMacroExpansion, OwnsTokens);
|
|
|
|
EnterCachingLexMode();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Create a macro expander to expand from the specified token stream.
|
2014-08-30 03:36:52 +08:00
|
|
|
std::unique_ptr<TokenLexer> TokLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
if (NumCachedTokenLexers == 0) {
|
2014-08-30 03:36:52 +08:00
|
|
|
TokLexer = llvm::make_unique<TokenLexer>(
|
|
|
|
Toks, NumToks, DisableMacroExpansion, OwnsTokens, *this);
|
2008-03-09 12:10:46 +08:00
|
|
|
} else {
|
2014-08-30 03:36:52 +08:00
|
|
|
TokLexer = std::move(TokenLexerCache[--NumCachedTokenLexers]);
|
2012-12-22 12:48:10 +08:00
|
|
|
TokLexer->Init(Toks, NumToks, DisableMacroExpansion, OwnsTokens);
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
2012-12-22 12:48:10 +08:00
|
|
|
|
|
|
|
// Save our current state.
|
|
|
|
PushIncludeMacroStack();
|
2014-05-18 07:10:59 +08:00
|
|
|
CurDirLookup = nullptr;
|
2014-08-30 03:36:52 +08:00
|
|
|
CurTokenLexer = std::move(TokLexer);
|
2011-09-08 07:11:54 +08:00
|
|
|
if (CurLexerKind != CLK_LexAfterModuleImport)
|
|
|
|
CurLexerKind = CLK_TokenLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
2011-12-23 08:23:59 +08:00
|
|
|
/// \brief Compute the relative path that names the given file relative to
|
|
|
|
/// the given directory.
|
|
|
|
static void computeRelativePath(FileManager &FM, const DirectoryEntry *Dir,
|
|
|
|
const FileEntry *File,
|
2012-02-05 10:13:05 +08:00
|
|
|
SmallString<128> &Result) {
|
2011-12-23 08:23:59 +08:00
|
|
|
Result.clear();
|
|
|
|
|
|
|
|
StringRef FilePath = File->getDir()->getName();
|
|
|
|
StringRef Path = FilePath;
|
|
|
|
while (!Path.empty()) {
|
|
|
|
if (const DirectoryEntry *CurDir = FM.getDirectory(Path)) {
|
|
|
|
if (CurDir == Dir) {
|
|
|
|
Result = FilePath.substr(Path.size());
|
|
|
|
llvm::sys::path::append(Result,
|
|
|
|
llvm::sys::path::filename(File->getName()));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Path = llvm::sys::path::parent_path(Path);
|
|
|
|
}
|
|
|
|
|
|
|
|
Result = File->getName();
|
|
|
|
}
|
|
|
|
|
2013-09-19 08:41:32 +08:00
|
|
|
void Preprocessor::PropagateLineStartLeadingSpaceInfo(Token &Result) {
|
|
|
|
if (CurTokenLexer) {
|
|
|
|
CurTokenLexer->PropagateLineStartLeadingSpaceInfo(Result);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (CurLexer) {
|
|
|
|
CurLexer->PropagateLineStartLeadingSpaceInfo(Result);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// FIXME: Handle other kinds of lexers? It generally shouldn't matter,
|
|
|
|
// but it might if they're empty?
|
|
|
|
}
|
|
|
|
|
2013-11-23 12:06:09 +08:00
|
|
|
/// \brief Determine the location to use as the end of the buffer for a lexer.
|
|
|
|
///
|
|
|
|
/// If the file ends with a newline, form the EOF token on the newline itself,
|
|
|
|
/// rather than "on the line following it", which doesn't exist. This makes
|
|
|
|
/// diagnostics relating to the end of file include the last file that the user
|
|
|
|
/// actually typed, which is goodness.
|
|
|
|
const char *Preprocessor::getCurLexerEndPos() {
|
|
|
|
const char *EndPos = CurLexer->BufferEnd;
|
|
|
|
if (EndPos != CurLexer->BufferStart &&
|
|
|
|
(EndPos[-1] == '\n' || EndPos[-1] == '\r')) {
|
|
|
|
--EndPos;
|
|
|
|
|
|
|
|
// Handle \n\r and \r\n:
|
|
|
|
if (EndPos != CurLexer->BufferStart &&
|
|
|
|
(EndPos[-1] == '\n' || EndPos[-1] == '\r') &&
|
|
|
|
EndPos[-1] != EndPos[0])
|
|
|
|
--EndPos;
|
|
|
|
}
|
|
|
|
|
|
|
|
return EndPos;
|
|
|
|
}
|
|
|
|
|
2017-04-28 06:29:14 +08:00
|
|
|
static void collectAllSubModulesWithUmbrellaHeader(
|
|
|
|
const Module &Mod, SmallVectorImpl<const Module *> &SubMods) {
|
|
|
|
if (Mod.getUmbrellaHeader())
|
|
|
|
SubMods.push_back(&Mod);
|
|
|
|
for (auto *M : Mod.submodules())
|
|
|
|
collectAllSubModulesWithUmbrellaHeader(*M, SubMods);
|
|
|
|
}
|
|
|
|
|
2017-04-28 06:29:10 +08:00
|
|
|
void Preprocessor::diagnoseMissingHeaderInUmbrellaDir(const Module &Mod) {
|
|
|
|
assert(Mod.getUmbrellaHeader() && "Module must use umbrella header");
|
|
|
|
SourceLocation StartLoc =
|
|
|
|
SourceMgr.getLocForStartOfFile(SourceMgr.getMainFileID());
|
|
|
|
if (getDiagnostics().isIgnored(diag::warn_uncovered_module_header, StartLoc))
|
|
|
|
return;
|
|
|
|
|
|
|
|
ModuleMap &ModMap = getHeaderSearchInfo().getModuleMap();
|
|
|
|
const DirectoryEntry *Dir = Mod.getUmbrellaDir().Entry;
|
|
|
|
vfs::FileSystem &FS = *FileMgr.getVirtualFileSystem();
|
|
|
|
std::error_code EC;
|
|
|
|
for (vfs::recursive_directory_iterator Entry(FS, Dir->getName(), EC), End;
|
|
|
|
Entry != End && !EC; Entry.increment(EC)) {
|
|
|
|
using llvm::StringSwitch;
|
|
|
|
|
|
|
|
// Check whether this entry has an extension typically associated with
|
|
|
|
// headers.
|
|
|
|
if (!StringSwitch<bool>(llvm::sys::path::extension(Entry->getName()))
|
|
|
|
.Cases(".h", ".H", ".hh", ".hpp", true)
|
|
|
|
.Default(false))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (const FileEntry *Header = getFileManager().getFile(Entry->getName()))
|
|
|
|
if (!getSourceManager().hasFileInfo(Header)) {
|
|
|
|
if (!ModMap.isHeaderInUnavailableModule(Header)) {
|
|
|
|
// Find the relative path that would access this header.
|
|
|
|
SmallString<128> RelativePath;
|
|
|
|
computeRelativePath(FileMgr, Dir, Header, RelativePath);
|
|
|
|
Diag(StartLoc, diag::warn_uncovered_module_header)
|
|
|
|
<< Mod.getFullModuleName() << RelativePath;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2013-11-23 12:06:09 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
/// HandleEndOfFile - This callback is invoked when the lexer hits the end of
|
|
|
|
/// the current file. This either returns the EOF token or pops a level off
|
|
|
|
/// the include stack and keeps going.
|
|
|
|
bool Preprocessor::HandleEndOfFile(Token &Result, bool isEndOfMacro) {
|
|
|
|
assert(!CurTokenLexer &&
|
|
|
|
"Ending a file when currently in a macro!");
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2017-05-04 08:29:54 +08:00
|
|
|
// If we have an unclosed module region from a pragma at the end of a
|
|
|
|
// module, complain and close it now.
|
|
|
|
// FIXME: This is not correct if we are building a module from PTH.
|
|
|
|
const bool LeavingSubmodule = CurLexer && CurLexerSubmodule;
|
|
|
|
if ((LeavingSubmodule || IncludeMacroStack.empty()) &&
|
|
|
|
!BuildingSubmoduleStack.empty() &&
|
|
|
|
BuildingSubmoduleStack.back().IsPragma) {
|
|
|
|
Diag(BuildingSubmoduleStack.back().ImportLoc,
|
|
|
|
diag::err_pp_module_begin_without_module_end);
|
|
|
|
Module *M = LeaveSubmodule(/*ForPragma*/true);
|
|
|
|
|
|
|
|
Result.startToken();
|
|
|
|
const char *EndPos = getCurLexerEndPos();
|
|
|
|
CurLexer->BufferPtr = EndPos;
|
|
|
|
CurLexer->FormTokenWithChars(Result, EndPos, tok::annot_module_end);
|
|
|
|
Result.setAnnotationEndLoc(Result.getLocation());
|
|
|
|
Result.setAnnotationValue(M);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// See if this file had a controlling macro.
|
2008-11-20 06:43:49 +08:00
|
|
|
if (CurPPLexer) { // Not ending a macro, ignore it.
|
2009-09-09 23:08:12 +08:00
|
|
|
if (const IdentifierInfo *ControllingMacro =
|
2008-11-20 06:43:49 +08:00
|
|
|
CurPPLexer->MIOpt.GetControllingMacroAtEndOfFile()) {
|
2009-04-25 04:03:17 +08:00
|
|
|
// Okay, this has a controlling macro, remember in HeaderFileInfo.
|
2015-12-18 18:30:12 +08:00
|
|
|
if (const FileEntry *FE = CurPPLexer->getFileEntry()) {
|
2008-03-09 12:10:46 +08:00
|
|
|
HeaderInfo.SetFileControllingMacro(FE, ControllingMacro);
|
2014-04-10 02:21:23 +08:00
|
|
|
if (MacroInfo *MI =
|
2017-04-16 23:53:19 +08:00
|
|
|
getMacroInfo(const_cast<IdentifierInfo*>(ControllingMacro)))
|
|
|
|
MI->setUsedForHeaderGuard(true);
|
2013-06-13 05:20:57 +08:00
|
|
|
if (const IdentifierInfo *DefinedMacro =
|
|
|
|
CurPPLexer->MIOpt.GetDefinedMacro()) {
|
2015-04-30 07:20:19 +08:00
|
|
|
if (!isMacroDefined(ControllingMacro) &&
|
2013-06-13 05:20:57 +08:00
|
|
|
DefinedMacro != ControllingMacro &&
|
|
|
|
HeaderInfo.FirstTimeLexingFile(FE)) {
|
2013-10-13 07:17:37 +08:00
|
|
|
|
|
|
|
// If the edit distance between the two macros is more than 50%,
|
|
|
|
// DefinedMacro may not be header guard, or can be header guard of
|
|
|
|
// another header file. Therefore, it maybe defining something
|
|
|
|
// completely different. This can be observed in the wild when
|
|
|
|
// handling feature macros or header guards in different files.
|
|
|
|
|
|
|
|
const StringRef ControllingMacroName = ControllingMacro->getName();
|
|
|
|
const StringRef DefinedMacroName = DefinedMacro->getName();
|
|
|
|
const size_t MaxHalfLength = std::max(ControllingMacroName.size(),
|
|
|
|
DefinedMacroName.size()) / 2;
|
|
|
|
const unsigned ED = ControllingMacroName.edit_distance(
|
|
|
|
DefinedMacroName, true, MaxHalfLength);
|
|
|
|
if (ED <= MaxHalfLength) {
|
|
|
|
// Emit a warning for a bad header guard.
|
|
|
|
Diag(CurPPLexer->MIOpt.GetMacroLocation(),
|
|
|
|
diag::warn_header_guard)
|
|
|
|
<< CurPPLexer->MIOpt.GetMacroLocation() << ControllingMacro;
|
|
|
|
Diag(CurPPLexer->MIOpt.GetDefinedLocation(),
|
|
|
|
diag::note_header_guard)
|
|
|
|
<< CurPPLexer->MIOpt.GetDefinedLocation() << DefinedMacro
|
|
|
|
<< ControllingMacro
|
|
|
|
<< FixItHint::CreateReplacement(
|
|
|
|
CurPPLexer->MIOpt.GetDefinedLocation(),
|
|
|
|
ControllingMacro->getName());
|
|
|
|
}
|
2013-06-13 05:20:57 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-10-18 08:44:04 +08:00
|
|
|
// Complain about reaching a true EOF within arc_cf_code_audited.
|
|
|
|
// We don't want to complain about reaching the end of a macro
|
|
|
|
// instantiation or a _Pragma.
|
|
|
|
if (PragmaARCCFCodeAuditedLoc.isValid() &&
|
2011-10-18 09:36:41 +08:00
|
|
|
!isEndOfMacro && !(CurLexer && CurLexer->Is_PragmaLexer)) {
|
2011-09-30 13:12:12 +08:00
|
|
|
Diag(PragmaARCCFCodeAuditedLoc, diag::err_pp_eof_in_arc_cf_code_audited);
|
|
|
|
|
|
|
|
// Recover by leaving immediately.
|
|
|
|
PragmaARCCFCodeAuditedLoc = SourceLocation();
|
|
|
|
}
|
|
|
|
|
2015-06-20 02:25:57 +08:00
|
|
|
// Complain about reaching a true EOF within assume_nonnull.
|
|
|
|
// We don't want to complain about reaching the end of a macro
|
|
|
|
// instantiation or a _Pragma.
|
|
|
|
if (PragmaAssumeNonNullLoc.isValid() &&
|
|
|
|
!isEndOfMacro && !(CurLexer && CurLexer->Is_PragmaLexer)) {
|
|
|
|
Diag(PragmaAssumeNonNullLoc, diag::err_pp_eof_in_assume_nonnull);
|
|
|
|
|
|
|
|
// Recover by leaving immediately.
|
|
|
|
PragmaAssumeNonNullLoc = SourceLocation();
|
|
|
|
}
|
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// If this is a #include'd file, pop it off the include stack and continue
|
|
|
|
// lexing the #includer file.
|
|
|
|
if (!IncludeMacroStack.empty()) {
|
2011-09-04 11:32:15 +08:00
|
|
|
|
|
|
|
// If we lexed the code-completion file, act as if we reached EOF.
|
|
|
|
if (isCodeCompletionEnabled() && CurPPLexer &&
|
|
|
|
SourceMgr.getLocForStartOfFile(CurPPLexer->getFileID()) ==
|
|
|
|
CodeCompletionFileLoc) {
|
|
|
|
if (CurLexer) {
|
|
|
|
Result.startToken();
|
|
|
|
CurLexer->FormTokenWithChars(Result, CurLexer->BufferEnd, tok::eof);
|
|
|
|
CurLexer.reset();
|
|
|
|
} else {
|
|
|
|
assert(CurPTHLexer && "Got EOF but no current lexer set!");
|
|
|
|
CurPTHLexer->getEOF(Result);
|
|
|
|
CurPTHLexer.reset();
|
|
|
|
}
|
|
|
|
|
2014-05-18 07:10:59 +08:00
|
|
|
CurPPLexer = nullptr;
|
2011-09-04 11:32:15 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-08-22 07:33:04 +08:00
|
|
|
if (!isEndOfMacro && CurPPLexer &&
|
|
|
|
SourceMgr.getIncludeLoc(CurPPLexer->getFileID()).isValid()) {
|
|
|
|
// Notify SourceManager to record the number of FileIDs that were created
|
|
|
|
// during lexing of the #include'd file.
|
|
|
|
unsigned NumFIDs =
|
|
|
|
SourceMgr.local_sloc_entry_size() -
|
|
|
|
CurPPLexer->getInitialNumSLocEntries() + 1/*#include'd file*/;
|
|
|
|
SourceMgr.setNumCreatedFIDsForFileID(CurPPLexer->getFileID(), NumFIDs);
|
|
|
|
}
|
|
|
|
|
2017-08-21 20:03:08 +08:00
|
|
|
bool ExitedFromPredefinesFile = false;
|
2011-10-12 01:29:44 +08:00
|
|
|
FileID ExitedFID;
|
2017-08-21 20:03:08 +08:00
|
|
|
if (!isEndOfMacro && CurPPLexer) {
|
2011-10-12 01:29:44 +08:00
|
|
|
ExitedFID = CurPPLexer->getFileID();
|
2013-11-23 12:06:09 +08:00
|
|
|
|
2017-08-21 20:03:08 +08:00
|
|
|
assert(PredefinesFileID.isValid() &&
|
|
|
|
"HandleEndOfFile is called before PredefinesFileId is set");
|
|
|
|
ExitedFromPredefinesFile = (PredefinesFileID == ExitedFID);
|
|
|
|
}
|
|
|
|
|
2013-11-23 12:06:09 +08:00
|
|
|
if (LeavingSubmodule) {
|
2017-05-04 08:29:54 +08:00
|
|
|
// We're done with this submodule.
|
|
|
|
Module *M = LeaveSubmodule(/*ForPragma*/false);
|
|
|
|
|
2014-02-01 04:47:44 +08:00
|
|
|
// Notify the parser that we've left the module.
|
2013-11-23 12:06:09 +08:00
|
|
|
const char *EndPos = getCurLexerEndPos();
|
|
|
|
Result.startToken();
|
|
|
|
CurLexer->BufferPtr = EndPos;
|
|
|
|
CurLexer->FormTokenWithChars(Result, EndPos, tok::annot_module_end);
|
|
|
|
Result.setAnnotationEndLoc(Result.getLocation());
|
2017-05-04 08:29:54 +08:00
|
|
|
Result.setAnnotationValue(M);
|
2013-11-23 12:06:09 +08:00
|
|
|
}
|
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// We're done with the #included file.
|
|
|
|
RemoveTopOfLexerStack();
|
|
|
|
|
2013-09-19 08:41:32 +08:00
|
|
|
// Propagate info about start-of-line/leading white-space/etc.
|
|
|
|
PropagateLineStartLeadingSpaceInfo(Result);
|
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Notify the client, if desired, that we are in a new source file.
|
2008-11-20 06:43:49 +08:00
|
|
|
if (Callbacks && !isEndOfMacro && CurPPLexer) {
|
2008-10-27 09:19:25 +08:00
|
|
|
SrcMgr::CharacteristicKind FileType =
|
2009-01-19 16:01:53 +08:00
|
|
|
SourceMgr.getFileCharacteristic(CurPPLexer->getSourceLocation());
|
|
|
|
Callbacks->FileChanged(CurPPLexer->getSourceLocation(),
|
2011-10-12 01:29:44 +08:00
|
|
|
PPCallbacks::ExitFile, FileType, ExitedFID);
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
2017-08-21 20:03:08 +08:00
|
|
|
// Restore conditional stack from the preamble right after exiting from the
|
|
|
|
// predefines file.
|
|
|
|
if (ExitedFromPredefinesFile)
|
|
|
|
replayPreambleConditionalStack();
|
|
|
|
|
2013-11-23 12:06:09 +08:00
|
|
|
// Client should lex another token unless we generated an EOM.
|
|
|
|
return LeavingSubmodule;
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
2013-11-23 12:06:09 +08:00
|
|
|
// If this is the end of the main file, form an EOF token.
|
2008-11-20 06:43:49 +08:00
|
|
|
if (CurLexer) {
|
2013-11-23 12:06:09 +08:00
|
|
|
const char *EndPos = getCurLexerEndPos();
|
2008-11-20 06:43:49 +08:00
|
|
|
Result.startToken();
|
|
|
|
CurLexer->BufferPtr = EndPos;
|
|
|
|
CurLexer->FormTokenWithChars(Result, EndPos, tok::eof);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2012-12-22 12:48:10 +08:00
|
|
|
if (isCodeCompletionEnabled()) {
|
|
|
|
// Inserting the code-completion point increases the source buffer by 1,
|
|
|
|
// but the main FileID was created before inserting the point.
|
|
|
|
// Compensate by reducing the EOF location by 1, otherwise the location
|
|
|
|
// will point to the next FileID.
|
|
|
|
// FIXME: This is hacky, the code-completion point should probably be
|
|
|
|
// inserted before the main FileID is created.
|
|
|
|
if (CurLexer->getFileLoc() == CodeCompletionFileLoc)
|
|
|
|
Result.setLocation(Result.getLocation().getLocWithOffset(-1));
|
|
|
|
}
|
|
|
|
|
2012-03-16 18:40:17 +08:00
|
|
|
if (!isIncrementalProcessingEnabled())
|
|
|
|
// We're done with lexing.
|
|
|
|
CurLexer.reset();
|
2009-02-14 07:06:48 +08:00
|
|
|
} else {
|
|
|
|
assert(CurPTHLexer && "Got EOF but no current lexer set!");
|
2008-12-24 03:24:24 +08:00
|
|
|
CurPTHLexer->getEOF(Result);
|
2008-11-20 06:43:49 +08:00
|
|
|
CurPTHLexer.reset();
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
2012-03-16 18:40:17 +08:00
|
|
|
|
|
|
|
if (!isIncrementalProcessingEnabled())
|
2014-05-18 07:10:59 +08:00
|
|
|
CurPPLexer = nullptr;
|
2008-03-09 12:10:46 +08:00
|
|
|
|
2014-03-09 05:18:26 +08:00
|
|
|
if (TUKind == TU_Complete) {
|
2014-03-07 15:47:58 +08:00
|
|
|
// This is the end of the top-level file. 'WarnUnusedMacroLocs' has
|
|
|
|
// collected all macro locations that we need to warn because they are not
|
|
|
|
// used.
|
|
|
|
for (WarnUnusedMacroLocsTy::iterator
|
|
|
|
I=WarnUnusedMacroLocs.begin(), E=WarnUnusedMacroLocs.end();
|
|
|
|
I!=E; ++I)
|
|
|
|
Diag(*I, diag::pp_macro_not_used);
|
|
|
|
}
|
2010-03-23 13:09:10 +08:00
|
|
|
|
2011-12-23 08:23:59 +08:00
|
|
|
// If we are building a module that has an umbrella header, make sure that
|
2017-04-28 06:29:14 +08:00
|
|
|
// each of the headers within the directory, including all submodules, is
|
|
|
|
// covered by the umbrella header was actually included by the umbrella
|
|
|
|
// header.
|
|
|
|
if (Module *Mod = getCurrentModule()) {
|
|
|
|
llvm::SmallVector<const Module *, 4> AllMods;
|
|
|
|
collectAllSubModulesWithUmbrellaHeader(*Mod, AllMods);
|
|
|
|
for (auto *M : AllMods)
|
|
|
|
diagnoseMissingHeaderInUmbrellaDir(*M);
|
|
|
|
}
|
2013-05-20 21:49:41 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// HandleEndOfTokenLexer - This callback is invoked when the current TokenLexer
|
|
|
|
/// hits the end of its token stream.
|
|
|
|
bool Preprocessor::HandleEndOfTokenLexer(Token &Result) {
|
2008-11-20 06:43:49 +08:00
|
|
|
assert(CurTokenLexer && !CurPPLexer &&
|
2008-03-09 12:10:46 +08:00
|
|
|
"Ending a macro when currently in a #include file!");
|
|
|
|
|
2011-06-30 06:20:11 +08:00
|
|
|
if (!MacroExpandingLexersStack.empty() &&
|
|
|
|
MacroExpandingLexersStack.back().first == CurTokenLexer.get())
|
|
|
|
removeCachedMacroExpandedTokensOfLastLexer();
|
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Delete or cache the now-dead macro expander.
|
|
|
|
if (NumCachedTokenLexers == TokenLexerCacheSize)
|
2008-11-14 01:11:24 +08:00
|
|
|
CurTokenLexer.reset();
|
2008-03-09 12:10:46 +08:00
|
|
|
else
|
2014-08-30 03:36:52 +08:00
|
|
|
TokenLexerCache[NumCachedTokenLexers++] = std::move(CurTokenLexer);
|
2008-03-09 12:10:46 +08:00
|
|
|
|
|
|
|
// Handle this like a #include file being popped off the stack.
|
|
|
|
return HandleEndOfFile(Result, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// RemoveTopOfLexerStack - Pop the current lexer/macro exp off the top of the
|
|
|
|
/// lexer stack. This should only be used in situations where the current
|
|
|
|
/// state of the top-of-stack lexer is unknown.
|
|
|
|
void Preprocessor::RemoveTopOfLexerStack() {
|
|
|
|
assert(!IncludeMacroStack.empty() && "Ran out of stack entries to load");
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
if (CurTokenLexer) {
|
|
|
|
// Delete or cache the now-dead macro expander.
|
|
|
|
if (NumCachedTokenLexers == TokenLexerCacheSize)
|
2008-11-14 01:11:24 +08:00
|
|
|
CurTokenLexer.reset();
|
2008-03-09 12:10:46 +08:00
|
|
|
else
|
2014-08-30 03:36:52 +08:00
|
|
|
TokenLexerCache[NumCachedTokenLexers++] = std::move(CurTokenLexer);
|
2009-09-09 23:08:12 +08:00
|
|
|
}
|
|
|
|
|
2008-11-14 00:51:03 +08:00
|
|
|
PopIncludeMacroStack();
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// HandleMicrosoftCommentPaste - When the macro expander pastes together a
|
|
|
|
/// comment (/##/) in microsoft mode, this method handles updating the current
|
|
|
|
/// state, returning the token on the next source line.
|
|
|
|
void Preprocessor::HandleMicrosoftCommentPaste(Token &Tok) {
|
2008-11-20 06:43:49 +08:00
|
|
|
assert(CurTokenLexer && !CurPPLexer &&
|
2008-03-09 12:10:46 +08:00
|
|
|
"Pasted comment can only be formed from macro");
|
|
|
|
// We handle this by scanning for the closest real lexer, switching it to
|
|
|
|
// raw mode and preprocessor mode. This will cause it to return \n as an
|
2011-02-28 10:37:51 +08:00
|
|
|
// explicit EOD token.
|
2014-05-18 07:10:59 +08:00
|
|
|
PreprocessorLexer *FoundLexer = nullptr;
|
2008-03-09 12:10:46 +08:00
|
|
|
bool LexerWasInPPMode = false;
|
2016-10-26 21:06:13 +08:00
|
|
|
for (const IncludeStackInfo &ISI : llvm::reverse(IncludeMacroStack)) {
|
2014-05-18 07:10:59 +08:00
|
|
|
if (ISI.ThePPLexer == nullptr) continue; // Scan for a real lexer.
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Once we find a real lexer, mark it as raw mode (disabling macro
|
2011-02-28 10:37:51 +08:00
|
|
|
// expansions) and preprocessor mode (return EOD). We know that the lexer
|
2008-03-09 12:10:46 +08:00
|
|
|
// was *not* in raw mode before, because the macro that the comment came
|
|
|
|
// from was expanded. However, it could have already been in preprocessor
|
|
|
|
// mode (#if COMMENT) in which case we have to return it to that mode and
|
2011-02-28 10:37:51 +08:00
|
|
|
// return EOD.
|
2008-11-20 06:43:49 +08:00
|
|
|
FoundLexer = ISI.ThePPLexer;
|
2008-03-09 12:10:46 +08:00
|
|
|
FoundLexer->LexingRawMode = true;
|
|
|
|
LexerWasInPPMode = FoundLexer->ParsingPreprocessorDirective;
|
|
|
|
FoundLexer->ParsingPreprocessorDirective = true;
|
|
|
|
break;
|
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Okay, we either found and switched over the lexer, or we didn't find a
|
|
|
|
// lexer. In either case, finish off the macro the comment came from, getting
|
|
|
|
// the next token.
|
|
|
|
if (!HandleEndOfTokenLexer(Tok)) Lex(Tok);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-02-28 10:37:51 +08:00
|
|
|
// Discarding comments as long as we don't have EOF or EOD. This 'comments
|
2008-03-09 12:10:46 +08:00
|
|
|
// out' the rest of the line, including any tokens that came from other macros
|
|
|
|
// that were active, as in:
|
|
|
|
// #define submacro a COMMENT b
|
|
|
|
// submacro c
|
|
|
|
// which should lex to 'a' only: 'b' and 'c' should be removed.
|
2011-02-28 10:37:51 +08:00
|
|
|
while (Tok.isNot(tok::eod) && Tok.isNot(tok::eof))
|
2008-03-09 12:10:46 +08:00
|
|
|
Lex(Tok);
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-02-28 10:37:51 +08:00
|
|
|
// If we got an eod token, then we successfully found the end of the line.
|
|
|
|
if (Tok.is(tok::eod)) {
|
2008-03-09 12:10:46 +08:00
|
|
|
assert(FoundLexer && "Can't get end of line without an active lexer");
|
|
|
|
// Restore the lexer back to normal mode instead of raw mode.
|
|
|
|
FoundLexer->LexingRawMode = false;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2011-02-28 10:37:51 +08:00
|
|
|
// If the lexer was already in preprocessor mode, just return the EOD token
|
2008-03-09 12:10:46 +08:00
|
|
|
// to finish the preprocessor line.
|
|
|
|
if (LexerWasInPPMode) return;
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// Otherwise, switch out of PP mode and return the next lexed token.
|
|
|
|
FoundLexer->ParsingPreprocessorDirective = false;
|
|
|
|
return Lex(Tok);
|
|
|
|
}
|
2009-09-09 23:08:12 +08:00
|
|
|
|
2008-03-09 12:10:46 +08:00
|
|
|
// If we got an EOF token, then we reached the end of the token stream but
|
|
|
|
// didn't find an explicit \n. This can only happen if there was no lexer
|
2011-02-28 10:37:51 +08:00
|
|
|
// active (an active lexer would return EOD at EOF if there was no \n in
|
2008-03-09 12:10:46 +08:00
|
|
|
// preprocessor directive mode), so just return EOF as our token.
|
2011-02-28 10:37:51 +08:00
|
|
|
assert(!FoundLexer && "Lexer should return EOD before EOF in PP mode");
|
2008-03-09 12:10:46 +08:00
|
|
|
}
|
2015-04-24 02:18:26 +08:00
|
|
|
|
2017-05-04 08:29:54 +08:00
|
|
|
void Preprocessor::EnterSubmodule(Module *M, SourceLocation ImportLoc,
|
|
|
|
bool ForPragma) {
|
2015-05-21 09:20:10 +08:00
|
|
|
if (!getLangOpts().ModulesLocalVisibility) {
|
|
|
|
// Just track that we entered this submodule.
|
2017-05-04 08:29:54 +08:00
|
|
|
BuildingSubmoduleStack.push_back(
|
|
|
|
BuildingSubmoduleInfo(M, ImportLoc, ForPragma, CurSubmoduleState,
|
|
|
|
PendingModuleMacroNames.size()));
|
2015-05-21 09:20:10 +08:00
|
|
|
return;
|
2015-05-16 04:05:43 +08:00
|
|
|
}
|
|
|
|
|
2015-05-21 09:20:10 +08:00
|
|
|
// Resolve as much of the module definition as we can now, before we enter
|
|
|
|
// one of its headers.
|
|
|
|
// FIXME: Can we enable Complain here?
|
|
|
|
// FIXME: Can we do this when local visibility is disabled?
|
|
|
|
ModuleMap &ModMap = getHeaderSearchInfo().getModuleMap();
|
|
|
|
ModMap.resolveExports(M, /*Complain=*/false);
|
|
|
|
ModMap.resolveUses(M, /*Complain=*/false);
|
|
|
|
ModMap.resolveConflicts(M, /*Complain=*/false);
|
|
|
|
|
|
|
|
// If this is the first time we've entered this module, set up its state.
|
2015-05-21 09:26:53 +08:00
|
|
|
auto R = Submodules.insert(std::make_pair(M, SubmoduleState()));
|
2015-05-21 09:20:10 +08:00
|
|
|
auto &State = R.first->second;
|
|
|
|
bool FirstTime = R.second;
|
|
|
|
if (FirstTime) {
|
|
|
|
// Determine the set of starting macros for this submodule; take these
|
|
|
|
// from the "null" module (the predefines buffer).
|
2015-07-01 05:29:55 +08:00
|
|
|
//
|
|
|
|
// FIXME: If we have local visibility but not modules enabled, the
|
|
|
|
// NullSubmoduleState is polluted by #defines in the top-level source
|
|
|
|
// file.
|
2015-05-21 09:20:10 +08:00
|
|
|
auto &StartingMacros = NullSubmoduleState.Macros;
|
|
|
|
|
|
|
|
// Restore to the starting state.
|
|
|
|
// FIXME: Do this lazily, when each macro name is first referenced.
|
|
|
|
for (auto &Macro : StartingMacros) {
|
2015-07-01 05:29:55 +08:00
|
|
|
// Skip uninteresting macros.
|
|
|
|
if (!Macro.second.getLatest() &&
|
|
|
|
Macro.second.getOverriddenMacros().empty())
|
|
|
|
continue;
|
|
|
|
|
2015-05-21 09:20:10 +08:00
|
|
|
MacroState MS(Macro.second.getLatest());
|
|
|
|
MS.setOverriddenMacros(*this, Macro.second.getOverriddenMacros());
|
|
|
|
State.Macros.insert(std::make_pair(Macro.first, std::move(MS)));
|
|
|
|
}
|
2015-04-28 07:21:38 +08:00
|
|
|
}
|
2015-05-21 09:20:10 +08:00
|
|
|
|
|
|
|
// Track that we entered this module.
|
2017-05-04 08:29:54 +08:00
|
|
|
BuildingSubmoduleStack.push_back(
|
|
|
|
BuildingSubmoduleInfo(M, ImportLoc, ForPragma, CurSubmoduleState,
|
|
|
|
PendingModuleMacroNames.size()));
|
2015-05-21 09:20:10 +08:00
|
|
|
|
|
|
|
// Switch to this submodule as the current submodule.
|
|
|
|
CurSubmoduleState = &State;
|
|
|
|
|
|
|
|
// This module is visible to itself.
|
|
|
|
if (FirstTime)
|
|
|
|
makeModuleVisible(M, ImportLoc);
|
2015-04-24 02:18:26 +08:00
|
|
|
}
|
|
|
|
|
2016-02-24 07:20:51 +08:00
|
|
|
bool Preprocessor::needModuleMacros() const {
|
|
|
|
// If we're not within a submodule, we never need to create ModuleMacros.
|
|
|
|
if (BuildingSubmoduleStack.empty())
|
|
|
|
return false;
|
|
|
|
// If we are tracking module macro visibility even for textually-included
|
|
|
|
// headers, we need ModuleMacros.
|
|
|
|
if (getLangOpts().ModulesLocalVisibility)
|
|
|
|
return true;
|
|
|
|
// Otherwise, we only need module macros if we're actually compiling a module
|
|
|
|
// interface.
|
2016-08-26 08:14:38 +08:00
|
|
|
return getLangOpts().isCompilingModule();
|
2016-02-24 07:20:51 +08:00
|
|
|
}
|
|
|
|
|
2017-05-04 08:29:54 +08:00
|
|
|
Module *Preprocessor::LeaveSubmodule(bool ForPragma) {
|
|
|
|
if (BuildingSubmoduleStack.empty() ||
|
|
|
|
BuildingSubmoduleStack.back().IsPragma != ForPragma) {
|
|
|
|
assert(ForPragma && "non-pragma module enter/leave mismatch");
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2015-04-24 02:18:26 +08:00
|
|
|
auto &Info = BuildingSubmoduleStack.back();
|
|
|
|
|
2015-05-14 10:25:44 +08:00
|
|
|
Module *LeavingMod = Info.M;
|
|
|
|
SourceLocation ImportLoc = Info.ImportLoc;
|
|
|
|
|
[modules] Simplify module macro handling in non-local-submodule-visibility mode.
When reaching the end of a module, we used to convert its macros to
ModuleMacros but also leave them in the MacroDirective chain for the
identifier. This meant that every lookup of such a macro would find two
(identical) definitions. It also made it difficult to determine the correct
owner for a macro when reaching the end of a module: the most recent
MacroDirective in the chain could be from an #included submodule rather than
the current module.
Simplify this: whenever we convert a MacroDirective to a ModuleMacro when
leaving a module, clear out the MacroDirective chain for that identifier, and
just rely on the ModuleMacro to provide the macro definition information.
(We don't want to do this for local submodule visibility mode, because in that
mode we maintain a distinct MacroDirective chain for each submodule, and we
need to keep around the prior MacroDirective in case we re-enter the submodule
-- for instance, if its header is #included more than once in a module build,
we need the include guard directive to stick around. But the problem doesn't
arise in this case for the same reason: each submodule has its own
MacroDirective chain, so the macros don't leak out of submodules in the first
place.)
This reinstates r302932, reverted in r302947, with a fix for a bug that
resulted in us sometimes losing macro definitions due to failing to clear out
the overridden module macro list when promoting a directive to a module macro.
llvm-svn: 303468
2017-05-20 07:32:38 +08:00
|
|
|
if (!needModuleMacros() ||
|
2016-02-24 07:20:51 +08:00
|
|
|
(!getLangOpts().ModulesLocalVisibility &&
|
|
|
|
LeavingMod->getTopLevelModuleName() != getLangOpts().CurrentModule)) {
|
|
|
|
// If we don't need module macros, or this is not a module for which we
|
|
|
|
// are tracking macro visibility, don't build any, and preserve the list
|
|
|
|
// of pending names for the surrounding submodule.
|
2016-02-20 06:43:58 +08:00
|
|
|
BuildingSubmoduleStack.pop_back();
|
|
|
|
makeModuleVisible(LeavingMod, ImportLoc);
|
2017-05-04 08:29:54 +08:00
|
|
|
return LeavingMod;
|
2016-02-20 06:43:58 +08:00
|
|
|
}
|
|
|
|
|
2015-04-24 02:18:26 +08:00
|
|
|
// Create ModuleMacros for any macros defined in this submodule.
|
2016-02-24 07:20:51 +08:00
|
|
|
llvm::SmallPtrSet<const IdentifierInfo*, 8> VisitedMacros;
|
|
|
|
for (unsigned I = Info.OuterPendingModuleMacroNames;
|
|
|
|
I != PendingModuleMacroNames.size(); ++I) {
|
|
|
|
auto *II = const_cast<IdentifierInfo*>(PendingModuleMacroNames[I]);
|
|
|
|
if (!VisitedMacros.insert(II).second)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
auto MacroIt = CurSubmoduleState->Macros.find(II);
|
|
|
|
if (MacroIt == CurSubmoduleState->Macros.end())
|
|
|
|
continue;
|
|
|
|
auto &Macro = MacroIt->second;
|
2015-05-02 05:22:17 +08:00
|
|
|
|
|
|
|
// Find the starting point for the MacroDirective chain in this submodule.
|
2015-05-21 09:20:10 +08:00
|
|
|
MacroDirective *OldMD = nullptr;
|
2016-02-20 06:43:58 +08:00
|
|
|
auto *OldState = Info.OuterSubmoduleState;
|
|
|
|
if (getLangOpts().ModulesLocalVisibility)
|
|
|
|
OldState = &NullSubmoduleState;
|
|
|
|
if (OldState && OldState != CurSubmoduleState) {
|
2015-05-21 09:20:10 +08:00
|
|
|
// FIXME: It'd be better to start at the state from when we most recently
|
|
|
|
// entered this submodule, but it doesn't really matter.
|
2016-02-20 06:43:58 +08:00
|
|
|
auto &OldMacros = OldState->Macros;
|
2016-02-24 07:20:51 +08:00
|
|
|
auto OldMacroIt = OldMacros.find(II);
|
2016-02-20 06:43:58 +08:00
|
|
|
if (OldMacroIt == OldMacros.end())
|
2015-05-02 05:22:17 +08:00
|
|
|
OldMD = nullptr;
|
|
|
|
else
|
2016-02-20 06:43:58 +08:00
|
|
|
OldMD = OldMacroIt->second.getLatest();
|
2015-05-02 05:22:17 +08:00
|
|
|
}
|
2015-04-24 02:18:26 +08:00
|
|
|
|
|
|
|
// This module may have exported a new macro. If so, create a ModuleMacro
|
|
|
|
// representing that fact.
|
|
|
|
bool ExplicitlyPublic = false;
|
2016-02-24 07:20:51 +08:00
|
|
|
for (auto *MD = Macro.getLatest(); MD != OldMD; MD = MD->getPrevious()) {
|
2015-04-29 05:05:07 +08:00
|
|
|
assert(MD && "broken macro directive chain");
|
|
|
|
|
2015-04-24 02:18:26 +08:00
|
|
|
if (auto *VisMD = dyn_cast<VisibilityMacroDirective>(MD)) {
|
|
|
|
// The latest visibility directive for a name in a submodule affects
|
|
|
|
// all the directives that come before it.
|
|
|
|
if (VisMD->isPublic())
|
|
|
|
ExplicitlyPublic = true;
|
|
|
|
else if (!ExplicitlyPublic)
|
|
|
|
// Private with no following public directive: not exported.
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
MacroInfo *Def = nullptr;
|
|
|
|
if (DefMacroDirective *DefMD = dyn_cast<DefMacroDirective>(MD))
|
|
|
|
Def = DefMD->getInfo();
|
|
|
|
|
|
|
|
// FIXME: Issue a warning if multiple headers for the same submodule
|
|
|
|
// define a macro, rather than silently ignoring all but the first.
|
|
|
|
bool IsNew;
|
2015-05-02 09:14:40 +08:00
|
|
|
// Don't bother creating a module macro if it would represent a #undef
|
|
|
|
// that doesn't override anything.
|
2016-02-24 07:20:51 +08:00
|
|
|
if (Def || !Macro.getOverriddenMacros().empty())
|
2015-05-14 10:25:44 +08:00
|
|
|
addModuleMacro(LeavingMod, II, Def,
|
2016-02-24 07:20:51 +08:00
|
|
|
Macro.getOverriddenMacros(), IsNew);
|
[modules] Simplify module macro handling in non-local-submodule-visibility mode.
When reaching the end of a module, we used to convert its macros to
ModuleMacros but also leave them in the MacroDirective chain for the
identifier. This meant that every lookup of such a macro would find two
(identical) definitions. It also made it difficult to determine the correct
owner for a macro when reaching the end of a module: the most recent
MacroDirective in the chain could be from an #included submodule rather than
the current module.
Simplify this: whenever we convert a MacroDirective to a ModuleMacro when
leaving a module, clear out the MacroDirective chain for that identifier, and
just rely on the ModuleMacro to provide the macro definition information.
(We don't want to do this for local submodule visibility mode, because in that
mode we maintain a distinct MacroDirective chain for each submodule, and we
need to keep around the prior MacroDirective in case we re-enter the submodule
-- for instance, if its header is #included more than once in a module build,
we need the include guard directive to stick around. But the problem doesn't
arise in this case for the same reason: each submodule has its own
MacroDirective chain, so the macros don't leak out of submodules in the first
place.)
This reinstates r302932, reverted in r302947, with a fix for a bug that
resulted in us sometimes losing macro definitions due to failing to clear out
the overridden module macro list when promoting a directive to a module macro.
llvm-svn: 303468
2017-05-20 07:32:38 +08:00
|
|
|
|
|
|
|
if (!getLangOpts().ModulesLocalVisibility) {
|
|
|
|
// This macro is exposed to the rest of this compilation as a
|
|
|
|
// ModuleMacro; we don't need to track its MacroDirective any more.
|
|
|
|
Macro.setLatest(nullptr);
|
|
|
|
Macro.setOverriddenMacros(*this, {});
|
|
|
|
}
|
2015-04-24 02:18:26 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2015-04-28 07:21:38 +08:00
|
|
|
}
|
2016-02-24 07:20:51 +08:00
|
|
|
PendingModuleMacroNames.resize(Info.OuterPendingModuleMacroNames);
|
2015-04-24 02:18:26 +08:00
|
|
|
|
2015-07-01 05:29:55 +08:00
|
|
|
// FIXME: Before we leave this submodule, we should parse all the other
|
|
|
|
// headers within it. Otherwise, we're left with an inconsistent state
|
|
|
|
// where we've made the module visible but don't yet have its complete
|
|
|
|
// contents.
|
|
|
|
|
2015-05-21 09:20:10 +08:00
|
|
|
// Put back the outer module's state, if we're tracking it.
|
2015-05-02 05:22:17 +08:00
|
|
|
if (getLangOpts().ModulesLocalVisibility)
|
2015-05-21 09:20:10 +08:00
|
|
|
CurSubmoduleState = Info.OuterSubmoduleState;
|
2015-05-02 05:22:17 +08:00
|
|
|
|
2015-04-24 02:18:26 +08:00
|
|
|
BuildingSubmoduleStack.pop_back();
|
2015-05-14 10:25:44 +08:00
|
|
|
|
|
|
|
// A nested #include makes the included submodule visible.
|
2015-07-01 05:29:55 +08:00
|
|
|
makeModuleVisible(LeavingMod, ImportLoc);
|
2017-05-04 08:29:54 +08:00
|
|
|
return LeavingMod;
|
2015-04-24 02:18:26 +08:00
|
|
|
}
|