1 // ignore-tidy-filelength
3 //! This crate is responsible for the part of name resolution that doesn't require type checker.
5 //! Module structure of the crate is built here.
6 //! Paths in macros, imports, expressions, types, patterns are resolved here.
7 //! Label and lifetime names are resolved here as well.
9 //! Type-relative name resolution (methods, fields, associated items) happens in `librustc_typeck`.
11 #![doc(html_root_url = "https://doc.rust-lang.org/nightly/nightly-rustc/")]
12 #![feature(bool_to_option)]
13 #![feature(crate_visibility_modifier)]
14 #![feature(format_args_capture)]
16 #![feature(or_patterns)]
17 #![recursion_limit = "256"]
19 pub use rustc_hir::def::{Namespace, PerNS};
23 use rustc_arena::{DroplessArena, TypedArena};
24 use rustc_ast::node_id::NodeMap;
25 use rustc_ast::unwrap_or;
26 use rustc_ast::visit::{self, Visitor};
27 use rustc_ast::{self as ast, FloatTy, IntTy, NodeId, UintTy};
28 use rustc_ast::{Crate, CRATE_NODE_ID};
29 use rustc_ast::{ItemKind, Path};
30 use rustc_ast_lowering::ResolverAstLowering;
31 use rustc_ast_pretty::pprust;
32 use rustc_data_structures::fx::{FxHashMap, FxHashSet, FxIndexMap};
33 use rustc_data_structures::ptr_key::PtrKey;
34 use rustc_data_structures::sync::Lrc;
35 use rustc_errors::{struct_span_err, Applicability, DiagnosticBuilder};
36 use rustc_expand::base::SyntaxExtension;
37 use rustc_hir::def::Namespace::*;
38 use rustc_hir::def::{self, CtorOf, DefKind, NonMacroAttrKind, PartialRes};
39 use rustc_hir::def_id::{CrateNum, DefId, DefIdMap, LocalDefId, CRATE_DEF_INDEX};
40 use rustc_hir::definitions::{DefKey, DefPathData, Definitions};
41 use rustc_hir::PrimTy::{self, Bool, Char, Float, Int, Str, Uint};
42 use rustc_hir::TraitCandidate;
43 use rustc_index::vec::IndexVec;
44 use rustc_metadata::creader::{CStore, CrateLoader};
45 use rustc_middle::hir::exports::ExportMap;
46 use rustc_middle::middle::cstore::{CrateStore, MetadataLoaderDyn};
47 use rustc_middle::ty::query::Providers;
48 use rustc_middle::ty::{self, DefIdTree, ResolverOutputs};
49 use rustc_middle::{bug, span_bug};
50 use rustc_session::lint;
51 use rustc_session::lint::{BuiltinLintDiagnostics, LintBuffer};
52 use rustc_session::Session;
53 use rustc_span::hygiene::{ExpnId, ExpnKind, MacroKind, SyntaxContext, Transparency};
54 use rustc_span::source_map::Spanned;
55 use rustc_span::symbol::{kw, sym, Ident, Symbol};
56 use rustc_span::{Span, DUMMY_SP};
58 use smallvec::{smallvec, SmallVec};
59 use std::cell::{Cell, RefCell};
60 use std::collections::BTreeSet;
61 use std::{cmp, fmt, iter, ptr};
64 use diagnostics::{extend_span_to_previous_binding, find_span_of_binding_until_next_binding};
65 use diagnostics::{ImportSuggestion, LabelSuggestion, Suggestion};
66 use imports::{Import, ImportKind, ImportResolver, NameResolution};
67 use late::{ConstantItemKind, HasGenericParams, PathSource, Rib, RibKind::*};
68 use macros::{MacroRulesBinding, MacroRulesScope, MacroRulesScopeRef};
70 type Res = def::Res<NodeId>;
72 mod build_reduced_graph;
85 #[derive(Copy, Clone, PartialEq, Debug)]
86 pub enum Determinacy {
92 fn determined(determined: bool) -> Determinacy {
93 if determined { Determinacy::Determined } else { Determinacy::Undetermined }
97 /// A specific scope in which a name can be looked up.
98 /// This enum is currently used only for early resolution (imports and macros),
99 /// but not for late resolution yet.
100 #[derive(Clone, Copy)]
102 DeriveHelpers(ExpnId),
104 MacroRules(MacroRulesScopeRef<'a>),
116 /// Names from different contexts may want to visit different subsets of all specific scopes
117 /// with different restrictions when looking up the resolution.
118 /// This enum is currently used only for early resolution (imports and macros),
119 /// but not for late resolution yet.
121 /// All scopes with the given namespace.
122 All(Namespace, /*is_import*/ bool),
123 /// Crate root, then extern prelude (used for mixed 2015-2018 mode in macros).
124 AbsolutePath(Namespace),
125 /// All scopes with macro namespace and the given macro kind restriction.
129 /// Everything you need to know about a name's location to resolve it.
130 /// Serves as a starting point for the scope visitor.
131 /// This struct is currently used only for early resolution (imports and macros),
132 /// but not for late resolution yet.
133 #[derive(Clone, Copy, Debug)]
134 pub struct ParentScope<'a> {
137 macro_rules: MacroRulesScopeRef<'a>,
138 derives: &'a [ast::Path],
141 impl<'a> ParentScope<'a> {
142 /// Creates a parent scope with the passed argument used as the module scope component,
143 /// and other scope components set to default empty values.
144 pub fn module(module: Module<'a>, resolver: &Resolver<'a>) -> ParentScope<'a> {
147 expansion: ExpnId::root(),
148 macro_rules: resolver.arenas.alloc_macro_rules_scope(MacroRulesScope::Empty),
155 struct BindingError {
157 origin: BTreeSet<Span>,
158 target: BTreeSet<Span>,
162 impl PartialOrd for BindingError {
163 fn partial_cmp(&self, other: &BindingError) -> Option<cmp::Ordering> {
164 Some(self.cmp(other))
168 impl PartialEq for BindingError {
169 fn eq(&self, other: &BindingError) -> bool {
170 self.name == other.name
174 impl Ord for BindingError {
175 fn cmp(&self, other: &BindingError) -> cmp::Ordering {
176 self.name.cmp(&other.name)
180 enum ResolutionError<'a> {
181 /// Error E0401: can't use type or const parameters from outer function.
182 GenericParamsFromOuterFunction(Res, HasGenericParams),
183 /// Error E0403: the name is already used for a type or const parameter in this generic
185 NameAlreadyUsedInParameterList(Symbol, Span),
186 /// Error E0407: method is not a member of trait.
187 MethodNotMemberOfTrait(Symbol, &'a str),
188 /// Error E0437: type is not a member of trait.
189 TypeNotMemberOfTrait(Symbol, &'a str),
190 /// Error E0438: const is not a member of trait.
191 ConstNotMemberOfTrait(Symbol, &'a str),
192 /// Error E0408: variable `{}` is not bound in all patterns.
193 VariableNotBoundInPattern(&'a BindingError),
194 /// Error E0409: variable `{}` is bound in inconsistent ways within the same match arm.
195 VariableBoundWithDifferentMode(Symbol, Span),
196 /// Error E0415: identifier is bound more than once in this parameter list.
197 IdentifierBoundMoreThanOnceInParameterList(Symbol),
198 /// Error E0416: identifier is bound more than once in the same pattern.
199 IdentifierBoundMoreThanOnceInSamePattern(Symbol),
200 /// Error E0426: use of undeclared label.
201 UndeclaredLabel { name: Symbol, suggestion: Option<LabelSuggestion> },
202 /// Error E0429: `self` imports are only allowed within a `{ }` list.
203 SelfImportsOnlyAllowedWithin { root: bool, span_with_rename: Span },
204 /// Error E0430: `self` import can only appear once in the list.
205 SelfImportCanOnlyAppearOnceInTheList,
206 /// Error E0431: `self` import can only appear in an import list with a non-empty prefix.
207 SelfImportOnlyInImportListWithNonEmptyPrefix,
208 /// Error E0433: failed to resolve.
209 FailedToResolve { label: String, suggestion: Option<Suggestion> },
210 /// Error E0434: can't capture dynamic environment in a fn item.
211 CannotCaptureDynamicEnvironmentInFnItem,
212 /// Error E0435: attempt to use a non-constant value in a constant.
213 AttemptToUseNonConstantValueInConstant(Ident, String),
214 /// Error E0530: `X` bindings cannot shadow `Y`s.
215 BindingShadowsSomethingUnacceptable(&'static str, Symbol, &'a NameBinding<'a>),
216 /// Error E0128: type parameters with a default cannot use forward-declared identifiers.
217 ForwardDeclaredTyParam, // FIXME(const_generics_defaults)
218 /// ERROR E0770: the type of const parameters must not depend on other generic parameters.
219 ParamInTyOfConstParam(Symbol),
220 /// constant values inside of type parameter defaults must not depend on generic parameters.
221 ParamInAnonConstInTyDefault(Symbol),
222 /// generic parameters must not be used inside const evaluations.
224 /// This error is only emitted when using `min_const_generics`.
225 ParamInNonTrivialAnonConst { name: Symbol, is_type: bool },
226 /// Error E0735: type parameters with a default cannot use `Self`
227 SelfInTyParamDefault,
228 /// Error E0767: use of unreachable label
229 UnreachableLabel { name: Symbol, definition_span: Span, suggestion: Option<LabelSuggestion> },
232 enum VisResolutionError<'a> {
233 Relative2018(Span, &'a ast::Path),
235 FailedToResolve(Span, String, Option<Suggestion>),
236 ExpectedFound(Span, String, Res),
241 /// A minimal representation of a path segment. We use this in resolve because we synthesize 'path
242 /// segments' which don't have the rest of an AST or HIR `PathSegment`.
243 #[derive(Clone, Copy, Debug)]
247 /// Signals whether this `PathSegment` has generic arguments. Used to avoid providing
248 /// nonsensical suggestions.
249 has_generic_args: bool,
253 fn from_path(path: &Path) -> Vec<Segment> {
254 path.segments.iter().map(|s| s.into()).collect()
257 fn from_ident(ident: Ident) -> Segment {
258 Segment { ident, id: None, has_generic_args: false }
261 fn names_to_string(segments: &[Segment]) -> String {
262 names_to_string(&segments.iter().map(|seg| seg.ident.name).collect::<Vec<_>>())
266 impl<'a> From<&'a ast::PathSegment> for Segment {
267 fn from(seg: &'a ast::PathSegment) -> Segment {
268 Segment { ident: seg.ident, id: Some(seg.id), has_generic_args: seg.args.is_some() }
272 struct UsePlacementFinder {
273 target_module: NodeId,
278 impl UsePlacementFinder {
279 fn check(krate: &Crate, target_module: NodeId) -> (Option<Span>, bool) {
280 let mut finder = UsePlacementFinder { target_module, span: None, found_use: false };
281 visit::walk_crate(&mut finder, krate);
282 (finder.span, finder.found_use)
286 impl<'tcx> Visitor<'tcx> for UsePlacementFinder {
289 module: &'tcx ast::Mod,
291 _: &[ast::Attribute],
294 if self.span.is_some() {
297 if node_id != self.target_module {
298 visit::walk_mod(self, module);
301 // find a use statement
302 for item in &module.items {
304 ItemKind::Use(..) => {
305 // don't suggest placing a use before the prelude
306 // import or other generated ones
307 if !item.span.from_expansion() {
308 self.span = Some(item.span.shrink_to_lo());
309 self.found_use = true;
313 // don't place use before extern crate
314 ItemKind::ExternCrate(_) => {}
315 // but place them before the first other item
317 if self.span.map_or(true, |span| item.span < span)
318 && !item.span.from_expansion()
320 // don't insert between attributes and an item
321 if item.attrs.is_empty() {
322 self.span = Some(item.span.shrink_to_lo());
324 // find the first attribute on the item
325 for attr in &item.attrs {
326 if self.span.map_or(true, |span| attr.span < span) {
327 self.span = Some(attr.span.shrink_to_lo());
338 /// An intermediate resolution result.
340 /// This refers to the thing referred by a name. The difference between `Res` and `Item` is that
341 /// items are visible in their whole block, while `Res`es only from the place they are defined
344 enum LexicalScopeBinding<'a> {
345 Item(&'a NameBinding<'a>),
349 impl<'a> LexicalScopeBinding<'a> {
350 fn res(self) -> Res {
352 LexicalScopeBinding::Item(binding) => binding.res(),
353 LexicalScopeBinding::Res(res) => res,
358 #[derive(Copy, Clone, Debug)]
359 enum ModuleOrUniformRoot<'a> {
363 /// Virtual module that denotes resolution in crate root with fallback to extern prelude.
364 CrateRootAndExternPrelude,
366 /// Virtual module that denotes resolution in extern prelude.
367 /// Used for paths starting with `::` on 2018 edition.
370 /// Virtual module that denotes resolution in current scope.
371 /// Used only for resolving single-segment imports. The reason it exists is that import paths
372 /// are always split into two parts, the first of which should be some kind of module.
376 impl ModuleOrUniformRoot<'_> {
377 fn same_def(lhs: Self, rhs: Self) -> bool {
379 (ModuleOrUniformRoot::Module(lhs), ModuleOrUniformRoot::Module(rhs)) => {
380 lhs.def_id() == rhs.def_id()
383 ModuleOrUniformRoot::CrateRootAndExternPrelude,
384 ModuleOrUniformRoot::CrateRootAndExternPrelude,
386 | (ModuleOrUniformRoot::ExternPrelude, ModuleOrUniformRoot::ExternPrelude)
387 | (ModuleOrUniformRoot::CurrentScope, ModuleOrUniformRoot::CurrentScope) => true,
393 #[derive(Clone, Debug)]
394 enum PathResult<'a> {
395 Module(ModuleOrUniformRoot<'a>),
396 NonModule(PartialRes),
401 suggestion: Option<Suggestion>,
402 is_error_from_last_segment: bool,
408 /// An anonymous module; e.g., just a block.
413 /// { // This is an anonymous module
414 /// f(); // This resolves to (2) as we are inside the block.
417 /// f(); // Resolves to (1)
421 /// Any module with a name.
425 /// * A normal module – either `mod from_file;` or `mod from_block { }` –
426 /// or the crate root (which is conceptually a top-level module).
427 /// Note that the crate root's [name][Self::name] will be [`kw::Empty`].
428 /// * A trait or an enum (it implicitly contains associated types, methods and variant
430 Def(DefKind, DefId, Symbol),
434 /// Get name of the module.
435 pub fn name(&self) -> Option<Symbol> {
437 ModuleKind::Block(..) => None,
438 ModuleKind::Def(.., name) => Some(*name),
443 /// A key that identifies a binding in a given `Module`.
445 /// Multiple bindings in the same module can have the same key (in a valid
446 /// program) if all but one of them come from glob imports.
447 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
449 /// The identifier for the binding, aways the `normalize_to_macros_2_0` version of the
453 /// 0 if ident is not `_`, otherwise a value that's unique to the specific
454 /// `_` in the expanded AST that introduced this binding.
458 type Resolutions<'a> = RefCell<FxIndexMap<BindingKey, &'a RefCell<NameResolution<'a>>>>;
460 /// One node in the tree of modules.
462 /// Note that a "module" in resolve is broader than a `mod` that you declare in Rust code. It may be one of these:
465 /// * crate root (aka, top-level anonymous module)
468 /// * curly-braced block with statements
470 /// You can use [`ModuleData::kind`] to determine the kind of module this is.
471 pub struct ModuleData<'a> {
472 /// The direct parent module (it may not be a `mod`, however).
473 parent: Option<Module<'a>>,
474 /// What kind of module this is, because this may not be a `mod`.
477 /// The [`DefId`] of the nearest `mod` item ancestor (which may be this module).
478 /// This may be the crate root.
479 nearest_parent_mod: DefId,
481 /// Mapping between names and their (possibly in-progress) resolutions in this module.
482 /// Resolutions in modules from other crates are not populated until accessed.
483 lazy_resolutions: Resolutions<'a>,
484 /// True if this is a module from other crate that needs to be populated on access.
485 populate_on_access: Cell<bool>,
487 /// Macro invocations that can expand into items in this module.
488 unexpanded_invocations: RefCell<FxHashSet<ExpnId>>,
490 /// Whether `#[no_implicit_prelude]` is active.
491 no_implicit_prelude: bool,
493 glob_importers: RefCell<Vec<&'a Import<'a>>>,
494 globs: RefCell<Vec<&'a Import<'a>>>,
496 /// Used to memoize the traits in this module for faster searches through all traits in scope.
497 traits: RefCell<Option<Box<[(Ident, &'a NameBinding<'a>)]>>>,
499 /// Span of the module itself. Used for error reporting.
505 type Module<'a> = &'a ModuleData<'a>;
507 impl<'a> ModuleData<'a> {
509 parent: Option<Module<'a>>,
511 nearest_parent_mod: DefId,
519 lazy_resolutions: Default::default(),
520 populate_on_access: Cell::new(!nearest_parent_mod.is_local()),
521 unexpanded_invocations: Default::default(),
522 no_implicit_prelude: false,
523 glob_importers: RefCell::new(Vec::new()),
524 globs: RefCell::new(Vec::new()),
525 traits: RefCell::new(None),
531 fn for_each_child<R, F>(&'a self, resolver: &mut R, mut f: F)
533 R: AsMut<Resolver<'a>>,
534 F: FnMut(&mut R, Ident, Namespace, &'a NameBinding<'a>),
536 for (key, name_resolution) in resolver.as_mut().resolutions(self).borrow().iter() {
537 if let Some(binding) = name_resolution.borrow().binding {
538 f(resolver, key.ident, key.ns, binding);
543 /// This modifies `self` in place. The traits will be stored in `self.traits`.
544 fn ensure_traits<R>(&'a self, resolver: &mut R)
546 R: AsMut<Resolver<'a>>,
548 let mut traits = self.traits.borrow_mut();
549 if traits.is_none() {
550 let mut collected_traits = Vec::new();
551 self.for_each_child(resolver, |_, name, ns, binding| {
555 if let Res::Def(DefKind::Trait | DefKind::TraitAlias, _) = binding.res() {
556 collected_traits.push((name, binding))
559 *traits = Some(collected_traits.into_boxed_slice());
563 fn res(&self) -> Option<Res> {
565 ModuleKind::Def(kind, def_id, _) => Some(Res::Def(kind, def_id)),
570 fn def_id(&self) -> Option<DefId> {
572 ModuleKind::Def(_, def_id, _) => Some(def_id),
577 // `self` resolves to the first module ancestor that `is_normal`.
578 fn is_normal(&self) -> bool {
579 matches!(self.kind, ModuleKind::Def(DefKind::Mod, _, _))
582 fn is_trait(&self) -> bool {
583 matches!(self.kind, ModuleKind::Def(DefKind::Trait, _, _))
586 fn nearest_item_scope(&'a self) -> Module<'a> {
588 ModuleKind::Def(DefKind::Enum | DefKind::Trait, ..) => {
589 self.parent.expect("enum or trait module without a parent")
595 fn is_ancestor_of(&self, mut other: &Self) -> bool {
596 while !ptr::eq(self, other) {
597 if let Some(parent) = other.parent {
607 impl<'a> fmt::Debug for ModuleData<'a> {
608 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
609 write!(f, "{:?}", self.res())
613 /// Records a possibly-private value, type, or module definition.
614 #[derive(Clone, Debug)]
615 pub struct NameBinding<'a> {
616 kind: NameBindingKind<'a>,
617 ambiguity: Option<(&'a NameBinding<'a>, AmbiguityKind)>,
623 pub trait ToNameBinding<'a> {
624 fn to_name_binding(self, arenas: &'a ResolverArenas<'a>) -> &'a NameBinding<'a>;
627 impl<'a> ToNameBinding<'a> for &'a NameBinding<'a> {
628 fn to_name_binding(self, _: &'a ResolverArenas<'a>) -> &'a NameBinding<'a> {
633 #[derive(Clone, Debug)]
634 enum NameBindingKind<'a> {
635 Res(Res, /* is_macro_export */ bool),
637 Import { binding: &'a NameBinding<'a>, import: &'a Import<'a>, used: Cell<bool> },
640 impl<'a> NameBindingKind<'a> {
641 /// Is this a name binding of a import?
642 fn is_import(&self) -> bool {
643 matches!(*self, NameBindingKind::Import { .. })
647 struct PrivacyError<'a> {
649 binding: &'a NameBinding<'a>,
653 struct UseError<'a> {
654 err: DiagnosticBuilder<'a>,
655 /// Candidates which user could `use` to access the missing type.
656 candidates: Vec<ImportSuggestion>,
657 /// The `DefId` of the module to place the use-statements in.
659 /// Whether the diagnostic should say "instead" (as in `consider importing ... instead`).
661 /// Extra free-form suggestion.
662 suggestion: Option<(Span, &'static str, String, Applicability)>,
665 #[derive(Clone, Copy, PartialEq, Debug)]
670 MacroRulesVsModularized,
678 fn descr(self) -> &'static str {
680 AmbiguityKind::Import => "name vs any other name during import resolution",
681 AmbiguityKind::BuiltinAttr => "built-in attribute vs any other name",
682 AmbiguityKind::DeriveHelper => "derive helper attribute vs any other name",
683 AmbiguityKind::MacroRulesVsModularized => {
684 "`macro_rules` vs non-`macro_rules` from other module"
686 AmbiguityKind::GlobVsOuter => {
687 "glob import vs any other name from outer scope during import/macro resolution"
689 AmbiguityKind::GlobVsGlob => "glob import vs glob import in the same module",
690 AmbiguityKind::GlobVsExpanded => {
691 "glob import vs macro-expanded name in the same \
692 module during import/macro resolution"
694 AmbiguityKind::MoreExpandedVsOuter => {
695 "macro-expanded name vs less macro-expanded name \
696 from outer scope during import/macro resolution"
702 /// Miscellaneous bits of metadata for better ambiguity error reporting.
703 #[derive(Clone, Copy, PartialEq)]
704 enum AmbiguityErrorMisc {
711 struct AmbiguityError<'a> {
714 b1: &'a NameBinding<'a>,
715 b2: &'a NameBinding<'a>,
716 misc1: AmbiguityErrorMisc,
717 misc2: AmbiguityErrorMisc,
720 impl<'a> NameBinding<'a> {
721 fn module(&self) -> Option<Module<'a>> {
723 NameBindingKind::Module(module) => Some(module),
724 NameBindingKind::Import { binding, .. } => binding.module(),
729 fn res(&self) -> Res {
731 NameBindingKind::Res(res, _) => res,
732 NameBindingKind::Module(module) => module.res().unwrap(),
733 NameBindingKind::Import { binding, .. } => binding.res(),
737 fn is_ambiguity(&self) -> bool {
738 self.ambiguity.is_some()
740 NameBindingKind::Import { binding, .. } => binding.is_ambiguity(),
745 fn is_possibly_imported_variant(&self) -> bool {
747 NameBindingKind::Import { binding, .. } => binding.is_possibly_imported_variant(),
748 _ => self.is_variant(),
752 // We sometimes need to treat variants as `pub` for backwards compatibility.
753 fn pseudo_vis(&self) -> ty::Visibility {
754 if self.is_variant() && self.res().def_id().is_local() {
755 ty::Visibility::Public
761 fn is_variant(&self) -> bool {
762 matches!(self.kind, NameBindingKind::Res(
763 Res::Def(DefKind::Variant | DefKind::Ctor(CtorOf::Variant, ..), _),
768 fn is_extern_crate(&self) -> bool {
770 NameBindingKind::Import {
771 import: &Import { kind: ImportKind::ExternCrate { .. }, .. },
774 NameBindingKind::Module(&ModuleData {
775 kind: ModuleKind::Def(DefKind::Mod, def_id, _),
777 }) => def_id.index == CRATE_DEF_INDEX,
782 fn is_import(&self) -> bool {
783 matches!(self.kind, NameBindingKind::Import { .. })
786 fn is_glob_import(&self) -> bool {
788 NameBindingKind::Import { import, .. } => import.is_glob(),
793 fn is_importable(&self) -> bool {
796 Res::Def(DefKind::AssocConst | DefKind::AssocFn | DefKind::AssocTy, _)
800 fn is_macro_def(&self) -> bool {
801 matches!(self.kind, NameBindingKind::Res(Res::Def(DefKind::Macro(..), _), _))
804 fn macro_kind(&self) -> Option<MacroKind> {
805 self.res().macro_kind()
808 // Suppose that we resolved macro invocation with `invoc_parent_expansion` to binding `binding`
809 // at some expansion round `max(invoc, binding)` when they both emerged from macros.
810 // Then this function returns `true` if `self` may emerge from a macro *after* that
811 // in some later round and screw up our previously found resolution.
812 // See more detailed explanation in
813 // https://github.com/rust-lang/rust/pull/53778#issuecomment-419224049
814 fn may_appear_after(&self, invoc_parent_expansion: ExpnId, binding: &NameBinding<'_>) -> bool {
815 // self > max(invoc, binding) => !(self <= invoc || self <= binding)
816 // Expansions are partially ordered, so "may appear after" is an inversion of
817 // "certainly appears before or simultaneously" and includes unordered cases.
818 let self_parent_expansion = self.expansion;
819 let other_parent_expansion = binding.expansion;
820 let certainly_before_other_or_simultaneously =
821 other_parent_expansion.is_descendant_of(self_parent_expansion);
822 let certainly_before_invoc_or_simultaneously =
823 invoc_parent_expansion.is_descendant_of(self_parent_expansion);
824 !(certainly_before_other_or_simultaneously || certainly_before_invoc_or_simultaneously)
828 /// Interns the names of the primitive types.
830 /// All other types are defined somewhere and possibly imported, but the primitive ones need
831 /// special handling, since they have no place of origin.
832 struct PrimitiveTypeTable {
833 primitive_types: FxHashMap<Symbol, PrimTy>,
836 impl PrimitiveTypeTable {
837 fn new() -> PrimitiveTypeTable {
838 let mut table = FxHashMap::default();
840 table.insert(sym::bool, Bool);
841 table.insert(sym::char, Char);
842 table.insert(sym::f32, Float(FloatTy::F32));
843 table.insert(sym::f64, Float(FloatTy::F64));
844 table.insert(sym::isize, Int(IntTy::Isize));
845 table.insert(sym::i8, Int(IntTy::I8));
846 table.insert(sym::i16, Int(IntTy::I16));
847 table.insert(sym::i32, Int(IntTy::I32));
848 table.insert(sym::i64, Int(IntTy::I64));
849 table.insert(sym::i128, Int(IntTy::I128));
850 table.insert(sym::str, Str);
851 table.insert(sym::usize, Uint(UintTy::Usize));
852 table.insert(sym::u8, Uint(UintTy::U8));
853 table.insert(sym::u16, Uint(UintTy::U16));
854 table.insert(sym::u32, Uint(UintTy::U32));
855 table.insert(sym::u64, Uint(UintTy::U64));
856 table.insert(sym::u128, Uint(UintTy::U128));
857 Self { primitive_types: table }
861 #[derive(Debug, Default, Clone)]
862 pub struct ExternPreludeEntry<'a> {
863 extern_crate_item: Option<&'a NameBinding<'a>>,
864 pub introduced_by_item: bool,
867 /// Used for better errors for E0773
868 enum BuiltinMacroState {
869 NotYetSeen(SyntaxExtension),
873 /// The main resolver class.
875 /// This is the visitor that walks the whole crate.
876 pub struct Resolver<'a> {
877 session: &'a Session,
879 definitions: Definitions,
881 graph_root: Module<'a>,
883 prelude: Option<Module<'a>>,
884 extern_prelude: FxHashMap<Ident, ExternPreludeEntry<'a>>,
886 /// N.B., this is used only for better diagnostics, not name resolution itself.
887 has_self: FxHashSet<DefId>,
889 /// Names of fields of an item `DefId` accessible with dot syntax.
890 /// Used for hints during error reporting.
891 field_names: FxHashMap<DefId, Vec<Spanned<Symbol>>>,
893 /// All imports known to succeed or fail.
894 determined_imports: Vec<&'a Import<'a>>,
896 /// All non-determined imports.
897 indeterminate_imports: Vec<&'a Import<'a>>,
899 /// FIXME: Refactor things so that these fields are passed through arguments and not resolver.
900 /// We are resolving a last import segment during import validation.
901 last_import_segment: bool,
902 /// This binding should be ignored during in-module resolution, so that we don't get
903 /// "self-confirming" import resolutions during import validation.
904 unusable_binding: Option<&'a NameBinding<'a>>,
906 /// The idents for the primitive types.
907 primitive_type_table: PrimitiveTypeTable,
909 /// Resolutions for nodes that have a single resolution.
910 partial_res_map: NodeMap<PartialRes>,
911 /// Resolutions for import nodes, which have multiple resolutions in different namespaces.
912 import_res_map: NodeMap<PerNS<Option<Res>>>,
913 /// Resolutions for labels (node IDs of their corresponding blocks or loops).
914 label_res_map: NodeMap<NodeId>,
916 /// `CrateNum` resolutions of `extern crate` items.
917 extern_crate_map: FxHashMap<LocalDefId, CrateNum>,
918 export_map: ExportMap<LocalDefId>,
919 trait_map: NodeMap<Vec<TraitCandidate>>,
921 /// A map from nodes to anonymous modules.
922 /// Anonymous modules are pseudo-modules that are implicitly created around items
923 /// contained within blocks.
925 /// For example, if we have this:
933 /// There will be an anonymous module created around `g` with the ID of the
934 /// entry block for `f`.
935 block_map: NodeMap<Module<'a>>,
936 /// A fake module that contains no definition and no prelude. Used so that
937 /// some AST passes can generate identifiers that only resolve to local or
939 empty_module: Module<'a>,
940 module_map: FxHashMap<LocalDefId, Module<'a>>,
941 extern_module_map: FxHashMap<DefId, Module<'a>>,
942 binding_parent_modules: FxHashMap<PtrKey<'a, NameBinding<'a>>, Module<'a>>,
943 underscore_disambiguator: u32,
945 /// Maps glob imports to the names of items actually imported.
946 glob_map: FxHashMap<LocalDefId, FxHashSet<Symbol>>,
947 /// Visibilities in "lowered" form, for all entities that have them.
948 visibilities: FxHashMap<LocalDefId, ty::Visibility>,
949 used_imports: FxHashSet<(NodeId, Namespace)>,
950 maybe_unused_trait_imports: FxHashSet<LocalDefId>,
951 maybe_unused_extern_crates: Vec<(LocalDefId, Span)>,
953 /// Privacy errors are delayed until the end in order to deduplicate them.
954 privacy_errors: Vec<PrivacyError<'a>>,
955 /// Ambiguity errors are delayed for deduplication.
956 ambiguity_errors: Vec<AmbiguityError<'a>>,
957 /// `use` injections are delayed for better placement and deduplication.
958 use_injections: Vec<UseError<'a>>,
959 /// Crate-local macro expanded `macro_export` referred to by a module-relative path.
960 macro_expanded_macro_export_errors: BTreeSet<(Span, Span)>,
962 arenas: &'a ResolverArenas<'a>,
963 dummy_binding: &'a NameBinding<'a>,
965 crate_loader: CrateLoader<'a>,
966 macro_names: FxHashSet<Ident>,
967 builtin_macros: FxHashMap<Symbol, BuiltinMacroState>,
968 registered_attrs: FxHashSet<Ident>,
969 registered_tools: FxHashSet<Ident>,
970 macro_use_prelude: FxHashMap<Symbol, &'a NameBinding<'a>>,
971 all_macros: FxHashMap<Symbol, Res>,
972 macro_map: FxHashMap<DefId, Lrc<SyntaxExtension>>,
973 dummy_ext_bang: Lrc<SyntaxExtension>,
974 dummy_ext_derive: Lrc<SyntaxExtension>,
975 non_macro_attrs: [Lrc<SyntaxExtension>; 2],
976 local_macro_def_scopes: FxHashMap<LocalDefId, Module<'a>>,
977 ast_transform_scopes: FxHashMap<ExpnId, Module<'a>>,
978 unused_macros: FxHashMap<LocalDefId, (NodeId, Span)>,
979 proc_macro_stubs: FxHashSet<LocalDefId>,
980 /// Traces collected during macro resolution and validated when it's complete.
981 single_segment_macro_resolutions:
982 Vec<(Ident, MacroKind, ParentScope<'a>, Option<&'a NameBinding<'a>>)>,
983 multi_segment_macro_resolutions:
984 Vec<(Vec<Segment>, Span, MacroKind, ParentScope<'a>, Option<Res>)>,
985 builtin_attrs: Vec<(Ident, ParentScope<'a>)>,
986 /// `derive(Copy)` marks items they are applied to so they are treated specially later.
987 /// Derive macros cannot modify the item themselves and have to store the markers in the global
988 /// context, so they attach the markers to derive container IDs using this resolver table.
989 containers_deriving_copy: FxHashSet<ExpnId>,
990 /// Parent scopes in which the macros were invoked.
991 /// FIXME: `derives` are missing in these parent scopes and need to be taken from elsewhere.
992 invocation_parent_scopes: FxHashMap<ExpnId, ParentScope<'a>>,
993 /// `macro_rules` scopes *produced* by expanding the macro invocations,
994 /// include all the `macro_rules` items and other invocations generated by them.
995 output_macro_rules_scopes: FxHashMap<ExpnId, MacroRulesScopeRef<'a>>,
996 /// Helper attributes that are in scope for the given expansion.
997 helper_attrs: FxHashMap<ExpnId, Vec<Ident>>,
999 /// Avoid duplicated errors for "name already defined".
1000 name_already_seen: FxHashMap<Symbol, Span>,
1002 potentially_unused_imports: Vec<&'a Import<'a>>,
1004 /// Table for mapping struct IDs into struct constructor IDs,
1005 /// it's not used during normal resolution, only for better error reporting.
1006 /// Also includes of list of each fields visibility
1007 struct_constructors: DefIdMap<(Res, ty::Visibility, Vec<ty::Visibility>)>,
1009 /// Features enabled for this crate.
1010 active_features: FxHashSet<Symbol>,
1012 lint_buffer: LintBuffer,
1014 next_node_id: NodeId,
1016 def_id_to_span: IndexVec<LocalDefId, Span>,
1018 node_id_to_def_id: FxHashMap<ast::NodeId, LocalDefId>,
1019 def_id_to_node_id: IndexVec<LocalDefId, ast::NodeId>,
1021 /// Indices of unnamed struct or variant fields with unresolved attributes.
1022 placeholder_field_indices: FxHashMap<NodeId, usize>,
1023 /// When collecting definitions from an AST fragment produced by a macro invocation `ExpnId`
1024 /// we know what parent node that fragment should be attached to thanks to this table.
1025 invocation_parents: FxHashMap<ExpnId, LocalDefId>,
1027 next_disambiguator: FxHashMap<(LocalDefId, DefPathData), u32>,
1028 /// Some way to know that we are in a *trait* impl in `visit_assoc_item`.
1029 /// FIXME: Replace with a more general AST map (together with some other fields).
1030 trait_impl_items: FxHashSet<LocalDefId>,
1033 /// Nothing really interesting here; it just provides memory for the rest of the crate.
1035 pub struct ResolverArenas<'a> {
1036 modules: TypedArena<ModuleData<'a>>,
1037 local_modules: RefCell<Vec<Module<'a>>>,
1038 imports: TypedArena<Import<'a>>,
1039 name_resolutions: TypedArena<RefCell<NameResolution<'a>>>,
1040 ast_paths: TypedArena<ast::Path>,
1041 dropless: DroplessArena,
1044 impl<'a> ResolverArenas<'a> {
1045 fn alloc_module(&'a self, module: ModuleData<'a>) -> Module<'a> {
1046 let module = self.modules.alloc(module);
1047 if module.def_id().map(|def_id| def_id.is_local()).unwrap_or(true) {
1048 self.local_modules.borrow_mut().push(module);
1052 fn local_modules(&'a self) -> std::cell::Ref<'a, Vec<Module<'a>>> {
1053 self.local_modules.borrow()
1055 fn alloc_name_binding(&'a self, name_binding: NameBinding<'a>) -> &'a NameBinding<'a> {
1056 self.dropless.alloc(name_binding)
1058 fn alloc_import(&'a self, import: Import<'a>) -> &'a Import<'_> {
1059 self.imports.alloc(import)
1061 fn alloc_name_resolution(&'a self) -> &'a RefCell<NameResolution<'a>> {
1062 self.name_resolutions.alloc(Default::default())
1064 fn alloc_macro_rules_scope(&'a self, scope: MacroRulesScope<'a>) -> MacroRulesScopeRef<'a> {
1065 PtrKey(self.dropless.alloc(Cell::new(scope)))
1067 fn alloc_macro_rules_binding(
1069 binding: MacroRulesBinding<'a>,
1070 ) -> &'a MacroRulesBinding<'a> {
1071 self.dropless.alloc(binding)
1073 fn alloc_ast_paths(&'a self, paths: &[ast::Path]) -> &'a [ast::Path] {
1074 self.ast_paths.alloc_from_iter(paths.iter().cloned())
1076 fn alloc_pattern_spans(&'a self, spans: impl Iterator<Item = Span>) -> &'a [Span] {
1077 self.dropless.alloc_from_iter(spans)
1081 impl<'a> AsMut<Resolver<'a>> for Resolver<'a> {
1082 fn as_mut(&mut self) -> &mut Resolver<'a> {
1087 impl<'a, 'b> DefIdTree for &'a Resolver<'b> {
1088 fn parent(self, id: DefId) -> Option<DefId> {
1089 match id.as_local() {
1090 Some(id) => self.definitions.def_key(id).parent,
1091 None => self.cstore().def_key(id).parent,
1093 .map(|index| DefId { index, ..id })
1097 /// This interface is used through the AST→HIR step, to embed full paths into the HIR. After that
1098 /// the resolver is no longer needed as all the relevant information is inline.
1099 impl ResolverAstLowering for Resolver<'_> {
1100 fn def_key(&mut self, id: DefId) -> DefKey {
1101 if let Some(id) = id.as_local() {
1102 self.definitions().def_key(id)
1104 self.cstore().def_key(id)
1108 fn item_generics_num_lifetimes(&self, def_id: DefId, sess: &Session) -> usize {
1109 self.cstore().item_generics_num_lifetimes(def_id, sess)
1112 fn get_partial_res(&mut self, id: NodeId) -> Option<PartialRes> {
1113 self.partial_res_map.get(&id).cloned()
1116 fn get_import_res(&mut self, id: NodeId) -> PerNS<Option<Res>> {
1117 self.import_res_map.get(&id).cloned().unwrap_or_default()
1120 fn get_label_res(&mut self, id: NodeId) -> Option<NodeId> {
1121 self.label_res_map.get(&id).cloned()
1124 fn definitions(&mut self) -> &mut Definitions {
1125 &mut self.definitions
1128 fn lint_buffer(&mut self) -> &mut LintBuffer {
1129 &mut self.lint_buffer
1132 fn next_node_id(&mut self) -> NodeId {
1136 fn trait_map(&self) -> &NodeMap<Vec<TraitCandidate>> {
1140 fn opt_local_def_id(&self, node: NodeId) -> Option<LocalDefId> {
1141 self.node_id_to_def_id.get(&node).copied()
1144 fn local_def_id(&self, node: NodeId) -> LocalDefId {
1145 self.opt_local_def_id(node).unwrap_or_else(|| panic!("no entry for node id: `{:?}`", node))
1148 /// Adds a definition with a parent definition.
1152 node_id: ast::NodeId,
1158 !self.node_id_to_def_id.contains_key(&node_id),
1159 "adding a def'n for node-id {:?} and data {:?} but a previous def'n exists: {:?}",
1162 self.definitions.def_key(self.node_id_to_def_id[&node_id]),
1165 // Find the next free disambiguator for this key.
1166 let next_disambiguator = &mut self.next_disambiguator;
1167 let next_disambiguator = |parent, data| {
1168 let next_disamb = next_disambiguator.entry((parent, data)).or_insert(0);
1169 let disambiguator = *next_disamb;
1170 *next_disamb = next_disamb.checked_add(1).expect("disambiguator overflow");
1174 let def_id = self.definitions.create_def(parent, data, expn_id, next_disambiguator);
1176 assert_eq!(self.def_id_to_span.push(span), def_id);
1178 // Some things for which we allocate `LocalDefId`s don't correspond to
1179 // anything in the AST, so they don't have a `NodeId`. For these cases
1180 // we don't need a mapping from `NodeId` to `LocalDefId`.
1181 if node_id != ast::DUMMY_NODE_ID {
1182 debug!("create_def: def_id_to_node_id[{:?}] <-> {:?}", def_id, node_id);
1183 self.node_id_to_def_id.insert(node_id, def_id);
1185 assert_eq!(self.def_id_to_node_id.push(node_id), def_id);
1191 impl<'a> Resolver<'a> {
1193 session: &'a Session,
1196 metadata_loader: &'a MetadataLoaderDyn,
1197 arenas: &'a ResolverArenas<'a>,
1199 let root_local_def_id = LocalDefId { local_def_index: CRATE_DEF_INDEX };
1200 let root_def_id = root_local_def_id.to_def_id();
1201 let root_module_kind = ModuleKind::Def(DefKind::Mod, root_def_id, kw::Empty);
1202 let graph_root = arenas.alloc_module(ModuleData {
1203 no_implicit_prelude: session.contains_name(&krate.attrs, sym::no_implicit_prelude),
1204 ..ModuleData::new(None, root_module_kind, root_def_id, ExpnId::root(), krate.span)
1206 let empty_module_kind = ModuleKind::Def(DefKind::Mod, root_def_id, kw::Empty);
1207 let empty_module = arenas.alloc_module(ModuleData {
1208 no_implicit_prelude: true,
1217 let mut module_map = FxHashMap::default();
1218 module_map.insert(root_local_def_id, graph_root);
1220 let definitions = Definitions::new(crate_name, session.local_crate_disambiguator());
1221 let root = definitions.get_root_def();
1223 let mut visibilities = FxHashMap::default();
1224 visibilities.insert(root_local_def_id, ty::Visibility::Public);
1226 let mut def_id_to_span = IndexVec::default();
1227 assert_eq!(def_id_to_span.push(rustc_span::DUMMY_SP), root);
1228 let mut def_id_to_node_id = IndexVec::default();
1229 assert_eq!(def_id_to_node_id.push(CRATE_NODE_ID), root);
1230 let mut node_id_to_def_id = FxHashMap::default();
1231 node_id_to_def_id.insert(CRATE_NODE_ID, root);
1233 let mut invocation_parents = FxHashMap::default();
1234 invocation_parents.insert(ExpnId::root(), root);
1236 let mut extern_prelude: FxHashMap<Ident, ExternPreludeEntry<'_>> = session
1240 .filter(|(_, entry)| entry.add_prelude)
1241 .map(|(name, _)| (Ident::from_str(name), Default::default()))
1244 if !session.contains_name(&krate.attrs, sym::no_core) {
1245 extern_prelude.insert(Ident::with_dummy_span(sym::core), Default::default());
1246 if !session.contains_name(&krate.attrs, sym::no_std) {
1247 extern_prelude.insert(Ident::with_dummy_span(sym::std), Default::default());
1251 let (registered_attrs, registered_tools) =
1252 macros::registered_attrs_and_tools(session, &krate.attrs);
1254 let features = session.features_untracked();
1255 let non_macro_attr =
1256 |mark_used| Lrc::new(SyntaxExtension::non_macro_attr(mark_used, session.edition()));
1258 let mut resolver = Resolver {
1263 // The outermost module has def ID 0; this is not reflected in the
1269 has_self: FxHashSet::default(),
1270 field_names: FxHashMap::default(),
1272 determined_imports: Vec::new(),
1273 indeterminate_imports: Vec::new(),
1275 last_import_segment: false,
1276 unusable_binding: None,
1278 primitive_type_table: PrimitiveTypeTable::new(),
1280 partial_res_map: Default::default(),
1281 import_res_map: Default::default(),
1282 label_res_map: Default::default(),
1283 extern_crate_map: Default::default(),
1284 export_map: FxHashMap::default(),
1285 trait_map: Default::default(),
1286 underscore_disambiguator: 0,
1289 block_map: Default::default(),
1290 extern_module_map: FxHashMap::default(),
1291 binding_parent_modules: FxHashMap::default(),
1292 ast_transform_scopes: FxHashMap::default(),
1294 glob_map: Default::default(),
1296 used_imports: FxHashSet::default(),
1297 maybe_unused_trait_imports: Default::default(),
1298 maybe_unused_extern_crates: Vec::new(),
1300 privacy_errors: Vec::new(),
1301 ambiguity_errors: Vec::new(),
1302 use_injections: Vec::new(),
1303 macro_expanded_macro_export_errors: BTreeSet::new(),
1306 dummy_binding: arenas.alloc_name_binding(NameBinding {
1307 kind: NameBindingKind::Res(Res::Err, false),
1309 expansion: ExpnId::root(),
1311 vis: ty::Visibility::Public,
1314 crate_loader: CrateLoader::new(session, metadata_loader, crate_name),
1315 macro_names: FxHashSet::default(),
1316 builtin_macros: Default::default(),
1319 macro_use_prelude: FxHashMap::default(),
1320 all_macros: FxHashMap::default(),
1321 macro_map: FxHashMap::default(),
1322 dummy_ext_bang: Lrc::new(SyntaxExtension::dummy_bang(session.edition())),
1323 dummy_ext_derive: Lrc::new(SyntaxExtension::dummy_derive(session.edition())),
1324 non_macro_attrs: [non_macro_attr(false), non_macro_attr(true)],
1325 invocation_parent_scopes: Default::default(),
1326 output_macro_rules_scopes: Default::default(),
1327 helper_attrs: Default::default(),
1328 local_macro_def_scopes: FxHashMap::default(),
1329 name_already_seen: FxHashMap::default(),
1330 potentially_unused_imports: Vec::new(),
1331 struct_constructors: Default::default(),
1332 unused_macros: Default::default(),
1333 proc_macro_stubs: Default::default(),
1334 single_segment_macro_resolutions: Default::default(),
1335 multi_segment_macro_resolutions: Default::default(),
1336 builtin_attrs: Default::default(),
1337 containers_deriving_copy: Default::default(),
1338 active_features: features
1339 .declared_lib_features
1341 .map(|(feat, ..)| *feat)
1342 .chain(features.declared_lang_features.iter().map(|(feat, ..)| *feat))
1344 lint_buffer: LintBuffer::default(),
1345 next_node_id: NodeId::from_u32(1),
1349 placeholder_field_indices: Default::default(),
1351 next_disambiguator: Default::default(),
1352 trait_impl_items: Default::default(),
1355 let root_parent_scope = ParentScope::module(graph_root, &resolver);
1356 resolver.invocation_parent_scopes.insert(ExpnId::root(), root_parent_scope);
1361 pub fn next_node_id(&mut self) -> NodeId {
1366 .expect("input too large; ran out of NodeIds");
1367 self.next_node_id = ast::NodeId::from_usize(next);
1371 pub fn lint_buffer(&mut self) -> &mut LintBuffer {
1372 &mut self.lint_buffer
1375 pub fn arenas() -> ResolverArenas<'a> {
1379 pub fn into_outputs(self) -> ResolverOutputs {
1380 let definitions = self.definitions;
1381 let visibilities = self.visibilities;
1382 let extern_crate_map = self.extern_crate_map;
1383 let export_map = self.export_map;
1384 let maybe_unused_trait_imports = self.maybe_unused_trait_imports;
1385 let maybe_unused_extern_crates = self.maybe_unused_extern_crates;
1386 let glob_map = self.glob_map;
1389 cstore: Box::new(self.crate_loader.into_cstore()),
1394 maybe_unused_trait_imports,
1395 maybe_unused_extern_crates,
1396 extern_prelude: self
1399 .map(|(ident, entry)| (ident.name, entry.introduced_by_item))
1404 pub fn clone_outputs(&self) -> ResolverOutputs {
1406 definitions: self.definitions.clone(),
1407 cstore: Box::new(self.cstore().clone()),
1408 visibilities: self.visibilities.clone(),
1409 extern_crate_map: self.extern_crate_map.clone(),
1410 export_map: self.export_map.clone(),
1411 glob_map: self.glob_map.clone(),
1412 maybe_unused_trait_imports: self.maybe_unused_trait_imports.clone(),
1413 maybe_unused_extern_crates: self.maybe_unused_extern_crates.clone(),
1414 extern_prelude: self
1417 .map(|(ident, entry)| (ident.name, entry.introduced_by_item))
1422 pub fn cstore(&self) -> &CStore {
1423 self.crate_loader.cstore()
1426 fn non_macro_attr(&self, mark_used: bool) -> Lrc<SyntaxExtension> {
1427 self.non_macro_attrs[mark_used as usize].clone()
1430 fn dummy_ext(&self, macro_kind: MacroKind) -> Lrc<SyntaxExtension> {
1432 MacroKind::Bang => self.dummy_ext_bang.clone(),
1433 MacroKind::Derive => self.dummy_ext_derive.clone(),
1434 MacroKind::Attr => self.non_macro_attr(true),
1438 /// Runs the function on each namespace.
1439 fn per_ns<F: FnMut(&mut Self, Namespace)>(&mut self, mut f: F) {
1445 fn is_builtin_macro(&mut self, res: Res) -> bool {
1446 self.get_macro(res).map_or(false, |ext| ext.is_builtin)
1449 fn macro_def(&self, mut ctxt: SyntaxContext) -> DefId {
1451 match ctxt.outer_expn().expn_data().macro_def_id {
1452 Some(def_id) => return def_id,
1453 None => ctxt.remove_mark(),
1458 /// Entry point to crate resolution.
1459 pub fn resolve_crate(&mut self, krate: &Crate) {
1460 let _prof_timer = self.session.prof.generic_activity("resolve_crate");
1462 ImportResolver { r: self }.finalize_imports();
1463 self.finalize_macro_resolutions();
1465 self.late_resolve_crate(krate);
1467 self.check_unused(krate);
1468 self.report_errors(krate);
1469 self.crate_loader.postprocess(krate);
1472 fn get_traits_in_module_containing_item(
1477 found_traits: &mut Vec<TraitCandidate>,
1478 parent_scope: &ParentScope<'a>,
1480 assert!(ns == TypeNS || ns == ValueNS);
1481 module.ensure_traits(self);
1482 let traits = module.traits.borrow();
1484 for &(trait_name, binding) in traits.as_ref().unwrap().iter() {
1485 // Traits have pseudo-modules that can be used to search for the given ident.
1486 if let Some(module) = binding.module() {
1487 let mut ident = ident;
1488 if ident.span.glob_adjust(module.expansion, binding.span).is_none() {
1492 .resolve_ident_in_module_unadjusted(
1493 ModuleOrUniformRoot::Module(module),
1502 let import_ids = self.find_transitive_imports(&binding.kind, trait_name);
1503 let trait_def_id = module.def_id().unwrap();
1504 found_traits.push(TraitCandidate { def_id: trait_def_id, import_ids });
1506 } else if let Res::Def(DefKind::TraitAlias, _) = binding.res() {
1507 // For now, just treat all trait aliases as possible candidates, since we don't
1508 // know if the ident is somewhere in the transitive bounds.
1509 let import_ids = self.find_transitive_imports(&binding.kind, trait_name);
1510 let trait_def_id = binding.res().def_id();
1511 found_traits.push(TraitCandidate { def_id: trait_def_id, import_ids });
1513 bug!("candidate is not trait or trait alias?")
1518 fn find_transitive_imports(
1520 mut kind: &NameBindingKind<'_>,
1522 ) -> SmallVec<[LocalDefId; 1]> {
1523 let mut import_ids = smallvec![];
1524 while let NameBindingKind::Import { import, binding, .. } = kind {
1525 let id = self.local_def_id(import.id);
1526 self.maybe_unused_trait_imports.insert(id);
1527 self.add_to_glob_map(&import, trait_name);
1528 import_ids.push(id);
1529 kind = &binding.kind;
1538 nearest_parent_mod: DefId,
1542 let module = ModuleData::new(Some(parent), kind, nearest_parent_mod, expn_id, span);
1543 self.arenas.alloc_module(module)
1546 fn new_key(&mut self, ident: Ident, ns: Namespace) -> BindingKey {
1547 let ident = ident.normalize_to_macros_2_0();
1548 let disambiguator = if ident.name == kw::Underscore {
1549 self.underscore_disambiguator += 1;
1550 self.underscore_disambiguator
1554 BindingKey { ident, ns, disambiguator }
1557 fn resolutions(&mut self, module: Module<'a>) -> &'a Resolutions<'a> {
1558 if module.populate_on_access.get() {
1559 module.populate_on_access.set(false);
1560 self.build_reduced_graph_external(module);
1562 &module.lazy_resolutions
1569 ) -> &'a RefCell<NameResolution<'a>> {
1571 .resolutions(module)
1574 .or_insert_with(|| self.arenas.alloc_name_resolution())
1581 used_binding: &'a NameBinding<'a>,
1582 is_lexical_scope: bool,
1584 if let Some((b2, kind)) = used_binding.ambiguity {
1585 self.ambiguity_errors.push(AmbiguityError {
1590 misc1: AmbiguityErrorMisc::None,
1591 misc2: AmbiguityErrorMisc::None,
1594 if let NameBindingKind::Import { import, binding, ref used } = used_binding.kind {
1595 // Avoid marking `extern crate` items that refer to a name from extern prelude,
1596 // but not introduce it, as used if they are accessed from lexical scope.
1597 if is_lexical_scope {
1598 if let Some(entry) = self.extern_prelude.get(&ident.normalize_to_macros_2_0()) {
1599 if let Some(crate_item) = entry.extern_crate_item {
1600 if ptr::eq(used_binding, crate_item) && !entry.introduced_by_item {
1607 import.used.set(true);
1608 self.used_imports.insert((import.id, ns));
1609 self.add_to_glob_map(&import, ident);
1610 self.record_use(ident, ns, binding, false);
1615 fn add_to_glob_map(&mut self, import: &Import<'_>, ident: Ident) {
1616 if import.is_glob() {
1617 let def_id = self.local_def_id(import.id);
1618 self.glob_map.entry(def_id).or_default().insert(ident.name);
1622 /// A generic scope visitor.
1623 /// Visits scopes in order to resolve some identifier in them or perform other actions.
1624 /// If the callback returns `Some` result, we stop visiting scopes and return it.
1627 scope_set: ScopeSet,
1628 parent_scope: &ParentScope<'a>,
1630 mut visitor: impl FnMut(&mut Self, Scope<'a>, /*use_prelude*/ bool, Ident) -> Option<T>,
1632 // General principles:
1633 // 1. Not controlled (user-defined) names should have higher priority than controlled names
1634 // built into the language or standard library. This way we can add new names into the
1635 // language or standard library without breaking user code.
1636 // 2. "Closed set" below means new names cannot appear after the current resolution attempt.
1637 // Places to search (in order of decreasing priority):
1639 // 1. FIXME: Ribs (type parameters), there's no necessary infrastructure yet
1640 // (open set, not controlled).
1641 // 2. Names in modules (both normal `mod`ules and blocks), loop through hygienic parents
1642 // (open, not controlled).
1643 // 3. Extern prelude (open, the open part is from macro expansions, not controlled).
1644 // 4. Tool modules (closed, controlled right now, but not in the future).
1645 // 5. Standard library prelude (de-facto closed, controlled).
1646 // 6. Language prelude (closed, controlled).
1648 // 1. FIXME: Ribs (local variables), there's no necessary infrastructure yet
1649 // (open set, not controlled).
1650 // 2. Names in modules (both normal `mod`ules and blocks), loop through hygienic parents
1651 // (open, not controlled).
1652 // 3. Standard library prelude (de-facto closed, controlled).
1654 // 1-3. Derive helpers (open, not controlled). All ambiguities with other names
1655 // are currently reported as errors. They should be higher in priority than preludes
1656 // and probably even names in modules according to the "general principles" above. They
1657 // also should be subject to restricted shadowing because are effectively produced by
1658 // derives (you need to resolve the derive first to add helpers into scope), but they
1659 // should be available before the derive is expanded for compatibility.
1660 // It's mess in general, so we are being conservative for now.
1661 // 1-3. `macro_rules` (open, not controlled), loop through `macro_rules` scopes. Have higher
1662 // priority than prelude macros, but create ambiguities with macros in modules.
1663 // 1-3. Names in modules (both normal `mod`ules and blocks), loop through hygienic parents
1664 // (open, not controlled). Have higher priority than prelude macros, but create
1665 // ambiguities with `macro_rules`.
1666 // 4. `macro_use` prelude (open, the open part is from macro expansions, not controlled).
1667 // 4a. User-defined prelude from macro-use
1668 // (open, the open part is from macro expansions, not controlled).
1669 // 4b. "Standard library prelude" part implemented through `macro-use` (closed, controlled).
1670 // 4c. Standard library prelude (de-facto closed, controlled).
1671 // 6. Language prelude: builtin attributes (closed, controlled).
1673 let rust_2015 = ident.span.rust_2015();
1674 let (ns, macro_kind, is_absolute_path) = match scope_set {
1675 ScopeSet::All(ns, _) => (ns, None, false),
1676 ScopeSet::AbsolutePath(ns) => (ns, None, true),
1677 ScopeSet::Macro(macro_kind) => (MacroNS, Some(macro_kind), false),
1679 // Jump out of trait or enum modules, they do not act as scopes.
1680 let module = parent_scope.module.nearest_item_scope();
1681 let mut scope = match ns {
1682 _ if is_absolute_path => Scope::CrateRoot,
1683 TypeNS | ValueNS => Scope::Module(module),
1684 MacroNS => Scope::DeriveHelpers(parent_scope.expansion),
1686 let mut ident = ident.normalize_to_macros_2_0();
1687 let mut use_prelude = !module.no_implicit_prelude;
1690 let visit = match scope {
1691 // Derive helpers are not in scope when resolving derives in the same container.
1692 Scope::DeriveHelpers(expn_id) => {
1693 !(expn_id == parent_scope.expansion && macro_kind == Some(MacroKind::Derive))
1695 Scope::DeriveHelpersCompat => true,
1696 Scope::MacroRules(macro_rules_scope) => {
1697 // Use "path compression" on `macro_rules` scope chains. This is an optimization
1698 // used to avoid long scope chains, see the comments on `MacroRulesScopeRef`.
1699 // As another consequence of this optimization visitors never observe invocation
1700 // scopes for macros that were already expanded.
1701 while let MacroRulesScope::Invocation(invoc_id) = macro_rules_scope.get() {
1702 if let Some(next_scope) = self.output_macro_rules_scopes.get(&invoc_id) {
1703 macro_rules_scope.set(next_scope.get());
1710 Scope::CrateRoot => true,
1711 Scope::Module(..) => true,
1712 Scope::RegisteredAttrs => use_prelude,
1713 Scope::MacroUsePrelude => use_prelude || rust_2015,
1714 Scope::BuiltinAttrs => true,
1715 Scope::ExternPrelude => use_prelude || is_absolute_path,
1716 Scope::ToolPrelude => use_prelude,
1717 Scope::StdLibPrelude => use_prelude || ns == MacroNS,
1718 Scope::BuiltinTypes => true,
1722 if let break_result @ Some(..) = visitor(self, scope, use_prelude, ident) {
1723 return break_result;
1727 scope = match scope {
1728 Scope::DeriveHelpers(expn_id) if expn_id != ExpnId::root() => {
1729 // Derive helpers are not visible to code generated by bang or derive macros.
1730 let expn_data = expn_id.expn_data();
1731 match expn_data.kind {
1733 | ExpnKind::Macro(MacroKind::Bang | MacroKind::Derive, _) => {
1734 Scope::DeriveHelpersCompat
1736 _ => Scope::DeriveHelpers(expn_data.parent),
1739 Scope::DeriveHelpers(..) => Scope::DeriveHelpersCompat,
1740 Scope::DeriveHelpersCompat => Scope::MacroRules(parent_scope.macro_rules),
1741 Scope::MacroRules(macro_rules_scope) => match macro_rules_scope.get() {
1742 MacroRulesScope::Binding(binding) => {
1743 Scope::MacroRules(binding.parent_macro_rules_scope)
1745 MacroRulesScope::Invocation(invoc_id) => {
1746 Scope::MacroRules(self.invocation_parent_scopes[&invoc_id].macro_rules)
1748 MacroRulesScope::Empty => Scope::Module(module),
1750 Scope::CrateRoot => match ns {
1752 ident.span.adjust(ExpnId::root());
1753 Scope::ExternPrelude
1755 ValueNS | MacroNS => break,
1757 Scope::Module(module) => {
1758 use_prelude = !module.no_implicit_prelude;
1759 match self.hygienic_lexical_parent(module, &mut ident.span) {
1760 Some(parent_module) => Scope::Module(parent_module),
1762 ident.span.adjust(ExpnId::root());
1764 TypeNS => Scope::ExternPrelude,
1765 ValueNS => Scope::StdLibPrelude,
1766 MacroNS => Scope::RegisteredAttrs,
1771 Scope::RegisteredAttrs => Scope::MacroUsePrelude,
1772 Scope::MacroUsePrelude => Scope::StdLibPrelude,
1773 Scope::BuiltinAttrs => break, // nowhere else to search
1774 Scope::ExternPrelude if is_absolute_path => break,
1775 Scope::ExternPrelude => Scope::ToolPrelude,
1776 Scope::ToolPrelude => Scope::StdLibPrelude,
1777 Scope::StdLibPrelude => match ns {
1778 TypeNS => Scope::BuiltinTypes,
1779 ValueNS => break, // nowhere else to search
1780 MacroNS => Scope::BuiltinAttrs,
1782 Scope::BuiltinTypes => break, // nowhere else to search
1789 /// This resolves the identifier `ident` in the namespace `ns` in the current lexical scope.
1790 /// More specifically, we proceed up the hierarchy of scopes and return the binding for
1791 /// `ident` in the first scope that defines it (or None if no scopes define it).
1793 /// A block's items are above its local variables in the scope hierarchy, regardless of where
1794 /// the items are defined in the block. For example,
1797 /// g(); // Since there are no local variables in scope yet, this resolves to the item.
1800 /// g(); // This resolves to the local variable `g` since it shadows the item.
1804 /// Invariant: This must only be called during main resolution, not during
1805 /// import resolution.
1806 fn resolve_ident_in_lexical_scope(
1810 parent_scope: &ParentScope<'a>,
1811 record_used_id: Option<NodeId>,
1814 ) -> Option<LexicalScopeBinding<'a>> {
1815 assert!(ns == TypeNS || ns == ValueNS);
1816 if ident.name == kw::Empty {
1817 return Some(LexicalScopeBinding::Res(Res::Err));
1819 let (general_span, normalized_span) = if ident.name == kw::SelfUpper {
1820 // FIXME(jseyfried) improve `Self` hygiene
1821 let empty_span = ident.span.with_ctxt(SyntaxContext::root());
1822 (empty_span, empty_span)
1823 } else if ns == TypeNS {
1824 let normalized_span = ident.span.normalize_to_macros_2_0();
1825 (normalized_span, normalized_span)
1827 (ident.span.normalize_to_macro_rules(), ident.span.normalize_to_macros_2_0())
1829 ident.span = general_span;
1830 let normalized_ident = Ident { span: normalized_span, ..ident };
1832 // Walk backwards up the ribs in scope.
1833 let record_used = record_used_id.is_some();
1834 let mut module = self.graph_root;
1835 for i in (0..ribs.len()).rev() {
1836 debug!("walk rib\n{:?}", ribs[i].bindings);
1837 // Use the rib kind to determine whether we are resolving parameters
1838 // (macro 2.0 hygiene) or local variables (`macro_rules` hygiene).
1839 let rib_ident = if ribs[i].kind.contains_params() { normalized_ident } else { ident };
1840 if let Some((original_rib_ident_def, res)) = ribs[i].bindings.get_key_value(&rib_ident)
1842 // The ident resolves to a type parameter or local variable.
1843 return Some(LexicalScopeBinding::Res(self.validate_res_from_ribs(
1849 *original_rib_ident_def,
1854 module = match ribs[i].kind {
1855 ModuleRibKind(module) => module,
1856 MacroDefinition(def) if def == self.macro_def(ident.span.ctxt()) => {
1857 // If an invocation of this macro created `ident`, give up on `ident`
1858 // and switch to `ident`'s source from the macro definition.
1859 ident.span.remove_mark();
1865 let item = self.resolve_ident_in_module_unadjusted(
1866 ModuleOrUniformRoot::Module(module),
1873 if let Ok(binding) = item {
1874 // The ident resolves to an item.
1875 return Some(LexicalScopeBinding::Item(binding));
1879 ModuleKind::Block(..) => {} // We can see through blocks
1884 ident = normalized_ident;
1885 let mut poisoned = None;
1887 let opt_module = if let Some(node_id) = record_used_id {
1888 self.hygienic_lexical_parent_with_compatibility_fallback(
1895 self.hygienic_lexical_parent(module, &mut ident.span)
1897 module = unwrap_or!(opt_module, break);
1898 let adjusted_parent_scope = &ParentScope { module, ..*parent_scope };
1899 let result = self.resolve_ident_in_module_unadjusted(
1900 ModuleOrUniformRoot::Module(module),
1903 adjusted_parent_scope,
1910 if let Some(node_id) = poisoned {
1911 self.lint_buffer.buffer_lint_with_diagnostic(
1912 lint::builtin::PROC_MACRO_DERIVE_RESOLUTION_FALLBACK,
1915 &format!("cannot find {} `{}` in this scope", ns.descr(), ident),
1916 BuiltinLintDiagnostics::ProcMacroDeriveResolutionFallback(ident.span),
1919 return Some(LexicalScopeBinding::Item(binding));
1921 Err(Determined) => continue,
1922 Err(Undetermined) => {
1923 span_bug!(ident.span, "undetermined resolution during main resolution pass")
1928 if !module.no_implicit_prelude {
1929 ident.span.adjust(ExpnId::root());
1931 if let Some(binding) = self.extern_prelude_get(ident, !record_used) {
1932 return Some(LexicalScopeBinding::Item(binding));
1934 if let Some(ident) = self.registered_tools.get(&ident) {
1936 (Res::ToolMod, ty::Visibility::Public, ident.span, ExpnId::root())
1937 .to_name_binding(self.arenas);
1938 return Some(LexicalScopeBinding::Item(binding));
1941 if let Some(prelude) = self.prelude {
1942 if let Ok(binding) = self.resolve_ident_in_module_unadjusted(
1943 ModuleOrUniformRoot::Module(prelude),
1950 return Some(LexicalScopeBinding::Item(binding));
1956 if let Some(prim_ty) = self.primitive_type_table.primitive_types.get(&ident.name) {
1958 (Res::PrimTy(*prim_ty), ty::Visibility::Public, DUMMY_SP, ExpnId::root())
1959 .to_name_binding(self.arenas);
1960 return Some(LexicalScopeBinding::Item(binding));
1967 fn hygienic_lexical_parent(
1971 ) -> Option<Module<'a>> {
1972 if !module.expansion.outer_expn_is_descendant_of(span.ctxt()) {
1973 return Some(self.macro_def_scope(span.remove_mark()));
1976 if let ModuleKind::Block(..) = module.kind {
1977 return Some(module.parent.unwrap().nearest_item_scope());
1983 fn hygienic_lexical_parent_with_compatibility_fallback(
1988 poisoned: &mut Option<NodeId>,
1989 ) -> Option<Module<'a>> {
1990 if let module @ Some(..) = self.hygienic_lexical_parent(module, span) {
1994 // We need to support the next case under a deprecation warning
1997 // ---- begin: this comes from a proc macro derive
1998 // mod implementation_details {
1999 // // Note that `MyStruct` is not in scope here.
2000 // impl SomeTrait for MyStruct { ... }
2004 // So we have to fall back to the module's parent during lexical resolution in this case.
2005 if let Some(parent) = module.parent {
2006 // Inner module is inside the macro, parent module is outside of the macro.
2007 if module.expansion != parent.expansion
2008 && module.expansion.is_descendant_of(parent.expansion)
2010 // The macro is a proc macro derive
2011 if let Some(def_id) = module.expansion.expn_data().macro_def_id {
2012 let ext = self.get_macro_by_def_id(def_id);
2014 && ext.macro_kind() == MacroKind::Derive
2015 && parent.expansion.outer_expn_is_descendant_of(span.ctxt())
2017 *poisoned = Some(node_id);
2018 return module.parent;
2027 fn resolve_ident_in_module(
2029 module: ModuleOrUniformRoot<'a>,
2032 parent_scope: &ParentScope<'a>,
2035 ) -> Result<&'a NameBinding<'a>, Determinacy> {
2036 self.resolve_ident_in_module_ext(module, ident, ns, parent_scope, record_used, path_span)
2037 .map_err(|(determinacy, _)| determinacy)
2040 fn resolve_ident_in_module_ext(
2042 module: ModuleOrUniformRoot<'a>,
2045 parent_scope: &ParentScope<'a>,
2048 ) -> Result<&'a NameBinding<'a>, (Determinacy, Weak)> {
2049 let tmp_parent_scope;
2050 let mut adjusted_parent_scope = parent_scope;
2052 ModuleOrUniformRoot::Module(m) => {
2053 if let Some(def) = ident.span.normalize_to_macros_2_0_and_adjust(m.expansion) {
2055 ParentScope { module: self.macro_def_scope(def), ..*parent_scope };
2056 adjusted_parent_scope = &tmp_parent_scope;
2059 ModuleOrUniformRoot::ExternPrelude => {
2060 ident.span.normalize_to_macros_2_0_and_adjust(ExpnId::root());
2062 ModuleOrUniformRoot::CrateRootAndExternPrelude | ModuleOrUniformRoot::CurrentScope => {
2066 self.resolve_ident_in_module_unadjusted_ext(
2070 adjusted_parent_scope,
2077 fn resolve_crate_root(&mut self, ident: Ident) -> Module<'a> {
2078 debug!("resolve_crate_root({:?})", ident);
2079 let mut ctxt = ident.span.ctxt();
2080 let mark = if ident.name == kw::DollarCrate {
2081 // When resolving `$crate` from a `macro_rules!` invoked in a `macro`,
2082 // we don't want to pretend that the `macro_rules!` definition is in the `macro`
2083 // as described in `SyntaxContext::apply_mark`, so we ignore prepended opaque marks.
2084 // FIXME: This is only a guess and it doesn't work correctly for `macro_rules!`
2085 // definitions actually produced by `macro` and `macro` definitions produced by
2086 // `macro_rules!`, but at least such configurations are not stable yet.
2087 ctxt = ctxt.normalize_to_macro_rules();
2089 "resolve_crate_root: marks={:?}",
2090 ctxt.marks().into_iter().map(|(i, t)| (i.expn_data(), t)).collect::<Vec<_>>()
2092 let mut iter = ctxt.marks().into_iter().rev().peekable();
2093 let mut result = None;
2094 // Find the last opaque mark from the end if it exists.
2095 while let Some(&(mark, transparency)) = iter.peek() {
2096 if transparency == Transparency::Opaque {
2097 result = Some(mark);
2104 "resolve_crate_root: found opaque mark {:?} {:?}",
2106 result.map(|r| r.expn_data())
2108 // Then find the last semi-transparent mark from the end if it exists.
2109 for (mark, transparency) in iter {
2110 if transparency == Transparency::SemiTransparent {
2111 result = Some(mark);
2117 "resolve_crate_root: found semi-transparent mark {:?} {:?}",
2119 result.map(|r| r.expn_data())
2123 debug!("resolve_crate_root: not DollarCrate");
2124 ctxt = ctxt.normalize_to_macros_2_0();
2125 ctxt.adjust(ExpnId::root())
2127 let module = match mark {
2128 Some(def) => self.macro_def_scope(def),
2131 "resolve_crate_root({:?}): found no mark (ident.span = {:?})",
2134 return self.graph_root;
2137 let module = self.get_module(DefId { index: CRATE_DEF_INDEX, ..module.nearest_parent_mod });
2139 "resolve_crate_root({:?}): got module {:?} ({:?}) (ident.span = {:?})",
2148 fn resolve_self(&mut self, ctxt: &mut SyntaxContext, module: Module<'a>) -> Module<'a> {
2149 let mut module = self.get_module(module.nearest_parent_mod);
2150 while module.span.ctxt().normalize_to_macros_2_0() != *ctxt {
2151 let parent = module.parent.unwrap_or_else(|| self.macro_def_scope(ctxt.remove_mark()));
2152 module = self.get_module(parent.nearest_parent_mod);
2160 opt_ns: Option<Namespace>, // `None` indicates a module path in import
2161 parent_scope: &ParentScope<'a>,
2164 crate_lint: CrateLint,
2165 ) -> PathResult<'a> {
2166 self.resolve_path_with_ribs(
2177 fn resolve_path_with_ribs(
2180 opt_ns: Option<Namespace>, // `None` indicates a module path in import
2181 parent_scope: &ParentScope<'a>,
2184 crate_lint: CrateLint,
2185 ribs: Option<&PerNS<Vec<Rib<'a>>>>,
2186 ) -> PathResult<'a> {
2187 let mut module = None;
2188 let mut allow_super = true;
2189 let mut second_binding = None;
2192 "resolve_path(path={:?}, opt_ns={:?}, record_used={:?}, \
2193 path_span={:?}, crate_lint={:?})",
2194 path, opt_ns, record_used, path_span, crate_lint,
2197 for (i, &Segment { ident, id, has_generic_args: _ }) in path.iter().enumerate() {
2198 debug!("resolve_path ident {} {:?} {:?}", i, ident, id);
2199 let record_segment_res = |this: &mut Self, res| {
2201 if let Some(id) = id {
2202 if !this.partial_res_map.contains_key(&id) {
2203 assert!(id != ast::DUMMY_NODE_ID, "Trying to resolve dummy id");
2204 this.record_partial_res(id, PartialRes::new(res));
2210 let is_last = i == path.len() - 1;
2211 let ns = if is_last { opt_ns.unwrap_or(TypeNS) } else { TypeNS };
2212 let name = ident.name;
2214 allow_super &= ns == TypeNS && (name == kw::SelfLower || name == kw::Super);
2217 if allow_super && name == kw::Super {
2218 let mut ctxt = ident.span.ctxt().normalize_to_macros_2_0();
2219 let self_module = match i {
2220 0 => Some(self.resolve_self(&mut ctxt, parent_scope.module)),
2222 Some(ModuleOrUniformRoot::Module(module)) => Some(module),
2226 if let Some(self_module) = self_module {
2227 if let Some(parent) = self_module.parent {
2228 module = Some(ModuleOrUniformRoot::Module(
2229 self.resolve_self(&mut ctxt, parent),
2234 let msg = "there are too many leading `super` keywords".to_string();
2235 return PathResult::Failed {
2239 is_error_from_last_segment: false,
2243 if name == kw::SelfLower {
2244 let mut ctxt = ident.span.ctxt().normalize_to_macros_2_0();
2245 module = Some(ModuleOrUniformRoot::Module(
2246 self.resolve_self(&mut ctxt, parent_scope.module),
2250 if name == kw::PathRoot && ident.span.rust_2018() {
2251 module = Some(ModuleOrUniformRoot::ExternPrelude);
2254 if name == kw::PathRoot && ident.span.rust_2015() && self.session.rust_2018() {
2255 // `::a::b` from 2015 macro on 2018 global edition
2256 module = Some(ModuleOrUniformRoot::CrateRootAndExternPrelude);
2259 if name == kw::PathRoot || name == kw::Crate || name == kw::DollarCrate {
2260 // `::a::b`, `crate::a::b` or `$crate::a::b`
2261 module = Some(ModuleOrUniformRoot::Module(self.resolve_crate_root(ident)));
2267 // Report special messages for path segment keywords in wrong positions.
2268 if ident.is_path_segment_keyword() && i != 0 {
2269 let name_str = if name == kw::PathRoot {
2270 "crate root".to_string()
2272 format!("`{}`", name)
2274 let label = if i == 1 && path[0].ident.name == kw::PathRoot {
2275 format!("global paths cannot start with {}", name_str)
2277 format!("{} in paths can only be used in start position", name_str)
2279 return PathResult::Failed {
2283 is_error_from_last_segment: false,
2287 enum FindBindingResult<'a> {
2288 Binding(Result<&'a NameBinding<'a>, Determinacy>),
2289 PathResult(PathResult<'a>),
2291 let find_binding_in_ns = |this: &mut Self, ns| {
2292 let binding = if let Some(module) = module {
2293 this.resolve_ident_in_module(
2301 } else if ribs.is_none() || opt_ns.is_none() || opt_ns == Some(MacroNS) {
2302 let scopes = ScopeSet::All(ns, opt_ns.is_none());
2303 this.early_resolve_ident_in_lexical_scope(
2312 let record_used_id = if record_used {
2313 crate_lint.node_id().or(Some(CRATE_NODE_ID))
2317 match this.resolve_ident_in_lexical_scope(
2325 // we found a locally-imported or available item/module
2326 Some(LexicalScopeBinding::Item(binding)) => Ok(binding),
2327 // we found a local variable or type param
2328 Some(LexicalScopeBinding::Res(res))
2329 if opt_ns == Some(TypeNS) || opt_ns == Some(ValueNS) =>
2331 record_segment_res(this, res);
2332 return FindBindingResult::PathResult(PathResult::NonModule(
2333 PartialRes::with_unresolved_segments(res, path.len() - 1),
2336 _ => Err(Determinacy::determined(record_used)),
2339 FindBindingResult::Binding(binding)
2341 let binding = match find_binding_in_ns(self, ns) {
2342 FindBindingResult::PathResult(x) => return x,
2343 FindBindingResult::Binding(binding) => binding,
2348 second_binding = Some(binding);
2350 let res = binding.res();
2351 let maybe_assoc = opt_ns != Some(MacroNS) && PathSource::Type.is_expected(res);
2352 if let Some(next_module) = binding.module() {
2353 module = Some(ModuleOrUniformRoot::Module(next_module));
2354 record_segment_res(self, res);
2355 } else if res == Res::ToolMod && i + 1 != path.len() {
2356 if binding.is_import() {
2360 "cannot use a tool module through an import",
2362 .span_note(binding.span, "the tool module imported here")
2365 let res = Res::NonMacroAttr(NonMacroAttrKind::Tool);
2366 return PathResult::NonModule(PartialRes::new(res));
2367 } else if res == Res::Err {
2368 return PathResult::NonModule(PartialRes::new(Res::Err));
2369 } else if opt_ns.is_some() && (is_last || maybe_assoc) {
2370 self.lint_if_path_starts_with_module(
2376 return PathResult::NonModule(PartialRes::with_unresolved_segments(
2381 let label = format!(
2382 "`{}` is {} {}, not a module",
2388 return PathResult::Failed {
2392 is_error_from_last_segment: is_last,
2396 Err(Undetermined) => return PathResult::Indeterminate,
2397 Err(Determined) => {
2398 if let Some(ModuleOrUniformRoot::Module(module)) = module {
2399 if opt_ns.is_some() && !module.is_normal() {
2400 return PathResult::NonModule(PartialRes::with_unresolved_segments(
2401 module.res().unwrap(),
2406 let module_res = match module {
2407 Some(ModuleOrUniformRoot::Module(module)) => module.res(),
2410 let (label, suggestion) = if module_res == self.graph_root.res() {
2411 let is_mod = |res| matches!(res, Res::Def(DefKind::Mod, _));
2412 // Don't look up import candidates if this is a speculative resolve
2413 let mut candidates = if record_used {
2414 self.lookup_import_candidates(ident, TypeNS, parent_scope, is_mod)
2418 candidates.sort_by_cached_key(|c| {
2419 (c.path.segments.len(), pprust::path_to_string(&c.path))
2421 if let Some(candidate) = candidates.get(0) {
2423 String::from("unresolved import"),
2425 vec![(ident.span, pprust::path_to_string(&candidate.path))],
2426 String::from("a similar path exists"),
2427 Applicability::MaybeIncorrect,
2431 (format!("maybe a missing crate `{}`?", ident), None)
2439 .map_or(false, |c| c.is_ascii_uppercase())
2441 (format!("use of undeclared type `{}`", ident), None)
2443 (format!("use of undeclared crate or module `{}`", ident), None)
2447 format!("could not find `{}` in `{}`", ident, path[i - 1].ident);
2448 if ns == TypeNS || ns == ValueNS {
2449 let ns_to_try = if ns == TypeNS { ValueNS } else { TypeNS };
2450 if let FindBindingResult::Binding(Ok(binding)) =
2451 find_binding_in_ns(self, ns_to_try)
2453 let mut found = |what| {
2455 "expected {}, found {} `{}` in `{}`",
2462 if binding.module().is_some() {
2465 match binding.res() {
2466 def::Res::<NodeId>::Def(kind, id) => found(kind.descr(id)),
2467 _ => found(ns_to_try.descr()),
2474 return PathResult::Failed {
2478 is_error_from_last_segment: is_last,
2484 self.lint_if_path_starts_with_module(crate_lint, path, path_span, second_binding);
2486 PathResult::Module(match module {
2487 Some(module) => module,
2488 None if path.is_empty() => ModuleOrUniformRoot::CurrentScope,
2489 _ => span_bug!(path_span, "resolve_path: non-empty path `{:?}` has no module", path),
2493 fn lint_if_path_starts_with_module(
2495 crate_lint: CrateLint,
2498 second_binding: Option<&NameBinding<'_>>,
2500 let (diag_id, diag_span) = match crate_lint {
2501 CrateLint::No => return,
2502 CrateLint::SimplePath(id) => (id, path_span),
2503 CrateLint::UsePath { root_id, root_span } => (root_id, root_span),
2504 CrateLint::QPathTrait { qpath_id, qpath_span } => (qpath_id, qpath_span),
2507 let first_name = match path.get(0) {
2508 // In the 2018 edition this lint is a hard error, so nothing to do
2509 Some(seg) if seg.ident.span.rust_2015() && self.session.rust_2015() => seg.ident.name,
2513 // We're only interested in `use` paths which should start with
2514 // `{{root}}` currently.
2515 if first_name != kw::PathRoot {
2520 // If this import looks like `crate::...` it's already good
2521 Some(Segment { ident, .. }) if ident.name == kw::Crate => return,
2522 // Otherwise go below to see if it's an extern crate
2524 // If the path has length one (and it's `PathRoot` most likely)
2525 // then we don't know whether we're gonna be importing a crate or an
2526 // item in our crate. Defer this lint to elsewhere
2530 // If the first element of our path was actually resolved to an
2531 // `ExternCrate` (also used for `crate::...`) then no need to issue a
2532 // warning, this looks all good!
2533 if let Some(binding) = second_binding {
2534 if let NameBindingKind::Import { import, .. } = binding.kind {
2535 // Careful: we still want to rewrite paths from renamed extern crates.
2536 if let ImportKind::ExternCrate { source: None, .. } = import.kind {
2542 let diag = BuiltinLintDiagnostics::AbsPathWithModule(diag_span);
2543 self.lint_buffer.buffer_lint_with_diagnostic(
2544 lint::builtin::ABSOLUTE_PATHS_NOT_STARTING_WITH_CRATE,
2547 "absolute paths must start with `self`, `super`, \
2548 `crate`, or an external crate name in the 2018 edition",
2553 // Validate a local resolution (from ribs).
2554 fn validate_res_from_ribs(
2561 original_rib_ident_def: Ident,
2562 all_ribs: &[Rib<'a>],
2564 const CG_BUG_STR: &str = "min_const_generics resolve check didn't stop compilation";
2565 debug!("validate_res_from_ribs({:?})", res);
2566 let ribs = &all_ribs[rib_index + 1..];
2568 // An invalid forward use of a type parameter from a previous default.
2569 if let ForwardTyParamBanRibKind = all_ribs[rib_index].kind {
2571 let res_error = if rib_ident.name == kw::SelfUpper {
2572 ResolutionError::SelfInTyParamDefault
2574 ResolutionError::ForwardDeclaredTyParam
2576 self.report_error(span, res_error);
2578 assert_eq!(res, Res::Err);
2584 use ResolutionError::*;
2585 let mut res_err = None;
2590 | ClosureOrAsyncRibKind
2592 | MacroDefinition(..)
2593 | ForwardTyParamBanRibKind => {
2594 // Nothing to do. Continue.
2596 ItemRibKind(_) | FnItemRibKind | AssocItemRibKind => {
2597 // This was an attempt to access an upvar inside a
2598 // named function item. This is not allowed, so we
2601 // We don't immediately trigger a resolve error, because
2602 // we want certain other resolution errors (namely those
2603 // emitted for `ConstantItemRibKind` below) to take
2605 res_err = Some(CannotCaptureDynamicEnvironmentInFnItem);
2608 ConstantItemRibKind(_, item) => {
2609 // Still doesn't deal with upvars
2611 let (span, resolution_error) =
2612 if let Some((ident, constant_item_kind)) = item {
2613 let kind_str = match constant_item_kind {
2614 ConstantItemKind::Const => "const",
2615 ConstantItemKind::Static => "static",
2618 "consider using `let` instead of `{}`",
2621 (span, AttemptToUseNonConstantValueInConstant(ident, sugg))
2623 let sugg = "consider using `const` instead of `let`";
2626 AttemptToUseNonConstantValueInConstant(
2627 original_rib_ident_def,
2632 self.report_error(span, resolution_error);
2636 ConstParamTyRibKind => {
2638 self.report_error(span, ParamInTyOfConstParam(rib_ident.name));
2644 if let Some(res_err) = res_err {
2645 self.report_error(span, res_err);
2649 Res::Def(DefKind::TyParam, _) | Res::SelfTy(..) => {
2650 let mut in_ty_param_default = false;
2652 let has_generic_params = match rib.kind {
2654 | ClosureOrAsyncRibKind
2657 | MacroDefinition(..) => {
2658 // Nothing to do. Continue.
2662 // We only forbid constant items if we are inside of type defaults,
2663 // for example `struct Foo<T, U = [u8; std::mem::size_of::<T>()]>`
2664 ForwardTyParamBanRibKind => {
2665 in_ty_param_default = true;
2668 ConstantItemRibKind(trivial, _) => {
2669 let features = self.session.features_untracked();
2670 // HACK(min_const_generics): We currently only allow `N` or `{ N }`.
2672 || features.const_generics
2673 || features.lazy_normalization_consts)
2675 // HACK(min_const_generics): If we encounter `Self` in an anonymous constant
2676 // we can't easily tell if it's generic at this stage, so we instead remember
2677 // this and then enforce the self type to be concrete later on.
2678 if let Res::SelfTy(trait_def, Some((impl_def, _))) = res {
2679 res = Res::SelfTy(trait_def, Some((impl_def, true)));
2684 ResolutionError::ParamInNonTrivialAnonConst {
2685 name: rib_ident.name,
2691 self.session.delay_span_bug(span, CG_BUG_STR);
2696 if in_ty_param_default {
2700 ResolutionError::ParamInAnonConstInTyDefault(
2711 // This was an attempt to use a type parameter outside its scope.
2712 ItemRibKind(has_generic_params) => has_generic_params,
2713 FnItemRibKind => HasGenericParams::Yes,
2714 ConstParamTyRibKind => {
2718 ResolutionError::ParamInTyOfConstParam(rib_ident.name),
2728 ResolutionError::GenericParamsFromOuterFunction(
2737 Res::Def(DefKind::ConstParam, _) => {
2738 let mut ribs = ribs.iter().peekable();
2739 if let Some(Rib { kind: FnItemRibKind, .. }) = ribs.peek() {
2740 // When declaring const parameters inside function signatures, the first rib
2741 // is always a `FnItemRibKind`. In this case, we can skip it, to avoid it
2742 // (spuriously) conflicting with the const param.
2746 let mut in_ty_param_default = false;
2748 let has_generic_params = match rib.kind {
2750 | ClosureOrAsyncRibKind
2753 | MacroDefinition(..) => continue,
2755 // We only forbid constant items if we are inside of type defaults,
2756 // for example `struct Foo<T, U = [u8; std::mem::size_of::<T>()]>`
2757 ForwardTyParamBanRibKind => {
2758 in_ty_param_default = true;
2761 ConstantItemRibKind(trivial, _) => {
2762 let features = self.session.features_untracked();
2763 // HACK(min_const_generics): We currently only allow `N` or `{ N }`.
2765 || features.const_generics
2766 || features.lazy_normalization_consts)
2771 ResolutionError::ParamInNonTrivialAnonConst {
2772 name: rib_ident.name,
2778 self.session.delay_span_bug(span, CG_BUG_STR);
2782 if in_ty_param_default {
2786 ResolutionError::ParamInAnonConstInTyDefault(
2797 ItemRibKind(has_generic_params) => has_generic_params,
2798 FnItemRibKind => HasGenericParams::Yes,
2799 ConstParamTyRibKind => {
2803 ResolutionError::ParamInTyOfConstParam(rib_ident.name),
2810 // This was an attempt to use a const parameter outside its scope.
2814 ResolutionError::GenericParamsFromOuterFunction(
2828 fn record_partial_res(&mut self, node_id: NodeId, resolution: PartialRes) {
2829 debug!("(recording res) recording {:?} for {}", resolution, node_id);
2830 if let Some(prev_res) = self.partial_res_map.insert(node_id, resolution) {
2831 panic!("path resolved multiple times ({:?} before, {:?} now)", prev_res, resolution);
2835 fn is_accessible_from(&self, vis: ty::Visibility, module: Module<'a>) -> bool {
2836 vis.is_accessible_from(module.nearest_parent_mod, self)
2839 fn set_binding_parent_module(&mut self, binding: &'a NameBinding<'a>, module: Module<'a>) {
2840 if let Some(old_module) = self.binding_parent_modules.insert(PtrKey(binding), module) {
2841 if !ptr::eq(module, old_module) {
2842 span_bug!(binding.span, "parent module is reset for binding");
2847 fn disambiguate_macro_rules_vs_modularized(
2849 macro_rules: &'a NameBinding<'a>,
2850 modularized: &'a NameBinding<'a>,
2852 // Some non-controversial subset of ambiguities "modularized macro name" vs "macro_rules"
2853 // is disambiguated to mitigate regressions from macro modularization.
2854 // Scoping for `macro_rules` behaves like scoping for `let` at module level, in general.
2856 self.binding_parent_modules.get(&PtrKey(macro_rules)),
2857 self.binding_parent_modules.get(&PtrKey(modularized)),
2859 (Some(macro_rules), Some(modularized)) => {
2860 macro_rules.nearest_parent_mod == modularized.nearest_parent_mod
2861 && modularized.is_ancestor_of(macro_rules)
2867 fn report_errors(&mut self, krate: &Crate) {
2868 self.report_with_use_injections(krate);
2870 for &(span_use, span_def) in &self.macro_expanded_macro_export_errors {
2871 let msg = "macro-expanded `macro_export` macros from the current crate \
2872 cannot be referred to by absolute paths";
2873 self.lint_buffer.buffer_lint_with_diagnostic(
2874 lint::builtin::MACRO_EXPANDED_MACRO_EXPORTS_ACCESSED_BY_ABSOLUTE_PATHS,
2878 BuiltinLintDiagnostics::MacroExpandedMacroExportsAccessedByAbsolutePaths(span_def),
2882 for ambiguity_error in &self.ambiguity_errors {
2883 self.report_ambiguity_error(ambiguity_error);
2886 let mut reported_spans = FxHashSet::default();
2887 for error in &self.privacy_errors {
2888 if reported_spans.insert(error.dedup_span) {
2889 self.report_privacy_error(error);
2894 fn report_with_use_injections(&mut self, krate: &Crate) {
2895 for UseError { mut err, candidates, def_id, instead, suggestion } in
2896 self.use_injections.drain(..)
2898 let (span, found_use) = if let Some(def_id) = def_id.as_local() {
2899 UsePlacementFinder::check(krate, self.def_id_to_node_id[def_id])
2903 if !candidates.is_empty() {
2904 diagnostics::show_candidates(&mut err, span, &candidates, instead, found_use);
2905 } else if let Some((span, msg, sugg, appl)) = suggestion {
2906 err.span_suggestion(span, msg, sugg, appl);
2912 fn report_conflict<'b>(
2917 new_binding: &NameBinding<'b>,
2918 old_binding: &NameBinding<'b>,
2920 // Error on the second of two conflicting names
2921 if old_binding.span.lo() > new_binding.span.lo() {
2922 return self.report_conflict(parent, ident, ns, old_binding, new_binding);
2925 let container = match parent.kind {
2926 ModuleKind::Def(kind, _, _) => kind.descr(parent.def_id().unwrap()),
2927 ModuleKind::Block(..) => "block",
2930 let old_noun = match old_binding.is_import() {
2932 false => "definition",
2935 let new_participle = match new_binding.is_import() {
2941 (ident.name, self.session.source_map().guess_head_span(new_binding.span));
2943 if let Some(s) = self.name_already_seen.get(&name) {
2949 let old_kind = match (ns, old_binding.module()) {
2950 (ValueNS, _) => "value",
2951 (MacroNS, _) => "macro",
2952 (TypeNS, _) if old_binding.is_extern_crate() => "extern crate",
2953 (TypeNS, Some(module)) if module.is_normal() => "module",
2954 (TypeNS, Some(module)) if module.is_trait() => "trait",
2955 (TypeNS, _) => "type",
2958 let msg = format!("the name `{}` is defined multiple times", name);
2960 let mut err = match (old_binding.is_extern_crate(), new_binding.is_extern_crate()) {
2961 (true, true) => struct_span_err!(self.session, span, E0259, "{}", msg),
2962 (true, _) | (_, true) => match new_binding.is_import() && old_binding.is_import() {
2963 true => struct_span_err!(self.session, span, E0254, "{}", msg),
2964 false => struct_span_err!(self.session, span, E0260, "{}", msg),
2966 _ => match (old_binding.is_import(), new_binding.is_import()) {
2967 (false, false) => struct_span_err!(self.session, span, E0428, "{}", msg),
2968 (true, true) => struct_span_err!(self.session, span, E0252, "{}", msg),
2969 _ => struct_span_err!(self.session, span, E0255, "{}", msg),
2974 "`{}` must be defined only once in the {} namespace of this {}",
2980 err.span_label(span, format!("`{}` re{} here", name, new_participle));
2982 self.session.source_map().guess_head_span(old_binding.span),
2983 format!("previous {} of the {} `{}` here", old_noun, old_kind, name),
2986 // See https://github.com/rust-lang/rust/issues/32354
2987 use NameBindingKind::Import;
2988 let import = match (&new_binding.kind, &old_binding.kind) {
2989 // If there are two imports where one or both have attributes then prefer removing the
2990 // import without attributes.
2991 (Import { import: new, .. }, Import { import: old, .. })
2993 !new_binding.span.is_dummy()
2994 && !old_binding.span.is_dummy()
2995 && (new.has_attributes || old.has_attributes)
2998 if old.has_attributes {
2999 Some((new, new_binding.span, true))
3001 Some((old, old_binding.span, true))
3004 // Otherwise prioritize the new binding.
3005 (Import { import, .. }, other) if !new_binding.span.is_dummy() => {
3006 Some((import, new_binding.span, other.is_import()))
3008 (other, Import { import, .. }) if !old_binding.span.is_dummy() => {
3009 Some((import, old_binding.span, other.is_import()))
3014 // Check if the target of the use for both bindings is the same.
3015 let duplicate = new_binding.res().opt_def_id() == old_binding.res().opt_def_id();
3016 let has_dummy_span = new_binding.span.is_dummy() || old_binding.span.is_dummy();
3018 self.extern_prelude.get(&ident).map(|entry| entry.introduced_by_item).unwrap_or(true);
3019 // Only suggest removing an import if both bindings are to the same def, if both spans
3020 // aren't dummy spans. Further, if both bindings are imports, then the ident must have
3021 // been introduced by a item.
3022 let should_remove_import = duplicate
3024 && ((new_binding.is_extern_crate() || old_binding.is_extern_crate()) || from_item);
3027 Some((import, span, true)) if should_remove_import && import.is_nested() => {
3028 self.add_suggestion_for_duplicate_nested_use(&mut err, import, span)
3030 Some((import, _, true)) if should_remove_import && !import.is_glob() => {
3031 // Simple case - remove the entire import. Due to the above match arm, this can
3032 // only be a single use so just remove it entirely.
3033 err.tool_only_span_suggestion(
3034 import.use_span_with_attributes,
3035 "remove unnecessary import",
3037 Applicability::MaybeIncorrect,
3040 Some((import, span, _)) => {
3041 self.add_suggestion_for_rename_of_use(&mut err, name, import, span)
3047 self.name_already_seen.insert(name, span);
3050 /// This function adds a suggestion to change the binding name of a new import that conflicts
3051 /// with an existing import.
3053 /// ```text,ignore (diagnostic)
3054 /// help: you can use `as` to change the binding name of the import
3056 /// LL | use foo::bar as other_bar;
3057 /// | ^^^^^^^^^^^^^^^^^^^^^
3059 fn add_suggestion_for_rename_of_use(
3061 err: &mut DiagnosticBuilder<'_>,
3063 import: &Import<'_>,
3066 let suggested_name = if name.as_str().chars().next().unwrap().is_uppercase() {
3067 format!("Other{}", name)
3069 format!("other_{}", name)
3072 let mut suggestion = None;
3074 ImportKind::Single { type_ns_only: true, .. } => {
3075 suggestion = Some(format!("self as {}", suggested_name))
3077 ImportKind::Single { source, .. } => {
3079 source.span.hi().0.checked_sub(binding_span.lo().0).map(|pos| pos as usize)
3081 if let Ok(snippet) = self.session.source_map().span_to_snippet(binding_span) {
3082 if pos <= snippet.len() {
3083 suggestion = Some(format!(
3087 if snippet.ends_with(';') { ";" } else { "" }
3093 ImportKind::ExternCrate { source, target, .. } => {
3094 suggestion = Some(format!(
3095 "extern crate {} as {};",
3096 source.unwrap_or(target.name),
3100 _ => unreachable!(),
3103 let rename_msg = "you can use `as` to change the binding name of the import";
3104 if let Some(suggestion) = suggestion {
3105 err.span_suggestion(
3109 Applicability::MaybeIncorrect,
3112 err.span_label(binding_span, rename_msg);
3116 /// This function adds a suggestion to remove a unnecessary binding from an import that is
3117 /// nested. In the following example, this function will be invoked to remove the `a` binding
3118 /// in the second use statement:
3120 /// ```ignore (diagnostic)
3121 /// use issue_52891::a;
3122 /// use issue_52891::{d, a, e};
3125 /// The following suggestion will be added:
3127 /// ```ignore (diagnostic)
3128 /// use issue_52891::{d, a, e};
3129 /// ^-- help: remove unnecessary import
3132 /// If the nested use contains only one import then the suggestion will remove the entire
3135 /// It is expected that the provided import is nested - this isn't checked by the
3136 /// function. If this invariant is not upheld, this function's behaviour will be unexpected
3137 /// as characters expected by span manipulations won't be present.
3138 fn add_suggestion_for_duplicate_nested_use(
3140 err: &mut DiagnosticBuilder<'_>,
3141 import: &Import<'_>,
3144 assert!(import.is_nested());
3145 let message = "remove unnecessary import";
3147 // Two examples will be used to illustrate the span manipulations we're doing:
3149 // - Given `use issue_52891::{d, a, e};` where `a` is a duplicate then `binding_span` is
3150 // `a` and `import.use_span` is `issue_52891::{d, a, e};`.
3151 // - Given `use issue_52891::{d, e, a};` where `a` is a duplicate then `binding_span` is
3152 // `a` and `import.use_span` is `issue_52891::{d, e, a};`.
3154 let (found_closing_brace, span) =
3155 find_span_of_binding_until_next_binding(self.session, binding_span, import.use_span);
3157 // If there was a closing brace then identify the span to remove any trailing commas from
3158 // previous imports.
3159 if found_closing_brace {
3160 if let Some(span) = extend_span_to_previous_binding(self.session, span) {
3161 err.tool_only_span_suggestion(
3165 Applicability::MaybeIncorrect,
3168 // Remove the entire line if we cannot extend the span back, this indicates a
3169 // `issue_52891::{self}` case.
3170 err.span_suggestion(
3171 import.use_span_with_attributes,
3174 Applicability::MaybeIncorrect,
3181 err.span_suggestion(span, message, String::new(), Applicability::MachineApplicable);
3184 fn extern_prelude_get(
3188 ) -> Option<&'a NameBinding<'a>> {
3189 if ident.is_path_segment_keyword() {
3190 // Make sure `self`, `super` etc produce an error when passed to here.
3193 self.extern_prelude.get(&ident.normalize_to_macros_2_0()).cloned().and_then(|entry| {
3194 if let Some(binding) = entry.extern_crate_item {
3195 if !speculative && entry.introduced_by_item {
3196 self.record_use(ident, TypeNS, binding, false);
3200 let crate_id = if !speculative {
3201 self.crate_loader.process_path_extern(ident.name, ident.span)
3203 self.crate_loader.maybe_process_path_extern(ident.name)?
3205 let crate_root = self.get_module(DefId { krate: crate_id, index: CRATE_DEF_INDEX });
3207 (crate_root, ty::Visibility::Public, DUMMY_SP, ExpnId::root())
3208 .to_name_binding(self.arenas),
3214 /// This is equivalent to `get_traits_in_module_containing_item`, but without filtering by the associated item.
3216 /// This is used by rustdoc for intra-doc links.
3217 pub fn traits_in_scope(&mut self, module_id: DefId) -> Vec<TraitCandidate> {
3218 let module = self.get_module(module_id);
3219 module.ensure_traits(self);
3220 let traits = module.traits.borrow();
3222 |this: &mut Self, &(trait_name, binding): &(Ident, &NameBinding<'_>)| TraitCandidate {
3223 def_id: binding.res().def_id(),
3224 import_ids: this.find_transitive_imports(&binding.kind, trait_name),
3227 let mut candidates: Vec<_> =
3228 traits.as_ref().unwrap().iter().map(|x| to_candidate(self, x)).collect();
3230 if let Some(prelude) = self.prelude {
3231 if !module.no_implicit_prelude {
3232 prelude.ensure_traits(self);
3234 prelude.traits.borrow().as_ref().unwrap().iter().map(|x| to_candidate(self, x)),
3242 /// Rustdoc uses this to resolve things in a recoverable way. `ResolutionError<'a>`
3243 /// isn't something that can be returned because it can't be made to live that long,
3244 /// and also it's a private type. Fortunately rustdoc doesn't need to know the error,
3245 /// just that an error occurred.
3246 // FIXME(Manishearth): intra-doc links won't get warned of epoch changes.
3247 pub fn resolve_str_path_error(
3253 ) -> Result<(ast::Path, Res), ()> {
3254 let path = if path_str.starts_with("::") {
3257 segments: iter::once(Ident::with_dummy_span(kw::PathRoot))
3258 .chain(path_str.split("::").skip(1).map(Ident::from_str))
3259 .map(|i| self.new_ast_path_segment(i))
3268 .map(Ident::from_str)
3269 .map(|i| self.new_ast_path_segment(i))
3274 let module = self.get_module(module_id);
3275 let parent_scope = &ParentScope::module(module, self);
3276 let res = self.resolve_ast_path(&path, ns, parent_scope).map_err(|_| ())?;
3280 // Resolve a path passed from rustdoc or HIR lowering.
3281 fn resolve_ast_path(
3285 parent_scope: &ParentScope<'a>,
3286 ) -> Result<Res, (Span, ResolutionError<'a>)> {
3287 match self.resolve_path(
3288 &Segment::from_path(path),
3295 PathResult::Module(ModuleOrUniformRoot::Module(module)) => Ok(module.res().unwrap()),
3296 PathResult::NonModule(path_res) if path_res.unresolved_segments() == 0 => {
3297 Ok(path_res.base_res())
3299 PathResult::NonModule(..) => Err((
3301 ResolutionError::FailedToResolve {
3302 label: String::from("type-relative paths are not supported in this context"),
3306 PathResult::Module(..) | PathResult::Indeterminate => unreachable!(),
3307 PathResult::Failed { span, label, suggestion, .. } => {
3308 Err((span, ResolutionError::FailedToResolve { label, suggestion }))
3313 fn new_ast_path_segment(&mut self, ident: Ident) -> ast::PathSegment {
3314 let mut seg = ast::PathSegment::from_ident(ident);
3315 seg.id = self.next_node_id();
3320 pub fn graph_root(&self) -> Module<'a> {
3325 pub fn all_macros(&self) -> &FxHashMap<Symbol, Res> {
3329 /// Retrieves the span of the given `DefId` if `DefId` is in the local crate.
3331 pub fn opt_span(&self, def_id: DefId) -> Option<Span> {
3332 if let Some(def_id) = def_id.as_local() { Some(self.def_id_to_span[def_id]) } else { None }
3336 fn names_to_string(names: &[Symbol]) -> String {
3337 let mut result = String::new();
3338 for (i, name) in names.iter().filter(|name| **name != kw::PathRoot).enumerate() {
3340 result.push_str("::");
3342 if Ident::with_dummy_span(*name).is_raw_guess() {
3343 result.push_str("r#");
3345 result.push_str(&name.as_str());
3350 fn path_names_to_string(path: &Path) -> String {
3351 names_to_string(&path.segments.iter().map(|seg| seg.ident.name).collect::<Vec<_>>())
3354 /// A somewhat inefficient routine to obtain the name of a module.
3355 fn module_to_string(module: Module<'_>) -> Option<String> {
3356 let mut names = Vec::new();
3358 fn collect_mod(names: &mut Vec<Symbol>, module: Module<'_>) {
3359 if let ModuleKind::Def(.., name) = module.kind {
3360 if let Some(parent) = module.parent {
3362 collect_mod(names, parent);
3365 names.push(Symbol::intern("<opaque>"));
3366 collect_mod(names, module.parent.unwrap());
3369 collect_mod(&mut names, module);
3371 if names.is_empty() {
3375 Some(names_to_string(&names))
3378 #[derive(Copy, Clone, Debug)]
3380 /// Do not issue the lint.
3383 /// This lint applies to some arbitrary path; e.g., `impl ::foo::Bar`.
3384 /// In this case, we can take the span of that path.
3387 /// This lint comes from a `use` statement. In this case, what we
3388 /// care about really is the *root* `use` statement; e.g., if we
3389 /// have nested things like `use a::{b, c}`, we care about the
3391 UsePath { root_id: NodeId, root_span: Span },
3393 /// This is the "trait item" from a fully qualified path. For example,
3394 /// we might be resolving `X::Y::Z` from a path like `<T as X::Y>::Z`.
3395 /// The `path_span` is the span of the to the trait itself (`X::Y`).
3396 QPathTrait { qpath_id: NodeId, qpath_span: Span },
3400 fn node_id(&self) -> Option<NodeId> {
3402 CrateLint::No => None,
3403 CrateLint::SimplePath(id)
3404 | CrateLint::UsePath { root_id: id, .. }
3405 | CrateLint::QPathTrait { qpath_id: id, .. } => Some(id),
3410 pub fn provide(providers: &mut Providers) {
3411 late::lifetimes::provide(providers);