xref: /llvm-project/clang/lib/Basic/Module.cpp (revision dde17e74fa05c1c749c7ecb8ac88a3e30c953848) 
1 //===--- Module.cpp - Describe a module -----------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file defines the Module class, which describes a module in the source
11 // code.
12 //
13 //===----------------------------------------------------------------------===//
14 
15 #include "clang/Basic/Module.h"
16 #include "clang/Basic/FileManager.h"
17 #include "clang/Basic/LangOptions.h"
18 #include "clang/Basic/TargetInfo.h"
19 #include "llvm/ADT/ArrayRef.h"
20 #include "llvm/ADT/SmallVector.h"
21 #include "llvm/ADT/StringSwitch.h"
22 #include "llvm/Support/ErrorHandling.h"
23 #include "llvm/Support/raw_ostream.h"
24 
25 using namespace clang;
26 
27 Module::Module(StringRef Name, SourceLocation DefinitionLoc, Module *Parent,
28                bool IsFramework, bool IsExplicit)
29   : Name(Name), DefinitionLoc(DefinitionLoc), Parent(Parent),
30     Umbrella(), ASTFile(0), IsAvailable(true), IsFromModuleFile(false),
31     IsFramework(IsFramework), IsExplicit(IsExplicit), IsSystem(false),
32     InferSubmodules(false), InferExplicitSubmodules(false),
33     InferExportWildcard(false), ConfigMacrosExhaustive(false),
34     NameVisibility(Hidden)
35 {
36   if (Parent) {
37     if (!Parent->isAvailable())
38       IsAvailable = false;
39     if (Parent->IsSystem)
40       IsSystem = true;
41 
42     Parent->SubModuleIndex[Name] = Parent->SubModules.size();
43     Parent->SubModules.push_back(this);
44   }
45 }
46 
47 Module::~Module() {
48   for (submodule_iterator I = submodule_begin(), IEnd = submodule_end();
49        I != IEnd; ++I) {
50     delete *I;
51   }
52 }
53 
54 /// \brief Determine whether a translation unit built using the current
55 /// language options has the given feature.
56 static bool hasFeature(StringRef Feature, const LangOptions &LangOpts,
57                        const TargetInfo &Target) {
58   return llvm::StringSwitch<bool>(Feature)
59            .Case("altivec", LangOpts.AltiVec)
60            .Case("blocks", LangOpts.Blocks)
61            .Case("cplusplus", LangOpts.CPlusPlus)
62            .Case("cplusplus11", LangOpts.CPlusPlus11)
63            .Case("objc", LangOpts.ObjC1)
64            .Case("objc_arc", LangOpts.ObjCAutoRefCount)
65            .Case("opencl", LangOpts.OpenCL)
66            .Case("tls", Target.isTLSSupported())
67            .Default(Target.hasFeature(Feature));
68 }
69 
70 bool
71 Module::isAvailable(const LangOptions &LangOpts, const TargetInfo &Target,
72                     Requirement &Req) const {
73   if (IsAvailable)
74     return true;
75 
76   for (const Module *Current = this; Current; Current = Current->Parent) {
77     for (unsigned I = 0, N = Current->Requirements.size(); I != N; ++I) {
78       if (hasFeature(Current->Requirements[I].first, LangOpts, Target) !=
79               Current->Requirements[I].second) {
80         Req = Current->Requirements[I];
81         return false;
82       }
83     }
84   }
85 
86   llvm_unreachable("could not find a reason why module is unavailable");
87 }
88 
89 bool Module::isSubModuleOf(Module *Other) const {
90   const Module *This = this;
91   do {
92     if (This == Other)
93       return true;
94 
95     This = This->Parent;
96   } while (This);
97 
98   return false;
99 }
100 
101 const Module *Module::getTopLevelModule() const {
102   const Module *Result = this;
103   while (Result->Parent)
104     Result = Result->Parent;
105 
106   return Result;
107 }
108 
109 std::string Module::getFullModuleName() const {
110   SmallVector<StringRef, 2> Names;
111 
112   // Build up the set of module names (from innermost to outermost).
113   for (const Module *M = this; M; M = M->Parent)
114     Names.push_back(M->Name);
115 
116   std::string Result;
117   for (SmallVectorImpl<StringRef>::reverse_iterator I = Names.rbegin(),
118                                                  IEnd = Names.rend();
119        I != IEnd; ++I) {
120     if (!Result.empty())
121       Result += '.';
122 
123     Result += *I;
124   }
125 
126   return Result;
127 }
128 
129 const DirectoryEntry *Module::getUmbrellaDir() const {
130   if (const FileEntry *Header = getUmbrellaHeader())
131     return Header->getDir();
132 
133   return Umbrella.dyn_cast<const DirectoryEntry *>();
134 }
135 
136 ArrayRef<const FileEntry *> Module::getTopHeaders(FileManager &FileMgr) {
137   if (!TopHeaderNames.empty()) {
138     for (std::vector<std::string>::iterator
139            I = TopHeaderNames.begin(), E = TopHeaderNames.end(); I != E; ++I) {
140       if (const FileEntry *FE = FileMgr.getFile(*I))
141         TopHeaders.insert(FE);
142     }
143     TopHeaderNames.clear();
144   }
145 
146   return llvm::makeArrayRef(TopHeaders.begin(), TopHeaders.end());
147 }
148 
149 void Module::addRequirement(StringRef Feature, bool RequiredState,
150                             const LangOptions &LangOpts,
151                             const TargetInfo &Target) {
152   Requirements.push_back(Requirement(Feature, RequiredState));
153 
154   // If this feature is currently available, we're done.
155   if (hasFeature(Feature, LangOpts, Target) == RequiredState)
156     return;
157 
158   if (!IsAvailable)
159     return;
160 
161   SmallVector<Module *, 2> Stack;
162   Stack.push_back(this);
163   while (!Stack.empty()) {
164     Module *Current = Stack.back();
165     Stack.pop_back();
166 
167     if (!Current->IsAvailable)
168       continue;
169 
170     Current->IsAvailable = false;
171     for (submodule_iterator Sub = Current->submodule_begin(),
172                          SubEnd = Current->submodule_end();
173          Sub != SubEnd; ++Sub) {
174       if ((*Sub)->IsAvailable)
175         Stack.push_back(*Sub);
176     }
177   }
178 }
179 
180 Module *Module::findSubmodule(StringRef Name) const {
181   llvm::StringMap<unsigned>::const_iterator Pos = SubModuleIndex.find(Name);
182   if (Pos == SubModuleIndex.end())
183     return 0;
184 
185   return SubModules[Pos->getValue()];
186 }
187 
188 static void printModuleId(raw_ostream &OS, const ModuleId &Id) {
189   for (unsigned I = 0, N = Id.size(); I != N; ++I) {
190     if (I)
191       OS << ".";
192     OS << Id[I].first;
193   }
194 }
195 
196 void Module::getExportedModules(SmallVectorImpl<Module *> &Exported) const {
197   bool AnyWildcard = false;
198   bool UnrestrictedWildcard = false;
199   SmallVector<Module *, 4> WildcardRestrictions;
200   for (unsigned I = 0, N = Exports.size(); I != N; ++I) {
201     Module *Mod = Exports[I].getPointer();
202     if (!Exports[I].getInt()) {
203       // Export a named module directly; no wildcards involved.
204       Exported.push_back(Mod);
205 
206       continue;
207     }
208 
209     // Wildcard export: export all of the imported modules that match
210     // the given pattern.
211     AnyWildcard = true;
212     if (UnrestrictedWildcard)
213       continue;
214 
215     if (Module *Restriction = Exports[I].getPointer())
216       WildcardRestrictions.push_back(Restriction);
217     else {
218       WildcardRestrictions.clear();
219       UnrestrictedWildcard = true;
220     }
221   }
222 
223   // If there were any wildcards, push any imported modules that were
224   // re-exported by the wildcard restriction.
225   if (!AnyWildcard)
226     return;
227 
228   for (unsigned I = 0, N = Imports.size(); I != N; ++I) {
229     Module *Mod = Imports[I];
230     bool Acceptable = UnrestrictedWildcard;
231     if (!Acceptable) {
232       // Check whether this module meets one of the restrictions.
233       for (unsigned R = 0, NR = WildcardRestrictions.size(); R != NR; ++R) {
234         Module *Restriction = WildcardRestrictions[R];
235         if (Mod == Restriction || Mod->isSubModuleOf(Restriction)) {
236           Acceptable = true;
237           break;
238         }
239       }
240     }
241 
242     if (!Acceptable)
243       continue;
244 
245     Exported.push_back(Mod);
246   }
247 }
248 
249 void Module::buildVisibleModulesCache() const {
250   assert(VisibleModulesCache.empty() && "cache does not need building");
251 
252   // This module is visible to itself.
253   VisibleModulesCache.insert(this);
254 
255   // Every imported module is visible.
256   SmallVector<Module *, 16> Stack(Imports.begin(), Imports.end());
257   while (!Stack.empty()) {
258     Module *CurrModule = Stack.pop_back_val();
259 
260     // Every module transitively exported by an imported module is visible.
261     if (VisibleModulesCache.insert(CurrModule).second)
262       CurrModule->getExportedModules(Stack);
263   }
264 }
265 
266 void Module::print(raw_ostream &OS, unsigned Indent) const {
267   OS.indent(Indent);
268   if (IsFramework)
269     OS << "framework ";
270   if (IsExplicit)
271     OS << "explicit ";
272   OS << "module " << Name;
273 
274   if (IsSystem) {
275     OS.indent(Indent + 2);
276     OS << " [system]";
277   }
278 
279   OS << " {\n";
280 
281   if (!Requirements.empty()) {
282     OS.indent(Indent + 2);
283     OS << "requires ";
284     for (unsigned I = 0, N = Requirements.size(); I != N; ++I) {
285       if (I)
286         OS << ", ";
287       if (!Requirements[I].second)
288         OS << "!";
289       OS << Requirements[I].first;
290     }
291     OS << "\n";
292   }
293 
294   if (const FileEntry *UmbrellaHeader = getUmbrellaHeader()) {
295     OS.indent(Indent + 2);
296     OS << "umbrella header \"";
297     OS.write_escaped(UmbrellaHeader->getName());
298     OS << "\"\n";
299   } else if (const DirectoryEntry *UmbrellaDir = getUmbrellaDir()) {
300     OS.indent(Indent + 2);
301     OS << "umbrella \"";
302     OS.write_escaped(UmbrellaDir->getName());
303     OS << "\"\n";
304   }
305 
306   if (!ConfigMacros.empty() || ConfigMacrosExhaustive) {
307     OS.indent(Indent + 2);
308     OS << "config_macros ";
309     if (ConfigMacrosExhaustive)
310       OS << "[exhaustive]";
311     for (unsigned I = 0, N = ConfigMacros.size(); I != N; ++I) {
312       if (I)
313         OS << ", ";
314       OS << ConfigMacros[I];
315     }
316     OS << "\n";
317   }
318 
319   for (unsigned I = 0, N = NormalHeaders.size(); I != N; ++I) {
320     OS.indent(Indent + 2);
321     OS << "header \"";
322     OS.write_escaped(NormalHeaders[I]->getName());
323     OS << "\"\n";
324   }
325 
326   for (unsigned I = 0, N = ExcludedHeaders.size(); I != N; ++I) {
327     OS.indent(Indent + 2);
328     OS << "exclude header \"";
329     OS.write_escaped(ExcludedHeaders[I]->getName());
330     OS << "\"\n";
331   }
332 
333   for (unsigned I = 0, N = PrivateHeaders.size(); I != N; ++I) {
334     OS.indent(Indent + 2);
335     OS << "private header \"";
336     OS.write_escaped(PrivateHeaders[I]->getName());
337     OS << "\"\n";
338   }
339 
340   for (submodule_const_iterator MI = submodule_begin(), MIEnd = submodule_end();
341        MI != MIEnd; ++MI)
342     (*MI)->print(OS, Indent + 2);
343 
344   for (unsigned I = 0, N = Exports.size(); I != N; ++I) {
345     OS.indent(Indent + 2);
346     OS << "export ";
347     if (Module *Restriction = Exports[I].getPointer()) {
348       OS << Restriction->getFullModuleName();
349       if (Exports[I].getInt())
350         OS << ".*";
351     } else {
352       OS << "*";
353     }
354     OS << "\n";
355   }
356 
357   for (unsigned I = 0, N = UnresolvedExports.size(); I != N; ++I) {
358     OS.indent(Indent + 2);
359     OS << "export ";
360     printModuleId(OS, UnresolvedExports[I].Id);
361     if (UnresolvedExports[I].Wildcard) {
362       if (UnresolvedExports[I].Id.empty())
363         OS << "*";
364       else
365         OS << ".*";
366     }
367     OS << "\n";
368   }
369 
370   for (unsigned I = 0, N = DirectUses.size(); I != N; ++I) {
371     OS.indent(Indent + 2);
372     OS << "use ";
373     OS << DirectUses[I]->getFullModuleName();
374     OS << "\n";
375   }
376 
377   for (unsigned I = 0, N = UnresolvedDirectUses.size(); I != N; ++I) {
378     OS.indent(Indent + 2);
379     OS << "use ";
380     printModuleId(OS, UnresolvedDirectUses[I]);
381     OS << "\n";
382   }
383 
384   for (unsigned I = 0, N = LinkLibraries.size(); I != N; ++I) {
385     OS.indent(Indent + 2);
386     OS << "link ";
387     if (LinkLibraries[I].IsFramework)
388       OS << "framework ";
389     OS << "\"";
390     OS.write_escaped(LinkLibraries[I].Library);
391     OS << "\"";
392   }
393 
394   for (unsigned I = 0, N = UnresolvedConflicts.size(); I != N; ++I) {
395     OS.indent(Indent + 2);
396     OS << "conflict ";
397     printModuleId(OS, UnresolvedConflicts[I].Id);
398     OS << ", \"";
399     OS.write_escaped(UnresolvedConflicts[I].Message);
400     OS << "\"\n";
401   }
402 
403   for (unsigned I = 0, N = Conflicts.size(); I != N; ++I) {
404     OS.indent(Indent + 2);
405     OS << "conflict ";
406     OS << Conflicts[I].Other->getFullModuleName();
407     OS << ", \"";
408     OS.write_escaped(Conflicts[I].Message);
409     OS << "\"\n";
410   }
411 
412   if (InferSubmodules) {
413     OS.indent(Indent + 2);
414     if (InferExplicitSubmodules)
415       OS << "explicit ";
416     OS << "module * {\n";
417     if (InferExportWildcard) {
418       OS.indent(Indent + 4);
419       OS << "export *\n";
420     }
421     OS.indent(Indent + 2);
422     OS << "}\n";
423   }
424 
425   OS.indent(Indent);
426   OS << "}\n";
427 }
428 
429 void Module::dump() const {
430   print(llvm::errs());
431 }
432 
433 
434