1 // Copyright 2012-2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 #![crate_name = "rustc_resolve"]
12 #![unstable(feature = "rustc_private", issue = "27812")]
13 #![crate_type = "dylib"]
14 #![crate_type = "rlib"]
15 #![doc(html_logo_url = "https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png",
16 html_favicon_url = "https://doc.rust-lang.org/favicon.ico",
17 html_root_url = "https://doc.rust-lang.org/nightly/")]
20 #![feature(associated_consts)]
21 #![feature(rustc_diagnostic_macros)]
22 #![feature(rustc_private)]
23 #![feature(staged_api)]
29 extern crate syntax_pos;
30 extern crate rustc_errors as errors;
35 use self::Namespace::*;
36 use self::TypeParameters::*;
39 use rustc::hir::map::{Definitions, DefCollector};
40 use rustc::hir::{self, PrimTy, TyBool, TyChar, TyFloat, TyInt, TyUint, TyStr};
41 use rustc::middle::cstore::CrateLoader;
42 use rustc::session::Session;
44 use rustc::hir::def::*;
45 use rustc::hir::def_id::{CrateNum, CRATE_DEF_INDEX, LOCAL_CRATE, DefId};
47 use rustc::hir::{Freevar, FreevarMap, TraitCandidate, TraitMap, GlobMap};
48 use rustc::util::nodemap::{NodeMap, NodeSet, FxHashMap, FxHashSet, DefIdMap};
50 use syntax::ext::hygiene::{Mark, SyntaxContext};
51 use syntax::ast::{self, Name, NodeId, Ident, SpannedIdent, FloatTy, IntTy, UintTy};
52 use syntax::ext::base::SyntaxExtension;
53 use syntax::ext::base::Determinacy::{Determined, Undetermined};
54 use syntax::ext::base::MacroKind;
55 use syntax::symbol::{Symbol, keywords};
56 use syntax::util::lev_distance::find_best_match_for_name;
58 use syntax::visit::{self, FnKind, Visitor};
60 use syntax::ast::{Arm, BindingMode, Block, Crate, Expr, ExprKind};
61 use syntax::ast::{FnDecl, ForeignItem, ForeignItemKind, Generics};
62 use syntax::ast::{Item, ItemKind, ImplItem, ImplItemKind};
63 use syntax::ast::{Local, Mutability, Pat, PatKind, Path};
64 use syntax::ast::{QSelf, TraitItemKind, TraitRef, Ty, TyKind};
65 use syntax::feature_gate::{feature_err, emit_feature_err, GateIssue};
67 use syntax_pos::{Span, DUMMY_SP, MultiSpan};
68 use errors::DiagnosticBuilder;
70 use std::cell::{Cell, RefCell};
72 use std::collections::BTreeSet;
74 use std::mem::replace;
77 use resolve_imports::{ImportDirective, ImportDirectiveSubclass, NameResolution, ImportResolver};
78 use macros::{InvocationData, LegacyBinding, LegacyScope, MacroBinding};
80 // NB: This module needs to be declared first so diagnostics are
81 // registered before they are used.
86 mod build_reduced_graph;
89 /// A free importable items suggested in case of resolution failure.
90 struct ImportSuggestion {
94 /// A field or associated item from self type suggested in case of resolution failure.
95 enum AssocSuggestion {
102 struct BindingError {
104 origin: BTreeSet<Span>,
105 target: BTreeSet<Span>,
108 impl PartialOrd for BindingError {
109 fn partial_cmp(&self, other: &BindingError) -> Option<cmp::Ordering> {
110 Some(self.cmp(other))
114 impl PartialEq for BindingError {
115 fn eq(&self, other: &BindingError) -> bool {
116 self.name == other.name
120 impl Ord for BindingError {
121 fn cmp(&self, other: &BindingError) -> cmp::Ordering {
122 self.name.cmp(&other.name)
126 enum ResolutionError<'a> {
127 /// error E0401: can't use type parameters from outer function
128 TypeParametersFromOuterFunction,
129 /// error E0402: cannot use an outer type parameter in this context
130 OuterTypeParameterContext,
131 /// error E0403: the name is already used for a type parameter in this type parameter list
132 NameAlreadyUsedInTypeParameterList(Name, &'a Span),
133 /// error E0407: method is not a member of trait
134 MethodNotMemberOfTrait(Name, &'a str),
135 /// error E0437: type is not a member of trait
136 TypeNotMemberOfTrait(Name, &'a str),
137 /// error E0438: const is not a member of trait
138 ConstNotMemberOfTrait(Name, &'a str),
139 /// error E0408: variable `{}` is not bound in all patterns
140 VariableNotBoundInPattern(&'a BindingError),
141 /// error E0409: variable `{}` is bound in inconsistent ways within the same match arm
142 VariableBoundWithDifferentMode(Name, Span),
143 /// error E0415: identifier is bound more than once in this parameter list
144 IdentifierBoundMoreThanOnceInParameterList(&'a str),
145 /// error E0416: identifier is bound more than once in the same pattern
146 IdentifierBoundMoreThanOnceInSamePattern(&'a str),
147 /// error E0426: use of undeclared label
148 UndeclaredLabel(&'a str),
149 /// error E0429: `self` imports are only allowed within a { } list
150 SelfImportsOnlyAllowedWithin,
151 /// error E0430: `self` import can only appear once in the list
152 SelfImportCanOnlyAppearOnceInTheList,
153 /// error E0431: `self` import can only appear in an import list with a non-empty prefix
154 SelfImportOnlyInImportListWithNonEmptyPrefix,
155 /// error E0432: unresolved import
156 UnresolvedImport(Option<(&'a str, &'a str)>),
157 /// error E0433: failed to resolve
158 FailedToResolve(&'a str),
159 /// error E0434: can't capture dynamic environment in a fn item
160 CannotCaptureDynamicEnvironmentInFnItem,
161 /// error E0435: attempt to use a non-constant value in a constant
162 AttemptToUseNonConstantValueInConstant,
163 /// error E0530: X bindings cannot shadow Ys
164 BindingShadowsSomethingUnacceptable(&'a str, Name, &'a NameBinding<'a>),
165 /// error E0128: type parameters with a default cannot use forward declared identifiers
166 ForwardDeclaredTyParam,
169 fn resolve_error<'sess, 'a>(resolver: &'sess Resolver,
171 resolution_error: ResolutionError<'a>) {
172 resolve_struct_error(resolver, span, resolution_error).emit();
175 fn resolve_struct_error<'sess, 'a>(resolver: &'sess Resolver,
177 resolution_error: ResolutionError<'a>)
178 -> DiagnosticBuilder<'sess> {
179 match resolution_error {
180 ResolutionError::TypeParametersFromOuterFunction => {
181 let mut err = struct_span_err!(resolver.session,
184 "can't use type parameters from outer function; \
185 try using a local type parameter instead");
186 err.span_label(span, "use of type variable from outer function");
189 ResolutionError::OuterTypeParameterContext => {
190 struct_span_err!(resolver.session,
193 "cannot use an outer type parameter in this context")
195 ResolutionError::NameAlreadyUsedInTypeParameterList(name, first_use_span) => {
196 let mut err = struct_span_err!(resolver.session,
199 "the name `{}` is already used for a type parameter \
200 in this type parameter list",
202 err.span_label(span, "already used");
203 err.span_label(first_use_span.clone(), format!("first use of `{}`", name));
206 ResolutionError::MethodNotMemberOfTrait(method, trait_) => {
207 let mut err = struct_span_err!(resolver.session,
210 "method `{}` is not a member of trait `{}`",
213 err.span_label(span, format!("not a member of trait `{}`", trait_));
216 ResolutionError::TypeNotMemberOfTrait(type_, trait_) => {
217 let mut err = struct_span_err!(resolver.session,
220 "type `{}` is not a member of trait `{}`",
223 err.span_label(span, format!("not a member of trait `{}`", trait_));
226 ResolutionError::ConstNotMemberOfTrait(const_, trait_) => {
227 let mut err = struct_span_err!(resolver.session,
230 "const `{}` is not a member of trait `{}`",
233 err.span_label(span, format!("not a member of trait `{}`", trait_));
236 ResolutionError::VariableNotBoundInPattern(binding_error) => {
237 let target_sp = binding_error.target.iter().map(|x| *x).collect::<Vec<_>>();
238 let msp = MultiSpan::from_spans(target_sp.clone());
239 let msg = format!("variable `{}` is not bound in all patterns", binding_error.name);
240 let mut err = resolver.session.struct_span_err_with_code(msp, &msg, "E0408");
241 for sp in target_sp {
242 err.span_label(sp, format!("pattern doesn't bind `{}`", binding_error.name));
244 let origin_sp = binding_error.origin.iter().map(|x| *x).collect::<Vec<_>>();
245 for sp in origin_sp {
246 err.span_label(sp, "variable not in all patterns");
250 ResolutionError::VariableBoundWithDifferentMode(variable_name,
251 first_binding_span) => {
252 let mut err = struct_span_err!(resolver.session,
255 "variable `{}` is bound in inconsistent \
256 ways within the same match arm",
258 err.span_label(span, "bound in different ways");
259 err.span_label(first_binding_span, "first binding");
262 ResolutionError::IdentifierBoundMoreThanOnceInParameterList(identifier) => {
263 let mut err = struct_span_err!(resolver.session,
266 "identifier `{}` is bound more than once in this parameter list",
268 err.span_label(span, "used as parameter more than once");
271 ResolutionError::IdentifierBoundMoreThanOnceInSamePattern(identifier) => {
272 let mut err = struct_span_err!(resolver.session,
275 "identifier `{}` is bound more than once in the same pattern",
277 err.span_label(span, "used in a pattern more than once");
280 ResolutionError::UndeclaredLabel(name) => {
281 let mut err = struct_span_err!(resolver.session,
284 "use of undeclared label `{}`",
286 err.span_label(span, format!("undeclared label `{}`", name));
289 ResolutionError::SelfImportsOnlyAllowedWithin => {
290 struct_span_err!(resolver.session,
294 "`self` imports are only allowed within a { } list")
296 ResolutionError::SelfImportCanOnlyAppearOnceInTheList => {
297 struct_span_err!(resolver.session,
300 "`self` import can only appear once in the list")
302 ResolutionError::SelfImportOnlyInImportListWithNonEmptyPrefix => {
303 struct_span_err!(resolver.session,
306 "`self` import can only appear in an import list with a \
309 ResolutionError::UnresolvedImport(name) => {
310 let msg = match name {
311 Some((n, _)) => format!("unresolved import `{}`", n),
312 None => "unresolved import".to_owned(),
314 let mut err = struct_span_err!(resolver.session, span, E0432, "{}", msg);
315 if let Some((_, p)) = name {
316 err.span_label(span, p);
320 ResolutionError::FailedToResolve(msg) => {
321 let mut err = struct_span_err!(resolver.session, span, E0433,
322 "failed to resolve. {}", msg);
323 err.span_label(span, msg);
326 ResolutionError::CannotCaptureDynamicEnvironmentInFnItem => {
327 struct_span_err!(resolver.session,
331 "can't capture dynamic environment in a fn item; use the || { ... } \
332 closure form instead")
334 ResolutionError::AttemptToUseNonConstantValueInConstant => {
335 let mut err = struct_span_err!(resolver.session,
338 "attempt to use a non-constant value in a constant");
339 err.span_label(span, "non-constant used with constant");
342 ResolutionError::BindingShadowsSomethingUnacceptable(what_binding, name, binding) => {
343 let shadows_what = PathResolution::new(binding.def()).kind_name();
344 let mut err = struct_span_err!(resolver.session,
347 "{}s cannot shadow {}s", what_binding, shadows_what);
348 err.span_label(span, format!("cannot be named the same as a {}", shadows_what));
349 let participle = if binding.is_import() { "imported" } else { "defined" };
350 let msg = format!("a {} `{}` is {} here", shadows_what, name, participle);
351 err.span_label(binding.span, msg);
354 ResolutionError::ForwardDeclaredTyParam => {
355 let mut err = struct_span_err!(resolver.session, span, E0128,
356 "type parameters with a default cannot use \
357 forward declared identifiers");
358 err.span_label(span, format!("defaulted type parameters \
359 cannot be forward declared"));
365 #[derive(Copy, Clone, Debug)]
368 binding_mode: BindingMode,
371 // Map from the name in a pattern to its binding mode.
372 type BindingMap = FxHashMap<Ident, BindingInfo>;
374 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
385 fn is_refutable(self) -> bool {
387 PatternSource::Match | PatternSource::IfLet | PatternSource::WhileLet => true,
388 PatternSource::Let | PatternSource::For | PatternSource::FnParam => false,
391 fn descr(self) -> &'static str {
393 PatternSource::Match => "match binding",
394 PatternSource::IfLet => "if let binding",
395 PatternSource::WhileLet => "while let binding",
396 PatternSource::Let => "let binding",
397 PatternSource::For => "for binding",
398 PatternSource::FnParam => "function parameter",
403 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
404 enum PathSource<'a> {
405 // Type paths `Path`.
407 // Trait paths in bounds or impls.
409 // Expression paths `path`, with optional parent context.
410 Expr(Option<&'a Expr>),
411 // Paths in path patterns `Path`.
413 // Paths in struct expressions and patterns `Path { .. }`.
415 // Paths in tuple struct patterns `Path(..)`.
417 // `m::A::B` in `<T as m::A>::B::C`.
418 TraitItem(Namespace),
419 // Path in `pub(path)`
421 // Path in `use a::b::{...};`
425 impl<'a> PathSource<'a> {
426 fn namespace(self) -> Namespace {
428 PathSource::Type | PathSource::Trait | PathSource::Struct |
429 PathSource::Visibility | PathSource::ImportPrefix => TypeNS,
430 PathSource::Expr(..) | PathSource::Pat | PathSource::TupleStruct => ValueNS,
431 PathSource::TraitItem(ns) => ns,
435 fn global_by_default(self) -> bool {
437 PathSource::Visibility | PathSource::ImportPrefix => true,
438 PathSource::Type | PathSource::Expr(..) | PathSource::Pat |
439 PathSource::Struct | PathSource::TupleStruct |
440 PathSource::Trait | PathSource::TraitItem(..) => false,
444 fn defer_to_typeck(self) -> bool {
446 PathSource::Type | PathSource::Expr(..) | PathSource::Pat |
447 PathSource::Struct | PathSource::TupleStruct => true,
448 PathSource::Trait | PathSource::TraitItem(..) |
449 PathSource::Visibility | PathSource::ImportPrefix => false,
453 fn descr_expected(self) -> &'static str {
455 PathSource::Type => "type",
456 PathSource::Trait => "trait",
457 PathSource::Pat => "unit struct/variant or constant",
458 PathSource::Struct => "struct, variant or union type",
459 PathSource::TupleStruct => "tuple struct/variant",
460 PathSource::Visibility => "module",
461 PathSource::ImportPrefix => "module or enum",
462 PathSource::TraitItem(ns) => match ns {
463 TypeNS => "associated type",
464 ValueNS => "method or associated constant",
465 MacroNS => bug!("associated macro"),
467 PathSource::Expr(parent) => match parent.map(|p| &p.node) {
468 // "function" here means "anything callable" rather than `Def::Fn`,
469 // this is not precise but usually more helpful than just "value".
470 Some(&ExprKind::Call(..)) => "function",
476 fn is_expected(self, def: Def) -> bool {
478 PathSource::Type => match def {
479 Def::Struct(..) | Def::Union(..) | Def::Enum(..) |
480 Def::Trait(..) | Def::TyAlias(..) | Def::AssociatedTy(..) |
481 Def::PrimTy(..) | Def::TyParam(..) | Def::SelfTy(..) => true,
484 PathSource::Trait => match def {
485 Def::Trait(..) => true,
488 PathSource::Expr(..) => match def {
489 Def::StructCtor(_, CtorKind::Const) | Def::StructCtor(_, CtorKind::Fn) |
490 Def::VariantCtor(_, CtorKind::Const) | Def::VariantCtor(_, CtorKind::Fn) |
491 Def::Const(..) | Def::Static(..) | Def::Local(..) | Def::Upvar(..) |
492 Def::Fn(..) | Def::Method(..) | Def::AssociatedConst(..) => true,
495 PathSource::Pat => match def {
496 Def::StructCtor(_, CtorKind::Const) |
497 Def::VariantCtor(_, CtorKind::Const) |
498 Def::Const(..) | Def::AssociatedConst(..) => true,
501 PathSource::TupleStruct => match def {
502 Def::StructCtor(_, CtorKind::Fn) | Def::VariantCtor(_, CtorKind::Fn) => true,
505 PathSource::Struct => match def {
506 Def::Struct(..) | Def::Union(..) | Def::Variant(..) |
507 Def::TyAlias(..) | Def::AssociatedTy(..) | Def::SelfTy(..) => true,
510 PathSource::TraitItem(ns) => match def {
511 Def::AssociatedConst(..) | Def::Method(..) if ns == ValueNS => true,
512 Def::AssociatedTy(..) if ns == TypeNS => true,
515 PathSource::ImportPrefix => match def {
516 Def::Mod(..) | Def::Enum(..) => true,
519 PathSource::Visibility => match def {
520 Def::Mod(..) => true,
526 fn error_code(self, has_unexpected_resolution: bool) -> &'static str {
527 __diagnostic_used!(E0404);
528 __diagnostic_used!(E0405);
529 __diagnostic_used!(E0412);
530 __diagnostic_used!(E0422);
531 __diagnostic_used!(E0423);
532 __diagnostic_used!(E0425);
533 __diagnostic_used!(E0531);
534 __diagnostic_used!(E0532);
535 __diagnostic_used!(E0573);
536 __diagnostic_used!(E0574);
537 __diagnostic_used!(E0575);
538 __diagnostic_used!(E0576);
539 __diagnostic_used!(E0577);
540 __diagnostic_used!(E0578);
541 match (self, has_unexpected_resolution) {
542 (PathSource::Trait, true) => "E0404",
543 (PathSource::Trait, false) => "E0405",
544 (PathSource::Type, true) => "E0573",
545 (PathSource::Type, false) => "E0412",
546 (PathSource::Struct, true) => "E0574",
547 (PathSource::Struct, false) => "E0422",
548 (PathSource::Expr(..), true) => "E0423",
549 (PathSource::Expr(..), false) => "E0425",
550 (PathSource::Pat, true) | (PathSource::TupleStruct, true) => "E0532",
551 (PathSource::Pat, false) | (PathSource::TupleStruct, false) => "E0531",
552 (PathSource::TraitItem(..), true) => "E0575",
553 (PathSource::TraitItem(..), false) => "E0576",
554 (PathSource::Visibility, true) | (PathSource::ImportPrefix, true) => "E0577",
555 (PathSource::Visibility, false) | (PathSource::ImportPrefix, false) => "E0578",
560 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
567 #[derive(Clone, Default, Debug)]
568 pub struct PerNS<T> {
574 impl<T> ::std::ops::Index<Namespace> for PerNS<T> {
576 fn index(&self, ns: Namespace) -> &T {
578 ValueNS => &self.value_ns,
579 TypeNS => &self.type_ns,
580 MacroNS => self.macro_ns.as_ref().unwrap(),
585 impl<T> ::std::ops::IndexMut<Namespace> for PerNS<T> {
586 fn index_mut(&mut self, ns: Namespace) -> &mut T {
588 ValueNS => &mut self.value_ns,
589 TypeNS => &mut self.type_ns,
590 MacroNS => self.macro_ns.as_mut().unwrap(),
595 impl<'a, 'tcx> Visitor<'tcx> for Resolver<'a> {
596 fn visit_item(&mut self, item: &'tcx Item) {
597 self.resolve_item(item);
599 fn visit_arm(&mut self, arm: &'tcx Arm) {
600 self.resolve_arm(arm);
602 fn visit_block(&mut self, block: &'tcx Block) {
603 self.resolve_block(block);
605 fn visit_expr(&mut self, expr: &'tcx Expr) {
606 self.resolve_expr(expr, None);
608 fn visit_local(&mut self, local: &'tcx Local) {
609 self.resolve_local(local);
611 fn visit_ty(&mut self, ty: &'tcx Ty) {
612 if let TyKind::Path(ref qself, ref path) = ty.node {
613 self.smart_resolve_path(ty.id, qself.as_ref(), path, PathSource::Type);
614 } else if let TyKind::ImplicitSelf = ty.node {
615 let self_ty = keywords::SelfType.ident();
616 let def = self.resolve_ident_in_lexical_scope(self_ty, TypeNS, Some(ty.span))
617 .map_or(Def::Err, |d| d.def());
618 self.record_def(ty.id, PathResolution::new(def));
619 } else if let TyKind::Array(ref element, ref length) = ty.node {
620 self.visit_ty(element);
621 self.with_constant_rib(|this| {
622 this.visit_expr(length);
626 visit::walk_ty(self, ty);
628 fn visit_poly_trait_ref(&mut self,
629 tref: &'tcx ast::PolyTraitRef,
630 m: &'tcx ast::TraitBoundModifier) {
631 self.smart_resolve_path(tref.trait_ref.ref_id, None,
632 &tref.trait_ref.path, PathSource::Trait);
633 visit::walk_poly_trait_ref(self, tref, m);
635 fn visit_variant(&mut self,
636 variant: &'tcx ast::Variant,
637 generics: &'tcx Generics,
638 item_id: ast::NodeId) {
639 if let Some(ref dis_expr) = variant.node.disr_expr {
640 // resolve the discriminator expr as a constant
641 self.with_constant_rib(|this| {
642 this.visit_expr(dis_expr);
646 // `visit::walk_variant` without the discriminant expression.
647 self.visit_variant_data(&variant.node.data,
653 fn visit_foreign_item(&mut self, foreign_item: &'tcx ForeignItem) {
654 let type_parameters = match foreign_item.node {
655 ForeignItemKind::Fn(_, ref generics) => {
656 HasTypeParameters(generics, ItemRibKind)
658 ForeignItemKind::Static(..) => NoTypeParameters,
660 self.with_type_parameter_rib(type_parameters, |this| {
661 visit::walk_foreign_item(this, foreign_item);
664 fn visit_fn(&mut self,
665 function_kind: FnKind<'tcx>,
666 declaration: &'tcx FnDecl,
669 let rib_kind = match function_kind {
670 FnKind::ItemFn(_, generics, ..) => {
671 self.visit_generics(generics);
674 FnKind::Method(_, sig, _, _) => {
675 self.visit_generics(&sig.generics);
676 MethodRibKind(!sig.decl.has_self())
678 FnKind::Closure(_) => ClosureRibKind(node_id),
681 // Create a value rib for the function.
682 self.ribs[ValueNS].push(Rib::new(rib_kind));
684 // Create a label rib for the function.
685 self.label_ribs.push(Rib::new(rib_kind));
687 // Add each argument to the rib.
688 let mut bindings_list = FxHashMap();
689 for argument in &declaration.inputs {
690 self.resolve_pattern(&argument.pat, PatternSource::FnParam, &mut bindings_list);
692 self.visit_ty(&argument.ty);
694 debug!("(resolving function) recorded argument");
696 visit::walk_fn_ret_ty(self, &declaration.output);
698 // Resolve the function body.
699 match function_kind {
700 FnKind::ItemFn(.., body) |
701 FnKind::Method(.., body) => {
702 self.visit_block(body);
704 FnKind::Closure(body) => {
705 self.visit_expr(body);
709 debug!("(resolving function) leaving function");
711 self.label_ribs.pop();
712 self.ribs[ValueNS].pop();
714 fn visit_generics(&mut self, generics: &'tcx Generics) {
715 // For type parameter defaults, we have to ban access
716 // to following type parameters, as the Substs can only
717 // provide previous type parameters as they're built.
718 let mut default_ban_rib = Rib::new(ForwardTyParamBanRibKind);
719 default_ban_rib.bindings.extend(generics.ty_params.iter()
720 .skip_while(|p| p.default.is_none())
721 .map(|p| (Ident::with_empty_ctxt(p.ident.name), Def::Err)));
723 for param in &generics.ty_params {
724 for bound in ¶m.bounds {
725 self.visit_ty_param_bound(bound);
728 if let Some(ref ty) = param.default {
729 self.ribs[TypeNS].push(default_ban_rib);
731 default_ban_rib = self.ribs[TypeNS].pop().unwrap();
734 // Allow all following defaults to refer to this type parameter.
735 default_ban_rib.bindings.remove(&Ident::with_empty_ctxt(param.ident.name));
737 for lt in &generics.lifetimes { self.visit_lifetime_def(lt); }
738 for p in &generics.where_clause.predicates { self.visit_where_predicate(p); }
742 pub type ErrorMessage = Option<(Span, String)>;
744 #[derive(Copy, Clone)]
745 enum TypeParameters<'a, 'b> {
747 HasTypeParameters(// Type parameters.
750 // The kind of the rib used for type parameters.
754 // The rib kind controls the translation of local
755 // definitions (`Def::Local`) to upvars (`Def::Upvar`).
756 #[derive(Copy, Clone, Debug)]
758 // No translation needs to be applied.
761 // We passed through a closure scope at the given node ID.
762 // Translate upvars as appropriate.
763 ClosureRibKind(NodeId /* func id */),
765 // We passed through an impl or trait and are now in one of its
766 // methods. Allow references to ty params that impl or trait
767 // binds. Disallow any other upvars (including other ty params that are
770 // The boolean value represents the fact that this method is static or not.
773 // We passed through an item scope. Disallow upvars.
776 // We're in a constant item. Can't refer to dynamic stuff.
779 // We passed through a module.
780 ModuleRibKind(Module<'a>),
782 // We passed through a `macro_rules!` statement
783 MacroDefinition(DefId),
785 // All bindings in this rib are type parameters that can't be used
786 // from the default of a type parameter because they're not declared
787 // before said type parameter. Also see the `visit_generics` override.
788 ForwardTyParamBanRibKind,
794 bindings: FxHashMap<Ident, Def>,
799 fn new(kind: RibKind<'a>) -> Rib<'a> {
801 bindings: FxHashMap(),
807 enum LexicalScopeBinding<'a> {
808 Item(&'a NameBinding<'a>),
812 impl<'a> LexicalScopeBinding<'a> {
813 fn item(self) -> Option<&'a NameBinding<'a>> {
815 LexicalScopeBinding::Item(binding) => Some(binding),
820 fn def(self) -> Def {
822 LexicalScopeBinding::Item(binding) => binding.def(),
823 LexicalScopeBinding::Def(def) => def,
829 enum PathResult<'a> {
831 NonModule(PathResolution),
833 Failed(String, bool /* is the error from the last segment? */),
841 /// One node in the tree of modules.
842 pub struct ModuleData<'a> {
843 parent: Option<Module<'a>>,
846 // The def id of the closest normal module (`mod`) ancestor (including this module).
847 normal_ancestor_id: DefId,
849 resolutions: RefCell<FxHashMap<(Ident, Namespace), &'a RefCell<NameResolution<'a>>>>,
850 legacy_macro_resolutions: RefCell<Vec<(Mark, Ident, Span, MacroKind)>>,
851 macro_resolutions: RefCell<Vec<(Box<[Ident]>, Span)>>,
853 // Macro invocations that can expand into items in this module.
854 unresolved_invocations: RefCell<FxHashSet<Mark>>,
856 no_implicit_prelude: bool,
858 glob_importers: RefCell<Vec<&'a ImportDirective<'a>>>,
859 globs: RefCell<Vec<&'a ImportDirective<'a>>>,
861 // Used to memoize the traits in this module for faster searches through all traits in scope.
862 traits: RefCell<Option<Box<[(Ident, &'a NameBinding<'a>)]>>>,
864 // Whether this module is populated. If not populated, any attempt to
865 // access the children must be preceded with a
866 // `populate_module_if_necessary` call.
867 populated: Cell<bool>,
870 pub type Module<'a> = &'a ModuleData<'a>;
872 impl<'a> ModuleData<'a> {
873 fn new(parent: Option<Module<'a>>, kind: ModuleKind, normal_ancestor_id: DefId) -> Self {
877 normal_ancestor_id: normal_ancestor_id,
878 resolutions: RefCell::new(FxHashMap()),
879 legacy_macro_resolutions: RefCell::new(Vec::new()),
880 macro_resolutions: RefCell::new(Vec::new()),
881 unresolved_invocations: RefCell::new(FxHashSet()),
882 no_implicit_prelude: false,
883 glob_importers: RefCell::new(Vec::new()),
884 globs: RefCell::new((Vec::new())),
885 traits: RefCell::new(None),
886 populated: Cell::new(normal_ancestor_id.is_local()),
890 fn for_each_child<F: FnMut(Ident, Namespace, &'a NameBinding<'a>)>(&self, mut f: F) {
891 for (&(ident, ns), name_resolution) in self.resolutions.borrow().iter() {
892 name_resolution.borrow().binding.map(|binding| f(ident, ns, binding));
896 fn def(&self) -> Option<Def> {
898 ModuleKind::Def(def, _) => Some(def),
903 fn def_id(&self) -> Option<DefId> {
904 self.def().as_ref().map(Def::def_id)
907 // `self` resolves to the first module ancestor that `is_normal`.
908 fn is_normal(&self) -> bool {
910 ModuleKind::Def(Def::Mod(_), _) => true,
915 fn is_trait(&self) -> bool {
917 ModuleKind::Def(Def::Trait(_), _) => true,
922 fn is_local(&self) -> bool {
923 self.normal_ancestor_id.is_local()
926 fn nearest_item_scope(&'a self) -> Module<'a> {
927 if self.is_trait() { self.parent.unwrap() } else { self }
931 impl<'a> fmt::Debug for ModuleData<'a> {
932 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
933 write!(f, "{:?}", self.def())
937 // Records a possibly-private value, type, or module definition.
938 #[derive(Clone, Debug)]
939 pub struct NameBinding<'a> {
940 kind: NameBindingKind<'a>,
946 pub trait ToNameBinding<'a> {
947 fn to_name_binding(self, arenas: &'a ResolverArenas<'a>) -> &'a NameBinding<'a>;
950 impl<'a> ToNameBinding<'a> for &'a NameBinding<'a> {
951 fn to_name_binding(self, _: &'a ResolverArenas<'a>) -> &'a NameBinding<'a> {
956 #[derive(Clone, Debug)]
957 enum NameBindingKind<'a> {
961 binding: &'a NameBinding<'a>,
962 directive: &'a ImportDirective<'a>,
964 legacy_self_import: bool,
967 b1: &'a NameBinding<'a>,
968 b2: &'a NameBinding<'a>,
973 struct PrivacyError<'a>(Span, Name, &'a NameBinding<'a>);
975 struct AmbiguityError<'a> {
979 b1: &'a NameBinding<'a>,
980 b2: &'a NameBinding<'a>,
984 impl<'a> NameBinding<'a> {
985 fn module(&self) -> Option<Module<'a>> {
987 NameBindingKind::Module(module) => Some(module),
988 NameBindingKind::Import { binding, .. } => binding.module(),
989 NameBindingKind::Ambiguity { legacy: true, b1, .. } => b1.module(),
994 fn def(&self) -> Def {
996 NameBindingKind::Def(def) => def,
997 NameBindingKind::Module(module) => module.def().unwrap(),
998 NameBindingKind::Import { binding, .. } => binding.def(),
999 NameBindingKind::Ambiguity { legacy: true, b1, .. } => b1.def(),
1000 NameBindingKind::Ambiguity { .. } => Def::Err,
1004 fn def_ignoring_ambiguity(&self) -> Def {
1006 NameBindingKind::Import { binding, .. } => binding.def_ignoring_ambiguity(),
1007 NameBindingKind::Ambiguity { b1, .. } => b1.def_ignoring_ambiguity(),
1012 fn get_macro(&self, resolver: &mut Resolver<'a>) -> Rc<SyntaxExtension> {
1013 resolver.get_macro(self.def_ignoring_ambiguity())
1016 // We sometimes need to treat variants as `pub` for backwards compatibility
1017 fn pseudo_vis(&self) -> ty::Visibility {
1018 if self.is_variant() { ty::Visibility::Public } else { self.vis }
1021 fn is_variant(&self) -> bool {
1023 NameBindingKind::Def(Def::Variant(..)) |
1024 NameBindingKind::Def(Def::VariantCtor(..)) => true,
1029 fn is_extern_crate(&self) -> bool {
1031 NameBindingKind::Import {
1032 directive: &ImportDirective {
1033 subclass: ImportDirectiveSubclass::ExternCrate, ..
1040 fn is_import(&self) -> bool {
1042 NameBindingKind::Import { .. } => true,
1047 fn is_glob_import(&self) -> bool {
1049 NameBindingKind::Import { directive, .. } => directive.is_glob(),
1050 NameBindingKind::Ambiguity { b1, .. } => b1.is_glob_import(),
1055 fn is_importable(&self) -> bool {
1057 Def::AssociatedConst(..) | Def::Method(..) | Def::AssociatedTy(..) => false,
1063 /// Interns the names of the primitive types.
1064 struct PrimitiveTypeTable {
1065 primitive_types: FxHashMap<Name, PrimTy>,
1068 impl PrimitiveTypeTable {
1069 fn new() -> PrimitiveTypeTable {
1070 let mut table = PrimitiveTypeTable { primitive_types: FxHashMap() };
1072 table.intern("bool", TyBool);
1073 table.intern("char", TyChar);
1074 table.intern("f32", TyFloat(FloatTy::F32));
1075 table.intern("f64", TyFloat(FloatTy::F64));
1076 table.intern("isize", TyInt(IntTy::Is));
1077 table.intern("i8", TyInt(IntTy::I8));
1078 table.intern("i16", TyInt(IntTy::I16));
1079 table.intern("i32", TyInt(IntTy::I32));
1080 table.intern("i64", TyInt(IntTy::I64));
1081 table.intern("i128", TyInt(IntTy::I128));
1082 table.intern("str", TyStr);
1083 table.intern("usize", TyUint(UintTy::Us));
1084 table.intern("u8", TyUint(UintTy::U8));
1085 table.intern("u16", TyUint(UintTy::U16));
1086 table.intern("u32", TyUint(UintTy::U32));
1087 table.intern("u64", TyUint(UintTy::U64));
1088 table.intern("u128", TyUint(UintTy::U128));
1092 fn intern(&mut self, string: &str, primitive_type: PrimTy) {
1093 self.primitive_types.insert(Symbol::intern(string), primitive_type);
1097 /// The main resolver class.
1098 pub struct Resolver<'a> {
1099 session: &'a Session,
1101 pub definitions: Definitions,
1103 graph_root: Module<'a>,
1105 prelude: Option<Module<'a>>,
1107 trait_item_map: FxHashMap<(DefId, Name, Namespace), (Def, bool /* has self */)>,
1109 // Names of fields of an item `DefId` accessible with dot syntax.
1110 // Used for hints during error reporting.
1111 field_names: FxHashMap<DefId, Vec<Name>>,
1113 // All imports known to succeed or fail.
1114 determined_imports: Vec<&'a ImportDirective<'a>>,
1116 // All non-determined imports.
1117 indeterminate_imports: Vec<&'a ImportDirective<'a>>,
1119 // The module that represents the current item scope.
1120 current_module: Module<'a>,
1122 // The current set of local scopes for types and values.
1123 // FIXME #4948: Reuse ribs to avoid allocation.
1124 ribs: PerNS<Vec<Rib<'a>>>,
1126 // The current set of local scopes, for labels.
1127 label_ribs: Vec<Rib<'a>>,
1129 // The trait that the current context can refer to.
1130 current_trait_ref: Option<(DefId, TraitRef)>,
1132 // The current self type if inside an impl (used for better errors).
1133 current_self_type: Option<Ty>,
1135 // The idents for the primitive types.
1136 primitive_type_table: PrimitiveTypeTable,
1139 pub freevars: FreevarMap,
1140 freevars_seen: NodeMap<NodeMap<usize>>,
1141 pub export_map: ExportMap,
1142 pub trait_map: TraitMap,
1144 // A map from nodes to anonymous modules.
1145 // Anonymous modules are pseudo-modules that are implicitly created around items
1146 // contained within blocks.
1148 // For example, if we have this:
1156 // There will be an anonymous module created around `g` with the ID of the
1157 // entry block for `f`.
1158 block_map: NodeMap<Module<'a>>,
1159 module_map: FxHashMap<DefId, Module<'a>>,
1160 extern_crate_roots: FxHashMap<(CrateNum, bool /* MacrosOnly? */), Module<'a>>,
1162 pub make_glob_map: bool,
1163 // Maps imports to the names of items actually imported (this actually maps
1164 // all imports, but only glob imports are actually interesting).
1165 pub glob_map: GlobMap,
1167 used_imports: FxHashSet<(NodeId, Namespace)>,
1168 pub maybe_unused_trait_imports: NodeSet,
1170 privacy_errors: Vec<PrivacyError<'a>>,
1171 ambiguity_errors: Vec<AmbiguityError<'a>>,
1172 gated_errors: FxHashSet<Span>,
1173 disallowed_shadowing: Vec<&'a LegacyBinding<'a>>,
1175 arenas: &'a ResolverArenas<'a>,
1176 dummy_binding: &'a NameBinding<'a>,
1177 use_extern_macros: bool, // true if `#![feature(use_extern_macros)]`
1179 crate_loader: &'a mut CrateLoader,
1180 macro_names: FxHashSet<Name>,
1181 global_macros: FxHashMap<Name, &'a NameBinding<'a>>,
1182 lexical_macro_resolutions: Vec<(Name, &'a Cell<LegacyScope<'a>>)>,
1183 macro_map: FxHashMap<DefId, Rc<SyntaxExtension>>,
1184 macro_defs: FxHashMap<Mark, DefId>,
1185 local_macro_def_scopes: FxHashMap<NodeId, Module<'a>>,
1186 macro_exports: Vec<Export>,
1187 pub whitelisted_legacy_custom_derives: Vec<Name>,
1188 pub found_unresolved_macro: bool,
1190 // Maps the `Mark` of an expansion to its containing module or block.
1191 invocations: FxHashMap<Mark, &'a InvocationData<'a>>,
1193 // Avoid duplicated errors for "name already defined".
1194 name_already_seen: FxHashMap<Name, Span>,
1196 // If `#![feature(proc_macro)]` is set
1197 proc_macro_enabled: bool,
1199 // A set of procedural macros imported by `#[macro_use]` that have already been warned about
1200 warned_proc_macros: FxHashSet<Name>,
1202 potentially_unused_imports: Vec<&'a ImportDirective<'a>>,
1204 // This table maps struct IDs into struct constructor IDs,
1205 // it's not used during normal resolution, only for better error reporting.
1206 struct_constructors: DefIdMap<(Def, ty::Visibility)>,
1209 pub struct ResolverArenas<'a> {
1210 modules: arena::TypedArena<ModuleData<'a>>,
1211 local_modules: RefCell<Vec<Module<'a>>>,
1212 name_bindings: arena::TypedArena<NameBinding<'a>>,
1213 import_directives: arena::TypedArena<ImportDirective<'a>>,
1214 name_resolutions: arena::TypedArena<RefCell<NameResolution<'a>>>,
1215 invocation_data: arena::TypedArena<InvocationData<'a>>,
1216 legacy_bindings: arena::TypedArena<LegacyBinding<'a>>,
1219 impl<'a> ResolverArenas<'a> {
1220 fn alloc_module(&'a self, module: ModuleData<'a>) -> Module<'a> {
1221 let module = self.modules.alloc(module);
1222 if module.def_id().map(|def_id| def_id.is_local()).unwrap_or(true) {
1223 self.local_modules.borrow_mut().push(module);
1227 fn local_modules(&'a self) -> ::std::cell::Ref<'a, Vec<Module<'a>>> {
1228 self.local_modules.borrow()
1230 fn alloc_name_binding(&'a self, name_binding: NameBinding<'a>) -> &'a NameBinding<'a> {
1231 self.name_bindings.alloc(name_binding)
1233 fn alloc_import_directive(&'a self, import_directive: ImportDirective<'a>)
1234 -> &'a ImportDirective {
1235 self.import_directives.alloc(import_directive)
1237 fn alloc_name_resolution(&'a self) -> &'a RefCell<NameResolution<'a>> {
1238 self.name_resolutions.alloc(Default::default())
1240 fn alloc_invocation_data(&'a self, expansion_data: InvocationData<'a>)
1241 -> &'a InvocationData<'a> {
1242 self.invocation_data.alloc(expansion_data)
1244 fn alloc_legacy_binding(&'a self, binding: LegacyBinding<'a>) -> &'a LegacyBinding<'a> {
1245 self.legacy_bindings.alloc(binding)
1249 impl<'a, 'b: 'a> ty::DefIdTree for &'a Resolver<'b> {
1250 fn parent(self, id: DefId) -> Option<DefId> {
1252 LOCAL_CRATE => self.definitions.def_key(id.index).parent,
1253 _ => self.session.cstore.def_key(id).parent,
1254 }.map(|index| DefId { index: index, ..id })
1258 impl<'a> hir::lowering::Resolver for Resolver<'a> {
1259 fn resolve_hir_path(&mut self, path: &mut hir::Path, is_value: bool) {
1260 let namespace = if is_value { ValueNS } else { TypeNS };
1261 let hir::Path { ref segments, span, ref mut def } = *path;
1262 let path: Vec<_> = segments.iter().map(|seg| Ident::with_empty_ctxt(seg.name)).collect();
1263 match self.resolve_path(&path, Some(namespace), Some(span)) {
1264 PathResult::Module(module) => *def = module.def().unwrap(),
1265 PathResult::NonModule(path_res) if path_res.unresolved_segments() == 0 =>
1266 *def = path_res.base_def(),
1267 PathResult::NonModule(..) => match self.resolve_path(&path, None, Some(span)) {
1268 PathResult::Failed(msg, _) => {
1269 resolve_error(self, span, ResolutionError::FailedToResolve(&msg));
1273 PathResult::Indeterminate => unreachable!(),
1274 PathResult::Failed(msg, _) => {
1275 resolve_error(self, span, ResolutionError::FailedToResolve(&msg));
1280 fn get_resolution(&mut self, id: NodeId) -> Option<PathResolution> {
1281 self.def_map.get(&id).cloned()
1284 fn definitions(&mut self) -> &mut Definitions {
1285 &mut self.definitions
1289 impl<'a> Resolver<'a> {
1290 pub fn new(session: &'a Session,
1293 make_glob_map: MakeGlobMap,
1294 crate_loader: &'a mut CrateLoader,
1295 arenas: &'a ResolverArenas<'a>)
1297 let root_def_id = DefId::local(CRATE_DEF_INDEX);
1298 let root_module_kind = ModuleKind::Def(Def::Mod(root_def_id), keywords::Invalid.name());
1299 let graph_root = arenas.alloc_module(ModuleData {
1300 no_implicit_prelude: attr::contains_name(&krate.attrs, "no_implicit_prelude"),
1301 ..ModuleData::new(None, root_module_kind, root_def_id)
1303 let mut module_map = FxHashMap();
1304 module_map.insert(DefId::local(CRATE_DEF_INDEX), graph_root);
1306 let mut definitions = Definitions::new();
1307 DefCollector::new(&mut definitions)
1308 .collect_root(crate_name, &session.local_crate_disambiguator().as_str());
1310 let mut invocations = FxHashMap();
1311 invocations.insert(Mark::root(),
1312 arenas.alloc_invocation_data(InvocationData::root(graph_root)));
1314 let features = session.features.borrow();
1316 let mut macro_defs = FxHashMap();
1317 macro_defs.insert(Mark::root(), root_def_id);
1322 definitions: definitions,
1324 // The outermost module has def ID 0; this is not reflected in the
1326 graph_root: graph_root,
1329 trait_item_map: FxHashMap(),
1330 field_names: FxHashMap(),
1332 determined_imports: Vec::new(),
1333 indeterminate_imports: Vec::new(),
1335 current_module: graph_root,
1337 value_ns: vec![Rib::new(ModuleRibKind(graph_root))],
1338 type_ns: vec![Rib::new(ModuleRibKind(graph_root))],
1339 macro_ns: Some(vec![Rib::new(ModuleRibKind(graph_root))]),
1341 label_ribs: Vec::new(),
1343 current_trait_ref: None,
1344 current_self_type: None,
1346 primitive_type_table: PrimitiveTypeTable::new(),
1349 freevars: NodeMap(),
1350 freevars_seen: NodeMap(),
1351 export_map: NodeMap(),
1352 trait_map: NodeMap(),
1353 module_map: module_map,
1354 block_map: NodeMap(),
1355 extern_crate_roots: FxHashMap(),
1357 make_glob_map: make_glob_map == MakeGlobMap::Yes,
1358 glob_map: NodeMap(),
1360 used_imports: FxHashSet(),
1361 maybe_unused_trait_imports: NodeSet(),
1363 privacy_errors: Vec::new(),
1364 ambiguity_errors: Vec::new(),
1365 gated_errors: FxHashSet(),
1366 disallowed_shadowing: Vec::new(),
1369 dummy_binding: arenas.alloc_name_binding(NameBinding {
1370 kind: NameBindingKind::Def(Def::Err),
1371 expansion: Mark::root(),
1373 vis: ty::Visibility::Public,
1376 // `#![feature(proc_macro)]` implies `#[feature(extern_macros)]`
1377 use_extern_macros: features.use_extern_macros || features.proc_macro,
1379 crate_loader: crate_loader,
1380 macro_names: FxHashSet(),
1381 global_macros: FxHashMap(),
1382 lexical_macro_resolutions: Vec::new(),
1383 macro_map: FxHashMap(),
1384 macro_exports: Vec::new(),
1385 invocations: invocations,
1386 macro_defs: macro_defs,
1387 local_macro_def_scopes: FxHashMap(),
1388 name_already_seen: FxHashMap(),
1389 whitelisted_legacy_custom_derives: Vec::new(),
1390 proc_macro_enabled: features.proc_macro,
1391 warned_proc_macros: FxHashSet(),
1392 potentially_unused_imports: Vec::new(),
1393 struct_constructors: DefIdMap(),
1394 found_unresolved_macro: false,
1398 pub fn arenas() -> ResolverArenas<'a> {
1400 modules: arena::TypedArena::new(),
1401 local_modules: RefCell::new(Vec::new()),
1402 name_bindings: arena::TypedArena::new(),
1403 import_directives: arena::TypedArena::new(),
1404 name_resolutions: arena::TypedArena::new(),
1405 invocation_data: arena::TypedArena::new(),
1406 legacy_bindings: arena::TypedArena::new(),
1410 fn per_ns<T, F: FnMut(&mut Self, Namespace) -> T>(&mut self, mut f: F) -> PerNS<T> {
1412 type_ns: f(self, TypeNS),
1413 value_ns: f(self, ValueNS),
1414 macro_ns: match self.use_extern_macros {
1415 true => Some(f(self, MacroNS)),
1421 /// Entry point to crate resolution.
1422 pub fn resolve_crate(&mut self, krate: &Crate) {
1423 ImportResolver { resolver: self }.finalize_imports();
1424 self.current_module = self.graph_root;
1425 self.finalize_current_module_macro_resolutions();
1426 visit::walk_crate(self, krate);
1428 check_unused::check_crate(self, krate);
1429 self.report_errors();
1430 self.crate_loader.postprocess(krate);
1433 fn new_module(&self, parent: Module<'a>, kind: ModuleKind, normal_ancestor_id: DefId)
1435 self.arenas.alloc_module(ModuleData::new(Some(parent), kind, normal_ancestor_id))
1438 fn record_use(&mut self, ident: Ident, ns: Namespace, binding: &'a NameBinding<'a>, span: Span)
1439 -> bool /* true if an error was reported */ {
1440 match binding.kind {
1441 NameBindingKind::Import { directive, binding, ref used, legacy_self_import }
1444 directive.used.set(true);
1445 if legacy_self_import {
1446 self.warn_legacy_self_import(directive);
1449 self.used_imports.insert((directive.id, ns));
1450 self.add_to_glob_map(directive.id, ident);
1451 self.record_use(ident, ns, binding, span)
1453 NameBindingKind::Import { .. } => false,
1454 NameBindingKind::Ambiguity { b1, b2, legacy } => {
1455 self.ambiguity_errors.push(AmbiguityError {
1456 span: span, name: ident.name, lexical: false, b1: b1, b2: b2, legacy: legacy,
1459 self.record_use(ident, ns, b1, span);
1467 fn add_to_glob_map(&mut self, id: NodeId, ident: Ident) {
1468 if self.make_glob_map {
1469 self.glob_map.entry(id).or_insert_with(FxHashSet).insert(ident.name);
1473 /// This resolves the identifier `ident` in the namespace `ns` in the current lexical scope.
1474 /// More specifically, we proceed up the hierarchy of scopes and return the binding for
1475 /// `ident` in the first scope that defines it (or None if no scopes define it).
1477 /// A block's items are above its local variables in the scope hierarchy, regardless of where
1478 /// the items are defined in the block. For example,
1481 /// g(); // Since there are no local variables in scope yet, this resolves to the item.
1484 /// g(); // This resolves to the local variable `g` since it shadows the item.
1488 /// Invariant: This must only be called during main resolution, not during
1489 /// import resolution.
1490 fn resolve_ident_in_lexical_scope(&mut self,
1493 record_used: Option<Span>)
1494 -> Option<LexicalScopeBinding<'a>> {
1496 ident = ident.unhygienize();
1499 // Walk backwards up the ribs in scope.
1500 for i in (0 .. self.ribs[ns].len()).rev() {
1501 if let Some(def) = self.ribs[ns][i].bindings.get(&ident).cloned() {
1502 // The ident resolves to a type parameter or local variable.
1503 return Some(LexicalScopeBinding::Def(
1504 self.adjust_local_def(ns, i, def, record_used)
1508 if let ModuleRibKind(module) = self.ribs[ns][i].kind {
1509 let item = self.resolve_ident_in_module(module, ident, ns, false, record_used);
1510 if let Ok(binding) = item {
1511 // The ident resolves to an item.
1512 return Some(LexicalScopeBinding::Item(binding));
1515 if let ModuleKind::Block(..) = module.kind { // We can see through blocks
1516 } else if !module.no_implicit_prelude {
1517 return self.prelude.and_then(|prelude| {
1518 self.resolve_ident_in_module(prelude, ident, ns, false, None).ok()
1519 }).map(LexicalScopeBinding::Item)
1525 if let MacroDefinition(def) = self.ribs[ns][i].kind {
1526 // If an invocation of this macro created `ident`, give up on `ident`
1527 // and switch to `ident`'s source from the macro definition.
1528 let ctxt_data = ident.ctxt.data();
1529 if def == self.macro_defs[&ctxt_data.outer_mark] {
1530 ident.ctxt = ctxt_data.prev_ctxt;
1538 fn resolve_crate_var(&mut self, crate_var_ctxt: SyntaxContext) -> Module<'a> {
1539 let mut ctxt_data = crate_var_ctxt.data();
1540 while ctxt_data.prev_ctxt != SyntaxContext::empty() {
1541 ctxt_data = ctxt_data.prev_ctxt.data();
1543 let module = self.macro_def_scope(ctxt_data.outer_mark);
1544 if module.is_local() { self.graph_root } else { module }
1549 // We maintain a list of value ribs and type ribs.
1551 // Simultaneously, we keep track of the current position in the module
1552 // graph in the `current_module` pointer. When we go to resolve a name in
1553 // the value or type namespaces, we first look through all the ribs and
1554 // then query the module graph. When we resolve a name in the module
1555 // namespace, we can skip all the ribs (since nested modules are not
1556 // allowed within blocks in Rust) and jump straight to the current module
1559 // Named implementations are handled separately. When we find a method
1560 // call, we consult the module node to find all of the implementations in
1561 // scope. This information is lazily cached in the module node. We then
1562 // generate a fake "implementation scope" containing all the
1563 // implementations thus found, for compatibility with old resolve pass.
1565 fn with_scope<F>(&mut self, id: NodeId, f: F)
1566 where F: FnOnce(&mut Resolver)
1568 let id = self.definitions.local_def_id(id);
1569 let module = self.module_map.get(&id).cloned(); // clones a reference
1570 if let Some(module) = module {
1571 // Move down in the graph.
1572 let orig_module = replace(&mut self.current_module, module);
1573 self.ribs[ValueNS].push(Rib::new(ModuleRibKind(module)));
1574 self.ribs[TypeNS].push(Rib::new(ModuleRibKind(module)));
1576 self.finalize_current_module_macro_resolutions();
1579 self.current_module = orig_module;
1580 self.ribs[ValueNS].pop();
1581 self.ribs[TypeNS].pop();
1587 /// Searches the current set of local scopes for labels.
1588 /// Stops after meeting a closure.
1589 fn search_label(&self, mut ident: Ident) -> Option<Def> {
1590 for rib in self.label_ribs.iter().rev() {
1595 MacroDefinition(def) => {
1596 // If an invocation of this macro created `ident`, give up on `ident`
1597 // and switch to `ident`'s source from the macro definition.
1598 let ctxt_data = ident.ctxt.data();
1599 if def == self.macro_defs[&ctxt_data.outer_mark] {
1600 ident.ctxt = ctxt_data.prev_ctxt;
1604 // Do not resolve labels across function boundary
1608 let result = rib.bindings.get(&ident).cloned();
1609 if result.is_some() {
1616 fn resolve_item(&mut self, item: &Item) {
1617 let name = item.ident.name;
1619 debug!("(resolving item) resolving {}", name);
1621 self.check_proc_macro_attrs(&item.attrs);
1624 ItemKind::Enum(_, ref generics) |
1625 ItemKind::Ty(_, ref generics) |
1626 ItemKind::Struct(_, ref generics) |
1627 ItemKind::Union(_, ref generics) |
1628 ItemKind::Fn(.., ref generics, _) => {
1629 self.with_type_parameter_rib(HasTypeParameters(generics, ItemRibKind),
1630 |this| visit::walk_item(this, item));
1633 ItemKind::DefaultImpl(_, ref trait_ref) => {
1634 self.with_optional_trait_ref(Some(trait_ref), |this, _| {
1635 // Resolve type arguments in trait path
1636 visit::walk_trait_ref(this, trait_ref);
1639 ItemKind::Impl(.., ref generics, ref opt_trait_ref, ref self_type, ref impl_items) =>
1640 self.resolve_implementation(generics,
1646 ItemKind::Trait(_, ref generics, ref bounds, ref trait_items) => {
1647 // Create a new rib for the trait-wide type parameters.
1648 self.with_type_parameter_rib(HasTypeParameters(generics, ItemRibKind), |this| {
1649 let local_def_id = this.definitions.local_def_id(item.id);
1650 this.with_self_rib(Def::SelfTy(Some(local_def_id), None), |this| {
1651 this.visit_generics(generics);
1652 walk_list!(this, visit_ty_param_bound, bounds);
1654 for trait_item in trait_items {
1655 this.check_proc_macro_attrs(&trait_item.attrs);
1657 match trait_item.node {
1658 TraitItemKind::Const(_, ref default) => {
1659 // Only impose the restrictions of
1660 // ConstRibKind if there's an actual constant
1661 // expression in a provided default.
1662 if default.is_some() {
1663 this.with_constant_rib(|this| {
1664 visit::walk_trait_item(this, trait_item)
1667 visit::walk_trait_item(this, trait_item)
1670 TraitItemKind::Method(ref sig, _) => {
1671 let type_parameters =
1672 HasTypeParameters(&sig.generics,
1673 MethodRibKind(!sig.decl.has_self()));
1674 this.with_type_parameter_rib(type_parameters, |this| {
1675 visit::walk_trait_item(this, trait_item)
1678 TraitItemKind::Type(..) => {
1679 this.with_type_parameter_rib(NoTypeParameters, |this| {
1680 visit::walk_trait_item(this, trait_item)
1683 TraitItemKind::Macro(_) => panic!("unexpanded macro in resolve!"),
1690 ItemKind::Mod(_) | ItemKind::ForeignMod(_) => {
1691 self.with_scope(item.id, |this| {
1692 visit::walk_item(this, item);
1696 ItemKind::Const(..) | ItemKind::Static(..) => {
1697 self.with_constant_rib(|this| {
1698 visit::walk_item(this, item);
1702 ItemKind::Use(ref view_path) => {
1703 match view_path.node {
1704 ast::ViewPathList(ref prefix, ref items) if items.is_empty() => {
1705 // Resolve prefix of an import with empty braces (issue #28388).
1706 self.smart_resolve_path(item.id, None, prefix, PathSource::ImportPrefix);
1712 ItemKind::ExternCrate(_) | ItemKind::MacroDef(..) | ItemKind::GlobalAsm(_)=> {
1713 // do nothing, these are just around to be encoded
1716 ItemKind::Mac(_) => panic!("unexpanded macro in resolve!"),
1720 fn with_type_parameter_rib<'b, F>(&'b mut self, type_parameters: TypeParameters<'a, 'b>, f: F)
1721 where F: FnOnce(&mut Resolver)
1723 match type_parameters {
1724 HasTypeParameters(generics, rib_kind) => {
1725 let mut function_type_rib = Rib::new(rib_kind);
1726 let mut seen_bindings = FxHashMap();
1727 for type_parameter in &generics.ty_params {
1728 let name = type_parameter.ident.name;
1729 debug!("with_type_parameter_rib: {}", type_parameter.id);
1731 if seen_bindings.contains_key(&name) {
1732 let span = seen_bindings.get(&name).unwrap();
1734 type_parameter.span,
1735 ResolutionError::NameAlreadyUsedInTypeParameterList(name,
1738 seen_bindings.entry(name).or_insert(type_parameter.span);
1740 // plain insert (no renaming)
1741 let def_id = self.definitions.local_def_id(type_parameter.id);
1742 let def = Def::TyParam(def_id);
1743 function_type_rib.bindings.insert(Ident::with_empty_ctxt(name), def);
1744 self.record_def(type_parameter.id, PathResolution::new(def));
1746 self.ribs[TypeNS].push(function_type_rib);
1749 NoTypeParameters => {
1756 if let HasTypeParameters(..) = type_parameters {
1757 self.ribs[TypeNS].pop();
1761 fn with_label_rib<F>(&mut self, f: F)
1762 where F: FnOnce(&mut Resolver)
1764 self.label_ribs.push(Rib::new(NormalRibKind));
1766 self.label_ribs.pop();
1769 fn with_constant_rib<F>(&mut self, f: F)
1770 where F: FnOnce(&mut Resolver)
1772 self.ribs[ValueNS].push(Rib::new(ConstantItemRibKind));
1773 self.ribs[TypeNS].push(Rib::new(ConstantItemRibKind));
1775 self.ribs[TypeNS].pop();
1776 self.ribs[ValueNS].pop();
1779 fn with_current_self_type<T, F>(&mut self, self_type: &Ty, f: F) -> T
1780 where F: FnOnce(&mut Resolver) -> T
1782 // Handle nested impls (inside fn bodies)
1783 let previous_value = replace(&mut self.current_self_type, Some(self_type.clone()));
1784 let result = f(self);
1785 self.current_self_type = previous_value;
1789 fn with_optional_trait_ref<T, F>(&mut self, opt_trait_ref: Option<&TraitRef>, f: F) -> T
1790 where F: FnOnce(&mut Resolver, Option<DefId>) -> T
1792 let mut new_val = None;
1793 let mut new_id = None;
1794 if let Some(trait_ref) = opt_trait_ref {
1795 let def = self.smart_resolve_path(trait_ref.ref_id, None,
1796 &trait_ref.path, PathSource::Trait).base_def();
1797 if def != Def::Err {
1798 new_val = Some((def.def_id(), trait_ref.clone()));
1799 new_id = Some(def.def_id());
1802 let original_trait_ref = replace(&mut self.current_trait_ref, new_val);
1803 let result = f(self, new_id);
1804 self.current_trait_ref = original_trait_ref;
1808 fn with_self_rib<F>(&mut self, self_def: Def, f: F)
1809 where F: FnOnce(&mut Resolver)
1811 let mut self_type_rib = Rib::new(NormalRibKind);
1813 // plain insert (no renaming, types are not currently hygienic....)
1814 self_type_rib.bindings.insert(keywords::SelfType.ident(), self_def);
1815 self.ribs[TypeNS].push(self_type_rib);
1817 self.ribs[TypeNS].pop();
1820 fn resolve_implementation(&mut self,
1821 generics: &Generics,
1822 opt_trait_reference: &Option<TraitRef>,
1825 impl_items: &[ImplItem]) {
1826 // If applicable, create a rib for the type parameters.
1827 self.with_type_parameter_rib(HasTypeParameters(generics, ItemRibKind), |this| {
1828 // Dummy self type for better errors if `Self` is used in the trait path.
1829 this.with_self_rib(Def::SelfTy(None, None), |this| {
1830 // Resolve the trait reference, if necessary.
1831 this.with_optional_trait_ref(opt_trait_reference.as_ref(), |this, trait_id| {
1832 let item_def_id = this.definitions.local_def_id(item_id);
1833 this.with_self_rib(Def::SelfTy(trait_id, Some(item_def_id)), |this| {
1834 if let Some(trait_ref) = opt_trait_reference.as_ref() {
1835 // Resolve type arguments in trait path
1836 visit::walk_trait_ref(this, trait_ref);
1838 // Resolve the self type.
1839 this.visit_ty(self_type);
1840 // Resolve the type parameters.
1841 this.visit_generics(generics);
1842 this.with_current_self_type(self_type, |this| {
1843 for impl_item in impl_items {
1844 this.check_proc_macro_attrs(&impl_item.attrs);
1845 this.resolve_visibility(&impl_item.vis);
1846 match impl_item.node {
1847 ImplItemKind::Const(..) => {
1848 // If this is a trait impl, ensure the const
1850 this.check_trait_item(impl_item.ident.name,
1853 |n, s| ResolutionError::ConstNotMemberOfTrait(n, s));
1854 visit::walk_impl_item(this, impl_item);
1856 ImplItemKind::Method(ref sig, _) => {
1857 // If this is a trait impl, ensure the method
1859 this.check_trait_item(impl_item.ident.name,
1862 |n, s| ResolutionError::MethodNotMemberOfTrait(n, s));
1864 // We also need a new scope for the method-
1865 // specific type parameters.
1866 let type_parameters =
1867 HasTypeParameters(&sig.generics,
1868 MethodRibKind(!sig.decl.has_self()));
1869 this.with_type_parameter_rib(type_parameters, |this| {
1870 visit::walk_impl_item(this, impl_item);
1873 ImplItemKind::Type(ref ty) => {
1874 // If this is a trait impl, ensure the type
1876 this.check_trait_item(impl_item.ident.name,
1879 |n, s| ResolutionError::TypeNotMemberOfTrait(n, s));
1883 ImplItemKind::Macro(_) =>
1884 panic!("unexpanded macro in resolve!"),
1894 fn check_trait_item<F>(&self, name: Name, ns: Namespace, span: Span, err: F)
1895 where F: FnOnce(Name, &str) -> ResolutionError
1897 // If there is a TraitRef in scope for an impl, then the method must be in the
1899 if let Some((did, ref trait_ref)) = self.current_trait_ref {
1900 if !self.trait_item_map.contains_key(&(did, name, ns)) {
1901 let path_str = path_names_to_string(&trait_ref.path);
1902 resolve_error(self, span, err(name, &path_str));
1907 fn resolve_local(&mut self, local: &Local) {
1908 // Resolve the type.
1909 walk_list!(self, visit_ty, &local.ty);
1911 // Resolve the initializer.
1912 walk_list!(self, visit_expr, &local.init);
1914 // Resolve the pattern.
1915 self.resolve_pattern(&local.pat, PatternSource::Let, &mut FxHashMap());
1918 // build a map from pattern identifiers to binding-info's.
1919 // this is done hygienically. This could arise for a macro
1920 // that expands into an or-pattern where one 'x' was from the
1921 // user and one 'x' came from the macro.
1922 fn binding_mode_map(&mut self, pat: &Pat) -> BindingMap {
1923 let mut binding_map = FxHashMap();
1925 pat.walk(&mut |pat| {
1926 if let PatKind::Ident(binding_mode, ident, ref sub_pat) = pat.node {
1927 if sub_pat.is_some() || match self.def_map.get(&pat.id).map(|res| res.base_def()) {
1928 Some(Def::Local(..)) => true,
1931 let binding_info = BindingInfo { span: ident.span, binding_mode: binding_mode };
1932 binding_map.insert(ident.node, binding_info);
1941 // check that all of the arms in an or-pattern have exactly the
1942 // same set of bindings, with the same binding modes for each.
1943 fn check_consistent_bindings(&mut self, arm: &Arm) {
1944 if arm.pats.is_empty() {
1948 let mut missing_vars = FxHashMap();
1949 let mut inconsistent_vars = FxHashMap();
1950 for (i, p) in arm.pats.iter().enumerate() {
1951 let map_i = self.binding_mode_map(&p);
1953 for (j, q) in arm.pats.iter().enumerate() {
1958 let map_j = self.binding_mode_map(&q);
1959 for (&key, &binding_i) in &map_i {
1960 if map_j.len() == 0 { // Account for missing bindings when
1961 let binding_error = missing_vars // map_j has none.
1963 .or_insert(BindingError {
1965 origin: BTreeSet::new(),
1966 target: BTreeSet::new(),
1968 binding_error.origin.insert(binding_i.span);
1969 binding_error.target.insert(q.span);
1971 for (&key_j, &binding_j) in &map_j {
1972 match map_i.get(&key_j) {
1973 None => { // missing binding
1974 let binding_error = missing_vars
1976 .or_insert(BindingError {
1978 origin: BTreeSet::new(),
1979 target: BTreeSet::new(),
1981 binding_error.origin.insert(binding_j.span);
1982 binding_error.target.insert(p.span);
1984 Some(binding_i) => { // check consistent binding
1985 if binding_i.binding_mode != binding_j.binding_mode {
1988 .or_insert((binding_j.span, binding_i.span));
1996 let mut missing_vars = missing_vars.iter().collect::<Vec<_>>();
1997 missing_vars.sort();
1998 for (_, v) in missing_vars {
2000 *v.origin.iter().next().unwrap(),
2001 ResolutionError::VariableNotBoundInPattern(v));
2003 let mut inconsistent_vars = inconsistent_vars.iter().collect::<Vec<_>>();
2004 inconsistent_vars.sort();
2005 for (name, v) in inconsistent_vars {
2006 resolve_error(self, v.0, ResolutionError::VariableBoundWithDifferentMode(*name, v.1));
2010 fn resolve_arm(&mut self, arm: &Arm) {
2011 self.ribs[ValueNS].push(Rib::new(NormalRibKind));
2013 let mut bindings_list = FxHashMap();
2014 for pattern in &arm.pats {
2015 self.resolve_pattern(&pattern, PatternSource::Match, &mut bindings_list);
2018 // This has to happen *after* we determine which
2019 // pat_idents are variants
2020 self.check_consistent_bindings(arm);
2022 walk_list!(self, visit_expr, &arm.guard);
2023 self.visit_expr(&arm.body);
2025 self.ribs[ValueNS].pop();
2028 fn resolve_block(&mut self, block: &Block) {
2029 debug!("(resolving block) entering block");
2030 // Move down in the graph, if there's an anonymous module rooted here.
2031 let orig_module = self.current_module;
2032 let anonymous_module = self.block_map.get(&block.id).cloned(); // clones a reference
2034 let mut num_macro_definition_ribs = 0;
2035 if let Some(anonymous_module) = anonymous_module {
2036 debug!("(resolving block) found anonymous module, moving down");
2037 self.ribs[ValueNS].push(Rib::new(ModuleRibKind(anonymous_module)));
2038 self.ribs[TypeNS].push(Rib::new(ModuleRibKind(anonymous_module)));
2039 self.current_module = anonymous_module;
2040 self.finalize_current_module_macro_resolutions();
2042 self.ribs[ValueNS].push(Rib::new(NormalRibKind));
2045 // Descend into the block.
2046 for stmt in &block.stmts {
2047 if let ast::StmtKind::Item(ref item) = stmt.node {
2048 if let ast::ItemKind::MacroDef(..) = item.node {
2049 num_macro_definition_ribs += 1;
2050 let def = self.definitions.local_def_id(item.id);
2051 self.ribs[ValueNS].push(Rib::new(MacroDefinition(def)));
2052 self.label_ribs.push(Rib::new(MacroDefinition(def)));
2056 self.visit_stmt(stmt);
2060 self.current_module = orig_module;
2061 for _ in 0 .. num_macro_definition_ribs {
2062 self.ribs[ValueNS].pop();
2063 self.label_ribs.pop();
2065 self.ribs[ValueNS].pop();
2066 if let Some(_) = anonymous_module {
2067 self.ribs[TypeNS].pop();
2069 debug!("(resolving block) leaving block");
2072 fn fresh_binding(&mut self,
2073 ident: &SpannedIdent,
2075 outer_pat_id: NodeId,
2076 pat_src: PatternSource,
2077 bindings: &mut FxHashMap<Ident, NodeId>)
2079 // Add the binding to the local ribs, if it
2080 // doesn't already exist in the bindings map. (We
2081 // must not add it if it's in the bindings map
2082 // because that breaks the assumptions later
2083 // passes make about or-patterns.)
2084 let mut def = Def::Local(self.definitions.local_def_id(pat_id));
2085 match bindings.get(&ident.node).cloned() {
2086 Some(id) if id == outer_pat_id => {
2087 // `Variant(a, a)`, error
2091 ResolutionError::IdentifierBoundMoreThanOnceInSamePattern(
2092 &ident.node.name.as_str())
2095 Some(..) if pat_src == PatternSource::FnParam => {
2096 // `fn f(a: u8, a: u8)`, error
2100 ResolutionError::IdentifierBoundMoreThanOnceInParameterList(
2101 &ident.node.name.as_str())
2104 Some(..) if pat_src == PatternSource::Match => {
2105 // `Variant1(a) | Variant2(a)`, ok
2106 // Reuse definition from the first `a`.
2107 def = self.ribs[ValueNS].last_mut().unwrap().bindings[&ident.node];
2110 span_bug!(ident.span, "two bindings with the same name from \
2111 unexpected pattern source {:?}", pat_src);
2114 // A completely fresh binding, add to the lists if it's valid.
2115 if ident.node.name != keywords::Invalid.name() {
2116 bindings.insert(ident.node, outer_pat_id);
2117 self.ribs[ValueNS].last_mut().unwrap().bindings.insert(ident.node, def);
2122 PathResolution::new(def)
2125 fn resolve_pattern(&mut self,
2127 pat_src: PatternSource,
2128 // Maps idents to the node ID for the
2129 // outermost pattern that binds them.
2130 bindings: &mut FxHashMap<Ident, NodeId>) {
2131 // Visit all direct subpatterns of this pattern.
2132 let outer_pat_id = pat.id;
2133 pat.walk(&mut |pat| {
2135 PatKind::Ident(bmode, ref ident, ref opt_pat) => {
2136 // First try to resolve the identifier as some existing
2137 // entity, then fall back to a fresh binding.
2138 let binding = self.resolve_ident_in_lexical_scope(ident.node, ValueNS, None)
2139 .and_then(LexicalScopeBinding::item);
2140 let resolution = binding.map(NameBinding::def).and_then(|def| {
2141 let always_binding = !pat_src.is_refutable() || opt_pat.is_some() ||
2142 bmode != BindingMode::ByValue(Mutability::Immutable);
2144 Def::StructCtor(_, CtorKind::Const) |
2145 Def::VariantCtor(_, CtorKind::Const) |
2146 Def::Const(..) if !always_binding => {
2147 // A unit struct/variant or constant pattern.
2148 self.record_use(ident.node, ValueNS, binding.unwrap(), ident.span);
2149 Some(PathResolution::new(def))
2151 Def::StructCtor(..) | Def::VariantCtor(..) |
2152 Def::Const(..) | Def::Static(..) => {
2153 // A fresh binding that shadows something unacceptable.
2157 ResolutionError::BindingShadowsSomethingUnacceptable(
2158 pat_src.descr(), ident.node.name, binding.unwrap())
2162 Def::Local(..) | Def::Upvar(..) | Def::Fn(..) | Def::Err => {
2163 // These entities are explicitly allowed
2164 // to be shadowed by fresh bindings.
2168 span_bug!(ident.span, "unexpected definition for an \
2169 identifier in pattern: {:?}", def);
2172 }).unwrap_or_else(|| {
2173 self.fresh_binding(ident, pat.id, outer_pat_id, pat_src, bindings)
2176 self.record_def(pat.id, resolution);
2179 PatKind::TupleStruct(ref path, ..) => {
2180 self.smart_resolve_path(pat.id, None, path, PathSource::TupleStruct);
2183 PatKind::Path(ref qself, ref path) => {
2184 self.smart_resolve_path(pat.id, qself.as_ref(), path, PathSource::Pat);
2187 PatKind::Struct(ref path, ..) => {
2188 self.smart_resolve_path(pat.id, None, path, PathSource::Struct);
2196 visit::walk_pat(self, pat);
2199 // High-level and context dependent path resolution routine.
2200 // Resolves the path and records the resolution into definition map.
2201 // If resolution fails tries several techniques to find likely
2202 // resolution candidates, suggest imports or other help, and report
2203 // errors in user friendly way.
2204 fn smart_resolve_path(&mut self,
2206 qself: Option<&QSelf>,
2210 let segments = &path.segments.iter().map(|seg| seg.identifier).collect::<Vec<_>>();
2211 let ident_span = path.segments.last().map_or(path.span, |seg| seg.span);
2212 self.smart_resolve_path_fragment(id, qself, segments, path.span, ident_span, source)
2215 fn smart_resolve_path_fragment(&mut self,
2217 qself: Option<&QSelf>,
2223 let ns = source.namespace();
2224 let is_expected = &|def| source.is_expected(def);
2225 let is_enum_variant = &|def| if let Def::Variant(..) = def { true } else { false };
2227 // Base error is amended with one short label and possibly some longer helps/notes.
2228 let report_errors = |this: &mut Self, def: Option<Def>| {
2229 // Make the base error.
2230 let expected = source.descr_expected();
2231 let path_str = names_to_string(path);
2232 let code = source.error_code(def.is_some());
2233 let (base_msg, fallback_label, base_span) = if let Some(def) = def {
2234 (format!("expected {}, found {} `{}`", expected, def.kind_name(), path_str),
2235 format!("not a {}", expected), span)
2237 let item_str = path[path.len() - 1];
2238 let (mod_prefix, mod_str) = if path.len() == 1 {
2239 (format!(""), format!("this scope"))
2240 } else if path.len() == 2 && path[0].name == keywords::CrateRoot.name() {
2241 (format!(""), format!("the crate root"))
2243 let mod_path = &path[..path.len() - 1];
2244 let mod_prefix = match this.resolve_path(mod_path, Some(TypeNS), None) {
2245 PathResult::Module(module) => module.def(),
2247 }.map_or(format!(""), |def| format!("{} ", def.kind_name()));
2248 (mod_prefix, format!("`{}`", names_to_string(mod_path)))
2250 (format!("cannot find {} `{}` in {}{}", expected, item_str, mod_prefix, mod_str),
2251 format!("not found in {}", mod_str), ident_span)
2253 let mut err = this.session.struct_span_err_with_code(base_span, &base_msg, code);
2255 // Emit special messages for unresolved `Self` and `self`.
2256 if is_self_type(path, ns) {
2257 __diagnostic_used!(E0411);
2258 err.code("E0411".into());
2259 err.span_label(span, "`Self` is only available in traits and impls");
2262 if is_self_value(path, ns) {
2263 __diagnostic_used!(E0424);
2264 err.code("E0424".into());
2265 err.span_label(span, format!("`self` value is only available in \
2266 methods with `self` parameter"));
2270 // Try to lookup the name in more relaxed fashion for better error reporting.
2271 let name = path.last().unwrap().name;
2272 let candidates = this.lookup_import_candidates(name, ns, is_expected);
2273 if !candidates.is_empty() {
2274 // Report import candidates as help and proceed searching for labels.
2275 show_candidates(&mut err, &candidates, def.is_some());
2276 } else if is_expected(Def::Enum(DefId::local(CRATE_DEF_INDEX))) {
2277 let enum_candidates = this.lookup_import_candidates(name, ns, is_enum_variant);
2278 let mut enum_candidates = enum_candidates.iter()
2279 .map(|suggestion| import_candidate_to_paths(&suggestion)).collect::<Vec<_>>();
2280 enum_candidates.sort();
2281 for (sp, variant_path, enum_path) in enum_candidates {
2282 let msg = format!("there is an enum variant `{}`, did you mean to use `{}`?",
2288 err.span_help(sp, &msg);
2292 if path.len() == 1 && this.self_type_is_available() {
2293 if let Some(candidate) = this.lookup_assoc_candidate(name, ns, is_expected) {
2294 let self_is_available = this.self_value_is_available(path[0].ctxt);
2296 AssocSuggestion::Field => {
2297 err.span_label(span, format!("did you mean `self.{}`?", path_str));
2298 if !self_is_available {
2299 err.span_label(span, format!("`self` value is only available in \
2300 methods with `self` parameter"));
2303 AssocSuggestion::MethodWithSelf if self_is_available => {
2304 err.span_label(span, format!("did you mean `self.{}(...)`?",
2307 AssocSuggestion::MethodWithSelf | AssocSuggestion::AssocItem => {
2308 err.span_label(span, format!("did you mean `Self::{}`?", path_str));
2315 let mut levenshtein_worked = false;
2318 if let Some(candidate) = this.lookup_typo_candidate(path, ns, is_expected) {
2319 err.span_label(ident_span, format!("did you mean `{}`?", candidate));
2320 levenshtein_worked = true;
2323 // Try context dependent help if relaxed lookup didn't work.
2324 if let Some(def) = def {
2325 match (def, source) {
2326 (Def::Macro(..), _) => {
2327 err.span_label(span, format!("did you mean `{}!(...)`?", path_str));
2330 (Def::TyAlias(..), PathSource::Trait) => {
2331 err.span_label(span, "type aliases cannot be used for traits");
2334 (Def::Mod(..), PathSource::Expr(Some(parent))) => match parent.node {
2335 ExprKind::Field(_, ident) => {
2336 err.span_label(parent.span, format!("did you mean `{}::{}`?",
2337 path_str, ident.node));
2340 ExprKind::MethodCall(ident, ..) => {
2341 err.span_label(parent.span, format!("did you mean `{}::{}(...)`?",
2342 path_str, ident.node));
2347 _ if ns == ValueNS && is_struct_like(def) => {
2348 if let Def::Struct(def_id) = def {
2349 if let Some((ctor_def, ctor_vis))
2350 = this.struct_constructors.get(&def_id).cloned() {
2351 if is_expected(ctor_def) && !this.is_accessible(ctor_vis) {
2352 err.span_label(span, format!("constructor is not visible \
2353 here due to private fields"));
2357 err.span_label(span, format!("did you mean `{} {{ /* fields */ }}`?",
2366 if !levenshtein_worked {
2367 err.span_label(base_span, fallback_label);
2371 let report_errors = |this: &mut Self, def: Option<Def>| {
2372 report_errors(this, def).emit();
2373 err_path_resolution()
2376 let resolution = match self.resolve_qpath_anywhere(id, qself, path, ns, span,
2377 source.defer_to_typeck(),
2378 source.global_by_default()) {
2379 Some(resolution) if resolution.unresolved_segments() == 0 => {
2380 if is_expected(resolution.base_def()) || resolution.base_def() == Def::Err {
2383 // Add a temporary hack to smooth the transition to new struct ctor
2384 // visibility rules. See #38932 for more details.
2386 if let Def::Struct(def_id) = resolution.base_def() {
2387 if let Some((ctor_def, ctor_vis))
2388 = self.struct_constructors.get(&def_id).cloned() {
2389 if is_expected(ctor_def) && self.is_accessible(ctor_vis) {
2390 let lint = lint::builtin::LEGACY_CONSTRUCTOR_VISIBILITY;
2391 self.session.add_lint(lint, id, span,
2392 "private struct constructors are not usable through \
2393 reexports in outer modules".to_string());
2394 res = Some(PathResolution::new(ctor_def));
2399 res.unwrap_or_else(|| report_errors(self, Some(resolution.base_def())))
2402 Some(resolution) if source.defer_to_typeck() => {
2403 // Not fully resolved associated item `T::A::B` or `<T as Tr>::A::B`
2404 // or `<T>::A::B`. If `B` should be resolved in value namespace then
2405 // it needs to be added to the trait map.
2407 let item_name = path.last().unwrap().name;
2408 let traits = self.get_traits_containing_item(item_name, ns);
2409 self.trait_map.insert(id, traits);
2413 _ => report_errors(self, None)
2416 if let PathSource::TraitItem(..) = source {} else {
2417 // Avoid recording definition of `A::B` in `<T as A>::B::C`.
2418 self.record_def(id, resolution);
2423 fn self_type_is_available(&mut self) -> bool {
2424 let binding = self.resolve_ident_in_lexical_scope(keywords::SelfType.ident(), TypeNS, None);
2425 if let Some(LexicalScopeBinding::Def(def)) = binding { def != Def::Err } else { false }
2428 fn self_value_is_available(&mut self, ctxt: SyntaxContext) -> bool {
2429 let ident = Ident { name: keywords::SelfValue.name(), ctxt: ctxt };
2430 let binding = self.resolve_ident_in_lexical_scope(ident, ValueNS, None);
2431 if let Some(LexicalScopeBinding::Def(def)) = binding { def != Def::Err } else { false }
2434 // Resolve in alternative namespaces if resolution in the primary namespace fails.
2435 fn resolve_qpath_anywhere(&mut self,
2437 qself: Option<&QSelf>,
2439 primary_ns: Namespace,
2441 defer_to_typeck: bool,
2442 global_by_default: bool)
2443 -> Option<PathResolution> {
2444 let mut fin_res = None;
2445 // FIXME: can't resolve paths in macro namespace yet, macros are
2446 // processed by the little special hack below.
2447 for (i, ns) in [primary_ns, TypeNS, ValueNS, /*MacroNS*/].iter().cloned().enumerate() {
2448 if i == 0 || ns != primary_ns {
2449 match self.resolve_qpath(id, qself, path, ns, span, global_by_default) {
2450 // If defer_to_typeck, then resolution > no resolution,
2451 // otherwise full resolution > partial resolution > no resolution.
2452 Some(res) if res.unresolved_segments() == 0 || defer_to_typeck =>
2454 res => if fin_res.is_none() { fin_res = res },
2458 let is_global = self.global_macros.get(&path[0].name).cloned()
2459 .map(|binding| binding.get_macro(self).kind() == MacroKind::Bang).unwrap_or(false);
2460 if primary_ns != MacroNS && (is_global || self.macro_names.contains(&path[0].name)) {
2461 // Return some dummy definition, it's enough for error reporting.
2463 PathResolution::new(Def::Macro(DefId::local(CRATE_DEF_INDEX), MacroKind::Bang))
2469 /// Handles paths that may refer to associated items.
2470 fn resolve_qpath(&mut self,
2472 qself: Option<&QSelf>,
2476 global_by_default: bool)
2477 -> Option<PathResolution> {
2478 if let Some(qself) = qself {
2479 if qself.position == 0 {
2480 // FIXME: Create some fake resolution that can't possibly be a type.
2481 return Some(PathResolution::with_unresolved_segments(
2482 Def::Mod(DefId::local(CRATE_DEF_INDEX)), path.len()
2485 // Make sure `A::B` in `<T as A>::B::C` is a trait item.
2486 let ns = if qself.position + 1 == path.len() { ns } else { TypeNS };
2487 let res = self.smart_resolve_path_fragment(id, None, &path[..qself.position + 1],
2488 span, span, PathSource::TraitItem(ns));
2489 return Some(PathResolution::with_unresolved_segments(
2490 res.base_def(), res.unresolved_segments() + path.len() - qself.position - 1
2494 let result = match self.resolve_path(&path, Some(ns), Some(span)) {
2495 PathResult::NonModule(path_res) => path_res,
2496 PathResult::Module(module) if !module.is_normal() => {
2497 PathResolution::new(module.def().unwrap())
2499 // In `a(::assoc_item)*` `a` cannot be a module. If `a` does resolve to a module we
2500 // don't report an error right away, but try to fallback to a primitive type.
2501 // So, we are still able to successfully resolve something like
2503 // use std::u8; // bring module u8 in scope
2504 // fn f() -> u8 { // OK, resolves to primitive u8, not to std::u8
2505 // u8::max_value() // OK, resolves to associated function <u8>::max_value,
2506 // // not to non-existent std::u8::max_value
2509 // Such behavior is required for backward compatibility.
2510 // The same fallback is used when `a` resolves to nothing.
2511 PathResult::Module(..) | PathResult::Failed(..)
2512 if (ns == TypeNS || path.len() > 1) &&
2513 self.primitive_type_table.primitive_types.contains_key(&path[0].name) => {
2514 let prim = self.primitive_type_table.primitive_types[&path[0].name];
2516 TyUint(UintTy::U128) | TyInt(IntTy::I128) => {
2517 if !self.session.features.borrow().i128_type {
2518 emit_feature_err(&self.session.parse_sess,
2519 "i128_type", span, GateIssue::Language,
2520 "128-bit type is unstable");
2526 PathResolution::with_unresolved_segments(Def::PrimTy(prim), path.len() - 1)
2528 PathResult::Module(module) => PathResolution::new(module.def().unwrap()),
2529 PathResult::Failed(msg, false) => {
2530 resolve_error(self, span, ResolutionError::FailedToResolve(&msg));
2531 err_path_resolution()
2533 PathResult::Failed(..) => return None,
2534 PathResult::Indeterminate => bug!("indetermined path result in resolve_qpath"),
2537 if path.len() > 1 && !global_by_default && result.base_def() != Def::Err &&
2538 path[0].name != keywords::CrateRoot.name() && path[0].name != "$crate" {
2539 let unqualified_result = {
2540 match self.resolve_path(&[*path.last().unwrap()], Some(ns), None) {
2541 PathResult::NonModule(path_res) => path_res.base_def(),
2542 PathResult::Module(module) => module.def().unwrap(),
2543 _ => return Some(result),
2546 if result.base_def() == unqualified_result {
2547 let lint = lint::builtin::UNUSED_QUALIFICATIONS;
2548 self.session.add_lint(lint, id, span, "unnecessary qualification".to_string());
2555 fn resolve_path(&mut self,
2557 opt_ns: Option<Namespace>, // `None` indicates a module path
2558 record_used: Option<Span>)
2560 let mut module = None;
2561 let mut allow_super = true;
2563 for (i, &ident) in path.iter().enumerate() {
2564 let is_last = i == path.len() - 1;
2565 let ns = if is_last { opt_ns.unwrap_or(TypeNS) } else { TypeNS };
2567 if i == 0 && ns == TypeNS && ident.name == keywords::SelfValue.name() {
2568 module = Some(self.module_map[&self.current_module.normal_ancestor_id]);
2570 } else if allow_super && ns == TypeNS && ident.name == keywords::Super.name() {
2571 let current_module = if i == 0 { self.current_module } else { module.unwrap() };
2572 let self_module = self.module_map[¤t_module.normal_ancestor_id];
2573 if let Some(parent) = self_module.parent {
2574 module = Some(self.module_map[&parent.normal_ancestor_id]);
2577 let msg = "There are too many initial `super`s.".to_string();
2578 return PathResult::Failed(msg, false);
2581 allow_super = false;
2583 if i == 0 && ns == TypeNS && ident.name == keywords::CrateRoot.name() {
2584 module = Some(self.graph_root);
2586 } else if i == 0 && ns == TypeNS && ident.name == "$crate" {
2587 module = Some(self.resolve_crate_var(ident.ctxt));
2591 let binding = if let Some(module) = module {
2592 self.resolve_ident_in_module(module, ident, ns, false, record_used)
2593 } else if opt_ns == Some(MacroNS) {
2594 self.resolve_lexical_macro_path_segment(ident, ns, record_used)
2595 .map(MacroBinding::binding)
2597 match self.resolve_ident_in_lexical_scope(ident, ns, record_used) {
2598 Some(LexicalScopeBinding::Item(binding)) => Ok(binding),
2599 Some(LexicalScopeBinding::Def(def))
2600 if opt_ns == Some(TypeNS) || opt_ns == Some(ValueNS) => {
2601 return PathResult::NonModule(PathResolution::with_unresolved_segments(
2605 _ => Err(if record_used.is_some() { Determined } else { Undetermined }),
2611 let def = binding.def();
2612 let maybe_assoc = opt_ns != Some(MacroNS) && PathSource::Type.is_expected(def);
2613 if let Some(next_module) = binding.module() {
2614 module = Some(next_module);
2615 } else if def == Def::Err {
2616 return PathResult::NonModule(err_path_resolution());
2617 } else if opt_ns.is_some() && (is_last || maybe_assoc) {
2618 return PathResult::NonModule(PathResolution::with_unresolved_segments(
2619 def, path.len() - i - 1
2622 return PathResult::Failed(format!("Not a module `{}`", ident), is_last);
2625 Err(Undetermined) => return PathResult::Indeterminate,
2626 Err(Determined) => {
2627 if let Some(module) = module {
2628 if opt_ns.is_some() && !module.is_normal() {
2629 return PathResult::NonModule(PathResolution::with_unresolved_segments(
2630 module.def().unwrap(), path.len() - i
2634 let msg = if module.and_then(ModuleData::def) == self.graph_root.def() {
2635 let is_mod = |def| match def { Def::Mod(..) => true, _ => false };
2636 let mut candidates =
2637 self.lookup_import_candidates(ident.name, TypeNS, is_mod);
2638 candidates.sort_by_key(|c| (c.path.segments.len(), c.path.to_string()));
2639 if let Some(candidate) = candidates.get(0) {
2640 format!("Did you mean `{}`?", candidate.path)
2642 format!("Maybe a missing `extern crate {};`?", ident)
2645 format!("Use of undeclared type or module `{}`", ident)
2647 format!("Could not find `{}` in `{}`", ident, path[i - 1])
2649 return PathResult::Failed(msg, is_last);
2654 PathResult::Module(module.unwrap_or(self.graph_root))
2657 // Resolve a local definition, potentially adjusting for closures.
2658 fn adjust_local_def(&mut self,
2662 record_used: Option<Span>) -> Def {
2663 let ribs = &self.ribs[ns][rib_index + 1..];
2665 // An invalid forward use of a type parameter from a previous default.
2666 if let ForwardTyParamBanRibKind = self.ribs[ns][rib_index].kind {
2667 if let Some(span) = record_used {
2668 resolve_error(self, span,
2669 ResolutionError::ForwardDeclaredTyParam);
2671 assert_eq!(def, Def::Err);
2677 span_bug!(record_used.unwrap_or(DUMMY_SP), "unexpected {:?} in bindings", def)
2679 Def::Local(def_id) => {
2682 NormalRibKind | ModuleRibKind(..) | MacroDefinition(..) |
2683 ForwardTyParamBanRibKind => {
2684 // Nothing to do. Continue.
2686 ClosureRibKind(function_id) => {
2688 let node_id = self.definitions.as_local_node_id(def_id).unwrap();
2690 let seen = self.freevars_seen
2692 .or_insert_with(|| NodeMap());
2693 if let Some(&index) = seen.get(&node_id) {
2694 def = Def::Upvar(def_id, index, function_id);
2697 let vec = self.freevars
2699 .or_insert_with(|| vec![]);
2700 let depth = vec.len();
2701 def = Def::Upvar(def_id, depth, function_id);
2703 if let Some(span) = record_used {
2708 seen.insert(node_id, depth);
2711 ItemRibKind | MethodRibKind(_) => {
2712 // This was an attempt to access an upvar inside a
2713 // named function item. This is not allowed, so we
2715 if let Some(span) = record_used {
2716 resolve_error(self, span,
2717 ResolutionError::CannotCaptureDynamicEnvironmentInFnItem);
2721 ConstantItemRibKind => {
2722 // Still doesn't deal with upvars
2723 if let Some(span) = record_used {
2724 resolve_error(self, span,
2725 ResolutionError::AttemptToUseNonConstantValueInConstant);
2732 Def::TyParam(..) | Def::SelfTy(..) => {
2735 NormalRibKind | MethodRibKind(_) | ClosureRibKind(..) |
2736 ModuleRibKind(..) | MacroDefinition(..) | ForwardTyParamBanRibKind => {
2737 // Nothing to do. Continue.
2740 // This was an attempt to use a type parameter outside
2742 if let Some(span) = record_used {
2743 resolve_error(self, span,
2744 ResolutionError::TypeParametersFromOuterFunction);
2748 ConstantItemRibKind => {
2750 if let Some(span) = record_used {
2751 resolve_error(self, span,
2752 ResolutionError::OuterTypeParameterContext);
2764 // Calls `f` with a `Resolver` whose current lexical scope is `module`'s lexical scope,
2765 // i.e. the module's items and the prelude (unless the module is `#[no_implicit_prelude]`).
2766 // FIXME #34673: This needs testing.
2767 pub fn with_module_lexical_scope<T, F>(&mut self, module: Module<'a>, f: F) -> T
2768 where F: FnOnce(&mut Resolver<'a>) -> T,
2770 self.with_empty_ribs(|this| {
2771 this.ribs[ValueNS].push(Rib::new(ModuleRibKind(module)));
2772 this.ribs[TypeNS].push(Rib::new(ModuleRibKind(module)));
2777 fn with_empty_ribs<T, F>(&mut self, f: F) -> T
2778 where F: FnOnce(&mut Resolver<'a>) -> T,
2780 let ribs = replace(&mut self.ribs, PerNS::<Vec<Rib>>::default());
2781 let label_ribs = replace(&mut self.label_ribs, Vec::new());
2783 let result = f(self);
2785 self.label_ribs = label_ribs;
2789 fn lookup_assoc_candidate<FilterFn>(&mut self,
2792 filter_fn: FilterFn)
2793 -> Option<AssocSuggestion>
2794 where FilterFn: Fn(Def) -> bool
2796 fn extract_node_id(t: &Ty) -> Option<NodeId> {
2798 TyKind::Path(None, _) => Some(t.id),
2799 TyKind::Rptr(_, ref mut_ty) => extract_node_id(&mut_ty.ty),
2800 // This doesn't handle the remaining `Ty` variants as they are not
2801 // that commonly the self_type, it might be interesting to provide
2802 // support for those in future.
2807 // Fields are generally expected in the same contexts as locals.
2808 if filter_fn(Def::Local(DefId::local(CRATE_DEF_INDEX))) {
2809 if let Some(node_id) = self.current_self_type.as_ref().and_then(extract_node_id) {
2810 // Look for a field with the same name in the current self_type.
2811 if let Some(resolution) = self.def_map.get(&node_id) {
2812 match resolution.base_def() {
2813 Def::Struct(did) | Def::Union(did)
2814 if resolution.unresolved_segments() == 0 => {
2815 if let Some(field_names) = self.field_names.get(&did) {
2816 if field_names.iter().any(|&field_name| name == field_name) {
2817 return Some(AssocSuggestion::Field);
2827 // Look for associated items in the current trait.
2828 if let Some((trait_did, _)) = self.current_trait_ref {
2829 if let Some(&(def, has_self)) = self.trait_item_map.get(&(trait_did, name, ns)) {
2831 return Some(if has_self {
2832 AssocSuggestion::MethodWithSelf
2834 AssocSuggestion::AssocItem
2843 fn lookup_typo_candidate<FilterFn>(&mut self,
2846 filter_fn: FilterFn)
2848 where FilterFn: Fn(Def) -> bool
2850 let add_module_candidates = |module: Module, names: &mut Vec<Name>| {
2851 for (&(ident, _), resolution) in module.resolutions.borrow().iter() {
2852 if let Some(binding) = resolution.borrow().binding {
2853 if filter_fn(binding.def()) {
2854 names.push(ident.name);
2860 let mut names = Vec::new();
2861 if path.len() == 1 {
2862 // Search in lexical scope.
2863 // Walk backwards up the ribs in scope and collect candidates.
2864 for rib in self.ribs[ns].iter().rev() {
2865 // Locals and type parameters
2866 for (ident, def) in &rib.bindings {
2867 if filter_fn(*def) {
2868 names.push(ident.name);
2872 if let ModuleRibKind(module) = rib.kind {
2873 // Items from this module
2874 add_module_candidates(module, &mut names);
2876 if let ModuleKind::Block(..) = module.kind {
2877 // We can see through blocks
2879 // Items from the prelude
2880 if let Some(prelude) = self.prelude {
2881 if !module.no_implicit_prelude {
2882 add_module_candidates(prelude, &mut names);
2889 // Add primitive types to the mix
2890 if filter_fn(Def::PrimTy(TyBool)) {
2891 for (name, _) in &self.primitive_type_table.primitive_types {
2896 // Search in module.
2897 let mod_path = &path[..path.len() - 1];
2898 if let PathResult::Module(module) = self.resolve_path(mod_path, Some(TypeNS), None) {
2899 add_module_candidates(module, &mut names);
2903 let name = path[path.len() - 1].name;
2904 // Make sure error reporting is deterministic.
2905 names.sort_by_key(|name| name.as_str());
2906 match find_best_match_for_name(names.iter(), &name.as_str(), None) {
2907 Some(found) if found != name => Some(found),
2912 fn with_resolved_label<F>(&mut self, label: Option<SpannedIdent>, id: NodeId, f: F)
2913 where F: FnOnce(&mut Resolver)
2915 if let Some(label) = label {
2916 let def = Def::Label(id);
2917 self.with_label_rib(|this| {
2918 this.label_ribs.last_mut().unwrap().bindings.insert(label.node, def);
2926 fn resolve_labeled_block(&mut self, label: Option<SpannedIdent>, id: NodeId, block: &Block) {
2927 self.with_resolved_label(label, id, |this| this.visit_block(block));
2930 fn resolve_expr(&mut self, expr: &Expr, parent: Option<&Expr>) {
2931 // First, record candidate traits for this expression if it could
2932 // result in the invocation of a method call.
2934 self.record_candidate_traits_for_expr_if_necessary(expr);
2936 // Next, resolve the node.
2938 ExprKind::Path(ref qself, ref path) => {
2939 self.smart_resolve_path(expr.id, qself.as_ref(), path, PathSource::Expr(parent));
2940 visit::walk_expr(self, expr);
2943 ExprKind::Struct(ref path, ..) => {
2944 self.smart_resolve_path(expr.id, None, path, PathSource::Struct);
2945 visit::walk_expr(self, expr);
2948 ExprKind::Break(Some(label), _) | ExprKind::Continue(Some(label)) => {
2949 match self.search_label(label.node) {
2951 self.record_def(expr.id, err_path_resolution());
2954 ResolutionError::UndeclaredLabel(&label.node.name.as_str()));
2956 Some(def @ Def::Label(_)) => {
2957 // Since this def is a label, it is never read.
2958 self.record_def(expr.id, PathResolution::new(def));
2961 span_bug!(expr.span, "label wasn't mapped to a label def!");
2965 // visit `break` argument if any
2966 visit::walk_expr(self, expr);
2969 ExprKind::IfLet(ref pattern, ref subexpression, ref if_block, ref optional_else) => {
2970 self.visit_expr(subexpression);
2972 self.ribs[ValueNS].push(Rib::new(NormalRibKind));
2973 self.resolve_pattern(pattern, PatternSource::IfLet, &mut FxHashMap());
2974 self.visit_block(if_block);
2975 self.ribs[ValueNS].pop();
2977 optional_else.as_ref().map(|expr| self.visit_expr(expr));
2980 ExprKind::Loop(ref block, label) => self.resolve_labeled_block(label, expr.id, &block),
2982 ExprKind::While(ref subexpression, ref block, label) => {
2983 self.with_resolved_label(label, expr.id, |this| {
2984 this.visit_expr(subexpression);
2985 this.visit_block(block);
2989 ExprKind::WhileLet(ref pattern, ref subexpression, ref block, label) => {
2990 self.with_resolved_label(label, expr.id, |this| {
2991 this.visit_expr(subexpression);
2992 this.ribs[ValueNS].push(Rib::new(NormalRibKind));
2993 this.resolve_pattern(pattern, PatternSource::WhileLet, &mut FxHashMap());
2994 this.visit_block(block);
2995 this.ribs[ValueNS].pop();
2999 ExprKind::ForLoop(ref pattern, ref subexpression, ref block, label) => {
3000 self.visit_expr(subexpression);
3001 self.ribs[ValueNS].push(Rib::new(NormalRibKind));
3002 self.resolve_pattern(pattern, PatternSource::For, &mut FxHashMap());
3004 self.resolve_labeled_block(label, expr.id, block);
3006 self.ribs[ValueNS].pop();
3009 // Equivalent to `visit::walk_expr` + passing some context to children.
3010 ExprKind::Field(ref subexpression, _) => {
3011 self.resolve_expr(subexpression, Some(expr));
3013 ExprKind::MethodCall(_, ref types, ref arguments) => {
3014 let mut arguments = arguments.iter();
3015 self.resolve_expr(arguments.next().unwrap(), Some(expr));
3016 for argument in arguments {
3017 self.resolve_expr(argument, None);
3019 for ty in types.iter() {
3024 ExprKind::Repeat(ref element, ref count) => {
3025 self.visit_expr(element);
3026 self.with_constant_rib(|this| {
3027 this.visit_expr(count);
3030 ExprKind::Call(ref callee, ref arguments) => {
3031 self.resolve_expr(callee, Some(expr));
3032 for argument in arguments {
3033 self.resolve_expr(argument, None);
3038 visit::walk_expr(self, expr);
3043 fn record_candidate_traits_for_expr_if_necessary(&mut self, expr: &Expr) {
3045 ExprKind::Field(_, name) => {
3046 // FIXME(#6890): Even though you can't treat a method like a
3047 // field, we need to add any trait methods we find that match
3048 // the field name so that we can do some nice error reporting
3049 // later on in typeck.
3050 let traits = self.get_traits_containing_item(name.node.name, ValueNS);
3051 self.trait_map.insert(expr.id, traits);
3053 ExprKind::MethodCall(name, ..) => {
3054 debug!("(recording candidate traits for expr) recording traits for {}",
3056 let traits = self.get_traits_containing_item(name.node.name, ValueNS);
3057 self.trait_map.insert(expr.id, traits);
3065 fn get_traits_containing_item(&mut self, name: Name, ns: Namespace) -> Vec<TraitCandidate> {
3066 debug!("(getting traits containing item) looking for '{}'", name);
3068 let mut found_traits = Vec::new();
3069 // Look for the current trait.
3070 if let Some((trait_def_id, _)) = self.current_trait_ref {
3071 if self.trait_item_map.contains_key(&(trait_def_id, name, ns)) {
3072 found_traits.push(TraitCandidate { def_id: trait_def_id, import_id: None });
3076 let mut search_module = self.current_module;
3078 self.get_traits_in_module_containing_item(name, ns, search_module, &mut found_traits);
3079 match search_module.kind {
3080 ModuleKind::Block(..) => search_module = search_module.parent.unwrap(),
3085 if let Some(prelude) = self.prelude {
3086 if !search_module.no_implicit_prelude {
3087 self.get_traits_in_module_containing_item(name, ns, prelude, &mut found_traits);
3094 fn get_traits_in_module_containing_item(&mut self,
3098 found_traits: &mut Vec<TraitCandidate>) {
3099 let mut traits = module.traits.borrow_mut();
3100 if traits.is_none() {
3101 let mut collected_traits = Vec::new();
3102 module.for_each_child(|name, ns, binding| {
3103 if ns != TypeNS { return }
3104 if let Def::Trait(_) = binding.def() {
3105 collected_traits.push((name, binding));
3108 *traits = Some(collected_traits.into_boxed_slice());
3111 for &(trait_name, binding) in traits.as_ref().unwrap().iter() {
3112 let trait_def_id = binding.def().def_id();
3113 if self.trait_item_map.contains_key(&(trait_def_id, name, ns)) {
3114 let import_id = match binding.kind {
3115 NameBindingKind::Import { directive, .. } => {
3116 self.maybe_unused_trait_imports.insert(directive.id);
3117 self.add_to_glob_map(directive.id, trait_name);
3122 found_traits.push(TraitCandidate { def_id: trait_def_id, import_id: import_id });
3127 /// When name resolution fails, this method can be used to look up candidate
3128 /// entities with the expected name. It allows filtering them using the
3129 /// supplied predicate (which should be used to only accept the types of
3130 /// definitions expected e.g. traits). The lookup spans across all crates.
3132 /// NOTE: The method does not look into imports, but this is not a problem,
3133 /// since we report the definitions (thus, the de-aliased imports).
3134 fn lookup_import_candidates<FilterFn>(&mut self,
3136 namespace: Namespace,
3137 filter_fn: FilterFn)
3138 -> Vec<ImportSuggestion>
3139 where FilterFn: Fn(Def) -> bool
3141 let mut candidates = Vec::new();
3142 let mut worklist = Vec::new();
3143 let mut seen_modules = FxHashSet();
3144 worklist.push((self.graph_root, Vec::new(), false));
3146 while let Some((in_module,
3148 in_module_is_extern)) = worklist.pop() {
3149 self.populate_module_if_necessary(in_module);
3151 in_module.for_each_child(|ident, ns, name_binding| {
3153 // avoid imports entirely
3154 if name_binding.is_import() && !name_binding.is_extern_crate() { return; }
3155 // avoid non-importable candidates as well
3156 if !name_binding.is_importable() { return; }
3158 // collect results based on the filter function
3159 if ident.name == lookup_name && ns == namespace {
3160 if filter_fn(name_binding.def()) {
3162 let mut segms = path_segments.clone();
3163 segms.push(ast::PathSegment::from_ident(ident, name_binding.span));
3165 span: name_binding.span,
3168 // the entity is accessible in the following cases:
3169 // 1. if it's defined in the same crate, it's always
3170 // accessible (since private entities can be made public)
3171 // 2. if it's defined in another crate, it's accessible
3172 // only if both the module is public and the entity is
3173 // declared as public (due to pruning, we don't explore
3174 // outside crate private modules => no need to check this)
3175 if !in_module_is_extern || name_binding.vis == ty::Visibility::Public {
3176 candidates.push(ImportSuggestion { path: path });
3181 // collect submodules to explore
3182 if let Some(module) = name_binding.module() {
3184 let mut path_segments = path_segments.clone();
3185 path_segments.push(ast::PathSegment::from_ident(ident, name_binding.span));
3187 if !in_module_is_extern || name_binding.vis == ty::Visibility::Public {
3188 // add the module to the lookup
3189 let is_extern = in_module_is_extern || name_binding.is_extern_crate();
3190 if seen_modules.insert(module.def_id().unwrap()) {
3191 worklist.push((module, path_segments, is_extern));
3201 fn record_def(&mut self, node_id: NodeId, resolution: PathResolution) {
3202 debug!("(recording def) recording {:?} for {}", resolution, node_id);
3203 if let Some(prev_res) = self.def_map.insert(node_id, resolution) {
3204 panic!("path resolved multiple times ({:?} before, {:?} now)", prev_res, resolution);
3208 fn resolve_visibility(&mut self, vis: &ast::Visibility) -> ty::Visibility {
3210 ast::Visibility::Public => ty::Visibility::Public,
3211 ast::Visibility::Crate(..) => ty::Visibility::Restricted(DefId::local(CRATE_DEF_INDEX)),
3212 ast::Visibility::Inherited => {
3213 ty::Visibility::Restricted(self.current_module.normal_ancestor_id)
3215 ast::Visibility::Restricted { ref path, id } => {
3216 let def = self.smart_resolve_path(id, None, path,
3217 PathSource::Visibility).base_def();
3218 if def == Def::Err {
3219 ty::Visibility::Public
3221 let vis = ty::Visibility::Restricted(def.def_id());
3222 if self.is_accessible(vis) {
3225 self.session.span_err(path.span, "visibilities can only be restricted \
3226 to ancestor modules");
3227 ty::Visibility::Public
3234 fn is_accessible(&self, vis: ty::Visibility) -> bool {
3235 vis.is_accessible_from(self.current_module.normal_ancestor_id, self)
3238 fn is_accessible_from(&self, vis: ty::Visibility, module: Module<'a>) -> bool {
3239 vis.is_accessible_from(module.normal_ancestor_id, self)
3242 fn report_errors(&mut self) {
3243 self.report_shadowing_errors();
3244 let mut reported_spans = FxHashSet();
3246 for &AmbiguityError { span, name, b1, b2, lexical, legacy } in &self.ambiguity_errors {
3247 if !reported_spans.insert(span) { continue }
3248 let participle = |binding: &NameBinding| {
3249 if binding.is_import() { "imported" } else { "defined" }
3251 let msg1 = format!("`{}` could refer to the name {} here", name, participle(b1));
3252 let msg2 = format!("`{}` could also refer to the name {} here", name, participle(b2));
3253 let note = if b1.expansion == Mark::root() || !lexical && b1.is_glob_import() {
3254 format!("consider adding an explicit import of `{}` to disambiguate", name)
3255 } else if let Def::Macro(..) = b1.def() {
3256 format!("macro-expanded {} do not shadow",
3257 if b1.is_import() { "macro imports" } else { "macros" })
3259 format!("macro-expanded {} do not shadow when used in a macro invocation path",
3260 if b1.is_import() { "imports" } else { "items" })
3263 let id = match b2.kind {
3264 NameBindingKind::Import { directive, .. } => directive.id,
3265 _ => unreachable!(),
3267 let mut span = MultiSpan::from_span(span);
3268 span.push_span_label(b1.span, msg1);
3269 span.push_span_label(b2.span, msg2);
3270 let msg = format!("`{}` is ambiguous", name);
3271 self.session.add_lint(lint::builtin::LEGACY_IMPORTS, id, span, msg);
3274 self.session.struct_span_err(span, &format!("`{}` is ambiguous", name));
3275 err.span_note(b1.span, &msg1);
3277 Def::Macro(..) if b2.span == DUMMY_SP =>
3278 err.note(&format!("`{}` is also a builtin macro", name)),
3279 _ => err.span_note(b2.span, &msg2),
3281 err.note(¬e).emit();
3285 for &PrivacyError(span, name, binding) in &self.privacy_errors {
3286 if !reported_spans.insert(span) { continue }
3287 if binding.is_extern_crate() {
3288 // Warn when using an inaccessible extern crate.
3289 let node_id = match binding.kind {
3290 NameBindingKind::Import { directive, .. } => directive.id,
3291 _ => unreachable!(),
3293 let msg = format!("extern crate `{}` is private", name);
3294 self.session.add_lint(lint::builtin::INACCESSIBLE_EXTERN_CRATE, node_id, span, msg);
3296 let def = binding.def();
3297 self.session.span_err(span, &format!("{} `{}` is private", def.kind_name(), name));
3302 fn report_shadowing_errors(&mut self) {
3303 for (name, scope) in replace(&mut self.lexical_macro_resolutions, Vec::new()) {
3304 self.resolve_legacy_scope(scope, name, true);
3307 let mut reported_errors = FxHashSet();
3308 for binding in replace(&mut self.disallowed_shadowing, Vec::new()) {
3309 if self.resolve_legacy_scope(&binding.parent, binding.name, false).is_some() &&
3310 reported_errors.insert((binding.name, binding.span)) {
3311 let msg = format!("`{}` is already in scope", binding.name);
3312 self.session.struct_span_err(binding.span, &msg)
3313 .note("macro-expanded `macro_rules!`s may not shadow \
3314 existing macros (see RFC 1560)")
3320 fn report_conflict(&mut self,
3324 binding: &NameBinding,
3325 old_binding: &NameBinding) {
3326 // Error on the second of two conflicting names
3327 if old_binding.span.lo > binding.span.lo {
3328 return self.report_conflict(parent, ident, ns, old_binding, binding);
3331 let container = match parent.kind {
3332 ModuleKind::Def(Def::Mod(_), _) => "module",
3333 ModuleKind::Def(Def::Trait(_), _) => "trait",
3334 ModuleKind::Block(..) => "block",
3338 let (participle, noun) = match old_binding.is_import() {
3339 true => ("imported", "import"),
3340 false => ("defined", "definition"),
3343 let (name, span) = (ident.name, binding.span);
3345 if let Some(s) = self.name_already_seen.get(&name) {
3352 let kind = match (ns, old_binding.module()) {
3353 (ValueNS, _) => "a value",
3354 (MacroNS, _) => "a macro",
3355 (TypeNS, _) if old_binding.is_extern_crate() => "an extern crate",
3356 (TypeNS, Some(module)) if module.is_normal() => "a module",
3357 (TypeNS, Some(module)) if module.is_trait() => "a trait",
3358 (TypeNS, _) => "a type",
3360 format!("{} named `{}` has already been {} in this {}",
3361 kind, name, participle, container)
3364 let mut err = match (old_binding.is_extern_crate(), binding.is_extern_crate()) {
3365 (true, true) => struct_span_err!(self.session, span, E0259, "{}", msg),
3366 (true, _) | (_, true) => match binding.is_import() && old_binding.is_import() {
3367 true => struct_span_err!(self.session, span, E0254, "{}", msg),
3368 false => struct_span_err!(self.session, span, E0260, "{}", msg),
3370 _ => match (old_binding.is_import(), binding.is_import()) {
3371 (false, false) => struct_span_err!(self.session, span, E0428, "{}", msg),
3372 (true, true) => struct_span_err!(self.session, span, E0252, "{}", msg),
3373 _ => struct_span_err!(self.session, span, E0255, "{}", msg),
3377 err.span_label(span, format!("`{}` already {}", name, participle));
3378 if old_binding.span != syntax_pos::DUMMY_SP {
3379 err.span_label(old_binding.span, format!("previous {} of `{}` here", noun, name));
3382 self.name_already_seen.insert(name, span);
3385 fn warn_legacy_self_import(&self, directive: &'a ImportDirective<'a>) {
3386 let (id, span) = (directive.id, directive.span);
3387 let msg = "`self` no longer imports values".to_string();
3388 self.session.add_lint(lint::builtin::LEGACY_IMPORTS, id, span, msg);
3391 fn check_proc_macro_attrs(&mut self, attrs: &[ast::Attribute]) {
3392 if self.proc_macro_enabled { return; }
3395 if attr.path.segments.len() > 1 {
3398 let ident = attr.path.segments[0].identifier;
3399 let result = self.resolve_lexical_macro_path_segment(ident, MacroNS, None);
3400 if let Ok(binding) = result {
3401 if let SyntaxExtension::AttrProcMacro(..) = *binding.binding().get_macro(self) {
3402 attr::mark_known(attr);
3404 let msg = "attribute procedural macros are experimental";
3405 let feature = "proc_macro";
3407 feature_err(&self.session.parse_sess, feature,
3408 attr.span, GateIssue::Language, msg)
3409 .span_note(binding.span(), "procedural macro imported here")
3417 fn is_struct_like(def: Def) -> bool {
3419 Def::VariantCtor(_, CtorKind::Fictive) => true,
3420 _ => PathSource::Struct.is_expected(def),
3424 fn is_self_type(path: &[Ident], namespace: Namespace) -> bool {
3425 namespace == TypeNS && path.len() == 1 && path[0].name == keywords::SelfType.name()
3428 fn is_self_value(path: &[Ident], namespace: Namespace) -> bool {
3429 namespace == ValueNS && path.len() == 1 && path[0].name == keywords::SelfValue.name()
3432 fn names_to_string(idents: &[Ident]) -> String {
3433 let mut result = String::new();
3434 for (i, ident) in idents.iter().filter(|i| i.name != keywords::CrateRoot.name()).enumerate() {
3436 result.push_str("::");
3438 result.push_str(&ident.name.as_str());
3443 fn path_names_to_string(path: &Path) -> String {
3444 names_to_string(&path.segments.iter().map(|seg| seg.identifier).collect::<Vec<_>>())
3447 /// Get the path for an enum and the variant from an `ImportSuggestion` for an enum variant.
3448 fn import_candidate_to_paths(suggestion: &ImportSuggestion) -> (Span, String, String) {
3449 let variant_path = &suggestion.path;
3450 let variant_path_string = path_names_to_string(variant_path);
3452 let path_len = suggestion.path.segments.len();
3453 let enum_path = ast::Path {
3454 span: suggestion.path.span,
3455 segments: suggestion.path.segments[0..path_len - 1].to_vec(),
3457 let enum_path_string = path_names_to_string(&enum_path);
3459 (suggestion.path.span, variant_path_string, enum_path_string)
3463 /// When an entity with a given name is not available in scope, we search for
3464 /// entities with that name in all crates. This method allows outputting the
3465 /// results of this search in a programmer-friendly way
3466 fn show_candidates(session: &mut DiagnosticBuilder,
3467 candidates: &[ImportSuggestion],
3469 // don't show more than MAX_CANDIDATES results, so
3470 // we're consistent with the trait suggestions
3471 const MAX_CANDIDATES: usize = 4;
3473 // we want consistent results across executions, but candidates are produced
3474 // by iterating through a hash map, so make sure they are ordered:
3475 let mut path_strings: Vec<_> =
3476 candidates.into_iter().map(|c| path_names_to_string(&c.path)).collect();
3477 path_strings.sort();
3479 let better = if better { "better " } else { "" };
3480 let msg_diff = match path_strings.len() {
3481 1 => " is found in another module, you can import it",
3482 _ => "s are found in other modules, you can import them",
3485 let end = cmp::min(MAX_CANDIDATES, path_strings.len());
3486 session.help(&format!("possible {}candidate{} into scope:{}{}",
3489 &path_strings[0..end].iter().map(|candidate| {
3490 format!("\n `use {};`", candidate)
3491 }).collect::<String>(),
3492 if path_strings.len() > MAX_CANDIDATES {
3493 format!("\nand {} other candidates",
3494 path_strings.len() - MAX_CANDIDATES)
3501 /// A somewhat inefficient routine to obtain the name of a module.
3502 fn module_to_string(module: Module) -> String {
3503 let mut names = Vec::new();
3505 fn collect_mod(names: &mut Vec<Ident>, module: Module) {
3506 if let ModuleKind::Def(_, name) = module.kind {
3507 if let Some(parent) = module.parent {
3508 names.push(Ident::with_empty_ctxt(name));
3509 collect_mod(names, parent);
3512 // danger, shouldn't be ident?
3513 names.push(Ident::from_str("<opaque>"));
3514 collect_mod(names, module.parent.unwrap());
3517 collect_mod(&mut names, module);
3519 if names.is_empty() {
3520 return "???".to_string();
3522 names_to_string(&names.into_iter().rev().collect::<Vec<_>>())
3525 fn err_path_resolution() -> PathResolution {
3526 PathResolution::new(Def::Err)
3529 #[derive(PartialEq,Copy, Clone)]
3530 pub enum MakeGlobMap {
3535 __build_diagnostic_array! { librustc_resolve, DIAGNOSTICS }