1 //! The core of the module-level name resolution algorithm.
3 //! `DefCollector::collect` contains the fixed-point iteration loop which
4 //! resolves imports and expands macros.
8 use base_db::{CrateId, Edition, FileId, ProcMacroId};
9 use cfg::{CfgExpr, CfgOptions};
11 ast_id_map::FileAstId,
12 builtin_attr_macro::find_builtin_attr,
13 builtin_derive_macro::find_builtin_derive,
14 builtin_fn_macro::find_builtin_macro,
15 name::{name, AsName, Name},
16 proc_macro::ProcMacroExpander,
17 ExpandTo, HirFileId, MacroCallId, MacroCallKind, MacroDefId, MacroDefKind,
19 use hir_expand::{InFile, MacroCallLoc};
20 use itertools::Itertools;
23 use rustc_hash::{FxHashMap, FxHashSet};
27 attr::{Attr, AttrId, AttrInput, Attrs},
28 attr_macro_as_call_id,
30 derive_macro_as_call_id,
32 item_scope::{ImportType, PerNsGlobImports},
34 self, Fields, FileItemTreeId, ImportKind, ItemTree, ItemTreeId, ItemTreeNode, MacroCall,
35 MacroDef, MacroRules, Mod, ModItem, ModKind, TreeId,
37 macro_call_as_call_id,
39 diagnostics::DefDiagnostic,
40 mod_resolution::ModDir,
41 path_resolution::ReachedFixedPoint,
42 proc_macro::{ProcMacroDef, ProcMacroKind},
43 BuiltinShadowMode, DefMap, ModuleData, ModuleOrigin, ResolveMode,
45 path::{ImportAlias, ModPath, PathKind},
47 visibility::{RawVisibility, Visibility},
48 AdtId, AstId, AstIdWithPath, ConstLoc, EnumLoc, EnumVariantId, ExternBlockLoc, FunctionLoc,
49 ImplLoc, Intern, ItemContainerId, LocalModuleId, ModuleDefId, StaticLoc, StructLoc, TraitLoc,
50 TypeAliasLoc, UnionLoc, UnresolvedMacro,
53 static GLOB_RECURSION_LIMIT: Limit = Limit::new(100);
54 static EXPANSION_DEPTH_LIMIT: Limit = Limit::new(128);
55 static FIXED_POINT_LIMIT: Limit = Limit::new(8192);
57 pub(super) fn collect_defs(db: &dyn DefDatabase, mut def_map: DefMap, tree_id: TreeId) -> DefMap {
58 let crate_graph = db.crate_graph();
60 let mut deps = FxHashMap::default();
61 // populate external prelude and dependency list
62 for dep in &crate_graph[def_map.krate].dependencies {
63 tracing::debug!("crate dep {:?} -> {:?}", dep.name, dep.crate_id);
64 let dep_def_map = db.crate_def_map(dep.crate_id);
65 let dep_root = dep_def_map.module_id(dep_def_map.root);
67 deps.insert(dep.as_name(), dep_root.into());
69 if dep.is_prelude() && !tree_id.is_block() {
70 def_map.extern_prelude.insert(dep.as_name(), dep_root.into());
74 let cfg_options = &crate_graph[def_map.krate].cfg_options;
75 let proc_macros = &crate_graph[def_map.krate].proc_macro;
76 let proc_macros = proc_macros
80 // FIXME: a hacky way to create a Name from string.
81 let name = tt::Ident { text: it.name.clone(), id: tt::TokenId::unspecified() };
82 (name.as_name(), ProcMacroExpander::new(def_map.krate, ProcMacroId(idx as u32)))
86 let mut collector = DefCollector {
90 glob_imports: FxHashMap::default(),
91 unresolved_imports: Vec::new(),
92 resolved_imports: Vec::new(),
93 unresolved_macros: Vec::new(),
94 mod_dirs: FxHashMap::default(),
97 exports_proc_macros: false,
98 from_glob_import: Default::default(),
99 skip_attrs: Default::default(),
100 derive_helpers_in_scope: Default::default(),
102 if tree_id.is_block() {
103 collector.seed_with_inner(tree_id);
105 collector.seed_with_top_level();
108 let mut def_map = collector.finish();
109 def_map.shrink_to_fit();
113 #[derive(Copy, Clone, Debug, Eq, PartialEq)]
114 enum PartialResolvedImport {
115 /// None of any namespaces is resolved
117 /// One of namespaces is resolved
118 Indeterminate(PerNs),
119 /// All namespaces are resolved, OR it comes from other crate
123 impl PartialResolvedImport {
124 fn namespaces(self) -> PerNs {
126 PartialResolvedImport::Unresolved => PerNs::none(),
127 PartialResolvedImport::Indeterminate(ns) | PartialResolvedImport::Resolved(ns) => ns,
132 #[derive(Clone, Debug, Eq, PartialEq)]
134 Import { id: ItemTreeId<item_tree::Import>, use_tree: Idx<ast::UseTree> },
135 ExternCrate(ItemTreeId<item_tree::ExternCrate>),
138 #[derive(Clone, Debug, Eq, PartialEq)]
140 path: Interned<ModPath>,
141 alias: Option<ImportAlias>,
142 visibility: RawVisibility,
145 is_extern_crate: bool,
147 source: ImportSource,
152 db: &dyn DefDatabase,
155 id: ItemTreeId<item_tree::Import>,
157 let it = &tree[id.value];
158 let attrs = &tree.attrs(db, krate, ModItem::from(id.value).into());
159 let visibility = &tree[it.visibility];
160 let is_prelude = attrs.by_key("prelude_import").exists();
162 let mut res = Vec::new();
163 it.use_tree.expand(|idx, path, kind, alias| {
165 path: Interned::new(path), // FIXME this makes little sense
167 visibility: visibility.clone(),
170 is_extern_crate: false,
172 source: ImportSource::Import { id, use_tree: idx },
178 fn from_extern_crate(
179 db: &dyn DefDatabase,
182 id: ItemTreeId<item_tree::ExternCrate>,
184 let it = &tree[id.value];
185 let attrs = &tree.attrs(db, krate, ModItem::from(id.value).into());
186 let visibility = &tree[it.visibility];
188 path: Interned::new(ModPath::from_segments(
190 iter::once(it.name.clone()),
192 alias: it.alias.clone(),
193 visibility: visibility.clone(),
194 kind: ImportKind::Plain,
196 is_extern_crate: true,
197 is_macro_use: attrs.by_key("macro_use").exists(),
198 source: ImportSource::ExternCrate(id),
203 #[derive(Clone, Debug, Eq, PartialEq)]
204 struct ImportDirective {
205 module_id: LocalModuleId,
207 status: PartialResolvedImport,
210 #[derive(Clone, Debug, Eq, PartialEq)]
211 struct MacroDirective {
212 module_id: LocalModuleId,
214 kind: MacroDirectiveKind,
215 container: ItemContainerId,
218 #[derive(Clone, Debug, Eq, PartialEq)]
219 enum MacroDirectiveKind {
220 FnLike { ast_id: AstIdWithPath<ast::MacroCall>, expand_to: ExpandTo },
221 Derive { ast_id: AstIdWithPath<ast::Adt>, derive_attr: AttrId, derive_pos: usize },
222 Attr { ast_id: AstIdWithPath<ast::Item>, attr: Attr, mod_item: ModItem, tree: TreeId },
225 /// Walks the tree of module recursively
226 struct DefCollector<'a> {
227 db: &'a dyn DefDatabase,
229 deps: FxHashMap<Name, ModuleDefId>,
230 glob_imports: FxHashMap<LocalModuleId, Vec<(LocalModuleId, Visibility)>>,
231 unresolved_imports: Vec<ImportDirective>,
232 resolved_imports: Vec<ImportDirective>,
233 unresolved_macros: Vec<MacroDirective>,
234 mod_dirs: FxHashMap<LocalModuleId, ModDir>,
235 cfg_options: &'a CfgOptions,
236 /// List of procedural macros defined by this crate. This is read from the dynamic library
237 /// built by the build system, and is the list of proc. macros we can actually expand. It is
238 /// empty when proc. macro support is disabled (in which case we still do name resolution for
240 proc_macros: Vec<(Name, ProcMacroExpander)>,
241 exports_proc_macros: bool,
242 from_glob_import: PerNsGlobImports,
243 /// If we fail to resolve an attribute on a `ModItem`, we fall back to ignoring the attribute.
244 /// This map is used to skip all attributes up to and including the one that failed to resolve,
245 /// in order to not expand them twice.
247 /// This also stores the attributes to skip when we resolve derive helpers and non-macro
248 /// non-builtin attributes in general.
249 skip_attrs: FxHashMap<InFile<ModItem>, AttrId>,
250 /// Tracks which custom derives are in scope for an item, to allow resolution of derive helper
252 derive_helpers_in_scope: FxHashMap<AstId<ast::Item>, Vec<Name>>,
255 impl DefCollector<'_> {
256 fn seed_with_top_level(&mut self) {
257 let _p = profile::span("seed_with_top_level");
259 let file_id = self.db.crate_graph()[self.def_map.krate].root_file_id;
260 let item_tree = self.db.file_item_tree(file_id.into());
261 let module_id = self.def_map.root;
263 let attrs = item_tree.top_level_attrs(self.db, self.def_map.krate);
264 if attrs.cfg().map_or(true, |cfg| self.cfg_options.check(&cfg) != Some(false)) {
265 self.inject_prelude(&attrs);
267 // Process other crate-level attributes.
268 for attr in &*attrs {
269 let attr_name = match attr.path.as_ident() {
274 if *attr_name == hir_expand::name![recursion_limit] {
275 if let Some(input) = &attr.input {
276 if let AttrInput::Literal(limit) = &**input {
277 if let Ok(limit) = limit.parse() {
278 self.def_map.recursion_limit = Some(limit);
285 let attr_is_register_like = *attr_name == hir_expand::name![register_attr]
286 || *attr_name == hir_expand::name![register_tool];
287 if !attr_is_register_like {
291 let registered_name = match attr.input.as_deref() {
292 Some(AttrInput::TokenTree(subtree, _)) => match &*subtree.token_trees {
293 [tt::TokenTree::Leaf(tt::Leaf::Ident(name))] => name.as_name(),
299 if *attr_name == hir_expand::name![register_attr] {
300 self.def_map.registered_attrs.push(registered_name.to_smol_str());
301 cov_mark::hit!(register_attr);
303 self.def_map.registered_tools.push(registered_name.to_smol_str());
304 cov_mark::hit!(register_tool);
312 tree_id: TreeId::new(file_id.into(), None),
313 item_tree: &item_tree,
314 mod_dir: ModDir::root(),
316 .collect_in_top_module(item_tree.top_level_items());
320 fn seed_with_inner(&mut self, tree_id: TreeId) {
321 let item_tree = tree_id.item_tree(self.db);
322 let module_id = self.def_map.root;
324 let is_cfg_enabled = item_tree
325 .top_level_attrs(self.db, self.def_map.krate)
327 .map_or(true, |cfg| self.cfg_options.check(&cfg) != Some(false));
334 item_tree: &item_tree,
335 mod_dir: ModDir::root(),
337 .collect_in_top_module(item_tree.top_level_items());
341 fn resolution_loop(&mut self) {
342 let _p = profile::span("DefCollector::resolution_loop");
344 // main name resolution fixed-point loop.
348 self.db.unwind_if_cancelled();
350 let _p = profile::span("resolve_imports loop");
352 if self.resolve_imports() == ReachedFixedPoint::Yes {
357 if self.resolve_macros() == ReachedFixedPoint::Yes {
362 if FIXED_POINT_LIMIT.check(i).is_err() {
363 tracing::error!("name resolution is stuck");
368 if self.reseed_with_unresolved_attribute() == ReachedFixedPoint::Yes {
374 fn collect(&mut self) {
375 let _p = profile::span("DefCollector::collect");
377 self.resolution_loop();
379 // Resolve all indeterminate resolved imports again
380 // As some of the macros will expand newly import shadowing partial resolved imports
381 // FIXME: We maybe could skip this, if we handle the indeterminate imports in `resolve_imports`
383 let partial_resolved = self.resolved_imports.iter().filter_map(|directive| {
384 if let PartialResolvedImport::Indeterminate(_) = directive.status {
385 let mut directive = directive.clone();
386 directive.status = PartialResolvedImport::Unresolved;
392 self.unresolved_imports.extend(partial_resolved);
393 self.resolve_imports();
395 let unresolved_imports = std::mem::take(&mut self.unresolved_imports);
396 // show unresolved imports in completion, etc
397 for directive in &unresolved_imports {
398 self.record_resolved_import(directive)
400 self.unresolved_imports = unresolved_imports;
402 // FIXME: This condition should instead check if this is a `proc-macro` type crate.
403 if self.exports_proc_macros {
404 // A crate exporting procedural macros is not allowed to export anything else.
406 // Additionally, while the proc macro entry points must be `pub`, they are not publicly
407 // exported in type/value namespace. This function reduces the visibility of all items
408 // in the crate root that aren't proc macros.
409 let root = self.def_map.root;
410 let module_id = self.def_map.module_id(root);
411 let root = &mut self.def_map.modules[root];
412 root.scope.censor_non_proc_macros(module_id);
416 /// When the fixed-point loop reaches a stable state, we might still have some unresolved
417 /// attributes (or unexpanded attribute proc macros) left over. This takes one of them, and
418 /// feeds the item it's applied to back into name resolution.
420 /// This effectively ignores the fact that the macro is there and just treats the items as
423 /// This improves UX when proc macros are turned off or don't work, and replicates the behavior
424 /// before we supported proc. attribute macros.
425 fn reseed_with_unresolved_attribute(&mut self) -> ReachedFixedPoint {
426 cov_mark::hit!(unresolved_attribute_fallback);
428 let mut unresolved_macros = std::mem::take(&mut self.unresolved_macros);
429 let pos = unresolved_macros.iter().position(|directive| {
430 if let MacroDirectiveKind::Attr { ast_id, mod_item, attr, tree } = &directive.kind {
431 self.skip_attrs.insert(ast_id.ast_id.with_value(*mod_item), attr.id);
433 let item_tree = tree.item_tree(self.db);
434 let mod_dir = self.mod_dirs[&directive.module_id].clone();
437 macro_depth: directive.depth,
438 module_id: directive.module_id,
440 item_tree: &item_tree,
443 .collect(&[*mod_item], directive.container);
450 if let Some(pos) = pos {
451 unresolved_macros.remove(pos);
454 // The collection above might add new unresolved macros (eg. derives), so merge the lists.
455 self.unresolved_macros.extend(unresolved_macros);
458 // Continue name resolution with the new data.
459 ReachedFixedPoint::No
461 ReachedFixedPoint::Yes
465 fn inject_prelude(&mut self, crate_attrs: &Attrs) {
466 // See compiler/rustc_builtin_macros/src/standard_library_imports.rs
468 if crate_attrs.by_key("no_core").exists() {
469 // libcore does not get a prelude.
473 let krate = if crate_attrs.by_key("no_std").exists() {
476 let std = name![std];
477 if self.def_map.extern_prelude().any(|(name, _)| *name == std) {
480 // If `std` does not exist for some reason, fall back to core. This mostly helps
481 // keep r-a's own tests minimal.
486 let edition = match self.def_map.edition {
487 Edition::Edition2015 => name![rust_2015],
488 Edition::Edition2018 => name![rust_2018],
489 Edition::Edition2021 => name![rust_2021],
492 let path_kind = if self.def_map.edition == Edition::Edition2015 {
497 let path = ModPath::from_segments(
499 [krate.clone(), name![prelude], edition].into_iter(),
501 // Fall back to the older `std::prelude::v1` for compatibility with Rust <1.52.0
502 // FIXME remove this fallback
504 ModPath::from_segments(path_kind, [krate, name![prelude], name![v1]].into_iter());
506 for path in &[path, fallback_path] {
507 let (per_ns, _) = self.def_map.resolve_path(
511 BuiltinShadowMode::Other,
515 Some((ModuleDefId::ModuleId(m), _)) => {
516 self.def_map.prelude = Some(m);
521 "could not resolve prelude path `{}` to module (resolved to {:?})",
530 /// Adds a definition of procedural macro `name` to the root module.
532 /// # Notes on procedural macro resolution
534 /// Procedural macro functionality is provided by the build system: It has to build the proc
535 /// macro and pass the resulting dynamic library to rust-analyzer.
537 /// When procedural macro support is enabled, the list of proc macros exported by a crate is
538 /// known before we resolve names in the crate. This list is stored in `self.proc_macros` and is
539 /// derived from the dynamic library.
541 /// However, we *also* would like to be able to at least *resolve* macros on our own, without
542 /// help by the build system. So, when the macro isn't found in `self.proc_macros`, we instead
543 /// use a dummy expander that always errors. This comes with the drawback of macros potentially
544 /// going out of sync with what the build system sees (since we resolve using VFS state, but
545 /// Cargo builds only on-disk files). We could and probably should add diagnostics for that.
546 fn export_proc_macro(&mut self, def: ProcMacroDef, ast_id: AstId<ast::Fn>) {
547 let kind = def.kind.to_basedb_kind();
548 self.exports_proc_macros = true;
549 let macro_def = match self.proc_macros.iter().find(|(n, _)| n == &def.name) {
550 Some(&(_, expander)) => MacroDefId {
551 krate: self.def_map.krate,
552 kind: MacroDefKind::ProcMacro(expander, kind, ast_id),
556 krate: self.def_map.krate,
557 kind: MacroDefKind::ProcMacro(
558 ProcMacroExpander::dummy(self.def_map.krate),
566 self.define_proc_macro(def.name.clone(), macro_def);
567 self.def_map.exported_proc_macros.insert(macro_def, def);
570 /// Define a macro with `macro_rules`.
572 /// It will define the macro in legacy textual scope, and if it has `#[macro_export]`,
573 /// then it is also defined in the root module scope.
574 /// You can `use` or invoke it by `crate::macro_name` anywhere, before or after the definition.
576 /// It is surprising that the macro will never be in the current module scope.
577 /// These code fails with "unresolved import/macro",
578 /// ```rust,compile_fail
579 /// mod m { macro_rules! foo { () => {} } }
580 /// use m::foo as bar;
583 /// ```rust,compile_fail
584 /// macro_rules! foo { () => {} }
589 /// Well, this code compiles, because the plain path `foo` in `use` is searched
590 /// in the legacy textual scope only.
592 /// macro_rules! foo { () => {} }
595 fn define_macro_rules(
597 module_id: LocalModuleId,
603 self.define_legacy_macro(module_id, name.clone(), macro_);
604 self.def_map.modules[module_id].scope.declare_macro(macro_);
607 // In Rust, `#[macro_export]` macros are unconditionally visible at the
608 // crate root, even if the parent modules is **not** visible.
612 &[(Some(name), PerNs::macros(macro_, Visibility::Public))],
619 /// Define a legacy textual scoped macro in module
621 /// We use a map `legacy_macros` to store all legacy textual scoped macros visible per module.
622 /// It will clone all macros from parent legacy scope, whose definition is prior to
623 /// the definition of current module.
624 /// And also, `macro_use` on a module will import all legacy macros visible inside to
625 /// current legacy scope, with possible shadowing.
626 fn define_legacy_macro(&mut self, module_id: LocalModuleId, name: Name, mac: MacroDefId) {
628 self.def_map.modules[module_id].scope.define_legacy_macro(name, mac);
631 /// Define a macro 2.0 macro
633 /// The scoped of macro 2.0 macro is equal to normal function
636 module_id: LocalModuleId,
642 self.def_map.resolve_visibility(self.db, module_id, vis).unwrap_or(Visibility::Public);
643 self.def_map.modules[module_id].scope.declare_macro(macro_);
644 self.update(module_id, &[(Some(name), PerNs::macros(macro_, vis))], vis, ImportType::Named);
647 /// Define a proc macro
649 /// A proc macro is similar to normal macro scope, but it would not visible in legacy textual scoped.
650 /// And unconditionally exported.
651 fn define_proc_macro(&mut self, name: Name, macro_: MacroDefId) {
652 self.def_map.modules[self.def_map.root].scope.declare_macro(macro_);
655 &[(Some(name), PerNs::macros(macro_, Visibility::Public))],
661 /// Import macros from `#[macro_use] extern crate`.
662 fn import_macros_from_extern_crate(
664 current_module_id: LocalModuleId,
665 extern_crate: &item_tree::ExternCrate,
668 "importing macros from extern crate: {:?} ({:?})",
670 self.def_map.edition,
673 let res = self.resolve_extern_crate(&extern_crate.name);
675 if let Some(ModuleDefId::ModuleId(m)) = res.take_types() {
676 if m == self.def_map.module_id(current_module_id) {
677 cov_mark::hit!(ignore_macro_use_extern_crate_self);
681 cov_mark::hit!(macro_rules_from_other_crates_are_visible_with_macro_use);
682 self.import_all_macros_exported(current_module_id, m.krate);
686 /// Import all exported macros from another crate
688 /// Exported macros are just all macros in the root module scope.
689 /// Note that it contains not only all `#[macro_export]` macros, but also all aliases
690 /// created by `use` in the root module, ignoring the visibility of `use`.
691 fn import_all_macros_exported(&mut self, current_module_id: LocalModuleId, krate: CrateId) {
692 let def_map = self.db.crate_def_map(krate);
693 for (name, def) in def_map[def_map.root].scope.macros() {
694 // `macro_use` only bring things into legacy scope.
695 self.define_legacy_macro(current_module_id, name.clone(), def);
699 /// Tries to resolve every currently unresolved import.
700 fn resolve_imports(&mut self) -> ReachedFixedPoint {
701 let mut res = ReachedFixedPoint::Yes;
702 let imports = std::mem::take(&mut self.unresolved_imports);
703 let imports = imports
705 .filter_map(|mut directive| {
706 directive.status = self.resolve_import(directive.module_id, &directive.import);
707 match directive.status {
708 PartialResolvedImport::Indeterminate(_) => {
709 self.record_resolved_import(&directive);
710 // FIXME: For avoid performance regression,
711 // we consider an imported resolved if it is indeterminate (i.e not all namespace resolved)
712 self.resolved_imports.push(directive);
713 res = ReachedFixedPoint::No;
716 PartialResolvedImport::Resolved(_) => {
717 self.record_resolved_import(&directive);
718 self.resolved_imports.push(directive);
719 res = ReachedFixedPoint::No;
722 PartialResolvedImport::Unresolved => Some(directive),
726 self.unresolved_imports = imports;
730 fn resolve_import(&self, module_id: LocalModuleId, import: &Import) -> PartialResolvedImport {
731 let _p = profile::span("resolve_import").detail(|| format!("{}", import.path));
732 tracing::debug!("resolving import: {:?} ({:?})", import, self.def_map.edition);
733 if import.is_extern_crate {
737 .expect("extern crate should have been desugared to one-element path");
739 let res = self.resolve_extern_crate(name);
742 PartialResolvedImport::Unresolved
744 PartialResolvedImport::Resolved(res)
747 let res = self.def_map.resolve_path_fp_with_macro(
752 BuiltinShadowMode::Module,
755 let def = res.resolved_def;
756 if res.reached_fixedpoint == ReachedFixedPoint::No || def.is_none() {
757 return PartialResolvedImport::Unresolved;
760 if let Some(krate) = res.krate {
761 if krate != self.def_map.krate {
762 return PartialResolvedImport::Resolved(
763 def.filter_visibility(|v| matches!(v, Visibility::Public)),
768 // Check whether all namespace is resolved
769 if def.take_types().is_some()
770 && def.take_values().is_some()
771 && def.take_macros().is_some()
773 PartialResolvedImport::Resolved(def)
775 PartialResolvedImport::Indeterminate(def)
780 fn resolve_extern_crate(&self, name: &Name) -> PerNs {
781 if *name == name!(self) {
782 cov_mark::hit!(extern_crate_self_as);
783 let root = match self.def_map.block {
785 let def_map = self.def_map.crate_root(self.db).def_map(self.db);
786 def_map.module_id(def_map.root())
788 None => self.def_map.module_id(self.def_map.root()),
790 PerNs::types(root.into(), Visibility::Public)
792 self.deps.get(name).map_or(PerNs::none(), |&it| PerNs::types(it, Visibility::Public))
796 fn record_resolved_import(&mut self, directive: &ImportDirective) {
797 let _p = profile::span("record_resolved_import");
799 let module_id = directive.module_id;
800 let import = &directive.import;
801 let mut def = directive.status.namespaces();
804 .resolve_visibility(self.db, module_id, &directive.import.visibility)
805 .unwrap_or(Visibility::Public);
808 ImportKind::Plain | ImportKind::TypeOnly => {
809 let name = match &import.alias {
810 Some(ImportAlias::Alias(name)) => Some(name),
811 Some(ImportAlias::Underscore) => None,
812 None => match import.path.segments().last() {
813 Some(last_segment) => Some(last_segment),
815 cov_mark::hit!(bogus_paths);
821 if import.kind == ImportKind::TypeOnly {
826 tracing::debug!("resolved import {:?} ({:?}) to {:?}", name, import, def);
828 // extern crates in the crate root are special-cased to insert entries into the extern prelude: rust-lang/rust#54658
829 if import.is_extern_crate && module_id == self.def_map.root {
830 if let (Some(def), Some(name)) = (def.take_types(), name) {
831 self.def_map.extern_prelude.insert(name.clone(), def);
835 self.update(module_id, &[(name.cloned(), def)], vis, ImportType::Named);
837 ImportKind::Glob => {
838 tracing::debug!("glob import: {:?}", import);
839 match def.take_types() {
840 Some(ModuleDefId::ModuleId(m)) => {
841 if import.is_prelude {
842 // Note: This dodgily overrides the injected prelude. The rustc
843 // implementation seems to work the same though.
844 cov_mark::hit!(std_prelude);
845 self.def_map.prelude = Some(m);
846 } else if m.krate != self.def_map.krate {
847 cov_mark::hit!(glob_across_crates);
848 // glob import from other crate => we can just import everything once
849 let item_map = m.def_map(self.db);
850 let scope = &item_map[m.local_id].scope;
852 // Module scoped macros is included
855 // only keep visible names...
857 (n, res.filter_visibility(|v| v.is_visible_from_other_crate()))
859 .filter(|(_, res)| !res.is_none())
860 .collect::<Vec<_>>();
862 self.update(module_id, &items, vis, ImportType::Glob);
864 // glob import from same crate => we do an initial
865 // import, and then need to propagate any further
868 let scope = if m.block == self.def_map.block_id() {
869 &self.def_map[m.local_id].scope
871 def_map = m.def_map(self.db);
872 &def_map[m.local_id].scope
875 // Module scoped macros is included
878 // only keep visible names...
882 res.filter_visibility(|v| {
883 v.is_visible_from_def_map(
891 .filter(|(_, res)| !res.is_none())
892 .collect::<Vec<_>>();
894 self.update(module_id, &items, vis, ImportType::Glob);
895 // record the glob import in case we add further items
896 let glob = self.glob_imports.entry(m.local_id).or_default();
897 if !glob.iter().any(|(mid, _)| *mid == module_id) {
898 glob.push((module_id, vis));
902 Some(ModuleDefId::AdtId(AdtId::EnumId(e))) => {
903 cov_mark::hit!(glob_enum);
904 // glob import from enum => just import all the variants
906 // XXX: urgh, so this works by accident! Here, we look at
907 // the enum data, and, in theory, this might require us to
908 // look back at the crate_def_map, creating a cycle. For
909 // example, `enum E { crate::some_macro!(); }`. Luckily, the
910 // only kind of macro that is allowed inside enum is a
911 // `cfg_macro`, and we don't need to run name resolution for
912 // it, but this is sheer luck!
913 let enum_data = self.db.enum_data(e);
914 let resolutions = enum_data
917 .map(|(local_id, variant_data)| {
918 let name = variant_data.name.clone();
919 let variant = EnumVariantId { parent: e, local_id };
920 let res = PerNs::both(variant.into(), variant.into(), vis);
923 .collect::<Vec<_>>();
924 self.update(module_id, &resolutions, vis, ImportType::Glob);
927 tracing::debug!("glob import {:?} from non-module/enum {:?}", import, d);
930 tracing::debug!("glob import {:?} didn't resolve as type", import);
939 module_id: LocalModuleId,
940 resolutions: &[(Option<Name>, PerNs)],
942 import_type: ImportType,
944 self.db.unwind_if_cancelled();
945 self.update_recursive(module_id, resolutions, vis, import_type, 0)
950 module_id: LocalModuleId,
951 resolutions: &[(Option<Name>, PerNs)],
952 // All resolutions are imported with this visibility; the visibilities in
953 // the `PerNs` values are ignored and overwritten
955 import_type: ImportType,
958 if GLOB_RECURSION_LIMIT.check(depth).is_err() {
959 // prevent stack overflows (but this shouldn't be possible)
960 panic!("infinite recursion in glob imports!");
962 let mut changed = false;
964 for (name, res) in resolutions {
967 let scope = &mut self.def_map.modules[module_id].scope;
968 changed |= scope.push_res_with_import(
969 &mut self.from_glob_import,
970 (module_id, name.clone()),
971 res.with_visibility(vis),
976 let tr = match res.take_types() {
977 Some(ModuleDefId::TraitId(tr)) => tr,
979 tracing::debug!("non-trait `_` import of {:?}", other);
984 let old_vis = self.def_map.modules[module_id].scope.unnamed_trait_vis(tr);
985 let should_update = match old_vis {
988 let max_vis = old_vis.max(vis, &self.def_map).unwrap_or_else(|| {
989 panic!("`Tr as _` imports with unrelated visibilities {:?} and {:?} (trait {:?})", old_vis, vis, tr);
992 if max_vis == old_vis {
995 cov_mark::hit!(upgrade_underscore_visibility);
1003 self.def_map.modules[module_id].scope.push_unnamed_trait(tr, vis);
1012 let glob_imports = self
1016 .flat_map(|v| v.iter())
1017 .filter(|(glob_importing_module, _)| {
1018 // we know all resolutions have the same visibility (`vis`), so we
1019 // just need to check that once
1020 vis.is_visible_from_def_map(self.db, &self.def_map, *glob_importing_module)
1023 .collect::<Vec<_>>();
1025 for (glob_importing_module, glob_import_vis) in glob_imports {
1026 self.update_recursive(
1027 glob_importing_module,
1036 fn resolve_macros(&mut self) -> ReachedFixedPoint {
1037 let mut macros = std::mem::take(&mut self.unresolved_macros);
1038 let mut resolved = Vec::new();
1039 let mut push_resolved = |directive: &MacroDirective, call_id| {
1040 resolved.push((directive.module_id, directive.depth, directive.container, call_id));
1042 let mut res = ReachedFixedPoint::Yes;
1043 macros.retain(|directive| {
1044 let resolver = |path| {
1045 let resolved_res = self.def_map.resolve_path_fp_with_macro(
1048 directive.module_id,
1050 BuiltinShadowMode::Module,
1052 resolved_res.resolved_def.take_macros()
1055 match &directive.kind {
1056 MacroDirectiveKind::FnLike { ast_id, expand_to } => {
1057 let call_id = macro_call_as_call_id(
1065 if let Ok(Ok(call_id)) = call_id {
1066 push_resolved(directive, call_id);
1067 res = ReachedFixedPoint::No;
1071 MacroDirectiveKind::Derive { ast_id, derive_attr, derive_pos } => {
1072 let call_id = derive_macro_as_call_id(
1080 if let Ok(call_id) = call_id {
1081 self.def_map.modules[directive.module_id].scope.set_derive_macro_invoc(
1088 push_resolved(directive, call_id);
1089 res = ReachedFixedPoint::No;
1093 MacroDirectiveKind::Attr { ast_id: file_ast_id, mod_item, attr, tree } => {
1094 let &AstIdWithPath { ast_id, ref path } = file_ast_id;
1095 let file_id = ast_id.file_id;
1097 let mut recollect_without = |collector: &mut Self| {
1098 // Remove the original directive since we resolved it.
1099 let mod_dir = collector.mod_dirs[&directive.module_id].clone();
1100 collector.skip_attrs.insert(InFile::new(file_id, *mod_item), attr.id);
1102 let item_tree = tree.item_tree(self.db);
1104 def_collector: collector,
1105 macro_depth: directive.depth,
1106 module_id: directive.module_id,
1108 item_tree: &item_tree,
1111 .collect(&[*mod_item], directive.container);
1112 res = ReachedFixedPoint::No;
1116 if let Some(ident) = path.as_ident() {
1117 if let Some(helpers) = self.derive_helpers_in_scope.get(&ast_id) {
1118 if helpers.contains(ident) {
1119 cov_mark::hit!(resolved_derive_helper);
1120 // Resolved to derive helper. Collect the item's attributes again,
1121 // starting after the derive helper.
1122 return recollect_without(self);
1127 let def = match resolver(path.clone()) {
1128 Some(def) if def.is_attribute() => def,
1133 MacroDefId { kind:MacroDefKind::BuiltInAttr(expander, _),.. }
1134 if expander.is_derive()
1136 // Resolved to `#[derive]`
1138 let item_tree = tree.item_tree(self.db);
1139 let ast_adt_id: FileAstId<ast::Adt> = match *mod_item {
1140 ModItem::Struct(strukt) => item_tree[strukt].ast_id().upcast(),
1141 ModItem::Union(union) => item_tree[union].ast_id().upcast(),
1142 ModItem::Enum(enum_) => item_tree[enum_].ast_id().upcast(),
1144 let diag = DefDiagnostic::invalid_derive_target(
1145 directive.module_id,
1149 self.def_map.diagnostics.push(diag);
1150 return recollect_without(self);
1153 let ast_id = ast_id.with_value(ast_adt_id);
1155 match attr.parse_path_comma_token_tree() {
1156 Some(derive_macros) => {
1158 for (idx, path) in derive_macros.enumerate() {
1159 let ast_id = AstIdWithPath::new(file_id, ast_id.value, path);
1160 self.unresolved_macros.push(MacroDirective {
1161 module_id: directive.module_id,
1162 depth: directive.depth + 1,
1163 kind: MacroDirectiveKind::Derive {
1165 derive_attr: attr.id,
1168 container: directive.container,
1173 self.def_map.modules[directive.module_id]
1175 .init_derive_attribute(ast_id, attr.id, len + 1);
1178 let diag = DefDiagnostic::malformed_derive(
1179 directive.module_id,
1183 self.def_map.diagnostics.push(diag);
1187 return recollect_without(self);
1190 if !self.db.enable_proc_attr_macros() {
1194 // Not resolved to a derive helper or the derive attribute, so try to treat as a normal attribute.
1196 attr_macro_as_call_id(file_ast_id, attr, self.db, self.def_map.krate, def);
1197 let loc: MacroCallLoc = self.db.lookup_intern_macro_call(call_id);
1199 // Skip #[test]/#[bench] expansion, which would merely result in more memory usage
1200 // due to duplicating functions into macro expansions
1203 MacroDefKind::BuiltInAttr(expander, _)
1204 if expander.is_test() || expander.is_bench()
1206 return recollect_without(self);
1209 if let MacroDefKind::ProcMacro(exp, ..) = loc.def.kind {
1211 // Proc macros that cannot be expanded are treated as not
1212 // resolved, in order to fall back later.
1213 self.def_map.diagnostics.push(DefDiagnostic::unresolved_proc_macro(
1214 directive.module_id,
1218 return recollect_without(self);
1222 self.def_map.modules[directive.module_id]
1224 .add_attr_macro_invoc(ast_id, call_id);
1226 push_resolved(directive, call_id);
1227 res = ReachedFixedPoint::No;
1234 // Attribute resolution can add unresolved macro invocations, so concatenate the lists.
1235 self.unresolved_macros.extend(macros);
1237 for (module_id, depth, container, macro_call_id) in resolved {
1238 self.collect_macro_expansion(module_id, macro_call_id, depth, container);
1244 fn collect_macro_expansion(
1246 module_id: LocalModuleId,
1247 macro_call_id: MacroCallId,
1249 container: ItemContainerId,
1251 if EXPANSION_DEPTH_LIMIT.check(depth).is_err() {
1252 cov_mark::hit!(macro_expansion_overflow);
1253 tracing::warn!("macro expansion is too deep");
1256 let file_id = macro_call_id.as_file();
1258 // First, fetch the raw expansion result for purposes of error reporting. This goes through
1259 // `macro_expand_error` to avoid depending on the full expansion result (to improve
1261 let loc: MacroCallLoc = self.db.lookup_intern_macro_call(macro_call_id);
1262 let err = self.db.macro_expand_error(macro_call_id);
1263 if let Some(err) = err {
1264 let diag = match err {
1265 hir_expand::ExpandError::UnresolvedProcMacro => {
1266 // Missing proc macros are non-fatal, so they are handled specially.
1267 DefDiagnostic::unresolved_proc_macro(module_id, loc.kind.clone())
1269 _ => DefDiagnostic::macro_error(module_id, loc.kind.clone(), err.to_string()),
1272 self.def_map.diagnostics.push(diag);
1275 // If we've just resolved a derive, record its helper attributes.
1276 if let MacroCallKind::Derive { ast_id, .. } = &loc.kind {
1277 if loc.def.krate != self.def_map.krate {
1278 let def_map = self.db.crate_def_map(loc.def.krate);
1279 if let Some(def) = def_map.exported_proc_macros.get(&loc.def) {
1280 if let ProcMacroKind::CustomDerive { helpers } = &def.kind {
1281 self.derive_helpers_in_scope
1282 .entry(ast_id.map(|it| it.upcast()))
1284 .extend(helpers.iter().cloned());
1290 // Then, fetch and process the item tree. This will reuse the expansion result from above.
1291 let item_tree = self.db.file_item_tree(file_id);
1292 let mod_dir = self.mod_dirs[&module_id].clone();
1294 def_collector: &mut *self,
1296 tree_id: TreeId::new(file_id, None),
1298 item_tree: &item_tree,
1301 .collect(item_tree.top_level_items(), container);
1304 fn finish(mut self) -> DefMap {
1305 // Emit diagnostics for all remaining unexpanded macros.
1307 let _p = profile::span("DefCollector::finish");
1309 for directive in &self.unresolved_macros {
1310 match &directive.kind {
1311 MacroDirectiveKind::FnLike { ast_id, expand_to } => {
1312 let macro_call_as_call_id = macro_call_as_call_id(
1318 let resolved_res = self.def_map.resolve_path_fp_with_macro(
1321 directive.module_id,
1323 BuiltinShadowMode::Module,
1325 resolved_res.resolved_def.take_macros()
1329 if let Err(UnresolvedMacro { path }) = macro_call_as_call_id {
1330 self.def_map.diagnostics.push(DefDiagnostic::unresolved_macro_call(
1331 directive.module_id,
1337 MacroDirectiveKind::Derive { .. } | MacroDirectiveKind::Attr { .. } => {
1338 // FIXME: we might want to diagnose this too
1343 // Emit diagnostics for all remaining unresolved imports.
1345 // We'd like to avoid emitting a diagnostics avalanche when some `extern crate` doesn't
1346 // resolve. We first emit diagnostics for unresolved extern crates and collect the missing
1347 // crate names. Then we emit diagnostics for unresolved imports, but only if the import
1348 // doesn't start with an unresolved crate's name. Due to renaming and reexports, this is a
1349 // heuristic, but it works in practice.
1350 let mut diagnosed_extern_crates = FxHashSet::default();
1351 for directive in &self.unresolved_imports {
1352 if let ImportSource::ExternCrate(krate) = directive.import.source {
1353 let item_tree = krate.item_tree(self.db);
1354 let extern_crate = &item_tree[krate.value];
1356 diagnosed_extern_crates.insert(extern_crate.name.clone());
1358 self.def_map.diagnostics.push(DefDiagnostic::unresolved_extern_crate(
1359 directive.module_id,
1360 InFile::new(krate.file_id(), extern_crate.ast_id),
1365 for directive in &self.unresolved_imports {
1366 if let ImportSource::Import { id: import, use_tree } = directive.import.source {
1368 (directive.import.path.segments().first(), &directive.import.path.kind),
1369 (Some(krate), PathKind::Plain | PathKind::Abs) if diagnosed_extern_crates.contains(krate)
1374 self.def_map.diagnostics.push(DefDiagnostic::unresolved_import(
1375 directive.module_id,
1386 /// Walks a single module, populating defs, imports and macros
1387 struct ModCollector<'a, 'b> {
1388 def_collector: &'a mut DefCollector<'b>,
1390 module_id: LocalModuleId,
1392 item_tree: &'a ItemTree,
1396 impl ModCollector<'_, '_> {
1397 fn collect_in_top_module(&mut self, items: &[ModItem]) {
1398 let module = self.def_collector.def_map.module_id(self.module_id);
1399 self.collect(items, module.into())
1402 fn collect(&mut self, items: &[ModItem], container: ItemContainerId) {
1403 struct DefData<'a> {
1406 visibility: &'a RawVisibility,
1407 has_constructor: bool,
1410 let krate = self.def_collector.def_map.krate;
1412 // Note: don't assert that inserted value is fresh: it's simply not true
1414 self.def_collector.mod_dirs.insert(self.module_id, self.mod_dir.clone());
1416 // Prelude module is always considered to be `#[macro_use]`.
1417 if let Some(prelude_module) = self.def_collector.def_map.prelude {
1418 if prelude_module.krate != krate {
1419 cov_mark::hit!(prelude_is_macro_use);
1420 self.def_collector.import_all_macros_exported(self.module_id, prelude_module.krate);
1424 // This should be processed eagerly instead of deferred to resolving.
1425 // `#[macro_use] extern crate` is hoisted to imports macros before collecting
1427 for &item in items {
1428 let attrs = self.item_tree.attrs(self.def_collector.db, krate, item.into());
1429 if attrs.cfg().map_or(true, |cfg| self.is_cfg_enabled(&cfg)) {
1430 if let ModItem::ExternCrate(id) = item {
1431 let import = &self.item_tree[id];
1432 let attrs = self.item_tree.attrs(
1433 self.def_collector.db,
1435 ModItem::from(id).into(),
1437 if attrs.by_key("macro_use").exists() {
1438 self.def_collector.import_macros_from_extern_crate(self.module_id, import);
1444 for &item in items {
1445 let attrs = self.item_tree.attrs(self.def_collector.db, krate, item.into());
1446 if let Some(cfg) = attrs.cfg() {
1447 if !self.is_cfg_enabled(&cfg) {
1448 self.emit_unconfigured_diagnostic(item, &cfg);
1453 if let Err(()) = self.resolve_attributes(&attrs, item, container) {
1454 // Do not process the item. It has at least one non-builtin attribute, so the
1455 // fixed-point algorithm is required to resolve the rest of them.
1459 let module = self.def_collector.def_map.module_id(self.module_id);
1463 ModItem::Mod(m) => self.collect_module(&self.item_tree[m], &attrs),
1464 ModItem::Import(import_id) => {
1465 let module_id = self.module_id;
1466 let imports = Import::from_use(
1467 self.def_collector.db,
1470 ItemTreeId::new(self.tree_id, import_id),
1472 self.def_collector.unresolved_imports.extend(imports.into_iter().map(
1473 |import| ImportDirective {
1476 status: PartialResolvedImport::Unresolved,
1480 ModItem::ExternCrate(import_id) => {
1481 self.def_collector.unresolved_imports.push(ImportDirective {
1482 module_id: self.module_id,
1483 import: Import::from_extern_crate(
1484 self.def_collector.db,
1487 ItemTreeId::new(self.tree_id, import_id),
1489 status: PartialResolvedImport::Unresolved,
1492 ModItem::ExternBlock(block) => self.collect(
1493 &self.item_tree[block].children,
1494 ItemContainerId::ExternBlockId(
1497 id: ItemTreeId::new(self.tree_id, block),
1499 .intern(self.def_collector.db),
1502 ModItem::MacroCall(mac) => self.collect_macro_call(&self.item_tree[mac], container),
1503 ModItem::MacroRules(id) => self.collect_macro_rules(id),
1504 ModItem::MacroDef(id) => self.collect_macro_def(id),
1505 ModItem::Impl(imp) => {
1506 let module = self.def_collector.def_map.module_id(self.module_id);
1508 ImplLoc { container: module, id: ItemTreeId::new(self.tree_id, imp) }
1509 .intern(self.def_collector.db);
1510 self.def_collector.def_map.modules[self.module_id].scope.define_impl(impl_id)
1512 ModItem::Function(id) => {
1513 let func = &self.item_tree[id];
1515 let ast_id = InFile::new(self.file_id(), func.ast_id);
1516 self.collect_proc_macro_def(&func.name, ast_id, &attrs);
1518 def = Some(DefData {
1519 id: FunctionLoc { container, id: ItemTreeId::new(self.tree_id, id) }
1520 .intern(self.def_collector.db)
1523 visibility: &self.item_tree[func.visibility],
1524 has_constructor: false,
1527 ModItem::Struct(id) => {
1528 let it = &self.item_tree[id];
1530 def = Some(DefData {
1531 id: StructLoc { container: module, id: ItemTreeId::new(self.tree_id, id) }
1532 .intern(self.def_collector.db)
1535 visibility: &self.item_tree[it.visibility],
1536 has_constructor: !matches!(it.fields, Fields::Record(_)),
1539 ModItem::Union(id) => {
1540 let it = &self.item_tree[id];
1542 def = Some(DefData {
1543 id: UnionLoc { container: module, id: ItemTreeId::new(self.tree_id, id) }
1544 .intern(self.def_collector.db)
1547 visibility: &self.item_tree[it.visibility],
1548 has_constructor: false,
1551 ModItem::Enum(id) => {
1552 let it = &self.item_tree[id];
1554 def = Some(DefData {
1555 id: EnumLoc { container: module, id: ItemTreeId::new(self.tree_id, id) }
1556 .intern(self.def_collector.db)
1559 visibility: &self.item_tree[it.visibility],
1560 has_constructor: false,
1563 ModItem::Const(id) => {
1564 let it = &self.item_tree[id];
1565 let const_id = ConstLoc { container, id: ItemTreeId::new(self.tree_id, id) }
1566 .intern(self.def_collector.db);
1570 def = Some(DefData {
1571 id: const_id.into(),
1573 visibility: &self.item_tree[it.visibility],
1574 has_constructor: false,
1578 // const _: T = ...;
1579 self.def_collector.def_map.modules[self.module_id]
1581 .define_unnamed_const(const_id);
1585 ModItem::Static(id) => {
1586 let it = &self.item_tree[id];
1588 def = Some(DefData {
1589 id: StaticLoc { container, id: ItemTreeId::new(self.tree_id, id) }
1590 .intern(self.def_collector.db)
1593 visibility: &self.item_tree[it.visibility],
1594 has_constructor: false,
1597 ModItem::Trait(id) => {
1598 let it = &self.item_tree[id];
1600 def = Some(DefData {
1601 id: TraitLoc { container: module, id: ItemTreeId::new(self.tree_id, id) }
1602 .intern(self.def_collector.db)
1605 visibility: &self.item_tree[it.visibility],
1606 has_constructor: false,
1609 ModItem::TypeAlias(id) => {
1610 let it = &self.item_tree[id];
1612 def = Some(DefData {
1613 id: TypeAliasLoc { container, id: ItemTreeId::new(self.tree_id, id) }
1614 .intern(self.def_collector.db)
1617 visibility: &self.item_tree[it.visibility],
1618 has_constructor: false,
1623 if let Some(DefData { id, name, visibility, has_constructor }) = def {
1624 self.def_collector.def_map.modules[self.module_id].scope.declare(id);
1628 .resolve_visibility(self.def_collector.db, self.module_id, visibility)
1629 .unwrap_or(Visibility::Public);
1630 self.def_collector.update(
1632 &[(Some(name.clone()), PerNs::from_def(id, vis, has_constructor))],
1640 fn collect_module(&mut self, module: &Mod, attrs: &Attrs) {
1641 let path_attr = attrs.by_key("path").string_value();
1642 let is_macro_use = attrs.by_key("macro_use").exists();
1643 match &module.kind {
1644 // inline module, just recurse
1645 ModKind::Inline { items } => {
1646 let module_id = self.push_child_module(
1647 module.name.clone(),
1648 AstId::new(self.file_id(), module.ast_id),
1650 &self.item_tree[module.visibility],
1653 if let Some(mod_dir) = self.mod_dir.descend_into_definition(&module.name, path_attr)
1656 def_collector: &mut *self.def_collector,
1657 macro_depth: self.macro_depth,
1659 tree_id: self.tree_id,
1660 item_tree: self.item_tree,
1663 .collect_in_top_module(&*items);
1665 self.import_all_legacy_macros(module_id);
1669 // out of line module, resolve, parse and recurse
1670 ModKind::Outline {} => {
1671 let ast_id = AstId::new(self.tree_id.file_id(), module.ast_id);
1672 let db = self.def_collector.db;
1673 match self.mod_dir.resolve_declaration(db, self.file_id(), &module.name, path_attr)
1675 Ok((file_id, is_mod_rs, mod_dir)) => {
1676 let item_tree = db.file_item_tree(file_id.into());
1677 let is_enabled = item_tree
1678 .top_level_attrs(db, self.def_collector.def_map.krate)
1680 .map_or(true, |cfg| self.is_cfg_enabled(&cfg));
1682 let module_id = self.push_child_module(
1683 module.name.clone(),
1685 Some((file_id, is_mod_rs)),
1686 &self.item_tree[module.visibility],
1689 def_collector: &mut *self.def_collector,
1690 macro_depth: self.macro_depth,
1692 tree_id: TreeId::new(file_id.into(), None),
1693 item_tree: &item_tree,
1696 .collect_in_top_module(item_tree.top_level_items());
1697 let is_macro_use = is_macro_use
1699 .top_level_attrs(db, self.def_collector.def_map.krate)
1700 .by_key("macro_use")
1703 self.import_all_legacy_macros(module_id);
1708 self.def_collector.def_map.diagnostics.push(
1709 DefDiagnostic::unresolved_module(self.module_id, ast_id, candidate),
1717 fn push_child_module(
1720 declaration: AstId<ast::Module>,
1721 definition: Option<(FileId, bool)>,
1722 visibility: &crate::visibility::RawVisibility,
1723 ) -> LocalModuleId {
1727 .resolve_visibility(self.def_collector.db, self.module_id, visibility)
1728 .unwrap_or(Visibility::Public);
1729 let modules = &mut self.def_collector.def_map.modules;
1730 let origin = match definition {
1731 None => ModuleOrigin::Inline { definition: declaration },
1732 Some((definition, is_mod_rs)) => {
1733 ModuleOrigin::File { declaration, definition, is_mod_rs }
1737 let res = modules.alloc(ModuleData::new(origin, vis));
1738 modules[res].parent = Some(self.module_id);
1739 for (name, mac) in modules[self.module_id].scope.collect_legacy_macros() {
1740 modules[res].scope.define_legacy_macro(name, mac)
1742 modules[self.module_id].children.insert(name.clone(), res);
1744 let module = self.def_collector.def_map.module_id(res);
1745 let def = ModuleDefId::from(module);
1747 self.def_collector.def_map.modules[self.module_id].scope.declare(def);
1748 self.def_collector.update(
1750 &[(Some(name), PerNs::from_def(def, vis, false))],
1757 /// Resolves attributes on an item.
1759 /// Returns `Err` when some attributes could not be resolved to builtins and have been
1760 /// registered as unresolved.
1762 /// If `ignore_up_to` is `Some`, attributes preceding and including that attribute will be
1763 /// assumed to be resolved already.
1764 fn resolve_attributes(
1768 container: ItemContainerId,
1769 ) -> Result<(), ()> {
1770 let mut ignore_up_to =
1771 self.def_collector.skip_attrs.get(&InFile::new(self.file_id(), mod_item)).copied();
1775 // FIXME: this should not be required, all attributes on an item should have a
1777 // Still, this occurs because `#[cfg_attr]` can "expand" to multiple attributes:
1778 // #[cfg_attr(not(off), unresolved, unresolved)]
1780 // We should come up with a different way to ID attributes.
1783 .skip_while(|attr| match ignore_up_to {
1784 Some(id) if attr.id == id => {
1785 ignore_up_to = None;
1793 if self.def_collector.def_map.is_builtin_or_registered_attr(&attr.path) {
1796 tracing::debug!("non-builtin attribute {}", attr.path);
1798 let ast_id = AstIdWithPath::new(
1800 mod_item.ast_id(self.item_tree),
1801 attr.path.as_ref().clone(),
1803 self.def_collector.unresolved_macros.push(MacroDirective {
1804 module_id: self.module_id,
1805 depth: self.macro_depth + 1,
1806 kind: MacroDirectiveKind::Attr {
1821 /// If `attrs` registers a procedural macro, collects its definition.
1822 fn collect_proc_macro_def(&mut self, func_name: &Name, ast_id: AstId<ast::Fn>, attrs: &Attrs) {
1823 // FIXME: this should only be done in the root module of `proc-macro` crates, not everywhere
1824 if let Some(proc_macro) = attrs.parse_proc_macro_decl(func_name) {
1825 self.def_collector.export_proc_macro(proc_macro, ast_id);
1829 fn collect_macro_rules(&mut self, id: FileItemTreeId<MacroRules>) {
1830 let krate = self.def_collector.def_map.krate;
1831 let mac = &self.item_tree[id];
1832 let attrs = self.item_tree.attrs(self.def_collector.db, krate, ModItem::from(id).into());
1833 let ast_id = InFile::new(self.file_id(), mac.ast_id.upcast());
1835 let export_attr = attrs.by_key("macro_export");
1837 let is_export = export_attr.exists();
1838 let is_local_inner = if is_export {
1839 export_attr.tt_values().flat_map(|it| &it.token_trees).any(|it| match it {
1840 tt::TokenTree::Leaf(tt::Leaf::Ident(ident)) => {
1841 ident.text.contains("local_inner_macros")
1849 // Case 1: builtin macros
1850 if attrs.by_key("rustc_builtin_macro").exists() {
1851 // `#[rustc_builtin_macro = "builtin_name"]` overrides the `macro_rules!` name.
1853 let name = match attrs.by_key("rustc_builtin_macro").string_value() {
1855 // FIXME: a hacky way to create a Name from string.
1856 name = tt::Ident { text: it.clone(), id: tt::TokenId::unspecified() }.as_name();
1861 attrs.by_key("rustc_builtin_macro").tt_values().next().and_then(|tt| {
1862 match tt.token_trees.first() {
1863 Some(tt::TokenTree::Leaf(tt::Leaf::Ident(name))) => Some(name),
1867 match explicit_name {
1869 name = ident.as_name();
1876 let krate = self.def_collector.def_map.krate;
1877 match find_builtin_macro(name, krate, ast_id) {
1879 self.def_collector.define_macro_rules(
1891 .push(DefDiagnostic::unimplemented_builtin_macro(self.module_id, ast_id));
1896 // Case 2: normal `macro_rules!` macro
1897 let macro_id = MacroDefId {
1898 krate: self.def_collector.def_map.krate,
1899 kind: MacroDefKind::Declarative(ast_id),
1900 local_inner: is_local_inner,
1902 self.def_collector.define_macro_rules(
1910 fn collect_macro_def(&mut self, id: FileItemTreeId<MacroDef>) {
1911 let krate = self.def_collector.def_map.krate;
1912 let mac = &self.item_tree[id];
1913 let ast_id = InFile::new(self.file_id(), mac.ast_id.upcast());
1915 // Case 1: builtin macros
1916 let attrs = self.item_tree.attrs(self.def_collector.db, krate, ModItem::from(id).into());
1917 if attrs.by_key("rustc_builtin_macro").exists() {
1918 let macro_id = find_builtin_macro(&mac.name, krate, ast_id)
1919 .or_else(|| find_builtin_derive(&mac.name, krate, ast_id))
1920 .or_else(|| find_builtin_attr(&mac.name, krate, ast_id));
1924 self.def_collector.define_macro_def(
1928 &self.item_tree[mac.visibility],
1936 .push(DefDiagnostic::unimplemented_builtin_macro(self.module_id, ast_id));
1941 // Case 2: normal `macro`
1942 let macro_id = MacroDefId {
1943 krate: self.def_collector.def_map.krate,
1944 kind: MacroDefKind::Declarative(ast_id),
1948 self.def_collector.define_macro_def(
1952 &self.item_tree[mac.visibility],
1956 fn collect_macro_call(&mut self, mac: &MacroCall, container: ItemContainerId) {
1957 let ast_id = AstIdWithPath::new(self.file_id(), mac.ast_id, ModPath::clone(&mac.path));
1959 // Case 1: try to resolve in legacy scope and expand macro_rules
1960 let mut error = None;
1961 match macro_call_as_call_id(
1964 self.def_collector.db,
1965 self.def_collector.def_map.krate,
1967 path.as_ident().and_then(|name| {
1968 self.def_collector.def_map.with_ancestor_maps(
1969 self.def_collector.db,
1971 &mut |map, module| map[module].scope.get_legacy_macro(name),
1976 error.get_or_insert(err);
1979 Ok(Ok(macro_call_id)) => {
1980 // Legacy macros need to be expanded immediately, so that any macros they produce
1982 self.def_collector.collect_macro_expansion(
1985 self.macro_depth + 1,
1989 if let Some(err) = error {
1990 self.def_collector.def_map.diagnostics.push(DefDiagnostic::macro_error(
1992 MacroCallKind::FnLike { ast_id: ast_id.ast_id, expand_to: mac.expand_to },
2000 // Built-in macro failed eager expansion.
2002 self.def_collector.def_map.diagnostics.push(DefDiagnostic::macro_error(
2004 MacroCallKind::FnLike { ast_id: ast_id.ast_id, expand_to: mac.expand_to },
2005 error.unwrap().to_string(),
2009 Err(UnresolvedMacro { .. }) => (),
2012 // Case 2: resolve in module scope, expand during name resolution.
2013 self.def_collector.unresolved_macros.push(MacroDirective {
2014 module_id: self.module_id,
2015 depth: self.macro_depth + 1,
2016 kind: MacroDirectiveKind::FnLike { ast_id, expand_to: mac.expand_to },
2021 fn import_all_legacy_macros(&mut self, module_id: LocalModuleId) {
2022 let macros = self.def_collector.def_map[module_id].scope.collect_legacy_macros();
2023 for (name, macro_) in macros {
2024 self.def_collector.define_legacy_macro(self.module_id, name.clone(), macro_);
2028 fn is_cfg_enabled(&self, cfg: &CfgExpr) -> bool {
2029 self.def_collector.cfg_options.check(cfg) != Some(false)
2032 fn emit_unconfigured_diagnostic(&mut self, item: ModItem, cfg: &CfgExpr) {
2033 let ast_id = item.ast_id(self.item_tree);
2035 let ast_id = InFile::new(self.file_id(), ast_id);
2036 self.def_collector.def_map.diagnostics.push(DefDiagnostic::unconfigured_code(
2040 self.def_collector.cfg_options.clone(),
2044 fn file_id(&self) -> HirFileId {
2045 self.tree_id.file_id()
2051 use crate::{db::DefDatabase, test_db::TestDB};
2052 use base_db::{fixture::WithFixture, SourceDatabase};
2056 fn do_collect_defs(db: &dyn DefDatabase, def_map: DefMap) -> DefMap {
2057 let mut collector = DefCollector {
2060 deps: FxHashMap::default(),
2061 glob_imports: FxHashMap::default(),
2062 unresolved_imports: Vec::new(),
2063 resolved_imports: Vec::new(),
2064 unresolved_macros: Vec::new(),
2065 mod_dirs: FxHashMap::default(),
2066 cfg_options: &CfgOptions::default(),
2067 proc_macros: Default::default(),
2068 exports_proc_macros: false,
2069 from_glob_import: Default::default(),
2070 skip_attrs: Default::default(),
2071 derive_helpers_in_scope: Default::default(),
2073 collector.seed_with_top_level();
2074 collector.collect();
2078 fn do_resolve(not_ra_fixture: &str) -> DefMap {
2079 let (db, file_id) = TestDB::with_single_file(not_ra_fixture);
2080 let krate = db.test_crate();
2082 let edition = db.crate_graph()[krate].edition;
2083 let module_origin = ModuleOrigin::CrateRoot { definition: file_id };
2084 let def_map = DefMap::empty(krate, edition, module_origin);
2085 do_collect_defs(&db, def_map)
2089 fn test_macro_expand_will_stop_1() {
2093 ($($ty:ty)*) => { foo!($($ty)*); }
2101 ($($ty:ty)*) => { foo!(() $($ty)*); }
2110 fn test_macro_expand_will_stop_2() {
2111 // FIXME: this test does succeed, but takes quite a while: 90 seconds in
2112 // the release mode. That's why the argument is not an ra_fixture --
2113 // otherwise injection highlighting gets stuck.
2115 // We need to find a way to fail this faster.
2119 ($($ty:ty)*) => { foo!($($ty)* $($ty)*); }