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 // Do not remove on snapshot creation. Needed for bootstrap. (Issue #22364)
12 #![cfg_attr(stage0, feature(custom_attribute))]
13 #![crate_name = "rustc_resolve"]
14 #![unstable(feature = "rustc_private", issue = "27812")]
15 #![cfg_attr(stage0, staged_api)]
16 #![crate_type = "dylib"]
17 #![crate_type = "rlib"]
18 #![doc(html_logo_url = "https://www.rust-lang.org/logos/rust-logo-128x128-blk-v2.png",
19 html_favicon_url = "https://doc.rust-lang.org/favicon.ico",
20 html_root_url = "https://doc.rust-lang.org/nightly/")]
22 #![feature(associated_consts)]
23 #![feature(borrow_state)]
24 #![feature(rustc_diagnostic_macros)]
25 #![feature(rustc_private)]
26 #![feature(staged_api)]
34 extern crate rustc_bitflags;
35 extern crate rustc_front;
39 use self::PatternBindingMode::*;
40 use self::Namespace::*;
41 use self::NamespaceResult::*;
42 use self::ResolveResult::*;
43 use self::FallbackSuggestion::*;
44 use self::TypeParameters::*;
46 use self::UseLexicalScopeFlag::*;
47 use self::ModulePrefixResult::*;
48 use self::AssocItemResolveResult::*;
49 use self::NameSearchType::*;
50 use self::BareIdentifierPatternResolution::*;
51 use self::ParentLink::*;
52 use self::FallbackChecks::*;
54 use rustc::front::map as hir_map;
55 use rustc::session::Session;
57 use rustc::middle::cstore::{CrateStore, DefLike, DlDef};
58 use rustc::middle::def::*;
59 use rustc::middle::def_id::DefId;
60 use rustc::middle::pat_util::pat_bindings;
61 use rustc::middle::privacy::*;
62 use rustc::middle::subst::{ParamSpace, FnSpace, TypeSpace};
63 use rustc::middle::ty::{Freevar, FreevarMap, TraitMap, GlobMap};
64 use rustc::util::nodemap::{NodeMap, DefIdSet, FnvHashMap};
67 use syntax::ast::{CRATE_NODE_ID, Ident, Name, NodeId, CrateNum, TyIs, TyI8, TyI16, TyI32, TyI64};
68 use syntax::ast::{TyUs, TyU8, TyU16, TyU32, TyU64, TyF64, TyF32};
69 use syntax::attr::AttrMetaMethods;
70 use syntax::parse::token::{self, special_names, special_idents};
71 use syntax::codemap::{self, Span, Pos};
72 use syntax::util::lev_distance::{lev_distance, max_suggestion_distance};
74 use rustc_front::intravisit::{self, FnKind, Visitor};
76 use rustc_front::hir::{Arm, BindByRef, BindByValue, BindingMode, Block};
77 use rustc_front::hir::Crate;
78 use rustc_front::hir::{Expr, ExprAgain, ExprBreak, ExprField};
79 use rustc_front::hir::{ExprLoop, ExprWhile, ExprMethodCall};
80 use rustc_front::hir::{ExprPath, ExprStruct, FnDecl};
81 use rustc_front::hir::{ForeignItemFn, ForeignItemStatic, Generics};
82 use rustc_front::hir::{ImplItem, Item, ItemConst, ItemEnum, ItemExternCrate};
83 use rustc_front::hir::{ItemFn, ItemForeignMod, ItemImpl, ItemMod, ItemStatic, ItemDefaultImpl};
84 use rustc_front::hir::{ItemStruct, ItemTrait, ItemTy, ItemUse};
85 use rustc_front::hir::Local;
86 use rustc_front::hir::{Pat, PatEnum, PatIdent, PatLit, PatQPath};
87 use rustc_front::hir::{PatRange, PatStruct, Path, PrimTy};
88 use rustc_front::hir::{TraitRef, Ty, TyBool, TyChar, TyFloat, TyInt};
89 use rustc_front::hir::{TyRptr, TyStr, TyUint, TyPath, TyPtr};
90 use rustc_front::util::walk_pat;
92 use std::collections::{HashMap, HashSet};
93 use std::cell::{Cell, RefCell};
95 use std::mem::replace;
96 use std::rc::{Rc, Weak};
99 use resolve_imports::{Target, ImportDirective, ImportResolutionPerNamespace};
100 use resolve_imports::Shadowable;
102 // NB: This module needs to be declared first so diagnostics are
103 // registered before they are used.
108 mod build_reduced_graph;
111 // Perform the callback, not walking deeper if the return is true
112 macro_rules! execute_callback {
113 ($node: expr, $walker: expr) => (
114 if let Some(ref callback) = $walker.callback {
115 if callback($node, &mut $walker.resolved) {
122 enum SuggestionType {
128 pub enum ResolutionError<'a> {
129 /// error E0401: can't use type parameters from outer function
130 TypeParametersFromOuterFunction,
131 /// error E0402: cannot use an outer type parameter in this context
132 OuterTypeParameterContext,
133 /// error E0403: the name is already used for a type parameter in this type parameter list
134 NameAlreadyUsedInTypeParameterList(Name),
135 /// error E0404: is not a trait
136 IsNotATrait(&'a str),
137 /// error E0405: use of undeclared trait name
138 UndeclaredTraitName(&'a str),
139 /// error E0406: undeclared associated type
140 UndeclaredAssociatedType,
141 /// error E0407: method is not a member of trait
142 MethodNotMemberOfTrait(Name, &'a str),
143 /// error E0437: type is not a member of trait
144 TypeNotMemberOfTrait(Name, &'a str),
145 /// error E0438: const is not a member of trait
146 ConstNotMemberOfTrait(Name, &'a str),
147 /// error E0408: variable `{}` from pattern #1 is not bound in pattern
148 VariableNotBoundInPattern(Name, usize),
149 /// error E0409: variable is bound with different mode in pattern #{} than in pattern #1
150 VariableBoundWithDifferentMode(Name, usize),
151 /// error E0410: variable from pattern is not bound in pattern #1
152 VariableNotBoundInParentPattern(Name, usize),
153 /// error E0411: use of `Self` outside of an impl or trait
154 SelfUsedOutsideImplOrTrait,
155 /// error E0412: use of undeclared
156 UseOfUndeclared(&'a str, &'a str),
157 /// error E0413: declaration shadows an enum variant or unit-like struct in scope
158 DeclarationShadowsEnumVariantOrUnitLikeStruct(Name),
159 /// error E0414: only irrefutable patterns allowed here
160 OnlyIrrefutablePatternsAllowedHere(DefId, Name),
161 /// error E0415: identifier is bound more than once in this parameter list
162 IdentifierBoundMoreThanOnceInParameterList(&'a str),
163 /// error E0416: identifier is bound more than once in the same pattern
164 IdentifierBoundMoreThanOnceInSamePattern(&'a str),
165 /// error E0417: static variables cannot be referenced in a pattern
166 StaticVariableReference,
167 /// error E0418: is not an enum variant, struct or const
168 NotAnEnumVariantStructOrConst(&'a str),
169 /// error E0419: unresolved enum variant, struct or const
170 UnresolvedEnumVariantStructOrConst(&'a str),
171 /// error E0420: is not an associated const
172 NotAnAssociatedConst(&'a str),
173 /// error E0421: unresolved associated const
174 UnresolvedAssociatedConst(&'a str),
175 /// error E0422: does not name a struct
176 DoesNotNameAStruct(&'a str),
177 /// error E0423: is a struct variant name, but this expression uses it like a function name
178 StructVariantUsedAsFunction(&'a str),
179 /// error E0424: `self` is not available in a static method
180 SelfNotAvailableInStaticMethod,
181 /// error E0425: unresolved name
182 UnresolvedName(&'a str, &'a str),
183 /// error E0426: use of undeclared label
184 UndeclaredLabel(&'a str),
185 /// error E0427: cannot use `ref` binding mode with ...
186 CannotUseRefBindingModeWith(&'a str),
187 /// error E0428: duplicate definition
188 DuplicateDefinition(&'a str, Name),
189 /// error E0429: `self` imports are only allowed within a { } list
190 SelfImportsOnlyAllowedWithin,
191 /// error E0430: `self` import can only appear once in the list
192 SelfImportCanOnlyAppearOnceInTheList,
193 /// error E0431: `self` import can only appear in an import list with a non-empty prefix
194 SelfImportOnlyInImportListWithNonEmptyPrefix,
195 /// error E0432: unresolved import
196 UnresolvedImport(Option<(&'a str, &'a str)>),
197 /// error E0433: failed to resolve
198 FailedToResolve(&'a str),
199 /// error E0434: can't capture dynamic environment in a fn item
200 CannotCaptureDynamicEnvironmentInFnItem,
201 /// error E0435: attempt to use a non-constant value in a constant
202 AttemptToUseNonConstantValueInConstant,
205 fn resolve_error<'b, 'a: 'b, 'tcx: 'a>(resolver: &'b Resolver<'a, 'tcx>,
206 span: syntax::codemap::Span,
207 resolution_error: ResolutionError<'b>) {
208 if !resolver.emit_errors {
211 match resolution_error {
212 ResolutionError::TypeParametersFromOuterFunction => {
213 span_err!(resolver.session,
216 "can't use type parameters from outer function; try using a local type \
219 ResolutionError::OuterTypeParameterContext => {
220 span_err!(resolver.session,
223 "cannot use an outer type parameter in this context");
225 ResolutionError::NameAlreadyUsedInTypeParameterList(name) => {
226 span_err!(resolver.session,
229 "the name `{}` is already used for a type parameter in this type parameter \
233 ResolutionError::IsNotATrait(name) => {
234 span_err!(resolver.session, span, E0404, "`{}` is not a trait", name);
236 ResolutionError::UndeclaredTraitName(name) => {
237 span_err!(resolver.session,
240 "use of undeclared trait name `{}`",
243 ResolutionError::UndeclaredAssociatedType => {
244 span_err!(resolver.session, span, E0406, "undeclared associated type");
246 ResolutionError::MethodNotMemberOfTrait(method, trait_) => {
247 span_err!(resolver.session,
250 "method `{}` is not a member of trait `{}`",
254 ResolutionError::TypeNotMemberOfTrait(type_, trait_) => {
255 span_err!(resolver.session,
258 "type `{}` is not a member of trait `{}`",
262 ResolutionError::ConstNotMemberOfTrait(const_, trait_) => {
263 span_err!(resolver.session,
266 "const `{}` is not a member of trait `{}`",
270 ResolutionError::VariableNotBoundInPattern(variable_name, pattern_number) => {
271 span_err!(resolver.session,
274 "variable `{}` from pattern #1 is not bound in pattern #{}",
278 ResolutionError::VariableBoundWithDifferentMode(variable_name, pattern_number) => {
279 span_err!(resolver.session,
282 "variable `{}` is bound with different mode in pattern #{} than in pattern \
287 ResolutionError::VariableNotBoundInParentPattern(variable_name, pattern_number) => {
288 span_err!(resolver.session,
291 "variable `{}` from pattern #{} is not bound in pattern #1",
295 ResolutionError::SelfUsedOutsideImplOrTrait => {
296 span_err!(resolver.session,
299 "use of `Self` outside of an impl or trait");
301 ResolutionError::UseOfUndeclared(kind, name) => {
302 span_err!(resolver.session,
305 "use of undeclared {} `{}`",
309 ResolutionError::DeclarationShadowsEnumVariantOrUnitLikeStruct(name) => {
310 span_err!(resolver.session,
313 "declaration of `{}` shadows an enum variant or unit-like struct in scope",
316 ResolutionError::OnlyIrrefutablePatternsAllowedHere(did, name) => {
317 span_err!(resolver.session,
320 "only irrefutable patterns allowed here");
321 resolver.session.span_note(span,
322 "there already is a constant in scope sharing the same \
323 name as this pattern");
324 if let Some(sp) = resolver.ast_map.span_if_local(did) {
325 resolver.session.span_note(sp, "constant defined here");
327 if let Some(directive) = resolver.current_module
331 let item = resolver.ast_map.expect_item(directive.value_ns.id);
332 resolver.session.span_note(item.span, "constant imported here");
335 ResolutionError::IdentifierBoundMoreThanOnceInParameterList(identifier) => {
336 span_err!(resolver.session,
339 "identifier `{}` is bound more than once in this parameter list",
342 ResolutionError::IdentifierBoundMoreThanOnceInSamePattern(identifier) => {
343 span_err!(resolver.session,
346 "identifier `{}` is bound more than once in the same pattern",
349 ResolutionError::StaticVariableReference => {
350 span_err!(resolver.session,
353 "static variables cannot be referenced in a pattern, use a `const` instead");
355 ResolutionError::NotAnEnumVariantStructOrConst(name) => {
356 span_err!(resolver.session,
359 "`{}` is not an enum variant, struct or const",
362 ResolutionError::UnresolvedEnumVariantStructOrConst(name) => {
363 span_err!(resolver.session,
366 "unresolved enum variant, struct or const `{}`",
369 ResolutionError::NotAnAssociatedConst(name) => {
370 span_err!(resolver.session,
373 "`{}` is not an associated const",
376 ResolutionError::UnresolvedAssociatedConst(name) => {
377 span_err!(resolver.session,
380 "unresolved associated const `{}`",
383 ResolutionError::DoesNotNameAStruct(name) => {
384 span_err!(resolver.session,
387 "`{}` does not name a structure",
390 ResolutionError::StructVariantUsedAsFunction(path_name) => {
391 span_err!(resolver.session,
394 "`{}` is the name of a struct or struct variant, but this expression uses \
395 it like a function name",
398 ResolutionError::SelfNotAvailableInStaticMethod => {
399 span_err!(resolver.session,
402 "`self` is not available in a static method. Maybe a `self` argument is \
405 ResolutionError::UnresolvedName(path, name) => {
406 span_err!(resolver.session,
409 "unresolved name `{}`{}",
413 ResolutionError::UndeclaredLabel(name) => {
414 span_err!(resolver.session,
417 "use of undeclared label `{}`",
420 ResolutionError::CannotUseRefBindingModeWith(descr) => {
421 span_err!(resolver.session,
424 "cannot use `ref` binding mode with {}",
427 ResolutionError::DuplicateDefinition(namespace, name) => {
428 span_err!(resolver.session,
431 "duplicate definition of {} `{}`",
435 ResolutionError::SelfImportsOnlyAllowedWithin => {
436 span_err!(resolver.session,
440 "`self` imports are only allowed within a { } list");
442 ResolutionError::SelfImportCanOnlyAppearOnceInTheList => {
443 span_err!(resolver.session,
446 "`self` import can only appear once in the list");
448 ResolutionError::SelfImportOnlyInImportListWithNonEmptyPrefix => {
449 span_err!(resolver.session,
452 "`self` import can only appear in an import list with a non-empty prefix");
454 ResolutionError::UnresolvedImport(name) => {
455 let msg = match name {
456 Some((n, p)) => format!("unresolved import `{}`{}", n, p),
457 None => "unresolved import".to_owned(),
459 span_err!(resolver.session, span, E0432, "{}", msg);
461 ResolutionError::FailedToResolve(msg) => {
462 span_err!(resolver.session, span, E0433, "failed to resolve. {}", msg);
464 ResolutionError::CannotCaptureDynamicEnvironmentInFnItem => {
465 span_err!(resolver.session,
469 "can't capture dynamic environment in a fn item; use the || { ... } \
470 closure form instead");
472 ResolutionError::AttemptToUseNonConstantValueInConstant => {
473 span_err!(resolver.session,
476 "attempt to use a non-constant value in a constant");
481 #[derive(Copy, Clone)]
484 binding_mode: BindingMode,
487 // Map from the name in a pattern to its binding mode.
488 type BindingMap = HashMap<Name, BindingInfo>;
490 #[derive(Copy, Clone, PartialEq)]
491 enum PatternBindingMode {
493 LocalIrrefutableMode,
494 ArgumentIrrefutableMode,
497 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
503 /// A NamespaceResult represents the result of resolving an import in
504 /// a particular namespace. The result is either definitely-resolved,
505 /// definitely- unresolved, or unknown.
507 enum NamespaceResult {
508 /// Means that resolve hasn't gathered enough information yet to determine
509 /// whether the name is bound in this namespace. (That is, it hasn't
510 /// resolved all `use` directives yet.)
512 /// Means that resolve has determined that the name is definitely
513 /// not bound in the namespace.
515 /// Means that resolve has determined that the name is bound in the Module
516 /// argument, and specified by the NameBinding argument.
517 BoundResult(Rc<Module>, NameBinding),
520 impl NamespaceResult {
521 fn is_unknown(&self) -> bool {
523 UnknownResult => true,
527 fn is_unbound(&self) -> bool {
529 UnboundResult => true,
535 impl<'a, 'v, 'tcx> Visitor<'v> for Resolver<'a, 'tcx> {
536 fn visit_nested_item(&mut self, item: hir::ItemId) {
537 self.visit_item(self.ast_map.expect_item(item.id))
539 fn visit_item(&mut self, item: &Item) {
540 execute_callback!(hir_map::Node::NodeItem(item), self);
541 self.resolve_item(item);
543 fn visit_arm(&mut self, arm: &Arm) {
544 self.resolve_arm(arm);
546 fn visit_block(&mut self, block: &Block) {
547 execute_callback!(hir_map::Node::NodeBlock(block), self);
548 self.resolve_block(block);
550 fn visit_expr(&mut self, expr: &Expr) {
551 execute_callback!(hir_map::Node::NodeExpr(expr), self);
552 self.resolve_expr(expr);
554 fn visit_local(&mut self, local: &Local) {
555 execute_callback!(hir_map::Node::NodeLocal(&*local.pat), self);
556 self.resolve_local(local);
558 fn visit_ty(&mut self, ty: &Ty) {
559 self.resolve_type(ty);
561 fn visit_generics(&mut self, generics: &Generics) {
562 self.resolve_generics(generics);
564 fn visit_poly_trait_ref(&mut self, tref: &hir::PolyTraitRef, m: &hir::TraitBoundModifier) {
565 match self.resolve_trait_reference(tref.trait_ref.ref_id, &tref.trait_ref.path, 0) {
566 Ok(def) => self.record_def(tref.trait_ref.ref_id, def),
568 // error already reported
569 self.record_def(tref.trait_ref.ref_id, err_path_resolution())
572 intravisit::walk_poly_trait_ref(self, tref, m);
574 fn visit_variant(&mut self,
575 variant: &hir::Variant,
577 item_id: ast::NodeId) {
578 execute_callback!(hir_map::Node::NodeVariant(variant), self);
579 if let Some(ref dis_expr) = variant.node.disr_expr {
580 // resolve the discriminator expr as a constant
581 self.with_constant_rib(|this| {
582 this.visit_expr(dis_expr);
586 // `intravisit::walk_variant` without the discriminant expression.
587 self.visit_variant_data(&variant.node.data,
593 fn visit_foreign_item(&mut self, foreign_item: &hir::ForeignItem) {
594 execute_callback!(hir_map::Node::NodeForeignItem(foreign_item), self);
595 let type_parameters = match foreign_item.node {
596 ForeignItemFn(_, ref generics) => {
597 HasTypeParameters(generics, FnSpace, ItemRibKind)
599 ForeignItemStatic(..) => NoTypeParameters,
601 self.with_type_parameter_rib(type_parameters, |this| {
602 intravisit::walk_foreign_item(this, foreign_item);
605 fn visit_fn(&mut self,
606 function_kind: FnKind<'v>,
607 declaration: &'v FnDecl,
611 let rib_kind = match function_kind {
612 FnKind::ItemFn(_, generics, _, _, _, _) => {
613 self.visit_generics(generics);
616 FnKind::Method(_, sig, _) => {
617 self.visit_generics(&sig.generics);
618 self.visit_explicit_self(&sig.explicit_self);
621 FnKind::Closure => ClosureRibKind(node_id),
623 self.resolve_function(rib_kind, declaration, block);
627 type ErrorMessage = Option<(Span, String)>;
629 enum ResolveResult<T> {
630 Failed(ErrorMessage), // Failed to resolve the name, optional helpful error message.
631 Indeterminate, // Couldn't determine due to unresolved globs.
632 Success(T), // Successfully resolved the import.
635 impl<T> ResolveResult<T> {
636 fn success(&self) -> bool {
644 enum FallbackSuggestion {
649 StaticMethod(String),
653 #[derive(Copy, Clone)]
654 enum TypeParameters<'a> {
656 HasTypeParameters(// Type parameters.
659 // Identifies the things that these parameters
660 // were declared on (type, fn, etc)
663 // The kind of the rib used for type parameters.
667 // The rib kind controls the translation of local
668 // definitions (`DefLocal`) to upvars (`DefUpvar`).
669 #[derive(Copy, Clone, Debug)]
671 // No translation needs to be applied.
674 // We passed through a closure scope at the given node ID.
675 // Translate upvars as appropriate.
676 ClosureRibKind(NodeId /* func id */),
678 // We passed through an impl or trait and are now in one of its
679 // methods. Allow references to ty params that impl or trait
680 // binds. Disallow any other upvars (including other ty params that are
684 // We passed through an item scope. Disallow upvars.
687 // We're in a constant item. Can't refer to dynamic stuff.
691 #[derive(Copy, Clone)]
692 enum UseLexicalScopeFlag {
697 enum ModulePrefixResult {
699 PrefixFound(Rc<Module>, usize),
702 #[derive(Copy, Clone)]
703 enum AssocItemResolveResult {
704 /// Syntax such as `<T>::item`, which can't be resolved until type
707 /// We should have been able to resolve the associated item.
708 ResolveAttempt(Option<PathResolution>),
711 #[derive(Copy, Clone, PartialEq)]
712 enum NameSearchType {
713 /// We're doing a name search in order to resolve a `use` directive.
716 /// We're doing a name search in order to resolve a path type, a path
717 /// expression, or a path pattern.
721 #[derive(Copy, Clone)]
722 enum BareIdentifierPatternResolution {
723 FoundStructOrEnumVariant(Def, LastPrivate),
724 FoundConst(Def, LastPrivate, Name),
725 BareIdentifierPatternUnresolved,
731 bindings: HashMap<Name, DefLike>,
736 fn new(kind: RibKind) -> Rib {
738 bindings: HashMap::new(),
744 /// A definition along with the index of the rib it was found on
746 ribs: Option<(Namespace, usize)>,
751 fn from_def(def: Def) -> Self {
759 /// The link from a module up to its nearest parent node.
760 #[derive(Clone,Debug)]
763 ModuleParentLink(Weak<Module>, Name),
764 BlockParentLink(Weak<Module>, NodeId),
767 /// One node in the tree of modules.
769 parent_link: ParentLink,
770 def: Cell<Option<Def>>,
773 children: RefCell<HashMap<Name, NameBindings>>,
774 imports: RefCell<Vec<ImportDirective>>,
776 // The external module children of this node that were declared with
778 external_module_children: RefCell<HashMap<Name, Rc<Module>>>,
780 // The anonymous children of this node. Anonymous children are pseudo-
781 // modules that are implicitly created around items contained within
784 // For example, if we have this:
792 // There will be an anonymous module created around `g` with the ID of the
793 // entry block for `f`.
794 anonymous_children: RefCell<NodeMap<Rc<Module>>>,
796 // The status of resolving each import in this module.
797 import_resolutions: RefCell<HashMap<Name, ImportResolutionPerNamespace>>,
799 // The number of unresolved globs that this module exports.
800 glob_count: Cell<usize>,
802 // The number of unresolved pub imports (both regular and globs) in this module
803 pub_count: Cell<usize>,
805 // The number of unresolved pub glob imports in this module
806 pub_glob_count: Cell<usize>,
808 // The index of the import we're resolving.
809 resolved_import_count: Cell<usize>,
811 // Whether this module is populated. If not populated, any attempt to
812 // access the children must be preceded with a
813 // `populate_module_if_necessary` call.
814 populated: Cell<bool>,
818 fn new(parent_link: ParentLink,
824 parent_link: parent_link,
826 is_public: is_public,
827 children: RefCell::new(HashMap::new()),
828 imports: RefCell::new(Vec::new()),
829 external_module_children: RefCell::new(HashMap::new()),
830 anonymous_children: RefCell::new(NodeMap()),
831 import_resolutions: RefCell::new(HashMap::new()),
832 glob_count: Cell::new(0),
833 pub_count: Cell::new(0),
834 pub_glob_count: Cell::new(0),
835 resolved_import_count: Cell::new(0),
836 populated: Cell::new(!external),
840 fn def_id(&self) -> Option<DefId> {
841 self.def.get().as_ref().map(Def::def_id)
844 fn is_normal(&self) -> bool {
845 match self.def.get() {
846 Some(DefMod(_)) | Some(DefForeignMod(_)) => true,
851 fn is_trait(&self) -> bool {
852 match self.def.get() {
853 Some(DefTrait(_)) => true,
858 fn all_imports_resolved(&self) -> bool {
859 if self.imports.borrow_state() == ::std::cell::BorrowState::Writing {
860 // it is currently being resolved ! so nope
863 self.imports.borrow().len() == self.resolved_import_count.get()
869 pub fn inc_glob_count(&self) {
870 self.glob_count.set(self.glob_count.get() + 1);
872 pub fn dec_glob_count(&self) {
873 assert!(self.glob_count.get() > 0);
874 self.glob_count.set(self.glob_count.get() - 1);
876 pub fn inc_pub_count(&self) {
877 self.pub_count.set(self.pub_count.get() + 1);
879 pub fn dec_pub_count(&self) {
880 assert!(self.pub_count.get() > 0);
881 self.pub_count.set(self.pub_count.get() - 1);
883 pub fn inc_pub_glob_count(&self) {
884 self.pub_glob_count.set(self.pub_glob_count.get() + 1);
886 pub fn dec_pub_glob_count(&self) {
887 assert!(self.pub_glob_count.get() > 0);
888 self.pub_glob_count.set(self.pub_glob_count.get() - 1);
892 impl fmt::Debug for Module {
893 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
907 flags DefModifiers: u8 {
908 const PUBLIC = 1 << 0,
909 const IMPORTABLE = 1 << 1,
913 // Records a possibly-private value, type, or module definition.
916 modifiers: DefModifiers, // see note in ImportResolutionPerNamespace about how to use this
917 def_or_module: DefOrModule,
928 fn create_from_module(module: Rc<Module>, span: Option<Span>) -> Self {
929 let modifiers = if module.is_public {
932 DefModifiers::empty()
933 } | DefModifiers::IMPORTABLE;
935 NsDef { modifiers: modifiers, def_or_module: DefOrModule::Module(module), span: span }
938 fn create_from_def(def: Def, modifiers: DefModifiers, span: Option<Span>) -> Self {
939 NsDef { modifiers: modifiers, def_or_module: DefOrModule::Def(def), span: span }
942 fn module(&self) -> Option<Rc<Module>> {
943 match self.def_or_module {
944 DefOrModule::Module(ref module) => Some(module.clone()),
945 DefOrModule::Def(_) => None,
949 fn def(&self) -> Option<Def> {
950 match self.def_or_module {
951 DefOrModule::Def(def) => Some(def),
952 DefOrModule::Module(ref module) => module.def.get(),
957 // Records at most one definition that a name in a namespace is bound to
958 #[derive(Clone,Debug)]
959 pub struct NameBinding(Rc<RefCell<Option<NsDef>>>);
963 NameBinding(Rc::new(RefCell::new(None)))
966 fn create_from_module(module: Rc<Module>) -> Self {
967 NameBinding(Rc::new(RefCell::new(Some(NsDef::create_from_module(module, None)))))
970 fn set(&self, ns_def: NsDef) {
971 *self.0.borrow_mut() = Some(ns_def);
974 fn set_modifiers(&self, modifiers: DefModifiers) {
975 if let Some(ref mut ns_def) = *self.0.borrow_mut() {
976 ns_def.modifiers = modifiers
980 fn borrow(&self) -> ::std::cell::Ref<Option<NsDef>> {
984 // Lifted versions of the NsDef methods and fields
985 fn def(&self) -> Option<Def> {
986 self.borrow().as_ref().and_then(NsDef::def)
988 fn module(&self) -> Option<Rc<Module>> {
989 self.borrow().as_ref().and_then(NsDef::module)
991 fn span(&self) -> Option<Span> {
992 self.borrow().as_ref().and_then(|def| def.span)
994 fn modifiers(&self) -> Option<DefModifiers> {
995 self.borrow().as_ref().and_then(|def| Some(def.modifiers))
998 fn defined(&self) -> bool {
999 self.borrow().is_some()
1002 fn defined_with(&self, modifiers: DefModifiers) -> bool {
1003 self.modifiers().map(|m| m.contains(modifiers)).unwrap_or(false)
1006 fn is_public(&self) -> bool {
1007 self.defined_with(DefModifiers::PUBLIC)
1010 fn def_and_lp(&self) -> (Def, LastPrivate) {
1011 let def = self.def().unwrap();
1012 (def, LastMod(if self.is_public() { AllPublic } else { DependsOn(def.def_id()) }))
1016 // Records the definitions (at most one for each namespace) that a name is
1018 #[derive(Clone,Debug)]
1019 pub struct NameBindings {
1020 type_ns: NameBinding, // < Meaning in type namespace.
1021 value_ns: NameBinding, // < Meaning in value namespace.
1024 impl ::std::ops::Index<Namespace> for NameBindings {
1025 type Output = NameBinding;
1026 fn index(&self, namespace: Namespace) -> &NameBinding {
1027 match namespace { TypeNS => &self.type_ns, ValueNS => &self.value_ns }
1032 fn new() -> NameBindings {
1034 type_ns: NameBinding::new(),
1035 value_ns: NameBinding::new(),
1039 /// Creates a new module in this set of name bindings.
1040 fn define_module(&self, module: Rc<Module>, sp: Span) {
1041 self.type_ns.set(NsDef::create_from_module(module, Some(sp)));
1044 /// Records a type definition.
1045 fn define_type(&self, def: Def, sp: Span, modifiers: DefModifiers) {
1046 debug!("defining type for def {:?} with modifiers {:?}", def, modifiers);
1047 self.type_ns.set(NsDef::create_from_def(def, modifiers, Some(sp)));
1050 /// Records a value definition.
1051 fn define_value(&self, def: Def, sp: Span, modifiers: DefModifiers) {
1052 debug!("defining value for def {:?} with modifiers {:?}", def, modifiers);
1053 self.value_ns.set(NsDef::create_from_def(def, modifiers, Some(sp)));
1057 /// Interns the names of the primitive types.
1058 struct PrimitiveTypeTable {
1059 primitive_types: HashMap<Name, PrimTy>,
1062 impl PrimitiveTypeTable {
1063 fn new() -> PrimitiveTypeTable {
1064 let mut table = PrimitiveTypeTable { primitive_types: HashMap::new() };
1066 table.intern("bool", TyBool);
1067 table.intern("char", TyChar);
1068 table.intern("f32", TyFloat(TyF32));
1069 table.intern("f64", TyFloat(TyF64));
1070 table.intern("isize", TyInt(TyIs));
1071 table.intern("i8", TyInt(TyI8));
1072 table.intern("i16", TyInt(TyI16));
1073 table.intern("i32", TyInt(TyI32));
1074 table.intern("i64", TyInt(TyI64));
1075 table.intern("str", TyStr);
1076 table.intern("usize", TyUint(TyUs));
1077 table.intern("u8", TyUint(TyU8));
1078 table.intern("u16", TyUint(TyU16));
1079 table.intern("u32", TyUint(TyU32));
1080 table.intern("u64", TyUint(TyU64));
1085 fn intern(&mut self, string: &str, primitive_type: PrimTy) {
1086 self.primitive_types.insert(token::intern(string), primitive_type);
1090 /// The main resolver class.
1091 pub struct Resolver<'a, 'tcx: 'a> {
1092 session: &'a Session,
1094 ast_map: &'a hir_map::Map<'tcx>,
1096 graph_root: Rc<Module>,
1098 trait_item_map: FnvHashMap<(Name, DefId), DefId>,
1100 structs: FnvHashMap<DefId, Vec<Name>>,
1102 // The number of imports that are currently unresolved.
1103 unresolved_imports: usize,
1105 // The module that represents the current item scope.
1106 current_module: Rc<Module>,
1108 // The current set of local scopes, for values.
1109 // FIXME #4948: Reuse ribs to avoid allocation.
1110 value_ribs: Vec<Rib>,
1112 // The current set of local scopes, for types.
1113 type_ribs: Vec<Rib>,
1115 // The current set of local scopes, for labels.
1116 label_ribs: Vec<Rib>,
1118 // The trait that the current context can refer to.
1119 current_trait_ref: Option<(DefId, TraitRef)>,
1121 // The current self type if inside an impl (used for better errors).
1122 current_self_type: Option<Ty>,
1124 // The idents for the primitive types.
1125 primitive_type_table: PrimitiveTypeTable,
1127 def_map: RefCell<DefMap>,
1128 freevars: FreevarMap,
1129 freevars_seen: NodeMap<NodeMap<usize>>,
1130 export_map: ExportMap,
1131 trait_map: TraitMap,
1132 external_exports: ExternalExports,
1134 // Whether or not to print error messages. Can be set to true
1135 // when getting additional info for error message suggestions,
1136 // so as to avoid printing duplicate errors
1139 make_glob_map: bool,
1140 // Maps imports to the names of items actually imported (this actually maps
1141 // all imports, but only glob imports are actually interesting).
1144 used_imports: HashSet<(NodeId, Namespace)>,
1145 used_crates: HashSet<CrateNum>,
1147 // Callback function for intercepting walks
1148 callback: Option<Box<Fn(hir_map::Node, &mut bool) -> bool>>,
1149 // The intention is that the callback modifies this flag.
1150 // Once set, the resolver falls out of the walk, preserving the ribs.
1154 #[derive(PartialEq)]
1155 enum FallbackChecks {
1157 OnlyTraitAndStatics,
1160 impl<'a, 'tcx> Resolver<'a, 'tcx> {
1161 fn new(session: &'a Session,
1162 ast_map: &'a hir_map::Map<'tcx>,
1163 make_glob_map: MakeGlobMap)
1164 -> Resolver<'a, 'tcx> {
1165 let root_def_id = ast_map.local_def_id(CRATE_NODE_ID);
1166 let graph_root = Module::new(NoParentLink, Some(DefMod(root_def_id)), false, true);
1173 // The outermost module has def ID 0; this is not reflected in the
1175 graph_root: graph_root.clone(),
1177 trait_item_map: FnvHashMap(),
1178 structs: FnvHashMap(),
1180 unresolved_imports: 0,
1182 current_module: graph_root,
1183 value_ribs: Vec::new(),
1184 type_ribs: Vec::new(),
1185 label_ribs: Vec::new(),
1187 current_trait_ref: None,
1188 current_self_type: None,
1190 primitive_type_table: PrimitiveTypeTable::new(),
1192 def_map: RefCell::new(NodeMap()),
1193 freevars: NodeMap(),
1194 freevars_seen: NodeMap(),
1195 export_map: NodeMap(),
1196 trait_map: NodeMap(),
1197 used_imports: HashSet::new(),
1198 used_crates: HashSet::new(),
1199 external_exports: DefIdSet(),
1202 make_glob_map: make_glob_map == MakeGlobMap::Yes,
1203 glob_map: HashMap::new(),
1211 fn record_import_use(&mut self, import_id: NodeId, name: Name) {
1212 if !self.make_glob_map {
1215 if self.glob_map.contains_key(&import_id) {
1216 self.glob_map.get_mut(&import_id).unwrap().insert(name);
1220 let mut new_set = HashSet::new();
1221 new_set.insert(name);
1222 self.glob_map.insert(import_id, new_set);
1225 fn get_trait_name(&self, did: DefId) -> Name {
1226 if let Some(node_id) = self.ast_map.as_local_node_id(did) {
1227 self.ast_map.expect_item(node_id).name
1229 self.session.cstore.item_name(did)
1233 /// Checks that the names of external crates don't collide with other
1234 /// external crates.
1235 fn check_for_conflicts_between_external_crates(&self,
1239 if module.external_module_children.borrow().contains_key(&name) {
1240 span_err!(self.session,
1243 "an external crate named `{}` has already been imported into this module",
1248 /// Checks that the names of items don't collide with external crates.
1249 fn check_for_conflicts_between_external_crates_and_items(&self,
1253 if module.external_module_children.borrow().contains_key(&name) {
1254 span_err!(self.session,
1257 "the name `{}` conflicts with an external crate that has been imported \
1263 /// Resolves the given module path from the given root `module_`.
1264 fn resolve_module_path_from_root(&mut self,
1265 module_: Rc<Module>,
1266 module_path: &[Name],
1269 name_search_type: NameSearchType,
1271 -> ResolveResult<(Rc<Module>, LastPrivate)> {
1272 fn search_parent_externals(needle: Name, module: &Rc<Module>) -> Option<Rc<Module>> {
1273 match module.external_module_children.borrow().get(&needle) {
1274 Some(_) => Some(module.clone()),
1275 None => match module.parent_link {
1276 ModuleParentLink(ref parent, _) => {
1277 search_parent_externals(needle, &parent.upgrade().unwrap())
1284 let mut search_module = module_;
1285 let mut index = index;
1286 let module_path_len = module_path.len();
1287 let mut closest_private = lp;
1289 // Resolve the module part of the path. This does not involve looking
1290 // upward though scope chains; we simply resolve names directly in
1291 // modules as we go.
1292 while index < module_path_len {
1293 let name = module_path[index];
1294 match self.resolve_name_in_module(search_module.clone(),
1300 let segment_name = name.as_str();
1301 let module_name = module_to_string(&*search_module);
1302 let mut span = span;
1303 let msg = if "???" == &module_name[..] {
1304 span.hi = span.lo + Pos::from_usize(segment_name.len());
1306 match search_parent_externals(name, &self.current_module) {
1308 let path_str = names_to_string(module_path);
1309 let target_mod_str = module_to_string(&*module);
1310 let current_mod_str = module_to_string(&*self.current_module);
1312 let prefix = if target_mod_str == current_mod_str {
1313 "self::".to_string()
1315 format!("{}::", target_mod_str)
1318 format!("Did you mean `{}{}`?", prefix, path_str)
1320 None => format!("Maybe a missing `extern crate {}`?", segment_name),
1323 format!("Could not find `{}` in `{}`", segment_name, module_name)
1326 return Failed(Some((span, msg)));
1328 Failed(err) => return Failed(err),
1330 debug!("(resolving module path for import) module resolution is \
1333 return Indeterminate;
1335 Success((target, used_proxy)) => {
1336 // Check to see whether there are type bindings, and, if
1337 // so, whether there is a module within.
1338 if let Some(module_def) = target.binding.module() {
1339 // track extern crates for unused_extern_crate lint
1340 if let Some(did) = module_def.def_id() {
1341 self.used_crates.insert(did.krate);
1344 search_module = module_def;
1346 // Keep track of the closest private module used
1347 // when resolving this import chain.
1348 if !used_proxy && !search_module.is_public {
1349 if let Some(did) = search_module.def_id() {
1350 closest_private = LastMod(DependsOn(did));
1354 let msg = format!("Not a module `{}`", name);
1355 return Failed(Some((span, msg)));
1363 return Success((search_module, closest_private));
1366 /// Attempts to resolve the module part of an import directive or path
1367 /// rooted at the given module.
1369 /// On success, returns the resolved module, and the closest *private*
1370 /// module found to the destination when resolving this path.
1371 fn resolve_module_path(&mut self,
1372 module_: Rc<Module>,
1373 module_path: &[Name],
1374 use_lexical_scope: UseLexicalScopeFlag,
1376 name_search_type: NameSearchType)
1377 -> ResolveResult<(Rc<Module>, LastPrivate)> {
1378 let module_path_len = module_path.len();
1379 assert!(module_path_len > 0);
1381 debug!("(resolving module path for import) processing `{}` rooted at `{}`",
1382 names_to_string(module_path),
1383 module_to_string(&*module_));
1385 // Resolve the module prefix, if any.
1386 let module_prefix_result = self.resolve_module_prefix(module_.clone(), module_path);
1391 match module_prefix_result {
1393 let mpath = names_to_string(module_path);
1394 let mpath = &mpath[..];
1395 match mpath.rfind(':') {
1397 let msg = format!("Could not find `{}` in `{}`",
1398 // idx +- 1 to account for the
1399 // colons on either side
1402 return Failed(Some((span, msg)));
1405 return Failed(None);
1409 Failed(err) => return Failed(err),
1411 debug!("(resolving module path for import) indeterminate; bailing");
1412 return Indeterminate;
1414 Success(NoPrefixFound) => {
1415 // There was no prefix, so we're considering the first element
1416 // of the path. How we handle this depends on whether we were
1417 // instructed to use lexical scope or not.
1418 match use_lexical_scope {
1419 DontUseLexicalScope => {
1420 // This is a crate-relative path. We will start the
1421 // resolution process at index zero.
1422 search_module = self.graph_root.clone();
1424 last_private = LastMod(AllPublic);
1426 UseLexicalScope => {
1427 // This is not a crate-relative path. We resolve the
1428 // first component of the path in the current lexical
1429 // scope and then proceed to resolve below that.
1430 match self.resolve_module_in_lexical_scope(module_, module_path[0]) {
1431 Failed(err) => return Failed(err),
1433 debug!("(resolving module path for import) indeterminate; bailing");
1434 return Indeterminate;
1436 Success(containing_module) => {
1437 search_module = containing_module;
1439 last_private = LastMod(AllPublic);
1445 Success(PrefixFound(ref containing_module, index)) => {
1446 search_module = containing_module.clone();
1447 start_index = index;
1448 last_private = LastMod(DependsOn(containing_module.def_id()
1453 self.resolve_module_path_from_root(search_module,
1461 /// Invariant: This must only be called during main resolution, not during
1462 /// import resolution.
1463 fn resolve_item_in_lexical_scope(&mut self,
1464 module_: Rc<Module>,
1466 namespace: Namespace)
1467 -> ResolveResult<(Target, bool)> {
1468 debug!("(resolving item in lexical scope) resolving `{}` in namespace {:?} in `{}`",
1471 module_to_string(&*module_));
1473 // The current module node is handled specially. First, check for
1474 // its immediate children.
1475 build_reduced_graph::populate_module_if_necessary(self, &module_);
1477 match module_.children.borrow().get(&name) {
1478 Some(name_bindings) if name_bindings[namespace].defined() => {
1479 debug!("top name bindings succeeded");
1480 return Success((Target::new(module_.clone(),
1481 name_bindings[namespace].clone(),
1486 // Not found; continue.
1490 // Now check for its import directives. We don't have to have resolved
1491 // all its imports in the usual way; this is because chains of
1492 // adjacent import statements are processed as though they mutated the
1494 if let Some(import_resolution) = module_.import_resolutions.borrow().get(&name) {
1495 match import_resolution[namespace].target.clone() {
1497 // Not found; continue.
1498 debug!("(resolving item in lexical scope) found import resolution, but not \
1503 debug!("(resolving item in lexical scope) using import resolution");
1504 // track used imports and extern crates as well
1505 let id = import_resolution[namespace].id;
1506 self.used_imports.insert((id, namespace));
1507 self.record_import_use(id, name);
1508 if let Some(DefId{krate: kid, ..}) = target.target_module.def_id() {
1509 self.used_crates.insert(kid);
1511 return Success((target, false));
1516 // Search for external modules.
1517 if namespace == TypeNS {
1518 // FIXME (21114): In principle unclear `child` *has* to be lifted.
1519 let child = module_.external_module_children.borrow().get(&name).cloned();
1520 if let Some(module) = child {
1521 let name_binding = NameBinding::create_from_module(module);
1522 debug!("lower name bindings succeeded");
1523 return Success((Target::new(module_, name_binding, Shadowable::Never),
1528 // Finally, proceed up the scope chain looking for parent modules.
1529 let mut search_module = module_;
1531 // Go to the next parent.
1532 match search_module.parent_link.clone() {
1534 // No more parents. This module was unresolved.
1535 debug!("(resolving item in lexical scope) unresolved module");
1536 return Failed(None);
1538 ModuleParentLink(parent_module_node, _) => {
1539 if search_module.is_normal() {
1540 // We stop the search here.
1541 debug!("(resolving item in lexical scope) unresolved module: not \
1542 searching through module parents");
1543 return Failed(None);
1545 search_module = parent_module_node.upgrade().unwrap();
1548 BlockParentLink(ref parent_module_node, _) => {
1549 search_module = parent_module_node.upgrade().unwrap();
1553 // Resolve the name in the parent module.
1554 match self.resolve_name_in_module(search_module.clone(),
1559 Failed(Some((span, msg))) => {
1560 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
1562 Failed(None) => (), // Continue up the search chain.
1564 // We couldn't see through the higher scope because of an
1565 // unresolved import higher up. Bail.
1567 debug!("(resolving item in lexical scope) indeterminate higher scope; bailing");
1568 return Indeterminate;
1570 Success((target, used_reexport)) => {
1571 // We found the module.
1572 debug!("(resolving item in lexical scope) found name in module, done");
1573 return Success((target, used_reexport));
1579 /// Resolves a module name in the current lexical scope.
1580 fn resolve_module_in_lexical_scope(&mut self,
1581 module_: Rc<Module>,
1583 -> ResolveResult<Rc<Module>> {
1584 // If this module is an anonymous module, resolve the item in the
1585 // lexical scope. Otherwise, resolve the item from the crate root.
1586 let resolve_result = self.resolve_item_in_lexical_scope(module_, name, TypeNS);
1587 match resolve_result {
1588 Success((target, _)) => {
1589 if let Some(module_def) = target.binding.module() {
1590 return Success(module_def)
1592 debug!("!!! (resolving module in lexical scope) module \
1593 wasn't actually a module!");
1594 return Failed(None);
1598 debug!("(resolving module in lexical scope) indeterminate; bailing");
1599 return Indeterminate;
1602 debug!("(resolving module in lexical scope) failed to resolve");
1608 /// Returns the nearest normal module parent of the given module.
1609 fn get_nearest_normal_module_parent(&mut self, module_: Rc<Module>) -> Option<Rc<Module>> {
1610 let mut module_ = module_;
1612 match module_.parent_link.clone() {
1613 NoParentLink => return None,
1614 ModuleParentLink(new_module, _) |
1615 BlockParentLink(new_module, _) => {
1616 let new_module = new_module.upgrade().unwrap();
1617 if new_module.is_normal() {
1618 return Some(new_module);
1620 module_ = new_module;
1626 /// Returns the nearest normal module parent of the given module, or the
1627 /// module itself if it is a normal module.
1628 fn get_nearest_normal_module_parent_or_self(&mut self, module_: Rc<Module>) -> Rc<Module> {
1629 if module_.is_normal() {
1632 match self.get_nearest_normal_module_parent(module_.clone()) {
1634 Some(new_module) => new_module,
1638 /// Resolves a "module prefix". A module prefix is one or both of (a) `self::`;
1639 /// (b) some chain of `super::`.
1640 /// grammar: (SELF MOD_SEP ) ? (SUPER MOD_SEP) *
1641 fn resolve_module_prefix(&mut self,
1642 module_: Rc<Module>,
1643 module_path: &[Name])
1644 -> ResolveResult<ModulePrefixResult> {
1645 // Start at the current module if we see `self` or `super`, or at the
1646 // top of the crate otherwise.
1647 let mut i = match &*module_path[0].as_str() {
1650 _ => return Success(NoPrefixFound),
1652 let mut containing_module = self.get_nearest_normal_module_parent_or_self(module_);
1654 // Now loop through all the `super`s we find.
1655 while i < module_path.len() && "super" == module_path[i].as_str() {
1656 debug!("(resolving module prefix) resolving `super` at {}",
1657 module_to_string(&*containing_module));
1658 match self.get_nearest_normal_module_parent(containing_module) {
1659 None => return Failed(None),
1660 Some(new_module) => {
1661 containing_module = new_module;
1667 debug!("(resolving module prefix) finished resolving prefix at {}",
1668 module_to_string(&*containing_module));
1670 return Success(PrefixFound(containing_module, i));
1673 /// Attempts to resolve the supplied name in the given module for the
1674 /// given namespace. If successful, returns the target corresponding to
1677 /// The boolean returned on success is an indicator of whether this lookup
1678 /// passed through a public re-export proxy.
1679 fn resolve_name_in_module(&mut self,
1680 module_: Rc<Module>,
1682 namespace: Namespace,
1683 name_search_type: NameSearchType,
1684 allow_private_imports: bool)
1685 -> ResolveResult<(Target, bool)> {
1686 debug!("(resolving name in module) resolving `{}` in `{}`",
1688 module_to_string(&*module_));
1690 // First, check the direct children of the module.
1691 build_reduced_graph::populate_module_if_necessary(self, &module_);
1693 match module_.children.borrow().get(&name) {
1694 Some(name_bindings) if name_bindings[namespace].defined() => {
1695 debug!("(resolving name in module) found node as child");
1696 return Success((Target::new(module_.clone(),
1697 name_bindings[namespace].clone(),
1706 // Next, check the module's imports if necessary.
1708 // If this is a search of all imports, we should be done with glob
1709 // resolution at this point.
1710 if name_search_type == PathSearch {
1711 assert_eq!(module_.glob_count.get(), 0);
1714 // Check the list of resolved imports.
1715 match module_.import_resolutions.borrow().get(&name) {
1716 Some(import_resolution) if allow_private_imports ||
1717 import_resolution[namespace].is_public => {
1719 if import_resolution[namespace].is_public &&
1720 import_resolution.outstanding_references != 0 {
1721 debug!("(resolving name in module) import unresolved; bailing out");
1722 return Indeterminate;
1724 match import_resolution[namespace].target.clone() {
1726 debug!("(resolving name in module) name found, but not in namespace {:?}",
1730 debug!("(resolving name in module) resolved to import");
1731 // track used imports and extern crates as well
1732 let id = import_resolution[namespace].id;
1733 self.used_imports.insert((id, namespace));
1734 self.record_import_use(id, name);
1735 if let Some(DefId{krate: kid, ..}) = target.target_module.def_id() {
1736 self.used_crates.insert(kid);
1738 return Success((target, true));
1742 Some(..) | None => {} // Continue.
1745 // Finally, search through external children.
1746 if namespace == TypeNS {
1747 // FIXME (21114): In principle unclear `child` *has* to be lifted.
1748 let child = module_.external_module_children.borrow().get(&name).cloned();
1749 if let Some(module) = child {
1750 let name_binding = NameBinding::create_from_module(module);
1751 return Success((Target::new(module_, name_binding, Shadowable::Never),
1756 // We're out of luck.
1757 debug!("(resolving name in module) failed to resolve `{}`", name);
1758 return Failed(None);
1761 fn report_unresolved_imports(&mut self, module_: Rc<Module>) {
1762 let index = module_.resolved_import_count.get();
1763 let imports = module_.imports.borrow();
1764 let import_count = imports.len();
1765 if index != import_count {
1767 (*imports)[index].span,
1768 ResolutionError::UnresolvedImport(None));
1771 // Descend into children and anonymous children.
1772 build_reduced_graph::populate_module_if_necessary(self, &module_);
1774 for (_, child_node) in module_.children.borrow().iter() {
1775 match child_node.type_ns.module() {
1779 Some(child_module) => {
1780 self.report_unresolved_imports(child_module);
1785 for (_, module_) in module_.anonymous_children.borrow().iter() {
1786 self.report_unresolved_imports(module_.clone());
1792 // We maintain a list of value ribs and type ribs.
1794 // Simultaneously, we keep track of the current position in the module
1795 // graph in the `current_module` pointer. When we go to resolve a name in
1796 // the value or type namespaces, we first look through all the ribs and
1797 // then query the module graph. When we resolve a name in the module
1798 // namespace, we can skip all the ribs (since nested modules are not
1799 // allowed within blocks in Rust) and jump straight to the current module
1802 // Named implementations are handled separately. When we find a method
1803 // call, we consult the module node to find all of the implementations in
1804 // scope. This information is lazily cached in the module node. We then
1805 // generate a fake "implementation scope" containing all the
1806 // implementations thus found, for compatibility with old resolve pass.
1808 fn with_scope<F>(&mut self, name: Option<Name>, f: F)
1809 where F: FnOnce(&mut Resolver)
1811 let orig_module = self.current_module.clone();
1813 // Move down in the graph.
1819 build_reduced_graph::populate_module_if_necessary(self, &orig_module);
1821 match orig_module.children.borrow().get(&name) {
1823 debug!("!!! (with scope) didn't find `{}` in `{}`",
1825 module_to_string(&*orig_module));
1827 Some(name_bindings) => {
1828 match name_bindings.type_ns.module() {
1830 debug!("!!! (with scope) didn't find module for `{}` in `{}`",
1832 module_to_string(&*orig_module));
1835 self.current_module = module_;
1845 self.current_module = orig_module;
1848 /// Searches the current set of local scopes for labels.
1849 /// Stops after meeting a closure.
1850 fn search_label(&self, name: Name) -> Option<DefLike> {
1851 for rib in self.label_ribs.iter().rev() {
1857 // Do not resolve labels across function boundary
1861 let result = rib.bindings.get(&name).cloned();
1862 if result.is_some() {
1869 fn resolve_crate(&mut self, krate: &hir::Crate) {
1870 debug!("(resolving crate) starting");
1872 intravisit::walk_crate(self, krate);
1875 fn check_if_primitive_type_name(&self, name: Name, span: Span) {
1876 if let Some(_) = self.primitive_type_table.primitive_types.get(&name) {
1877 span_err!(self.session,
1880 "user-defined types or type parameters cannot shadow the primitive types");
1884 fn resolve_item(&mut self, item: &Item) {
1885 let name = item.name;
1887 debug!("(resolving item) resolving {}", name);
1890 ItemEnum(_, ref generics) |
1891 ItemTy(_, ref generics) |
1892 ItemStruct(_, ref generics) => {
1893 self.check_if_primitive_type_name(name, item.span);
1895 self.with_type_parameter_rib(HasTypeParameters(generics, TypeSpace, ItemRibKind),
1896 |this| intravisit::walk_item(this, item));
1898 ItemFn(_, _, _, _, ref generics, _) => {
1899 self.with_type_parameter_rib(HasTypeParameters(generics, FnSpace, ItemRibKind),
1900 |this| intravisit::walk_item(this, item));
1903 ItemDefaultImpl(_, ref trait_ref) => {
1904 self.with_optional_trait_ref(Some(trait_ref), |_, _| {});
1906 ItemImpl(_, _, ref generics, ref opt_trait_ref, ref self_type, ref impl_items) => {
1907 self.resolve_implementation(generics,
1914 ItemTrait(_, ref generics, ref bounds, ref trait_items) => {
1915 self.check_if_primitive_type_name(name, item.span);
1917 // Create a new rib for the trait-wide type parameters.
1918 self.with_type_parameter_rib(HasTypeParameters(generics,
1922 let local_def_id = this.ast_map.local_def_id(item.id);
1923 this.with_self_rib(DefSelfTy(Some(local_def_id), None), |this| {
1924 this.visit_generics(generics);
1925 walk_list!(this, visit_ty_param_bound, bounds);
1927 for trait_item in trait_items {
1928 match trait_item.node {
1929 hir::ConstTraitItem(_, ref default) => {
1930 // Only impose the restrictions of
1931 // ConstRibKind if there's an actual constant
1932 // expression in a provided default.
1933 if default.is_some() {
1934 this.with_constant_rib(|this| {
1935 intravisit::walk_trait_item(this, trait_item)
1938 intravisit::walk_trait_item(this, trait_item)
1941 hir::MethodTraitItem(ref sig, _) => {
1942 let type_parameters =
1943 HasTypeParameters(&sig.generics,
1946 this.with_type_parameter_rib(type_parameters, |this| {
1947 intravisit::walk_trait_item(this, trait_item)
1950 hir::TypeTraitItem(..) => {
1951 this.check_if_primitive_type_name(trait_item.name,
1953 this.with_type_parameter_rib(NoTypeParameters, |this| {
1954 intravisit::walk_trait_item(this, trait_item)
1963 ItemMod(_) | ItemForeignMod(_) => {
1964 self.with_scope(Some(name), |this| {
1965 intravisit::walk_item(this, item);
1969 ItemConst(..) | ItemStatic(..) => {
1970 self.with_constant_rib(|this| {
1971 intravisit::walk_item(this, item);
1975 ItemUse(ref view_path) => {
1976 // check for imports shadowing primitive types
1977 let check_rename = |this: &Self, id, name| {
1978 match this.def_map.borrow().get(&id).map(|d| d.full_def()) {
1979 Some(DefTy(..)) | Some(DefStruct(..)) | Some(DefTrait(..)) | None => {
1980 this.check_if_primitive_type_name(name, item.span);
1986 match view_path.node {
1987 hir::ViewPathSimple(name, _) => {
1988 check_rename(self, item.id, name);
1990 hir::ViewPathList(ref prefix, ref items) => {
1992 if let Some(name) = item.node.rename() {
1993 check_rename(self, item.node.id(), name);
1997 // Resolve prefix of an import with empty braces (issue #28388)
1998 if items.is_empty() && !prefix.segments.is_empty() {
1999 match self.resolve_crate_relative_path(prefix.span,
2003 self.record_def(item.id, PathResolution::new(def, lp, 0)),
2007 ResolutionError::FailedToResolve(
2008 &path_names_to_string(prefix, 0)));
2009 self.record_def(item.id, err_path_resolution());
2018 ItemExternCrate(_) => {
2019 // do nothing, these are just around to be encoded
2024 fn with_type_parameter_rib<F>(&mut self, type_parameters: TypeParameters, f: F)
2025 where F: FnOnce(&mut Resolver)
2027 match type_parameters {
2028 HasTypeParameters(generics, space, rib_kind) => {
2029 let mut function_type_rib = Rib::new(rib_kind);
2030 let mut seen_bindings = HashSet::new();
2031 for (index, type_parameter) in generics.ty_params.iter().enumerate() {
2032 let name = type_parameter.name;
2033 debug!("with_type_parameter_rib: {}", type_parameter.id);
2035 if seen_bindings.contains(&name) {
2037 type_parameter.span,
2038 ResolutionError::NameAlreadyUsedInTypeParameterList(name));
2040 seen_bindings.insert(name);
2042 // plain insert (no renaming)
2043 function_type_rib.bindings
2045 DlDef(DefTyParam(space,
2048 .local_def_id(type_parameter.id),
2051 self.type_ribs.push(function_type_rib);
2054 NoTypeParameters => {
2061 match type_parameters {
2062 HasTypeParameters(..) => {
2064 self.type_ribs.pop();
2067 NoTypeParameters => {}
2071 fn with_label_rib<F>(&mut self, f: F)
2072 where F: FnOnce(&mut Resolver)
2074 self.label_ribs.push(Rib::new(NormalRibKind));
2077 self.label_ribs.pop();
2081 fn with_constant_rib<F>(&mut self, f: F)
2082 where F: FnOnce(&mut Resolver)
2084 self.value_ribs.push(Rib::new(ConstantItemRibKind));
2085 self.type_ribs.push(Rib::new(ConstantItemRibKind));
2088 self.type_ribs.pop();
2089 self.value_ribs.pop();
2093 fn resolve_function(&mut self, rib_kind: RibKind, declaration: &FnDecl, block: &Block) {
2094 // Create a value rib for the function.
2095 self.value_ribs.push(Rib::new(rib_kind));
2097 // Create a label rib for the function.
2098 self.label_ribs.push(Rib::new(rib_kind));
2100 // Add each argument to the rib.
2101 let mut bindings_list = HashMap::new();
2102 for argument in &declaration.inputs {
2103 self.resolve_pattern(&*argument.pat, ArgumentIrrefutableMode, &mut bindings_list);
2105 self.visit_ty(&*argument.ty);
2107 debug!("(resolving function) recorded argument");
2109 intravisit::walk_fn_ret_ty(self, &declaration.output);
2111 // Resolve the function body.
2112 self.visit_block(block);
2114 debug!("(resolving function) leaving function");
2117 self.label_ribs.pop();
2118 self.value_ribs.pop();
2122 fn resolve_trait_reference(&mut self,
2126 -> Result<PathResolution, ()> {
2127 if let Some(path_res) = self.resolve_path(id, trait_path, path_depth, TypeNS, true) {
2128 if let DefTrait(_) = path_res.base_def {
2129 debug!("(resolving trait) found trait def: {:?}", path_res);
2134 ResolutionError::IsNotATrait(&*path_names_to_string(trait_path,
2137 // If it's a typedef, give a note
2138 if let DefTy(..) = path_res.base_def {
2140 .span_note(trait_path.span, "`type` aliases cannot be used for traits");
2147 ResolutionError::UndeclaredTraitName(&*path_names_to_string(trait_path,
2153 fn resolve_generics(&mut self, generics: &Generics) {
2154 for type_parameter in generics.ty_params.iter() {
2155 self.check_if_primitive_type_name(type_parameter.name, type_parameter.span);
2157 for predicate in &generics.where_clause.predicates {
2159 &hir::WherePredicate::BoundPredicate(_) |
2160 &hir::WherePredicate::RegionPredicate(_) => {}
2161 &hir::WherePredicate::EqPredicate(ref eq_pred) => {
2162 let path_res = self.resolve_path(eq_pred.id, &eq_pred.path, 0, TypeNS, true);
2163 if let Some(PathResolution { base_def: DefTyParam(..), .. }) = path_res {
2164 self.record_def(eq_pred.id, path_res.unwrap());
2168 ResolutionError::UndeclaredAssociatedType);
2169 self.record_def(eq_pred.id, err_path_resolution());
2174 intravisit::walk_generics(self, generics);
2177 fn with_current_self_type<T, F>(&mut self, self_type: &Ty, f: F) -> T
2178 where F: FnOnce(&mut Resolver) -> T
2180 // Handle nested impls (inside fn bodies)
2181 let previous_value = replace(&mut self.current_self_type, Some(self_type.clone()));
2182 let result = f(self);
2183 self.current_self_type = previous_value;
2187 fn with_optional_trait_ref<T, F>(&mut self, opt_trait_ref: Option<&TraitRef>, f: F) -> T
2188 where F: FnOnce(&mut Resolver, Option<DefId>) -> T
2190 let mut new_val = None;
2191 let mut new_id = None;
2192 if let Some(trait_ref) = opt_trait_ref {
2193 if let Ok(path_res) = self.resolve_trait_reference(trait_ref.ref_id,
2196 assert!(path_res.depth == 0);
2197 self.record_def(trait_ref.ref_id, path_res);
2198 new_val = Some((path_res.base_def.def_id(), trait_ref.clone()));
2199 new_id = Some(path_res.base_def.def_id());
2201 self.record_def(trait_ref.ref_id, err_path_resolution());
2203 intravisit::walk_trait_ref(self, trait_ref);
2205 let original_trait_ref = replace(&mut self.current_trait_ref, new_val);
2206 let result = f(self, new_id);
2207 self.current_trait_ref = original_trait_ref;
2211 fn with_self_rib<F>(&mut self, self_def: Def, f: F)
2212 where F: FnOnce(&mut Resolver)
2214 let mut self_type_rib = Rib::new(NormalRibKind);
2216 // plain insert (no renaming, types are not currently hygienic....)
2217 let name = special_names::type_self;
2218 self_type_rib.bindings.insert(name, DlDef(self_def));
2219 self.type_ribs.push(self_type_rib);
2222 self.type_ribs.pop();
2226 fn resolve_implementation(&mut self,
2227 generics: &Generics,
2228 opt_trait_reference: &Option<TraitRef>,
2231 impl_items: &[ImplItem]) {
2232 // If applicable, create a rib for the type parameters.
2233 self.with_type_parameter_rib(HasTypeParameters(generics,
2237 // Resolve the type parameters.
2238 this.visit_generics(generics);
2240 // Resolve the trait reference, if necessary.
2241 this.with_optional_trait_ref(opt_trait_reference.as_ref(), |this, trait_id| {
2242 // Resolve the self type.
2243 this.visit_ty(self_type);
2245 this.with_self_rib(DefSelfTy(trait_id, Some((item_id, self_type.id))), |this| {
2246 this.with_current_self_type(self_type, |this| {
2247 for impl_item in impl_items {
2248 match impl_item.node {
2249 hir::ImplItemKind::Const(..) => {
2250 // If this is a trait impl, ensure the const
2252 this.check_trait_item(impl_item.name,
2254 |n, s| ResolutionError::ConstNotMemberOfTrait(n, s));
2255 this.with_constant_rib(|this| {
2256 intravisit::walk_impl_item(this, impl_item);
2259 hir::ImplItemKind::Method(ref sig, _) => {
2260 // If this is a trait impl, ensure the method
2262 this.check_trait_item(impl_item.name,
2264 |n, s| ResolutionError::MethodNotMemberOfTrait(n, s));
2266 // We also need a new scope for the method-
2267 // specific type parameters.
2268 let type_parameters =
2269 HasTypeParameters(&sig.generics,
2272 this.with_type_parameter_rib(type_parameters, |this| {
2273 intravisit::walk_impl_item(this, impl_item);
2276 hir::ImplItemKind::Type(ref ty) => {
2277 // If this is a trait impl, ensure the type
2279 this.check_trait_item(impl_item.name,
2281 |n, s| ResolutionError::TypeNotMemberOfTrait(n, s));
2293 fn check_trait_item<F>(&self, name: Name, span: Span, err: F)
2294 where F: FnOnce(Name, &str) -> ResolutionError
2296 // If there is a TraitRef in scope for an impl, then the method must be in the
2298 if let Some((did, ref trait_ref)) = self.current_trait_ref {
2299 if !self.trait_item_map.contains_key(&(name, did)) {
2300 let path_str = path_names_to_string(&trait_ref.path, 0);
2301 resolve_error(self, span, err(name, &*path_str));
2306 fn resolve_local(&mut self, local: &Local) {
2307 // Resolve the type.
2308 walk_list!(self, visit_ty, &local.ty);
2310 // Resolve the initializer.
2311 walk_list!(self, visit_expr, &local.init);
2313 // Resolve the pattern.
2314 self.resolve_pattern(&*local.pat, LocalIrrefutableMode, &mut HashMap::new());
2317 // build a map from pattern identifiers to binding-info's.
2318 // this is done hygienically. This could arise for a macro
2319 // that expands into an or-pattern where one 'x' was from the
2320 // user and one 'x' came from the macro.
2321 fn binding_mode_map(&mut self, pat: &Pat) -> BindingMap {
2322 let mut result = HashMap::new();
2323 pat_bindings(&self.def_map, pat, |binding_mode, _id, sp, path1| {
2324 let name = path1.node;
2328 binding_mode: binding_mode,
2334 // check that all of the arms in an or-pattern have exactly the
2335 // same set of bindings, with the same binding modes for each.
2336 fn check_consistent_bindings(&mut self, arm: &Arm) {
2337 if arm.pats.is_empty() {
2340 let map_0 = self.binding_mode_map(&*arm.pats[0]);
2341 for (i, p) in arm.pats.iter().enumerate() {
2342 let map_i = self.binding_mode_map(&**p);
2344 for (&key, &binding_0) in &map_0 {
2345 match map_i.get(&key) {
2349 ResolutionError::VariableNotBoundInPattern(key, i + 1));
2351 Some(binding_i) => {
2352 if binding_0.binding_mode != binding_i.binding_mode {
2355 ResolutionError::VariableBoundWithDifferentMode(key,
2362 for (&key, &binding) in &map_i {
2363 if !map_0.contains_key(&key) {
2366 ResolutionError::VariableNotBoundInParentPattern(key, i + 1));
2372 fn resolve_arm(&mut self, arm: &Arm) {
2373 self.value_ribs.push(Rib::new(NormalRibKind));
2375 let mut bindings_list = HashMap::new();
2376 for pattern in &arm.pats {
2377 self.resolve_pattern(&**pattern, RefutableMode, &mut bindings_list);
2380 // This has to happen *after* we determine which
2381 // pat_idents are variants
2382 self.check_consistent_bindings(arm);
2384 walk_list!(self, visit_expr, &arm.guard);
2385 self.visit_expr(&*arm.body);
2388 self.value_ribs.pop();
2392 fn resolve_block(&mut self, block: &Block) {
2393 debug!("(resolving block) entering block");
2394 self.value_ribs.push(Rib::new(NormalRibKind));
2396 // Move down in the graph, if there's an anonymous module rooted here.
2397 let orig_module = self.current_module.clone();
2398 match orig_module.anonymous_children.borrow().get(&block.id) {
2402 Some(anonymous_module) => {
2403 debug!("(resolving block) found anonymous module, moving down");
2404 self.current_module = anonymous_module.clone();
2408 // Check for imports appearing after non-item statements.
2409 let mut found_non_item = false;
2410 for statement in &block.stmts {
2411 if let hir::StmtDecl(ref declaration, _) = statement.node {
2412 if let hir::DeclItem(i) = declaration.node {
2413 let i = self.ast_map.expect_item(i.id);
2415 ItemExternCrate(_) | ItemUse(_) if found_non_item => {
2416 span_err!(self.session,
2419 "imports are not allowed after non-item statements");
2424 found_non_item = true
2427 found_non_item = true;
2431 // Descend into the block.
2432 intravisit::walk_block(self, block);
2436 self.current_module = orig_module;
2437 self.value_ribs.pop();
2439 debug!("(resolving block) leaving block");
2442 fn resolve_type(&mut self, ty: &Ty) {
2444 TyPath(ref maybe_qself, ref path) => {
2445 let resolution = match self.resolve_possibly_assoc_item(ty.id,
2446 maybe_qself.as_ref(),
2450 // `<T>::a::b::c` is resolved by typeck alone.
2451 TypecheckRequired => {
2452 // Resolve embedded types.
2453 intravisit::walk_ty(self, ty);
2456 ResolveAttempt(resolution) => resolution,
2459 // This is a path in the type namespace. Walk through scopes
2463 // Write the result into the def map.
2464 debug!("(resolving type) writing resolution for `{}` (id {}) = {:?}",
2465 path_names_to_string(path, 0),
2468 self.record_def(ty.id, def);
2471 self.record_def(ty.id, err_path_resolution());
2473 // Keep reporting some errors even if they're ignored above.
2474 self.resolve_path(ty.id, path, 0, TypeNS, true);
2476 let kind = if maybe_qself.is_some() {
2482 let self_type_name = special_idents::type_self.name;
2483 let is_invalid_self_type_name = path.segments.len() > 0 &&
2484 maybe_qself.is_none() &&
2485 path.segments[0].identifier.name ==
2487 if is_invalid_self_type_name {
2490 ResolutionError::SelfUsedOutsideImplOrTrait);
2494 ResolutionError::UseOfUndeclared(
2496 &*path_names_to_string(path,
2505 // Resolve embedded types.
2506 intravisit::walk_ty(self, ty);
2509 fn resolve_pattern(&mut self,
2511 mode: PatternBindingMode,
2512 // Maps idents to the node ID for the (outermost)
2513 // pattern that binds them
2514 bindings_list: &mut HashMap<Name, NodeId>) {
2515 let pat_id = pattern.id;
2516 walk_pat(pattern, |pattern| {
2517 match pattern.node {
2518 PatIdent(binding_mode, ref path1, ref at_rhs) => {
2519 // The meaning of PatIdent with no type parameters
2520 // depends on whether an enum variant or unit-like struct
2521 // with that name is in scope. The probing lookup has to
2522 // be careful not to emit spurious errors. Only matching
2523 // patterns (match) can match nullary variants or
2524 // unit-like structs. For binding patterns (let
2525 // and the LHS of @-patterns), matching such a value is
2526 // simply disallowed (since it's rarely what you want).
2527 let const_ok = mode == RefutableMode && at_rhs.is_none();
2529 let ident = path1.node;
2530 let renamed = ident.name;
2532 match self.resolve_bare_identifier_pattern(ident.unhygienic_name,
2534 FoundStructOrEnumVariant(def, lp) if const_ok => {
2535 debug!("(resolving pattern) resolving `{}` to struct or enum variant",
2538 self.enforce_default_binding_mode(pattern,
2541 self.record_def(pattern.id,
2548 FoundStructOrEnumVariant(..) => {
2552 ResolutionError::DeclarationShadowsEnumVariantOrUnitLikeStruct(
2555 self.record_def(pattern.id, err_path_resolution());
2557 FoundConst(def, lp, _) if const_ok => {
2558 debug!("(resolving pattern) resolving `{}` to constant", renamed);
2560 self.enforce_default_binding_mode(pattern, binding_mode, "a constant");
2561 self.record_def(pattern.id,
2568 FoundConst(def, _, name) => {
2572 ResolutionError::OnlyIrrefutablePatternsAllowedHere(def.def_id(),
2575 self.record_def(pattern.id, err_path_resolution());
2577 BareIdentifierPatternUnresolved => {
2578 debug!("(resolving pattern) binding `{}`", renamed);
2580 let def_id = self.ast_map.local_def_id(pattern.id);
2581 let def = DefLocal(def_id, pattern.id);
2583 // Record the definition so that later passes
2584 // will be able to distinguish variants from
2585 // locals in patterns.
2587 self.record_def(pattern.id,
2590 last_private: LastMod(AllPublic),
2594 // Add the binding to the local ribs, if it
2595 // doesn't already exist in the bindings list. (We
2596 // must not add it if it's in the bindings list
2597 // because that breaks the assumptions later
2598 // passes make about or-patterns.)
2599 if !bindings_list.contains_key(&renamed) {
2600 let this = &mut *self;
2601 let last_rib = this.value_ribs.last_mut().unwrap();
2602 last_rib.bindings.insert(renamed, DlDef(def));
2603 bindings_list.insert(renamed, pat_id);
2604 } else if mode == ArgumentIrrefutableMode &&
2605 bindings_list.contains_key(&renamed) {
2606 // Forbid duplicate bindings in the same
2611 ResolutionError::IdentifierBoundMoreThanOnceInParameterList(
2612 &ident.name.as_str())
2614 } else if bindings_list.get(&renamed) == Some(&pat_id) {
2615 // Then this is a duplicate variable in the
2616 // same disjunction, which is an error.
2620 ResolutionError::IdentifierBoundMoreThanOnceInSamePattern(
2621 &ident.name.as_str())
2624 // Else, not bound in the same pattern: do
2630 PatEnum(ref path, _) => {
2631 // This must be an enum variant, struct or const.
2632 let resolution = match self.resolve_possibly_assoc_item(pat_id,
2637 // The below shouldn't happen because all
2638 // qualified paths should be in PatQPath.
2639 TypecheckRequired =>
2640 self.session.span_bug(path.span,
2641 "resolve_possibly_assoc_item claimed
2643 that a path in PatEnum requires typecheck
2645 to resolve, but qualified paths should be
2648 ResolveAttempt(resolution) => resolution,
2650 if let Some(path_res) = resolution {
2651 match path_res.base_def {
2652 DefVariant(..) | DefStruct(..) | DefConst(..) => {
2653 self.record_def(pattern.id, path_res);
2656 resolve_error(&self,
2658 ResolutionError::StaticVariableReference);
2659 self.record_def(pattern.id, err_path_resolution());
2662 // If anything ends up here entirely resolved,
2663 // it's an error. If anything ends up here
2664 // partially resolved, that's OK, because it may
2665 // be a `T::CONST` that typeck will resolve.
2666 if path_res.depth == 0 {
2670 ResolutionError::NotAnEnumVariantStructOrConst(
2678 self.record_def(pattern.id, err_path_resolution());
2680 let const_name = path.segments
2685 let traits = self.get_traits_containing_item(const_name);
2686 self.trait_map.insert(pattern.id, traits);
2687 self.record_def(pattern.id, path_res);
2695 ResolutionError::UnresolvedEnumVariantStructOrConst(
2696 &path.segments.last().unwrap().identifier.name.as_str())
2698 self.record_def(pattern.id, err_path_resolution());
2700 intravisit::walk_path(self, path);
2703 PatQPath(ref qself, ref path) => {
2704 // Associated constants only.
2705 let resolution = match self.resolve_possibly_assoc_item(pat_id,
2710 TypecheckRequired => {
2711 // All `<T>::CONST` should end up here, and will
2712 // require use of the trait map to resolve
2713 // during typechecking.
2714 let const_name = path.segments
2719 let traits = self.get_traits_containing_item(const_name);
2720 self.trait_map.insert(pattern.id, traits);
2721 intravisit::walk_pat(self, pattern);
2724 ResolveAttempt(resolution) => resolution,
2726 if let Some(path_res) = resolution {
2727 match path_res.base_def {
2728 // All `<T as Trait>::CONST` should end up here, and
2729 // have the trait already selected.
2730 DefAssociatedConst(..) => {
2731 self.record_def(pattern.id, path_res);
2737 ResolutionError::NotAnAssociatedConst(
2738 &path.segments.last().unwrap().identifier.name.as_str()
2741 self.record_def(pattern.id, err_path_resolution());
2747 ResolutionError::UnresolvedAssociatedConst(&path.segments
2753 self.record_def(pattern.id, err_path_resolution());
2755 intravisit::walk_pat(self, pattern);
2758 PatStruct(ref path, _, _) => {
2759 match self.resolve_path(pat_id, path, 0, TypeNS, false) {
2760 Some(definition) => {
2761 self.record_def(pattern.id, definition);
2764 debug!("(resolving pattern) didn't find struct def: {:?}", result);
2768 ResolutionError::DoesNotNameAStruct(
2769 &*path_names_to_string(path, 0))
2771 self.record_def(pattern.id, err_path_resolution());
2774 intravisit::walk_path(self, path);
2777 PatLit(_) | PatRange(..) => {
2778 intravisit::walk_pat(self, pattern);
2789 fn resolve_bare_identifier_pattern(&mut self,
2792 -> BareIdentifierPatternResolution {
2793 let module = self.current_module.clone();
2794 match self.resolve_item_in_lexical_scope(module, name, ValueNS) {
2795 Success((target, _)) => {
2796 debug!("(resolve bare identifier pattern) succeeded in finding {} at {:?}",
2798 target.binding.borrow());
2799 match target.binding.def() {
2801 panic!("resolved name in the value namespace to a set of name bindings \
2804 // For the two success cases, this lookup can be
2805 // considered as not having a private component because
2806 // the lookup happened only within the current module.
2807 Some(def @ DefVariant(..)) | Some(def @ DefStruct(..)) => {
2808 return FoundStructOrEnumVariant(def, LastMod(AllPublic));
2810 Some(def @ DefConst(..)) | Some(def @ DefAssociatedConst(..)) => {
2811 return FoundConst(def, LastMod(AllPublic), name);
2813 Some(DefStatic(..)) => {
2814 resolve_error(self, span, ResolutionError::StaticVariableReference);
2815 return BareIdentifierPatternUnresolved;
2817 _ => return BareIdentifierPatternUnresolved
2822 panic!("unexpected indeterminate result");
2826 Some((span, msg)) => {
2827 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
2832 debug!("(resolve bare identifier pattern) failed to find {}", name);
2833 return BareIdentifierPatternUnresolved;
2838 /// Handles paths that may refer to associated items
2839 fn resolve_possibly_assoc_item(&mut self,
2841 maybe_qself: Option<&hir::QSelf>,
2843 namespace: Namespace,
2845 -> AssocItemResolveResult {
2846 let max_assoc_types;
2850 if qself.position == 0 {
2851 return TypecheckRequired;
2853 max_assoc_types = path.segments.len() - qself.position;
2854 // Make sure the trait is valid.
2855 let _ = self.resolve_trait_reference(id, path, max_assoc_types);
2858 max_assoc_types = path.segments.len();
2862 let mut resolution = self.with_no_errors(|this| {
2863 this.resolve_path(id, path, 0, namespace, check_ribs)
2865 for depth in 1..max_assoc_types {
2866 if resolution.is_some() {
2869 self.with_no_errors(|this| {
2870 resolution = this.resolve_path(id, path, depth, TypeNS, true);
2873 if let Some(DefMod(_)) = resolution.map(|r| r.base_def) {
2874 // A module is not a valid type or value.
2877 ResolveAttempt(resolution)
2880 /// If `check_ribs` is true, checks the local definitions first; i.e.
2881 /// doesn't skip straight to the containing module.
2882 /// Skips `path_depth` trailing segments, which is also reflected in the
2883 /// returned value. See `middle::def::PathResolution` for more info.
2884 pub fn resolve_path(&mut self,
2888 namespace: Namespace,
2890 -> Option<PathResolution> {
2891 let span = path.span;
2892 let segments = &path.segments[..path.segments.len() - path_depth];
2894 let mk_res = |(def, lp)| PathResolution::new(def, lp, path_depth);
2897 let def = self.resolve_crate_relative_path(span, segments, namespace);
2898 return def.map(mk_res);
2901 // Try to find a path to an item in a module.
2902 let unqualified_def = self.resolve_identifier(segments.last().unwrap().identifier,
2906 if segments.len() <= 1 {
2907 return unqualified_def.and_then(|def| self.adjust_local_def(def, span))
2909 PathResolution::new(def, LastMod(AllPublic), path_depth)
2913 let def = self.resolve_module_relative_path(span, segments, namespace);
2914 match (def, unqualified_def) {
2915 (Some((ref d, _)), Some(ref ud)) if *d == ud.def => {
2917 .add_lint(lint::builtin::UNUSED_QUALIFICATIONS,
2920 "unnecessary qualification".to_string());
2928 // Resolve a single identifier
2929 fn resolve_identifier(&mut self,
2930 identifier: hir::Ident,
2931 namespace: Namespace,
2933 -> Option<LocalDef> {
2934 // First, check to see whether the name is a primitive type.
2935 if namespace == TypeNS {
2936 if let Some(&prim_ty) = self.primitive_type_table
2938 .get(&identifier.unhygienic_name) {
2939 return Some(LocalDef::from_def(DefPrimTy(prim_ty)));
2944 if let Some(def) = self.resolve_identifier_in_local_ribs(identifier, namespace) {
2949 self.resolve_item_by_name_in_lexical_scope(identifier.unhygienic_name, namespace)
2950 .map(LocalDef::from_def)
2953 // Resolve a local definition, potentially adjusting for closures.
2954 fn adjust_local_def(&mut self, local_def: LocalDef, span: Span) -> Option<Def> {
2955 let ribs = match local_def.ribs {
2956 Some((TypeNS, i)) => &self.type_ribs[i + 1..],
2957 Some((ValueNS, i)) => &self.value_ribs[i + 1..],
2960 let mut def = local_def.def;
2963 self.session.span_bug(span, &format!("unexpected {:?} in bindings", def))
2965 DefLocal(_, node_id) => {
2969 // Nothing to do. Continue.
2971 ClosureRibKind(function_id) => {
2973 let node_def_id = self.ast_map.local_def_id(node_id);
2975 let seen = self.freevars_seen
2977 .or_insert_with(|| NodeMap());
2978 if let Some(&index) = seen.get(&node_id) {
2979 def = DefUpvar(node_def_id, node_id, index, function_id);
2982 let vec = self.freevars
2984 .or_insert_with(|| vec![]);
2985 let depth = vec.len();
2991 def = DefUpvar(node_def_id, node_id, depth, function_id);
2992 seen.insert(node_id, depth);
2994 ItemRibKind | MethodRibKind => {
2995 // This was an attempt to access an upvar inside a
2996 // named function item. This is not allowed, so we
3000 ResolutionError::CannotCaptureDynamicEnvironmentInFnItem);
3003 ConstantItemRibKind => {
3004 // Still doesn't deal with upvars
3007 ResolutionError::AttemptToUseNonConstantValueInConstant);
3013 DefTyParam(..) | DefSelfTy(..) => {
3016 NormalRibKind | MethodRibKind | ClosureRibKind(..) => {
3017 // Nothing to do. Continue.
3020 // This was an attempt to use a type parameter outside
3025 ResolutionError::TypeParametersFromOuterFunction);
3028 ConstantItemRibKind => {
3030 resolve_error(self, span, ResolutionError::OuterTypeParameterContext);
3041 // resolve a "module-relative" path, e.g. a::b::c
3042 fn resolve_module_relative_path(&mut self,
3044 segments: &[hir::PathSegment],
3045 namespace: Namespace)
3046 -> Option<(Def, LastPrivate)> {
3047 let module_path = segments.split_last()
3051 .map(|ps| ps.identifier.name)
3052 .collect::<Vec<_>>();
3054 let containing_module;
3056 let current_module = self.current_module.clone();
3057 match self.resolve_module_path(current_module,
3063 let (span, msg) = match err {
3064 Some((span, msg)) => (span, msg),
3066 let msg = format!("Use of undeclared type or module `{}`",
3067 names_to_string(&module_path));
3072 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
3075 Indeterminate => panic!("indeterminate unexpected"),
3076 Success((resulting_module, resulting_last_private)) => {
3077 containing_module = resulting_module;
3078 last_private = resulting_last_private;
3082 let name = segments.last().unwrap().identifier.name;
3083 let def = match self.resolve_name_in_module(containing_module.clone(),
3086 NameSearchType::PathSearch,
3088 Success((Target { binding, .. }, _)) => {
3089 let (def, lp) = binding.def_and_lp();
3090 (def, last_private.or(lp))
3094 if let Some(DefId{krate: kid, ..}) = containing_module.def_id() {
3095 self.used_crates.insert(kid);
3100 /// Invariant: This must be called only during main resolution, not during
3101 /// import resolution.
3102 fn resolve_crate_relative_path(&mut self,
3104 segments: &[hir::PathSegment],
3105 namespace: Namespace)
3106 -> Option<(Def, LastPrivate)> {
3107 let module_path = segments.split_last()
3111 .map(|ps| ps.identifier.name)
3112 .collect::<Vec<_>>();
3114 let root_module = self.graph_root.clone();
3116 let containing_module;
3118 match self.resolve_module_path_from_root(root_module,
3123 LastMod(AllPublic)) {
3125 let (span, msg) = match err {
3126 Some((span, msg)) => (span, msg),
3128 let msg = format!("Use of undeclared module `::{}`",
3129 names_to_string(&module_path[..]));
3134 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
3139 panic!("indeterminate unexpected");
3142 Success((resulting_module, resulting_last_private)) => {
3143 containing_module = resulting_module;
3144 last_private = resulting_last_private;
3148 let name = segments.last().unwrap().identifier.name;
3149 match self.resolve_name_in_module(containing_module,
3152 NameSearchType::PathSearch,
3154 Success((Target { binding, .. }, _)) => {
3155 let (def, lp) = binding.def_and_lp();
3156 Some((def, last_private.or(lp)))
3162 fn resolve_identifier_in_local_ribs(&mut self,
3164 namespace: Namespace)
3165 -> Option<LocalDef> {
3166 // Check the local set of ribs.
3167 let (name, ribs) = match namespace {
3168 ValueNS => (ident.name, &self.value_ribs),
3169 TypeNS => (ident.unhygienic_name, &self.type_ribs),
3172 for (i, rib) in ribs.iter().enumerate().rev() {
3173 if let Some(def_like) = rib.bindings.get(&name).cloned() {
3176 debug!("(resolving path in local ribs) resolved `{}` to {:?} at {}",
3180 return Some(LocalDef {
3181 ribs: Some((namespace, i)),
3186 debug!("(resolving path in local ribs) resolved `{}` to pseudo-def {:?}",
3198 fn resolve_item_by_name_in_lexical_scope(&mut self,
3200 namespace: Namespace)
3203 let module = self.current_module.clone();
3204 match self.resolve_item_in_lexical_scope(module, name, namespace) {
3205 Success((target, _)) => {
3206 match target.binding.def() {
3208 // This can happen if we were looking for a type and
3209 // found a module instead. Modules don't have defs.
3210 debug!("(resolving item path by identifier in lexical scope) failed to \
3211 resolve {} after success...",
3216 debug!("(resolving item path in lexical scope) resolved `{}` to item",
3218 // This lookup is "all public" because it only searched
3219 // for one identifier in the current module (couldn't
3220 // have passed through reexports or anything like that.
3226 panic!("unexpected indeterminate result");
3229 debug!("(resolving item path by identifier in lexical scope) failed to resolve {}",
3232 if let Some((span, msg)) = err {
3233 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg))
3241 fn with_no_errors<T, F>(&mut self, f: F) -> T
3242 where F: FnOnce(&mut Resolver) -> T
3244 self.emit_errors = false;
3246 self.emit_errors = true;
3250 fn find_fallback_in_self_type(&mut self, name: Name) -> FallbackSuggestion {
3251 fn extract_path_and_node_id(t: &Ty,
3252 allow: FallbackChecks)
3253 -> Option<(Path, NodeId, FallbackChecks)> {
3255 TyPath(None, ref path) => Some((path.clone(), t.id, allow)),
3256 TyPtr(ref mut_ty) => extract_path_and_node_id(&*mut_ty.ty, OnlyTraitAndStatics),
3257 TyRptr(_, ref mut_ty) => extract_path_and_node_id(&*mut_ty.ty, allow),
3258 // This doesn't handle the remaining `Ty` variants as they are not
3259 // that commonly the self_type, it might be interesting to provide
3260 // support for those in future.
3265 fn get_module(this: &mut Resolver,
3267 name_path: &[ast::Name])
3268 -> Option<Rc<Module>> {
3269 let root = this.current_module.clone();
3270 let last_name = name_path.last().unwrap();
3272 if name_path.len() == 1 {
3273 match this.primitive_type_table.primitive_types.get(last_name) {
3276 match this.current_module.children.borrow().get(last_name) {
3277 Some(child) => child.type_ns.module(),
3283 match this.resolve_module_path(root,
3288 Success((module, _)) => Some(module),
3294 fn is_static_method(this: &Resolver, did: DefId) -> bool {
3295 if let Some(node_id) = this.ast_map.as_local_node_id(did) {
3296 let sig = match this.ast_map.get(node_id) {
3297 hir_map::NodeTraitItem(trait_item) => match trait_item.node {
3298 hir::MethodTraitItem(ref sig, _) => sig,
3301 hir_map::NodeImplItem(impl_item) => match impl_item.node {
3302 hir::ImplItemKind::Method(ref sig, _) => sig,
3307 sig.explicit_self.node == hir::SelfStatic
3309 this.session.cstore.is_static_method(did)
3313 let (path, node_id, allowed) = match self.current_self_type {
3314 Some(ref ty) => match extract_path_and_node_id(ty, Everything) {
3316 None => return NoSuggestion,
3318 None => return NoSuggestion,
3321 if allowed == Everything {
3322 // Look for a field with the same name in the current self_type.
3323 match self.def_map.borrow().get(&node_id).map(|d| d.full_def()) {
3324 Some(DefTy(did, _)) |
3325 Some(DefStruct(did)) |
3326 Some(DefVariant(_, did, _)) => match self.structs.get(&did) {
3329 if fields.iter().any(|&field_name| name == field_name) {
3334 _ => {} // Self type didn't resolve properly
3338 let name_path = path.segments.iter().map(|seg| seg.identifier.name).collect::<Vec<_>>();
3340 // Look for a method in the current self type's impl module.
3341 if let Some(module) = get_module(self, path.span, &name_path) {
3342 if let Some(binding) = module.children.borrow().get(&name) {
3343 if let Some(DefMethod(did)) = binding.value_ns.def() {
3344 if is_static_method(self, did) {
3345 return StaticMethod(path_names_to_string(&path, 0));
3347 if self.current_trait_ref.is_some() {
3349 } else if allowed == Everything {
3356 // Look for a method in the current trait.
3357 if let Some((trait_did, ref trait_ref)) = self.current_trait_ref {
3358 if let Some(&did) = self.trait_item_map.get(&(name, trait_did)) {
3359 if is_static_method(self, did) {
3360 return TraitMethod(path_names_to_string(&trait_ref.path, 0));
3370 fn find_best_match_for_name(&mut self, name: &str) -> SuggestionType {
3371 let mut maybes: Vec<token::InternedString> = Vec::new();
3372 let mut values: Vec<usize> = Vec::new();
3374 if let Some(macro_name) = self.session.available_macros
3375 .borrow().iter().find(|n| n.as_str() == name) {
3376 return SuggestionType::Macro(format!("{}!", macro_name));
3379 for rib in self.value_ribs.iter().rev() {
3380 for (&k, _) in &rib.bindings {
3381 maybes.push(k.as_str());
3382 values.push(usize::MAX);
3386 let mut smallest = 0;
3387 for (i, other) in maybes.iter().enumerate() {
3388 values[i] = lev_distance(name, &other);
3390 if values[i] <= values[smallest] {
3395 let max_distance = max_suggestion_distance(name);
3396 if !values.is_empty() && values[smallest] <= max_distance && name != &maybes[smallest][..] {
3398 SuggestionType::Function(maybes[smallest].to_string())
3401 SuggestionType::NotFound
3405 fn resolve_expr(&mut self, expr: &Expr) {
3406 // First, record candidate traits for this expression if it could
3407 // result in the invocation of a method call.
3409 self.record_candidate_traits_for_expr_if_necessary(expr);
3411 // Next, resolve the node.
3413 ExprPath(ref maybe_qself, ref path) => {
3414 let resolution = match self.resolve_possibly_assoc_item(expr.id,
3415 maybe_qself.as_ref(),
3419 // `<T>::a::b::c` is resolved by typeck alone.
3420 TypecheckRequired => {
3421 let method_name = path.segments.last().unwrap().identifier.name;
3422 let traits = self.get_traits_containing_item(method_name);
3423 self.trait_map.insert(expr.id, traits);
3424 intravisit::walk_expr(self, expr);
3427 ResolveAttempt(resolution) => resolution,
3430 // This is a local path in the value namespace. Walk through
3431 // scopes looking for it.
3432 if let Some(path_res) = resolution {
3433 // Check if struct variant
3434 if let DefVariant(_, _, true) = path_res.base_def {
3435 let path_name = path_names_to_string(path, 0);
3439 ResolutionError::StructVariantUsedAsFunction(&*path_name));
3441 let msg = format!("did you mean to write: `{} {{ /* fields */ }}`?",
3443 if self.emit_errors {
3444 self.session.fileline_help(expr.span, &msg);
3446 self.session.span_help(expr.span, &msg);
3448 self.record_def(expr.id, err_path_resolution());
3450 // Write the result into the def map.
3451 debug!("(resolving expr) resolved `{}`",
3452 path_names_to_string(path, 0));
3454 // Partial resolutions will need the set of traits in scope,
3455 // so they can be completed during typeck.
3456 if path_res.depth != 0 {
3457 let method_name = path.segments.last().unwrap().identifier.name;
3458 let traits = self.get_traits_containing_item(method_name);
3459 self.trait_map.insert(expr.id, traits);
3462 self.record_def(expr.id, path_res);
3465 // Be helpful if the name refers to a struct
3466 // (The pattern matching def_tys where the id is in self.structs
3467 // matches on regular structs while excluding tuple- and enum-like
3468 // structs, which wouldn't result in this error.)
3469 let path_name = path_names_to_string(path, 0);
3470 let type_res = self.with_no_errors(|this| {
3471 this.resolve_path(expr.id, path, 0, TypeNS, false)
3474 self.record_def(expr.id, err_path_resolution());
3475 match type_res.map(|r| r.base_def) {
3476 Some(DefTy(struct_id, _)) if self.structs.contains_key(&struct_id) => {
3480 ResolutionError::StructVariantUsedAsFunction(
3484 let msg = format!("did you mean to write: `{} {{ /* fields */ }}`?",
3486 if self.emit_errors {
3487 self.session.fileline_help(expr.span, &msg);
3489 self.session.span_help(expr.span, &msg);
3493 // Keep reporting some errors even if they're ignored above.
3494 self.resolve_path(expr.id, path, 0, ValueNS, true);
3496 let mut method_scope = false;
3497 self.value_ribs.iter().rev().all(|rib| {
3498 method_scope = match rib.kind {
3499 MethodRibKind => true,
3500 ItemRibKind | ConstantItemRibKind => false,
3501 _ => return true, // Keep advancing
3503 false // Stop advancing
3506 if method_scope && special_names::self_.as_str() == &path_name[..] {
3509 ResolutionError::SelfNotAvailableInStaticMethod);
3511 let last_name = path.segments.last().unwrap().identifier.name;
3512 let mut msg = match self.find_fallback_in_self_type(last_name) {
3514 // limit search to 5 to reduce the number
3515 // of stupid suggestions
3516 match self.find_best_match_for_name(&path_name) {
3517 SuggestionType::Macro(s) => {
3518 format!("the macro `{}`", s)
3520 SuggestionType::Function(s) => format!("`{}`", s),
3521 SuggestionType::NotFound => "".to_string(),
3524 Field => format!("`self.{}`", path_name),
3526 TraitItem => format!("to call `self.{}`", path_name),
3527 TraitMethod(path_str) |
3528 StaticMethod(path_str) =>
3529 format!("to call `{}::{}`", path_str, path_name),
3532 if !msg.is_empty() {
3533 msg = format!(". Did you mean {}?", msg)
3538 ResolutionError::UnresolvedName(&*path_name, &*msg));
3544 intravisit::walk_expr(self, expr);
3547 ExprStruct(ref path, _, _) => {
3548 // Resolve the path to the structure it goes to. We don't
3549 // check to ensure that the path is actually a structure; that
3550 // is checked later during typeck.
3551 match self.resolve_path(expr.id, path, 0, TypeNS, false) {
3552 Some(definition) => self.record_def(expr.id, definition),
3554 debug!("(resolving expression) didn't find struct def",);
3558 ResolutionError::DoesNotNameAStruct(
3559 &*path_names_to_string(path, 0))
3561 self.record_def(expr.id, err_path_resolution());
3565 intravisit::walk_expr(self, expr);
3568 ExprLoop(_, Some(label)) | ExprWhile(_, _, Some(label)) => {
3569 self.with_label_rib(|this| {
3570 let def_like = DlDef(DefLabel(expr.id));
3573 let rib = this.label_ribs.last_mut().unwrap();
3574 rib.bindings.insert(label.name, def_like);
3577 intravisit::walk_expr(this, expr);
3581 ExprBreak(Some(label)) | ExprAgain(Some(label)) => {
3582 match self.search_label(label.node.name) {
3584 self.record_def(expr.id, err_path_resolution());
3587 ResolutionError::UndeclaredLabel(&label.node.name.as_str()))
3589 Some(DlDef(def @ DefLabel(_))) => {
3590 // Since this def is a label, it is never read.
3591 self.record_def(expr.id,
3594 last_private: LastMod(AllPublic),
3599 self.session.span_bug(expr.span, "label wasn't mapped to a label def!")
3605 intravisit::walk_expr(self, expr);
3610 fn record_candidate_traits_for_expr_if_necessary(&mut self, expr: &Expr) {
3612 ExprField(_, name) => {
3613 // FIXME(#6890): Even though you can't treat a method like a
3614 // field, we need to add any trait methods we find that match
3615 // the field name so that we can do some nice error reporting
3616 // later on in typeck.
3617 let traits = self.get_traits_containing_item(name.node);
3618 self.trait_map.insert(expr.id, traits);
3620 ExprMethodCall(name, _, _) => {
3621 debug!("(recording candidate traits for expr) recording traits for {}",
3623 let traits = self.get_traits_containing_item(name.node);
3624 self.trait_map.insert(expr.id, traits);
3632 fn get_traits_containing_item(&mut self, name: Name) -> Vec<DefId> {
3633 debug!("(getting traits containing item) looking for '{}'", name);
3635 fn add_trait_info(found_traits: &mut Vec<DefId>, trait_def_id: DefId, name: Name) {
3636 debug!("(adding trait info) found trait {:?} for method '{}'",
3639 found_traits.push(trait_def_id);
3642 let mut found_traits = Vec::new();
3643 let mut search_module = self.current_module.clone();
3645 // Look for the current trait.
3646 match self.current_trait_ref {
3647 Some((trait_def_id, _)) => {
3648 if self.trait_item_map.contains_key(&(name, trait_def_id)) {
3649 add_trait_info(&mut found_traits, trait_def_id, name);
3652 None => {} // Nothing to do.
3655 // Look for trait children.
3656 build_reduced_graph::populate_module_if_necessary(self, &search_module);
3659 for (_, child_names) in search_module.children.borrow().iter() {
3660 let def = match child_names.type_ns.def() {
3664 let trait_def_id = match def {
3665 DefTrait(trait_def_id) => trait_def_id,
3668 if self.trait_item_map.contains_key(&(name, trait_def_id)) {
3669 add_trait_info(&mut found_traits, trait_def_id, name);
3674 // Look for imports.
3675 for (_, import) in search_module.import_resolutions.borrow().iter() {
3676 let target = match import.type_ns.target {
3678 Some(ref target) => target,
3680 let did = match target.binding.def() {
3681 Some(DefTrait(trait_def_id)) => trait_def_id,
3682 Some(..) | None => continue,
3684 if self.trait_item_map.contains_key(&(name, did)) {
3685 add_trait_info(&mut found_traits, did, name);
3686 let id = import.type_ns.id;
3687 self.used_imports.insert((id, TypeNS));
3688 let trait_name = self.get_trait_name(did);
3689 self.record_import_use(id, trait_name);
3690 if let Some(DefId{krate: kid, ..}) = target.target_module.def_id() {
3691 self.used_crates.insert(kid);
3696 match search_module.parent_link.clone() {
3697 NoParentLink | ModuleParentLink(..) => break,
3698 BlockParentLink(parent_module, _) => {
3699 search_module = parent_module.upgrade().unwrap();
3707 fn record_def(&mut self, node_id: NodeId, resolution: PathResolution) {
3708 debug!("(recording def) recording {:?} for {}", resolution, node_id);
3709 assert!(match resolution.last_private {
3710 LastImport{..} => false,
3713 "Import should only be used for `use` directives");
3715 if let Some(prev_res) = self.def_map.borrow_mut().insert(node_id, resolution) {
3716 let span = self.ast_map.opt_span(node_id).unwrap_or(codemap::DUMMY_SP);
3717 self.session.span_bug(span,
3718 &format!("path resolved multiple times ({:?} before, {:?} now)",
3724 fn enforce_default_binding_mode(&mut self,
3726 pat_binding_mode: BindingMode,
3728 match pat_binding_mode {
3729 BindByValue(_) => {}
3733 ResolutionError::CannotUseRefBindingModeWith(descr));
3741 // Diagnostics are not particularly efficient, because they're rarely
3745 #[allow(dead_code)] // useful for debugging
3746 fn dump_module(&mut self, module_: Rc<Module>) {
3747 debug!("Dump of module `{}`:", module_to_string(&*module_));
3749 debug!("Children:");
3750 build_reduced_graph::populate_module_if_necessary(self, &module_);
3751 for (&name, _) in module_.children.borrow().iter() {
3752 debug!("* {}", name);
3755 debug!("Import resolutions:");
3756 let import_resolutions = module_.import_resolutions.borrow();
3757 for (&name, import_resolution) in import_resolutions.iter() {
3759 match import_resolution.value_ns.target {
3761 value_repr = "".to_string();
3764 value_repr = " value:?".to_string();
3770 match import_resolution.type_ns.target {
3772 type_repr = "".to_string();
3775 type_repr = " type:?".to_string();
3780 debug!("* {}:{}{}", name, value_repr, type_repr);
3786 fn names_to_string(names: &[Name]) -> String {
3787 let mut first = true;
3788 let mut result = String::new();
3793 result.push_str("::")
3795 result.push_str(&name.as_str());
3800 fn path_names_to_string(path: &Path, depth: usize) -> String {
3801 let names: Vec<ast::Name> = path.segments[..path.segments.len() - depth]
3803 .map(|seg| seg.identifier.name)
3805 names_to_string(&names[..])
3808 /// A somewhat inefficient routine to obtain the name of a module.
3809 fn module_to_string(module: &Module) -> String {
3810 let mut names = Vec::new();
3812 fn collect_mod(names: &mut Vec<ast::Name>, module: &Module) {
3813 match module.parent_link {
3815 ModuleParentLink(ref module, name) => {
3817 collect_mod(names, &*module.upgrade().unwrap());
3819 BlockParentLink(ref module, _) => {
3820 // danger, shouldn't be ident?
3821 names.push(special_idents::opaque.name);
3822 collect_mod(names, &*module.upgrade().unwrap());
3826 collect_mod(&mut names, module);
3828 if names.is_empty() {
3829 return "???".to_string();
3831 names_to_string(&names.into_iter().rev().collect::<Vec<ast::Name>>())
3834 fn err_path_resolution() -> PathResolution {
3837 last_private: LastMod(AllPublic),
3843 pub struct CrateMap {
3844 pub def_map: RefCell<DefMap>,
3845 pub freevars: FreevarMap,
3846 pub export_map: ExportMap,
3847 pub trait_map: TraitMap,
3848 pub external_exports: ExternalExports,
3849 pub glob_map: Option<GlobMap>,
3852 #[derive(PartialEq,Copy, Clone)]
3853 pub enum MakeGlobMap {
3858 /// Entry point to crate resolution.
3859 pub fn resolve_crate<'a, 'tcx>(session: &'a Session,
3860 ast_map: &'a hir_map::Map<'tcx>,
3861 make_glob_map: MakeGlobMap)
3863 let krate = ast_map.krate();
3864 let mut resolver = create_resolver(session, ast_map, krate, make_glob_map, None);
3866 resolver.resolve_crate(krate);
3868 check_unused::check_crate(&mut resolver, krate);
3871 def_map: resolver.def_map,
3872 freevars: resolver.freevars,
3873 export_map: resolver.export_map,
3874 trait_map: resolver.trait_map,
3875 external_exports: resolver.external_exports,
3876 glob_map: if resolver.make_glob_map {
3877 Some(resolver.glob_map)
3884 /// Builds a name resolution walker to be used within this module,
3885 /// or used externally, with an optional callback function.
3887 /// The callback takes a &mut bool which allows callbacks to end a
3888 /// walk when set to true, passing through the rest of the walk, while
3889 /// preserving the ribs + current module. This allows resolve_path
3890 /// calls to be made with the correct scope info. The node in the
3891 /// callback corresponds to the current node in the walk.
3892 pub fn create_resolver<'a, 'tcx>(session: &'a Session,
3893 ast_map: &'a hir_map::Map<'tcx>,
3895 make_glob_map: MakeGlobMap,
3896 callback: Option<Box<Fn(hir_map::Node, &mut bool) -> bool>>)
3897 -> Resolver<'a, 'tcx> {
3898 let mut resolver = Resolver::new(session, ast_map, make_glob_map);
3900 resolver.callback = callback;
3902 build_reduced_graph::build_reduced_graph(&mut resolver, krate);
3903 session.abort_if_errors();
3905 resolve_imports::resolve_imports(&mut resolver);
3906 session.abort_if_errors();
3908 record_exports::record(&mut resolver);
3909 session.abort_if_errors();
3914 __build_diagnostic_array! { librustc_resolve, DIAGNOSTICS }