rust/crates/hir_def/src/item_scope.rs

342 lines
12 KiB
Rust
Raw Normal View History

2019-12-20 08:44:40 -06:00
//! Describes items defined or visible (ie, imported) in a certain scope.
//! This is shared between modules and blocks.
2020-06-30 06:25:15 -05:00
use std::collections::hash_map::Entry;
2020-08-13 09:25:38 -05:00
use base_db::CrateId;
2019-12-20 08:43:45 -06:00
use hir_expand::name::Name;
use once_cell::sync::Lazy;
use rustc_hash::{FxHashMap, FxHashSet};
use test_utils::mark;
2019-12-20 08:38:17 -06:00
use crate::{
db::DefDatabase, per_ns::PerNs, visibility::Visibility, AdtId, BuiltinType, HasModule, ImplId,
LocalModuleId, Lookup, MacroDefId, ModuleDefId, TraitId,
};
2019-12-20 08:43:45 -06:00
#[derive(Copy, Clone)]
pub(crate) enum ImportType {
Glob,
Named,
}
#[derive(Debug, Default)]
pub struct PerNsGlobImports {
types: FxHashSet<(LocalModuleId, Name)>,
values: FxHashSet<(LocalModuleId, Name)>,
macros: FxHashSet<(LocalModuleId, Name)>,
}
2019-12-20 08:43:45 -06:00
#[derive(Debug, Default, PartialEq, Eq)]
2019-12-20 08:45:12 -06:00
pub struct ItemScope {
types: FxHashMap<Name, (ModuleDefId, Visibility)>,
values: FxHashMap<Name, (ModuleDefId, Visibility)>,
macros: FxHashMap<Name, (MacroDefId, Visibility)>,
unresolved: FxHashSet<Name>,
2019-12-22 08:21:48 -06:00
defs: Vec<ModuleDefId>,
2019-12-20 09:55:38 -06:00
impls: Vec<ImplId>,
2020-07-21 10:52:43 -05:00
/// Traits imported via `use Trait as _;`.
unnamed_trait_imports: FxHashMap<TraitId, Visibility>,
2019-12-20 08:44:40 -06:00
/// Macros visible in current module in legacy textual scope
2019-12-20 08:43:45 -06:00
///
2019-12-20 08:44:40 -06:00
/// For macros invoked by an unqualified identifier like `bar!()`, `legacy_macros` will be searched in first.
2019-12-20 08:43:45 -06:00
/// If it yields no result, then it turns to module scoped `macros`.
2019-12-20 08:44:40 -06:00
/// It macros with name qualified with a path like `crate::foo::bar!()`, `legacy_macros` will be skipped,
2019-12-20 08:43:45 -06:00
/// and only normal scoped `macros` will be searched in.
///
/// Note that this automatically inherit macros defined textually before the definition of module itself.
///
/// Module scoped macros will be inserted into `items` instead of here.
// FIXME: Macro shadowing in one module is not properly handled. Non-item place macros will
// be all resolved to the last one defined if shadowing happens.
2019-12-20 10:09:13 -06:00
legacy_macros: FxHashMap<Name, MacroDefId>,
2019-12-20 08:43:45 -06:00
}
pub(crate) static BUILTIN_SCOPE: Lazy<FxHashMap<Name, PerNs>> = Lazy::new(|| {
2019-12-20 08:43:45 -06:00
BuiltinType::ALL
.iter()
.map(|(name, ty)| (name.clone(), PerNs::types(ty.clone().into(), Visibility::Public)))
2019-12-20 08:43:45 -06:00
.collect()
});
/// Shadow mode for builtin type which can be shadowed by module.
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
2019-12-20 08:51:43 -06:00
pub(crate) enum BuiltinShadowMode {
/// Prefer user-defined modules (or other types) over builtins.
2019-12-20 08:43:45 -06:00
Module,
/// Prefer builtins over user-defined modules (but not other types).
2019-12-20 08:43:45 -06:00
Other,
}
/// Legacy macros can only be accessed through special methods like `get_legacy_macros`.
/// Other methods will only resolve values, types and module scoped macros only.
2019-12-20 08:45:12 -06:00
impl ItemScope {
2019-12-22 08:37:07 -06:00
pub fn entries<'a>(&'a self) -> impl Iterator<Item = (&'a Name, PerNs)> + 'a {
// FIXME: shadowing
let keys: FxHashSet<_> = self
.types
.keys()
.chain(self.values.keys())
.chain(self.macros.keys())
.chain(self.unresolved.iter())
.collect();
keys.into_iter().map(move |name| (name, self.get(name)))
2019-12-20 08:43:45 -06:00
}
pub fn declarations(&self) -> impl Iterator<Item = ModuleDefId> + '_ {
2019-12-22 08:21:48 -06:00
self.defs.iter().copied()
2019-12-20 08:43:45 -06:00
}
2019-12-20 08:58:20 -06:00
pub fn impls(&self) -> impl Iterator<Item = ImplId> + ExactSizeIterator + '_ {
self.impls.iter().copied()
}
2020-03-25 11:11:38 -05:00
pub fn visibility_of(&self, def: ModuleDefId) -> Option<Visibility> {
2020-03-24 15:45:42 -05:00
self.name_of(ItemInNs::Types(def))
.or_else(|| self.name_of(ItemInNs::Values(def)))
.map(|(_, v)| v)
}
2019-12-20 08:43:45 -06:00
/// Iterate over all module scoped macros
2019-12-20 08:51:43 -06:00
pub(crate) fn macros<'a>(&'a self) -> impl Iterator<Item = (&'a Name, MacroDefId)> + 'a {
self.entries().filter_map(|(name, def)| def.take_macros().map(|macro_| (name, macro_)))
2019-12-20 08:43:45 -06:00
}
2019-12-20 08:51:43 -06:00
/// Iterate over all legacy textual scoped macros visible at the end of the module
pub(crate) fn legacy_macros<'a>(&'a self) -> impl Iterator<Item = (&'a Name, MacroDefId)> + 'a {
2019-12-20 08:43:45 -06:00
self.legacy_macros.iter().map(|(name, def)| (name, *def))
}
/// Get a name from current module scope, legacy macros are not included
pub(crate) fn get(&self, name: &Name) -> PerNs {
PerNs {
types: self.types.get(name).copied(),
values: self.values.get(name).copied(),
macros: self.macros.get(name).copied(),
}
2019-12-20 08:43:45 -06:00
}
2020-01-10 11:40:45 -06:00
pub(crate) fn name_of(&self, item: ItemInNs) -> Option<(&Name, Visibility)> {
for (name, per_ns) in self.entries() {
if let Some(vis) = item.match_with(per_ns) {
2019-12-30 10:31:15 -06:00
return Some((name, vis));
}
}
None
}
2019-12-20 08:51:43 -06:00
pub(crate) fn traits<'a>(&'a self) -> impl Iterator<Item = TraitId> + 'a {
2020-07-21 10:52:43 -05:00
self.types
.values()
.filter_map(|(def, _)| match def {
ModuleDefId::TraitId(t) => Some(*t),
_ => None,
})
.chain(self.unnamed_trait_imports.keys().copied())
2019-12-20 08:43:45 -06:00
}
2019-12-22 08:21:48 -06:00
pub(crate) fn define_def(&mut self, def: ModuleDefId) {
self.defs.push(def)
}
2019-12-20 08:43:45 -06:00
pub(crate) fn get_legacy_macro(&self, name: &Name) -> Option<MacroDefId> {
self.legacy_macros.get(name).copied()
}
2019-12-20 09:47:22 -06:00
2019-12-20 09:55:38 -06:00
pub(crate) fn define_impl(&mut self, imp: ImplId) {
self.impls.push(imp)
}
2019-12-20 10:09:13 -06:00
pub(crate) fn define_legacy_macro(&mut self, name: Name, mac: MacroDefId) {
self.legacy_macros.insert(name, mac);
}
2020-07-21 10:52:43 -05:00
pub(crate) fn unnamed_trait_vis(&self, tr: TraitId) -> Option<Visibility> {
self.unnamed_trait_imports.get(&tr).copied()
}
pub(crate) fn push_unnamed_trait(&mut self, tr: TraitId, vis: Visibility) {
self.unnamed_trait_imports.insert(tr, vis);
}
pub(crate) fn push_res(&mut self, name: Name, def: PerNs) -> bool {
let mut changed = false;
if let Some(types) = def.types {
2020-06-30 06:54:40 -05:00
self.types.entry(name.clone()).or_insert_with(|| {
changed = true;
types
});
}
if let Some(values) = def.values {
2020-06-30 06:54:40 -05:00
self.values.entry(name.clone()).or_insert_with(|| {
changed = true;
values
});
}
if let Some(macros) = def.macros {
2020-06-30 06:54:40 -05:00
self.macros.entry(name.clone()).or_insert_with(|| {
changed = true;
macros
});
}
if def.is_none() {
if self.unresolved.insert(name) {
changed = true;
}
}
changed
}
pub(crate) fn push_res_with_import(
&mut self,
glob_imports: &mut PerNsGlobImports,
lookup: (LocalModuleId, Name),
def: PerNs,
def_import_type: ImportType,
) -> bool {
2019-12-20 09:47:22 -06:00
let mut changed = false;
macro_rules! check_changed {
(
$changed:ident,
( $this:ident / $def:ident ) . $field:ident,
$glob_imports:ident [ $lookup:ident ],
$def_import_type:ident
) => {{
let existing = $this.$field.entry($lookup.1.clone());
match (existing, $def.$field) {
(Entry::Vacant(entry), Some(_)) => {
match $def_import_type {
ImportType::Glob => {
$glob_imports.$field.insert($lookup.clone());
}
ImportType::Named => {
$glob_imports.$field.remove(&$lookup);
}
}
if let Some(fld) = $def.$field {
entry.insert(fld);
}
$changed = true;
}
(Entry::Occupied(mut entry), Some(_))
if $glob_imports.$field.contains(&$lookup)
&& matches!($def_import_type, ImportType::Named) =>
{
mark::hit!(import_shadowed);
$glob_imports.$field.remove(&$lookup);
if let Some(fld) = $def.$field {
entry.insert(fld);
}
$changed = true;
}
_ => {}
}
}};
2019-12-20 09:47:22 -06:00
}
check_changed!(changed, (self / def).types, glob_imports[lookup], def_import_type);
check_changed!(changed, (self / def).values, glob_imports[lookup], def_import_type);
check_changed!(changed, (self / def).macros, glob_imports[lookup], def_import_type);
if def.is_none() {
if self.unresolved.insert(lookup.1) {
changed = true;
}
}
2019-12-20 09:47:22 -06:00
changed
}
2020-07-21 10:52:43 -05:00
pub(crate) fn resolutions<'a>(&'a self) -> impl Iterator<Item = (Option<Name>, PerNs)> + 'a {
self.entries().map(|(name, res)| (Some(name.clone()), res)).chain(
self.unnamed_trait_imports
.iter()
.map(|(tr, vis)| (None, PerNs::types(ModuleDefId::TraitId(*tr), *vis))),
)
}
2019-12-20 10:09:13 -06:00
pub(crate) fn collect_legacy_macros(&self) -> FxHashMap<Name, MacroDefId> {
self.legacy_macros.clone()
}
2019-12-20 08:43:45 -06:00
}
impl PerNs {
2020-05-04 12:15:27 -05:00
pub(crate) fn from_def(def: ModuleDefId, v: Visibility, has_constructor: bool) -> PerNs {
2019-12-22 08:08:57 -06:00
match def {
ModuleDefId::ModuleId(_) => PerNs::types(def, v),
ModuleDefId::FunctionId(_) => PerNs::values(def, v),
2019-12-22 08:08:57 -06:00
ModuleDefId::AdtId(adt) => match adt {
2020-05-04 12:19:54 -05:00
AdtId::UnionId(_) => PerNs::types(def, v),
AdtId::EnumId(_) => PerNs::types(def, v),
AdtId::StructId(_) => {
2020-05-05 10:01:07 -05:00
if has_constructor {
PerNs::both(def, def, v)
2020-05-05 10:01:07 -05:00
} else {
PerNs::types(def, v)
}
}
2019-12-22 08:08:57 -06:00
},
ModuleDefId::EnumVariantId(_) => PerNs::both(def, def, v),
ModuleDefId::ConstId(_) | ModuleDefId::StaticId(_) => PerNs::values(def, v),
ModuleDefId::TraitId(_) => PerNs::types(def, v),
ModuleDefId::TypeAliasId(_) => PerNs::types(def, v),
ModuleDefId::BuiltinType(_) => PerNs::types(def, v),
2019-12-22 08:08:57 -06:00
}
}
}
2019-12-30 10:31:15 -06:00
2019-12-30 15:51:37 -06:00
#[derive(Clone, Copy, PartialEq, Eq, Debug, Hash)]
2019-12-30 10:31:15 -06:00
pub enum ItemInNs {
Types(ModuleDefId),
Values(ModuleDefId),
Macros(MacroDefId),
}
impl ItemInNs {
fn match_with(self, per_ns: PerNs) -> Option<Visibility> {
match self {
ItemInNs::Types(def) => {
per_ns.types.filter(|(other_def, _)| *other_def == def).map(|(_, vis)| vis)
2019-12-30 15:51:37 -06:00
}
2019-12-30 10:31:15 -06:00
ItemInNs::Values(def) => {
per_ns.values.filter(|(other_def, _)| *other_def == def).map(|(_, vis)| vis)
2019-12-30 15:51:37 -06:00
}
2019-12-30 10:31:15 -06:00
ItemInNs::Macros(def) => {
per_ns.macros.filter(|(other_def, _)| *other_def == def).map(|(_, vis)| vis)
2019-12-30 15:51:37 -06:00
}
2019-12-30 10:31:15 -06:00
}
}
2019-12-30 14:33:25 -06:00
pub fn as_module_def_id(self) -> Option<ModuleDefId> {
match self {
2020-01-10 11:40:45 -06:00
ItemInNs::Types(id) | ItemInNs::Values(id) => Some(id),
2019-12-30 14:33:25 -06:00
ItemInNs::Macros(_) => None,
}
}
2020-06-05 06:05:19 -05:00
/// Returns the crate defining this item (or `None` if `self` is built-in).
pub fn krate(&self, db: &dyn DefDatabase) -> Option<CrateId> {
Some(match self {
ItemInNs::Types(did) | ItemInNs::Values(did) => match did {
ModuleDefId::ModuleId(id) => id.krate,
ModuleDefId::FunctionId(id) => id.lookup(db).module(db).krate,
ModuleDefId::AdtId(id) => id.module(db).krate,
ModuleDefId::EnumVariantId(id) => id.parent.lookup(db).container.module(db).krate,
ModuleDefId::ConstId(id) => id.lookup(db).container.module(db).krate,
ModuleDefId::StaticId(id) => id.lookup(db).container.module(db).krate,
ModuleDefId::TraitId(id) => id.lookup(db).container.module(db).krate,
ModuleDefId::TypeAliasId(id) => id.lookup(db).module(db).krate,
ModuleDefId::BuiltinType(_) => return None,
},
ItemInNs::Macros(id) => return id.krate,
})
}
2019-12-30 10:31:15 -06:00
}