1 pub mod on_unimplemented
;
5 EvaluationResult
, FulfillmentError
, FulfillmentErrorCode
, MismatchedProjectionTypes
,
6 Obligation
, ObligationCause
, ObligationCauseCode
, OnUnimplementedDirective
,
7 OnUnimplementedNote
, OutputTypeParameterMismatch
, Overflow
, PredicateObligation
,
8 SelectionContext
, SelectionError
, TraitNotObjectSafe
,
11 use crate::infer
::error_reporting
::{TyCategory, TypeAnnotationNeeded as ErrorCode}
;
12 use crate::infer
::type_variable
::{TypeVariableOrigin, TypeVariableOriginKind}
;
13 use crate::infer
::{self, InferCtxt, TyCtxtInferExt}
;
14 use rustc_data_structures
::fx
::FxHashMap
;
15 use rustc_errors
::{pluralize, struct_span_err, Applicability, DiagnosticBuilder, ErrorReported}
;
17 use rustc_hir
::def_id
::DefId
;
18 use rustc_hir
::intravisit
::Visitor
;
19 use rustc_hir
::GenericParam
;
22 use rustc_middle
::mir
::abstract_const
::NotConstEvaluatable
;
23 use rustc_middle
::ty
::error
::ExpectedFound
;
24 use rustc_middle
::ty
::fold
::TypeFolder
;
25 use rustc_middle
::ty
::{
26 self, fast_reject
, AdtKind
, SubtypePredicate
, ToPolyTraitRef
, ToPredicate
, Ty
, TyCtxt
,
27 TypeFoldable
, WithConstness
,
29 use rustc_session
::DiagnosticMessageId
;
30 use rustc_span
::symbol
::{kw, sym}
;
31 use rustc_span
::{ExpnKind, MultiSpan, Span, DUMMY_SP}
;
35 use crate::traits
::query
::evaluate_obligation
::InferCtxtExt
as _
;
36 use crate::traits
::query
::normalize
::AtExt
as _
;
37 use on_unimplemented
::InferCtxtExt
as _
;
38 use suggestions
::InferCtxtExt
as _
;
40 pub use rustc_infer
::traits
::error_reporting
::*;
42 pub trait InferCtxtExt
<'tcx
> {
43 fn report_fulfillment_errors(
45 errors
: &[FulfillmentError
<'tcx
>],
46 body_id
: Option
<hir
::BodyId
>,
47 fallback_has_occurred
: bool
,
50 fn report_overflow_error
<T
>(
52 obligation
: &Obligation
<'tcx
, T
>,
53 suggest_increasing_limit
: bool
,
56 T
: fmt
::Display
+ TypeFoldable
<'tcx
>;
58 fn report_overflow_error_cycle(&self, cycle
: &[PredicateObligation
<'tcx
>]) -> !;
60 /// The `root_obligation` parameter should be the `root_obligation` field
61 /// from a `FulfillmentError`. If no `FulfillmentError` is available,
62 /// then it should be the same as `obligation`.
63 fn report_selection_error(
65 obligation
: PredicateObligation
<'tcx
>,
66 root_obligation
: &PredicateObligation
<'tcx
>,
67 error
: &SelectionError
<'tcx
>,
68 fallback_has_occurred
: bool
,
72 /// Given some node representing a fn-like thing in the HIR map,
73 /// returns a span and `ArgKind` information that describes the
74 /// arguments it expects. This can be supplied to
75 /// `report_arg_count_mismatch`.
76 fn get_fn_like_arguments(&self, node
: Node
<'_
>) -> Option
<(Span
, Vec
<ArgKind
>)>;
78 /// Reports an error when the number of arguments needed by a
79 /// trait match doesn't match the number that the expression
81 fn report_arg_count_mismatch(
84 found_span
: Option
<Span
>,
85 expected_args
: Vec
<ArgKind
>,
86 found_args
: Vec
<ArgKind
>,
88 ) -> DiagnosticBuilder
<'tcx
>;
91 impl<'a
, 'tcx
> InferCtxtExt
<'tcx
> for InferCtxt
<'a
, 'tcx
> {
92 fn report_fulfillment_errors(
94 errors
: &[FulfillmentError
<'tcx
>],
95 body_id
: Option
<hir
::BodyId
>,
96 fallback_has_occurred
: bool
,
99 struct ErrorDescriptor
<'tcx
> {
100 predicate
: ty
::Predicate
<'tcx
>,
101 index
: Option
<usize>, // None if this is an old error
104 let mut error_map
: FxHashMap
<_
, Vec
<_
>> = self
105 .reported_trait_errors
108 .map(|(&span
, predicates
)| {
113 .map(|&predicate
| ErrorDescriptor { predicate, index: None }
)
119 for (index
, error
) in errors
.iter().enumerate() {
120 // We want to ignore desugarings here: spans are equivalent even
121 // if one is the result of a desugaring and the other is not.
122 let mut span
= error
.obligation
.cause
.span
;
123 let expn_data
= span
.ctxt().outer_expn_data();
124 if let ExpnKind
::Desugaring(_
) = expn_data
.kind
{
125 span
= expn_data
.call_site
;
128 error_map
.entry(span
).or_default().push(ErrorDescriptor
{
129 predicate
: error
.obligation
.predicate
,
133 self.reported_trait_errors
137 .push(error
.obligation
.predicate
);
140 // We do this in 2 passes because we want to display errors in order, though
141 // maybe it *is* better to sort errors by span or something.
142 let mut is_suppressed
= vec
![false; errors
.len()];
143 for (_
, error_set
) in error_map
.iter() {
144 // We want to suppress "duplicate" errors with the same span.
145 for error
in error_set
{
146 if let Some(index
) = error
.index
{
147 // Suppress errors that are either:
148 // 1) strictly implied by another error.
149 // 2) implied by an error with a smaller index.
150 for error2
in error_set
{
151 if error2
.index
.map_or(false, |index2
| is_suppressed
[index2
]) {
152 // Avoid errors being suppressed by already-suppressed
153 // errors, to prevent all errors from being suppressed
158 if self.error_implies(error2
.predicate
, error
.predicate
)
159 && !(error2
.index
>= error
.index
160 && self.error_implies(error
.predicate
, error2
.predicate
))
162 info
!("skipping {:?} (implied by {:?})", error
, error2
);
163 is_suppressed
[index
] = true;
171 for (error
, suppressed
) in iter
::zip(errors
, is_suppressed
) {
173 self.report_fulfillment_error(error
, body_id
, fallback_has_occurred
);
178 /// Reports that an overflow has occurred and halts compilation. We
179 /// halt compilation unconditionally because it is important that
180 /// overflows never be masked -- they basically represent computations
181 /// whose result could not be truly determined and thus we can't say
182 /// if the program type checks or not -- and they are unusual
183 /// occurrences in any case.
184 fn report_overflow_error
<T
>(
186 obligation
: &Obligation
<'tcx
, T
>,
187 suggest_increasing_limit
: bool
,
190 T
: fmt
::Display
+ TypeFoldable
<'tcx
>,
192 let predicate
= self.resolve_vars_if_possible(obligation
.predicate
.clone());
193 let mut err
= struct_span_err
!(
195 obligation
.cause
.span
,
197 "overflow evaluating the requirement `{}`",
201 if suggest_increasing_limit
{
202 self.suggest_new_overflow_limit(&mut err
);
205 self.note_obligation_cause_code(
207 &obligation
.predicate
,
208 &obligation
.cause
.code
,
210 &mut Default
::default(),
214 self.tcx
.sess
.abort_if_errors();
218 /// Reports that a cycle was detected which led to overflow and halts
219 /// compilation. This is equivalent to `report_overflow_error` except
220 /// that we can give a more helpful error message (and, in particular,
221 /// we do not suggest increasing the overflow limit, which is not
223 fn report_overflow_error_cycle(&self, cycle
: &[PredicateObligation
<'tcx
>]) -> ! {
224 let cycle
= self.resolve_vars_if_possible(cycle
.to_owned());
225 assert
!(!cycle
.is_empty());
227 debug
!("report_overflow_error_cycle: cycle={:?}", cycle
);
229 // The 'deepest' obligation is most likely to have a useful
231 self.report_overflow_error(cycle
.iter().max_by_key(|p
| p
.recursion_depth
).unwrap(), false);
234 fn report_selection_error(
236 mut obligation
: PredicateObligation
<'tcx
>,
237 root_obligation
: &PredicateObligation
<'tcx
>,
238 error
: &SelectionError
<'tcx
>,
239 fallback_has_occurred
: bool
,
243 let mut span
= obligation
.cause
.span
;
245 let mut err
= match *error
{
246 SelectionError
::Unimplemented
=> {
247 // If this obligation was generated as a result of well-formedness checking, see if we
248 // can get a better error message by performing HIR-based well-formedness checking.
249 if let ObligationCauseCode
::WellFormed(Some(wf_loc
)) =
250 root_obligation
.cause
.code
.peel_derives()
252 if let Some(cause
) = self.tcx
.diagnostic_hir_wf_check((
253 tcx
.erase_regions(obligation
.predicate
),
256 obligation
.cause
= cause
;
257 span
= obligation
.cause
.span
;
260 if let ObligationCauseCode
::CompareImplMethodObligation
{
265 | ObligationCauseCode
::CompareImplTypeObligation
{
269 } = obligation
.cause
.code
271 self.report_extra_impl_obligation(
276 &format
!("`{}`", obligation
.predicate
),
282 let bound_predicate
= obligation
.predicate
.kind();
283 match bound_predicate
.skip_binder() {
284 ty
::PredicateKind
::Trait(trait_predicate
) => {
285 let trait_predicate
= bound_predicate
.rebind(trait_predicate
);
286 let trait_predicate
= self.resolve_vars_if_possible(trait_predicate
);
288 if self.tcx
.sess
.has_errors() && trait_predicate
.references_error() {
291 let trait_ref
= trait_predicate
.to_poly_trait_ref();
292 let (post_message
, pre_message
, type_def
) = self
293 .get_parent_trait_ref(&obligation
.cause
.code
)
296 format
!(" in `{}`", t
),
297 format
!("within `{}`, ", t
),
298 s
.map(|s
| (format
!("within this `{}`", t
), s
)),
301 .unwrap_or_default();
303 let OnUnimplementedNote { message, label, note, enclosing_scope }
=
304 self.on_unimplemented_note(trait_ref
, &obligation
);
305 let have_alt_message
= message
.is_some() || label
.is_some();
306 let is_try_conversion
= self.is_try_conversion(span
, trait_ref
.def_id());
308 { Some(trait_ref.def_id()) == self.tcx.lang_items().unsize_trait() }
;
309 let (message
, note
) = if is_try_conversion
{
312 "`?` couldn't convert the error to `{}`",
313 trait_ref
.skip_binder().self_ty(),
316 "the question mark operation (`?`) implicitly performs a \
317 conversion on the error value using the `From` trait"
325 let mut err
= struct_span_err
!(
330 message
.unwrap_or_else(|| format
!(
331 "the trait bound `{}` is not satisfied{}",
332 trait_ref
.without_const().to_predicate(tcx
),
337 if is_try_conversion
{
338 let none_error
= self
340 .get_diagnostic_item(sym
::none_error
)
341 .map(|def_id
| tcx
.type_of(def_id
));
342 let should_convert_option_to_result
=
343 Some(trait_ref
.skip_binder().substs
.type_at(1)) == none_error
;
344 let should_convert_result_to_option
=
345 Some(trait_ref
.self_ty().skip_binder()) == none_error
;
346 if should_convert_option_to_result
{
347 err
.span_suggestion_verbose(
349 "consider converting the `Option<T>` into a `Result<T, _>` \
350 using `Option::ok_or` or `Option::ok_or_else`",
351 ".ok_or_else(|| /* error value */)".to_string(),
352 Applicability
::HasPlaceholders
,
354 } else if should_convert_result_to_option
{
355 err
.span_suggestion_verbose(
357 "consider converting the `Result<T, _>` into an `Option<T>` \
360 Applicability
::MachineApplicable
,
363 if let Some(ret_span
) = self.return_type_span(&obligation
) {
367 "expected `{}` because of this",
368 trait_ref
.skip_binder().self_ty()
375 if obligation
.cause
.code
== ObligationCauseCode
::MainFunctionType
{
376 "consider using `()`, or a `Result`".to_owned()
379 "{}the trait `{}` is not implemented for `{}`",
381 trait_ref
.print_only_trait_path(),
382 trait_ref
.skip_binder().self_ty(),
386 if self.suggest_add_reference_to_arg(
393 self.note_obligation_cause(&mut err
, &obligation
);
397 if let Some(ref s
) = label
{
398 // If it has a custom `#[rustc_on_unimplemented]`
399 // error message, let's display it as the label!
400 err
.span_label(span
, s
.as_str());
401 if !matches
!(trait_ref
.skip_binder().self_ty().kind(), ty
::Param(_
)) {
402 // When the self type is a type param We don't need to "the trait
403 // `std::marker::Sized` is not implemented for `T`" as we will point
404 // at the type param with a label to suggest constraining it.
405 err
.help(&explanation
);
408 err
.span_label(span
, explanation
);
410 if let Some((msg
, span
)) = type_def
{
411 err
.span_label(span
, &msg
);
413 if let Some(ref s
) = note
{
414 // If it has a custom `#[rustc_on_unimplemented]` note, let's display it
415 err
.note(s
.as_str());
417 if let Some(ref s
) = enclosing_scope
{
420 .opt_local_def_id(obligation
.cause
.body_id
)
422 tcx
.hir().body_owner_def_id(hir
::BodyId
{
423 hir_id
: obligation
.cause
.body_id
,
427 let enclosing_scope_span
=
428 tcx
.hir().span_with_body(tcx
.hir().local_def_id_to_hir_id(body
));
430 err
.span_label(enclosing_scope_span
, s
.as_str());
433 self.suggest_dereferences(&obligation
, &mut err
, trait_ref
, points_at_arg
);
434 self.suggest_fn_call(&obligation
, &mut err
, trait_ref
, points_at_arg
);
435 self.suggest_remove_reference(&obligation
, &mut err
, trait_ref
);
436 self.suggest_semicolon_removal(&obligation
, &mut err
, span
, trait_ref
);
437 self.note_version_mismatch(&mut err
, &trait_ref
);
439 if Some(trait_ref
.def_id()) == tcx
.lang_items().try_trait() {
440 self.suggest_await_before_try(&mut err
, &obligation
, trait_ref
, span
);
443 if self.suggest_impl_trait(&mut err
, span
, &obligation
, trait_ref
) {
449 // If the obligation failed due to a missing implementation of the
450 // `Unsize` trait, give a pointer to why that might be the case
452 "all implementations of `Unsize` are provided \
453 automatically by the compiler, see \
454 <https://doc.rust-lang.org/stable/std/marker/trait.Unsize.html> \
455 for more information",
460 self.tcx
.lang_items().fn_trait(),
461 self.tcx
.lang_items().fn_mut_trait(),
462 self.tcx
.lang_items().fn_once_trait(),
464 .contains(&Some(trait_ref
.def_id()));
465 let is_target_feature_fn
= if let ty
::FnDef(def_id
, _
) =
466 *trait_ref
.skip_binder().self_ty().kind()
468 !self.tcx
.codegen_fn_attrs(def_id
).target_features
.is_empty()
472 if is_fn_trait
&& is_target_feature_fn
{
474 "`#[target_feature]` functions do not implement the `Fn` traits",
478 // Try to report a help message
479 if !trait_ref
.has_infer_types_or_consts()
480 && self.predicate_can_apply(obligation
.param_env
, trait_ref
)
482 // If a where-clause may be useful, remind the
483 // user that they can add it.
485 // don't display an on-unimplemented note, as
486 // these notes will often be of the form
487 // "the type `T` can't be frobnicated"
488 // which is somewhat confusing.
489 self.suggest_restricting_param_bound(
492 obligation
.cause
.body_id
,
494 } else if !have_alt_message
{
495 // Can't show anything else useful, try to find similar impls.
496 let impl_candidates
= self.find_similar_impl_candidates(trait_ref
);
497 self.report_similar_impl_candidates(impl_candidates
, &mut err
);
500 // Changing mutability doesn't make a difference to whether we have
501 // an `Unsize` impl (Fixes ICE in #71036)
503 self.suggest_change_mut(
511 // If this error is due to `!: Trait` not implemented but `(): Trait` is
512 // implemented, and fallback has occurred, then it could be due to a
513 // variable that used to fallback to `()` now falling back to `!`. Issue a
514 // note informing about the change in behaviour.
515 if trait_predicate
.skip_binder().self_ty().is_never()
516 && fallback_has_occurred
518 let predicate
= trait_predicate
.map_bound(|mut trait_pred
| {
519 trait_pred
.trait_ref
.substs
= self.tcx
.mk_substs_trait(
521 &trait_pred
.trait_ref
.substs
[1..],
525 let unit_obligation
= obligation
.with(predicate
.to_predicate(tcx
));
526 if self.predicate_may_hold(&unit_obligation
) {
527 err
.note("this trait is implemented for `()`.");
529 "this error might have been caused by changes to \
530 Rust's type-inference algorithm (see issue #48950 \
531 <https://github.com/rust-lang/rust/issues/48950> \
532 for more information).",
534 err
.help("did you intend to use the type `()` here instead?");
538 // Return early if the trait is Debug or Display and the invocation
539 // originates within a standard library macro, because the output
540 // is otherwise overwhelming and unhelpful (see #85844 for an
544 self.tcx
.is_diagnostic_item(sym
::debug_trait
, trait_ref
.def_id());
545 let trait_is_display
=
546 self.tcx
.is_diagnostic_item(sym
::display_trait
, trait_ref
.def_id());
549 match obligation
.cause
.span
.ctxt().outer_expn_data().macro_def_id
{
550 Some(macro_def_id
) => {
551 let crate_name
= tcx
.crate_name(macro_def_id
.krate
);
552 crate_name
== sym
::std
|| crate_name
== sym
::core
557 if in_std_macro
&& (trait_is_debug
|| trait_is_display
) {
565 ty
::PredicateKind
::Subtype(predicate
) => {
566 // Errors for Subtype predicates show up as
567 // `FulfillmentErrorCode::CodeSubtypeError`,
568 // not selection error.
569 span_bug
!(span
, "subtype requirement gave wrong error: `{:?}`", predicate
)
572 ty
::PredicateKind
::Coerce(predicate
) => {
573 // Errors for Coerce predicates show up as
574 // `FulfillmentErrorCode::CodeSubtypeError`,
575 // not selection error.
576 span_bug
!(span
, "coerce requirement gave wrong error: `{:?}`", predicate
)
579 ty
::PredicateKind
::RegionOutlives(predicate
) => {
580 let predicate
= bound_predicate
.rebind(predicate
);
581 let predicate
= self.resolve_vars_if_possible(predicate
);
583 .region_outlives_predicate(&obligation
.cause
, predicate
)
590 "the requirement `{}` is not satisfied (`{}`)",
596 ty
::PredicateKind
::Projection(..) | ty
::PredicateKind
::TypeOutlives(..) => {
597 let predicate
= self.resolve_vars_if_possible(obligation
.predicate
);
602 "the requirement `{}` is not satisfied",
607 ty
::PredicateKind
::ObjectSafe(trait_def_id
) => {
608 let violations
= self.tcx
.object_safety_violations(trait_def_id
);
609 report_object_safety_error(self.tcx
, span
, trait_def_id
, violations
)
612 ty
::PredicateKind
::ClosureKind(closure_def_id
, closure_substs
, kind
) => {
613 let found_kind
= self.closure_kind(closure_substs
).unwrap();
615 self.tcx
.sess
.source_map().guess_head_span(
616 self.tcx
.hir().span_if_local(closure_def_id
).unwrap(),
619 self.tcx
.hir().local_def_id_to_hir_id(closure_def_id
.expect_local());
620 let mut err
= struct_span_err
!(
624 "expected a closure that implements the `{}` trait, \
625 but this closure only implements `{}`",
632 format
!("this closure implements `{}`, not `{}`", found_kind
, kind
),
635 obligation
.cause
.span
,
636 format
!("the requirement to implement `{}` derives from here", kind
),
639 // Additional context information explaining why the closure only implements
640 // a particular trait.
641 if let Some(typeck_results
) = self.in_progress_typeck_results
{
642 let typeck_results
= typeck_results
.borrow();
643 match (found_kind
, typeck_results
.closure_kind_origins().get(hir_id
)) {
644 (ty
::ClosureKind
::FnOnce
, Some((span
, place
))) => {
648 "closure is `FnOnce` because it moves the \
649 variable `{}` out of its environment",
650 ty
::place_to_string_for_capture(tcx
, place
)
654 (ty
::ClosureKind
::FnMut
, Some((span
, place
))) => {
658 "closure is `FnMut` because it mutates the \
660 ty
::place_to_string_for_capture(tcx
, place
)
672 ty
::PredicateKind
::WellFormed(ty
) => {
673 if !self.tcx
.sess
.opts
.debugging_opts
.chalk
{
674 // WF predicates cannot themselves make
675 // errors. They can only block due to
676 // ambiguity; otherwise, they always
677 // degenerate into other obligations
679 span_bug
!(span
, "WF predicate not satisfied for {:?}", ty
);
681 // FIXME: we'll need a better message which takes into account
682 // which bounds actually failed to hold.
683 self.tcx
.sess
.struct_span_err(
685 &format
!("the type `{}` is not well-formed (chalk)", ty
),
690 ty
::PredicateKind
::ConstEvaluatable(..) => {
691 // Errors for `ConstEvaluatable` predicates show up as
692 // `SelectionError::ConstEvalFailure`,
693 // not `Unimplemented`.
696 "const-evaluatable requirement gave wrong error: `{:?}`",
701 ty
::PredicateKind
::ConstEquate(..) => {
702 // Errors for `ConstEquate` predicates show up as
703 // `SelectionError::ConstEvalFailure`,
704 // not `Unimplemented`.
707 "const-equate requirement gave wrong error: `{:?}`",
712 ty
::PredicateKind
::TypeWellFormedFromEnv(..) => span_bug
!(
714 "TypeWellFormedFromEnv predicate should only exist in the environment"
719 OutputTypeParameterMismatch(found_trait_ref
, expected_trait_ref
, _
) => {
720 let found_trait_ref
= self.resolve_vars_if_possible(found_trait_ref
);
721 let expected_trait_ref
= self.resolve_vars_if_possible(expected_trait_ref
);
723 if expected_trait_ref
.self_ty().references_error() {
727 let found_trait_ty
= match found_trait_ref
.self_ty().no_bound_vars() {
732 let found_did
= match *found_trait_ty
.kind() {
733 ty
::Closure(did
, _
) | ty
::Foreign(did
) | ty
::FnDef(did
, _
) => Some(did
),
734 ty
::Adt(def
, _
) => Some(def
.did
),
738 let found_span
= found_did
739 .and_then(|did
| self.tcx
.hir().span_if_local(did
))
740 .map(|sp
| self.tcx
.sess
.source_map().guess_head_span(sp
)); // the sp could be an fn def
742 if self.reported_closure_mismatch
.borrow().contains(&(span
, found_span
)) {
743 // We check closures twice, with obligations flowing in different directions,
744 // but we want to complain about them only once.
748 self.reported_closure_mismatch
.borrow_mut().insert((span
, found_span
));
750 let found
= match found_trait_ref
.skip_binder().substs
.type_at(1).kind() {
751 ty
::Tuple(ref tys
) => vec
![ArgKind
::empty(); tys
.len()],
752 _
=> vec
![ArgKind
::empty()],
755 let expected_ty
= expected_trait_ref
.skip_binder().substs
.type_at(1);
756 let expected
= match expected_ty
.kind() {
757 ty
::Tuple(ref tys
) => tys
759 .map(|t
| ArgKind
::from_expected_ty(t
.expect_ty(), Some(span
)))
761 _
=> vec
![ArgKind
::Arg("_".to_owned(), expected_ty
.to_string())],
764 if found
.len() == expected
.len() {
765 self.report_closure_arg_mismatch(
772 let (closure_span
, found
) = found_did
774 let node
= self.tcx
.hir().get_if_local(did
)?
;
775 let (found_span
, found
) = self.get_fn_like_arguments(node
)?
;
776 Some((Some(found_span
), found
))
778 .unwrap_or((found_span
, found
));
780 self.report_arg_count_mismatch(
785 found_trait_ty
.is_closure(),
790 TraitNotObjectSafe(did
) => {
791 let violations
= self.tcx
.object_safety_violations(did
);
792 report_object_safety_error(self.tcx
, span
, did
, violations
)
795 SelectionError
::NotConstEvaluatable(NotConstEvaluatable
::MentionsInfer
) => {
797 "MentionsInfer should have been handled in `traits/fulfill.rs` or `traits/select/mod.rs`"
800 SelectionError
::NotConstEvaluatable(NotConstEvaluatable
::MentionsParam
) => {
801 if !self.tcx
.features().generic_const_exprs
{
802 let mut err
= self.tcx
.sess
.struct_span_err(
804 "constant expression depends on a generic parameter",
806 // FIXME(const_generics): we should suggest to the user how they can resolve this
807 // issue. However, this is currently not actually possible
808 // (see https://github.com/rust-lang/rust/issues/66962#issuecomment-575907083).
810 // Note that with `feature(generic_const_exprs)` this case should not
812 err
.note("this may fail depending on what value the parameter takes");
817 match obligation
.predicate
.kind().skip_binder() {
818 ty
::PredicateKind
::ConstEvaluatable(uv
) => {
820 self.tcx
.sess
.struct_span_err(span
, "unconstrained generic constant");
821 let const_span
= self.tcx
.def_span(uv
.def
.did
);
822 match self.tcx
.sess
.source_map().span_to_snippet(const_span
) {
823 Ok(snippet
) => err
.help(&format
!(
824 "try adding a `where` bound using this expression: `where [(); {}]:`",
827 _
=> err
.help("consider adding a `where` bound using this expression"),
834 "unexpected non-ConstEvaluatable predicate, this should not be reachable"
840 // Already reported in the query.
841 SelectionError
::NotConstEvaluatable(NotConstEvaluatable
::Error(ErrorReported
)) => {
842 // FIXME(eddyb) remove this once `ErrorReported` becomes a proof token.
843 self.tcx
.sess
.delay_span_bug(span
, "`ErrorReported` without an error");
848 bug
!("overflow should be handled before the `report_selection_error` path");
852 self.note_obligation_cause(&mut err
, &obligation
);
853 self.point_at_returns_when_relevant(&mut err
, &obligation
);
858 /// Given some node representing a fn-like thing in the HIR map,
859 /// returns a span and `ArgKind` information that describes the
860 /// arguments it expects. This can be supplied to
861 /// `report_arg_count_mismatch`.
862 fn get_fn_like_arguments(&self, node
: Node
<'_
>) -> Option
<(Span
, Vec
<ArgKind
>)> {
863 let sm
= self.tcx
.sess
.source_map();
864 let hir
= self.tcx
.hir();
866 Node
::Expr(&hir
::Expr
{
867 kind
: hir
::ExprKind
::Closure(_
, ref _decl
, id
, span
, _
),
870 sm
.guess_head_span(span
),
875 if let hir
::Pat { kind: hir::PatKind::Tuple(ref args, _), span, .. }
=
882 sm
.span_to_snippet(pat
.span
)
884 .map(|snippet
| (snippet
, "_".to_owned()))
886 .collect
::<Option
<Vec
<_
>>>()?
,
889 let name
= sm
.span_to_snippet(arg
.pat
.span
).ok()?
;
890 Some(ArgKind
::Arg(name
, "_".to_owned()))
893 .collect
::<Option
<Vec
<ArgKind
>>>()?
,
895 Node
::Item(&hir
::Item { span, kind: hir::ItemKind::Fn(ref sig, ..), .. }
)
896 | Node
::ImplItem(&hir
::ImplItem
{
898 kind
: hir
::ImplItemKind
::Fn(ref sig
, _
),
901 | Node
::TraitItem(&hir
::TraitItem
{
903 kind
: hir
::TraitItemKind
::Fn(ref sig
, _
),
906 sm
.guess_head_span(span
),
910 .map(|arg
| match arg
.kind
{
911 hir
::TyKind
::Tup(ref tys
) => ArgKind
::Tuple(
913 vec
![("_".to_owned(), "_".to_owned()); tys
.len()],
915 _
=> ArgKind
::empty(),
917 .collect
::<Vec
<ArgKind
>>(),
919 Node
::Ctor(ref variant_data
) => {
920 let span
= variant_data
.ctor_hir_id().map_or(DUMMY_SP
, |id
| hir
.span(id
));
921 let span
= sm
.guess_head_span(span
);
922 (span
, vec
![ArgKind
::empty(); variant_data
.fields().len()])
924 _
=> panic
!("non-FnLike node found: {:?}", node
),
928 /// Reports an error when the number of arguments needed by a
929 /// trait match doesn't match the number that the expression
931 fn report_arg_count_mismatch(
934 found_span
: Option
<Span
>,
935 expected_args
: Vec
<ArgKind
>,
936 found_args
: Vec
<ArgKind
>,
938 ) -> DiagnosticBuilder
<'tcx
> {
939 let kind
= if is_closure { "closure" }
else { "function" }
;
941 let args_str
= |arguments
: &[ArgKind
], other
: &[ArgKind
]| {
942 let arg_length
= arguments
.len();
943 let distinct
= matches
!(other
, &[ArgKind
::Tuple(..)]);
944 match (arg_length
, arguments
.get(0)) {
945 (1, Some(&ArgKind
::Tuple(_
, ref fields
))) => {
946 format
!("a single {}-tuple as argument", fields
.len())
951 if distinct
&& arg_length
> 1 { "distinct " }
else { "" }
,
952 pluralize
!(arg_length
)
957 let expected_str
= args_str(&expected_args
, &found_args
);
958 let found_str
= args_str(&found_args
, &expected_args
);
960 let mut err
= struct_span_err
!(
964 "{} is expected to take {}, but it takes {}",
970 err
.span_label(span
, format
!("expected {} that takes {}", kind
, expected_str
));
972 if let Some(found_span
) = found_span
{
973 err
.span_label(found_span
, format
!("takes {}", found_str
));
976 // ^^^^^^^^-- def_span
980 let prefix_span
= self.tcx
.sess
.source_map().span_until_non_whitespace(found_span
);
984 if let Some(span
) = found_span
.trim_start(prefix_span
) { span }
else { found_span }
;
986 // Suggest to take and ignore the arguments with expected_args_length `_`s if
987 // found arguments is empty (assume the user just wants to ignore args in this case).
988 // For example, if `expected_args_length` is 2, suggest `|_, _|`.
989 if found_args
.is_empty() && is_closure
{
990 let underscores
= vec
!["_"; expected_args
.len()].join(", ");
991 err
.span_suggestion_verbose(
994 "consider changing the closure to take and ignore the expected argument{}",
995 pluralize
!(expected_args
.len())
997 format
!("|{}|", underscores
),
998 Applicability
::MachineApplicable
,
1002 if let &[ArgKind
::Tuple(_
, ref fields
)] = &found_args
[..] {
1003 if fields
.len() == expected_args
.len() {
1006 .map(|(name
, _
)| name
.to_owned())
1007 .collect
::<Vec
<String
>>()
1009 err
.span_suggestion_verbose(
1011 "change the closure to take multiple arguments instead of a single tuple",
1012 format
!("|{}|", sugg
),
1013 Applicability
::MachineApplicable
,
1017 if let &[ArgKind
::Tuple(_
, ref fields
)] = &expected_args
[..] {
1018 if fields
.len() == found_args
.len() && is_closure
{
1023 .map(|arg
| match arg
{
1024 ArgKind
::Arg(name
, _
) => name
.to_owned(),
1025 _
=> "_".to_owned(),
1027 .collect
::<Vec
<String
>>()
1029 // add type annotations if available
1030 if found_args
.iter().any(|arg
| match arg
{
1031 ArgKind
::Arg(_
, ty
) => ty
!= "_",
1038 .map(|(_
, ty
)| ty
.to_owned())
1039 .collect
::<Vec
<String
>>()
1046 err
.span_suggestion_verbose(
1048 "change the closure to accept a tuple instead of individual arguments",
1050 Applicability
::MachineApplicable
,
1060 trait InferCtxtPrivExt
<'tcx
> {
1061 // returns if `cond` not occurring implies that `error` does not occur - i.e., that
1062 // `error` occurring implies that `cond` occurs.
1063 fn error_implies(&self, cond
: ty
::Predicate
<'tcx
>, error
: ty
::Predicate
<'tcx
>) -> bool
;
1065 fn report_fulfillment_error(
1067 error
: &FulfillmentError
<'tcx
>,
1068 body_id
: Option
<hir
::BodyId
>,
1069 fallback_has_occurred
: bool
,
1072 fn report_projection_error(
1074 obligation
: &PredicateObligation
<'tcx
>,
1075 error
: &MismatchedProjectionTypes
<'tcx
>,
1078 fn fuzzy_match_tys(&self, a
: Ty
<'tcx
>, b
: Ty
<'tcx
>) -> bool
;
1080 fn describe_generator(&self, body_id
: hir
::BodyId
) -> Option
<&'
static str>;
1082 fn find_similar_impl_candidates(
1084 trait_ref
: ty
::PolyTraitRef
<'tcx
>,
1085 ) -> Vec
<ty
::TraitRef
<'tcx
>>;
1087 fn report_similar_impl_candidates(
1089 impl_candidates
: Vec
<ty
::TraitRef
<'tcx
>>,
1090 err
: &mut DiagnosticBuilder
<'_
>,
1093 /// Gets the parent trait chain start
1094 fn get_parent_trait_ref(
1096 code
: &ObligationCauseCode
<'tcx
>,
1097 ) -> Option
<(String
, Option
<Span
>)>;
1099 /// If the `Self` type of the unsatisfied trait `trait_ref` implements a trait
1100 /// with the same path as `trait_ref`, a help message about
1101 /// a probable version mismatch is added to `err`
1102 fn note_version_mismatch(
1104 err
: &mut DiagnosticBuilder
<'_
>,
1105 trait_ref
: &ty
::PolyTraitRef
<'tcx
>,
1108 /// Creates a `PredicateObligation` with `new_self_ty` replacing the existing type in the
1111 /// For this to work, `new_self_ty` must have no escaping bound variables.
1112 fn mk_trait_obligation_with_new_self_ty(
1114 param_env
: ty
::ParamEnv
<'tcx
>,
1115 trait_ref
: ty
::PolyTraitRef
<'tcx
>,
1116 new_self_ty
: Ty
<'tcx
>,
1117 ) -> PredicateObligation
<'tcx
>;
1119 fn maybe_report_ambiguity(
1121 obligation
: &PredicateObligation
<'tcx
>,
1122 body_id
: Option
<hir
::BodyId
>,
1125 fn predicate_can_apply(
1127 param_env
: ty
::ParamEnv
<'tcx
>,
1128 pred
: ty
::PolyTraitRef
<'tcx
>,
1131 fn note_obligation_cause(
1133 err
: &mut DiagnosticBuilder
<'tcx
>,
1134 obligation
: &PredicateObligation
<'tcx
>,
1137 fn suggest_unsized_bound_if_applicable(
1139 err
: &mut DiagnosticBuilder
<'tcx
>,
1140 obligation
: &PredicateObligation
<'tcx
>,
1143 fn maybe_suggest_unsized_generics(
1145 err
: &mut DiagnosticBuilder
<'tcx
>,
1150 fn maybe_indirection_for_unsized(
1152 err
: &mut DiagnosticBuilder
<'tcx
>,
1153 item
: &'hir Item
<'hir
>,
1154 param
: &'hir GenericParam
<'hir
>,
1157 fn is_recursive_obligation(
1159 obligated_types
: &mut Vec
<&ty
::TyS
<'tcx
>>,
1160 cause_code
: &ObligationCauseCode
<'tcx
>,
1164 impl<'a
, 'tcx
> InferCtxtPrivExt
<'tcx
> for InferCtxt
<'a
, 'tcx
> {
1165 // returns if `cond` not occurring implies that `error` does not occur - i.e., that
1166 // `error` occurring implies that `cond` occurs.
1167 fn error_implies(&self, cond
: ty
::Predicate
<'tcx
>, error
: ty
::Predicate
<'tcx
>) -> bool
{
1172 // FIXME: It should be possible to deal with `ForAll` in a cleaner way.
1173 let bound_error
= error
.kind();
1174 let (cond
, error
) = match (cond
.kind().skip_binder(), bound_error
.skip_binder()) {
1175 (ty
::PredicateKind
::Trait(..), ty
::PredicateKind
::Trait(error
)) => {
1176 (cond
, bound_error
.rebind(error
))
1179 // FIXME: make this work in other cases too.
1184 for obligation
in super::elaborate_predicates(self.tcx
, std
::iter
::once(cond
)) {
1185 let bound_predicate
= obligation
.predicate
.kind();
1186 if let ty
::PredicateKind
::Trait(implication
) = bound_predicate
.skip_binder() {
1187 let error
= error
.to_poly_trait_ref();
1188 let implication
= bound_predicate
.rebind(implication
.trait_ref
);
1189 // FIXME: I'm just not taking associated types at all here.
1190 // Eventually I'll need to implement param-env-aware
1191 // `Γ₁ ⊦ φ₁ => Γ₂ ⊦ φ₂` logic.
1192 let param_env
= ty
::ParamEnv
::empty();
1193 if self.can_sub(param_env
, error
, implication
).is_ok() {
1194 debug
!("error_implies: {:?} -> {:?} -> {:?}", cond
, error
, implication
);
1203 fn report_fulfillment_error(
1205 error
: &FulfillmentError
<'tcx
>,
1206 body_id
: Option
<hir
::BodyId
>,
1207 fallback_has_occurred
: bool
,
1209 debug
!("report_fulfillment_error({:?})", error
);
1211 FulfillmentErrorCode
::CodeSelectionError(ref selection_error
) => {
1212 self.report_selection_error(
1213 error
.obligation
.clone(),
1214 &error
.root_obligation
,
1216 fallback_has_occurred
,
1217 error
.points_at_arg_span
,
1220 FulfillmentErrorCode
::CodeProjectionError(ref e
) => {
1221 self.report_projection_error(&error
.obligation
, e
);
1223 FulfillmentErrorCode
::CodeAmbiguity
=> {
1224 self.maybe_report_ambiguity(&error
.obligation
, body_id
);
1226 FulfillmentErrorCode
::CodeSubtypeError(ref expected_found
, ref err
) => {
1227 self.report_mismatched_types(
1228 &error
.obligation
.cause
,
1229 expected_found
.expected
,
1230 expected_found
.found
,
1235 FulfillmentErrorCode
::CodeConstEquateError(ref expected_found
, ref err
) => {
1236 self.report_mismatched_consts(
1237 &error
.obligation
.cause
,
1238 expected_found
.expected
,
1239 expected_found
.found
,
1247 fn report_projection_error(
1249 obligation
: &PredicateObligation
<'tcx
>,
1250 error
: &MismatchedProjectionTypes
<'tcx
>,
1252 let predicate
= self.resolve_vars_if_possible(obligation
.predicate
);
1254 if predicate
.references_error() {
1260 let mut err
= &error
.err
;
1261 let mut values
= None
;
1263 // try to find the mismatched types to report the error with.
1265 // this can fail if the problem was higher-ranked, in which
1266 // cause I have no idea for a good error message.
1267 let bound_predicate
= predicate
.kind();
1268 if let ty
::PredicateKind
::Projection(data
) = bound_predicate
.skip_binder() {
1269 let mut selcx
= SelectionContext
::new(self);
1270 let (data
, _
) = self.replace_bound_vars_with_fresh_vars(
1271 obligation
.cause
.span
,
1272 infer
::LateBoundRegionConversionTime
::HigherRankedType
,
1273 bound_predicate
.rebind(data
),
1275 let mut obligations
= vec
![];
1276 let normalized_ty
= super::normalize_projection_type(
1278 obligation
.param_env
,
1280 obligation
.cause
.clone(),
1286 "report_projection_error obligation.cause={:?} obligation.param_env={:?}",
1287 obligation
.cause
, obligation
.param_env
1291 "report_projection_error normalized_ty={:?} data.ty={:?}",
1292 normalized_ty
, data
.ty
1295 let is_normalized_ty_expected
= !matches
!(
1296 obligation
.cause
.code
.peel_derives(),
1297 ObligationCauseCode
::ItemObligation(_
)
1298 | ObligationCauseCode
::BindingObligation(_
, _
)
1299 | ObligationCauseCode
::ObjectCastObligation(_
)
1300 | ObligationCauseCode
::OpaqueType
1303 if let Err(error
) = self.at(&obligation
.cause
, obligation
.param_env
).eq_exp(
1304 is_normalized_ty_expected
,
1308 values
= Some(infer
::ValuePairs
::Types(ExpectedFound
::new(
1309 is_normalized_ty_expected
,
1319 let msg
= format
!("type mismatch resolving `{}`", predicate
);
1320 let error_id
= (DiagnosticMessageId
::ErrorId(271), Some(obligation
.cause
.span
), msg
);
1321 let fresh
= self.tcx
.sess
.one_time_diagnostics
.borrow_mut().insert(error_id
);
1323 let mut diag
= struct_span_err
!(
1325 obligation
.cause
.span
,
1327 "type mismatch resolving `{}`",
1330 self.note_type_err(&mut diag
, &obligation
.cause
, None
, values
, err
);
1331 self.note_obligation_cause(&mut diag
, obligation
);
1337 fn fuzzy_match_tys(&self, a
: Ty
<'tcx
>, b
: Ty
<'tcx
>) -> bool
{
1338 /// returns the fuzzy category of a given type, or None
1339 /// if the type can be equated to any type.
1340 fn type_category(t
: Ty
<'_
>) -> Option
<u32> {
1342 ty
::Bool
=> Some(0),
1343 ty
::Char
=> Some(1),
1345 ty
::Int(..) | ty
::Uint(..) | ty
::Infer(ty
::IntVar(..)) => Some(3),
1346 ty
::Float(..) | ty
::Infer(ty
::FloatVar(..)) => Some(4),
1347 ty
::Ref(..) | ty
::RawPtr(..) => Some(5),
1348 ty
::Array(..) | ty
::Slice(..) => Some(6),
1349 ty
::FnDef(..) | ty
::FnPtr(..) => Some(7),
1350 ty
::Dynamic(..) => Some(8),
1351 ty
::Closure(..) => Some(9),
1352 ty
::Tuple(..) => Some(10),
1353 ty
::Projection(..) => Some(11),
1354 ty
::Param(..) => Some(12),
1355 ty
::Opaque(..) => Some(13),
1356 ty
::Never
=> Some(14),
1357 ty
::Adt(adt
, ..) => match adt
.adt_kind() {
1358 AdtKind
::Struct
=> Some(15),
1359 AdtKind
::Union
=> Some(16),
1360 AdtKind
::Enum
=> Some(17),
1362 ty
::Generator(..) => Some(18),
1363 ty
::Foreign(..) => Some(19),
1364 ty
::GeneratorWitness(..) => Some(20),
1365 ty
::Placeholder(..) | ty
::Bound(..) | ty
::Infer(..) | ty
::Error(_
) => None
,
1369 match (type_category(a
), type_category(b
)) {
1370 (Some(cat_a
), Some(cat_b
)) => match (a
.kind(), b
.kind()) {
1371 (&ty
::Adt(def_a
, _
), &ty
::Adt(def_b
, _
)) => def_a
== def_b
,
1372 _
=> cat_a
== cat_b
,
1374 // infer and error can be equated to all types
1379 fn describe_generator(&self, body_id
: hir
::BodyId
) -> Option
<&'
static str> {
1380 self.tcx
.hir().body(body_id
).generator_kind
.map(|gen_kind
| match gen_kind
{
1381 hir
::GeneratorKind
::Gen
=> "a generator",
1382 hir
::GeneratorKind
::Async(hir
::AsyncGeneratorKind
::Block
) => "an async block",
1383 hir
::GeneratorKind
::Async(hir
::AsyncGeneratorKind
::Fn
) => "an async function",
1384 hir
::GeneratorKind
::Async(hir
::AsyncGeneratorKind
::Closure
) => "an async closure",
1388 fn find_similar_impl_candidates(
1390 trait_ref
: ty
::PolyTraitRef
<'tcx
>,
1391 ) -> Vec
<ty
::TraitRef
<'tcx
>> {
1392 let simp
= fast_reject
::simplify_type(self.tcx
, trait_ref
.skip_binder().self_ty(), true);
1393 let all_impls
= self.tcx
.all_impls(trait_ref
.def_id());
1396 Some(simp
) => all_impls
1397 .filter_map(|def_id
| {
1398 let imp
= self.tcx
.impl_trait_ref(def_id
).unwrap();
1399 let imp_simp
= fast_reject
::simplify_type(self.tcx
, imp
.self_ty(), true);
1400 if let Some(imp_simp
) = imp_simp
{
1401 if simp
!= imp_simp
{
1405 if self.tcx
.impl_polarity(def_id
) == ty
::ImplPolarity
::Negative
{
1412 .filter_map(|def_id
| {
1413 if self.tcx
.impl_polarity(def_id
) == ty
::ImplPolarity
::Negative
{
1416 self.tcx
.impl_trait_ref(def_id
)
1422 fn report_similar_impl_candidates(
1424 impl_candidates
: Vec
<ty
::TraitRef
<'tcx
>>,
1425 err
: &mut DiagnosticBuilder
<'_
>,
1427 if impl_candidates
.is_empty() {
1431 let len
= impl_candidates
.len();
1432 let end
= if impl_candidates
.len() <= 5 { impl_candidates.len() }
else { 4 }
;
1434 let normalize
= |candidate
| {
1435 self.tcx
.infer_ctxt().enter(|ref infcx
| {
1436 let normalized
= infcx
1437 .at(&ObligationCause
::dummy(), ty
::ParamEnv
::empty())
1438 .normalize(candidate
)
1441 Some(normalized
) => format
!("\n {}", normalized
.value
),
1442 None
=> format
!("\n {}", candidate
),
1447 // Sort impl candidates so that ordering is consistent for UI tests.
1448 let mut normalized_impl_candidates
=
1449 impl_candidates
.iter().copied().map(normalize
).collect
::<Vec
<String
>>();
1451 // Sort before taking the `..end` range,
1452 // because the ordering of `impl_candidates` may not be deterministic:
1453 // https://github.com/rust-lang/rust/pull/57475#issuecomment-455519507
1454 normalized_impl_candidates
.sort();
1457 "the following implementations were found:{}{}",
1458 normalized_impl_candidates
[..end
].join(""),
1459 if len
> 5 { format!("\nand {} others
", len - 4) } else { String::new() }
1463 /// Gets the parent trait chain start
1464 fn get_parent_trait_ref(
1466 code: &ObligationCauseCode<'tcx>,
1467 ) -> Option<(String, Option<Span>)> {
1469 ObligationCauseCode::BuiltinDerivedObligation(data) => {
1470 let parent_trait_ref = self.resolve_vars_if_possible(data.parent_trait_ref);
1471 match self.get_parent_trait_ref(&data.parent_code) {
1474 let ty = parent_trait_ref.skip_binder().self_ty();
1475 let span = TyCategory::from_ty(self.tcx, ty)
1476 .map(|(_, def_id)| self.tcx.def_span(def_id));
1477 Some((ty.to_string(), span))
1485 /// If the `Self` type of the unsatisfied trait `trait_ref` implements a trait
1486 /// with the same path as `trait_ref`, a help message about
1487 /// a probable version mismatch is added to `err`
1488 fn note_version_mismatch(
1490 err: &mut DiagnosticBuilder<'_>,
1491 trait_ref: &ty::PolyTraitRef<'tcx>,
1493 let get_trait_impl = |trait_def_id| {
1494 self.tcx.find_map_relevant_impl(trait_def_id, trait_ref.skip_binder().self_ty(), Some)
1496 let required_trait_path = self.tcx.def_path_str(trait_ref.def_id());
1497 let all_traits = self.tcx.all_traits(());
1498 let traits_with_same_path: std::collections::BTreeSet<_> = all_traits
1500 .filter(|trait_def_id| **trait_def_id != trait_ref.def_id())
1501 .filter(|trait_def_id| self.tcx.def_path_str(**trait_def_id) == required_trait_path)
1503 for trait_with_same_path in traits_with_same_path {
1504 if let Some(impl_def_id) = get_trait_impl(*trait_with_same_path) {
1505 let impl_span = self.tcx.def_span(impl_def_id);
1506 err.span_help(impl_span, "trait impl with same name found
");
1507 let trait_crate = self.tcx.crate_name(trait_with_same_path.krate);
1508 let crate_msg = format!(
1509 "perhaps two different versions of
crate `{}` are being used?
",
1512 err.note(&crate_msg);
1517 fn mk_trait_obligation_with_new_self_ty(
1519 param_env: ty::ParamEnv<'tcx>,
1520 trait_ref: ty::PolyTraitRef<'tcx>,
1521 new_self_ty: Ty<'tcx>,
1522 ) -> PredicateObligation<'tcx> {
1523 assert!(!new_self_ty.has_escaping_bound_vars());
1525 let trait_ref = trait_ref.map_bound_ref(|tr| ty::TraitRef {
1526 substs: self.tcx.mk_substs_trait(new_self_ty, &tr.substs[1..]),
1531 ObligationCause::dummy(),
1533 trait_ref.without_const().to_predicate(self.tcx),
1537 fn maybe_report_ambiguity(
1539 obligation: &PredicateObligation<'tcx>,
1540 body_id: Option<hir::BodyId>,
1542 // Unable to successfully determine, probably means
1543 // insufficient type information, but could mean
1544 // ambiguous impls. The latter *ought* to be a
1545 // coherence violation, so we don't report it here.
1547 let predicate = self.resolve_vars_if_possible(obligation.predicate);
1548 let span = obligation.cause.span;
1551 "maybe_report_ambiguity(predicate
={:?}
, obligation
={:?} body_id
={:?}
, code
={:?}
)",
1552 predicate, obligation, body_id, obligation.cause.code,
1555 // Ambiguity errors are often caused as fallout from earlier
1556 // errors. So just ignore them if this infcx is tainted.
1557 if self.is_tainted_by_errors() {
1561 let bound_predicate = predicate.kind();
1562 let mut err = match bound_predicate.skip_binder() {
1563 ty::PredicateKind::Trait(data) => {
1564 let trait_ref = bound_predicate.rebind(data.trait_ref);
1565 debug!("trait_ref {:?}
", trait_ref);
1567 if predicate.references_error() {
1570 // Typically, this ambiguity should only happen if
1571 // there are unresolved type inference variables
1572 // (otherwise it would suggest a coherence
1573 // failure). But given #21974 that is not necessarily
1574 // the case -- we can have multiple where clauses that
1575 // are only distinguished by a region, which results
1576 // in an ambiguity even when all types are fully
1577 // known, since we don't dispatch based on region
1580 // Pick the first substitution that still contains inference variables as the one
1581 // we're going to emit an error for. If there are none (see above), fall back to
1582 // the substitution for `Self`.
1584 let substs = data.trait_ref.substs;
1587 .find(|s| s.has_infer_types_or_consts())
1588 .unwrap_or_else(|| substs[0])
1591 // This is kind of a hack: it frequently happens that some earlier
1592 // error prevents types from being fully inferred, and then we get
1593 // a bunch of uninteresting errors saying something like "<generic
1594 // #0> doesn't implement Sized". It may even be true that we
1595 // could just skip over all checks where the self-ty is an
1596 // inference variable, but I was afraid that there might be an
1597 // inference variable created, registered as an obligation, and
1598 // then never forced by writeback, and hence by skipping here we'd
1599 // be ignoring the fact that we don't KNOW the type works
1600 // out. Though even that would probably be harmless, given that
1601 // we're only talking about builtin traits, which are known to be
1602 // inhabited. We used to check for `self.tcx.sess.has_errors()` to
1603 // avoid inundating the user with unnecessary errors, but we now
1604 // check upstream for type errors and don't add the obligations to
1605 // begin with in those cases.
1606 if self.tcx
.lang_items().sized_trait() == Some(trait_ref
.def_id()) {
1607 self.emit_inference_failure_err(body_id
, span
, subst
, vec
![], ErrorCode
::E0282
)
1611 let impl_candidates
= self.find_similar_impl_candidates(trait_ref
);
1612 let mut err
= self.emit_inference_failure_err(
1619 err
.note(&format
!("cannot satisfy `{}`", predicate
));
1620 if let ObligationCauseCode
::ItemObligation(def_id
) = obligation
.cause
.code
{
1621 self.suggest_fully_qualified_path(&mut err
, def_id
, span
, trait_ref
.def_id());
1624 ObligationCauseCode
::BindingObligation(ref def_id
, _
),
1626 (self.tcx
.sess
.source_map().span_to_snippet(span
), &obligation
.cause
.code
)
1628 let generics
= self.tcx
.generics_of(*def_id
);
1629 if generics
.params
.iter().any(|p
| p
.name
!= kw
::SelfUpper
)
1630 && !snippet
.ends_with('
>'
)
1631 && !generics
.has_impl_trait()
1632 && !self.tcx
.fn_trait_kind_from_lang_item(*def_id
).is_some()
1634 // FIXME: To avoid spurious suggestions in functions where type arguments
1635 // where already supplied, we check the snippet to make sure it doesn't
1636 // end with a turbofish. Ideally we would have access to a `PathSegment`
1637 // instead. Otherwise we would produce the following output:
1639 // error[E0283]: type annotations needed
1640 // --> $DIR/issue-54954.rs:3:24
1642 // LL | const ARR_LEN: usize = Tt::const_val::<[i8; 123]>();
1643 // | ^^^^^^^^^^^^^^^^^^^^^^^^^^
1645 // | cannot infer type
1646 // | help: consider specifying the type argument
1647 // | in the function call:
1648 // | `Tt::const_val::<[i8; 123]>::<T>`
1650 // LL | const fn const_val<T: Sized>() -> usize {
1651 // | - required by this bound in `Tt::const_val`
1653 // = note: cannot satisfy `_: Tt`
1655 err
.span_suggestion_verbose(
1656 span
.shrink_to_hi(),
1658 "consider specifying the type argument{} in the function call",
1659 pluralize
!(generics
.params
.len()),
1666 .map(|p
| p
.name
.to_string())
1667 .collect
::<Vec
<String
>>()
1670 Applicability
::HasPlaceholders
,
1677 ty
::PredicateKind
::WellFormed(arg
) => {
1678 // Same hacky approach as above to avoid deluging user
1679 // with error messages.
1680 if arg
.references_error() || self.tcx
.sess
.has_errors() {
1684 self.emit_inference_failure_err(body_id
, span
, arg
, vec
![], ErrorCode
::E0282
)
1687 ty
::PredicateKind
::Subtype(data
) => {
1688 if data
.references_error() || self.tcx
.sess
.has_errors() {
1689 // no need to overload user in such cases
1692 let SubtypePredicate { a_is_expected: _, a, b }
= data
;
1693 // both must be type variables, or the other would've been instantiated
1694 assert
!(a
.is_ty_var() && b
.is_ty_var());
1695 self.emit_inference_failure_err(body_id
, span
, a
.into(), vec
![], ErrorCode
::E0282
)
1697 ty
::PredicateKind
::Projection(data
) => {
1698 let self_ty
= data
.projection_ty
.self_ty();
1700 if predicate
.references_error() {
1703 if self_ty
.needs_infer() && ty
.needs_infer() {
1704 // We do this for the `foo.collect()?` case to produce a suggestion.
1705 let mut err
= self.emit_inference_failure_err(
1712 err
.note(&format
!("cannot satisfy `{}`", predicate
));
1715 let mut err
= struct_span_err
!(
1719 "type annotations needed: cannot satisfy `{}`",
1722 err
.span_label(span
, &format
!("cannot satisfy `{}`", predicate
));
1728 if self.tcx
.sess
.has_errors() {
1731 let mut err
= struct_span_err
!(
1735 "type annotations needed: cannot satisfy `{}`",
1738 err
.span_label(span
, &format
!("cannot satisfy `{}`", predicate
));
1742 self.note_obligation_cause(&mut err
, obligation
);
1746 /// Returns `true` if the trait predicate may apply for *some* assignment
1747 /// to the type parameters.
1748 fn predicate_can_apply(
1750 param_env
: ty
::ParamEnv
<'tcx
>,
1751 pred
: ty
::PolyTraitRef
<'tcx
>,
1753 struct ParamToVarFolder
<'a
, 'tcx
> {
1754 infcx
: &'a InferCtxt
<'a
, 'tcx
>,
1755 var_map
: FxHashMap
<Ty
<'tcx
>, Ty
<'tcx
>>,
1758 impl<'a
, 'tcx
> TypeFolder
<'tcx
> for ParamToVarFolder
<'a
, 'tcx
> {
1759 fn tcx
<'b
>(&'b
self) -> TyCtxt
<'tcx
> {
1763 fn fold_ty(&mut self, ty
: Ty
<'tcx
>) -> Ty
<'tcx
> {
1764 if let ty
::Param(ty
::ParamTy { name, .. }
) = *ty
.kind() {
1765 let infcx
= self.infcx
;
1766 self.var_map
.entry(ty
).or_insert_with(|| {
1767 infcx
.next_ty_var(TypeVariableOrigin
{
1768 kind
: TypeVariableOriginKind
::TypeParameterDefinition(name
, None
),
1773 ty
.super_fold_with(self)
1779 let mut selcx
= SelectionContext
::new(self);
1782 pred
.fold_with(&mut ParamToVarFolder { infcx: self, var_map: Default::default() }
);
1784 let cleaned_pred
= super::project
::normalize(
1787 ObligationCause
::dummy(),
1792 let obligation
= Obligation
::new(
1793 ObligationCause
::dummy(),
1795 cleaned_pred
.without_const().to_predicate(selcx
.tcx()),
1798 self.predicate_may_hold(&obligation
)
1802 fn note_obligation_cause(
1804 err
: &mut DiagnosticBuilder
<'tcx
>,
1805 obligation
: &PredicateObligation
<'tcx
>,
1807 // First, attempt to add note to this error with an async-await-specific
1808 // message, and fall back to regular note otherwise.
1809 if !self.maybe_note_obligation_cause_for_async_await(err
, obligation
) {
1810 self.note_obligation_cause_code(
1812 &obligation
.predicate
,
1813 &obligation
.cause
.code
,
1815 &mut Default
::default(),
1817 self.suggest_unsized_bound_if_applicable(err
, obligation
);
1821 fn suggest_unsized_bound_if_applicable(
1823 err
: &mut DiagnosticBuilder
<'tcx
>,
1824 obligation
: &PredicateObligation
<'tcx
>,
1826 let (pred
, item_def_id
, span
) =
1827 match (obligation
.predicate
.kind().skip_binder(), obligation
.cause
.code
.peel_derives())
1830 ty
::PredicateKind
::Trait(pred
),
1831 &ObligationCauseCode
::BindingObligation(item_def_id
, span
),
1832 ) => (pred
, item_def_id
, span
),
1836 "suggest_unsized_bound_if_applicable: pred={:?} item_def_id={:?} span={:?}",
1837 pred
, item_def_id
, span
1840 self.tcx
.hir().get_if_local(item_def_id
),
1841 Some(pred
.def_id()) == self.tcx
.lang_items().sized_trait(),
1843 (Some(node
), true) => node
,
1846 self.maybe_suggest_unsized_generics(err
, span
, node
);
1849 fn maybe_suggest_unsized_generics(
1851 err
: &mut DiagnosticBuilder
<'tcx
>,
1855 let generics
= match node
.generics() {
1856 Some(generics
) => generics
,
1859 let sized_trait
= self.tcx
.lang_items().sized_trait();
1860 debug
!("maybe_suggest_unsized_generics: generics.params={:?}", generics
.params
);
1861 debug
!("maybe_suggest_unsized_generics: generics.where_clause={:?}", generics
.where_clause
);
1862 let param
= generics
1865 .filter(|param
| param
.span
== span
)
1867 // Check that none of the explicit trait bounds is `Sized`. Assume that an explicit
1868 // `Sized` bound is there intentionally and we don't need to suggest relaxing it.
1872 .all(|bound
| bound
.trait_ref().and_then(|tr
| tr
.trait_def_id()) != sized_trait
)
1875 let param
= match param
{
1876 Some(param
) => param
,
1879 debug
!("maybe_suggest_unsized_generics: param={:?}", param
);
1885 // Only suggest indirection for uses of type parameters in ADTs.
1887 hir
::ItemKind
::Enum(..) | hir
::ItemKind
::Struct(..) | hir
::ItemKind
::Union(..),
1891 if self.maybe_indirection_for_unsized(err
, item
, param
) {
1897 // Didn't add an indirection suggestion, so add a general suggestion to relax `Sized`.
1898 let (span
, separator
) = match param
.bounds
{
1899 [] => (span
.shrink_to_hi(), ":"),
1900 [.., bound
] => (bound
.span().shrink_to_hi(), " +"),
1902 err
.span_suggestion_verbose(
1904 "consider relaxing the implicit `Sized` restriction",
1905 format
!("{} ?Sized", separator
),
1906 Applicability
::MachineApplicable
,
1910 fn maybe_indirection_for_unsized(
1912 err
: &mut DiagnosticBuilder
<'tcx
>,
1913 item
: &'hir Item
<'hir
>,
1914 param
: &'hir GenericParam
<'hir
>,
1916 // Suggesting `T: ?Sized` is only valid in an ADT if `T` is only used in a
1917 // borrow. `struct S<'a, T: ?Sized>(&'a T);` is valid, `struct S<T: ?Sized>(T);`
1918 // is not. Look for invalid "bare" parameter uses, and suggest using indirection.
1920 FindTypeParam { param: param.name.ident().name, invalid_spans: vec![], nested: false }
;
1921 visitor
.visit_item(item
);
1922 if visitor
.invalid_spans
.is_empty() {
1925 let mut multispan
: MultiSpan
= param
.span
.into();
1926 multispan
.push_span_label(
1928 format
!("this could be changed to `{}: ?Sized`...", param
.name
.ident()),
1930 for sp
in visitor
.invalid_spans
{
1931 multispan
.push_span_label(
1933 format
!("...if indirection were used here: `Box<{}>`", param
.name
.ident()),
1939 "you could relax the implicit `Sized` bound on `{T}` if it were \
1940 used through indirection like `&{T}` or `Box<{T}>`",
1941 T
= param
.name
.ident(),
1947 fn is_recursive_obligation(
1949 obligated_types
: &mut Vec
<&ty
::TyS
<'tcx
>>,
1950 cause_code
: &ObligationCauseCode
<'tcx
>,
1952 if let ObligationCauseCode
::BuiltinDerivedObligation(ref data
) = cause_code
{
1953 let parent_trait_ref
= self.resolve_vars_if_possible(data
.parent_trait_ref
);
1955 if obligated_types
.iter().any(|ot
| ot
== &parent_trait_ref
.skip_binder().self_ty()) {
1963 /// Look for type `param` in an ADT being used only through a reference to confirm that suggesting
1964 /// `param: ?Sized` would be a valid constraint.
1965 struct FindTypeParam
{
1966 param
: rustc_span
::Symbol
,
1967 invalid_spans
: Vec
<Span
>,
1971 impl<'v
> Visitor
<'v
> for FindTypeParam
{
1972 type Map
= rustc_hir
::intravisit
::ErasedMap
<'v
>;
1974 fn nested_visit_map(&mut self) -> hir
::intravisit
::NestedVisitorMap
<Self::Map
> {
1975 hir
::intravisit
::NestedVisitorMap
::None
1978 fn visit_where_predicate(&mut self, _
: &'v hir
::WherePredicate
<'v
>) {
1979 // Skip where-clauses, to avoid suggesting indirection for type parameters found there.
1982 fn visit_ty(&mut self, ty
: &hir
::Ty
<'_
>) {
1983 // We collect the spans of all uses of the "bare" type param, like in `field: T` or
1984 // `field: (T, T)` where we could make `T: ?Sized` while skipping cases that are known to be
1985 // valid like `field: &'a T` or `field: *mut T` and cases that *might* have further `Sized`
1986 // obligations like `Box<T>` and `Vec<T>`, but we perform no extra analysis for those cases
1987 // and suggest `T: ?Sized` regardless of their obligations. This is fine because the errors
1988 // in that case should make what happened clear enough.
1990 hir
::TyKind
::Ptr(_
) | hir
::TyKind
::Rptr(..) | hir
::TyKind
::TraitObject(..) => {}
1991 hir
::TyKind
::Path(hir
::QPath
::Resolved(None
, path
))
1992 if path
.segments
.len() == 1 && path
.segments
[0].ident
.name
== self.param
=>
1995 debug
!("FindTypeParam::visit_ty: ty={:?}", ty
);
1996 self.invalid_spans
.push(ty
.span
);
1999 hir
::TyKind
::Path(_
) => {
2000 let prev
= self.nested
;
2002 hir
::intravisit
::walk_ty(self, ty
);
2006 hir
::intravisit
::walk_ty(self, ty
);
2012 pub fn recursive_type_with_infinite_size_error(
2017 assert
!(type_def_id
.is_local());
2018 let span
= tcx
.hir().span_if_local(type_def_id
).unwrap();
2019 let span
= tcx
.sess
.source_map().guess_head_span(span
);
2020 let path
= tcx
.def_path_str(type_def_id
);
2022 struct_span_err
!(tcx
.sess
, span
, E0072
, "recursive type `{}` has infinite size", path
);
2023 err
.span_label(span
, "recursive type has infinite size");
2024 for &span
in &spans
{
2025 err
.span_label(span
, "recursive without indirection");
2028 "insert some indirection (e.g., a `Box`, `Rc`, or `&`) to make `{}` representable",
2031 if spans
.len() <= 4 {
2032 err
.multipart_suggestion(
2038 (span
.shrink_to_lo(), "Box<".to_string()),
2039 (span
.shrink_to_hi(), ">".to_string()),
2044 Applicability
::HasPlaceholders
,
2052 /// Summarizes information
2055 /// An argument of non-tuple type. Parameters are (name, ty)
2056 Arg(String
, String
),
2058 /// An argument of tuple type. For a "found" argument, the span is
2059 /// the location in the source of the pattern. For an "expected"
2060 /// argument, it will be None. The vector is a list of (name, ty)
2061 /// strings for the components of the tuple.
2062 Tuple(Option
<Span
>, Vec
<(String
, String
)>),
2066 fn empty() -> ArgKind
{
2067 ArgKind
::Arg("_".to_owned(), "_".to_owned())
2070 /// Creates an `ArgKind` from the expected type of an
2071 /// argument. It has no name (`_`) and an optional source span.
2072 pub fn from_expected_ty(t
: Ty
<'_
>, span
: Option
<Span
>) -> ArgKind
{
2074 ty
::Tuple(tys
) => ArgKind
::Tuple(
2076 tys
.iter().map(|ty
| ("_".to_owned(), ty
.to_string())).collect
::<Vec
<_
>>(),
2078 _
=> ArgKind
::Arg("_".to_owned(), t
.to_string()),