//===--- Module.cpp - Swift Language Module Implementation ----------------===// // // This source file is part of the Swift.org open source project // // Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors // Licensed under Apache License v2.0 with Runtime Library Exception // // See http://swift.org/LICENSE.txt for license information // See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors // //===----------------------------------------------------------------------===// // // This file implements the Module class and subclasses. // //===----------------------------------------------------------------------===// #include "swift/AST/Diagnostics.h" #include "swift/AST/Module.h" #include "swift/AST/ModuleLoader.h" #include "swift/AST/NameLookup.h" #include "swift/AST/AST.h" #include "swift/AST/PrintOptions.h" #include "clang/Basic/Module.h" #include "llvm/ADT/DenseMap.h" #include "llvm/ADT/DenseSet.h" #include "llvm/ADT/TinyPtrVector.h" #include "llvm/ADT/SmallPtrSet.h" #include "llvm/Support/raw_ostream.h" using namespace swift; //===----------------------------------------------------------------------===// // Builtin Module Name lookup //===----------------------------------------------------------------------===// namespace { /// BuiltinModuleCache - This is the type of the cache for the BuiltinModule. /// This is lazily created on its first use an hangs off /// Module::LookupCachePimpl. class BuiltinModuleCache { /// The cache of identifiers we've already looked up. We use a /// single hashtable for both types and values as a minor /// optimization; this prevents us from having both a builtin type /// and a builtin value with the same name, but that's okay. llvm::DenseMap Cache; public: void lookupValue(Identifier Name, NLKind LookupKind, BuiltinModule &M, SmallVectorImpl &Result); }; } // end anonymous namespace. static BuiltinModuleCache &getBuiltinCachePimpl(void *&Ptr) { // FIXME: This leaks. Sticking this into ASTContext isn't enough because then // the DenseMap will leak. if (Ptr == 0) Ptr = new BuiltinModuleCache(); return *(BuiltinModuleCache*)Ptr; } void BuiltinModuleCache::lookupValue(Identifier Name, NLKind LookupKind, BuiltinModule &M, SmallVectorImpl &Result) { // Only qualified lookup ever finds anything in the builtin module. if (LookupKind != NLKind::QualifiedLookup) return; ValueDecl *&Entry = Cache[Name]; if (Entry == 0) if (Type Ty = getBuiltinType(M.Ctx, Name.str())) Entry = new (M.Ctx) TypeAliasDecl(SourceLoc(), Name, SourceLoc(), TypeLoc::withoutLoc(Ty), M.Ctx.TheBuiltinModule, MutableArrayRef()); if (Entry == 0) Entry = getBuiltinValue(M.Ctx, Name); if (Entry) Result.push_back(Entry); } //===----------------------------------------------------------------------===// // Normal Module Name Lookup //===----------------------------------------------------------------------===// namespace { /// TUModuleCache - This is the type of the cache for the TranslationUnit. /// This is lazily created on its first use an hangs off /// Module::LookupCachePimpl. class TUModuleCache { llvm::DenseMap> TopLevelValues; void doPopulateCache(ArrayRef decls, bool onlyOperators); public: typedef Module::AccessPathTy AccessPathTy; TUModuleCache(const TranslationUnit &TU); void lookupValue(AccessPathTy AccessPath, Identifier Name, NLKind LookupKind, TranslationUnit &TU, SmallVectorImpl &Result); void lookupVisibleDecls(AccessPathTy AccessPath, VisibleDeclConsumer &Consumer, NLKind LookupKind, const TranslationUnit &TU); }; } // end anonymous namespace. static TUModuleCache &getTUCachePimpl(void *&Ptr, const TranslationUnit &TU) { // FIXME: This leaks. Sticking this into ASTContext isn't enough because then // the DenseMap will leak. if (Ptr == 0) Ptr = new TUModuleCache(TU); return *(TUModuleCache*)Ptr; } static void freeTUCachePimpl(void *&Ptr) { delete (TUModuleCache*)Ptr; Ptr = 0; } void TUModuleCache::doPopulateCache(ArrayRef decls, bool onlyOperators) { for (Decl *D : decls) { if (ValueDecl *VD = dyn_cast(D)) if (onlyOperators ? VD->getName().isOperator() : !VD->getName().empty()) TopLevelValues[VD->getName()].push_back(VD); if (NominalTypeDecl *NTD = dyn_cast(D)) doPopulateCache(NTD->getMembers(), true); if (ExtensionDecl *ED = dyn_cast(D)) doPopulateCache(ED->getMembers(), true); } } /// Populate our cache on the first name lookup. TUModuleCache::TUModuleCache(const TranslationUnit &TU) { doPopulateCache(TU.Decls, false); } void TUModuleCache::lookupValue(AccessPathTy AccessPath, Identifier Name, NLKind LookupKind, TranslationUnit &TU, SmallVectorImpl &Result) { assert(AccessPath.size() <= 1 && "can only refer to top-level decls"); // If this import is specific to some named type or decl ("import swift.int") // then filter out any lookups that don't match. if (AccessPath.size() == 1 && AccessPath.front().first != Name) return; auto I = TopLevelValues.find(Name); if (I == TopLevelValues.end()) return; Result.reserve(I->second.size()); for (ValueDecl *Elt : I->second) Result.push_back(Elt); } void TUModuleCache::lookupVisibleDecls(AccessPathTy AccessPath, VisibleDeclConsumer &Consumer, NLKind LookupKind, const TranslationUnit &TU) { assert(AccessPath.size() <= 1 && "can only refer to top-level decls"); if (!AccessPath.empty()) { auto I = TopLevelValues.find(AccessPath.front().first); if (I == TopLevelValues.end()) return; for (auto vd : I->second) Consumer.foundDecl(vd); return; } for (auto &tlv : TopLevelValues) { for (ValueDecl *vd : tlv.second) Consumer.foundDecl(vd); } } //===----------------------------------------------------------------------===// // Module Implementation //===----------------------------------------------------------------------===// /// lookupValue - Look up a (possibly overloaded) value set at top-level scope /// (but with the specified access path, which may come from an import decl) /// within the current module. This does a simple local lookup, not /// recursively looking through imports. void Module::lookupValue(AccessPathTy AccessPath, Identifier Name, NLKind LookupKind, SmallVectorImpl &Result) { if (BuiltinModule *BM = dyn_cast(this)) { assert(AccessPath.empty() && "builtin module's access path always empty!"); return getBuiltinCachePimpl(LookupCachePimpl) .lookupValue(Name, LookupKind, *BM, Result); } if (auto TU = dyn_cast(this)) { // Look in the translation unit. return getTUCachePimpl(LookupCachePimpl, *TU) .lookupValue(AccessPath, Name, LookupKind, *TU, Result); } return cast(this)->lookupValue(AccessPath, Name, LookupKind, Result); } /// lookupVisibleDecls - Find ValueDecls in the module and pass them to the /// given consumer object. void Module::lookupVisibleDecls(AccessPathTy AccessPath, VisibleDeclConsumer &Consumer, NLKind LookupKind) const { if (auto BM = dyn_cast(this)) { // TODO Look through the Builtin module. (void)BM; return; } if (auto TU = dyn_cast(this)) { return getTUCachePimpl(LookupCachePimpl, *TU) .lookupVisibleDecls(AccessPath, Consumer, LookupKind, *TU); } // TODO: Visit clang modules using Clang's Sema::LookupVisibleDecls. // Importing every single Clang decl as a Swift decl currently makes // everything horrendously slow. return cast(this)->lookupVisibleDecls(AccessPath, Consumer, LookupKind); } namespace { // Returns Nothing on error, Optional(nullptr) if no operator decl found, or // Optional(decl) if decl was found. template Optional lookupOperatorDeclForName(Module *M, SourceLoc Loc, Identifier Name, llvm::StringMap TranslationUnit::*OP_MAP) { if (auto loadedModule = dyn_cast(M)) return loadedModule->lookupOperator(Name); auto *TU = dyn_cast(M); if (!TU) return nullptr; // Look for an operator declaration in the current module. auto found = (TU->*OP_MAP).find(Name.get()); if (found != (TU->*OP_MAP).end()) return found->getValue(); // Look for imported operator decls. llvm::DenseSet importedOperators; for (auto &imported : TU->getImportedModules()) { Optional maybeOp = lookupOperatorDeclForName(imported.second, Loc, Name, OP_MAP); if (!maybeOp) return Nothing; if (OP_DECL *op = *maybeOp) importedOperators.insert(op); } // If we found a single import, use it. if (importedOperators.empty()) { // Cache the mapping so we don't need to troll imports next time. (TU->*OP_MAP)[Name.get()] = nullptr; return nullptr; } if (importedOperators.size() == 1) { // Cache the mapping so we don't need to troll imports next time. OP_DECL *result = *importedOperators.begin(); (TU->*OP_MAP)[Name.get()] = result; return result; } // Otherwise, check for conflicts. auto i = importedOperators.begin(), end = importedOperators.end(); OP_DECL *first = *i; for (++i; i != end; ++i) { if ((*i)->conflictsWith(first)) { if (Loc.isValid()) { ASTContext &C = M->getASTContext(); C.Diags.diagnose(Loc, diag::ambiguous_operator_decls); C.Diags.diagnose(first->getLoc(), diag::found_this_operator_decl); C.Diags.diagnose((*i)->getLoc(), diag::found_this_operator_decl); } return Nothing; } } // Cache the mapping so we don't need to troll imports next time. (TU->*OP_MAP)[Name.get()] = first; return first; } } // end anonymous namespace Optional Module::lookupPrefixOperator(Identifier name, SourceLoc diagLoc) { return lookupOperatorDeclForName(this, diagLoc, name, &TranslationUnit::PrefixOperators); } Optional Module::lookupPostfixOperator(Identifier name, SourceLoc diagLoc) { return lookupOperatorDeclForName(this, diagLoc, name, &TranslationUnit::PostfixOperators); } Optional Module::lookupInfixOperator(Identifier name, SourceLoc diagLoc) { return lookupOperatorDeclForName(this, diagLoc, name, &TranslationUnit::InfixOperators); } void Module::getReexportedModules(SmallVectorImpl &modules) const { if (isa(this)) return; if (auto TU = dyn_cast(this)) { // A translation unit doesn't really re-export all of its imported modules, // but for the purposes of lookup a TU is always top-level, so we want to // look at regular imports as well as re-exports. modules.append(TU->getImportedModules().begin(), TU->getImportedModules().end()); return; } return cast(this)->getReexportedModules(modules); } //===----------------------------------------------------------------------===// // TranslationUnit Implementation //===----------------------------------------------------------------------===// void TranslationUnit::print(raw_ostream &os) { print(os, PrintOptions::printEverything()); } void TranslationUnit::print(raw_ostream &os, const PrintOptions &options) { for (auto decl : Decls) { if (!decl->shouldPrintInContext()) continue; decl->print(os, options); os << "\n"; } } void TranslationUnit::clearLookupCache() { freeTUCachePimpl(LookupCachePimpl); } //===----------------------------------------------------------------------===// // LoadedModule Implementation //===----------------------------------------------------------------------===// void LoadedModule::lookupValue(AccessPathTy accessPath, Identifier name, NLKind lookupKind, SmallVectorImpl &result) { return getOwner().lookupValue(this, accessPath, name, lookupKind, result); } OperatorDecl *LoadedModule::lookupOperator(Identifier name, DeclKind fixity) { return getOwner().lookupOperator(this, name, fixity); } template<> PrefixOperatorDecl * LoadedModule::lookupOperator(Identifier name) { auto result = lookupOperator(name, DeclKind::PrefixOperator); return cast_or_null(result); } template<> PostfixOperatorDecl * LoadedModule::lookupOperator(Identifier name) { auto result = lookupOperator(name, DeclKind::PostfixOperator); return cast_or_null(result); } template<> InfixOperatorDecl * LoadedModule::lookupOperator(Identifier name) { auto result = lookupOperator(name, DeclKind::InfixOperator); return cast_or_null(result); } void LoadedModule::getReexportedModules( SmallVectorImpl &exports) const { return getOwner().getReexportedModules(this, exports); } void LoadedModule::lookupVisibleDecls(AccessPathTy accessPath, VisibleDeclConsumer &consumer, NLKind lookupKind) const { return getOwner().lookupVisibleDecls(this, accessPath, consumer, lookupKind); } //===----------------------------------------------------------------------===// // ModuleLoader Implementation //===----------------------------------------------------------------------===// ModuleLoader::~ModuleLoader() {}