1
Fork 0

Rename to nearest_parent_mod

* Rename `ModuleData.normal_ancestor_id` to `nearest_parent_mod`

`normal_ancestor_id` is a very confusing name if you don't already
understand what it means. Adding docs helps, but using a clearer and
more obvious name is also important.

* Rename `Resolver::nearest_mod_parent` to `nearest_parent_mod`

* Add more docs
This commit is contained in:
Camelid 2020-12-27 16:54:47 -08:00
parent 06931988c0
commit ff75da89b1
4 changed files with 35 additions and 27 deletions

View file

@ -96,7 +96,7 @@ impl<'a> Resolver<'a> {
/// Walks up the tree of definitions starting at `def_id`, /// Walks up the tree of definitions starting at `def_id`,
/// stopping at the first `DefKind::Mod` encountered /// stopping at the first `DefKind::Mod` encountered
fn nearest_mod_parent(&mut self, def_id: DefId) -> Module<'a> { fn nearest_parent_mod(&mut self, def_id: DefId) -> Module<'a> {
let def_key = self.cstore().def_key(def_id); let def_key = self.cstore().def_key(def_id);
let mut parent_id = DefId { let mut parent_id = DefId {
@ -137,7 +137,7 @@ impl<'a> Resolver<'a> {
.get_opt_name() .get_opt_name()
.expect("given a DefId that wasn't a module"); .expect("given a DefId that wasn't a module");
let parent = Some(self.nearest_mod_parent(def_id)); let parent = Some(self.nearest_parent_mod(def_id));
(name, parent) (name, parent)
}; };
@ -179,7 +179,7 @@ impl<'a> Resolver<'a> {
// so this hopefully won't be a problem. // so this hopefully won't be a problem.
// //
// See https://github.com/rust-lang/rust/pull/77984#issuecomment-712445508 // See https://github.com/rust-lang/rust/pull/77984#issuecomment-712445508
self.nearest_mod_parent(def_id) self.nearest_parent_mod(def_id)
} }
} }
@ -266,7 +266,7 @@ impl<'a, 'b> BuildReducedGraphVisitor<'a, 'b> {
} else { } else {
// If it's not in an enum, its visibility is restricted to the `mod` item // If it's not in an enum, its visibility is restricted to the `mod` item
// that it's defined in. // that it's defined in.
Ok(ty::Visibility::Restricted(self.parent_scope.module.normal_ancestor_id)) Ok(ty::Visibility::Restricted(self.parent_scope.module.nearest_parent_mod))
} }
} }
ast::VisibilityKind::Restricted { ref path, id, .. } => { ast::VisibilityKind::Restricted { ref path, id, .. } => {
@ -803,7 +803,7 @@ impl<'a, 'b> BuildReducedGraphVisitor<'a, 'b> {
let module = self.r.new_module( let module = self.r.new_module(
parent, parent,
module_kind, module_kind,
parent.normal_ancestor_id, parent.nearest_parent_mod,
expansion, expansion,
item.span, item.span,
); );
@ -878,7 +878,7 @@ impl<'a, 'b> BuildReducedGraphVisitor<'a, 'b> {
let module = self.r.new_module( let module = self.r.new_module(
parent, parent,
module_kind, module_kind,
parent.normal_ancestor_id, parent.nearest_parent_mod,
expansion, expansion,
item.span, item.span,
); );
@ -921,7 +921,7 @@ impl<'a, 'b> BuildReducedGraphVisitor<'a, 'b> {
let module = self.r.new_module( let module = self.r.new_module(
parent, parent,
ModuleKind::Block(block.id), ModuleKind::Block(block.id),
parent.normal_ancestor_id, parent.nearest_parent_mod,
expansion, expansion,
block.span, block.span,
); );

View file

@ -1775,7 +1775,7 @@ impl<'a: 'ast, 'b, 'ast> LateResolutionVisitor<'a, 'b, 'ast> {
if this.should_report_errs() { if this.should_report_errs() {
let (err, candidates) = this.smart_resolve_report_errors(path, span, source, res); let (err, candidates) = this.smart_resolve_report_errors(path, span, source, res);
let def_id = this.parent_scope.module.normal_ancestor_id; let def_id = this.parent_scope.module.nearest_parent_mod;
let instead = res.is_some(); let instead = res.is_some();
let suggestion = let suggestion =
if res.is_none() { this.report_missing_type_error(path) } else { None }; if res.is_none() { this.report_missing_type_error(path) } else { None };
@ -1843,7 +1843,7 @@ impl<'a: 'ast, 'b, 'ast> LateResolutionVisitor<'a, 'b, 'ast> {
drop(parent_err); drop(parent_err);
let def_id = this.parent_scope.module.normal_ancestor_id; let def_id = this.parent_scope.module.nearest_parent_mod;
if this.should_report_errs() { if this.should_report_errs() {
this.r.use_injections.push(UseError { this.r.use_injections.push(UseError {

View file

@ -422,7 +422,9 @@ enum ModuleKind {
/// ///
/// This could be: /// This could be:
/// ///
/// * A normal module either `mod from_file;` or `mod from_block { }`. /// * A normal module either `mod from_file;` or `mod from_block { }`
/// or the crate root (which is conceptually a top-level module).
/// Note that the crate root's [name][Self::name] will be [`kw::Empty`].
/// * A trait or an enum (it implicitly contains associated types, methods and variant /// * A trait or an enum (it implicitly contains associated types, methods and variant
/// constructors). /// constructors).
Def(DefKind, DefId, Symbol), Def(DefKind, DefId, Symbol),
@ -457,18 +459,24 @@ type Resolutions<'a> = RefCell<FxIndexMap<BindingKey, &'a RefCell<NameResolution
/// One node in the tree of modules. /// One node in the tree of modules.
/// ///
/// Note that "module" is a loose term here; it does not necessarily mean /// Note that a "module" in resolve is broader than a `mod` that you declare in Rust code. It may be one of these:
/// a `mod` that you declare in Rust code. It may also be, e.g., a trait ///
/// or an enum. See [`ModuleKind`] (accessible through [`ModuleData::kind`] /// * `mod`
/// for all of the kinds of "modules" that resolve deals with. /// * crate root (aka, top-level anonymous module)
/// * `enum`
/// * `trait`
/// * curly-braced block with statements
///
/// You can use [`ModuleData::kind`] to determine the kind of module this is.
pub struct ModuleData<'a> { pub struct ModuleData<'a> {
/// The direct parent module (it may not be a `mod`, however). /// The direct parent module (it may not be a `mod`, however).
parent: Option<Module<'a>>, parent: Option<Module<'a>>,
/// What kind of module this is, because this may not be a `mod`. /// What kind of module this is, because this may not be a `mod`.
kind: ModuleKind, kind: ModuleKind,
/// The [`DefId`] of the closest `mod` item ancestor (which may be this module), including crate root. /// The [`DefId`] of the nearest `mod` item ancestor (which may be this module).
normal_ancestor_id: DefId, /// This may be the crate root.
nearest_parent_mod: DefId,
/// Mapping between names and their (possibly in-progress) resolutions in this module. /// Mapping between names and their (possibly in-progress) resolutions in this module.
/// Resolutions in modules from other crates are not populated until accessed. /// Resolutions in modules from other crates are not populated until accessed.
@ -500,16 +508,16 @@ impl<'a> ModuleData<'a> {
fn new( fn new(
parent: Option<Module<'a>>, parent: Option<Module<'a>>,
kind: ModuleKind, kind: ModuleKind,
normal_ancestor_id: DefId, nearest_parent_mod: DefId,
expansion: ExpnId, expansion: ExpnId,
span: Span, span: Span,
) -> Self { ) -> Self {
ModuleData { ModuleData {
parent, parent,
kind, kind,
normal_ancestor_id, nearest_parent_mod,
lazy_resolutions: Default::default(), lazy_resolutions: Default::default(),
populate_on_access: Cell::new(!normal_ancestor_id.is_local()), populate_on_access: Cell::new(!nearest_parent_mod.is_local()),
unexpanded_invocations: Default::default(), unexpanded_invocations: Default::default(),
no_implicit_prelude: false, no_implicit_prelude: false,
glob_importers: RefCell::new(Vec::new()), glob_importers: RefCell::new(Vec::new()),
@ -1527,11 +1535,11 @@ impl<'a> Resolver<'a> {
&self, &self,
parent: Module<'a>, parent: Module<'a>,
kind: ModuleKind, kind: ModuleKind,
normal_ancestor_id: DefId, nearest_parent_mod: DefId,
expn_id: ExpnId, expn_id: ExpnId,
span: Span, span: Span,
) -> Module<'a> { ) -> Module<'a> {
let module = ModuleData::new(Some(parent), kind, normal_ancestor_id, expn_id, span); let module = ModuleData::new(Some(parent), kind, nearest_parent_mod, expn_id, span);
self.arenas.alloc_module(module) self.arenas.alloc_module(module)
} }
@ -2124,7 +2132,7 @@ impl<'a> Resolver<'a> {
return self.graph_root; return self.graph_root;
} }
}; };
let module = self.get_module(DefId { index: CRATE_DEF_INDEX, ..module.normal_ancestor_id }); let module = self.get_module(DefId { index: CRATE_DEF_INDEX, ..module.nearest_parent_mod });
debug!( debug!(
"resolve_crate_root({:?}): got module {:?} ({:?}) (ident.span = {:?})", "resolve_crate_root({:?}): got module {:?} ({:?}) (ident.span = {:?})",
ident, ident,
@ -2136,10 +2144,10 @@ impl<'a> Resolver<'a> {
} }
fn resolve_self(&mut self, ctxt: &mut SyntaxContext, module: Module<'a>) -> Module<'a> { fn resolve_self(&mut self, ctxt: &mut SyntaxContext, module: Module<'a>) -> Module<'a> {
let mut module = self.get_module(module.normal_ancestor_id); let mut module = self.get_module(module.nearest_parent_mod);
while module.span.ctxt().normalize_to_macros_2_0() != *ctxt { while module.span.ctxt().normalize_to_macros_2_0() != *ctxt {
let parent = module.parent.unwrap_or_else(|| self.macro_def_scope(ctxt.remove_mark())); let parent = module.parent.unwrap_or_else(|| self.macro_def_scope(ctxt.remove_mark()));
module = self.get_module(parent.normal_ancestor_id); module = self.get_module(parent.nearest_parent_mod);
} }
module module
} }
@ -2801,7 +2809,7 @@ impl<'a> Resolver<'a> {
} }
fn is_accessible_from(&self, vis: ty::Visibility, module: Module<'a>) -> bool { fn is_accessible_from(&self, vis: ty::Visibility, module: Module<'a>) -> bool {
vis.is_accessible_from(module.normal_ancestor_id, self) vis.is_accessible_from(module.nearest_parent_mod, self)
} }
fn set_binding_parent_module(&mut self, binding: &'a NameBinding<'a>, module: Module<'a>) { fn set_binding_parent_module(&mut self, binding: &'a NameBinding<'a>, module: Module<'a>) {
@ -2825,7 +2833,7 @@ impl<'a> Resolver<'a> {
self.binding_parent_modules.get(&PtrKey(modularized)), self.binding_parent_modules.get(&PtrKey(modularized)),
) { ) {
(Some(macro_rules), Some(modularized)) => { (Some(macro_rules), Some(modularized)) => {
macro_rules.normal_ancestor_id == modularized.normal_ancestor_id macro_rules.nearest_parent_mod == modularized.nearest_parent_mod
&& modularized.is_ancestor_of(macro_rules) && modularized.is_ancestor_of(macro_rules)
} }
_ => false, _ => false,

View file

@ -328,7 +328,7 @@ impl<'a> ResolverExpand for Resolver<'a> {
if after_derive { if after_derive {
self.session.span_err(span, "macro attributes must be placed before `#[derive]`"); self.session.span_err(span, "macro attributes must be placed before `#[derive]`");
} }
let normal_module_def_id = self.macro_def_scope(invoc_id).normal_ancestor_id; let normal_module_def_id = self.macro_def_scope(invoc_id).nearest_parent_mod;
self.definitions.add_parent_module_of_macro_def(invoc_id, normal_module_def_id); self.definitions.add_parent_module_of_macro_def(invoc_id, normal_module_def_id);
} }