rust/crates/hir_def/src/nameres.rs

635 lines
22 KiB
Rust
Raw Normal View History

2019-11-03 14:49:44 -06:00
//! This module implements import-resolution/macro expansion algorithm.
//!
//! The result of this module is `CrateDefMap`: a data structure which contains:
//!
//! * a tree of modules for the crate
//! * for each module, a set of items visible in the module (directly declared
//! or imported)
//!
//! Note that `CrateDefMap` contains fully macro expanded code.
//!
//! Computing `CrateDefMap` can be partitioned into several logically
//! independent "phases". The phases are mutually recursive though, there's no
//! strict ordering.
//!
//! ## Collecting RawItems
//!
2019-11-08 15:23:19 -06:00
//! This happens in the `raw` module, which parses a single source file into a
//! set of top-level items. Nested imports are desugared to flat imports in this
//! phase. Macro calls are represented as a triple of (Path, Option<Name>,
//! TokenTree).
2019-11-03 14:49:44 -06:00
//!
//! ## Collecting Modules
//!
//! This happens in the `collector` module. In this phase, we recursively walk
//! tree of modules, collect raw items from submodules, populate module scopes
//! with defined items (so, we assign item ids in this phase) and record the set
//! of unresolved imports and macros.
//!
//! While we walk tree of modules, we also record macro_rules definitions and
//! expand calls to macro_rules defined macros.
//!
//! ## Resolving Imports
//!
//! We maintain a list of currently unresolved imports. On every iteration, we
//! try to resolve some imports from this list. If the import is resolved, we
//! record it, by adding an item to current module scope and, if necessary, by
//! recursively populating glob imports.
//!
//! ## Resolving Macros
//!
//! macro_rules from the same crate use a global mutable namespace. We expand
//! them immediately, when we collect modules.
//!
//! Macros from other crates (including proc-macros) can be used with
//! `foo::bar!` syntax. We handle them similarly to imports. There's a list of
//! unexpanded macros. On every iteration, we try to resolve each macro call
2019-11-08 15:23:19 -06:00
//! path and, upon success, we run macro expansion and "collect module" phase on
//! the result
2019-10-30 09:40:13 -05:00
2019-11-04 12:42:25 -06:00
mod collector;
mod mod_resolution;
2019-11-08 15:17:17 -06:00
mod path_resolution;
2019-10-31 10:45:10 -05:00
2019-11-03 14:35:48 -06:00
#[cfg(test)]
mod tests;
2019-10-31 10:45:10 -05:00
use std::sync::Arc;
2020-08-13 09:25:38 -05:00
use base_db::{CrateId, Edition, FileId};
2019-12-20 08:43:45 -06:00
use hir_expand::{diagnostics::DiagnosticSink, name::Name, InFile};
2021-01-14 09:47:42 -06:00
use la_arena::Arena;
use profile::Count;
2019-11-24 04:57:45 -06:00
use rustc_hash::FxHashMap;
2020-03-28 05:08:19 -05:00
use stdx::format_to;
use syntax::ast;
2019-10-31 10:45:10 -05:00
use crate::{
2019-11-23 05:44:43 -06:00
db::DefDatabase,
2019-12-20 08:45:12 -06:00
item_scope::{BuiltinShadowMode, ItemScope},
2019-11-23 07:53:16 -06:00
nameres::{diagnostics::DefDiagnostic, path_resolution::ResolveMode},
path::ModPath,
2019-11-23 07:53:16 -06:00
per_ns::PerNs,
AstId, BlockId, BlockLoc, LocalModuleId, ModuleDefId, ModuleId,
2019-10-31 10:45:10 -05:00
};
/// Contains the results of (early) name resolution.
///
/// A `DefMap` stores the module tree and the definitions that are in scope in every module after
/// item-level macros have been expanded.
///
/// Every crate has a primary `DefMap` whose root is the crate's main file (`main.rs`/`lib.rs`),
/// computed by the `crate_def_map` query. Additionally, every block expression introduces the
/// opportunity to write arbitrary item and module hierarchies, and thus gets its own `DefMap` that
/// is computed by the `block_def_map` query.
2019-10-31 10:45:10 -05:00
#[derive(Debug, PartialEq, Eq)]
2021-01-18 13:18:05 -06:00
pub struct DefMap {
_c: Count<Self>,
block: Option<BlockInfo>,
2021-01-20 08:41:18 -06:00
root: LocalModuleId,
modules: Arena<ModuleData>,
krate: CrateId,
2019-10-31 10:45:10 -05:00
/// The prelude module for this crate. This either comes from an import
/// marked with the `prelude_import` attribute, or (in the normal case) from
/// a dependency (`std` or `core`).
prelude: Option<ModuleId>,
extern_prelude: FxHashMap<Name, ModuleDefId>,
2019-10-31 10:45:10 -05:00
2019-11-24 09:05:12 -06:00
edition: Edition,
2019-10-31 10:45:10 -05:00
diagnostics: Vec<DefDiagnostic>,
}
/// For `DefMap`s computed for a block expression, this stores its location in the parent map.
#[derive(Debug, PartialEq, Eq, Clone, Copy)]
struct BlockInfo {
/// The `BlockId` this `DefMap` was created from.
block: BlockId,
/// The containing module.
parent: ModuleId,
}
2021-01-18 13:18:05 -06:00
impl std::ops::Index<LocalModuleId> for DefMap {
2019-10-31 10:45:10 -05:00
type Output = ModuleData;
2019-11-23 07:49:53 -06:00
fn index(&self, id: LocalModuleId) -> &ModuleData {
2019-10-31 10:45:10 -05:00
&self.modules[id]
}
}
2019-12-03 13:58:29 -06:00
#[derive(Debug, PartialEq, Eq, Clone, Copy, Hash)]
pub enum ModuleOrigin {
2019-12-05 07:33:29 -06:00
CrateRoot {
definition: FileId,
},
2019-12-03 13:58:29 -06:00
/// Note that non-inline modules, by definition, live inside non-macro file.
File {
2020-06-11 04:04:09 -05:00
is_mod_rs: bool,
declaration: AstId<ast::Module>,
definition: FileId,
},
Inline {
definition: AstId<ast::Module>,
},
/// Pseudo-module introduced by a block scope (contains only inner items).
BlockExpr {
block: AstId<ast::BlockExpr>,
},
2019-12-03 13:58:29 -06:00
}
impl Default for ModuleOrigin {
fn default() -> Self {
2019-12-05 07:33:29 -06:00
ModuleOrigin::CrateRoot { definition: FileId(0) }
2019-12-03 13:58:29 -06:00
}
}
impl ModuleOrigin {
fn declaration(&self) -> Option<AstId<ast::Module>> {
2019-12-03 13:58:29 -06:00
match self {
ModuleOrigin::File { declaration: module, .. }
| ModuleOrigin::Inline { definition: module, .. } => Some(*module),
ModuleOrigin::CrateRoot { .. } | ModuleOrigin::BlockExpr { .. } => None,
2019-12-03 13:58:29 -06:00
}
}
pub fn file_id(&self) -> Option<FileId> {
2019-12-03 13:58:29 -06:00
match self {
2019-12-05 07:33:29 -06:00
ModuleOrigin::File { definition, .. } | ModuleOrigin::CrateRoot { definition } => {
Some(*definition)
}
2019-12-03 13:58:29 -06:00
_ => None,
}
}
pub fn is_inline(&self) -> bool {
match self {
ModuleOrigin::Inline { .. } | ModuleOrigin::BlockExpr { .. } => true,
ModuleOrigin::CrateRoot { .. } | ModuleOrigin::File { .. } => false,
}
}
2019-12-03 13:58:29 -06:00
/// Returns a node which defines this module.
/// That is, a file or a `mod foo {}` with items.
fn definition_source(&self, db: &dyn DefDatabase) -> InFile<ModuleSource> {
2019-12-03 13:58:29 -06:00
match self {
2019-12-05 07:33:29 -06:00
ModuleOrigin::File { definition, .. } | ModuleOrigin::CrateRoot { definition } => {
let file_id = *definition;
2019-12-03 13:58:29 -06:00
let sf = db.parse(file_id).tree();
InFile::new(file_id.into(), ModuleSource::SourceFile(sf))
2019-12-03 13:58:29 -06:00
}
ModuleOrigin::Inline { definition } => InFile::new(
definition.file_id,
ModuleSource::Module(definition.to_node(db.upcast())),
),
ModuleOrigin::BlockExpr { block } => {
InFile::new(block.file_id, ModuleSource::BlockExpr(block.to_node(db.upcast())))
}
2019-12-03 13:58:29 -06:00
}
}
}
2019-10-31 10:45:10 -05:00
#[derive(Default, Debug, PartialEq, Eq)]
pub struct ModuleData {
2019-11-23 07:49:53 -06:00
pub parent: Option<LocalModuleId>,
pub children: FxHashMap<Name, LocalModuleId>,
2019-12-20 08:45:12 -06:00
pub scope: ItemScope,
2019-11-23 02:14:10 -06:00
2019-12-03 13:58:29 -06:00
/// Where does this module come from?
pub origin: ModuleOrigin,
2019-10-31 10:45:10 -05:00
}
2021-01-18 13:18:05 -06:00
impl DefMap {
pub(crate) fn crate_def_map_query(db: &dyn DefDatabase, krate: CrateId) -> Arc<DefMap> {
2020-08-12 09:32:36 -05:00
let _p = profile::span("crate_def_map_query").detail(|| {
db.crate_graph()[krate].display_name.as_deref().unwrap_or_default().to_string()
2020-03-16 04:47:52 -05:00
});
let edition = db.crate_graph()[krate].edition;
let def_map = DefMap::empty(krate, edition);
let def_map = collector::collect_defs(db, def_map, None);
Arc::new(def_map)
}
pub(crate) fn block_def_map_query(
db: &dyn DefDatabase,
block_id: BlockId,
) -> Option<Arc<DefMap>> {
let block: BlockLoc = db.lookup_intern_block(block_id);
let item_tree = db.file_item_tree(block.ast_id.file_id);
if item_tree.inner_items_of_block(block.ast_id.value).is_empty() {
return None;
}
let block_info = BlockInfo { block: block_id, parent: block.module };
let parent_map = block.module.def_map(db);
let mut def_map = DefMap::empty(block.module.krate, parent_map.edition);
def_map.block = Some(block_info);
let def_map = collector::collect_defs(db, def_map, Some(block.ast_id));
Some(Arc::new(def_map))
2019-10-31 10:45:10 -05:00
}
fn empty(krate: CrateId, edition: Edition) -> DefMap {
let mut modules: Arena<ModuleData> = Arena::default();
let root = modules.alloc(ModuleData::default());
DefMap {
_c: Count::new(),
block: None,
krate,
edition,
extern_prelude: FxHashMap::default(),
prelude: None,
root,
modules,
diagnostics: Vec::new(),
}
}
2019-10-31 10:45:10 -05:00
pub fn add_diagnostics(
&self,
db: &dyn DefDatabase,
2019-11-23 07:49:53 -06:00
module: LocalModuleId,
2019-10-31 10:45:10 -05:00
sink: &mut DiagnosticSink,
) {
self.diagnostics.iter().for_each(|it| it.add_to(db, module, sink))
}
2019-11-23 07:49:53 -06:00
pub fn modules_for_file(&self, file_id: FileId) -> impl Iterator<Item = LocalModuleId> + '_ {
self.modules
.iter()
2019-12-03 13:58:29 -06:00
.filter(move |(_id, data)| data.origin.file_id() == Some(file_id))
.map(|(id, _data)| id)
}
2019-11-24 04:34:27 -06:00
2021-01-20 08:41:18 -06:00
pub fn modules(&self) -> impl Iterator<Item = (LocalModuleId, &ModuleData)> + '_ {
self.modules.iter()
}
pub fn root(&self) -> LocalModuleId {
self.root
}
pub(crate) fn krate(&self) -> CrateId {
self.krate
}
pub(crate) fn block_id(&self) -> Option<BlockId> {
self.block.as_ref().map(|block| block.block)
}
pub(crate) fn prelude(&self) -> Option<ModuleId> {
self.prelude
}
pub(crate) fn extern_prelude(&self) -> impl Iterator<Item = (&Name, &ModuleDefId)> + '_ {
self.extern_prelude.iter()
}
pub fn module_id(&self, local_id: LocalModuleId) -> ModuleId {
let block = self.block.as_ref().map(|b| b.block);
ModuleId { krate: self.krate, local_id, block }
}
pub(crate) fn crate_root(&self, db: &dyn DefDatabase) -> ModuleId {
self.with_ancestor_maps(db, self.root, &mut |def_map, _module| {
if def_map.block.is_none() {
Some(def_map.module_id(def_map.root))
} else {
None
}
})
.expect("DefMap chain without root")
}
2019-11-24 04:34:27 -06:00
pub(crate) fn resolve_path(
&self,
db: &dyn DefDatabase,
2019-11-24 04:34:27 -06:00
original_module: LocalModuleId,
path: &ModPath,
2019-11-30 09:29:21 -06:00
shadow: BuiltinShadowMode,
2019-11-24 04:34:27 -06:00
) -> (PerNs, Option<usize>) {
2019-11-30 09:29:21 -06:00
let res =
self.resolve_path_fp_with_macro(db, ResolveMode::Other, original_module, path, shadow);
2019-11-24 04:34:27 -06:00
(res.resolved_def, res.segment_index)
}
/// Ascends the `DefMap` hierarchy and calls `f` with every `DefMap` and containing module.
///
/// If `f` returns `Some(val)`, iteration is stopped and `Some(val)` is returned. If `f` returns
/// `None`, iteration continues.
2021-02-09 10:23:25 -06:00
pub fn with_ancestor_maps<T>(
&self,
db: &dyn DefDatabase,
local_mod: LocalModuleId,
f: &mut dyn FnMut(&DefMap, LocalModuleId) -> Option<T>,
) -> Option<T> {
if let Some(it) = f(self, local_mod) {
return Some(it);
}
let mut block = self.block;
while let Some(block_info) = block {
let parent = block_info.parent.def_map(db);
if let Some(it) = f(&parent, block_info.parent.local_id) {
return Some(it);
}
block = parent.block;
}
None
}
/// If this `DefMap` is for a block expression, returns the module containing the block (which
/// might again be a block, or a module inside a block).
pub fn parent(&self) -> Option<ModuleId> {
Some(self.block?.parent)
}
/// Returns the module containing `local_mod`, either the parent `mod`, or the module containing
/// the block, if `self` corresponds to a block expression.
pub fn containing_module(&self, local_mod: LocalModuleId) -> Option<ModuleId> {
match &self[local_mod].parent {
Some(parent) => Some(self.module_id(*parent)),
None => match &self.block {
Some(block) => Some(block.parent),
None => None,
},
}
}
// FIXME: this can use some more human-readable format (ideally, an IR
// even), as this should be a great debugging aid.
pub fn dump(&self, db: &dyn DefDatabase) -> String {
let mut buf = String::new();
let mut arc;
let mut current_map = self;
while let Some(block) = &current_map.block {
go(&mut buf, current_map, "block scope", current_map.root);
buf.push('\n');
arc = block.parent.def_map(db);
current_map = &*arc;
}
go(&mut buf, current_map, "crate", current_map.root);
2020-07-20 10:44:44 -05:00
return buf;
2021-01-18 13:18:05 -06:00
fn go(buf: &mut String, map: &DefMap, path: &str, module: LocalModuleId) {
2020-07-20 10:44:44 -05:00
format_to!(buf, "{}\n", path);
map.modules[module].scope.dump(buf);
for (name, child) in map.modules[module].children.iter() {
2020-07-20 10:44:44 -05:00
let path = format!("{}::{}", path, name);
buf.push('\n');
go(buf, map, &path, *child);
}
}
}
2019-10-31 10:45:10 -05:00
}
2019-11-23 02:14:10 -06:00
impl ModuleData {
/// Returns a node which defines this module. That is, a file or a `mod foo {}` with items.
pub fn definition_source(&self, db: &dyn DefDatabase) -> InFile<ModuleSource> {
2019-12-03 13:58:29 -06:00
self.origin.definition_source(db)
2019-11-23 02:14:10 -06:00
}
/// Returns a node which declares this module, either a `mod foo;` or a `mod foo {}`.
2019-12-03 13:58:29 -06:00
/// `None` for the crate root or block.
pub fn declaration_source(&self, db: &dyn DefDatabase) -> Option<InFile<ast::Module>> {
2019-12-03 13:58:29 -06:00
let decl = self.origin.declaration()?;
let value = decl.to_node(db.upcast());
2019-11-28 07:00:03 -06:00
Some(InFile { file_id: decl.file_id, value })
2019-11-23 02:14:10 -06:00
}
}
#[derive(Debug, Clone, PartialEq, Eq)]
2019-12-03 14:24:02 -06:00
pub enum ModuleSource {
SourceFile(ast::SourceFile),
Module(ast::Module),
BlockExpr(ast::BlockExpr),
2019-12-03 14:24:02 -06:00
}
2019-10-31 10:45:10 -05:00
mod diagnostics {
2020-10-22 12:19:18 -05:00
use cfg::{CfgExpr, CfgOptions};
2019-10-31 10:45:10 -05:00
use hir_expand::diagnostics::DiagnosticSink;
use hir_expand::hygiene::Hygiene;
use hir_expand::{InFile, MacroCallKind};
use syntax::ast::AttrsOwner;
use syntax::{ast, AstNode, AstPtr, SyntaxKind, SyntaxNodePtr};
2019-10-31 10:45:10 -05:00
use crate::path::ModPath;
use crate::{db::DefDatabase, diagnostics::*, nameres::LocalModuleId, AstId};
2019-10-31 10:45:10 -05:00
#[derive(Debug, PartialEq, Eq)]
enum DiagnosticKind {
UnresolvedModule { declaration: AstId<ast::Module>, candidate: String },
UnresolvedExternCrate { ast: AstId<ast::ExternCrate> },
UnresolvedImport { ast: AstId<ast::Use>, index: usize },
UnconfiguredCode { ast: AstId<ast::Item>, cfg: CfgExpr, opts: CfgOptions },
UnresolvedProcMacro { ast: MacroCallKind },
UnresolvedMacroCall { ast: AstId<ast::MacroCall> },
MacroError { ast: MacroCallKind, message: String },
}
#[derive(Debug, PartialEq, Eq)]
pub(super) struct DefDiagnostic {
in_module: LocalModuleId,
kind: DiagnosticKind,
2019-10-31 10:45:10 -05:00
}
impl DefDiagnostic {
pub(super) fn unresolved_module(
container: LocalModuleId,
declaration: AstId<ast::Module>,
candidate: String,
) -> Self {
Self {
in_module: container,
kind: DiagnosticKind::UnresolvedModule { declaration, candidate },
}
}
pub(super) fn unresolved_extern_crate(
container: LocalModuleId,
declaration: AstId<ast::ExternCrate>,
) -> Self {
Self {
in_module: container,
kind: DiagnosticKind::UnresolvedExternCrate { ast: declaration },
}
}
pub(super) fn unresolved_import(
container: LocalModuleId,
ast: AstId<ast::Use>,
index: usize,
) -> Self {
Self { in_module: container, kind: DiagnosticKind::UnresolvedImport { ast, index } }
}
pub(super) fn unconfigured_code(
container: LocalModuleId,
ast: AstId<ast::Item>,
2020-10-22 12:19:18 -05:00
cfg: CfgExpr,
opts: CfgOptions,
) -> Self {
2020-10-22 12:19:18 -05:00
Self { in_module: container, kind: DiagnosticKind::UnconfiguredCode { ast, cfg, opts } }
}
pub(super) fn unresolved_proc_macro(container: LocalModuleId, ast: MacroCallKind) -> Self {
Self { in_module: container, kind: DiagnosticKind::UnresolvedProcMacro { ast } }
}
pub(super) fn macro_error(
container: LocalModuleId,
ast: MacroCallKind,
message: String,
) -> Self {
Self { in_module: container, kind: DiagnosticKind::MacroError { ast, message } }
}
pub(super) fn unresolved_macro_call(
container: LocalModuleId,
ast: AstId<ast::MacroCall>,
) -> Self {
Self { in_module: container, kind: DiagnosticKind::UnresolvedMacroCall { ast } }
}
2019-10-31 10:45:10 -05:00
pub(super) fn add_to(
&self,
db: &dyn DefDatabase,
2019-11-23 07:49:53 -06:00
target_module: LocalModuleId,
2019-10-31 10:45:10 -05:00
sink: &mut DiagnosticSink,
) {
if self.in_module != target_module {
return;
}
match &self.kind {
DiagnosticKind::UnresolvedModule { declaration, candidate } => {
let decl = declaration.to_node(db.upcast());
2019-10-31 10:45:10 -05:00
sink.push(UnresolvedModule {
2019-11-28 07:00:03 -06:00
file: declaration.file_id,
2019-10-31 10:45:10 -05:00
decl: AstPtr::new(&decl),
candidate: candidate.clone(),
})
}
DiagnosticKind::UnresolvedExternCrate { ast } => {
let item = ast.to_node(db.upcast());
sink.push(UnresolvedExternCrate {
file: ast.file_id,
item: AstPtr::new(&item),
});
}
DiagnosticKind::UnresolvedImport { ast, index } => {
let use_item = ast.to_node(db.upcast());
let hygiene = Hygiene::new(db.upcast(), ast.file_id);
let mut cur = 0;
let mut tree = None;
ModPath::expand_use_item(
InFile::new(ast.file_id, use_item),
&hygiene,
|_mod_path, use_tree, _is_glob, _alias| {
if cur == *index {
tree = Some(use_tree.clone());
}
cur += 1;
},
);
if let Some(tree) = tree {
sink.push(UnresolvedImport { file: ast.file_id, node: AstPtr::new(&tree) });
}
}
2020-10-22 12:19:18 -05:00
DiagnosticKind::UnconfiguredCode { ast, cfg, opts } => {
let item = ast.to_node(db.upcast());
2020-10-22 12:19:18 -05:00
sink.push(InactiveCode {
file: ast.file_id,
node: AstPtr::new(&item).into(),
2020-10-22 12:19:18 -05:00
cfg: cfg.clone(),
opts: opts.clone(),
});
}
DiagnosticKind::UnresolvedProcMacro { ast } => {
let mut precise_location = None;
let (file, ast, name) = match ast {
MacroCallKind::FnLike(ast) => {
let node = ast.to_node(db.upcast());
(ast.file_id, SyntaxNodePtr::from(AstPtr::new(&node)), None)
}
MacroCallKind::Attr(ast, name) => {
let node = ast.to_node(db.upcast());
// Compute the precise location of the macro name's token in the derive
// list.
// FIXME: This does not handle paths to the macro, but neither does the
// rest of r-a.
let derive_attrs =
node.attrs().filter_map(|attr| match attr.as_simple_call() {
Some((name, args)) if name == "derive" => Some(args),
_ => None,
});
'outer: for attr in derive_attrs {
let tokens =
attr.syntax().children_with_tokens().filter_map(|elem| {
match elem {
syntax::NodeOrToken::Node(_) => None,
syntax::NodeOrToken::Token(tok) => Some(tok),
}
});
for token in tokens {
if token.kind() == SyntaxKind::IDENT
&& token.text() == name.as_str()
{
precise_location = Some(token.text_range());
break 'outer;
}
}
}
(
ast.file_id,
SyntaxNodePtr::from(AstPtr::new(&node)),
Some(name.clone()),
)
}
};
sink.push(UnresolvedProcMacro {
file,
node: ast,
precise_location,
macro_name: name,
});
}
DiagnosticKind::UnresolvedMacroCall { ast } => {
let node = ast.to_node(db.upcast());
sink.push(UnresolvedMacroCall { file: ast.file_id, node: AstPtr::new(&node) });
}
DiagnosticKind::MacroError { ast, message } => {
let (file, ast) = match ast {
MacroCallKind::FnLike(ast) => {
let node = ast.to_node(db.upcast());
(ast.file_id, SyntaxNodePtr::from(AstPtr::new(&node)))
}
MacroCallKind::Attr(ast, _) => {
let node = ast.to_node(db.upcast());
(ast.file_id, SyntaxNodePtr::from(AstPtr::new(&node)))
}
};
sink.push(MacroError { file, node: ast, message: message.clone() });
}
2019-10-31 10:45:10 -05:00
}
}
}
}