1 //! Describes items defined or visible (ie, imported) in a certain scope.
2 //! This is shared between modules and blocks.
4 use std::collections::hash_map::Entry;
7 use hir_expand::{name::Name, AstId, MacroCallId, MacroDefKind};
8 use once_cell::sync::Lazy;
10 use rustc_hash::{FxHashMap, FxHashSet};
11 use smallvec::SmallVec;
16 attr::AttrId, db::DefDatabase, per_ns::PerNs, visibility::Visibility, AdtId, BuiltinType,
17 ConstId, ImplId, LocalModuleId, MacroDefId, ModuleDefId, ModuleId, TraitId,
20 #[derive(Copy, Clone)]
21 pub(crate) enum ImportType {
26 #[derive(Debug, Default)]
27 pub struct PerNsGlobImports {
28 types: FxHashSet<(LocalModuleId, Name)>,
29 values: FxHashSet<(LocalModuleId, Name)>,
30 macros: FxHashSet<(LocalModuleId, Name)>,
33 #[derive(Debug, Default, PartialEq, Eq)]
34 pub struct ItemScope {
37 /// Defs visible in this scope. This includes `declarations`, but also
39 types: FxHashMap<Name, (ModuleDefId, Visibility)>,
40 values: FxHashMap<Name, (ModuleDefId, Visibility)>,
41 macros: FxHashMap<Name, (MacroDefId, Visibility)>,
42 unresolved: FxHashSet<Name>,
44 /// The defs declared in this scope. Each def has a single scope where it is
46 declarations: Vec<ModuleDefId>,
47 macro_declarations: Vec<MacroDefId>,
50 unnamed_consts: Vec<ConstId>,
51 /// Traits imported via `use Trait as _;`.
52 unnamed_trait_imports: FxHashMap<TraitId, Visibility>,
53 /// Macros visible in current module in legacy textual scope
55 /// For macros invoked by an unqualified identifier like `bar!()`, `legacy_macros` will be searched in first.
56 /// If it yields no result, then it turns to module scoped `macros`.
57 /// It macros with name qualified with a path like `crate::foo::bar!()`, `legacy_macros` will be skipped,
58 /// and only normal scoped `macros` will be searched in.
60 /// Note that this automatically inherit macros defined textually before the definition of module itself.
62 /// Module scoped macros will be inserted into `items` instead of here.
63 // FIXME: Macro shadowing in one module is not properly handled. Non-item place macros will
64 // be all resolved to the last one defined if shadowing happens.
65 legacy_macros: FxHashMap<Name, MacroDefId>,
66 attr_macros: FxHashMap<AstId<ast::Item>, MacroCallId>,
67 derive_macros: FxHashMap<AstId<ast::Item>, SmallVec<[(AttrId, MacroCallId); 1]>>,
70 pub(crate) static BUILTIN_SCOPE: Lazy<FxHashMap<Name, PerNs>> = Lazy::new(|| {
73 .map(|(name, ty)| (name.clone(), PerNs::types((*ty).into(), Visibility::Public)))
77 /// Shadow mode for builtin type which can be shadowed by module.
78 #[derive(Debug, Copy, Clone, PartialEq, Eq)]
79 pub(crate) enum BuiltinShadowMode {
80 /// Prefer user-defined modules (or other types) over builtins.
82 /// Prefer builtins over user-defined modules (but not other types).
86 /// Legacy macros can only be accessed through special methods like `get_legacy_macros`.
87 /// Other methods will only resolve values, types and module scoped macros only.
89 pub fn entries<'a>(&'a self) -> impl Iterator<Item = (&'a Name, PerNs)> + 'a {
91 let keys: FxHashSet<_> = self
94 .chain(self.values.keys())
95 .chain(self.macros.keys())
96 .chain(self.unresolved.iter())
99 keys.into_iter().map(move |name| (name, self.get(name)))
102 pub fn declarations(&self) -> impl Iterator<Item = ModuleDefId> + '_ {
103 self.declarations.iter().copied()
106 pub fn macro_declarations(&self) -> impl Iterator<Item = MacroDefId> + '_ {
107 self.macro_declarations.iter().copied()
110 pub fn impls(&self) -> impl Iterator<Item = ImplId> + ExactSizeIterator + '_ {
111 self.impls.iter().copied()
116 ) -> impl Iterator<Item = (ModuleDefId, Visibility)> + ExactSizeIterator + '_ {
117 self.values.values().copied()
120 pub fn unnamed_consts(&self) -> impl Iterator<Item = ConstId> + '_ {
121 self.unnamed_consts.iter().copied()
124 /// Iterate over all module scoped macros
125 pub(crate) fn macros<'a>(&'a self) -> impl Iterator<Item = (&'a Name, MacroDefId)> + 'a {
126 self.entries().filter_map(|(name, def)| def.take_macros().map(|macro_| (name, macro_)))
129 /// Iterate over all legacy textual scoped macros visible at the end of the module
130 pub(crate) fn legacy_macros<'a>(&'a self) -> impl Iterator<Item = (&'a Name, MacroDefId)> + 'a {
131 self.legacy_macros.iter().map(|(name, def)| (name, *def))
134 /// Get a name from current module scope, legacy macros are not included
135 pub(crate) fn get(&self, name: &Name) -> PerNs {
137 types: self.types.get(name).copied(),
138 values: self.values.get(name).copied(),
139 macros: self.macros.get(name).copied(),
143 /// XXX: this is O(N) rather than O(1), try to not introduce new usages.
144 pub(crate) fn name_of(&self, item: ItemInNs) -> Option<(&Name, Visibility)> {
145 let (def, mut iter) = match item {
146 ItemInNs::Macros(def) => {
150 .find_map(|(name, &(other_def, vis))| (other_def == def).then(|| (name, vis)));
152 ItemInNs::Types(def) => (def, self.types.iter()),
153 ItemInNs::Values(def) => (def, self.values.iter()),
155 iter.find_map(|(name, &(other_def, vis))| (other_def == def).then(|| (name, vis)))
158 pub(crate) fn traits<'a>(&'a self) -> impl Iterator<Item = TraitId> + 'a {
161 .filter_map(|(def, _)| match def {
162 ModuleDefId::TraitId(t) => Some(*t),
165 .chain(self.unnamed_trait_imports.keys().copied())
168 pub(crate) fn declare(&mut self, def: ModuleDefId) {
169 self.declarations.push(def)
172 pub(crate) fn declare_macro(&mut self, def: MacroDefId) {
173 self.macro_declarations.push(def);
176 pub(crate) fn get_legacy_macro(&self, name: &Name) -> Option<MacroDefId> {
177 self.legacy_macros.get(name).copied()
180 pub(crate) fn define_impl(&mut self, imp: ImplId) {
184 pub(crate) fn define_unnamed_const(&mut self, konst: ConstId) {
185 self.unnamed_consts.push(konst);
188 pub(crate) fn define_legacy_macro(&mut self, name: Name, mac: MacroDefId) {
189 self.legacy_macros.insert(name, mac);
192 pub(crate) fn add_attr_macro_invoc(&mut self, item: AstId<ast::Item>, call: MacroCallId) {
193 self.attr_macros.insert(item, call);
196 pub(crate) fn attr_macro_invocs(
198 ) -> impl Iterator<Item = (AstId<ast::Item>, MacroCallId)> + '_ {
199 self.attr_macros.iter().map(|(k, v)| (*k, *v))
202 pub(crate) fn add_derive_macro_invoc(
204 item: AstId<ast::Item>,
208 self.derive_macros.entry(item).or_default().push((attr_id, call));
211 pub(crate) fn derive_macro_invocs(
213 ) -> impl Iterator<Item = (AstId<ast::Item>, &[(AttrId, MacroCallId)])> + '_ {
214 self.derive_macros.iter().map(|(k, v)| (*k, v.as_ref()))
217 pub(crate) fn unnamed_trait_vis(&self, tr: TraitId) -> Option<Visibility> {
218 self.unnamed_trait_imports.get(&tr).copied()
221 pub(crate) fn push_unnamed_trait(&mut self, tr: TraitId, vis: Visibility) {
222 self.unnamed_trait_imports.insert(tr, vis);
225 pub(crate) fn push_res_with_import(
227 glob_imports: &mut PerNsGlobImports,
228 lookup: (LocalModuleId, Name),
230 def_import_type: ImportType,
232 let mut changed = false;
234 macro_rules! check_changed {
237 ( $this:ident / $def:ident ) . $field:ident,
238 $glob_imports:ident [ $lookup:ident ],
239 $def_import_type:ident
241 let existing = $this.$field.entry($lookup.1.clone());
242 match (existing, $def.$field) {
243 (Entry::Vacant(entry), Some(_)) => {
244 match $def_import_type {
245 ImportType::Glob => {
246 $glob_imports.$field.insert($lookup.clone());
248 ImportType::Named => {
249 $glob_imports.$field.remove(&$lookup);
253 if let Some(fld) = $def.$field {
258 (Entry::Occupied(mut entry), Some(_))
259 if $glob_imports.$field.contains(&$lookup)
260 && matches!($def_import_type, ImportType::Named) =>
262 cov_mark::hit!(import_shadowed);
263 $glob_imports.$field.remove(&$lookup);
264 if let Some(fld) = $def.$field {
274 check_changed!(changed, (self / def).types, glob_imports[lookup], def_import_type);
275 check_changed!(changed, (self / def).values, glob_imports[lookup], def_import_type);
276 check_changed!(changed, (self / def).macros, glob_imports[lookup], def_import_type);
278 if def.is_none() && self.unresolved.insert(lookup.1) {
285 pub(crate) fn resolutions<'a>(&'a self) -> impl Iterator<Item = (Option<Name>, PerNs)> + 'a {
286 self.entries().map(|(name, res)| (Some(name.clone()), res)).chain(
287 self.unnamed_trait_imports
289 .map(|(tr, vis)| (None, PerNs::types(ModuleDefId::TraitId(*tr), *vis))),
293 pub(crate) fn collect_legacy_macros(&self) -> FxHashMap<Name, MacroDefId> {
294 self.legacy_macros.clone()
297 /// Marks everything that is not a procedural macro as private to `this_module`.
298 pub(crate) fn censor_non_proc_macros(&mut self, this_module: ModuleId) {
301 .chain(self.values.values_mut())
303 .chain(self.unnamed_trait_imports.values_mut())
304 .for_each(|vis| *vis = Visibility::Module(this_module));
306 for (mac, vis) in self.macros.values_mut() {
307 if let MacroDefKind::ProcMacro(..) = mac.kind {
308 // FIXME: Technically this is insufficient since reexports of proc macros are also
309 // forbidden. Practically nobody does that.
313 *vis = Visibility::Module(this_module);
317 pub(crate) fn dump(&self, buf: &mut String) {
318 let mut entries: Vec<_> = self.resolutions().collect();
319 entries.sort_by_key(|(name, _)| name.clone());
321 for (name, def) in entries {
322 format_to!(buf, "{}:", name.map_or("_".to_string(), |name| name.to_string()));
324 if def.types.is_some() {
327 if def.values.is_some() {
330 if def.macros.is_some() {
341 pub(crate) fn shrink_to_fit(&mut self) {
342 // Exhaustive match to require handling new fields.
353 unnamed_trait_imports,
358 types.shrink_to_fit();
359 values.shrink_to_fit();
360 macros.shrink_to_fit();
361 unresolved.shrink_to_fit();
362 declarations.shrink_to_fit();
363 macro_declarations.shrink_to_fit();
364 impls.shrink_to_fit();
365 unnamed_consts.shrink_to_fit();
366 unnamed_trait_imports.shrink_to_fit();
367 legacy_macros.shrink_to_fit();
368 attr_macros.shrink_to_fit();
369 derive_macros.shrink_to_fit();
374 pub(crate) fn from_def(def: ModuleDefId, v: Visibility, has_constructor: bool) -> PerNs {
376 ModuleDefId::ModuleId(_) => PerNs::types(def, v),
377 ModuleDefId::FunctionId(_) => PerNs::values(def, v),
378 ModuleDefId::AdtId(adt) => match adt {
379 AdtId::UnionId(_) => PerNs::types(def, v),
380 AdtId::EnumId(_) => PerNs::types(def, v),
381 AdtId::StructId(_) => {
383 PerNs::both(def, def, v)
389 ModuleDefId::EnumVariantId(_) => PerNs::both(def, def, v),
390 ModuleDefId::ConstId(_) | ModuleDefId::StaticId(_) => PerNs::values(def, v),
391 ModuleDefId::TraitId(_) => PerNs::types(def, v),
392 ModuleDefId::TypeAliasId(_) => PerNs::types(def, v),
393 ModuleDefId::BuiltinType(_) => PerNs::types(def, v),
398 #[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
406 pub fn as_module_def_id(self) -> Option<ModuleDefId> {
408 ItemInNs::Types(id) | ItemInNs::Values(id) => Some(id),
409 ItemInNs::Macros(_) => None,
413 /// Returns the crate defining this item (or `None` if `self` is built-in).
414 pub fn krate(&self, db: &dyn DefDatabase) -> Option<CrateId> {
416 ItemInNs::Types(did) | ItemInNs::Values(did) => did.module(db).map(|m| m.krate),
417 ItemInNs::Macros(id) => Some(id.krate),