1 //! Give useful errors and suggestions to users when an item can't be
2 //! found or is otherwise invalid.
4 use crate::check::FnCtxt;
5 use crate::middle::lang_items::FnOnceTraitLangItem;
6 use crate::namespace::Namespace;
7 use crate::util::nodemap::FxHashSet;
8 use errors::{Applicability, DiagnosticBuilder};
9 use rustc_data_structures::sync::Lrc;
10 use rustc::hir::{self, ExprKind, Node, QPath};
11 use rustc::hir::def::Def;
12 use rustc::hir::def_id::{CRATE_DEF_INDEX, LOCAL_CRATE, DefId};
13 use rustc::hir::map as hir_map;
14 use rustc::hir::print;
15 use rustc::infer::type_variable::TypeVariableOrigin;
16 use rustc::traits::Obligation;
17 use rustc::ty::{self, Adt, Ty, TyCtxt, ToPolyTraitRef, ToPredicate, TypeFoldable};
18 use rustc::ty::print::with_crate_prefix;
19 use syntax_pos::{Span, FileName};
21 use syntax::util::lev_distance::find_best_match_for_name;
23 use std::cmp::Ordering;
25 use super::{MethodError, NoMatchData, CandidateSource};
26 use super::probe::Mode;
28 impl<'a, 'gcx, 'tcx> FnCtxt<'a, 'gcx, 'tcx> {
29 fn is_fn_ty(&self, ty: &Ty<'tcx>, span: Span) -> bool {
32 // Not all of these (e.g., unsafe fns) implement `FnOnce`,
33 // so we look for these beforehand.
37 // If it's not a simple function, look for things which implement `FnOnce`.
39 let fn_once = match tcx.lang_items().require(FnOnceTraitLangItem) {
40 Ok(fn_once) => fn_once,
41 Err(..) => return false,
44 self.autoderef(span, ty).any(|(ty, _)| {
46 let fn_once_substs = tcx.mk_substs_trait(ty, &[
47 self.next_ty_var(TypeVariableOrigin::MiscVariable(span)).into()
49 let trait_ref = ty::TraitRef::new(fn_once, fn_once_substs);
50 let poly_trait_ref = trait_ref.to_poly_trait_ref();
52 Obligation::misc(span,
55 poly_trait_ref.to_predicate());
56 self.predicate_may_hold(&obligation)
63 pub fn report_method_error<'b>(
67 item_name: ast::Ident,
68 source: SelfSource<'b>,
69 error: MethodError<'tcx>,
70 args: Option<&'gcx [hir::Expr]>,
74 // Avoid suggestions when we don't know what's going on.
75 if rcvr_ty.references_error() {
79 let report_candidates = |
81 err: &mut DiagnosticBuilder<'_>,
82 mut sources: Vec<CandidateSource>,
86 // Dynamic limit to avoid hiding just one candidate, which is silly.
87 let limit = if sources.len() == 5 { 5 } else { 4 };
89 for (idx, source) in sources.iter().take(limit).enumerate() {
91 CandidateSource::ImplSource(impl_did) => {
92 // Provide the best span we can. Use the item, if local to crate, else
93 // the impl, if local to crate (item may be defaulted), else nothing.
94 let item = self.associated_item(impl_did, item_name, Namespace::Value)
97 self.tcx.impl_trait_ref(impl_did).unwrap().def_id,
102 let note_span = self.tcx.hir().span_if_local(item.def_id).or_else(|| {
103 self.tcx.hir().span_if_local(impl_did)
106 let impl_ty = self.impl_self_ty(span, impl_did).ty;
108 let insertion = match self.tcx.impl_trait_ref(impl_did) {
109 None => String::new(),
111 format!(" of the trait `{}`",
112 self.tcx.def_path_str(trait_ref.def_id))
116 let note_str = if sources.len() > 1 {
117 format!("candidate #{} is defined in an impl{} for the type `{}`",
122 format!("the candidate is defined in an impl{} for the type `{}`",
126 if let Some(note_span) = note_span {
127 // We have a span pointing to the method. Show note with snippet.
128 err.span_note(self.tcx.sess.source_map().def_span(note_span),
134 CandidateSource::TraitSource(trait_did) => {
136 .associated_item(trait_did, item_name, Namespace::Value)
138 let item_span = self.tcx.sess.source_map()
139 .def_span(self.tcx.def_span(item.def_id));
140 if sources.len() > 1 {
143 "candidate #{} is defined in the trait `{}`",
145 self.tcx.def_path_str(trait_did));
149 "the candidate is defined in the trait `{}`",
150 self.tcx.def_path_str(trait_did));
152 err.help(&format!("to disambiguate the method call, write `{}::{}({}{})` \
154 self.tcx.def_path_str(trait_did),
156 if rcvr_ty.is_region_ptr() && args.is_some() {
157 if rcvr_ty.is_mutable_pointer() {
165 args.map(|arg| arg.iter()
166 .map(|arg| print::to_string(print::NO_ANN,
167 |s| s.print_expr(arg)))
169 .join(", ")).unwrap_or_else(|| "...".to_owned())));
173 if sources.len() > limit {
174 err.note(&format!("and {} others", sources.len() - limit));
179 MethodError::NoMatch(NoMatchData {
180 static_candidates: static_sources,
181 unsatisfied_predicates,
188 let actual = self.resolve_type_vars_if_possible(&rcvr_ty);
189 let ty_str = self.ty_to_string(actual);
190 let is_method = mode == Mode::MethodCall;
191 let mut suggestion = None;
192 let item_kind = if is_method {
194 } else if actual.is_enum() {
195 if let Adt(ref adt_def, _) = actual.sty {
196 let names = adt_def.variants.iter().map(|s| &s.ident.name);
197 suggestion = find_best_match_for_name(names,
203 match (item_name.as_str().chars().next(), actual.is_fresh_ty()) {
204 (Some(name), false) if name.is_lowercase() => {
205 "function or associated item"
207 (Some(_), false) => "associated item",
208 (Some(_), true) | (None, false) => {
209 "variant or associated item"
211 (None, true) => "variant",
214 let mut err = if !actual.references_error() {
215 // Suggest clamping down the type if the method that is being attempted to
216 // be used exists at all, and the type is an ambiuous numeric type
217 // ({integer}/{float}).
218 let mut candidates = all_traits(self.tcx)
221 self.associated_item(info.def_id, item_name, Namespace::Value)
223 if let (true, false, SelfSource::MethodCall(expr), Some(_)) =
224 (actual.is_numeric(),
225 actual.has_concrete_skeleton(),
228 let mut err = struct_span_err!(
232 "can't call {} `{}` on ambiguous numeric type `{}`",
237 let concrete_type = if actual.is_integral() {
243 ExprKind::Lit(ref lit) => {
245 let snippet = tcx.sess.source_map().span_to_snippet(lit.span)
246 .unwrap_or_else(|_| "<numeric literal>".to_owned());
250 &format!("you must specify a concrete type for \
251 this numeric value, like `{}`", concrete_type),
252 format!("{}_{}", snippet, concrete_type),
253 Applicability::MaybeIncorrect,
256 ExprKind::Path(ref qpath) => {
258 if let &QPath::Resolved(_, ref path) = &qpath {
259 if let hir::def::Def::Local(node_id) = path.def {
260 let span = tcx.hir().span(node_id);
261 let snippet = tcx.sess.source_map().span_to_snippet(span)
263 let filename = tcx.sess.source_map().span_to_filename(span);
265 let parent_node = self.tcx.hir().get(
266 self.tcx.hir().get_parent_node(node_id),
269 "you must specify a type for this binding, like `{}`",
273 match (filename, parent_node) {
274 (FileName::Real(_), Node::Local(hir::Local {
275 source: hir::LocalSource::Normal,
280 // account for `let x: _ = 42;`
282 span.to(ty.as_ref().map(|ty| ty.span)
285 format!("{}: {}", snippet, concrete_type),
286 Applicability::MaybeIncorrect,
290 err.span_label(span, msg);
301 span = item_name.span;
302 let mut err = struct_span_err!(
306 "no {} named `{}` found for type `{}` in the current scope",
311 if let Some(suggestion) = suggestion {
316 suggestion.to_string(),
317 Applicability::MaybeIncorrect,
323 tcx.sess.diagnostic().struct_dummy()
326 if let Some(def) = actual.ty_adt_def() {
327 if let Some(full_sp) = tcx.hir().span_if_local(def.did) {
328 let def_sp = tcx.sess.source_map().def_span(full_sp);
329 err.span_label(def_sp, format!("{} `{}` not found {}",
332 if def.is_enum() && !is_method {
340 // If the method name is the name of a field with a function or closure type,
341 // give a helping note that it has to be called as `(x.f)(...)`.
342 if let SelfSource::MethodCall(expr) = source {
343 let field_receiver = self
344 .autoderef(span, rcvr_ty)
345 .find_map(|(ty, _)| match ty.sty {
346 ty::Adt(def, substs) if !def.is_enum() => {
347 let variant = &def.non_enum_variant();
348 self.tcx.find_field_index(item_name, variant).map(|index| {
349 let field = &variant.fields[index];
350 let field_ty = field.ty(tcx, substs);
357 if let Some((field, field_ty)) = field_receiver {
358 let scope = self.tcx.hir().get_module_parent_by_hir_id(self.body_id);
359 let is_accessible = field.vis.is_accessible_from(scope, self.tcx);
362 if self.is_fn_ty(&field_ty, span) {
363 let expr_span = expr.span.to(item_name.span);
364 err.multipart_suggestion(
366 "to call the function stored in `{}`, \
367 surround the field access with parentheses",
371 (expr_span.shrink_to_lo(), '('.to_string()),
372 (expr_span.shrink_to_hi(), ')'.to_string()),
374 Applicability::MachineApplicable,
377 let call_expr = self.tcx.hir().expect_expr_by_hir_id(
378 self.tcx.hir().get_parent_node_by_hir_id(expr.hir_id),
381 let span = call_expr.span.trim_start(item_name.span).unwrap();
385 "remove the arguments",
387 Applicability::MaybeIncorrect,
392 let field_kind = if is_accessible {
397 err.span_label(item_name.span, format!("{}, not a method", field_kind));
400 err.span_label(span, format!("{} not found in `{}`", item_kind, ty_str));
401 self.tcx.sess.trait_methods_not_found.borrow_mut().insert(orig_span);
404 if self.is_fn_ty(&rcvr_ty, span) {
405 macro_rules! report_function {
406 ($span:expr, $name:expr) => {
407 err.note(&format!("{} is a function, perhaps you wish to call it",
412 if let SelfSource::MethodCall(expr) = source {
413 if let Ok(expr_string) = tcx.sess.source_map().span_to_snippet(expr.span) {
414 report_function!(expr.span, expr_string);
415 } else if let ExprKind::Path(QPath::Resolved(_, ref path)) =
418 if let Some(segment) = path.segments.last() {
419 report_function!(expr.span, segment.ident);
425 if !static_sources.is_empty() {
426 err.note("found the following associated functions; to be used as methods, \
427 functions must have a `self` parameter");
428 err.span_label(span, "this is an associated function, not a method");
430 if static_sources.len() == 1 {
431 if let SelfSource::MethodCall(expr) = source {
432 err.span_suggestion(expr.span.to(span),
433 "use associated function syntax instead",
435 self.ty_to_string(actual),
437 Applicability::MachineApplicable);
439 err.help(&format!("try with `{}::{}`",
440 self.ty_to_string(actual), item_name));
443 report_candidates(span, &mut err, static_sources);
444 } else if static_sources.len() > 1 {
445 report_candidates(span, &mut err, static_sources);
448 if !unsatisfied_predicates.is_empty() {
449 let mut bound_list = unsatisfied_predicates.iter()
450 .map(|p| format!("`{} : {}`", p.self_ty(), p))
451 .collect::<Vec<_>>();
453 bound_list.dedup(); // #35677
454 let bound_list = bound_list.join("\n");
455 err.note(&format!("the method `{}` exists but the following trait bounds \
456 were not satisfied:\n{}",
461 if actual.is_numeric() && actual.is_fresh() {
464 self.suggest_traits_to_import(&mut err,
469 out_of_scope_traits);
472 if let Some(lev_candidate) = lev_candidate {
476 lev_candidate.ident.to_string(),
477 Applicability::MaybeIncorrect,
483 MethodError::Ambiguity(sources) => {
484 let mut err = struct_span_err!(self.sess(),
487 "multiple applicable items in scope");
488 err.span_label(span, format!("multiple `{}` found", item_name));
490 report_candidates(span, &mut err, sources);
494 MethodError::PrivateMatch(def, out_of_scope_traits) => {
495 let mut err = struct_span_err!(self.tcx.sess, span, E0624,
496 "{} `{}` is private", def.kind_name(), item_name);
497 self.suggest_valid_traits(&mut err, out_of_scope_traits);
501 MethodError::IllegalSizedBound(candidates) => {
502 let msg = format!("the `{}` method cannot be invoked on a trait object", item_name);
503 let mut err = self.sess().struct_span_err(span, &msg);
504 if !candidates.is_empty() {
505 let help = format!("{an}other candidate{s} {were} found in the following \
506 trait{s}, perhaps add a `use` for {one_of_them}:",
507 an = if candidates.len() == 1 {"an" } else { "" },
508 s = if candidates.len() == 1 { "" } else { "s" },
509 were = if candidates.len() == 1 { "was" } else { "were" },
510 one_of_them = if candidates.len() == 1 {
515 self.suggest_use_candidates(&mut err, help, candidates);
520 MethodError::BadReturnType => {
521 bug!("no return type expectations but got BadReturnType")
526 fn suggest_use_candidates(&self,
527 err: &mut DiagnosticBuilder<'_>,
529 candidates: Vec<DefId>) {
530 let module_did = self.tcx.hir().get_module_parent_by_hir_id(self.body_id);
531 let module_id = self.tcx.hir().as_local_hir_id(module_did).unwrap();
532 let krate = self.tcx.hir().krate();
533 let (span, found_use) = UsePlacementFinder::check(self.tcx, krate, module_id);
534 if let Some(span) = span {
535 let path_strings = candidates.iter().map(|did| {
536 // Produce an additional newline to separate the new use statement
537 // from the directly following item.
538 let additional_newline = if found_use {
545 with_crate_prefix(|| self.tcx.def_path_str(*did)),
550 err.span_suggestions(span, &msg, path_strings, Applicability::MaybeIncorrect);
552 let limit = if candidates.len() == 5 { 5 } else { 4 };
553 for (i, trait_did) in candidates.iter().take(limit).enumerate() {
554 if candidates.len() > 1 {
557 "\ncandidate #{}: `use {};`",
559 with_crate_prefix(|| self.tcx.def_path_str(*trait_did))
566 with_crate_prefix(|| self.tcx.def_path_str(*trait_did))
571 if candidates.len() > limit {
572 msg.push_str(&format!("\nand {} others", candidates.len() - limit));
578 fn suggest_valid_traits(&self,
579 err: &mut DiagnosticBuilder<'_>,
580 valid_out_of_scope_traits: Vec<DefId>) -> bool {
581 if !valid_out_of_scope_traits.is_empty() {
582 let mut candidates = valid_out_of_scope_traits;
585 err.help("items from traits can only be used if the trait is in scope");
586 let msg = format!("the following {traits_are} implemented but not in scope, \
587 perhaps add a `use` for {one_of_them}:",
588 traits_are = if candidates.len() == 1 {
593 one_of_them = if candidates.len() == 1 {
599 self.suggest_use_candidates(err, msg, candidates);
606 fn suggest_traits_to_import<'b>(&self,
607 err: &mut DiagnosticBuilder<'_>,
610 item_name: ast::Ident,
611 source: SelfSource<'b>,
612 valid_out_of_scope_traits: Vec<DefId>) {
613 if self.suggest_valid_traits(err, valid_out_of_scope_traits) {
617 let type_is_local = self.type_derefs_to_local(span, rcvr_ty, source);
619 // There are no traits implemented, so lets suggest some traits to
620 // implement, by finding ones that have the item name, and are
621 // legal to implement.
622 let mut candidates = all_traits(self.tcx)
625 // We approximate the coherence rules to only suggest
626 // traits that are legal to implement by requiring that
627 // either the type or trait is local. Multi-dispatch means
628 // this isn't perfect (that is, there are cases when
629 // implementing a trait would be legal but is rejected
631 (type_is_local || info.def_id.is_local()) &&
632 self.associated_item(info.def_id, item_name, Namespace::Value)
634 // We only want to suggest public or local traits (#45781).
635 item.vis == ty::Visibility::Public || info.def_id.is_local()
639 .collect::<Vec<_>>();
641 if !candidates.is_empty() {
642 // Sort from most relevant to least relevant.
643 candidates.sort_by(|a, b| a.cmp(b).reverse());
646 // FIXME #21673: this help message could be tuned to the case
647 // of a type parameter: suggest adding a trait bound rather
648 // than implementing.
649 err.help("items from traits can only be used if the trait is implemented and in scope");
650 let mut msg = format!("the following {traits_define} an item `{name}`, \
651 perhaps you need to implement {one_of_them}:",
652 traits_define = if candidates.len() == 1 {
657 one_of_them = if candidates.len() == 1 {
664 for (i, trait_info) in candidates.iter().enumerate() {
665 msg.push_str(&format!("\ncandidate #{}: `{}`",
667 self.tcx.def_path_str(trait_info.def_id)));
673 /// Checks whether there is a local type somewhere in the chain of
674 /// autoderefs of `rcvr_ty`.
675 fn type_derefs_to_local(&self,
678 source: SelfSource<'_>) -> bool {
679 fn is_local(ty: Ty<'_>) -> bool {
681 ty::Adt(def, _) => def.did.is_local(),
682 ty::Foreign(did) => did.is_local(),
684 ty::Dynamic(ref tr, ..) =>
685 tr.principal().map(|d| d.def_id().is_local()).unwrap_or(false),
687 ty::Param(_) => true,
689 // Everything else (primitive types, etc.) is effectively
690 // non-local (there are "edge" cases, e.g., `(LocalType,)`, but
691 // the noise from these sort of types is usually just really
692 // annoying, rather than any sort of help).
697 // This occurs for UFCS desugaring of `T::method`, where there is no
698 // receiver expression for the method call, and thus no autoderef.
699 if let SelfSource::QPath(_) = source {
700 return is_local(self.resolve_type_vars_with_obligations(rcvr_ty));
703 self.autoderef(span, rcvr_ty).any(|(ty, _)| is_local(ty))
707 #[derive(Copy, Clone)]
708 pub enum SelfSource<'a> {
710 MethodCall(&'a hir::Expr /* rcvr */),
713 #[derive(Copy, Clone)]
714 pub struct TraitInfo {
718 impl PartialEq for TraitInfo {
719 fn eq(&self, other: &TraitInfo) -> bool {
720 self.cmp(other) == Ordering::Equal
723 impl Eq for TraitInfo {}
724 impl PartialOrd for TraitInfo {
725 fn partial_cmp(&self, other: &TraitInfo) -> Option<Ordering> {
726 Some(self.cmp(other))
729 impl Ord for TraitInfo {
730 fn cmp(&self, other: &TraitInfo) -> Ordering {
731 // Local crates are more important than remote ones (local:
732 // `cnum == 0`), and otherwise we throw in the defid for totality.
734 let lhs = (other.def_id.krate, other.def_id);
735 let rhs = (self.def_id.krate, self.def_id);
740 /// Retrieves all traits in this crate and any dependent crates.
741 pub fn all_traits<'a, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Vec<TraitInfo> {
742 tcx.all_traits(LOCAL_CRATE).iter().map(|&def_id| TraitInfo { def_id }).collect()
745 /// Computes all traits in this crate and any dependent crates.
746 fn compute_all_traits<'a, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>) -> Vec<DefId> {
747 use hir::itemlikevisit;
749 let mut traits = vec![];
753 struct Visitor<'a, 'tcx: 'a> {
754 map: &'a hir_map::Map<'tcx>,
755 traits: &'a mut Vec<DefId>,
758 impl<'v, 'a, 'tcx> itemlikevisit::ItemLikeVisitor<'v> for Visitor<'a, 'tcx> {
759 fn visit_item(&mut self, i: &'v hir::Item) {
761 hir::ItemKind::Trait(..) |
762 hir::ItemKind::TraitAlias(..) => {
763 let def_id = self.map.local_def_id_from_hir_id(i.hir_id);
764 self.traits.push(def_id);
770 fn visit_trait_item(&mut self, _trait_item: &hir::TraitItem) {}
772 fn visit_impl_item(&mut self, _impl_item: &hir::ImplItem) {}
775 tcx.hir().krate().visit_all_item_likes(&mut Visitor {
782 let mut external_mods = FxHashSet::default();
783 fn handle_external_def(tcx: TyCtxt<'_, '_, '_>,
784 traits: &mut Vec<DefId>,
785 external_mods: &mut FxHashSet<DefId>,
789 Def::TraitAlias(def_id) => {
792 Def::Mod(def_id) => {
793 if !external_mods.insert(def_id) {
796 for child in tcx.item_children(def_id).iter() {
797 handle_external_def(tcx, traits, external_mods, child.def)
803 for &cnum in tcx.crates().iter() {
806 index: CRATE_DEF_INDEX,
808 handle_external_def(tcx, &mut traits, &mut external_mods, Def::Mod(def_id));
814 pub fn provide(providers: &mut ty::query::Providers<'_>) {
815 providers.all_traits = |tcx, cnum| {
816 assert_eq!(cnum, LOCAL_CRATE);
817 Lrc::new(compute_all_traits(tcx))
821 struct UsePlacementFinder<'a, 'tcx: 'a, 'gcx: 'tcx> {
822 target_module: hir::HirId,
825 tcx: TyCtxt<'a, 'gcx, 'tcx>
828 impl<'a, 'tcx, 'gcx> UsePlacementFinder<'a, 'tcx, 'gcx> {
830 tcx: TyCtxt<'a, 'gcx, 'tcx>,
831 krate: &'tcx hir::Crate,
832 target_module: hir::HirId,
833 ) -> (Option<Span>, bool) {
834 let mut finder = UsePlacementFinder {
840 hir::intravisit::walk_crate(&mut finder, krate);
841 (finder.span, finder.found_use)
845 impl<'a, 'tcx, 'gcx> hir::intravisit::Visitor<'tcx> for UsePlacementFinder<'a, 'tcx, 'gcx> {
848 module: &'tcx hir::Mod,
852 if self.span.is_some() {
855 if hir_id != self.target_module {
856 hir::intravisit::walk_mod(self, module, hir_id);
859 // Find a `use` statement.
860 for item_id in &module.item_ids {
861 let item = self.tcx.hir().expect_item_by_hir_id(item_id.id);
863 hir::ItemKind::Use(..) => {
864 // Don't suggest placing a `use` before the prelude
865 // import or other generated ones.
866 if item.span.ctxt().outer().expn_info().is_none() {
867 self.span = Some(item.span.shrink_to_lo());
868 self.found_use = true;
872 // Don't place `use` before `extern crate`...
873 hir::ItemKind::ExternCrate(_) => {}
874 // ...but do place them before the first other item.
875 _ => if self.span.map_or(true, |span| item.span < span ) {
876 if item.span.ctxt().outer().expn_info().is_none() {
877 // Don't insert between attributes and an item.
878 if item.attrs.is_empty() {
879 self.span = Some(item.span.shrink_to_lo());
881 // Find the first attribute on the item.
882 for attr in &item.attrs {
883 if self.span.map_or(true, |span| attr.span < span) {
884 self.span = Some(attr.span.shrink_to_lo());
894 fn nested_visit_map<'this>(
896 ) -> hir::intravisit::NestedVisitorMap<'this, 'tcx> {
897 hir::intravisit::NestedVisitorMap::None