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")]
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(slice_splits)]
27 #![feature(staged_api)]
29 #[macro_use] extern crate log;
30 #[macro_use] extern crate syntax;
31 #[macro_use] #[no_link] extern crate rustc_bitflags;
32 extern crate rustc_front;
36 use self::PatternBindingMode::*;
37 use self::Namespace::*;
38 use self::NamespaceResult::*;
39 use self::NameDefinition::*;
40 use self::ResolveResult::*;
41 use self::FallbackSuggestion::*;
42 use self::TypeParameters::*;
44 use self::UseLexicalScopeFlag::*;
45 use self::ModulePrefixResult::*;
46 use self::AssocItemResolveResult::*;
47 use self::NameSearchType::*;
48 use self::BareIdentifierPatternResolution::*;
49 use self::ParentLink::*;
50 use self::ModuleKind::*;
51 use self::FallbackChecks::*;
53 use rustc::front::map as hir_map;
54 use rustc::session::Session;
56 use rustc::metadata::csearch;
57 use rustc::metadata::decoder::{DefLike, DlDef, DlField, DlImpl};
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};
65 use rustc::util::lev_distance::lev_distance;
68 use syntax::ast::{Ident, Name, NodeId, CrateNum};
69 use syntax::attr::AttrMetaMethods;
70 use syntax::ext::mtwt;
71 use syntax::parse::token::{self, special_names, special_idents};
73 use syntax::codemap::{self, Span, Pos};
75 use rustc_front::visit::{self, FnKind, Visitor};
77 use rustc_front::hir::{Arm, BindByRef, BindByValue, BindingMode, Block};
78 use rustc_front::hir::{ConstImplItem, Crate};
79 use rustc_front::hir::{Expr, ExprAgain, ExprBreak, ExprField};
80 use rustc_front::hir::{ExprLoop, ExprWhile, ExprMethodCall};
81 use rustc_front::hir::{ExprPath, ExprStruct, FnDecl};
82 use rustc_front::hir::{ForeignItemFn, ForeignItemStatic, Generics};
83 use rustc_front::hir::{ImplItem, Item, ItemConst, ItemEnum, ItemExternCrate};
84 use rustc_front::hir::{ItemFn, ItemForeignMod, ItemImpl, ItemMod, ItemStatic, ItemDefaultImpl};
85 use rustc_front::hir::{ItemStruct, ItemTrait, ItemTy, ItemUse};
86 use rustc_front::hir::{Local, MethodImplItem};
87 use rustc_front::hir::{Pat, PatEnum, PatIdent, PatLit, PatQPath};
88 use rustc_front::hir::{PatRange, PatStruct, Path, PrimTy};
89 use rustc_front::hir::{TraitRef, Ty, TyBool, TyChar, TyF32};
90 use rustc_front::hir::{TyF64, TyFloat, TyIs, TyI8, TyI16, TyI32, TyI64, TyInt};
91 use rustc_front::hir::{TyPath, TyPtr};
92 use rustc_front::hir::{TyRptr, TyStr, TyUs, TyU8, TyU16, TyU32, TyU64, TyUint};
93 use rustc_front::hir::TypeImplItem;
94 use rustc_front::util::walk_pat;
96 use std::collections::{HashMap, HashSet};
97 use std::cell::{Cell, RefCell};
99 use std::mem::replace;
100 use std::rc::{Rc, Weak};
103 use resolve_imports::{Target, ImportDirective, ImportResolution};
104 use resolve_imports::Shadowable;
106 // NB: This module needs to be declared first so diagnostics are
107 // registered before they are used.
112 mod build_reduced_graph;
115 // Perform the callback, not walking deeper if the return is true
116 macro_rules! execute_callback {
117 ($node: expr, $walker: expr) => (
118 if let Some(ref callback) = $walker.callback {
119 if callback($node, &mut $walker.resolved) {
126 pub enum ResolutionError<'a> {
127 /// error E0401: can't use type parameters from outer function
128 TypeParametersFromOuterFunction,
129 /// error E0402: cannot use an outer type parameter in this context
130 OuterTypeParameterContext,
131 /// error E0403: the name is already used for a type parameter in this type parameter list
132 NameAlreadyUsedInTypeParameterList(Name),
133 /// error E0404: is not a trait
134 IsNotATrait(&'a str),
135 /// error E0405: use of undeclared trait name
136 UndeclaredTraitName(&'a str),
137 /// error E0406: undeclared associated type
138 UndeclaredAssociatedType,
139 /// error E0407: method is not a member of trait
140 MethodNotMemberOfTrait(Name, &'a str),
141 /// error E0437: type is not a member of trait
142 TypeNotMemberOfTrait(Name, &'a str),
143 /// error E0438: const is not a member of trait
144 ConstNotMemberOfTrait(Name, &'a str),
145 /// error E0408: variable `{}` from pattern #1 is not bound in pattern
146 VariableNotBoundInPattern(Name, usize),
147 /// error E0409: variable is bound with different mode in pattern #{} than in pattern #1
148 VariableBoundWithDifferentMode(Name, usize),
149 /// error E0410: variable from pattern is not bound in pattern #1
150 VariableNotBoundInParentPattern(Name, usize),
151 /// error E0411: use of `Self` outside of an impl or trait
152 SelfUsedOutsideImplOrTrait,
153 /// error E0412: use of undeclared
154 UseOfUndeclared(&'a str, &'a str),
155 /// error E0413: declaration shadows an enum variant or unit-like struct in scope
156 DeclarationShadowsEnumVariantOrUnitLikeStruct(Name),
157 /// error E0414: only irrefutable patterns allowed here
158 OnlyIrrefutablePatternsAllowedHere,
159 /// error E0415: identifier is bound more than once in this parameter list
160 IdentifierBoundMoreThanOnceInParameterList(&'a str),
161 /// error E0416: identifier is bound more than once in the same pattern
162 IdentifierBoundMoreThanOnceInSamePattern(&'a str),
163 /// error E0417: static variables cannot be referenced in a pattern
164 StaticVariableReference,
165 /// error E0418: is not an enum variant, struct or const
166 NotAnEnumVariantStructOrConst(&'a str),
167 /// error E0419: unresolved enum variant, struct or const
168 UnresolvedEnumVariantStructOrConst(&'a str),
169 /// error E0420: is not an associated const
170 NotAnAssociatedConst(&'a str),
171 /// error E0421: unresolved associated const
172 UnresolvedAssociatedConst(&'a str),
173 /// error E0422: does not name a struct
174 DoesNotNameAStruct(&'a str),
175 /// error E0423: is a struct variant name, but this expression uses it like a function name
176 StructVariantUsedAsFunction(&'a str),
177 /// error E0424: `self` is not available in a static method
178 SelfNotAvailableInStaticMethod,
179 /// error E0425: unresolved name
180 UnresolvedName(&'a str, &'a str),
181 /// error E0426: use of undeclared label
182 UndeclaredLabel(&'a str),
183 /// error E0427: cannot use `ref` binding mode with ...
184 CannotUseRefBindingModeWith(&'a str),
185 /// error E0428: duplicate definition
186 DuplicateDefinition(&'a str, Name),
187 /// error E0429: `self` imports are only allowed within a { } list
188 SelfImportsOnlyAllowedWithin,
189 /// error E0430: `self` import can only appear once in the list
190 SelfImportCanOnlyAppearOnceInTheList,
191 /// error E0431: `self` import can only appear in an import list with a non-empty prefix
192 SelfImportOnlyInImportListWithNonEmptyPrefix,
193 /// error E0432: unresolved import
194 UnresolvedImport(Option<(&'a str, &'a str)>),
195 /// error E0433: failed to resolve
196 FailedToResolve(&'a str),
197 /// error E0434: can't capture dynamic environment in a fn item
198 CannotCaptureDynamicEnvironmentInFnItem,
199 /// error E0435: attempt to use a non-constant value in a constant
200 AttemptToUseNonConstantValueInConstant,
203 fn resolve_error<'b, 'a:'b, 'tcx:'a>(resolver: &'b Resolver<'a, 'tcx>, span: syntax::codemap::Span,
204 resolution_error: ResolutionError<'b>) {
205 if !resolver.emit_errors {
208 match resolution_error {
209 ResolutionError::TypeParametersFromOuterFunction => {
210 span_err!(resolver.session, span, E0401, "can't use type parameters from \
211 outer function; try using a local \
212 type parameter instead");
214 ResolutionError::OuterTypeParameterContext => {
215 span_err!(resolver.session, span, E0402,
216 "cannot use an outer type parameter in this context");
218 ResolutionError::NameAlreadyUsedInTypeParameterList(name) => {
219 span_err!(resolver.session, span, E0403,
220 "the name `{}` is already used for a type \
221 parameter in this type parameter list", name);
223 ResolutionError::IsNotATrait(name) => {
224 span_err!(resolver.session, span, E0404,
225 "`{}` is not a trait",
228 ResolutionError::UndeclaredTraitName(name) => {
229 span_err!(resolver.session, span, E0405,
230 "use of undeclared trait name `{}`",
233 ResolutionError::UndeclaredAssociatedType => {
234 span_err!(resolver.session, span, E0406, "undeclared associated type");
236 ResolutionError::MethodNotMemberOfTrait(method, trait_) => {
237 span_err!(resolver.session, span, E0407,
238 "method `{}` is not a member of trait `{}`",
242 ResolutionError::TypeNotMemberOfTrait(type_, trait_) => {
243 span_err!(resolver.session, span, E0437,
244 "type `{}` is not a member of trait `{}`",
248 ResolutionError::ConstNotMemberOfTrait(const_, trait_) => {
249 span_err!(resolver.session, span, E0438,
250 "const `{}` is not a member of trait `{}`",
254 ResolutionError::VariableNotBoundInPattern(variable_name, pattern_number) => {
255 span_err!(resolver.session, span, E0408,
256 "variable `{}` from pattern #1 is not bound in pattern #{}",
260 ResolutionError::VariableBoundWithDifferentMode(variable_name, pattern_number) => {
261 span_err!(resolver.session, span, E0409,
262 "variable `{}` is bound with different \
263 mode in pattern #{} than in pattern #1",
267 ResolutionError::VariableNotBoundInParentPattern(variable_name, pattern_number) => {
268 span_err!(resolver.session, span, E0410,
269 "variable `{}` from pattern #{} is not bound in pattern #1",
273 ResolutionError::SelfUsedOutsideImplOrTrait => {
274 span_err!(resolver.session, span, E0411, "use of `Self` outside of an impl or trait");
276 ResolutionError::UseOfUndeclared(kind, name) => {
277 span_err!(resolver.session, span, E0412,
278 "use of undeclared {} `{}`",
282 ResolutionError::DeclarationShadowsEnumVariantOrUnitLikeStruct(name) => {
283 span_err!(resolver.session, span, E0413,
284 "declaration of `{}` shadows an enum variant or unit-like struct in \
288 ResolutionError::OnlyIrrefutablePatternsAllowedHere => {
289 span_err!(resolver.session, span, E0414, "only irrefutable patterns allowed here");
291 ResolutionError::IdentifierBoundMoreThanOnceInParameterList(identifier) => {
292 span_err!(resolver.session, span, E0415,
293 "identifier `{}` is bound more than once in this parameter list",
296 ResolutionError::IdentifierBoundMoreThanOnceInSamePattern(identifier) => {
297 span_err!(resolver.session, span, E0416,
298 "identifier `{}` is bound more than once in the same pattern",
301 ResolutionError::StaticVariableReference => {
302 span_err!(resolver.session, span, E0417, "static variables cannot be \
303 referenced in a pattern, \
304 use a `const` instead");
306 ResolutionError::NotAnEnumVariantStructOrConst(name) => {
307 span_err!(resolver.session, span, E0418,
308 "`{}` is not an enum variant, struct or const",
311 ResolutionError::UnresolvedEnumVariantStructOrConst(name) => {
312 span_err!(resolver.session, span, E0419,
313 "unresolved enum variant, struct or const `{}`",
316 ResolutionError::NotAnAssociatedConst(name) => {
317 span_err!(resolver.session, span, E0420,
318 "`{}` is not an associated const",
321 ResolutionError::UnresolvedAssociatedConst(name) => {
322 span_err!(resolver.session, span, E0421,
323 "unresolved associated const `{}`",
326 ResolutionError::DoesNotNameAStruct(name) => {
327 span_err!(resolver.session, span, E0422, "`{}` does not name a structure", name);
329 ResolutionError::StructVariantUsedAsFunction(path_name) => {
330 span_err!(resolver.session, span, E0423,
331 "`{}` is the name of a struct or struct variant, \
332 but this expression \
333 uses it like a function name",
336 ResolutionError::SelfNotAvailableInStaticMethod => {
337 span_err!(resolver.session, span, E0424, "`self` is not available in a static method. \
338 Maybe a `self` argument is missing?");
340 ResolutionError::UnresolvedName(path, name) => {
341 span_err!(resolver.session, span, E0425,
342 "unresolved name `{}`{}",
346 ResolutionError::UndeclaredLabel(name) => {
347 span_err!(resolver.session, span, E0426,
348 "use of undeclared label `{}`",
351 ResolutionError::CannotUseRefBindingModeWith(descr) => {
352 span_err!(resolver.session, span, E0427,
353 "cannot use `ref` binding mode with {}",
356 ResolutionError::DuplicateDefinition(namespace, name) => {
357 span_err!(resolver.session, span, E0428,
358 "duplicate definition of {} `{}`",
362 ResolutionError::SelfImportsOnlyAllowedWithin => {
363 span_err!(resolver.session, span, E0429, "{}",
364 "`self` imports are only allowed within a { } list");
366 ResolutionError::SelfImportCanOnlyAppearOnceInTheList => {
367 span_err!(resolver.session, span, E0430,
368 "`self` import can only appear once in the list");
370 ResolutionError::SelfImportOnlyInImportListWithNonEmptyPrefix => {
371 span_err!(resolver.session, span, E0431,
372 "`self` import can only appear in an import list with a \
375 ResolutionError::UnresolvedImport(name) => {
376 let msg = match name {
377 Some((n, p)) => format!("unresolved import `{}`{}", n, p),
378 None => "unresolved import".to_owned()
380 span_err!(resolver.session, span, E0432, "{}", msg);
382 ResolutionError::FailedToResolve(msg) => {
383 span_err!(resolver.session, span, E0433, "failed to resolve. {}", msg);
385 ResolutionError::CannotCaptureDynamicEnvironmentInFnItem => {
386 span_err!(resolver.session, span, E0434, "{}",
387 "can't capture dynamic environment in a fn item; \
388 use the || { ... } closure form instead");
390 ResolutionError::AttemptToUseNonConstantValueInConstant =>{
391 span_err!(resolver.session, span, E0435,
392 "attempt to use a non-constant value in a constant");
397 #[derive(Copy, Clone)]
400 binding_mode: BindingMode,
403 // Map from the name in a pattern to its binding mode.
404 type BindingMap = HashMap<Name, BindingInfo>;
406 #[derive(Copy, Clone, PartialEq)]
407 enum PatternBindingMode {
409 LocalIrrefutableMode,
410 ArgumentIrrefutableMode,
413 #[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
419 /// A NamespaceResult represents the result of resolving an import in
420 /// a particular namespace. The result is either definitely-resolved,
421 /// definitely- unresolved, or unknown.
423 enum NamespaceResult {
424 /// Means that resolve hasn't gathered enough information yet to determine
425 /// whether the name is bound in this namespace. (That is, it hasn't
426 /// resolved all `use` directives yet.)
428 /// Means that resolve has determined that the name is definitely
429 /// not bound in the namespace.
431 /// Means that resolve has determined that the name is bound in the Module
432 /// argument, and specified by the NameBindings argument.
433 BoundResult(Rc<Module>, Rc<NameBindings>)
436 impl NamespaceResult {
437 fn is_unknown(&self) -> bool {
439 UnknownResult => true,
443 fn is_unbound(&self) -> bool {
445 UnboundResult => true,
451 enum NameDefinition {
452 // The name was unbound.
454 // The name identifies an immediate child.
455 ChildNameDefinition(Def, LastPrivate),
456 // The name identifies an import.
457 ImportNameDefinition(Def, LastPrivate),
460 impl<'a, 'v, 'tcx> Visitor<'v> for Resolver<'a, 'tcx> {
461 fn visit_item(&mut self, item: &Item) {
462 execute_callback!(hir_map::Node::NodeItem(item), self);
463 self.resolve_item(item);
465 fn visit_arm(&mut self, arm: &Arm) {
466 self.resolve_arm(arm);
468 fn visit_block(&mut self, block: &Block) {
469 execute_callback!(hir_map::Node::NodeBlock(block), self);
470 self.resolve_block(block);
472 fn visit_expr(&mut self, expr: &Expr) {
473 execute_callback!(hir_map::Node::NodeExpr(expr), self);
474 self.resolve_expr(expr);
476 fn visit_local(&mut self, local: &Local) {
477 execute_callback!(hir_map::Node::NodeLocal(&*local.pat), self);
478 self.resolve_local(local);
480 fn visit_ty(&mut self, ty: &Ty) {
481 self.resolve_type(ty);
483 fn visit_generics(&mut self, generics: &Generics) {
484 self.resolve_generics(generics);
486 fn visit_poly_trait_ref(&mut self,
487 tref: &hir::PolyTraitRef,
488 m: &hir::TraitBoundModifier) {
489 match self.resolve_trait_reference(tref.trait_ref.ref_id, &tref.trait_ref.path, 0) {
490 Ok(def) => self.record_def(tref.trait_ref.ref_id, def),
491 Err(_) => { /* error already reported */ }
493 visit::walk_poly_trait_ref(self, tref, m);
495 fn visit_variant(&mut self, variant: &hir::Variant, generics: &Generics) {
496 execute_callback!(hir_map::Node::NodeVariant(variant), self);
497 if let Some(ref dis_expr) = variant.node.disr_expr {
498 // resolve the discriminator expr as a constant
499 self.with_constant_rib(|this| {
500 this.visit_expr(&**dis_expr);
504 // `visit::walk_variant` without the discriminant expression.
505 match variant.node.kind {
506 hir::TupleVariantKind(ref variant_arguments) => {
507 for variant_argument in variant_arguments {
508 self.visit_ty(&*variant_argument.ty);
511 hir::StructVariantKind(ref struct_definition) => {
512 self.visit_struct_def(&**struct_definition,
519 fn visit_foreign_item(&mut self, foreign_item: &hir::ForeignItem) {
520 execute_callback!(hir_map::Node::NodeForeignItem(foreign_item), self);
521 let type_parameters = match foreign_item.node {
522 ForeignItemFn(_, ref generics) => {
523 HasTypeParameters(generics, FnSpace, ItemRibKind)
525 ForeignItemStatic(..) => NoTypeParameters
527 self.with_type_parameter_rib(type_parameters, |this| {
528 visit::walk_foreign_item(this, foreign_item);
531 fn visit_fn(&mut self,
532 function_kind: FnKind<'v>,
533 declaration: &'v FnDecl,
537 let rib_kind = match function_kind {
538 FnKind::ItemFn(_, generics, _, _, _, _) => {
539 self.visit_generics(generics);
542 FnKind::Method(_, sig, _) => {
543 self.visit_generics(&sig.generics);
544 self.visit_explicit_self(&sig.explicit_self);
547 FnKind::Closure(..) => ClosureRibKind(node_id)
549 self.resolve_function(rib_kind, declaration, block);
553 type ErrorMessage = Option<(Span, String)>;
555 enum ResolveResult<T> {
556 Failed(ErrorMessage), // Failed to resolve the name, optional helpful error message.
557 Indeterminate, // Couldn't determine due to unresolved globs.
558 Success(T) // Successfully resolved the import.
561 impl<T> ResolveResult<T> {
562 fn success(&self) -> bool {
563 match *self { Success(_) => true, _ => false }
567 enum FallbackSuggestion {
572 StaticMethod(String),
576 #[derive(Copy, Clone)]
577 enum TypeParameters<'a> {
583 // Identifies the things that these parameters
584 // were declared on (type, fn, etc)
587 // The kind of the rib used for type parameters.
591 // The rib kind controls the translation of local
592 // definitions (`DefLocal`) to upvars (`DefUpvar`).
593 #[derive(Copy, Clone, Debug)]
595 // No translation needs to be applied.
598 // We passed through a closure scope at the given node ID.
599 // Translate upvars as appropriate.
600 ClosureRibKind(NodeId /* func id */),
602 // We passed through an impl or trait and are now in one of its
603 // methods. Allow references to ty params that impl or trait
604 // binds. Disallow any other upvars (including other ty params that are
608 // We passed through an item scope. Disallow upvars.
611 // We're in a constant item. Can't refer to dynamic stuff.
615 #[derive(Copy, Clone)]
616 enum UseLexicalScopeFlag {
621 enum ModulePrefixResult {
623 PrefixFound(Rc<Module>, usize)
626 #[derive(Copy, Clone)]
627 enum AssocItemResolveResult {
628 /// Syntax such as `<T>::item`, which can't be resolved until type
631 /// We should have been able to resolve the associated item.
632 ResolveAttempt(Option<PathResolution>),
635 #[derive(Copy, Clone, PartialEq)]
636 enum NameSearchType {
637 /// We're doing a name search in order to resolve a `use` directive.
640 /// We're doing a name search in order to resolve a path type, a path
641 /// expression, or a path pattern.
645 #[derive(Copy, Clone)]
646 enum BareIdentifierPatternResolution {
647 FoundStructOrEnumVariant(Def, LastPrivate),
648 FoundConst(Def, LastPrivate),
649 BareIdentifierPatternUnresolved
655 bindings: HashMap<Name, DefLike>,
660 fn new(kind: RibKind) -> Rib {
662 bindings: HashMap::new(),
668 /// The link from a module up to its nearest parent node.
669 #[derive(Clone,Debug)]
672 ModuleParentLink(Weak<Module>, Name),
673 BlockParentLink(Weak<Module>, NodeId)
676 /// The type of module this is.
677 #[derive(Copy, Clone, PartialEq, Debug)]
686 /// One node in the tree of modules.
688 parent_link: ParentLink,
689 def_id: Cell<Option<DefId>>,
690 kind: Cell<ModuleKind>,
693 children: RefCell<HashMap<Name, Rc<NameBindings>>>,
694 imports: RefCell<Vec<ImportDirective>>,
696 // The external module children of this node that were declared with
698 external_module_children: RefCell<HashMap<Name, Rc<Module>>>,
700 // The anonymous children of this node. Anonymous children are pseudo-
701 // modules that are implicitly created around items contained within
704 // For example, if we have this:
712 // There will be an anonymous module created around `g` with the ID of the
713 // entry block for `f`.
714 anonymous_children: RefCell<NodeMap<Rc<Module>>>,
716 // The status of resolving each import in this module.
717 import_resolutions: RefCell<HashMap<Name, ImportResolution>>,
719 // The number of unresolved globs that this module exports.
720 glob_count: Cell<usize>,
722 // The number of unresolved pub imports (both regular and globs) in this module
723 pub_count: Cell<usize>,
725 // The number of unresolved pub glob imports in this module
726 pub_glob_count: Cell<usize>,
728 // The index of the import we're resolving.
729 resolved_import_count: Cell<usize>,
731 // Whether this module is populated. If not populated, any attempt to
732 // access the children must be preceded with a
733 // `populate_module_if_necessary` call.
734 populated: Cell<bool>,
738 fn new(parent_link: ParentLink,
739 def_id: Option<DefId>,
745 parent_link: parent_link,
746 def_id: Cell::new(def_id),
747 kind: Cell::new(kind),
748 is_public: is_public,
749 children: RefCell::new(HashMap::new()),
750 imports: RefCell::new(Vec::new()),
751 external_module_children: RefCell::new(HashMap::new()),
752 anonymous_children: RefCell::new(NodeMap()),
753 import_resolutions: RefCell::new(HashMap::new()),
754 glob_count: Cell::new(0),
755 pub_count: Cell::new(0),
756 pub_glob_count: Cell::new(0),
757 resolved_import_count: Cell::new(0),
758 populated: Cell::new(!external),
762 fn all_imports_resolved(&self) -> bool {
763 if self.imports.borrow_state() == ::std::cell::BorrowState::Writing {
764 // it is currently being resolved ! so nope
767 self.imports.borrow().len() == self.resolved_import_count.get()
773 pub fn inc_glob_count(&self) {
774 self.glob_count.set(self.glob_count.get() + 1);
776 pub fn dec_glob_count(&self) {
777 assert!(self.glob_count.get() > 0);
778 self.glob_count.set(self.glob_count.get() - 1);
780 pub fn inc_pub_count(&self) {
781 self.pub_count.set(self.pub_count.get() + 1);
783 pub fn dec_pub_count(&self) {
784 assert!(self.pub_count.get() > 0);
785 self.pub_count.set(self.pub_count.get() - 1);
787 pub fn inc_pub_glob_count(&self) {
788 self.pub_glob_count.set(self.pub_glob_count.get() + 1);
790 pub fn dec_pub_glob_count(&self) {
791 assert!(self.pub_glob_count.get() > 0);
792 self.pub_glob_count.set(self.pub_glob_count.get() - 1);
796 impl fmt::Debug for Module {
797 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
798 write!(f, "{:?}, kind: {:?}, {}",
801 if self.is_public { "public" } else { "private" } )
807 flags DefModifiers: u8 {
808 const PUBLIC = 1 << 0,
809 const IMPORTABLE = 1 << 1,
813 // Records a possibly-private type definition.
814 #[derive(Clone,Debug)]
816 modifiers: DefModifiers, // see note in ImportResolution about how to use this
817 module_def: Option<Rc<Module>>,
818 type_def: Option<Def>,
819 type_span: Option<Span>
822 // Records a possibly-private value definition.
823 #[derive(Clone, Copy, Debug)]
825 modifiers: DefModifiers, // see note in ImportResolution about how to use this
827 value_span: Option<Span>,
830 // Records the definitions (at most one for each namespace) that a name is
833 pub struct NameBindings {
834 type_def: RefCell<Option<TypeNsDef>>, //< Meaning in type namespace.
835 value_def: RefCell<Option<ValueNsDef>>, //< Meaning in value namespace.
839 fn new() -> NameBindings {
841 type_def: RefCell::new(None),
842 value_def: RefCell::new(None),
846 /// Creates a new module in this set of name bindings.
847 fn define_module(&self,
848 parent_link: ParentLink,
849 def_id: Option<DefId>,
854 // Merges the module with the existing type def or creates a new one.
855 let modifiers = if is_public {
858 DefModifiers::empty()
859 } | DefModifiers::IMPORTABLE;
860 let module_ = Rc::new(Module::new(parent_link,
865 let type_def = self.type_def.borrow().clone();
868 *self.type_def.borrow_mut() = Some(TypeNsDef {
869 modifiers: modifiers,
870 module_def: Some(module_),
876 *self.type_def.borrow_mut() = Some(TypeNsDef {
877 modifiers: modifiers,
878 module_def: Some(module_),
880 type_def: type_def.type_def
886 /// Sets the kind of the module, creating a new one if necessary.
887 fn set_module_kind(&self,
888 parent_link: ParentLink,
889 def_id: Option<DefId>,
894 let modifiers = if is_public {
897 DefModifiers::empty()
898 } | DefModifiers::IMPORTABLE;
899 let type_def = self.type_def.borrow().clone();
902 let module = Module::new(parent_link,
907 *self.type_def.borrow_mut() = Some(TypeNsDef {
908 modifiers: modifiers,
909 module_def: Some(Rc::new(module)),
915 match type_def.module_def {
917 let module = Module::new(parent_link,
922 *self.type_def.borrow_mut() = Some(TypeNsDef {
923 modifiers: modifiers,
924 module_def: Some(Rc::new(module)),
925 type_def: type_def.type_def,
929 Some(module_def) => module_def.kind.set(kind),
935 /// Records a type definition.
936 fn define_type(&self, def: Def, sp: Span, modifiers: DefModifiers) {
937 debug!("defining type for def {:?} with modifiers {:?}", def, modifiers);
938 // Merges the type with the existing type def or creates a new one.
939 let type_def = self.type_def.borrow().clone();
942 *self.type_def.borrow_mut() = Some(TypeNsDef {
946 modifiers: modifiers,
950 *self.type_def.borrow_mut() = Some(TypeNsDef {
951 module_def: type_def.module_def,
954 modifiers: modifiers,
960 /// Records a value definition.
961 fn define_value(&self, def: Def, sp: Span, modifiers: DefModifiers) {
962 debug!("defining value for def {:?} with modifiers {:?}", def, modifiers);
963 *self.value_def.borrow_mut() = Some(ValueNsDef {
965 value_span: Some(sp),
966 modifiers: modifiers,
970 /// Returns the module node if applicable.
971 fn get_module_if_available(&self) -> Option<Rc<Module>> {
972 match *self.type_def.borrow() {
973 Some(ref type_def) => type_def.module_def.clone(),
978 /// Returns the module node. Panics if this node does not have a module
980 fn get_module(&self) -> Rc<Module> {
981 match self.get_module_if_available() {
983 panic!("get_module called on a node with no module \
986 Some(module_def) => module_def
990 fn defined_in_namespace(&self, namespace: Namespace) -> bool {
992 TypeNS => return self.type_def.borrow().is_some(),
993 ValueNS => return self.value_def.borrow().is_some()
997 fn defined_in_public_namespace(&self, namespace: Namespace) -> bool {
998 self.defined_in_namespace_with(namespace, DefModifiers::PUBLIC)
1001 fn defined_in_namespace_with(&self, namespace: Namespace, modifiers: DefModifiers) -> bool {
1003 TypeNS => match *self.type_def.borrow() {
1004 Some(ref def) => def.modifiers.contains(modifiers), None => false
1006 ValueNS => match *self.value_def.borrow() {
1007 Some(ref def) => def.modifiers.contains(modifiers), None => false
1012 fn def_for_namespace(&self, namespace: Namespace) -> Option<Def> {
1015 match *self.type_def.borrow() {
1017 Some(ref type_def) => {
1018 match type_def.type_def {
1019 Some(type_def) => Some(type_def),
1021 match type_def.module_def {
1022 Some(ref module) => {
1023 match module.def_id.get() {
1024 Some(did) => Some(DefMod(did)),
1036 match *self.value_def.borrow() {
1038 Some(value_def) => Some(value_def.def)
1044 fn span_for_namespace(&self, namespace: Namespace) -> Option<Span> {
1045 if self.defined_in_namespace(namespace) {
1048 match *self.type_def.borrow() {
1050 Some(ref type_def) => type_def.type_span
1054 match *self.value_def.borrow() {
1056 Some(ref value_def) => value_def.value_span
1065 fn is_public(&self, namespace: Namespace) -> bool {
1068 let type_def = self.type_def.borrow();
1069 type_def.as_ref().unwrap().modifiers.contains(DefModifiers::PUBLIC)
1072 let value_def = self.value_def.borrow();
1073 value_def.as_ref().unwrap().modifiers.contains(DefModifiers::PUBLIC)
1079 /// Interns the names of the primitive types.
1080 struct PrimitiveTypeTable {
1081 primitive_types: HashMap<Name, PrimTy>,
1084 impl PrimitiveTypeTable {
1085 fn new() -> PrimitiveTypeTable {
1086 let mut table = PrimitiveTypeTable {
1087 primitive_types: HashMap::new()
1090 table.intern("bool", TyBool);
1091 table.intern("char", TyChar);
1092 table.intern("f32", TyFloat(TyF32));
1093 table.intern("f64", TyFloat(TyF64));
1094 table.intern("isize", TyInt(TyIs));
1095 table.intern("i8", TyInt(TyI8));
1096 table.intern("i16", TyInt(TyI16));
1097 table.intern("i32", TyInt(TyI32));
1098 table.intern("i64", TyInt(TyI64));
1099 table.intern("str", TyStr);
1100 table.intern("usize", TyUint(TyUs));
1101 table.intern("u8", TyUint(TyU8));
1102 table.intern("u16", TyUint(TyU16));
1103 table.intern("u32", TyUint(TyU32));
1104 table.intern("u64", TyUint(TyU64));
1109 fn intern(&mut self, string: &str, primitive_type: PrimTy) {
1110 self.primitive_types.insert(token::intern(string), primitive_type);
1114 /// The main resolver class.
1115 pub struct Resolver<'a, 'tcx:'a> {
1116 session: &'a Session,
1118 ast_map: &'a hir_map::Map<'tcx>,
1120 graph_root: NameBindings,
1122 trait_item_map: FnvHashMap<(Name, DefId), DefId>,
1124 structs: FnvHashMap<DefId, Vec<Name>>,
1126 // The number of imports that are currently unresolved.
1127 unresolved_imports: usize,
1129 // The module that represents the current item scope.
1130 current_module: Rc<Module>,
1132 // The current set of local scopes, for values.
1133 // FIXME #4948: Reuse ribs to avoid allocation.
1134 value_ribs: Vec<Rib>,
1136 // The current set of local scopes, for types.
1137 type_ribs: Vec<Rib>,
1139 // The current set of local scopes, for labels.
1140 label_ribs: Vec<Rib>,
1142 // The trait that the current context can refer to.
1143 current_trait_ref: Option<(DefId, TraitRef)>,
1145 // The current self type if inside an impl (used for better errors).
1146 current_self_type: Option<Ty>,
1148 // The idents for the primitive types.
1149 primitive_type_table: PrimitiveTypeTable,
1152 freevars: RefCell<FreevarMap>,
1153 freevars_seen: RefCell<NodeMap<NodeMap<usize>>>,
1154 export_map: ExportMap,
1155 trait_map: TraitMap,
1156 external_exports: ExternalExports,
1158 // Whether or not to print error messages. Can be set to true
1159 // when getting additional info for error message suggestions,
1160 // so as to avoid printing duplicate errors
1163 make_glob_map: bool,
1164 // Maps imports to the names of items actually imported (this actually maps
1165 // all imports, but only glob imports are actually interesting).
1168 used_imports: HashSet<(NodeId, Namespace)>,
1169 used_crates: HashSet<CrateNum>,
1171 // Callback function for intercepting walks
1172 callback: Option<Box<Fn(hir_map::Node, &mut bool) -> bool>>,
1173 // The intention is that the callback modifies this flag.
1174 // Once set, the resolver falls out of the walk, preserving the ribs.
1179 #[derive(PartialEq)]
1180 enum FallbackChecks {
1185 impl<'a, 'tcx> Resolver<'a, 'tcx> {
1186 fn new(session: &'a Session,
1187 ast_map: &'a hir_map::Map<'tcx>,
1189 make_glob_map: MakeGlobMap) -> Resolver<'a, 'tcx> {
1190 let graph_root = NameBindings::new();
1192 graph_root.define_module(NoParentLink,
1193 Some(DefId { krate: 0, node: 0 }),
1199 let current_module = graph_root.get_module();
1206 // The outermost module has def ID 0; this is not reflected in the
1209 graph_root: graph_root,
1211 trait_item_map: FnvHashMap(),
1212 structs: FnvHashMap(),
1214 unresolved_imports: 0,
1216 current_module: current_module,
1217 value_ribs: Vec::new(),
1218 type_ribs: Vec::new(),
1219 label_ribs: Vec::new(),
1221 current_trait_ref: None,
1222 current_self_type: None,
1224 primitive_type_table: PrimitiveTypeTable::new(),
1226 def_map: RefCell::new(NodeMap()),
1227 freevars: RefCell::new(NodeMap()),
1228 freevars_seen: RefCell::new(NodeMap()),
1229 export_map: NodeMap(),
1230 trait_map: NodeMap(),
1231 used_imports: HashSet::new(),
1232 used_crates: HashSet::new(),
1233 external_exports: DefIdSet(),
1236 make_glob_map: make_glob_map == MakeGlobMap::Yes,
1237 glob_map: HashMap::new(),
1246 fn record_import_use(&mut self, import_id: NodeId, name: Name) {
1247 if !self.make_glob_map {
1250 if self.glob_map.contains_key(&import_id) {
1251 self.glob_map.get_mut(&import_id).unwrap().insert(name);
1255 let mut new_set = HashSet::new();
1256 new_set.insert(name);
1257 self.glob_map.insert(import_id, new_set);
1260 fn get_trait_name(&self, did: DefId) -> Name {
1262 self.ast_map.expect_item(did.node).ident.name
1264 csearch::get_trait_name(&self.session.cstore, did)
1268 fn create_name_bindings_from_module(module: Rc<Module>) -> NameBindings {
1270 type_def: RefCell::new(Some(TypeNsDef {
1271 modifiers: DefModifiers::IMPORTABLE,
1272 module_def: Some(module),
1276 value_def: RefCell::new(None),
1280 /// Checks that the names of external crates don't collide with other
1281 /// external crates.
1282 fn check_for_conflicts_between_external_crates(&self,
1286 if module.external_module_children.borrow().contains_key(&name) {
1287 span_err!(self.session, span, E0259,
1288 "an external crate named `{}` has already \
1289 been imported into this module",
1294 /// Checks that the names of items don't collide with external crates.
1295 fn check_for_conflicts_between_external_crates_and_items(&self,
1299 if module.external_module_children.borrow().contains_key(&name) {
1300 span_err!(self.session, span, E0260,
1301 "the name `{}` conflicts with an external \
1302 crate that has been imported into this \
1308 /// Resolves the given module path from the given root `module_`.
1309 fn resolve_module_path_from_root(&mut self,
1310 module_: Rc<Module>,
1311 module_path: &[Name],
1314 name_search_type: NameSearchType,
1316 -> ResolveResult<(Rc<Module>, LastPrivate)> {
1317 fn search_parent_externals(needle: Name, module: &Rc<Module>)
1318 -> Option<Rc<Module>> {
1319 match module.external_module_children.borrow().get(&needle) {
1320 Some(_) => Some(module.clone()),
1321 None => match module.parent_link {
1322 ModuleParentLink(ref parent, _) => {
1323 search_parent_externals(needle, &parent.upgrade().unwrap())
1330 let mut search_module = module_;
1331 let mut index = index;
1332 let module_path_len = module_path.len();
1333 let mut closest_private = lp;
1335 // Resolve the module part of the path. This does not involve looking
1336 // upward though scope chains; we simply resolve names directly in
1337 // modules as we go.
1338 while index < module_path_len {
1339 let name = module_path[index];
1340 match self.resolve_name_in_module(search_module.clone(),
1346 let segment_name = name.as_str();
1347 let module_name = module_to_string(&*search_module);
1348 let mut span = span;
1349 let msg = if "???" == &module_name[..] {
1350 span.hi = span.lo + Pos::from_usize(segment_name.len());
1352 match search_parent_externals(name,
1353 &self.current_module) {
1355 let path_str = names_to_string(module_path);
1356 let target_mod_str = module_to_string(&*module);
1357 let current_mod_str =
1358 module_to_string(&*self.current_module);
1360 let prefix = if target_mod_str == current_mod_str {
1361 "self::".to_string()
1363 format!("{}::", target_mod_str)
1366 format!("Did you mean `{}{}`?", prefix, path_str)
1368 None => format!("Maybe a missing `extern crate {}`?",
1372 format!("Could not find `{}` in `{}`",
1377 return Failed(Some((span, msg)));
1379 Failed(err) => return Failed(err),
1381 debug!("(resolving module path for import) module \
1382 resolution is indeterminate: {}",
1384 return Indeterminate;
1386 Success((target, used_proxy)) => {
1387 // Check to see whether there are type bindings, and, if
1388 // so, whether there is a module within.
1389 match *target.bindings.type_def.borrow() {
1390 Some(ref type_def) => {
1391 match type_def.module_def {
1393 let msg = format!("Not a module `{}`",
1396 return Failed(Some((span, msg)));
1398 Some(ref module_def) => {
1399 search_module = module_def.clone();
1401 // track extern crates for unused_extern_crate lint
1402 if let Some(did) = module_def.def_id.get() {
1403 self.used_crates.insert(did.krate);
1406 // Keep track of the closest
1407 // private module used when
1408 // resolving this import chain.
1409 if !used_proxy && !search_module.is_public {
1410 if let Some(did) = search_module.def_id.get() {
1411 closest_private = LastMod(DependsOn(did));
1418 // There are no type bindings at all.
1419 let msg = format!("Not a module `{}`",
1421 return Failed(Some((span, msg)));
1430 return Success((search_module, closest_private));
1433 /// Attempts to resolve the module part of an import directive or path
1434 /// rooted at the given module.
1436 /// On success, returns the resolved module, and the closest *private*
1437 /// module found to the destination when resolving this path.
1438 fn resolve_module_path(&mut self,
1439 module_: Rc<Module>,
1440 module_path: &[Name],
1441 use_lexical_scope: UseLexicalScopeFlag,
1443 name_search_type: NameSearchType)
1444 -> ResolveResult<(Rc<Module>, LastPrivate)> {
1445 let module_path_len = module_path.len();
1446 assert!(module_path_len > 0);
1448 debug!("(resolving module path for import) processing `{}` rooted at `{}`",
1449 names_to_string(module_path),
1450 module_to_string(&*module_));
1452 // Resolve the module prefix, if any.
1453 let module_prefix_result = self.resolve_module_prefix(module_.clone(),
1459 match module_prefix_result {
1461 let mpath = names_to_string(module_path);
1462 let mpath = &mpath[..];
1463 match mpath.rfind(':') {
1465 let msg = format!("Could not find `{}` in `{}`",
1466 // idx +- 1 to account for the
1467 // colons on either side
1470 return Failed(Some((span, msg)));
1477 Failed(err) => return Failed(err),
1479 debug!("(resolving module path for import) indeterminate; \
1481 return Indeterminate;
1483 Success(NoPrefixFound) => {
1484 // There was no prefix, so we're considering the first element
1485 // of the path. How we handle this depends on whether we were
1486 // instructed to use lexical scope or not.
1487 match use_lexical_scope {
1488 DontUseLexicalScope => {
1489 // This is a crate-relative path. We will start the
1490 // resolution process at index zero.
1491 search_module = self.graph_root.get_module();
1493 last_private = LastMod(AllPublic);
1495 UseLexicalScope => {
1496 // This is not a crate-relative path. We resolve the
1497 // first component of the path in the current lexical
1498 // scope and then proceed to resolve below that.
1499 match self.resolve_module_in_lexical_scope(module_,
1501 Failed(err) => return Failed(err),
1503 debug!("(resolving module path for import) \
1504 indeterminate; bailing");
1505 return Indeterminate;
1507 Success(containing_module) => {
1508 search_module = containing_module;
1510 last_private = LastMod(AllPublic);
1516 Success(PrefixFound(ref containing_module, index)) => {
1517 search_module = containing_module.clone();
1518 start_index = index;
1519 last_private = LastMod(DependsOn(containing_module.def_id
1525 self.resolve_module_path_from_root(search_module,
1533 /// Invariant: This must only be called during main resolution, not during
1534 /// import resolution.
1535 fn resolve_item_in_lexical_scope(&mut self,
1536 module_: Rc<Module>,
1538 namespace: Namespace)
1539 -> ResolveResult<(Target, bool)> {
1540 debug!("(resolving item in lexical scope) resolving `{}` in \
1541 namespace {:?} in `{}`",
1544 module_to_string(&*module_));
1546 // The current module node is handled specially. First, check for
1547 // its immediate children.
1548 build_reduced_graph::populate_module_if_necessary(self, &module_);
1550 match module_.children.borrow().get(&name) {
1552 if name_bindings.defined_in_namespace(namespace) => {
1553 debug!("top name bindings succeeded");
1554 return Success((Target::new(module_.clone(),
1555 name_bindings.clone(),
1559 Some(_) | None => { /* Not found; continue. */ }
1562 // Now check for its import directives. We don't have to have resolved
1563 // all its imports in the usual way; this is because chains of
1564 // adjacent import statements are processed as though they mutated the
1566 if let Some(import_resolution) = module_.import_resolutions.borrow().get(&name) {
1567 match (*import_resolution).target_for_namespace(namespace) {
1569 // Not found; continue.
1570 debug!("(resolving item in lexical scope) found \
1571 import resolution, but not in namespace {:?}",
1575 debug!("(resolving item in lexical scope) using \
1576 import resolution");
1577 // track used imports and extern crates as well
1578 let id = import_resolution.id(namespace);
1579 self.used_imports.insert((id, namespace));
1580 self.record_import_use(id, name);
1581 if let Some(DefId{krate: kid, ..}) = target.target_module.def_id.get() {
1582 self.used_crates.insert(kid);
1584 return Success((target, false));
1589 // Search for external modules.
1590 if namespace == TypeNS {
1591 // FIXME (21114): In principle unclear `child` *has* to be lifted.
1592 let child = module_.external_module_children.borrow().get(&name).cloned();
1593 if let Some(module) = child {
1595 Rc::new(Resolver::create_name_bindings_from_module(module));
1596 debug!("lower name bindings succeeded");
1597 return Success((Target::new(module_,
1604 // Finally, proceed up the scope chain looking for parent modules.
1605 let mut search_module = module_;
1607 // Go to the next parent.
1608 match search_module.parent_link.clone() {
1610 // No more parents. This module was unresolved.
1611 debug!("(resolving item in lexical scope) unresolved \
1613 return Failed(None);
1615 ModuleParentLink(parent_module_node, _) => {
1616 match search_module.kind.get() {
1617 NormalModuleKind => {
1618 // We stop the search here.
1619 debug!("(resolving item in lexical \
1620 scope) unresolved module: not \
1621 searching through module \
1623 return Failed(None);
1628 AnonymousModuleKind => {
1629 search_module = parent_module_node.upgrade().unwrap();
1633 BlockParentLink(ref parent_module_node, _) => {
1634 search_module = parent_module_node.upgrade().unwrap();
1638 // Resolve the name in the parent module.
1639 match self.resolve_name_in_module(search_module.clone(),
1644 Failed(Some((span, msg))) => {
1645 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
1647 Failed(None) => (), // Continue up the search chain.
1649 // We couldn't see through the higher scope because of an
1650 // unresolved import higher up. Bail.
1652 debug!("(resolving item in lexical scope) indeterminate \
1653 higher scope; bailing");
1654 return Indeterminate;
1656 Success((target, used_reexport)) => {
1657 // We found the module.
1658 debug!("(resolving item in lexical scope) found name \
1660 return Success((target, used_reexport));
1666 /// Resolves a module name in the current lexical scope.
1667 fn resolve_module_in_lexical_scope(&mut self,
1668 module_: Rc<Module>,
1670 -> ResolveResult<Rc<Module>> {
1671 // If this module is an anonymous module, resolve the item in the
1672 // lexical scope. Otherwise, resolve the item from the crate root.
1673 let resolve_result = self.resolve_item_in_lexical_scope(module_, name, TypeNS);
1674 match resolve_result {
1675 Success((target, _)) => {
1676 let bindings = &*target.bindings;
1677 match *bindings.type_def.borrow() {
1678 Some(ref type_def) => {
1679 match type_def.module_def {
1681 debug!("!!! (resolving module in lexical \
1682 scope) module wasn't actually a \
1684 return Failed(None);
1686 Some(ref module_def) => {
1687 return Success(module_def.clone());
1692 debug!("!!! (resolving module in lexical scope) module
1693 wasn't actually a module!");
1694 return Failed(None);
1699 debug!("(resolving module in lexical scope) indeterminate; \
1701 return Indeterminate;
1704 debug!("(resolving module in lexical scope) failed to resolve");
1710 /// Returns the nearest normal module parent of the given module.
1711 fn get_nearest_normal_module_parent(&mut self, module_: Rc<Module>)
1712 -> Option<Rc<Module>> {
1713 let mut module_ = module_;
1715 match module_.parent_link.clone() {
1716 NoParentLink => return None,
1717 ModuleParentLink(new_module, _) |
1718 BlockParentLink(new_module, _) => {
1719 let new_module = new_module.upgrade().unwrap();
1720 match new_module.kind.get() {
1721 NormalModuleKind => return Some(new_module),
1725 AnonymousModuleKind => module_ = new_module,
1732 /// Returns the nearest normal module parent of the given module, or the
1733 /// module itself if it is a normal module.
1734 fn get_nearest_normal_module_parent_or_self(&mut self, module_: Rc<Module>)
1736 match module_.kind.get() {
1737 NormalModuleKind => return module_,
1741 AnonymousModuleKind => {
1742 match self.get_nearest_normal_module_parent(module_.clone()) {
1744 Some(new_module) => new_module
1750 /// Resolves a "module prefix". A module prefix is one or both of (a) `self::`;
1751 /// (b) some chain of `super::`.
1752 /// grammar: (SELF MOD_SEP ) ? (SUPER MOD_SEP) *
1753 fn resolve_module_prefix(&mut self,
1754 module_: Rc<Module>,
1755 module_path: &[Name])
1756 -> ResolveResult<ModulePrefixResult> {
1757 // Start at the current module if we see `self` or `super`, or at the
1758 // top of the crate otherwise.
1759 let mut i = match &*module_path[0].as_str() {
1762 _ => return Success(NoPrefixFound),
1764 let mut containing_module = self.get_nearest_normal_module_parent_or_self(module_);
1766 // Now loop through all the `super`s we find.
1767 while i < module_path.len() && "super" == module_path[i].as_str() {
1768 debug!("(resolving module prefix) resolving `super` at {}",
1769 module_to_string(&*containing_module));
1770 match self.get_nearest_normal_module_parent(containing_module) {
1771 None => return Failed(None),
1772 Some(new_module) => {
1773 containing_module = new_module;
1779 debug!("(resolving module prefix) finished resolving prefix at {}",
1780 module_to_string(&*containing_module));
1782 return Success(PrefixFound(containing_module, i));
1785 /// Attempts to resolve the supplied name in the given module for the
1786 /// given namespace. If successful, returns the target corresponding to
1789 /// The boolean returned on success is an indicator of whether this lookup
1790 /// passed through a public re-export proxy.
1791 fn resolve_name_in_module(&mut self,
1792 module_: Rc<Module>,
1794 namespace: Namespace,
1795 name_search_type: NameSearchType,
1796 allow_private_imports: bool)
1797 -> ResolveResult<(Target, bool)> {
1798 debug!("(resolving name in module) resolving `{}` in `{}`",
1800 module_to_string(&*module_));
1802 // First, check the direct children of the module.
1803 build_reduced_graph::populate_module_if_necessary(self, &module_);
1805 match module_.children.borrow().get(&name) {
1807 if name_bindings.defined_in_namespace(namespace) => {
1808 debug!("(resolving name in module) found node as child");
1809 return Success((Target::new(module_.clone(),
1810 name_bindings.clone(),
1819 // Next, check the module's imports if necessary.
1821 // If this is a search of all imports, we should be done with glob
1822 // resolution at this point.
1823 if name_search_type == PathSearch {
1824 assert_eq!(module_.glob_count.get(), 0);
1827 // Check the list of resolved imports.
1828 match module_.import_resolutions.borrow().get(&name) {
1829 Some(import_resolution) if allow_private_imports ||
1830 import_resolution.is_public => {
1832 if import_resolution.is_public &&
1833 import_resolution.outstanding_references != 0 {
1834 debug!("(resolving name in module) import \
1835 unresolved; bailing out");
1836 return Indeterminate;
1838 match import_resolution.target_for_namespace(namespace) {
1840 debug!("(resolving name in module) name found, \
1841 but not in namespace {:?}",
1845 debug!("(resolving name in module) resolved to \
1847 // track used imports and extern crates as well
1848 let id = import_resolution.id(namespace);
1849 self.used_imports.insert((id, namespace));
1850 self.record_import_use(id, name);
1851 if let Some(DefId{krate: kid, ..}) = target.target_module.def_id.get() {
1852 self.used_crates.insert(kid);
1854 return Success((target, true));
1858 Some(..) | None => {} // Continue.
1861 // Finally, search through external children.
1862 if namespace == TypeNS {
1863 // FIXME (21114): In principle unclear `child` *has* to be lifted.
1864 let child = module_.external_module_children.borrow().get(&name).cloned();
1865 if let Some(module) = child {
1867 Rc::new(Resolver::create_name_bindings_from_module(module));
1868 return Success((Target::new(module_,
1875 // We're out of luck.
1876 debug!("(resolving name in module) failed to resolve `{}`",
1878 return Failed(None);
1881 fn report_unresolved_imports(&mut self, module_: Rc<Module>) {
1882 let index = module_.resolved_import_count.get();
1883 let imports = module_.imports.borrow();
1884 let import_count = imports.len();
1885 if index != import_count {
1887 (*imports)[index].span,
1888 ResolutionError::UnresolvedImport(None));
1891 // Descend into children and anonymous children.
1892 build_reduced_graph::populate_module_if_necessary(self, &module_);
1894 for (_, child_node) in module_.children.borrow().iter() {
1895 match child_node.get_module_if_available() {
1899 Some(child_module) => {
1900 self.report_unresolved_imports(child_module);
1905 for (_, module_) in module_.anonymous_children.borrow().iter() {
1906 self.report_unresolved_imports(module_.clone());
1912 // We maintain a list of value ribs and type ribs.
1914 // Simultaneously, we keep track of the current position in the module
1915 // graph in the `current_module` pointer. When we go to resolve a name in
1916 // the value or type namespaces, we first look through all the ribs and
1917 // then query the module graph. When we resolve a name in the module
1918 // namespace, we can skip all the ribs (since nested modules are not
1919 // allowed within blocks in Rust) and jump straight to the current module
1922 // Named implementations are handled separately. When we find a method
1923 // call, we consult the module node to find all of the implementations in
1924 // scope. This information is lazily cached in the module node. We then
1925 // generate a fake "implementation scope" containing all the
1926 // implementations thus found, for compatibility with old resolve pass.
1928 fn with_scope<F>(&mut self, name: Option<Name>, f: F) where
1929 F: FnOnce(&mut Resolver),
1931 let orig_module = self.current_module.clone();
1933 // Move down in the graph.
1939 build_reduced_graph::populate_module_if_necessary(self, &orig_module);
1941 match orig_module.children.borrow().get(&name) {
1943 debug!("!!! (with scope) didn't find `{}` in `{}`",
1945 module_to_string(&*orig_module));
1947 Some(name_bindings) => {
1948 match (*name_bindings).get_module_if_available() {
1950 debug!("!!! (with scope) didn't find module \
1953 module_to_string(&*orig_module));
1956 self.current_module = module_;
1966 self.current_module = orig_module;
1969 /// Wraps the given definition in the appropriate number of `DefUpvar`
1975 -> Option<DefLike> {
1976 let mut def = match def_like {
1978 _ => return Some(def_like)
1982 self.session.span_bug(span,
1983 &format!("unexpected {:?} in bindings", def))
1985 DefLocal(node_id) => {
1989 // Nothing to do. Continue.
1991 ClosureRibKind(function_id) => {
1994 let mut seen = self.freevars_seen.borrow_mut();
1995 let seen = seen.entry(function_id).or_insert_with(|| NodeMap());
1996 if let Some(&index) = seen.get(&node_id) {
1997 def = DefUpvar(node_id, index, function_id);
2000 let mut freevars = self.freevars.borrow_mut();
2001 let vec = freevars.entry(function_id)
2002 .or_insert_with(|| vec![]);
2003 let depth = vec.len();
2004 vec.push(Freevar { def: prev_def, span: span });
2006 def = DefUpvar(node_id, depth, function_id);
2007 seen.insert(node_id, depth);
2009 ItemRibKind | MethodRibKind => {
2010 // This was an attempt to access an upvar inside a
2011 // named function item. This is not allowed, so we
2016 ResolutionError::CannotCaptureDynamicEnvironmentInFnItem
2020 ConstantItemRibKind => {
2021 // Still doesn't deal with upvars
2025 ResolutionError::AttemptToUseNonConstantValueInConstant
2032 DefTyParam(..) | DefSelfTy(..) => {
2035 NormalRibKind | MethodRibKind | ClosureRibKind(..) => {
2036 // Nothing to do. Continue.
2039 // This was an attempt to use a type parameter outside
2044 ResolutionError::TypeParametersFromOuterFunction);
2047 ConstantItemRibKind => {
2049 resolve_error(self, span, ResolutionError::OuterTypeParameterContext);
2060 /// Searches the current set of local scopes and
2061 /// applies translations for closures.
2062 fn search_ribs(&self,
2066 -> Option<DefLike> {
2067 // FIXME #4950: Try caching?
2069 for (i, rib) in ribs.iter().enumerate().rev() {
2070 if let Some(def_like) = rib.bindings.get(&name).cloned() {
2071 return self.upvarify(&ribs[i + 1..], def_like, span);
2078 /// Searches the current set of local scopes for labels.
2079 /// Stops after meeting a closure.
2080 fn search_label(&self, name: Name) -> Option<DefLike> {
2081 for rib in self.label_ribs.iter().rev() {
2087 // Do not resolve labels across function boundary
2091 let result = rib.bindings.get(&name).cloned();
2092 if result.is_some() {
2099 fn resolve_crate(&mut self, krate: &hir::Crate) {
2100 debug!("(resolving crate) starting");
2102 visit::walk_crate(self, krate);
2105 fn check_if_primitive_type_name(&self, name: Name, span: Span) {
2106 if let Some(_) = self.primitive_type_table.primitive_types.get(&name) {
2107 span_err!(self.session, span, E0317,
2108 "user-defined types or type parameters cannot shadow the primitive types");
2112 fn resolve_item(&mut self, item: &Item) {
2113 let name = item.ident.name;
2115 debug!("(resolving item) resolving {}",
2119 ItemEnum(_, ref generics) |
2120 ItemTy(_, ref generics) |
2121 ItemStruct(_, ref generics) => {
2122 self.check_if_primitive_type_name(name, item.span);
2124 self.with_type_parameter_rib(HasTypeParameters(generics,
2127 |this| visit::walk_item(this, item));
2129 ItemFn(_, _, _, _, ref generics, _) => {
2130 self.with_type_parameter_rib(HasTypeParameters(generics,
2133 |this| visit::walk_item(this, item));
2136 ItemDefaultImpl(_, ref trait_ref) => {
2137 self.with_optional_trait_ref(Some(trait_ref), |_, _| {});
2144 ref impl_items) => {
2145 self.resolve_implementation(generics,
2152 ItemTrait(_, ref generics, ref bounds, ref trait_items) => {
2153 self.check_if_primitive_type_name(name, item.span);
2155 // Create a new rib for the trait-wide type parameters.
2156 self.with_type_parameter_rib(HasTypeParameters(generics,
2160 this.with_self_rib(DefSelfTy(Some(DefId::local(item.id)), None), |this| {
2161 this.visit_generics(generics);
2162 visit::walk_ty_param_bounds_helper(this, bounds);
2164 for trait_item in trait_items {
2165 match trait_item.node {
2166 hir::ConstTraitItem(_, ref default) => {
2167 // Only impose the restrictions of
2168 // ConstRibKind if there's an actual constant
2169 // expression in a provided default.
2170 if default.is_some() {
2171 this.with_constant_rib(|this| {
2172 visit::walk_trait_item(this, trait_item)
2175 visit::walk_trait_item(this, trait_item)
2178 hir::MethodTraitItem(ref sig, _) => {
2179 let type_parameters =
2180 HasTypeParameters(&sig.generics,
2183 this.with_type_parameter_rib(type_parameters, |this| {
2184 visit::walk_trait_item(this, trait_item)
2187 hir::TypeTraitItem(..) => {
2188 this.check_if_primitive_type_name(trait_item.ident.name,
2190 this.with_type_parameter_rib(NoTypeParameters, |this| {
2191 visit::walk_trait_item(this, trait_item)
2200 ItemMod(_) | ItemForeignMod(_) => {
2201 self.with_scope(Some(name), |this| {
2202 visit::walk_item(this, item);
2206 ItemConst(..) | ItemStatic(..) => {
2207 self.with_constant_rib(|this| {
2208 visit::walk_item(this, item);
2212 ItemUse(ref view_path) => {
2213 // check for imports shadowing primitive types
2214 let check_rename = |id, ident: Ident| {
2215 match self.def_map.borrow().get(&id).map(|d| d.full_def()) {
2216 Some(DefTy(..)) | Some(DefStruct(..)) | Some(DefTrait(..)) | None => {
2217 self.check_if_primitive_type_name(ident.name, item.span);
2223 match view_path.node {
2224 hir::ViewPathSimple(ident, _) => {
2225 check_rename(item.id, ident);
2227 hir::ViewPathList(_, ref items) => {
2229 if let Some(ident) = item.node.rename() {
2230 check_rename(item.node.id(), ident);
2238 ItemExternCrate(_) => {
2239 // do nothing, these are just around to be encoded
2244 fn with_type_parameter_rib<F>(&mut self, type_parameters: TypeParameters, f: F) where
2245 F: FnOnce(&mut Resolver),
2247 match type_parameters {
2248 HasTypeParameters(generics, space, rib_kind) => {
2249 let mut function_type_rib = Rib::new(rib_kind);
2250 let mut seen_bindings = HashSet::new();
2251 for (index, type_parameter) in generics.ty_params.iter().enumerate() {
2252 let name = type_parameter.ident.name;
2253 debug!("with_type_parameter_rib: {}", type_parameter.id);
2255 if seen_bindings.contains(&name) {
2257 type_parameter.span,
2258 ResolutionError::NameAlreadyUsedInTypeParameterList(
2262 seen_bindings.insert(name);
2264 // plain insert (no renaming)
2265 function_type_rib.bindings.insert(name,
2266 DlDef(DefTyParam(space,
2268 DefId::local(type_parameter.id),
2271 self.type_ribs.push(function_type_rib);
2274 NoTypeParameters => {
2281 match type_parameters {
2282 HasTypeParameters(..) => { if !self.resolved { self.type_ribs.pop(); } }
2283 NoTypeParameters => { }
2287 fn with_label_rib<F>(&mut self, f: F) where
2288 F: FnOnce(&mut Resolver),
2290 self.label_ribs.push(Rib::new(NormalRibKind));
2293 self.label_ribs.pop();
2297 fn with_constant_rib<F>(&mut self, f: F) where
2298 F: FnOnce(&mut Resolver),
2300 self.value_ribs.push(Rib::new(ConstantItemRibKind));
2301 self.type_ribs.push(Rib::new(ConstantItemRibKind));
2304 self.type_ribs.pop();
2305 self.value_ribs.pop();
2309 fn resolve_function(&mut self,
2311 declaration: &FnDecl,
2313 // Create a value rib for the function.
2314 self.value_ribs.push(Rib::new(rib_kind));
2316 // Create a label rib for the function.
2317 self.label_ribs.push(Rib::new(rib_kind));
2319 // Add each argument to the rib.
2320 let mut bindings_list = HashMap::new();
2321 for argument in &declaration.inputs {
2322 self.resolve_pattern(&*argument.pat,
2323 ArgumentIrrefutableMode,
2324 &mut bindings_list);
2326 self.visit_ty(&*argument.ty);
2328 debug!("(resolving function) recorded argument");
2330 visit::walk_fn_ret_ty(self, &declaration.output);
2332 // Resolve the function body.
2333 self.visit_block(&*block);
2335 debug!("(resolving function) leaving function");
2338 self.label_ribs.pop();
2339 self.value_ribs.pop();
2343 fn resolve_trait_reference(&mut self,
2347 -> Result<PathResolution, ()> {
2348 if let Some(path_res) = self.resolve_path(id, trait_path, path_depth, TypeNS, true) {
2349 if let DefTrait(_) = path_res.base_def {
2350 debug!("(resolving trait) found trait def: {:?}", path_res);
2355 ResolutionError::IsNotATrait(&*path_names_to_string(trait_path,
2359 // If it's a typedef, give a note
2360 if let DefTy(..) = path_res.base_def {
2361 self.session.span_note(trait_path.span,
2362 "`type` aliases cannot be used for traits");
2369 ResolutionError::UndeclaredTraitName(
2370 &*path_names_to_string(trait_path, path_depth))
2376 fn resolve_generics(&mut self, generics: &Generics) {
2377 for type_parameter in generics.ty_params.iter() {
2378 self.check_if_primitive_type_name(type_parameter.ident.name, type_parameter.span);
2380 for predicate in &generics.where_clause.predicates {
2382 &hir::WherePredicate::BoundPredicate(_) |
2383 &hir::WherePredicate::RegionPredicate(_) => {}
2384 &hir::WherePredicate::EqPredicate(ref eq_pred) => {
2385 let path_res = self.resolve_path(eq_pred.id, &eq_pred.path, 0, TypeNS, true);
2386 if let Some(PathResolution { base_def: DefTyParam(..), .. }) = path_res {
2387 self.record_def(eq_pred.id, path_res.unwrap());
2391 ResolutionError::UndeclaredAssociatedType);
2396 visit::walk_generics(self, generics);
2399 fn with_current_self_type<T, F>(&mut self, self_type: &Ty, f: F) -> T
2400 where F: FnOnce(&mut Resolver) -> T
2402 // Handle nested impls (inside fn bodies)
2403 let previous_value = replace(&mut self.current_self_type, Some(self_type.clone()));
2404 let result = f(self);
2405 self.current_self_type = previous_value;
2409 fn with_optional_trait_ref<T, F>(&mut self,
2410 opt_trait_ref: Option<&TraitRef>,
2413 where F: FnOnce(&mut Resolver, Option<DefId>) -> T
2415 let mut new_val = None;
2416 let mut new_id = None;
2417 if let Some(trait_ref) = opt_trait_ref {
2418 if let Ok(path_res) = self.resolve_trait_reference(trait_ref.ref_id,
2419 &trait_ref.path, 0) {
2420 assert!(path_res.depth == 0);
2421 self.record_def(trait_ref.ref_id, path_res);
2422 new_val = Some((path_res.base_def.def_id(), trait_ref.clone()));
2423 new_id = Some(path_res.base_def.def_id());
2425 visit::walk_trait_ref(self, trait_ref);
2427 let original_trait_ref = replace(&mut self.current_trait_ref, new_val);
2428 let result = f(self, new_id);
2429 self.current_trait_ref = original_trait_ref;
2433 fn with_self_rib<F>(&mut self, self_def: Def, f: F)
2434 where F: FnOnce(&mut Resolver)
2436 let mut self_type_rib = Rib::new(NormalRibKind);
2438 // plain insert (no renaming, types are not currently hygienic....)
2439 let name = special_names::type_self;
2440 self_type_rib.bindings.insert(name, DlDef(self_def));
2441 self.type_ribs.push(self_type_rib);
2444 self.type_ribs.pop();
2448 fn resolve_implementation(&mut self,
2449 generics: &Generics,
2450 opt_trait_reference: &Option<TraitRef>,
2453 impl_items: &[P<ImplItem>]) {
2454 // If applicable, create a rib for the type parameters.
2455 self.with_type_parameter_rib(HasTypeParameters(generics,
2459 // Resolve the type parameters.
2460 this.visit_generics(generics);
2462 // Resolve the trait reference, if necessary.
2463 this.with_optional_trait_ref(opt_trait_reference.as_ref(), |this, trait_id| {
2464 // Resolve the self type.
2465 this.visit_ty(self_type);
2467 this.with_self_rib(DefSelfTy(trait_id, Some((item_id, self_type.id))), |this| {
2468 this.with_current_self_type(self_type, |this| {
2469 for impl_item in impl_items {
2470 match impl_item.node {
2471 ConstImplItem(..) => {
2472 // If this is a trait impl, ensure the const
2474 this.check_trait_item(impl_item.ident.name,
2476 |n, s| ResolutionError::ConstNotMemberOfTrait(n, s));
2477 this.with_constant_rib(|this| {
2478 visit::walk_impl_item(this, impl_item);
2481 MethodImplItem(ref sig, _) => {
2482 // If this is a trait impl, ensure the method
2484 this.check_trait_item(impl_item.ident.name,
2486 |n, s| ResolutionError::MethodNotMemberOfTrait(n, s));
2488 // We also need a new scope for the method-
2489 // specific type parameters.
2490 let type_parameters =
2491 HasTypeParameters(&sig.generics,
2494 this.with_type_parameter_rib(type_parameters, |this| {
2495 visit::walk_impl_item(this, impl_item);
2498 TypeImplItem(ref ty) => {
2499 // If this is a trait impl, ensure the type
2501 this.check_trait_item(impl_item.ident.name,
2503 |n, s| ResolutionError::TypeNotMemberOfTrait(n, s));
2515 fn check_trait_item<F>(&self, name: Name, span: Span, err: F)
2516 where F: FnOnce(Name, &str) -> ResolutionError {
2517 // If there is a TraitRef in scope for an impl, then the method must be in the trait.
2518 if let Some((did, ref trait_ref)) = self.current_trait_ref {
2519 if !self.trait_item_map.contains_key(&(name, did)) {
2520 let path_str = path_names_to_string(&trait_ref.path, 0);
2523 err(name, &*path_str));
2528 fn resolve_local(&mut self, local: &Local) {
2529 // Resolve the type.
2530 visit::walk_ty_opt(self, &local.ty);
2532 // Resolve the initializer.
2533 visit::walk_expr_opt(self, &local.init);
2535 // Resolve the pattern.
2536 self.resolve_pattern(&*local.pat,
2537 LocalIrrefutableMode,
2538 &mut HashMap::new());
2541 // build a map from pattern identifiers to binding-info's.
2542 // this is done hygienically. This could arise for a macro
2543 // that expands into an or-pattern where one 'x' was from the
2544 // user and one 'x' came from the macro.
2545 fn binding_mode_map(&mut self, pat: &Pat) -> BindingMap {
2546 let mut result = HashMap::new();
2547 pat_bindings(&self.def_map, pat, |binding_mode, _id, sp, path1| {
2548 let name = mtwt::resolve(path1.node);
2549 result.insert(name, BindingInfo {
2551 binding_mode: binding_mode
2557 // check that all of the arms in an or-pattern have exactly the
2558 // same set of bindings, with the same binding modes for each.
2559 fn check_consistent_bindings(&mut self, arm: &Arm) {
2560 if arm.pats.is_empty() {
2563 let map_0 = self.binding_mode_map(&*arm.pats[0]);
2564 for (i, p) in arm.pats.iter().enumerate() {
2565 let map_i = self.binding_mode_map(&**p);
2567 for (&key, &binding_0) in &map_0 {
2568 match map_i.get(&key) {
2572 ResolutionError::VariableNotBoundInPattern(key,
2575 Some(binding_i) => {
2576 if binding_0.binding_mode != binding_i.binding_mode {
2579 ResolutionError::VariableBoundWithDifferentMode(key,
2587 for (&key, &binding) in &map_i {
2588 if !map_0.contains_key(&key) {
2591 ResolutionError::VariableNotBoundInParentPattern(key,
2598 fn resolve_arm(&mut self, arm: &Arm) {
2599 self.value_ribs.push(Rib::new(NormalRibKind));
2601 let mut bindings_list = HashMap::new();
2602 for pattern in &arm.pats {
2603 self.resolve_pattern(&**pattern, RefutableMode, &mut bindings_list);
2606 // This has to happen *after* we determine which
2607 // pat_idents are variants
2608 self.check_consistent_bindings(arm);
2610 visit::walk_expr_opt(self, &arm.guard);
2611 self.visit_expr(&*arm.body);
2614 self.value_ribs.pop();
2618 fn resolve_block(&mut self, block: &Block) {
2619 debug!("(resolving block) entering block");
2620 self.value_ribs.push(Rib::new(NormalRibKind));
2622 // Move down in the graph, if there's an anonymous module rooted here.
2623 let orig_module = self.current_module.clone();
2624 match orig_module.anonymous_children.borrow().get(&block.id) {
2625 None => { /* Nothing to do. */ }
2626 Some(anonymous_module) => {
2627 debug!("(resolving block) found anonymous module, moving \
2629 self.current_module = anonymous_module.clone();
2633 // Check for imports appearing after non-item statements.
2634 let mut found_non_item = false;
2635 for statement in &block.stmts {
2636 if let hir::StmtDecl(ref declaration, _) = statement.node {
2637 if let hir::DeclItem(ref i) = declaration.node {
2639 ItemExternCrate(_) | ItemUse(_) if found_non_item => {
2640 span_err!(self.session, i.span, E0154,
2641 "imports are not allowed after non-item statements");
2646 found_non_item = true
2649 found_non_item = true;
2653 // Descend into the block.
2654 visit::walk_block(self, block);
2658 self.current_module = orig_module;
2659 self.value_ribs.pop();
2661 debug!("(resolving block) leaving block");
2664 fn resolve_type(&mut self, ty: &Ty) {
2666 TyPath(ref maybe_qself, ref path) => {
2668 match self.resolve_possibly_assoc_item(ty.id,
2669 maybe_qself.as_ref(),
2673 // `<T>::a::b::c` is resolved by typeck alone.
2674 TypecheckRequired => {
2675 // Resolve embedded types.
2676 visit::walk_ty(self, ty);
2679 ResolveAttempt(resolution) => resolution,
2682 // This is a path in the type namespace. Walk through scopes
2686 // Write the result into the def map.
2687 debug!("(resolving type) writing resolution for `{}` \
2689 path_names_to_string(path, 0),
2691 self.record_def(ty.id, def);
2694 // Keep reporting some errors even if they're ignored above.
2695 self.resolve_path(ty.id, path, 0, TypeNS, true);
2697 let kind = if maybe_qself.is_some() {
2703 let self_type_name = special_idents::type_self.name;
2704 let is_invalid_self_type_name =
2705 path.segments.len() > 0 &&
2706 maybe_qself.is_none() &&
2707 path.segments[0].identifier.name == self_type_name;
2708 if is_invalid_self_type_name {
2711 ResolutionError::SelfUsedOutsideImplOrTrait);
2715 ResolutionError::UseOfUndeclared(
2717 &*path_names_to_string(path,
2726 // Resolve embedded types.
2727 visit::walk_ty(self, ty);
2730 fn resolve_pattern(&mut self,
2732 mode: PatternBindingMode,
2733 // Maps idents to the node ID for the (outermost)
2734 // pattern that binds them
2735 bindings_list: &mut HashMap<Name, NodeId>) {
2736 let pat_id = pattern.id;
2737 walk_pat(pattern, |pattern| {
2738 match pattern.node {
2739 PatIdent(binding_mode, ref path1, ref at_rhs) => {
2740 // The meaning of PatIdent with no type parameters
2741 // depends on whether an enum variant or unit-like struct
2742 // with that name is in scope. The probing lookup has to
2743 // be careful not to emit spurious errors. Only matching
2744 // patterns (match) can match nullary variants or
2745 // unit-like structs. For binding patterns (let
2746 // and the LHS of @-patterns), matching such a value is
2747 // simply disallowed (since it's rarely what you want).
2748 let const_ok = mode == RefutableMode && at_rhs.is_none();
2750 let ident = path1.node;
2751 let renamed = mtwt::resolve(ident);
2753 match self.resolve_bare_identifier_pattern(ident.name, pattern.span) {
2754 FoundStructOrEnumVariant(def, lp) if const_ok => {
2755 debug!("(resolving pattern) resolving `{}` to \
2756 struct or enum variant",
2759 self.enforce_default_binding_mode(
2763 self.record_def(pattern.id, PathResolution {
2769 FoundStructOrEnumVariant(..) => {
2773 ResolutionError::DeclarationShadowsEnumVariantOrUnitLikeStruct(
2777 FoundConst(def, lp) if const_ok => {
2778 debug!("(resolving pattern) resolving `{}` to \
2782 self.enforce_default_binding_mode(
2786 self.record_def(pattern.id, PathResolution {
2796 ResolutionError::OnlyIrrefutablePatternsAllowedHere
2799 BareIdentifierPatternUnresolved => {
2800 debug!("(resolving pattern) binding `{}`",
2803 let def = DefLocal(pattern.id);
2805 // Record the definition so that later passes
2806 // will be able to distinguish variants from
2807 // locals in patterns.
2809 self.record_def(pattern.id, PathResolution {
2811 last_private: LastMod(AllPublic),
2815 // Add the binding to the local ribs, if it
2816 // doesn't already exist in the bindings list. (We
2817 // must not add it if it's in the bindings list
2818 // because that breaks the assumptions later
2819 // passes make about or-patterns.)
2820 if !bindings_list.contains_key(&renamed) {
2821 let this = &mut *self;
2822 let last_rib = this.value_ribs.last_mut().unwrap();
2823 last_rib.bindings.insert(renamed, DlDef(def));
2824 bindings_list.insert(renamed, pat_id);
2825 } else if mode == ArgumentIrrefutableMode &&
2826 bindings_list.contains_key(&renamed) {
2827 // Forbid duplicate bindings in the same
2832 ResolutionError::IdentifierBoundMoreThanOnceInParameterList(
2833 &ident.name.as_str())
2835 } else if bindings_list.get(&renamed) ==
2837 // Then this is a duplicate variable in the
2838 // same disjunction, which is an error.
2842 ResolutionError::IdentifierBoundMoreThanOnceInSamePattern(
2843 &ident.name.as_str())
2846 // Else, not bound in the same pattern: do
2852 PatEnum(ref path, _) => {
2853 // This must be an enum variant, struct or const.
2855 match self.resolve_possibly_assoc_item(pat_id, None,
2858 // The below shouldn't happen because all
2859 // qualified paths should be in PatQPath.
2860 TypecheckRequired =>
2861 self.session.span_bug(
2863 "resolve_possibly_assoc_item claimed
2864 that a path in PatEnum requires typecheck
2865 to resolve, but qualified paths should be
2867 ResolveAttempt(resolution) => resolution,
2869 if let Some(path_res) = resolution {
2870 match path_res.base_def {
2871 DefVariant(..) | DefStruct(..) | DefConst(..) => {
2872 self.record_def(pattern.id, path_res);
2875 resolve_error(&self,
2877 ResolutionError::StaticVariableReference);
2880 // If anything ends up here entirely resolved,
2881 // it's an error. If anything ends up here
2882 // partially resolved, that's OK, because it may
2883 // be a `T::CONST` that typeck will resolve.
2884 if path_res.depth == 0 {
2888 ResolutionError::NotAnEnumVariantStructOrConst(
2897 let const_name = path.segments.last().unwrap()
2899 let traits = self.get_traits_containing_item(const_name);
2900 self.trait_map.insert(pattern.id, traits);
2901 self.record_def(pattern.id, path_res);
2909 ResolutionError::UnresolvedEnumVariantStructOrConst(
2910 &path.segments.last().unwrap().identifier.name.as_str())
2913 visit::walk_path(self, path);
2916 PatQPath(ref qself, ref path) => {
2917 // Associated constants only.
2919 match self.resolve_possibly_assoc_item(pat_id, Some(qself),
2922 TypecheckRequired => {
2923 // All `<T>::CONST` should end up here, and will
2924 // require use of the trait map to resolve
2925 // during typechecking.
2926 let const_name = path.segments.last().unwrap()
2928 let traits = self.get_traits_containing_item(const_name);
2929 self.trait_map.insert(pattern.id, traits);
2930 visit::walk_pat(self, pattern);
2933 ResolveAttempt(resolution) => resolution,
2935 if let Some(path_res) = resolution {
2936 match path_res.base_def {
2937 // All `<T as Trait>::CONST` should end up here, and
2938 // have the trait already selected.
2939 DefAssociatedConst(..) => {
2940 self.record_def(pattern.id, path_res);
2946 ResolutionError::NotAnAssociatedConst(
2947 &path.segments.last().unwrap().identifier.name.as_str()
2956 ResolutionError::UnresolvedAssociatedConst(
2957 &path.segments.last().unwrap().identifier.name.as_str()
2961 visit::walk_pat(self, pattern);
2964 PatStruct(ref path, _, _) => {
2965 match self.resolve_path(pat_id, path, 0, TypeNS, false) {
2966 Some(definition) => {
2967 self.record_def(pattern.id, definition);
2970 debug!("(resolving pattern) didn't find struct \
2971 def: {:?}", result);
2975 ResolutionError::DoesNotNameAStruct(
2976 &*path_names_to_string(path, 0))
2980 visit::walk_path(self, path);
2983 PatLit(_) | PatRange(..) => {
2984 visit::walk_pat(self, pattern);
2995 fn resolve_bare_identifier_pattern(&mut self, name: Name, span: Span)
2996 -> BareIdentifierPatternResolution {
2997 let module = self.current_module.clone();
2998 match self.resolve_item_in_lexical_scope(module,
3001 Success((target, _)) => {
3002 debug!("(resolve bare identifier pattern) succeeded in \
3003 finding {} at {:?}",
3005 target.bindings.value_def.borrow());
3006 match *target.bindings.value_def.borrow() {
3008 panic!("resolved name in the value namespace to a \
3009 set of name bindings with no def?!");
3012 // For the two success cases, this lookup can be
3013 // considered as not having a private component because
3014 // the lookup happened only within the current module.
3016 def @ DefVariant(..) | def @ DefStruct(..) => {
3017 return FoundStructOrEnumVariant(def, LastMod(AllPublic));
3019 def @ DefConst(..) | def @ DefAssociatedConst(..) => {
3020 return FoundConst(def, LastMod(AllPublic));
3025 ResolutionError::StaticVariableReference);
3026 return BareIdentifierPatternUnresolved;
3029 return BareIdentifierPatternUnresolved;
3037 panic!("unexpected indeterminate result");
3041 Some((span, msg)) => {
3042 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
3047 debug!("(resolve bare identifier pattern) failed to find {}",
3049 return BareIdentifierPatternUnresolved;
3054 /// Handles paths that may refer to associated items
3055 fn resolve_possibly_assoc_item(&mut self,
3057 maybe_qself: Option<&hir::QSelf>,
3059 namespace: Namespace,
3061 -> AssocItemResolveResult
3063 let max_assoc_types;
3067 if qself.position == 0 {
3068 return TypecheckRequired;
3070 max_assoc_types = path.segments.len() - qself.position;
3071 // Make sure the trait is valid.
3072 let _ = self.resolve_trait_reference(id, path, max_assoc_types);
3075 max_assoc_types = path.segments.len();
3079 let mut resolution = self.with_no_errors(|this| {
3080 this.resolve_path(id, path, 0, namespace, check_ribs)
3082 for depth in 1..max_assoc_types {
3083 if resolution.is_some() {
3086 self.with_no_errors(|this| {
3087 resolution = this.resolve_path(id, path, depth,
3091 if let Some(DefMod(_)) = resolution.map(|r| r.base_def) {
3092 // A module is not a valid type or value.
3095 ResolveAttempt(resolution)
3098 /// If `check_ribs` is true, checks the local definitions first; i.e.
3099 /// doesn't skip straight to the containing module.
3100 /// Skips `path_depth` trailing segments, which is also reflected in the
3101 /// returned value. See `middle::def::PathResolution` for more info.
3102 pub fn resolve_path(&mut self,
3106 namespace: Namespace,
3107 check_ribs: bool) -> Option<PathResolution> {
3108 let span = path.span;
3109 let segments = &path.segments[..path.segments.len()-path_depth];
3111 let mk_res = |(def, lp)| PathResolution::new(def, lp, path_depth);
3114 let def = self.resolve_crate_relative_path(span, segments, namespace);
3115 return def.map(mk_res);
3118 // Try to find a path to an item in a module.
3119 let unqualified_def =
3120 self.resolve_identifier(segments.last().unwrap().identifier,
3125 if segments.len() <= 1 {
3126 return unqualified_def.map(mk_res);
3129 let def = self.resolve_module_relative_path(span, segments, namespace);
3130 match (def, unqualified_def) {
3131 (Some((ref d, _)), Some((ref ud, _))) if *d == *ud => {
3133 .add_lint(lint::builtin::UNUSED_QUALIFICATIONS,
3135 "unnecessary qualification".to_string());
3143 // Resolve a single identifier.
3144 fn resolve_identifier(&mut self,
3146 namespace: Namespace,
3149 -> Option<(Def, LastPrivate)> {
3150 // First, check to see whether the name is a primitive type.
3151 if namespace == TypeNS {
3152 if let Some(&prim_ty) = self.primitive_type_table
3154 .get(&identifier.name) {
3155 return Some((DefPrimTy(prim_ty), LastMod(AllPublic)));
3160 if let Some(def) = self.resolve_identifier_in_local_ribs(identifier,
3163 return Some((def, LastMod(AllPublic)));
3167 self.resolve_item_by_name_in_lexical_scope(identifier.name, namespace)
3170 // FIXME #4952: Merge me with resolve_name_in_module?
3171 fn resolve_definition_of_name_in_module(&mut self,
3172 containing_module: Rc<Module>,
3174 namespace: Namespace)
3176 // First, search children.
3177 build_reduced_graph::populate_module_if_necessary(self, &containing_module);
3179 match containing_module.children.borrow().get(&name) {
3180 Some(child_name_bindings) => {
3181 match child_name_bindings.def_for_namespace(namespace) {
3183 // Found it. Stop the search here.
3184 let p = child_name_bindings.defined_in_public_namespace(namespace);
3185 let lp = if p {LastMod(AllPublic)} else {
3186 LastMod(DependsOn(def.def_id()))
3188 return ChildNameDefinition(def, lp);
3196 // Next, search import resolutions.
3197 match containing_module.import_resolutions.borrow().get(&name) {
3198 Some(import_resolution) if import_resolution.is_public => {
3199 if let Some(target) = (*import_resolution).target_for_namespace(namespace) {
3200 match target.bindings.def_for_namespace(namespace) {
3203 let id = import_resolution.id(namespace);
3204 // track imports and extern crates as well
3205 self.used_imports.insert((id, namespace));
3206 self.record_import_use(id, name);
3207 match target.target_module.def_id.get() {
3208 Some(DefId{krate: kid, ..}) => {
3209 self.used_crates.insert(kid);
3213 return ImportNameDefinition(def, LastMod(AllPublic));
3216 // This can happen with external impls, due to
3217 // the imperfect way we read the metadata.
3222 Some(..) | None => {} // Continue.
3225 // Finally, search through external children.
3226 if namespace == TypeNS {
3227 if let Some(module) = containing_module.external_module_children.borrow()
3228 .get(&name).cloned() {
3229 if let Some(def_id) = module.def_id.get() {
3230 // track used crates
3231 self.used_crates.insert(def_id.krate);
3232 let lp = if module.is_public {LastMod(AllPublic)} else {
3233 LastMod(DependsOn(def_id))
3235 return ChildNameDefinition(DefMod(def_id), lp);
3240 return NoNameDefinition;
3243 // resolve a "module-relative" path, e.g. a::b::c
3244 fn resolve_module_relative_path(&mut self,
3246 segments: &[hir::PathSegment],
3247 namespace: Namespace)
3248 -> Option<(Def, LastPrivate)> {
3249 let module_path = segments.split_last().unwrap().1.iter()
3250 .map(|ps| ps.identifier.name)
3251 .collect::<Vec<_>>();
3253 let containing_module;
3255 let current_module = self.current_module.clone();
3256 match self.resolve_module_path(current_module,
3262 let (span, msg) = match err {
3263 Some((span, msg)) => (span, msg),
3265 let msg = format!("Use of undeclared type or module `{}`",
3266 names_to_string(&module_path));
3271 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
3274 Indeterminate => panic!("indeterminate unexpected"),
3275 Success((resulting_module, resulting_last_private)) => {
3276 containing_module = resulting_module;
3277 last_private = resulting_last_private;
3281 let name = segments.last().unwrap().identifier.name;
3282 let def = match self.resolve_definition_of_name_in_module(containing_module.clone(),
3285 NoNameDefinition => {
3286 // We failed to resolve the name. Report an error.
3289 ChildNameDefinition(def, lp) | ImportNameDefinition(def, lp) => {
3290 (def, last_private.or(lp))
3293 if let Some(DefId{krate: kid, ..}) = containing_module.def_id.get() {
3294 self.used_crates.insert(kid);
3299 /// Invariant: This must be called only during main resolution, not during
3300 /// import resolution.
3301 fn resolve_crate_relative_path(&mut self,
3303 segments: &[hir::PathSegment],
3304 namespace: Namespace)
3305 -> Option<(Def, LastPrivate)> {
3306 let module_path = segments.split_last().unwrap().1.iter()
3307 .map(|ps| ps.identifier.name)
3308 .collect::<Vec<_>>();
3310 let root_module = self.graph_root.get_module();
3312 let containing_module;
3314 match self.resolve_module_path_from_root(root_module,
3319 LastMod(AllPublic)) {
3321 let (span, msg) = match err {
3322 Some((span, msg)) => (span, msg),
3324 let msg = format!("Use of undeclared module `::{}`",
3325 names_to_string(&module_path[..]));
3330 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg));
3335 panic!("indeterminate unexpected");
3338 Success((resulting_module, resulting_last_private)) => {
3339 containing_module = resulting_module;
3340 last_private = resulting_last_private;
3344 let name = segments.last().unwrap().identifier.name;
3345 match self.resolve_definition_of_name_in_module(containing_module,
3348 NoNameDefinition => {
3349 // We failed to resolve the name. Report an error.
3352 ChildNameDefinition(def, lp) | ImportNameDefinition(def, lp) => {
3353 return Some((def, last_private.or(lp)));
3358 fn resolve_identifier_in_local_ribs(&mut self,
3360 namespace: Namespace,
3363 // Check the local set of ribs.
3364 let search_result = match namespace {
3366 let renamed = mtwt::resolve(ident);
3367 self.search_ribs(&self.value_ribs, renamed, span)
3370 let name = ident.name;
3371 self.search_ribs(&self.type_ribs, name, span)
3375 match search_result {
3376 Some(DlDef(def)) => {
3377 debug!("(resolving path in local ribs) resolved `{}` to local: {:?}",
3382 Some(DlField) | Some(DlImpl(_)) | None => {
3388 fn resolve_item_by_name_in_lexical_scope(&mut self,
3390 namespace: Namespace)
3391 -> Option<(Def, LastPrivate)> {
3393 let module = self.current_module.clone();
3394 match self.resolve_item_in_lexical_scope(module,
3397 Success((target, _)) => {
3398 match (*target.bindings).def_for_namespace(namespace) {
3400 // This can happen if we were looking for a type and
3401 // found a module instead. Modules don't have defs.
3402 debug!("(resolving item path by identifier in lexical \
3403 scope) failed to resolve {} after success...",
3408 debug!("(resolving item path in lexical scope) \
3409 resolved `{}` to item",
3411 // This lookup is "all public" because it only searched
3412 // for one identifier in the current module (couldn't
3413 // have passed through reexports or anything like that.
3414 return Some((def, LastMod(AllPublic)));
3419 panic!("unexpected indeterminate result");
3422 debug!("(resolving item path by identifier in lexical scope) \
3423 failed to resolve {}", name);
3425 if let Some((span, msg)) = err {
3426 resolve_error(self, span, ResolutionError::FailedToResolve(&*msg))
3434 fn with_no_errors<T, F>(&mut self, f: F) -> T where
3435 F: FnOnce(&mut Resolver) -> T,
3437 self.emit_errors = false;
3439 self.emit_errors = true;
3443 fn find_fallback_in_self_type(&mut self, name: Name) -> FallbackSuggestion {
3444 fn extract_path_and_node_id(t: &Ty, allow: FallbackChecks)
3445 -> Option<(Path, NodeId, FallbackChecks)> {
3447 TyPath(None, ref path) => Some((path.clone(), t.id, allow)),
3448 TyPtr(ref mut_ty) => extract_path_and_node_id(&*mut_ty.ty, OnlyTraitAndStatics),
3449 TyRptr(_, ref mut_ty) => extract_path_and_node_id(&*mut_ty.ty, allow),
3450 // This doesn't handle the remaining `Ty` variants as they are not
3451 // that commonly the self_type, it might be interesting to provide
3452 // support for those in future.
3457 fn get_module(this: &mut Resolver, span: Span, name_path: &[ast::Name])
3458 -> Option<Rc<Module>> {
3459 let root = this.current_module.clone();
3460 let last_name = name_path.last().unwrap();
3462 if name_path.len() == 1 {
3463 match this.primitive_type_table.primitive_types.get(last_name) {
3466 match this.current_module.children.borrow().get(last_name) {
3467 Some(child) => child.get_module_if_available(),
3473 match this.resolve_module_path(root,
3478 Success((module, _)) => Some(module),
3484 fn is_static_method(this: &Resolver, did: DefId) -> bool {
3486 let sig = match this.ast_map.get(did.node) {
3487 hir_map::NodeTraitItem(trait_item) => match trait_item.node {
3488 hir::MethodTraitItem(ref sig, _) => sig,
3491 hir_map::NodeImplItem(impl_item) => match impl_item.node {
3492 hir::MethodImplItem(ref sig, _) => sig,
3497 sig.explicit_self.node == hir::SelfStatic
3499 csearch::is_static_method(&this.session.cstore, did)
3503 let (path, node_id, allowed) = match self.current_self_type {
3504 Some(ref ty) => match extract_path_and_node_id(ty, Everything) {
3506 None => return NoSuggestion,
3508 None => return NoSuggestion,
3511 if allowed == Everything {
3512 // Look for a field with the same name in the current self_type.
3513 match self.def_map.borrow().get(&node_id).map(|d| d.full_def()) {
3514 Some(DefTy(did, _)) |
3515 Some(DefStruct(did)) |
3516 Some(DefVariant(_, did, _)) => match self.structs.get(&did) {
3519 if fields.iter().any(|&field_name| name == field_name) {
3524 _ => {} // Self type didn't resolve properly
3528 let name_path = path.segments.iter().map(|seg| seg.identifier.name).collect::<Vec<_>>();
3530 // Look for a method in the current self type's impl module.
3531 if let Some(module) = get_module(self, path.span, &name_path) {
3532 if let Some(binding) = module.children.borrow().get(&name) {
3533 if let Some(DefMethod(did)) = binding.def_for_namespace(ValueNS) {
3534 if is_static_method(self, did) {
3535 return StaticMethod(path_names_to_string(&path, 0))
3537 if self.current_trait_ref.is_some() {
3539 } else if allowed == Everything {
3546 // Look for a method in the current trait.
3547 if let Some((trait_did, ref trait_ref)) = self.current_trait_ref {
3548 if let Some(&did) = self.trait_item_map.get(&(name, trait_did)) {
3549 if is_static_method(self, did) {
3550 return TraitMethod(path_names_to_string(&trait_ref.path, 0));
3560 fn find_best_match_for_name(&mut self, name: &str) -> Option<String> {
3561 let mut maybes: Vec<token::InternedString> = Vec::new();
3562 let mut values: Vec<usize> = Vec::new();
3564 for rib in self.value_ribs.iter().rev() {
3565 for (&k, _) in &rib.bindings {
3566 maybes.push(k.as_str());
3567 values.push(usize::MAX);
3571 let mut smallest = 0;
3572 for (i, other) in maybes.iter().enumerate() {
3573 values[i] = lev_distance(name, &other);
3575 if values[i] <= values[smallest] {
3580 // As a loose rule to avoid obviously incorrect suggestions, clamp the
3581 // maximum edit distance we will accept for a suggestion to one third of
3582 // the typo'd name's length.
3583 let max_distance = std::cmp::max(name.len(), 3) / 3;
3585 if !values.is_empty() &&
3586 values[smallest] <= max_distance &&
3587 name != &maybes[smallest][..] {
3589 Some(maybes[smallest].to_string())
3596 fn resolve_expr(&mut self, expr: &Expr) {
3597 // First, record candidate traits for this expression if it could
3598 // result in the invocation of a method call.
3600 self.record_candidate_traits_for_expr_if_necessary(expr);
3602 // Next, resolve the node.
3604 ExprPath(ref maybe_qself, ref path) => {
3606 match self.resolve_possibly_assoc_item(expr.id,
3607 maybe_qself.as_ref(),
3611 // `<T>::a::b::c` is resolved by typeck alone.
3612 TypecheckRequired => {
3613 let method_name = path.segments.last().unwrap().identifier.name;
3614 let traits = self.get_traits_containing_item(method_name);
3615 self.trait_map.insert(expr.id, traits);
3616 visit::walk_expr(self, expr);
3619 ResolveAttempt(resolution) => resolution,
3622 // This is a local path in the value namespace. Walk through
3623 // scopes looking for it.
3624 if let Some(path_res) = resolution {
3625 // Check if struct variant
3626 if let DefVariant(_, _, true) = path_res.base_def {
3627 let path_name = path_names_to_string(path, 0);
3631 ResolutionError::StructVariantUsedAsFunction(&*path_name));
3633 let msg = format!("did you mean to write: \
3634 `{} {{ /* fields */ }}`?",
3636 if self.emit_errors {
3637 self.session.fileline_help(expr.span, &msg);
3639 self.session.span_help(expr.span, &msg);
3642 // Write the result into the def map.
3643 debug!("(resolving expr) resolved `{}`",
3644 path_names_to_string(path, 0));
3646 // Partial resolutions will need the set of traits in scope,
3647 // so they can be completed during typeck.
3648 if path_res.depth != 0 {
3649 let method_name = path.segments.last().unwrap().identifier.name;
3650 let traits = self.get_traits_containing_item(method_name);
3651 self.trait_map.insert(expr.id, traits);
3654 self.record_def(expr.id, path_res);
3657 // Be helpful if the name refers to a struct
3658 // (The pattern matching def_tys where the id is in self.structs
3659 // matches on regular structs while excluding tuple- and enum-like
3660 // structs, which wouldn't result in this error.)
3661 let path_name = path_names_to_string(path, 0);
3662 let type_res = self.with_no_errors(|this| {
3663 this.resolve_path(expr.id, path, 0, TypeNS, false)
3665 match type_res.map(|r| r.base_def) {
3666 Some(DefTy(struct_id, _))
3667 if self.structs.contains_key(&struct_id) => {
3671 ResolutionError::StructVariantUsedAsFunction(
3675 let msg = format!("did you mean to write: \
3676 `{} {{ /* fields */ }}`?",
3678 if self.emit_errors {
3679 self.session.fileline_help(expr.span, &msg);
3681 self.session.span_help(expr.span, &msg);
3685 // Keep reporting some errors even if they're ignored above.
3686 self.resolve_path(expr.id, path, 0, ValueNS, true);
3688 let mut method_scope = false;
3689 self.value_ribs.iter().rev().all(|rib| {
3690 method_scope = match rib.kind {
3691 MethodRibKind => true,
3692 ItemRibKind | ConstantItemRibKind => false,
3693 _ => return true, // Keep advancing
3695 false // Stop advancing
3698 if method_scope && special_names::self_ == path_name {
3702 ResolutionError::SelfNotAvailableInStaticMethod
3705 let last_name = path.segments.last().unwrap().identifier.name;
3706 let mut msg = match self.find_fallback_in_self_type(last_name) {
3708 // limit search to 5 to reduce the number
3709 // of stupid suggestions
3710 self.find_best_match_for_name(&path_name)
3711 .map_or("".to_string(),
3712 |x| format!("`{}`", x))
3714 Field => format!("`self.{}`", path_name),
3717 format!("to call `self.{}`", path_name),
3718 TraitMethod(path_str) |
3719 StaticMethod(path_str) =>
3720 format!("to call `{}::{}`", path_str, path_name)
3723 if !msg.is_empty() {
3724 msg = format!(". Did you mean {}?", msg)
3729 ResolutionError::UnresolvedName(&*path_name,
3736 visit::walk_expr(self, expr);
3739 ExprStruct(ref path, _, _) => {
3740 // Resolve the path to the structure it goes to. We don't
3741 // check to ensure that the path is actually a structure; that
3742 // is checked later during typeck.
3743 match self.resolve_path(expr.id, path, 0, TypeNS, false) {
3744 Some(definition) => self.record_def(expr.id, definition),
3746 debug!("(resolving expression) didn't find struct def",);
3750 ResolutionError::DoesNotNameAStruct(
3751 &*path_names_to_string(path, 0))
3756 visit::walk_expr(self, expr);
3759 ExprLoop(_, Some(label)) | ExprWhile(_, _, Some(label)) => {
3760 self.with_label_rib(|this| {
3761 let def_like = DlDef(DefLabel(expr.id));
3764 let rib = this.label_ribs.last_mut().unwrap();
3765 let renamed = mtwt::resolve(label);
3766 rib.bindings.insert(renamed, def_like);
3769 visit::walk_expr(this, expr);
3773 ExprBreak(Some(label)) | ExprAgain(Some(label)) => {
3774 let renamed = mtwt::resolve(label.node);
3775 match self.search_label(renamed) {
3779 ResolutionError::UndeclaredLabel(&label.node.name.as_str()))
3781 Some(DlDef(def @ DefLabel(_))) => {
3782 // Since this def is a label, it is never read.
3783 self.record_def(expr.id, PathResolution {
3785 last_private: LastMod(AllPublic),
3790 self.session.span_bug(expr.span,
3791 "label wasn't mapped to a \
3798 visit::walk_expr(self, expr);
3803 fn record_candidate_traits_for_expr_if_necessary(&mut self, expr: &Expr) {
3805 ExprField(_, ident) => {
3806 // FIXME(#6890): Even though you can't treat a method like a
3807 // field, we need to add any trait methods we find that match
3808 // the field name so that we can do some nice error reporting
3809 // later on in typeck.
3810 let traits = self.get_traits_containing_item(ident.node.name);
3811 self.trait_map.insert(expr.id, traits);
3813 ExprMethodCall(ident, _, _) => {
3814 debug!("(recording candidate traits for expr) recording \
3817 let traits = self.get_traits_containing_item(ident.node.name);
3818 self.trait_map.insert(expr.id, traits);
3826 fn get_traits_containing_item(&mut self, name: Name) -> Vec<DefId> {
3827 debug!("(getting traits containing item) looking for '{}'",
3830 fn add_trait_info(found_traits: &mut Vec<DefId>,
3831 trait_def_id: DefId,
3833 debug!("(adding trait info) found trait {}:{} for method '{}'",
3837 found_traits.push(trait_def_id);
3840 let mut found_traits = Vec::new();
3841 let mut search_module = self.current_module.clone();
3843 // Look for the current trait.
3844 match self.current_trait_ref {
3845 Some((trait_def_id, _)) => {
3846 if self.trait_item_map.contains_key(&(name, trait_def_id)) {
3847 add_trait_info(&mut found_traits, trait_def_id, name);
3850 None => {} // Nothing to do.
3853 // Look for trait children.
3854 build_reduced_graph::populate_module_if_necessary(self, &search_module);
3857 for (_, child_names) in search_module.children.borrow().iter() {
3858 let def = match child_names.def_for_namespace(TypeNS) {
3862 let trait_def_id = match def {
3863 DefTrait(trait_def_id) => trait_def_id,
3866 if self.trait_item_map.contains_key(&(name, trait_def_id)) {
3867 add_trait_info(&mut found_traits, trait_def_id, name);
3872 // Look for imports.
3873 for (_, import) in search_module.import_resolutions.borrow().iter() {
3874 let target = match import.target_for_namespace(TypeNS) {
3876 Some(target) => target,
3878 let did = match target.bindings.def_for_namespace(TypeNS) {
3879 Some(DefTrait(trait_def_id)) => trait_def_id,
3880 Some(..) | None => continue,
3882 if self.trait_item_map.contains_key(&(name, did)) {
3883 add_trait_info(&mut found_traits, did, name);
3884 let id = import.type_id;
3885 self.used_imports.insert((id, TypeNS));
3886 let trait_name = self.get_trait_name(did);
3887 self.record_import_use(id, trait_name);
3888 if let Some(DefId{krate: kid, ..}) = target.target_module.def_id.get() {
3889 self.used_crates.insert(kid);
3894 match search_module.parent_link.clone() {
3895 NoParentLink | ModuleParentLink(..) => break,
3896 BlockParentLink(parent_module, _) => {
3897 search_module = parent_module.upgrade().unwrap();
3905 fn record_def(&mut self, node_id: NodeId, resolution: PathResolution) {
3906 debug!("(recording def) recording {:?} for {}", resolution, node_id);
3907 assert!(match resolution.last_private {LastImport{..} => false, _ => true},
3908 "Import should only be used for `use` directives");
3910 if let Some(prev_res) = self.def_map.borrow_mut().insert(node_id, resolution) {
3911 let span = self.ast_map.opt_span(node_id).unwrap_or(codemap::DUMMY_SP);
3912 self.session.span_bug(span, &format!("path resolved multiple times \
3913 ({:?} before, {:?} now)",
3914 prev_res, resolution));
3918 fn enforce_default_binding_mode(&mut self,
3920 pat_binding_mode: BindingMode,
3922 match pat_binding_mode {
3923 BindByValue(_) => {}
3927 ResolutionError::CannotUseRefBindingModeWith(descr));
3935 // Diagnostics are not particularly efficient, because they're rarely
3939 #[allow(dead_code)] // useful for debugging
3940 fn dump_module(&mut self, module_: Rc<Module>) {
3941 debug!("Dump of module `{}`:", module_to_string(&*module_));
3943 debug!("Children:");
3944 build_reduced_graph::populate_module_if_necessary(self, &module_);
3945 for (&name, _) in module_.children.borrow().iter() {
3946 debug!("* {}", name);
3949 debug!("Import resolutions:");
3950 let import_resolutions = module_.import_resolutions.borrow();
3951 for (&name, import_resolution) in import_resolutions.iter() {
3953 match import_resolution.target_for_namespace(ValueNS) {
3954 None => { value_repr = "".to_string(); }
3956 value_repr = " value:?".to_string();
3962 match import_resolution.target_for_namespace(TypeNS) {
3963 None => { type_repr = "".to_string(); }
3965 type_repr = " type:?".to_string();
3970 debug!("* {}:{}{}", name, value_repr, type_repr);
3976 fn names_to_string(names: &[Name]) -> String {
3977 let mut first = true;
3978 let mut result = String::new();
3983 result.push_str("::")
3985 result.push_str(&name.as_str());
3990 fn path_names_to_string(path: &Path, depth: usize) -> String {
3991 let names: Vec<ast::Name> = path.segments[..path.segments.len()-depth]
3993 .map(|seg| seg.identifier.name)
3995 names_to_string(&names[..])
3998 /// A somewhat inefficient routine to obtain the name of a module.
3999 fn module_to_string(module: &Module) -> String {
4000 let mut names = Vec::new();
4002 fn collect_mod(names: &mut Vec<ast::Name>, module: &Module) {
4003 match module.parent_link {
4005 ModuleParentLink(ref module, name) => {
4007 collect_mod(names, &*module.upgrade().unwrap());
4009 BlockParentLink(ref module, _) => {
4010 // danger, shouldn't be ident?
4011 names.push(special_idents::opaque.name);
4012 collect_mod(names, &*module.upgrade().unwrap());
4016 collect_mod(&mut names, module);
4018 if names.is_empty() {
4019 return "???".to_string();
4021 names_to_string(&names.into_iter().rev().collect::<Vec<ast::Name>>())
4025 pub struct CrateMap {
4026 pub def_map: DefMap,
4027 pub freevars: RefCell<FreevarMap>,
4028 pub export_map: ExportMap,
4029 pub trait_map: TraitMap,
4030 pub external_exports: ExternalExports,
4031 pub glob_map: Option<GlobMap>
4034 #[derive(PartialEq,Copy, Clone)]
4035 pub enum MakeGlobMap {
4040 /// Entry point to crate resolution.
4041 pub fn resolve_crate<'a, 'tcx>(session: &'a Session,
4042 ast_map: &'a hir_map::Map<'tcx>,
4043 make_glob_map: MakeGlobMap)
4045 let krate = ast_map.krate();
4046 let mut resolver = create_resolver(session, ast_map, krate, make_glob_map, None);
4048 resolver.resolve_crate(krate);
4049 session.abort_if_errors();
4051 check_unused::check_crate(&mut resolver, krate);
4054 def_map: resolver.def_map,
4055 freevars: resolver.freevars,
4056 export_map: resolver.export_map,
4057 trait_map: resolver.trait_map,
4058 external_exports: resolver.external_exports,
4059 glob_map: if resolver.make_glob_map {
4060 Some(resolver.glob_map)
4067 /// Builds a name resolution walker to be used within this module,
4068 /// or used externally, with an optional callback function.
4070 /// The callback takes a &mut bool which allows callbacks to end a
4071 /// walk when set to true, passing through the rest of the walk, while
4072 /// preserving the ribs + current module. This allows resolve_path
4073 /// calls to be made with the correct scope info. The node in the
4074 /// callback corresponds to the current node in the walk.
4075 pub fn create_resolver<'a, 'tcx>(session: &'a Session,
4076 ast_map: &'a hir_map::Map<'tcx>,
4078 make_glob_map: MakeGlobMap,
4079 callback: Option<Box<Fn(hir_map::Node, &mut bool) -> bool>>)
4080 -> Resolver<'a, 'tcx> {
4081 let mut resolver = Resolver::new(session, ast_map, krate.span, make_glob_map);
4083 resolver.callback = callback;
4085 build_reduced_graph::build_reduced_graph(&mut resolver, krate);
4086 session.abort_if_errors();
4088 resolve_imports::resolve_imports(&mut resolver);
4089 session.abort_if_errors();
4091 record_exports::record(&mut resolver);
4092 session.abort_if_errors();
4097 __build_diagnostic_array! { librustc_resolve, DIAGNOSTICS }