head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.10 netbsd-11-0-RC3:1.1.1.10 netbsd-11-0-RC2:1.1.1.10 netbsd-11-0-RC1:1.1.1.10 perseant-exfatfs-base-20250801:1.1.1.10 netbsd-11:1.1.1.10.0.10 netbsd-11-base:1.1.1.10 netbsd-10-1-RELEASE:1.1.1.10 perseant-exfatfs-base-20240630:1.1.1.10 perseant-exfatfs:1.1.1.10.0.8 perseant-exfatfs-base:1.1.1.10 netbsd-8-3-RELEASE:1.1.1.7 netbsd-9-4-RELEASE:1.1.1.9 netbsd-10-0-RELEASE:1.1.1.10 netbsd-10-0-RC6:1.1.1.10 netbsd-10-0-RC5:1.1.1.10 netbsd-10-0-RC4:1.1.1.10 netbsd-10-0-RC3:1.1.1.10 netbsd-10-0-RC2:1.1.1.10 netbsd-10-0-RC1:1.1.1.10 netbsd-10:1.1.1.10.0.6 netbsd-10-base:1.1.1.10 netbsd-9-3-RELEASE:1.1.1.9 cjep_sun2x:1.1.1.10.0.4 cjep_sun2x-base:1.1.1.10 cjep_staticlib_x-base1:1.1.1.10 netbsd-9-2-RELEASE:1.1.1.9 cjep_staticlib_x:1.1.1.10.0.2 cjep_staticlib_x-base:1.1.1.10 netbsd-9-1-RELEASE:1.1.1.9 phil-wifi-20200421:1.1.1.10 phil-wifi-20200411:1.1.1.10 phil-wifi-20200406:1.1.1.10 netbsd-8-2-RELEASE:1.1.1.7 netbsd-9-0-RELEASE:1.1.1.9 netbsd-9-0-RC2:1.1.1.9 netbsd-9-0-RC1:1.1.1.9 netbsd-9:1.1.1.9.0.2 netbsd-9-base:1.1.1.9 phil-wifi-20190609:1.1.1.9 netbsd-8-1-RELEASE:1.1.1.7 netbsd-8-1-RC1:1.1.1.7 pgoyette-compat-merge-20190127:1.1.1.8.2.1 pgoyette-compat-20190127:1.1.1.9 pgoyette-compat-20190118:1.1.1.9 pgoyette-compat-1226:1.1.1.9 pgoyette-compat-1126:1.1.1.9 pgoyette-compat-1020:1.1.1.9 pgoyette-compat-0930:1.1.1.9 pgoyette-compat-0906:1.1.1.9 netbsd-7-2-RELEASE:1.1.1.4.2.1 pgoyette-compat-0728:1.1.1.9 clang-337282:1.1.1.9 netbsd-8-0-RELEASE:1.1.1.7 phil-wifi:1.1.1.8.0.4 phil-wifi-base:1.1.1.8 pgoyette-compat-0625:1.1.1.8 netbsd-8-0-RC2:1.1.1.7 pgoyette-compat-0521:1.1.1.8 pgoyette-compat-0502:1.1.1.8 pgoyette-compat-0422:1.1.1.8 netbsd-8-0-RC1:1.1.1.7 pgoyette-compat-0415:1.1.1.8 pgoyette-compat-0407:1.1.1.8 pgoyette-compat-0330:1.1.1.8 pgoyette-compat-0322:1.1.1.8 pgoyette-compat-0315:1.1.1.8 netbsd-7-1-2-RELEASE:1.1.1.4.2.1 pgoyette-compat:1.1.1.8.0.2 pgoyette-compat-base:1.1.1.8 netbsd-7-1-1-RELEASE:1.1.1.4.2.1 clang-319952:1.1.1.8 matt-nb8-mediatek:1.1.1.7.0.10 matt-nb8-mediatek-base:1.1.1.7 clang-309604:1.1.1.8 perseant-stdc-iso10646:1.1.1.7.0.8 perseant-stdc-iso10646-base:1.1.1.7 netbsd-8:1.1.1.7.0.6 netbsd-8-base:1.1.1.7 prg-localcount2-base3:1.1.1.7 prg-localcount2-base2:1.1.1.7 prg-localcount2-base1:1.1.1.7 prg-localcount2:1.1.1.7.0.4 prg-localcount2-base:1.1.1.7 pgoyette-localcount-20170426:1.1.1.7 bouyer-socketcan-base1:1.1.1.7 pgoyette-localcount-20170320:1.1.1.7 netbsd-7-1:1.1.1.4.2.1.0.6 netbsd-7-1-RELEASE:1.1.1.4.2.1 netbsd-7-1-RC2:1.1.1.4.2.1 clang-294123:1.1.1.7 netbsd-7-nhusb-base-20170116:1.1.1.4.2.1 bouyer-socketcan:1.1.1.7.0.2 bouyer-socketcan-base:1.1.1.7 clang-291444:1.1.1.7 pgoyette-localcount-20170107:1.1.1.6 netbsd-7-1-RC1:1.1.1.4.2.1 pgoyette-localcount-20161104:1.1.1.6 netbsd-7-0-2-RELEASE:1.1.1.4.2.1 localcount-20160914:1.1.1.6 netbsd-7-nhusb:1.1.1.4.2.1.0.4 netbsd-7-nhusb-base:1.1.1.4.2.1 clang-280599:1.1.1.6 pgoyette-localcount-20160806:1.1.1.6 pgoyette-localcount-20160726:1.1.1.6 pgoyette-localcount:1.1.1.6.0.2 pgoyette-localcount-base:1.1.1.6 netbsd-7-0-1-RELEASE:1.1.1.4.2.1 clang-261930:1.1.1.6 netbsd-7-0:1.1.1.4.2.1.0.2 netbsd-7-0-RELEASE:1.1.1.4.2.1 netbsd-7-0-RC3:1.1.1.4.2.1 netbsd-7-0-RC2:1.1.1.4.2.1 netbsd-7-0-RC1:1.1.1.4.2.1 clang-237755:1.1.1.5 clang-232565:1.1.1.5 clang-227398:1.1.1.5 tls-maxphys-base:1.1.1.4 tls-maxphys:1.1.1.4.0.4 netbsd-7:1.1.1.4.0.2 netbsd-7-base:1.1.1.4 clang-215315:1.1.1.4 clang-209886:1.1.1.3 yamt-pagecache:1.1.1.2.0.4 yamt-pagecache-base9:1.1.1.2 tls-earlyentropy:1.1.1.2.0.2 tls-earlyentropy-base:1.1.1.3 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.2 riastradh-drm2-base3:1.1.1.2 clang-202566:1.1.1.2 clang-201163:1.1.1.2 clang-199312:1.1.1.2 clang-198450:1.1.1.2 clang-196603:1.1.1.1 clang-195771:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2013.11.28.14.14.49; author joerg; state Exp; branches 1.1.1.1; next ; commitid ow8OybrawrB1f3fx; 1.1.1.1 date 2013.11.28.14.14.49; author joerg; state Exp; branches; next 1.1.1.2; commitid ow8OybrawrB1f3fx; 1.1.1.2 date 2014.01.05.15.38.35; author joerg; state Exp; branches 1.1.1.2.2.1 1.1.1.2.4.1; next 1.1.1.3; commitid wh3aCSIWykURqWjx; 1.1.1.3 date 2014.05.30.18.14.40; author joerg; state Exp; branches; next 1.1.1.4; commitid 8q0kdlBlCn09GACx; 1.1.1.4 date 2014.08.10.17.08.27; author joerg; state Exp; branches 1.1.1.4.2.1 1.1.1.4.4.1; next 1.1.1.5; commitid N85tXAN6Ex9VZPLx; 1.1.1.5 date 2015.01.29.19.57.32; author joerg; state Exp; branches; next 1.1.1.6; commitid mlISSizlPKvepX7y; 1.1.1.6 date 2016.02.27.22.11.54; author joerg; state Exp; branches 1.1.1.6.2.1; next 1.1.1.7; commitid tIimz3oDlh1NpBWy; 1.1.1.7 date 2017.01.11.10.34.52; author joerg; state Exp; branches; next 1.1.1.8; commitid CNnUNfII1jgNmxBz; 1.1.1.8 date 2017.08.01.19.34.55; author joerg; state Exp; branches 1.1.1.8.2.1 1.1.1.8.4.1; next 1.1.1.9; commitid pMuDy65V0VicSx1A; 1.1.1.9 date 2018.07.17.18.31.24; author joerg; state Exp; branches; next 1.1.1.10; commitid wDzL46ALjrCZgwKA; 1.1.1.10 date 2019.11.13.22.19.20; author joerg; state dead; branches; next ; commitid QD8YATxuNG34YJKB; 1.1.1.2.2.1 date 2014.08.10.07.08.07; author tls; state Exp; branches; next ; commitid t01A1TLTYxkpGMLx; 1.1.1.2.4.1 date 2014.01.05.15.38.35; author yamt; state dead; branches; next 1.1.1.2.4.2; commitid WSrDtL5nYAUyiyBx; 1.1.1.2.4.2 date 2014.05.22.16.18.26; author yamt; state Exp; branches; next ; commitid WSrDtL5nYAUyiyBx; 1.1.1.4.2.1 date 2015.06.04.20.04.27; author snj; state Exp; branches; next ; commitid yRnjq9fueSo6n9oy; 1.1.1.4.4.1 date 2014.08.10.17.08.27; author tls; state dead; branches; next 1.1.1.4.4.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.4.4.2 date 2014.08.19.23.47.26; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.6.2.1 date 2017.03.20.06.52.36; author pgoyette; state Exp; branches; next ; commitid jjw7cAwgyKq7RfKz; 1.1.1.8.2.1 date 2018.07.28.04.33.16; author pgoyette; state Exp; branches; next ; commitid 1UP1xAIUxv1ZgRLA; 1.1.1.8.4.1 date 2019.06.10.21.45.20; author christos; state Exp; branches; next 1.1.1.8.4.2; commitid jtc8rnCzWiEEHGqB; 1.1.1.8.4.2 date 2020.04.13.07.46.31; author martin; state dead; branches; next ; commitid X01YhRUPVUDaec4C; desc @@ 1.1 log @Initial revision @ text @//===--- Module.cpp - Describe a module -----------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This file defines the Module class, which describes a module in the source // code. // //===----------------------------------------------------------------------===// #include "clang/Basic/Module.h" #include "clang/Basic/FileManager.h" #include "clang/Basic/LangOptions.h" #include "clang/Basic/TargetInfo.h" #include "llvm/ADT/ArrayRef.h" #include "llvm/ADT/SmallVector.h" #include "llvm/ADT/StringSwitch.h" #include "llvm/Support/ErrorHandling.h" #include "llvm/Support/raw_ostream.h" using namespace clang; Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent, bool IsFramework, bool IsExplicit) : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), Umbrella(), ASTFile(0), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), InferSubmodules(false), InferExplicitSubmodules(false), InferExportWildcard(false), ConfigMacrosExhaustive(false), NameVisibility(Hidden) { if (Parent) { if (!Parent->isAvailable()) IsAvailable = false; if (Parent->IsSystem) IsSystem = true; Parent->SubModuleIndex[Name] = Parent->SubModules.size(); Parent->SubModules.push_back(this); } } Module::~Module() { for (submodule_iterator I = submodule_begin(), IEnd = submodule_end(); I != IEnd; ++I) { delete *I; } } /// \brief Determine whether a translation unit built using the current /// language options has the given feature. static bool hasFeature(StringRef Feature, const LangOptions &LangOpts, const TargetInfo &Target) { return llvm::StringSwitch(Feature) .Case("altivec", LangOpts.AltiVec) .Case("blocks", LangOpts.Blocks) .Case("cplusplus", LangOpts.CPlusPlus) .Case("cplusplus11", LangOpts.CPlusPlus11) .Case("objc", LangOpts.ObjC1) .Case("objc_arc", LangOpts.ObjCAutoRefCount) .Case("opencl", LangOpts.OpenCL) .Case("tls", Target.isTLSSupported()) .Default(Target.hasFeature(Feature)); } bool Module::isAvailable(const LangOptions &LangOpts, const TargetInfo &Target, Requirement &Req) const { if (IsAvailable) return true; for (const Module *Current = this; Current; Current = Current->Parent) { for (unsigned I = 0, N = Current->Requirements.size(); I != N; ++I) { if (hasFeature(Current->Requirements[I].first, LangOpts, Target) != Current->Requirements[I].second) { Req = Current->Requirements[I]; return false; } } } llvm_unreachable("could not find a reason why module is unavailable"); } bool Module::isSubModuleOf(Module *Other) const { const Module *This = this; do { if (This == Other) return true; This = This->Parent; } while (This); return false; } const Module *Module::getTopLevelModule() const { const Module *Result = this; while (Result->Parent) Result = Result->Parent; return Result; } std::string Module::getFullModuleName() const { SmallVector Names; // Build up the set of module names (from innermost to outermost). for (const Module *M = this; M; M = M->Parent) Names.push_back(M->Name); std::string Result; for (SmallVectorImpl::reverse_iterator I = Names.rbegin(), IEnd = Names.rend(); I != IEnd; ++I) { if (!Result.empty()) Result += '.'; Result += *I; } return Result; } const DirectoryEntry *Module::getUmbrellaDir() const { if (const FileEntry *Header = getUmbrellaHeader()) return Header->getDir(); return Umbrella.dyn_cast(); } ArrayRef Module::getTopHeaders(FileManager &FileMgr) { if (!TopHeaderNames.empty()) { for (std::vector::iterator I = TopHeaderNames.begin(), E = TopHeaderNames.end(); I != E; ++I) { if (const FileEntry *FE = FileMgr.getFile(*I)) TopHeaders.insert(FE); } TopHeaderNames.clear(); } return llvm::makeArrayRef(TopHeaders.begin(), TopHeaders.end()); } void Module::addRequirement(StringRef Feature, bool RequiredState, const LangOptions &LangOpts, const TargetInfo &Target) { Requirements.push_back(Requirement(Feature, RequiredState)); // If this feature is currently available, we're done. if (hasFeature(Feature, LangOpts, Target) == RequiredState) return; if (!IsAvailable) return; SmallVector Stack; Stack.push_back(this); while (!Stack.empty()) { Module *Current = Stack.back(); Stack.pop_back(); if (!Current->IsAvailable) continue; Current->IsAvailable = false; for (submodule_iterator Sub = Current->submodule_begin(), SubEnd = Current->submodule_end(); Sub != SubEnd; ++Sub) { if ((*Sub)->IsAvailable) Stack.push_back(*Sub); } } } Module *Module::findSubmodule(StringRef Name) const { llvm::StringMap::const_iterator Pos = SubModuleIndex.find(Name); if (Pos == SubModuleIndex.end()) return 0; return SubModules[Pos->getValue()]; } static void printModuleId(raw_ostream &OS, const ModuleId &Id) { for (unsigned I = 0, N = Id.size(); I != N; ++I) { if (I) OS << "."; OS << Id[I].first; } } void Module::getExportedModules(SmallVectorImpl &Exported) const { // All non-explicit submodules are exported. for (std::vector::const_iterator I = SubModules.begin(), E = SubModules.end(); I != E; ++I) { Module *Mod = *I; if (!Mod->IsExplicit) Exported.push_back(Mod); } // Find re-exported modules by filtering the list of imported modules. bool AnyWildcard = false; bool UnrestrictedWildcard = false; SmallVector WildcardRestrictions; for (unsigned I = 0, N = Exports.size(); I != N; ++I) { Module *Mod = Exports[I].getPointer(); if (!Exports[I].getInt()) { // Export a named module directly; no wildcards involved. Exported.push_back(Mod); continue; } // Wildcard export: export all of the imported modules that match // the given pattern. AnyWildcard = true; if (UnrestrictedWildcard) continue; if (Module *Restriction = Exports[I].getPointer()) WildcardRestrictions.push_back(Restriction); else { WildcardRestrictions.clear(); UnrestrictedWildcard = true; } } // If there were any wildcards, push any imported modules that were // re-exported by the wildcard restriction. if (!AnyWildcard) return; for (unsigned I = 0, N = Imports.size(); I != N; ++I) { Module *Mod = Imports[I]; bool Acceptable = UnrestrictedWildcard; if (!Acceptable) { // Check whether this module meets one of the restrictions. for (unsigned R = 0, NR = WildcardRestrictions.size(); R != NR; ++R) { Module *Restriction = WildcardRestrictions[R]; if (Mod == Restriction || Mod->isSubModuleOf(Restriction)) { Acceptable = true; break; } } } if (!Acceptable) continue; Exported.push_back(Mod); } } void Module::buildVisibleModulesCache() const { assert(VisibleModulesCache.empty() && "cache does not need building"); // This module is visible to itself. VisibleModulesCache.insert(this); // Every imported module is visible. SmallVector Stack(Imports.begin(), Imports.end()); while (!Stack.empty()) { Module *CurrModule = Stack.pop_back_val(); // Every module transitively exported by an imported module is visible. if (VisibleModulesCache.insert(CurrModule).second) CurrModule->getExportedModules(Stack); } } void Module::print(raw_ostream &OS, unsigned Indent) const { OS.indent(Indent); if (IsFramework) OS << "framework "; if (IsExplicit) OS << "explicit "; OS << "module " << Name; if (IsSystem) { OS.indent(Indent + 2); OS << " [system]"; } OS << " {\n"; if (!Requirements.empty()) { OS.indent(Indent + 2); OS << "requires "; for (unsigned I = 0, N = Requirements.size(); I != N; ++I) { if (I) OS << ", "; if (!Requirements[I].second) OS << "!"; OS << Requirements[I].first; } OS << "\n"; } if (const FileEntry *UmbrellaHeader = getUmbrellaHeader()) { OS.indent(Indent + 2); OS << "umbrella header \""; OS.write_escaped(UmbrellaHeader->getName()); OS << "\"\n"; } else if (const DirectoryEntry *UmbrellaDir = getUmbrellaDir()) { OS.indent(Indent + 2); OS << "umbrella \""; OS.write_escaped(UmbrellaDir->getName()); OS << "\"\n"; } if (!ConfigMacros.empty() || ConfigMacrosExhaustive) { OS.indent(Indent + 2); OS << "config_macros "; if (ConfigMacrosExhaustive) OS << "[exhaustive]"; for (unsigned I = 0, N = ConfigMacros.size(); I != N; ++I) { if (I) OS << ", "; OS << ConfigMacros[I]; } OS << "\n"; } for (unsigned I = 0, N = NormalHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "header \""; OS.write_escaped(NormalHeaders[I]->getName()); OS << "\"\n"; } for (unsigned I = 0, N = ExcludedHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "exclude header \""; OS.write_escaped(ExcludedHeaders[I]->getName()); OS << "\"\n"; } for (unsigned I = 0, N = PrivateHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "private header \""; OS.write_escaped(PrivateHeaders[I]->getName()); OS << "\"\n"; } for (submodule_const_iterator MI = submodule_begin(), MIEnd = submodule_end(); MI != MIEnd; ++MI) (*MI)->print(OS, Indent + 2); for (unsigned I = 0, N = Exports.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "export "; if (Module *Restriction = Exports[I].getPointer()) { OS << Restriction->getFullModuleName(); if (Exports[I].getInt()) OS << ".*"; } else { OS << "*"; } OS << "\n"; } for (unsigned I = 0, N = UnresolvedExports.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "export "; printModuleId(OS, UnresolvedExports[I].Id); if (UnresolvedExports[I].Wildcard) { if (UnresolvedExports[I].Id.empty()) OS << "*"; else OS << ".*"; } OS << "\n"; } for (unsigned I = 0, N = DirectUses.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "use "; OS << DirectUses[I]->getFullModuleName(); OS << "\n"; } for (unsigned I = 0, N = UnresolvedDirectUses.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "use "; printModuleId(OS, UnresolvedDirectUses[I]); OS << "\n"; } for (unsigned I = 0, N = LinkLibraries.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "link "; if (LinkLibraries[I].IsFramework) OS << "framework "; OS << "\""; OS.write_escaped(LinkLibraries[I].Library); OS << "\""; } for (unsigned I = 0, N = UnresolvedConflicts.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "conflict "; printModuleId(OS, UnresolvedConflicts[I].Id); OS << ", \""; OS.write_escaped(UnresolvedConflicts[I].Message); OS << "\"\n"; } for (unsigned I = 0, N = Conflicts.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "conflict "; OS << Conflicts[I].Other->getFullModuleName(); OS << ", \""; OS.write_escaped(Conflicts[I].Message); OS << "\"\n"; } if (InferSubmodules) { OS.indent(Indent + 2); if (InferExplicitSubmodules) OS << "explicit "; OS << "module * {\n"; if (InferExportWildcard) { OS.indent(Indent + 4); OS << "export *\n"; } OS.indent(Indent + 2); OS << "}\n"; } OS.indent(Indent); OS << "}\n"; } void Module::dump() const { print(llvm::errs()); } @ 1.1.1.1 log @Import Clang 3.4rc1 r195771. @ text @@ 1.1.1.2 log @Import clang 3.5svn r198450. @ text @d72 1 a72 1 Requirement &Req, HeaderDirective &MissingHeader) const { a76 4 if (!Current->MissingHeaders.empty()) { MissingHeader = Current->MissingHeaders.front(); return false; } @ 1.1.1.2.2.1 log @Rebase. @ text @d27 9 a35 9 Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent, const FileEntry *File, bool IsFramework, bool IsExplicit) : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), ModuleMap(File), Umbrella(), ASTFile(nullptr), IsMissingRequirement(false), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), IsExternC(false), IsInferred(false), InferSubmodules(false), InferExplicitSubmodules(false), InferExportWildcard(false), ConfigMacrosExhaustive(false), NameVisibility(Hidden) { a40 3 if (Parent->IsExternC) IsExternC = true; IsMissingRequirement = Parent->IsMissingRequirement; d93 1 a93 1 bool Module::isSubModuleOf(const Module *Other) const { a161 4 markUnavailable(/*MissingRequirement*/true); } void Module::markUnavailable(bool MissingRequirement) { a174 1 Current->IsMissingRequirement |= MissingRequirement; d187 2 a188 2 return nullptr; d356 1 a356 2 if (!(*MI)->IsInferred) (*MI)->print(OS, Indent + 2); @ 1.1.1.3 log @Import Clang 3.5svn r209886. @ text @d27 9 a35 9 Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent, const FileEntry *File, bool IsFramework, bool IsExplicit) : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), ModuleMap(File), Umbrella(), ASTFile(nullptr), IsMissingRequirement(false), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), IsExternC(false), IsInferred(false), InferSubmodules(false), InferExplicitSubmodules(false), InferExportWildcard(false), ConfigMacrosExhaustive(false), NameVisibility(Hidden) { a40 3 if (Parent->IsExternC) IsExternC = true; IsMissingRequirement = Parent->IsMissingRequirement; d93 1 a93 1 bool Module::isSubModuleOf(const Module *Other) const { a161 4 markUnavailable(/*MissingRequirement*/true); } void Module::markUnavailable(bool MissingRequirement) { a174 1 Current->IsMissingRequirement |= MissingRequirement; d187 2 a188 2 return nullptr; d356 1 a356 2 if (!(*MI)->IsInferred) (*MI)->print(OS, Indent + 2); @ 1.1.1.4 log @Import clang 3.6svn r215315. @ text @d28 2 a29 2 bool IsFramework, bool IsExplicit) : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), d364 1 a364 5 // Print inferred subframework modules so that we don't need to re-infer // them (requires expensive directory iteration + stat calls) when we build // the module. Regular inferred submodules are OK, as we need to look at all // those header files anyway. if (!(*MI)->IsInferred || (*MI)->IsFramework) @ 1.1.1.4.2.1 log @Update LLVM to 3.6.1, requested by joerg in ticket 824. @ text @d29 1 a29 1 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), Directory(), d73 3 a75 3 bool Module::isAvailable(const LangOptions &LangOpts, const TargetInfo &Target, Requirement &Req, UnresolvedHeaderDirective &MissingHeader) const { d296 1 a296 1 if (IsSystem || IsExternC) { d298 1 a298 4 if (IsSystem) OS << " [system]"; if (IsExternC) OS << " [extern_c]"; d341 12 a352 16 struct { StringRef Prefix; HeaderKind Kind; } Kinds[] = {{"", HK_Normal}, {"textual ", HK_Textual}, {"private ", HK_Private}, {"private textual ", HK_PrivateTextual}, {"exclude ", HK_Excluded}}; for (auto &K : Kinds) { for (auto &H : Headers[K.Kind]) { OS.indent(Indent + 2); OS << K.Prefix << "header \""; OS.write_escaped(H.NameAsWritten); OS << "\"\n"; } d355 7 @ 1.1.1.5 log @Import Clang 3.6RC1 r227398. @ text @d29 1 a29 1 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), Directory(), d73 3 a75 3 bool Module::isAvailable(const LangOptions &LangOpts, const TargetInfo &Target, Requirement &Req, UnresolvedHeaderDirective &MissingHeader) const { d296 1 a296 1 if (IsSystem || IsExternC) { d298 1 a298 4 if (IsSystem) OS << " [system]"; if (IsExternC) OS << " [extern_c]"; d341 12 a352 16 struct { StringRef Prefix; HeaderKind Kind; } Kinds[] = {{"", HK_Normal}, {"textual ", HK_Textual}, {"private ", HK_Private}, {"private textual ", HK_PrivateTextual}, {"exclude ", HK_Excluded}}; for (auto &K : Kinds) { for (auto &H : Headers[K.Kind]) { OS.indent(Indent + 2); OS << K.Prefix << "header \""; OS.write_escaped(H.NameAsWritten); OS << "\"\n"; } d355 7 @ 1.1.1.6 log @Import Clang 3.8.0rc3 r261930. @ text @d28 1 a28 1 bool IsFramework, bool IsExplicit, unsigned VisibilityID) d30 1 a30 2 Umbrella(), Signature(0), ASTFile(nullptr), VisibilityID(VisibilityID), IsMissingRequirement(false), HasIncompatibleModuleFile(false), d61 10 a70 16 bool HasFeature = llvm::StringSwitch(Feature) .Case("altivec", LangOpts.AltiVec) .Case("blocks", LangOpts.Blocks) .Case("cplusplus", LangOpts.CPlusPlus) .Case("cplusplus11", LangOpts.CPlusPlus11) .Case("objc", LangOpts.ObjC1) .Case("objc_arc", LangOpts.ObjCAutoRefCount) .Case("opencl", LangOpts.OpenCL) .Case("tls", Target.isTLSSupported()) .Case("zvector", LangOpts.ZVector) .Default(Target.hasFeature(Feature)); if (!HasFeature) HasFeature = std::find(LangOpts.ModuleFeatures.begin(), LangOpts.ModuleFeatures.end(), Feature) != LangOpts.ModuleFeatures.end(); return HasFeature; d80 4 a90 4 if (!Current->MissingHeaders.empty()) { MissingHeader = Current->MissingHeaders.front(); return false; } d136 3 a138 12 bool Module::fullModuleNameIs(ArrayRef nameParts) const { for (const Module *M = this; M; M = M->Parent) { if (nameParts.empty() || M->Name != nameParts.back()) return false; nameParts = nameParts.drop_back(); } return nameParts.empty(); } Module::DirectoryName Module::getUmbrellaDir() const { if (Header U = getUmbrellaHeader()) return {"", U.Entry->getDir()}; d140 1 a140 1 return {UmbrellaAsWritten, Umbrella.dyn_cast()}; a155 13 bool Module::directlyUses(const Module *Requested) const { auto *Top = getTopLevelModule(); // A top-level module implicitly uses itself. if (Requested->isSubModuleOf(Top)) return true; for (auto *Use : Top->DirectUses) if (Requested->isSubModuleOf(Use)) return true; return false; } d169 1 a169 5 auto needUpdate = [MissingRequirement](Module *M) { return M->IsAvailable || (!M->IsMissingRequirement && MissingRequirement); }; if (!needUpdate(this)) d178 1 a178 1 if (!needUpdate(Current)) d186 1 a186 1 if (needUpdate(*Sub)) d319 1 a319 1 if (Header H = getUmbrellaHeader()) { d322 1 a322 1 OS.write_escaped(H.NameAsWritten); d324 1 a324 1 } else if (DirectoryName D = getUmbrellaDir()) { d327 1 a327 1 OS.write_escaped(D.NameAsWritten); a459 6 void VisibleModuleSet::setVisible(Module *M, SourceLocation Loc, VisibleCallback Vis, ConflictCallback Cb) { if (isVisible(M)) return; ++Generation; a460 37 struct Visiting { Module *M; Visiting *ExportedBy; }; std::function VisitModule = [&](Visiting V) { // Modules that aren't available cannot be made visible. if (!V.M->isAvailable()) return; // Nothing to do for a module that's already visible. unsigned ID = V.M->getVisibilityID(); if (ImportLocs.size() <= ID) ImportLocs.resize(ID + 1); else if (ImportLocs[ID].isValid()) return; ImportLocs[ID] = Loc; Vis(M); // Make any exported modules visible. SmallVector Exports; V.M->getExportedModules(Exports); for (Module *E : Exports) VisitModule({E, &V}); for (auto &C : V.M->Conflicts) { if (isVisible(C.Other)) { llvm::SmallVector Path; for (Visiting *I = &V; I; I = I->ExportedBy) Path.push_back(I->M); Cb(Path, C.Other, C.Message); } } }; VisitModule({M, nullptr}); } @ 1.1.1.6.2.1 log @Sync with HEAD @ text @d36 1 a36 1 NoUndeclaredIncludes(false), NameVisibility(Hidden) { a43 2 if (Parent->NoUndeclaredIncludes) NoUndeclaredIncludes = true; a66 2 .Case("freestanding", LangOpts.Freestanding) .Case("gnuinlineasm", LangOpts.GNUAsm) a181 5 // Anyone is allowed to use our builtin stddef.h and its accompanying module. if (!Requested->Parent && Requested->Name == "_Builtin_stddef_max_align_t") return true; d421 6 a426 2 if (UnresolvedExports[I].Wildcard) OS << (UnresolvedExports[I].Id.empty() ? "*" : ".*"); d489 1 a489 1 LLVM_DUMP_METHOD void Module::dump() const { a494 1 assert(Loc.isValid() && "setVisible expects a valid import location"); @ 1.1.1.7 log @Import Clang pre-4.0.0 r291444. @ text @d36 1 a36 1 NoUndeclaredIncludes(false), NameVisibility(Hidden) { a43 2 if (Parent->NoUndeclaredIncludes) NoUndeclaredIncludes = true; a66 2 .Case("freestanding", LangOpts.Freestanding) .Case("gnuinlineasm", LangOpts.GNUAsm) a181 5 // Anyone is allowed to use our builtin stddef.h and its accompanying module. if (!Requested->Parent && Requested->Name == "_Builtin_stddef_max_align_t") return true; d421 6 a426 2 if (UnresolvedExports[I].Wildcard) OS << (UnresolvedExports[I].Id.empty() ? "*" : ".*"); d489 1 a489 1 LLVM_DUMP_METHOD void Module::dump() const { a494 1 assert(Loc.isValid() && "setVisible expects a valid import location"); @ 1.1.1.8 log @Import clang r309604 from branches/release_50 @ text @a15 1 #include "clang/Basic/CharInfo.h" d30 1 a30 1 Umbrella(), ASTFile(nullptr), VisibilityID(VisibilityID), a66 1 .Case("coroutines", LangOpts.CoroutinesTS) d127 1 a127 30 static StringRef getModuleNameFromComponent( const std::pair &IdComponent) { return IdComponent.first; } static StringRef getModuleNameFromComponent(StringRef R) { return R; } template static void printModuleId(raw_ostream &OS, InputIter Begin, InputIter End, bool AllowStringLiterals = true) { for (InputIter It = Begin; It != End; ++It) { if (It != Begin) OS << "."; StringRef Name = getModuleNameFromComponent(*It); if (!AllowStringLiterals || isValidIdentifier(Name)) OS << Name; else { OS << '"'; OS.write_escaped(Name); OS << '"'; } } } template static void printModuleId(raw_ostream &OS, const Container &C) { return printModuleId(OS, C.begin(), C.end()); } std::string Module::getFullModuleName(bool AllowStringLiterals) const { d135 9 a143 5 llvm::raw_string_ostream Out(Result); printModuleId(Out, Names.rbegin(), Names.rend(), AllowStringLiterals); Out.flush(); d242 8 d336 1 a336 2 OS << "module "; printModuleId(OS, &Name, &Name + 1); a395 1 assert(&K == &Kinds[K.Kind] && "kinds in wrong order"); d400 1 a400 19 OS << "\" { size " << H.Entry->getSize() << " mtime " << H.Entry->getModificationTime() << " }\n"; } } for (auto *Unresolved : {&UnresolvedHeaders, &MissingHeaders}) { for (auto &U : *Unresolved) { OS.indent(Indent + 2); OS << Kinds[U.Kind].Prefix << "header \""; OS.write_escaped(U.FileName); OS << "\""; if (U.Size || U.ModTime) { OS << " {"; if (U.Size) OS << " size " << *U.Size; if (U.ModTime) OS << " mtime " << *U.ModTime; OS << " }"; } OS << "\n"; d417 1 a417 1 OS << Restriction->getFullModuleName(true); d438 1 a438 1 OS << DirectUses[I]->getFullModuleName(true); d471 1 a471 1 OS << Conflicts[I].Other->getFullModuleName(true); @ 1.1.1.8.4.1 log @Sync with HEAD @ text @d1 1 a1 1 //===- Module.cpp - Describe a module -------------------------------------===// a18 1 #include "clang/Basic/SourceLocation.h" a21 2 #include "llvm/ADT/StringMap.h" #include "llvm/ADT/StringRef.h" a22 1 #include "llvm/Support/Compiler.h" a24 6 #include #include #include #include #include #include d30 6 a35 6 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), VisibilityID(VisibilityID), IsMissingRequirement(false), HasIncompatibleModuleFile(false), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), IsExternC(false), IsInferred(false), InferSubmodules(false), InferExplicitSubmodules(false), d37 1 a37 2 NoUndeclaredIncludes(false), ModuleMapIsPrivate(false), NameVisibility(Hidden) { a46 2 if (Parent->ModuleMapIsPrivate) ModuleMapIsPrivate = true; d61 1 a61 1 /// Determine whether a translation unit built using the current a70 5 .Case("cplusplus14", LangOpts.CPlusPlus14) .Case("cplusplus17", LangOpts.CPlusPlus17) .Case("c99", LangOpts.C99) .Case("c11", LangOpts.C11) .Case("c17", LangOpts.C17) d88 1 a88 2 UnresolvedHeaderDirective &MissingHeader, Module *&ShadowingModule) const { a92 4 if (Current->ShadowingModule) { ShadowingModule = Current->ShadowingModule; return false; } a132 1 a442 5 if (!ExportAsModule.empty()) { OS.indent(Indent + 2); OS << "export_as" << ExportAsModule << "\n"; } @ 1.1.1.8.4.2 log @Mostly merge changes from HEAD upto 20200411 @ text @@ 1.1.1.8.2.1 log @Sync with HEAD @ text @d1 1 a1 1 //===- Module.cpp - Describe a module -------------------------------------===// a18 1 #include "clang/Basic/SourceLocation.h" a21 2 #include "llvm/ADT/StringMap.h" #include "llvm/ADT/StringRef.h" a22 1 #include "llvm/Support/Compiler.h" a24 6 #include #include #include #include #include #include d30 6 a35 6 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), VisibilityID(VisibilityID), IsMissingRequirement(false), HasIncompatibleModuleFile(false), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), IsExternC(false), IsInferred(false), InferSubmodules(false), InferExplicitSubmodules(false), d37 1 a37 2 NoUndeclaredIncludes(false), ModuleMapIsPrivate(false), NameVisibility(Hidden) { a46 2 if (Parent->ModuleMapIsPrivate) ModuleMapIsPrivate = true; d61 1 a61 1 /// Determine whether a translation unit built using the current a70 5 .Case("cplusplus14", LangOpts.CPlusPlus14) .Case("cplusplus17", LangOpts.CPlusPlus17) .Case("c99", LangOpts.C99) .Case("c11", LangOpts.C11) .Case("c17", LangOpts.C17) d88 1 a88 2 UnresolvedHeaderDirective &MissingHeader, Module *&ShadowingModule) const { a92 4 if (Current->ShadowingModule) { ShadowingModule = Current->ShadowingModule; return false; } a132 1 a442 5 if (!ExportAsModule.empty()) { OS.indent(Indent + 2); OS << "export_as" << ExportAsModule << "\n"; } @ 1.1.1.9 log @Import clang r337282 from trunk @ text @d1 1 a1 1 //===- Module.cpp - Describe a module -------------------------------------===// a18 1 #include "clang/Basic/SourceLocation.h" a21 2 #include "llvm/ADT/StringMap.h" #include "llvm/ADT/StringRef.h" a22 1 #include "llvm/Support/Compiler.h" a24 6 #include #include #include #include #include #include d30 6 a35 6 : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), VisibilityID(VisibilityID), IsMissingRequirement(false), HasIncompatibleModuleFile(false), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), IsExternC(false), IsInferred(false), InferSubmodules(false), InferExplicitSubmodules(false), d37 1 a37 2 NoUndeclaredIncludes(false), ModuleMapIsPrivate(false), NameVisibility(Hidden) { a46 2 if (Parent->ModuleMapIsPrivate) ModuleMapIsPrivate = true; d61 1 a61 1 /// Determine whether a translation unit built using the current a70 5 .Case("cplusplus14", LangOpts.CPlusPlus14) .Case("cplusplus17", LangOpts.CPlusPlus17) .Case("c99", LangOpts.C99) .Case("c11", LangOpts.C11) .Case("c17", LangOpts.C17) d88 1 a88 2 UnresolvedHeaderDirective &MissingHeader, Module *&ShadowingModule) const { a92 4 if (Current->ShadowingModule) { ShadowingModule = Current->ShadowingModule; return false; } a132 1 a442 5 if (!ExportAsModule.empty()) { OS.indent(Indent + 2); OS << "export_as" << ExportAsModule << "\n"; } @ 1.1.1.10 log @Mark old LLVM instance as dead. @ text @@ 1.1.1.4.4.1 log @file Module.cpp was added on branch tls-maxphys on 2014-08-19 23:47:26 +0000 @ text @d1 460 @ 1.1.1.4.4.2 log @Rebase to HEAD as of a few days ago. @ text @a0 460 //===--- Module.cpp - Describe a module -----------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This file defines the Module class, which describes a module in the source // code. // //===----------------------------------------------------------------------===// #include "clang/Basic/Module.h" #include "clang/Basic/FileManager.h" #include "clang/Basic/LangOptions.h" #include "clang/Basic/TargetInfo.h" #include "llvm/ADT/ArrayRef.h" #include "llvm/ADT/SmallVector.h" #include "llvm/ADT/StringSwitch.h" #include "llvm/Support/ErrorHandling.h" #include "llvm/Support/raw_ostream.h" using namespace clang; Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent, bool IsFramework, bool IsExplicit) : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), Umbrella(), ASTFile(nullptr), IsMissingRequirement(false), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), IsExternC(false), IsInferred(false), InferSubmodules(false), InferExplicitSubmodules(false), InferExportWildcard(false), ConfigMacrosExhaustive(false), NameVisibility(Hidden) { if (Parent) { if (!Parent->isAvailable()) IsAvailable = false; if (Parent->IsSystem) IsSystem = true; if (Parent->IsExternC) IsExternC = true; IsMissingRequirement = Parent->IsMissingRequirement; Parent->SubModuleIndex[Name] = Parent->SubModules.size(); Parent->SubModules.push_back(this); } } Module::~Module() { for (submodule_iterator I = submodule_begin(), IEnd = submodule_end(); I != IEnd; ++I) { delete *I; } } /// \brief Determine whether a translation unit built using the current /// language options has the given feature. static bool hasFeature(StringRef Feature, const LangOptions &LangOpts, const TargetInfo &Target) { return llvm::StringSwitch(Feature) .Case("altivec", LangOpts.AltiVec) .Case("blocks", LangOpts.Blocks) .Case("cplusplus", LangOpts.CPlusPlus) .Case("cplusplus11", LangOpts.CPlusPlus11) .Case("objc", LangOpts.ObjC1) .Case("objc_arc", LangOpts.ObjCAutoRefCount) .Case("opencl", LangOpts.OpenCL) .Case("tls", Target.isTLSSupported()) .Default(Target.hasFeature(Feature)); } bool Module::isAvailable(const LangOptions &LangOpts, const TargetInfo &Target, Requirement &Req, HeaderDirective &MissingHeader) const { if (IsAvailable) return true; for (const Module *Current = this; Current; Current = Current->Parent) { if (!Current->MissingHeaders.empty()) { MissingHeader = Current->MissingHeaders.front(); return false; } for (unsigned I = 0, N = Current->Requirements.size(); I != N; ++I) { if (hasFeature(Current->Requirements[I].first, LangOpts, Target) != Current->Requirements[I].second) { Req = Current->Requirements[I]; return false; } } } llvm_unreachable("could not find a reason why module is unavailable"); } bool Module::isSubModuleOf(const Module *Other) const { const Module *This = this; do { if (This == Other) return true; This = This->Parent; } while (This); return false; } const Module *Module::getTopLevelModule() const { const Module *Result = this; while (Result->Parent) Result = Result->Parent; return Result; } std::string Module::getFullModuleName() const { SmallVector Names; // Build up the set of module names (from innermost to outermost). for (const Module *M = this; M; M = M->Parent) Names.push_back(M->Name); std::string Result; for (SmallVectorImpl::reverse_iterator I = Names.rbegin(), IEnd = Names.rend(); I != IEnd; ++I) { if (!Result.empty()) Result += '.'; Result += *I; } return Result; } const DirectoryEntry *Module::getUmbrellaDir() const { if (const FileEntry *Header = getUmbrellaHeader()) return Header->getDir(); return Umbrella.dyn_cast(); } ArrayRef Module::getTopHeaders(FileManager &FileMgr) { if (!TopHeaderNames.empty()) { for (std::vector::iterator I = TopHeaderNames.begin(), E = TopHeaderNames.end(); I != E; ++I) { if (const FileEntry *FE = FileMgr.getFile(*I)) TopHeaders.insert(FE); } TopHeaderNames.clear(); } return llvm::makeArrayRef(TopHeaders.begin(), TopHeaders.end()); } void Module::addRequirement(StringRef Feature, bool RequiredState, const LangOptions &LangOpts, const TargetInfo &Target) { Requirements.push_back(Requirement(Feature, RequiredState)); // If this feature is currently available, we're done. if (hasFeature(Feature, LangOpts, Target) == RequiredState) return; markUnavailable(/*MissingRequirement*/true); } void Module::markUnavailable(bool MissingRequirement) { if (!IsAvailable) return; SmallVector Stack; Stack.push_back(this); while (!Stack.empty()) { Module *Current = Stack.back(); Stack.pop_back(); if (!Current->IsAvailable) continue; Current->IsAvailable = false; Current->IsMissingRequirement |= MissingRequirement; for (submodule_iterator Sub = Current->submodule_begin(), SubEnd = Current->submodule_end(); Sub != SubEnd; ++Sub) { if ((*Sub)->IsAvailable) Stack.push_back(*Sub); } } } Module *Module::findSubmodule(StringRef Name) const { llvm::StringMap::const_iterator Pos = SubModuleIndex.find(Name); if (Pos == SubModuleIndex.end()) return nullptr; return SubModules[Pos->getValue()]; } static void printModuleId(raw_ostream &OS, const ModuleId &Id) { for (unsigned I = 0, N = Id.size(); I != N; ++I) { if (I) OS << "."; OS << Id[I].first; } } void Module::getExportedModules(SmallVectorImpl &Exported) const { // All non-explicit submodules are exported. for (std::vector::const_iterator I = SubModules.begin(), E = SubModules.end(); I != E; ++I) { Module *Mod = *I; if (!Mod->IsExplicit) Exported.push_back(Mod); } // Find re-exported modules by filtering the list of imported modules. bool AnyWildcard = false; bool UnrestrictedWildcard = false; SmallVector WildcardRestrictions; for (unsigned I = 0, N = Exports.size(); I != N; ++I) { Module *Mod = Exports[I].getPointer(); if (!Exports[I].getInt()) { // Export a named module directly; no wildcards involved. Exported.push_back(Mod); continue; } // Wildcard export: export all of the imported modules that match // the given pattern. AnyWildcard = true; if (UnrestrictedWildcard) continue; if (Module *Restriction = Exports[I].getPointer()) WildcardRestrictions.push_back(Restriction); else { WildcardRestrictions.clear(); UnrestrictedWildcard = true; } } // If there were any wildcards, push any imported modules that were // re-exported by the wildcard restriction. if (!AnyWildcard) return; for (unsigned I = 0, N = Imports.size(); I != N; ++I) { Module *Mod = Imports[I]; bool Acceptable = UnrestrictedWildcard; if (!Acceptable) { // Check whether this module meets one of the restrictions. for (unsigned R = 0, NR = WildcardRestrictions.size(); R != NR; ++R) { Module *Restriction = WildcardRestrictions[R]; if (Mod == Restriction || Mod->isSubModuleOf(Restriction)) { Acceptable = true; break; } } } if (!Acceptable) continue; Exported.push_back(Mod); } } void Module::buildVisibleModulesCache() const { assert(VisibleModulesCache.empty() && "cache does not need building"); // This module is visible to itself. VisibleModulesCache.insert(this); // Every imported module is visible. SmallVector Stack(Imports.begin(), Imports.end()); while (!Stack.empty()) { Module *CurrModule = Stack.pop_back_val(); // Every module transitively exported by an imported module is visible. if (VisibleModulesCache.insert(CurrModule).second) CurrModule->getExportedModules(Stack); } } void Module::print(raw_ostream &OS, unsigned Indent) const { OS.indent(Indent); if (IsFramework) OS << "framework "; if (IsExplicit) OS << "explicit "; OS << "module " << Name; if (IsSystem) { OS.indent(Indent + 2); OS << " [system]"; } OS << " {\n"; if (!Requirements.empty()) { OS.indent(Indent + 2); OS << "requires "; for (unsigned I = 0, N = Requirements.size(); I != N; ++I) { if (I) OS << ", "; if (!Requirements[I].second) OS << "!"; OS << Requirements[I].first; } OS << "\n"; } if (const FileEntry *UmbrellaHeader = getUmbrellaHeader()) { OS.indent(Indent + 2); OS << "umbrella header \""; OS.write_escaped(UmbrellaHeader->getName()); OS << "\"\n"; } else if (const DirectoryEntry *UmbrellaDir = getUmbrellaDir()) { OS.indent(Indent + 2); OS << "umbrella \""; OS.write_escaped(UmbrellaDir->getName()); OS << "\"\n"; } if (!ConfigMacros.empty() || ConfigMacrosExhaustive) { OS.indent(Indent + 2); OS << "config_macros "; if (ConfigMacrosExhaustive) OS << "[exhaustive]"; for (unsigned I = 0, N = ConfigMacros.size(); I != N; ++I) { if (I) OS << ", "; OS << ConfigMacros[I]; } OS << "\n"; } for (unsigned I = 0, N = NormalHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "header \""; OS.write_escaped(NormalHeaders[I]->getName()); OS << "\"\n"; } for (unsigned I = 0, N = ExcludedHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "exclude header \""; OS.write_escaped(ExcludedHeaders[I]->getName()); OS << "\"\n"; } for (unsigned I = 0, N = PrivateHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "private header \""; OS.write_escaped(PrivateHeaders[I]->getName()); OS << "\"\n"; } for (submodule_const_iterator MI = submodule_begin(), MIEnd = submodule_end(); MI != MIEnd; ++MI) // Print inferred subframework modules so that we don't need to re-infer // them (requires expensive directory iteration + stat calls) when we build // the module. Regular inferred submodules are OK, as we need to look at all // those header files anyway. if (!(*MI)->IsInferred || (*MI)->IsFramework) (*MI)->print(OS, Indent + 2); for (unsigned I = 0, N = Exports.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "export "; if (Module *Restriction = Exports[I].getPointer()) { OS << Restriction->getFullModuleName(); if (Exports[I].getInt()) OS << ".*"; } else { OS << "*"; } OS << "\n"; } for (unsigned I = 0, N = UnresolvedExports.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "export "; printModuleId(OS, UnresolvedExports[I].Id); if (UnresolvedExports[I].Wildcard) { if (UnresolvedExports[I].Id.empty()) OS << "*"; else OS << ".*"; } OS << "\n"; } for (unsigned I = 0, N = DirectUses.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "use "; OS << DirectUses[I]->getFullModuleName(); OS << "\n"; } for (unsigned I = 0, N = UnresolvedDirectUses.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "use "; printModuleId(OS, UnresolvedDirectUses[I]); OS << "\n"; } for (unsigned I = 0, N = LinkLibraries.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "link "; if (LinkLibraries[I].IsFramework) OS << "framework "; OS << "\""; OS.write_escaped(LinkLibraries[I].Library); OS << "\""; } for (unsigned I = 0, N = UnresolvedConflicts.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "conflict "; printModuleId(OS, UnresolvedConflicts[I].Id); OS << ", \""; OS.write_escaped(UnresolvedConflicts[I].Message); OS << "\"\n"; } for (unsigned I = 0, N = Conflicts.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "conflict "; OS << Conflicts[I].Other->getFullModuleName(); OS << ", \""; OS.write_escaped(Conflicts[I].Message); OS << "\"\n"; } if (InferSubmodules) { OS.indent(Indent + 2); if (InferExplicitSubmodules) OS << "explicit "; OS << "module * {\n"; if (InferExportWildcard) { OS.indent(Indent + 4); OS << "export *\n"; } OS.indent(Indent + 2); OS << "}\n"; } OS.indent(Indent); OS << "}\n"; } void Module::dump() const { print(llvm::errs()); } @ 1.1.1.2.4.1 log @file Module.cpp was added on branch yamt-pagecache on 2014-05-22 16:18:26 +0000 @ text @d1 447 @ 1.1.1.2.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 447 //===--- Module.cpp - Describe a module -----------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This file defines the Module class, which describes a module in the source // code. // //===----------------------------------------------------------------------===// #include "clang/Basic/Module.h" #include "clang/Basic/FileManager.h" #include "clang/Basic/LangOptions.h" #include "clang/Basic/TargetInfo.h" #include "llvm/ADT/ArrayRef.h" #include "llvm/ADT/SmallVector.h" #include "llvm/ADT/StringSwitch.h" #include "llvm/Support/ErrorHandling.h" #include "llvm/Support/raw_ostream.h" using namespace clang; Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent, bool IsFramework, bool IsExplicit) : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent), Umbrella(), ASTFile(0), IsAvailable(true), IsFromModuleFile(false), IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false), InferSubmodules(false), InferExplicitSubmodules(false), InferExportWildcard(false), ConfigMacrosExhaustive(false), NameVisibility(Hidden) { if (Parent) { if (!Parent->isAvailable()) IsAvailable = false; if (Parent->IsSystem) IsSystem = true; Parent->SubModuleIndex[Name] = Parent->SubModules.size(); Parent->SubModules.push_back(this); } } Module::~Module() { for (submodule_iterator I = submodule_begin(), IEnd = submodule_end(); I != IEnd; ++I) { delete *I; } } /// \brief Determine whether a translation unit built using the current /// language options has the given feature. static bool hasFeature(StringRef Feature, const LangOptions &LangOpts, const TargetInfo &Target) { return llvm::StringSwitch(Feature) .Case("altivec", LangOpts.AltiVec) .Case("blocks", LangOpts.Blocks) .Case("cplusplus", LangOpts.CPlusPlus) .Case("cplusplus11", LangOpts.CPlusPlus11) .Case("objc", LangOpts.ObjC1) .Case("objc_arc", LangOpts.ObjCAutoRefCount) .Case("opencl", LangOpts.OpenCL) .Case("tls", Target.isTLSSupported()) .Default(Target.hasFeature(Feature)); } bool Module::isAvailable(const LangOptions &LangOpts, const TargetInfo &Target, Requirement &Req, HeaderDirective &MissingHeader) const { if (IsAvailable) return true; for (const Module *Current = this; Current; Current = Current->Parent) { if (!Current->MissingHeaders.empty()) { MissingHeader = Current->MissingHeaders.front(); return false; } for (unsigned I = 0, N = Current->Requirements.size(); I != N; ++I) { if (hasFeature(Current->Requirements[I].first, LangOpts, Target) != Current->Requirements[I].second) { Req = Current->Requirements[I]; return false; } } } llvm_unreachable("could not find a reason why module is unavailable"); } bool Module::isSubModuleOf(Module *Other) const { const Module *This = this; do { if (This == Other) return true; This = This->Parent; } while (This); return false; } const Module *Module::getTopLevelModule() const { const Module *Result = this; while (Result->Parent) Result = Result->Parent; return Result; } std::string Module::getFullModuleName() const { SmallVector Names; // Build up the set of module names (from innermost to outermost). for (const Module *M = this; M; M = M->Parent) Names.push_back(M->Name); std::string Result; for (SmallVectorImpl::reverse_iterator I = Names.rbegin(), IEnd = Names.rend(); I != IEnd; ++I) { if (!Result.empty()) Result += '.'; Result += *I; } return Result; } const DirectoryEntry *Module::getUmbrellaDir() const { if (const FileEntry *Header = getUmbrellaHeader()) return Header->getDir(); return Umbrella.dyn_cast(); } ArrayRef Module::getTopHeaders(FileManager &FileMgr) { if (!TopHeaderNames.empty()) { for (std::vector::iterator I = TopHeaderNames.begin(), E = TopHeaderNames.end(); I != E; ++I) { if (const FileEntry *FE = FileMgr.getFile(*I)) TopHeaders.insert(FE); } TopHeaderNames.clear(); } return llvm::makeArrayRef(TopHeaders.begin(), TopHeaders.end()); } void Module::addRequirement(StringRef Feature, bool RequiredState, const LangOptions &LangOpts, const TargetInfo &Target) { Requirements.push_back(Requirement(Feature, RequiredState)); // If this feature is currently available, we're done. if (hasFeature(Feature, LangOpts, Target) == RequiredState) return; if (!IsAvailable) return; SmallVector Stack; Stack.push_back(this); while (!Stack.empty()) { Module *Current = Stack.back(); Stack.pop_back(); if (!Current->IsAvailable) continue; Current->IsAvailable = false; for (submodule_iterator Sub = Current->submodule_begin(), SubEnd = Current->submodule_end(); Sub != SubEnd; ++Sub) { if ((*Sub)->IsAvailable) Stack.push_back(*Sub); } } } Module *Module::findSubmodule(StringRef Name) const { llvm::StringMap::const_iterator Pos = SubModuleIndex.find(Name); if (Pos == SubModuleIndex.end()) return 0; return SubModules[Pos->getValue()]; } static void printModuleId(raw_ostream &OS, const ModuleId &Id) { for (unsigned I = 0, N = Id.size(); I != N; ++I) { if (I) OS << "."; OS << Id[I].first; } } void Module::getExportedModules(SmallVectorImpl &Exported) const { // All non-explicit submodules are exported. for (std::vector::const_iterator I = SubModules.begin(), E = SubModules.end(); I != E; ++I) { Module *Mod = *I; if (!Mod->IsExplicit) Exported.push_back(Mod); } // Find re-exported modules by filtering the list of imported modules. bool AnyWildcard = false; bool UnrestrictedWildcard = false; SmallVector WildcardRestrictions; for (unsigned I = 0, N = Exports.size(); I != N; ++I) { Module *Mod = Exports[I].getPointer(); if (!Exports[I].getInt()) { // Export a named module directly; no wildcards involved. Exported.push_back(Mod); continue; } // Wildcard export: export all of the imported modules that match // the given pattern. AnyWildcard = true; if (UnrestrictedWildcard) continue; if (Module *Restriction = Exports[I].getPointer()) WildcardRestrictions.push_back(Restriction); else { WildcardRestrictions.clear(); UnrestrictedWildcard = true; } } // If there were any wildcards, push any imported modules that were // re-exported by the wildcard restriction. if (!AnyWildcard) return; for (unsigned I = 0, N = Imports.size(); I != N; ++I) { Module *Mod = Imports[I]; bool Acceptable = UnrestrictedWildcard; if (!Acceptable) { // Check whether this module meets one of the restrictions. for (unsigned R = 0, NR = WildcardRestrictions.size(); R != NR; ++R) { Module *Restriction = WildcardRestrictions[R]; if (Mod == Restriction || Mod->isSubModuleOf(Restriction)) { Acceptable = true; break; } } } if (!Acceptable) continue; Exported.push_back(Mod); } } void Module::buildVisibleModulesCache() const { assert(VisibleModulesCache.empty() && "cache does not need building"); // This module is visible to itself. VisibleModulesCache.insert(this); // Every imported module is visible. SmallVector Stack(Imports.begin(), Imports.end()); while (!Stack.empty()) { Module *CurrModule = Stack.pop_back_val(); // Every module transitively exported by an imported module is visible. if (VisibleModulesCache.insert(CurrModule).second) CurrModule->getExportedModules(Stack); } } void Module::print(raw_ostream &OS, unsigned Indent) const { OS.indent(Indent); if (IsFramework) OS << "framework "; if (IsExplicit) OS << "explicit "; OS << "module " << Name; if (IsSystem) { OS.indent(Indent + 2); OS << " [system]"; } OS << " {\n"; if (!Requirements.empty()) { OS.indent(Indent + 2); OS << "requires "; for (unsigned I = 0, N = Requirements.size(); I != N; ++I) { if (I) OS << ", "; if (!Requirements[I].second) OS << "!"; OS << Requirements[I].first; } OS << "\n"; } if (const FileEntry *UmbrellaHeader = getUmbrellaHeader()) { OS.indent(Indent + 2); OS << "umbrella header \""; OS.write_escaped(UmbrellaHeader->getName()); OS << "\"\n"; } else if (const DirectoryEntry *UmbrellaDir = getUmbrellaDir()) { OS.indent(Indent + 2); OS << "umbrella \""; OS.write_escaped(UmbrellaDir->getName()); OS << "\"\n"; } if (!ConfigMacros.empty() || ConfigMacrosExhaustive) { OS.indent(Indent + 2); OS << "config_macros "; if (ConfigMacrosExhaustive) OS << "[exhaustive]"; for (unsigned I = 0, N = ConfigMacros.size(); I != N; ++I) { if (I) OS << ", "; OS << ConfigMacros[I]; } OS << "\n"; } for (unsigned I = 0, N = NormalHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "header \""; OS.write_escaped(NormalHeaders[I]->getName()); OS << "\"\n"; } for (unsigned I = 0, N = ExcludedHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "exclude header \""; OS.write_escaped(ExcludedHeaders[I]->getName()); OS << "\"\n"; } for (unsigned I = 0, N = PrivateHeaders.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "private header \""; OS.write_escaped(PrivateHeaders[I]->getName()); OS << "\"\n"; } for (submodule_const_iterator MI = submodule_begin(), MIEnd = submodule_end(); MI != MIEnd; ++MI) (*MI)->print(OS, Indent + 2); for (unsigned I = 0, N = Exports.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "export "; if (Module *Restriction = Exports[I].getPointer()) { OS << Restriction->getFullModuleName(); if (Exports[I].getInt()) OS << ".*"; } else { OS << "*"; } OS << "\n"; } for (unsigned I = 0, N = UnresolvedExports.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "export "; printModuleId(OS, UnresolvedExports[I].Id); if (UnresolvedExports[I].Wildcard) { if (UnresolvedExports[I].Id.empty()) OS << "*"; else OS << ".*"; } OS << "\n"; } for (unsigned I = 0, N = DirectUses.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "use "; OS << DirectUses[I]->getFullModuleName(); OS << "\n"; } for (unsigned I = 0, N = UnresolvedDirectUses.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "use "; printModuleId(OS, UnresolvedDirectUses[I]); OS << "\n"; } for (unsigned I = 0, N = LinkLibraries.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "link "; if (LinkLibraries[I].IsFramework) OS << "framework "; OS << "\""; OS.write_escaped(LinkLibraries[I].Library); OS << "\""; } for (unsigned I = 0, N = UnresolvedConflicts.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "conflict "; printModuleId(OS, UnresolvedConflicts[I].Id); OS << ", \""; OS.write_escaped(UnresolvedConflicts[I].Message); OS << "\"\n"; } for (unsigned I = 0, N = Conflicts.size(); I != N; ++I) { OS.indent(Indent + 2); OS << "conflict "; OS << Conflicts[I].Other->getFullModuleName(); OS << ", \""; OS.write_escaped(Conflicts[I].Message); OS << "\"\n"; } if (InferSubmodules) { OS.indent(Indent + 2); if (InferExplicitSubmodules) OS << "explicit "; OS << "module * {\n"; if (InferExportWildcard) { OS.indent(Indent + 4); OS << "export *\n"; } OS.indent(Indent + 2); OS << "}\n"; } OS.indent(Indent); OS << "}\n"; } void Module::dump() const { print(llvm::errs()); } @