1 // ignore-tidy-filelength FIXME(#67418) Split up this file.
2 //! Conversion from AST representation of types to the `ty.rs` representation.
3 //! The main routine here is `ast_ty_to_ty()`; each use is parameterized by an
4 //! instance of `AstConv`.
6 // ignore-tidy-filelength
8 use crate::collect::PlaceholderHirTyCollector;
9 use crate::middle::resolve_lifetime as rl;
10 use crate::require_c_abi_if_c_variadic;
12 use rustc_ast::util::lev_distance::find_best_match_for_name;
13 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
14 use rustc_errors::ErrorReported;
15 use rustc_errors::{pluralize, struct_span_err, Applicability, DiagnosticId, FatalError};
17 use rustc_hir::def::{CtorOf, DefKind, Namespace, Res};
18 use rustc_hir::def_id::DefId;
19 use rustc_hir::intravisit::{walk_generics, Visitor as _};
20 use rustc_hir::lang_items::SizedTraitLangItem;
21 use rustc_hir::{Constness, GenericArg, GenericArgs};
22 use rustc_middle::ty::subst::{self, InternalSubsts, Subst, SubstsRef};
23 use rustc_middle::ty::{
24 self, Const, DefIdTree, ToPredicate, Ty, TyCtxt, TypeFoldable, WithConstness,
26 use rustc_middle::ty::{GenericParamDef, GenericParamDefKind};
27 use rustc_session::lint::builtin::{AMBIGUOUS_ASSOCIATED_ITEMS, LATE_BOUND_LIFETIME_ARGUMENTS};
28 use rustc_session::parse::feature_err;
29 use rustc_session::Session;
30 use rustc_span::symbol::sym;
31 use rustc_span::{MultiSpan, Span, DUMMY_SP};
32 use rustc_target::spec::abi;
33 use rustc_trait_selection::traits;
34 use rustc_trait_selection::traits::astconv_object_safety_violations;
35 use rustc_trait_selection::traits::error_reporting::report_object_safety_error;
36 use rustc_trait_selection::traits::wf::object_region_bounds;
38 use smallvec::SmallVec;
39 use std::collections::BTreeSet;
44 pub struct PathSeg(pub DefId, pub usize);
46 pub trait AstConv<'tcx> {
47 fn tcx<'a>(&'a self) -> TyCtxt<'tcx>;
49 fn item_def_id(&self) -> Option<DefId>;
51 fn default_constness_for_trait_bounds(&self) -> Constness;
53 /// Returns predicates in scope of the form `X: Foo`, where `X` is
54 /// a type parameter `X` with the given id `def_id`. This is a
55 /// subset of the full set of predicates.
57 /// This is used for one specific purpose: resolving "short-hand"
58 /// associated type references like `T::Item`. In principle, we
59 /// would do that by first getting the full set of predicates in
60 /// scope and then filtering down to find those that apply to `T`,
61 /// but this can lead to cycle errors. The problem is that we have
62 /// to do this resolution *in order to create the predicates in
63 /// the first place*. Hence, we have this "special pass".
64 fn get_type_parameter_bounds(&self, span: Span, def_id: DefId) -> ty::GenericPredicates<'tcx>;
66 /// Returns the lifetime to use when a lifetime is omitted (and not elided).
67 fn re_infer(&self, param: Option<&ty::GenericParamDef>, span: Span)
68 -> Option<ty::Region<'tcx>>;
70 /// Returns the type to use when a type is omitted.
71 fn ty_infer(&self, param: Option<&ty::GenericParamDef>, span: Span) -> Ty<'tcx>;
73 /// Returns `true` if `_` is allowed in type signatures in the current context.
74 fn allow_ty_infer(&self) -> bool;
76 /// Returns the const to use when a const is omitted.
80 param: Option<&ty::GenericParamDef>,
82 ) -> &'tcx Const<'tcx>;
84 /// Projecting an associated type from a (potentially)
85 /// higher-ranked trait reference is more complicated, because of
86 /// the possibility of late-bound regions appearing in the
87 /// associated type binding. This is not legal in function
88 /// signatures for that reason. In a function body, we can always
89 /// handle it because we can use inference variables to remove the
90 /// late-bound regions.
91 fn projected_ty_from_poly_trait_ref(
95 item_segment: &hir::PathSegment<'_>,
96 poly_trait_ref: ty::PolyTraitRef<'tcx>,
99 /// Normalize an associated type coming from the user.
100 fn normalize_ty(&self, span: Span, ty: Ty<'tcx>) -> Ty<'tcx>;
102 /// Invoked when we encounter an error from some prior pass
103 /// (e.g., resolve) that is translated into a ty-error. This is
104 /// used to help suppress derived errors typeck might otherwise
106 fn set_tainted_by_errors(&self);
108 fn record_ty(&self, hir_id: hir::HirId, ty: Ty<'tcx>, span: Span);
111 pub enum SizedByDefault {
116 struct ConvertedBinding<'a, 'tcx> {
117 item_name: ast::Ident,
118 kind: ConvertedBindingKind<'a, 'tcx>,
122 enum ConvertedBindingKind<'a, 'tcx> {
124 Constraint(&'a [hir::GenericBound<'a>]),
128 enum GenericArgPosition {
130 Value, // e.g., functions
134 /// A marker denoting that the generic arguments that were
135 /// provided did not match the respective generic parameters.
136 pub struct GenericArgCountMismatch {
137 /// Indicates whether a fatal error was reported (`Some`), or just a lint (`None`).
138 pub reported: Option<ErrorReported>,
139 /// A list of spans of arguments provided that were not valid.
140 pub invalid_args: Vec<Span>,
143 impl<'o, 'tcx> dyn AstConv<'tcx> + 'o {
144 pub fn ast_region_to_region(
146 lifetime: &hir::Lifetime,
147 def: Option<&ty::GenericParamDef>,
148 ) -> ty::Region<'tcx> {
149 let tcx = self.tcx();
150 let lifetime_name = |def_id| tcx.hir().name(tcx.hir().as_local_hir_id(def_id).unwrap());
152 let r = match tcx.named_region(lifetime.hir_id) {
153 Some(rl::Region::Static) => tcx.lifetimes.re_static,
155 Some(rl::Region::LateBound(debruijn, id, _)) => {
156 let name = lifetime_name(id);
157 tcx.mk_region(ty::ReLateBound(debruijn, ty::BrNamed(id, name)))
160 Some(rl::Region::LateBoundAnon(debruijn, index)) => {
161 tcx.mk_region(ty::ReLateBound(debruijn, ty::BrAnon(index)))
164 Some(rl::Region::EarlyBound(index, id, _)) => {
165 let name = lifetime_name(id);
166 tcx.mk_region(ty::ReEarlyBound(ty::EarlyBoundRegion { def_id: id, index, name }))
169 Some(rl::Region::Free(scope, id)) => {
170 let name = lifetime_name(id);
171 tcx.mk_region(ty::ReFree(ty::FreeRegion {
173 bound_region: ty::BrNamed(id, name),
176 // (*) -- not late-bound, won't change
180 self.re_infer(def, lifetime.span).unwrap_or_else(|| {
181 // This indicates an illegal lifetime
182 // elision. `resolve_lifetime` should have
183 // reported an error in this case -- but if
184 // not, let's error out.
185 tcx.sess.delay_span_bug(lifetime.span, "unelided lifetime in signature");
187 // Supply some dummy value. We don't have an
188 // `re_error`, annoyingly, so use `'static`.
189 tcx.lifetimes.re_static
194 debug!("ast_region_to_region(lifetime={:?}) yields {:?}", lifetime, r);
199 /// Given a path `path` that refers to an item `I` with the declared generics `decl_generics`,
200 /// returns an appropriate set of substitutions for this particular reference to `I`.
201 pub fn ast_path_substs_for_ty(
205 item_segment: &hir::PathSegment<'_>,
206 ) -> SubstsRef<'tcx> {
207 let (substs, assoc_bindings, _) = self.create_substs_for_ast_path(
211 item_segment.generic_args(),
212 item_segment.infer_args,
216 assoc_bindings.first().map(|b| Self::prohibit_assoc_ty_binding(self.tcx(), b.span));
221 /// Report error if there is an explicit type parameter when using `impl Trait`.
224 seg: &hir::PathSegment<'_>,
225 generics: &ty::Generics,
227 let explicit = !seg.infer_args;
228 let impl_trait = generics.params.iter().any(|param| match param.kind {
229 ty::GenericParamDefKind::Type {
230 synthetic: Some(hir::SyntheticTyParamKind::ImplTrait),
236 if explicit && impl_trait {
241 .filter_map(|arg| match arg {
242 GenericArg::Type(_) => Some(arg.span()),
245 .collect::<Vec<_>>();
247 let mut err = struct_span_err! {
251 "cannot provide explicit generic arguments when `impl Trait` is \
252 used in argument position"
256 err.span_label(span, "explicit generic argument not allowed");
265 /// Checks that the correct number of generic arguments have been provided.
266 /// Used specifically for function calls.
267 pub fn check_generic_arg_count_for_call(
271 seg: &hir::PathSegment<'_>,
272 is_method_call: bool,
273 ) -> Result<(), GenericArgCountMismatch> {
274 let empty_args = hir::GenericArgs::none();
275 let suppress_mismatch = Self::check_impl_trait(tcx, seg, &def);
276 Self::check_generic_arg_count(
280 if let Some(ref args) = seg.args { args } else { &empty_args },
281 if is_method_call { GenericArgPosition::MethodCall } else { GenericArgPosition::Value },
282 def.parent.is_none() && def.has_self, // `has_self`
283 seg.infer_args || suppress_mismatch, // `infer_args`
287 /// Checks that the correct number of generic arguments have been provided.
288 /// This is used both for datatypes and function calls.
289 fn check_generic_arg_count(
293 args: &hir::GenericArgs<'_>,
294 position: GenericArgPosition,
297 ) -> Result<(), GenericArgCountMismatch> {
298 // At this stage we are guaranteed that the generic arguments are in the correct order, e.g.
299 // that lifetimes will proceed types. So it suffices to check the number of each generic
300 // arguments in order to validate them with respect to the generic parameters.
301 let param_counts = def.own_counts();
302 let arg_counts = args.own_counts();
303 let infer_lifetimes = position != GenericArgPosition::Type && arg_counts.lifetimes == 0;
305 let mut defaults: ty::GenericParamCount = Default::default();
306 for param in &def.params {
308 GenericParamDefKind::Lifetime => {}
309 GenericParamDefKind::Type { has_default, .. } => {
310 defaults.types += has_default as usize
312 GenericParamDefKind::Const => {
313 // FIXME(const_generics:defaults)
318 if position != GenericArgPosition::Type && !args.bindings.is_empty() {
319 AstConv::prohibit_assoc_ty_binding(tcx, args.bindings[0].span);
322 // Prohibit explicit lifetime arguments if late-bound lifetime parameters are present.
323 let mut explicit_lifetimes = Ok(());
324 if !infer_lifetimes {
325 if let Some(span_late) = def.has_late_bound_regions {
326 let msg = "cannot specify lifetime arguments explicitly \
327 if late bound lifetime parameters are present";
328 let note = "the late bound lifetime parameter is introduced here";
329 let span = args.args[0].span();
330 if position == GenericArgPosition::Value
331 && arg_counts.lifetimes != param_counts.lifetimes
333 explicit_lifetimes = Err(true);
334 let mut err = tcx.sess.struct_span_err(span, msg);
335 err.span_note(span_late, note);
338 explicit_lifetimes = Err(false);
339 let mut multispan = MultiSpan::from_span(span);
340 multispan.push_span_label(span_late, note.to_string());
341 tcx.struct_span_lint_hir(
342 LATE_BOUND_LIFETIME_ARGUMENTS,
345 |lint| lint.build(msg).emit(),
351 let check_kind_count =
352 |kind, required, permitted, provided, offset, unexpected_spans: &mut Vec<Span>| {
354 "check_kind_count: kind: {} required: {} permitted: {} provided: {} offset: {}",
355 kind, required, permitted, provided, offset
357 // We enforce the following: `required` <= `provided` <= `permitted`.
358 // For kinds without defaults (e.g.., lifetimes), `required == permitted`.
359 // For other kinds (i.e., types), `permitted` may be greater than `required`.
360 if required <= provided && provided <= permitted {
364 // Unfortunately lifetime and type parameter mismatches are typically styled
365 // differently in diagnostics, which means we have a few cases to consider here.
366 let (bound, quantifier) = if required != permitted {
367 if provided < required {
368 (required, "at least ")
370 // provided > permitted
371 (permitted, "at most ")
377 let (spans, label) = if required == permitted && provided > permitted {
378 // In the case when the user has provided too many arguments,
379 // we want to point to the unexpected arguments.
380 let spans: Vec<Span> = args.args[offset + permitted..offset + provided]
382 .map(|arg| arg.span())
384 unexpected_spans.extend(spans.clone());
385 (spans, format!("unexpected {} argument", kind))
390 "expected {}{} {} argument{}",
399 let mut err = tcx.sess.struct_span_err_with_code(
402 "wrong number of {} arguments: expected {}{}, found {}",
403 kind, quantifier, bound, provided,
405 DiagnosticId::Error("E0107".into()),
408 err.span_label(span, label.as_str());
415 let mut arg_count_correct = explicit_lifetimes;
416 let mut unexpected_spans = vec![];
418 if arg_count_correct.is_ok()
419 && (!infer_lifetimes || arg_counts.lifetimes > param_counts.lifetimes)
421 arg_count_correct = check_kind_count(
423 param_counts.lifetimes,
424 param_counts.lifetimes,
425 arg_counts.lifetimes,
427 &mut unexpected_spans,
429 .and(arg_count_correct);
431 // FIXME(const_generics:defaults)
432 if !infer_args || arg_counts.consts > param_counts.consts {
433 arg_count_correct = check_kind_count(
438 arg_counts.lifetimes + arg_counts.types,
439 &mut unexpected_spans,
441 .and(arg_count_correct);
443 // Note that type errors are currently be emitted *after* const errors.
444 if !infer_args || arg_counts.types > param_counts.types - defaults.types - has_self as usize
446 arg_count_correct = check_kind_count(
448 param_counts.types - defaults.types - has_self as usize,
449 param_counts.types - has_self as usize,
451 arg_counts.lifetimes,
452 &mut unexpected_spans,
454 .and(arg_count_correct);
457 arg_count_correct.map_err(|reported_err| GenericArgCountMismatch {
458 reported: if reported_err { Some(ErrorReported) } else { None },
459 invalid_args: unexpected_spans,
463 /// Report an error that a generic argument did not match the generic parameter that was
465 fn generic_arg_mismatch_err(sess: &Session, arg: &GenericArg<'_>, kind: &'static str) {
466 let mut err = struct_span_err!(
470 "{} provided when a {} was expected",
474 // This note will be true as long as generic parameters are strictly ordered by their kind.
475 err.note(&format!("{} arguments must be provided before {} arguments", kind, arg.descr()));
479 /// Creates the relevant generic argument substitutions
480 /// corresponding to a set of generic parameters. This is a
481 /// rather complex function. Let us try to explain the role
482 /// of each of its parameters:
484 /// To start, we are given the `def_id` of the thing we are
485 /// creating the substitutions for, and a partial set of
486 /// substitutions `parent_substs`. In general, the substitutions
487 /// for an item begin with substitutions for all the "parents" of
488 /// that item -- e.g., for a method it might include the
489 /// parameters from the impl.
491 /// Therefore, the method begins by walking down these parents,
492 /// starting with the outermost parent and proceed inwards until
493 /// it reaches `def_id`. For each parent `P`, it will check `parent_substs`
494 /// first to see if the parent's substitutions are listed in there. If so,
495 /// we can append those and move on. Otherwise, it invokes the
496 /// three callback functions:
498 /// - `args_for_def_id`: given the `DefId` `P`, supplies back the
499 /// generic arguments that were given to that parent from within
500 /// the path; so e.g., if you have `<T as Foo>::Bar`, the `DefId`
501 /// might refer to the trait `Foo`, and the arguments might be
502 /// `[T]`. The boolean value indicates whether to infer values
503 /// for arguments whose values were not explicitly provided.
504 /// - `provided_kind`: given the generic parameter and the value from `args_for_def_id`,
505 /// instantiate a `GenericArg`.
506 /// - `inferred_kind`: if no parameter was provided, and inference is enabled, then
507 /// creates a suitable inference variable.
508 pub fn create_substs_for_generic_args<'b>(
511 parent_substs: &[subst::GenericArg<'tcx>],
513 self_ty: Option<Ty<'tcx>>,
514 arg_count_correct: bool,
515 args_for_def_id: impl Fn(DefId) -> (Option<&'b GenericArgs<'b>>, bool),
516 mut provided_kind: impl FnMut(&GenericParamDef, &GenericArg<'_>) -> subst::GenericArg<'tcx>,
517 mut inferred_kind: impl FnMut(
518 Option<&[subst::GenericArg<'tcx>]>,
521 ) -> subst::GenericArg<'tcx>,
522 ) -> SubstsRef<'tcx> {
523 // Collect the segments of the path; we need to substitute arguments
524 // for parameters throughout the entire path (wherever there are
525 // generic parameters).
526 let mut parent_defs = tcx.generics_of(def_id);
527 let count = parent_defs.count();
528 let mut stack = vec![(def_id, parent_defs)];
529 while let Some(def_id) = parent_defs.parent {
530 parent_defs = tcx.generics_of(def_id);
531 stack.push((def_id, parent_defs));
534 // We manually build up the substitution, rather than using convenience
535 // methods in `subst.rs`, so that we can iterate over the arguments and
536 // parameters in lock-step linearly, instead of trying to match each pair.
537 let mut substs: SmallVec<[subst::GenericArg<'tcx>; 8]> = SmallVec::with_capacity(count);
538 // Iterate over each segment of the path.
539 while let Some((def_id, defs)) = stack.pop() {
540 let mut params = defs.params.iter().peekable();
542 // If we have already computed substitutions for parents, we can use those directly.
543 while let Some(¶m) = params.peek() {
544 if let Some(&kind) = parent_substs.get(param.index as usize) {
552 // `Self` is handled first, unless it's been handled in `parent_substs`.
554 if let Some(¶m) = params.peek() {
555 if param.index == 0 {
556 if let GenericParamDefKind::Type { .. } = param.kind {
560 .unwrap_or_else(|| inferred_kind(None, param, true)),
568 // Check whether this segment takes generic arguments and the user has provided any.
569 let (generic_args, infer_args) = args_for_def_id(def_id);
572 generic_args.iter().flat_map(|generic_args| generic_args.args.iter()).peekable();
574 // If we encounter a type or const when we expect a lifetime, we infer the lifetimes.
575 // If we later encounter a lifetime, we know that the arguments were provided in the
576 // wrong order. `force_infer_lt` records the type or const that forced lifetimes to be
577 // inferred, so we can use it for diagnostics later.
578 let mut force_infer_lt = None;
581 // We're going to iterate through the generic arguments that the user
582 // provided, matching them with the generic parameters we expect.
583 // Mismatches can occur as a result of elided lifetimes, or for malformed
584 // input. We try to handle both sensibly.
585 match (args.peek(), params.peek()) {
586 (Some(&arg), Some(¶m)) => {
587 match (arg, ¶m.kind) {
588 (GenericArg::Lifetime(_), GenericParamDefKind::Lifetime)
589 | (GenericArg::Type(_), GenericParamDefKind::Type { .. })
590 | (GenericArg::Const(_), GenericParamDefKind::Const) => {
591 substs.push(provided_kind(param, arg));
595 (GenericArg::Type(_), GenericParamDefKind::Lifetime)
596 | (GenericArg::Const(_), GenericParamDefKind::Lifetime) => {
597 // We expected a lifetime argument, but got a type or const
598 // argument. That means we're inferring the lifetimes.
599 substs.push(inferred_kind(None, param, infer_args));
600 force_infer_lt = Some(arg);
604 // We expected one kind of parameter, but the user provided
605 // another. This is an error. However, if we already know that
606 // the arguments don't match up with the parameters, we won't issue
607 // an additional error, as the user already knows what's wrong.
608 if arg_count_correct {
609 Self::generic_arg_mismatch_err(tcx.sess, arg, kind.descr());
612 // We've reported the error, but we want to make sure that this
613 // problem doesn't bubble down and create additional, irrelevant
614 // errors. In this case, we're simply going to ignore the argument
615 // and any following arguments. The rest of the parameters will be
617 while args.next().is_some() {}
622 (Some(&arg), None) => {
623 // We should never be able to reach this point with well-formed input.
624 // There are two situations in which we can encounter this issue.
626 // 1. The number of arguments is incorrect. In this case, an error
627 // will already have been emitted, and we can ignore it. This case
628 // also occurs when late-bound lifetime parameters are present, yet
629 // the lifetime arguments have also been explicitly specified by the
631 // 2. We've inferred some lifetimes, which have been provided later (i.e.
632 // after a type or const). We want to throw an error in this case.
634 if arg_count_correct {
635 let kind = arg.descr();
636 assert_eq!(kind, "lifetime");
638 force_infer_lt.expect("lifetimes ought to have been inferred");
639 Self::generic_arg_mismatch_err(tcx.sess, provided, kind);
645 (None, Some(¶m)) => {
646 // If there are fewer arguments than parameters, it means
647 // we're inferring the remaining arguments.
648 substs.push(inferred_kind(Some(&substs), param, infer_args));
652 (None, None) => break,
657 tcx.intern_substs(&substs)
660 /// Given the type/lifetime/const arguments provided to some path (along with
661 /// an implicit `Self`, if this is a trait reference), returns the complete
662 /// set of substitutions. This may involve applying defaulted type parameters.
663 /// Also returns back constraints on associated types.
668 /// T: std::ops::Index<usize, Output = u32>
669 /// ^1 ^^^^^^^^^^^^^^2 ^^^^3 ^^^^^^^^^^^4
672 /// 1. The `self_ty` here would refer to the type `T`.
673 /// 2. The path in question is the path to the trait `std::ops::Index`,
674 /// which will have been resolved to a `def_id`
675 /// 3. The `generic_args` contains info on the `<...>` contents. The `usize` type
676 /// parameters are returned in the `SubstsRef`, the associated type bindings like
677 /// `Output = u32` are returned in the `Vec<ConvertedBinding...>` result.
679 /// Note that the type listing given here is *exactly* what the user provided.
681 /// For (generic) associated types
684 /// <Vec<u8> as Iterable<u8>>::Iter::<'a>
687 /// We have the parent substs are the substs for the parent trait:
688 /// `[Vec<u8>, u8]` and `generic_args` are the arguments for the associated
689 /// type itself: `['a]`. The returned `SubstsRef` concatenates these two
690 /// lists: `[Vec<u8>, u8, 'a]`.
691 fn create_substs_for_ast_path<'a>(
695 parent_substs: &[subst::GenericArg<'tcx>],
696 generic_args: &'a hir::GenericArgs<'_>,
698 self_ty: Option<Ty<'tcx>>,
699 ) -> (SubstsRef<'tcx>, Vec<ConvertedBinding<'a, 'tcx>>, Result<(), GenericArgCountMismatch>)
701 // If the type is parameterized by this region, then replace this
702 // region with the current anon region binding (in other words,
703 // whatever & would get replaced with).
705 "create_substs_for_ast_path(def_id={:?}, self_ty={:?}, \
707 def_id, self_ty, generic_args
710 let tcx = self.tcx();
711 let generic_params = tcx.generics_of(def_id);
713 if generic_params.has_self {
714 if generic_params.parent.is_some() {
715 // The parent is a trait so it should have at least one subst
716 // for the `Self` type.
717 assert!(!parent_substs.is_empty())
719 // This item (presumably a trait) needs a self-type.
720 assert!(self_ty.is_some());
723 assert!(self_ty.is_none() && parent_substs.is_empty());
726 let arg_count_correct = Self::check_generic_arg_count(
731 GenericArgPosition::Type,
736 let is_object = self_ty.map_or(false, |ty| ty == self.tcx().types.trait_object_dummy_self);
737 let default_needs_object_self = |param: &ty::GenericParamDef| {
738 if let GenericParamDefKind::Type { has_default, .. } = param.kind {
739 if is_object && has_default {
740 let self_param = tcx.types.self_param;
741 if tcx.at(span).type_of(param.def_id).walk().any(|ty| ty == self_param) {
742 // There is no suitable inference default for a type parameter
743 // that references self, in an object type.
752 let mut missing_type_params = vec![];
753 let mut inferred_params = vec![];
754 let substs = Self::create_substs_for_generic_args(
760 arg_count_correct.is_ok(),
761 // Provide the generic args, and whether types should be inferred.
764 (Some(generic_args), infer_args)
766 // The last component of this tuple is unimportant.
770 // Provide substitutions for parameters for which (valid) arguments have been provided.
771 |param, arg| match (¶m.kind, arg) {
772 (GenericParamDefKind::Lifetime, GenericArg::Lifetime(lt)) => {
773 self.ast_region_to_region(<, Some(param)).into()
775 (GenericParamDefKind::Type { .. }, GenericArg::Type(ty)) => {
776 if let (hir::TyKind::Infer, false) = (&ty.kind, self.allow_ty_infer()) {
777 inferred_params.push(ty.span);
780 self.ast_ty_to_ty(&ty).into()
783 (GenericParamDefKind::Const, GenericArg::Const(ct)) => {
784 let ct_def_id = tcx.hir().local_def_id(ct.value.hir_id).expect_local();
785 ty::Const::from_anon_const(tcx, ct_def_id).into()
789 // Provide substitutions for parameters for which arguments are inferred.
790 |substs, param, infer_args| {
792 GenericParamDefKind::Lifetime => tcx.lifetimes.re_static.into(),
793 GenericParamDefKind::Type { has_default, .. } => {
794 if !infer_args && has_default {
795 // No type parameter provided, but a default exists.
797 // If we are converting an object type, then the
798 // `Self` parameter is unknown. However, some of the
799 // other type parameters may reference `Self` in their
800 // defaults. This will lead to an ICE if we are not
802 if default_needs_object_self(param) {
803 missing_type_params.push(param.name.to_string());
806 // This is a default type parameter.
809 tcx.at(span).type_of(param.def_id).subst_spanned(
817 } else if infer_args {
818 // No type parameters were provided, we can infer all.
820 if !default_needs_object_self(param) { Some(param) } else { None };
821 self.ty_infer(param, span).into()
823 // We've already errored above about the mismatch.
827 GenericParamDefKind::Const => {
828 // FIXME(const_generics:defaults)
830 // No const parameters were provided, we can infer all.
831 let ty = tcx.at(span).type_of(param.def_id);
832 self.ct_infer(ty, Some(param), span).into()
834 // We've already errored above about the mismatch.
835 tcx.consts.err.into()
842 self.complain_about_missing_type_params(
846 generic_args.args.is_empty(),
849 // Convert associated-type bindings or constraints into a separate vector.
850 // Example: Given this:
852 // T: Iterator<Item = u32>
854 // The `T` is passed in as a self-type; the `Item = u32` is
855 // not a "type parameter" of the `Iterator` trait, but rather
856 // a restriction on `<T as Iterator>::Item`, so it is passed
858 let assoc_bindings = generic_args
862 let kind = match binding.kind {
863 hir::TypeBindingKind::Equality { ref ty } => {
864 ConvertedBindingKind::Equality(self.ast_ty_to_ty(ty))
866 hir::TypeBindingKind::Constraint { ref bounds } => {
867 ConvertedBindingKind::Constraint(bounds)
870 ConvertedBinding { item_name: binding.ident, kind, span: binding.span }
875 "create_substs_for_ast_path(generic_params={:?}, self_ty={:?}) -> {:?}",
876 generic_params, self_ty, substs
879 (substs, assoc_bindings, arg_count_correct)
882 crate fn create_substs_for_associated_item(
887 item_segment: &hir::PathSegment<'_>,
888 parent_substs: SubstsRef<'tcx>,
889 ) -> SubstsRef<'tcx> {
890 if tcx.generics_of(item_def_id).params.is_empty() {
891 self.prohibit_generics(slice::from_ref(item_segment));
895 self.create_substs_for_ast_path(
899 item_segment.generic_args(),
900 item_segment.infer_args,
907 /// On missing type parameters, emit an E0393 error and provide a structured suggestion using
908 /// the type parameter's name as a placeholder.
909 fn complain_about_missing_type_params(
911 missing_type_params: Vec<String>,
914 empty_generic_args: bool,
916 if missing_type_params.is_empty() {
920 missing_type_params.iter().map(|n| format!("`{}`", n)).collect::<Vec<_>>().join(", ");
921 let mut err = struct_span_err!(
925 "the type parameter{} {} must be explicitly specified",
926 pluralize!(missing_type_params.len()),
930 self.tcx().def_span(def_id),
932 "type parameter{} {} must be specified for this",
933 pluralize!(missing_type_params.len()),
937 let mut suggested = false;
938 if let (Ok(snippet), true) = (
939 self.tcx().sess.source_map().span_to_snippet(span),
940 // Don't suggest setting the type params if there are some already: the order is
941 // tricky to get right and the user will already know what the syntax is.
944 if snippet.ends_with('>') {
945 // The user wrote `Trait<'a, T>` or similar. To provide an accurate suggestion
946 // we would have to preserve the right order. For now, as clearly the user is
947 // aware of the syntax, we do nothing.
949 // The user wrote `Iterator`, so we don't have a type we can suggest, but at
950 // least we can clue them to the correct syntax `Iterator<Type>`.
954 "set the type parameter{plural} to the desired type{plural}",
955 plural = pluralize!(missing_type_params.len()),
957 format!("{}<{}>", snippet, missing_type_params.join(", ")),
958 Applicability::HasPlaceholders,
967 "missing reference{} to {}",
968 pluralize!(missing_type_params.len()),
974 "because of the default `Self` reference, type parameters must be \
975 specified on object types",
980 /// Instantiates the path for the given trait reference, assuming that it's
981 /// bound to a valid trait type. Returns the `DefId` of the defining trait.
982 /// The type _cannot_ be a type other than a trait type.
984 /// If the `projections` argument is `None`, then assoc type bindings like `Foo<T = X>`
985 /// are disallowed. Otherwise, they are pushed onto the vector given.
986 pub fn instantiate_mono_trait_ref(
988 trait_ref: &hir::TraitRef<'_>,
990 ) -> ty::TraitRef<'tcx> {
991 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
993 self.ast_path_to_mono_trait_ref(
995 trait_ref.trait_def_id().unwrap_or_else(|| FatalError.raise()),
997 trait_ref.path.segments.last().unwrap(),
1001 /// The given trait-ref must actually be a trait.
1002 pub(super) fn instantiate_poly_trait_ref_inner(
1004 trait_ref: &hir::TraitRef<'_>,
1006 constness: Constness,
1008 bounds: &mut Bounds<'tcx>,
1010 ) -> Result<(), GenericArgCountMismatch> {
1011 let trait_def_id = trait_ref.trait_def_id().unwrap_or_else(|| FatalError.raise());
1013 debug!("instantiate_poly_trait_ref({:?}, def_id={:?})", trait_ref, trait_def_id);
1015 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
1017 let path_span = if let [segment] = &trait_ref.path.segments[..] {
1018 // FIXME: `trait_ref.path.span` can point to a full path with multiple
1019 // segments, even though `trait_ref.path.segments` is of length `1`. Work
1020 // around that bug here, even though it should be fixed elsewhere.
1021 // This would otherwise cause an invalid suggestion. For an example, look at
1022 // `src/test/ui/issues/issue-28344.rs`.
1027 let (substs, assoc_bindings, arg_count_correct) = self.create_substs_for_ast_trait_ref(
1031 trait_ref.path.segments.last().unwrap(),
1033 let poly_trait_ref = ty::Binder::bind(ty::TraitRef::new(trait_def_id, substs));
1035 bounds.trait_bounds.push((poly_trait_ref, span, constness));
1037 let mut dup_bindings = FxHashMap::default();
1038 for binding in &assoc_bindings {
1039 // Specify type to assert that error was already reported in `Err` case.
1040 let _: Result<_, ErrorReported> = self.add_predicates_for_ast_type_binding(
1041 trait_ref.hir_ref_id,
1049 // Okay to ignore `Err` because of `ErrorReported` (see above).
1053 "instantiate_poly_trait_ref({:?}, bounds={:?}) -> {:?}",
1054 trait_ref, bounds, poly_trait_ref
1060 /// Given a trait bound like `Debug`, applies that trait bound the given self-type to construct
1061 /// a full trait reference. The resulting trait reference is returned. This may also generate
1062 /// auxiliary bounds, which are added to `bounds`.
1067 /// poly_trait_ref = Iterator<Item = u32>
1071 /// this would return `Foo: Iterator` and add `<Foo as Iterator>::Item = u32` into `bounds`.
1073 /// **A note on binders:** against our usual convention, there is an implied bounder around
1074 /// the `self_ty` and `poly_trait_ref` parameters here. So they may reference bound regions.
1075 /// If for example you had `for<'a> Foo<'a>: Bar<'a>`, then the `self_ty` would be `Foo<'a>`
1076 /// where `'a` is a bound region at depth 0. Similarly, the `poly_trait_ref` would be
1077 /// `Bar<'a>`. The returned poly-trait-ref will have this binder instantiated explicitly,
1079 pub fn instantiate_poly_trait_ref(
1081 poly_trait_ref: &hir::PolyTraitRef<'_>,
1082 constness: Constness,
1084 bounds: &mut Bounds<'tcx>,
1085 ) -> Result<(), GenericArgCountMismatch> {
1086 self.instantiate_poly_trait_ref_inner(
1087 &poly_trait_ref.trait_ref,
1088 poly_trait_ref.span,
1096 fn ast_path_to_mono_trait_ref(
1099 trait_def_id: DefId,
1101 trait_segment: &hir::PathSegment<'_>,
1102 ) -> ty::TraitRef<'tcx> {
1103 let (substs, assoc_bindings, _) =
1104 self.create_substs_for_ast_trait_ref(span, trait_def_id, self_ty, trait_segment);
1105 assoc_bindings.first().map(|b| AstConv::prohibit_assoc_ty_binding(self.tcx(), b.span));
1106 ty::TraitRef::new(trait_def_id, substs)
1109 /// When the code is using the `Fn` traits directly, instead of the `Fn(A) -> B` syntax, emit
1110 /// an error and attempt to build a reasonable structured suggestion.
1111 fn complain_about_internal_fn_trait(
1114 trait_def_id: DefId,
1115 trait_segment: &'a hir::PathSegment<'a>,
1117 let trait_def = self.tcx().trait_def(trait_def_id);
1119 if !self.tcx().features().unboxed_closures
1120 && trait_segment.generic_args().parenthesized != trait_def.paren_sugar
1122 let sess = &self.tcx().sess.parse_sess;
1123 // For now, require that parenthetical notation be used only with `Fn()` etc.
1124 let (msg, sugg) = if trait_def.paren_sugar {
1126 "the precise format of `Fn`-family traits' type parameters is subject to \
1130 trait_segment.ident,
1134 .and_then(|args| args.args.get(0))
1135 .and_then(|arg| match arg {
1136 hir::GenericArg::Type(ty) => {
1137 sess.source_map().span_to_snippet(ty.span).ok()
1141 .unwrap_or_else(|| "()".to_string()),
1146 .filter_map(|b| match (b.ident.as_str() == "Output", &b.kind) {
1147 (true, hir::TypeBindingKind::Equality { ty }) => {
1148 sess.source_map().span_to_snippet(ty.span).ok()
1153 .unwrap_or_else(|| "()".to_string()),
1157 ("parenthetical notation is only stable when used with `Fn`-family traits", None)
1159 let mut err = feature_err(sess, sym::unboxed_closures, span, msg);
1160 if let Some(sugg) = sugg {
1161 let msg = "use parenthetical notation instead";
1162 err.span_suggestion(span, msg, sugg, Applicability::MaybeIncorrect);
1168 fn create_substs_for_ast_trait_ref<'a>(
1171 trait_def_id: DefId,
1173 trait_segment: &'a hir::PathSegment<'a>,
1174 ) -> (SubstsRef<'tcx>, Vec<ConvertedBinding<'a, 'tcx>>, Result<(), GenericArgCountMismatch>)
1176 debug!("create_substs_for_ast_trait_ref(trait_segment={:?})", trait_segment);
1178 self.complain_about_internal_fn_trait(span, trait_def_id, trait_segment);
1180 self.create_substs_for_ast_path(
1184 trait_segment.generic_args(),
1185 trait_segment.infer_args,
1190 fn trait_defines_associated_type_named(
1192 trait_def_id: DefId,
1193 assoc_name: ast::Ident,
1196 .associated_items(trait_def_id)
1197 .find_by_name_and_kind(self.tcx(), assoc_name, ty::AssocKind::Type, trait_def_id)
1201 // Returns `true` if a bounds list includes `?Sized`.
1202 pub fn is_unsized(&self, ast_bounds: &[hir::GenericBound<'_>], span: Span) -> bool {
1203 let tcx = self.tcx();
1205 // Try to find an unbound in bounds.
1206 let mut unbound = None;
1207 for ab in ast_bounds {
1208 if let &hir::GenericBound::Trait(ref ptr, hir::TraitBoundModifier::Maybe) = ab {
1209 if unbound.is_none() {
1210 unbound = Some(&ptr.trait_ref);
1216 "type parameter has more than one relaxed default \
1217 bound, only one is supported"
1224 let kind_id = tcx.lang_items().require(SizedTraitLangItem);
1227 // FIXME(#8559) currently requires the unbound to be built-in.
1228 if let Ok(kind_id) = kind_id {
1229 if tpb.path.res != Res::Def(DefKind::Trait, kind_id) {
1232 "default bound relaxed for a type parameter, but \
1233 this does nothing because the given bound is not \
1234 a default; only `?Sized` is supported",
1239 _ if kind_id.is_ok() => {
1242 // No lang item for `Sized`, so we can't add it as a bound.
1249 /// This helper takes a *converted* parameter type (`param_ty`)
1250 /// and an *unconverted* list of bounds:
1253 /// fn foo<T: Debug>
1254 /// ^ ^^^^^ `ast_bounds` parameter, in HIR form
1256 /// `param_ty`, in ty form
1259 /// It adds these `ast_bounds` into the `bounds` structure.
1261 /// **A note on binders:** there is an implied binder around
1262 /// `param_ty` and `ast_bounds`. See `instantiate_poly_trait_ref`
1263 /// for more details.
1267 ast_bounds: &[hir::GenericBound<'_>],
1268 bounds: &mut Bounds<'tcx>,
1270 let mut trait_bounds = Vec::new();
1271 let mut region_bounds = Vec::new();
1273 let constness = self.default_constness_for_trait_bounds();
1274 for ast_bound in ast_bounds {
1276 hir::GenericBound::Trait(ref b, hir::TraitBoundModifier::None) => {
1277 trait_bounds.push((b, constness))
1279 hir::GenericBound::Trait(ref b, hir::TraitBoundModifier::MaybeConst) => {
1280 trait_bounds.push((b, Constness::NotConst))
1282 hir::GenericBound::Trait(_, hir::TraitBoundModifier::Maybe) => {}
1283 hir::GenericBound::Outlives(ref l) => region_bounds.push(l),
1287 for (bound, constness) in trait_bounds {
1288 let _ = self.instantiate_poly_trait_ref(bound, constness, param_ty, bounds);
1291 bounds.region_bounds.extend(
1292 region_bounds.into_iter().map(|r| (self.ast_region_to_region(r, None), r.span)),
1296 /// Translates a list of bounds from the HIR into the `Bounds` data structure.
1297 /// The self-type for the bounds is given by `param_ty`.
1302 /// fn foo<T: Bar + Baz>() { }
1303 /// ^ ^^^^^^^^^ ast_bounds
1307 /// The `sized_by_default` parameter indicates if, in this context, the `param_ty` should be
1308 /// considered `Sized` unless there is an explicit `?Sized` bound. This would be true in the
1309 /// example above, but is not true in supertrait listings like `trait Foo: Bar + Baz`.
1311 /// `span` should be the declaration size of the parameter.
1312 pub fn compute_bounds(
1315 ast_bounds: &[hir::GenericBound<'_>],
1316 sized_by_default: SizedByDefault,
1319 let mut bounds = Bounds::default();
1321 self.add_bounds(param_ty, ast_bounds, &mut bounds);
1322 bounds.trait_bounds.sort_by_key(|(t, _, _)| t.def_id());
1324 bounds.implicitly_sized = if let SizedByDefault::Yes = sized_by_default {
1325 if !self.is_unsized(ast_bounds, span) { Some(span) } else { None }
1333 /// Given an HIR binding like `Item = Foo` or `Item: Foo`, pushes the corresponding predicates
1336 /// **A note on binders:** given something like `T: for<'a> Iterator<Item = &'a u32>`, the
1337 /// `trait_ref` here will be `for<'a> T: Iterator`. The `binding` data however is from *inside*
1338 /// the binder (e.g., `&'a u32`) and hence may reference bound regions.
1339 fn add_predicates_for_ast_type_binding(
1341 hir_ref_id: hir::HirId,
1342 trait_ref: ty::PolyTraitRef<'tcx>,
1343 binding: &ConvertedBinding<'_, 'tcx>,
1344 bounds: &mut Bounds<'tcx>,
1346 dup_bindings: &mut FxHashMap<DefId, Span>,
1348 ) -> Result<(), ErrorReported> {
1349 let tcx = self.tcx();
1352 // Given something like `U: SomeTrait<T = X>`, we want to produce a
1353 // predicate like `<U as SomeTrait>::T = X`. This is somewhat
1354 // subtle in the event that `T` is defined in a supertrait of
1355 // `SomeTrait`, because in that case we need to upcast.
1357 // That is, consider this case:
1360 // trait SubTrait: SuperTrait<int> { }
1361 // trait SuperTrait<A> { type T; }
1363 // ... B: SubTrait<T = foo> ...
1366 // We want to produce `<B as SuperTrait<int>>::T == foo`.
1368 // Find any late-bound regions declared in `ty` that are not
1369 // declared in the trait-ref. These are not well-formed.
1373 // for<'a> <T as Iterator>::Item = &'a str // <-- 'a is bad
1374 // for<'a> <T as FnMut<(&'a u32,)>>::Output = &'a str // <-- 'a is ok
1375 if let ConvertedBindingKind::Equality(ty) = binding.kind {
1376 let late_bound_in_trait_ref =
1377 tcx.collect_constrained_late_bound_regions(&trait_ref);
1378 let late_bound_in_ty =
1379 tcx.collect_referenced_late_bound_regions(&ty::Binder::bind(ty));
1380 debug!("late_bound_in_trait_ref = {:?}", late_bound_in_trait_ref);
1381 debug!("late_bound_in_ty = {:?}", late_bound_in_ty);
1382 for br in late_bound_in_ty.difference(&late_bound_in_trait_ref) {
1383 let br_name = match *br {
1384 ty::BrNamed(_, name) => name,
1388 "anonymous bound region {:?} in binding but not trait ref",
1393 // FIXME: point at the type params that don't have appropriate lifetimes:
1394 // struct S1<F: for<'a> Fn(&i32, &i32) -> &'a i32>(F);
1395 // ---- ---- ^^^^^^^
1400 "binding for associated type `{}` references lifetime `{}`, \
1401 which does not appear in the trait input types",
1411 if self.trait_defines_associated_type_named(trait_ref.def_id(), binding.item_name) {
1412 // Simple case: X is defined in the current trait.
1415 // Otherwise, we have to walk through the supertraits to find
1417 self.one_bound_for_assoc_type(
1418 || traits::supertraits(tcx, trait_ref),
1419 || trait_ref.print_only_trait_path().to_string(),
1422 || match binding.kind {
1423 ConvertedBindingKind::Equality(ty) => Some(ty.to_string()),
1429 let (assoc_ident, def_scope) =
1430 tcx.adjust_ident_and_get_scope(binding.item_name, candidate.def_id(), hir_ref_id);
1432 // We have already adjusted the item name above, so compare with `ident.normalize_to_macros_2_0()` instead
1433 // of calling `filter_by_name_and_kind`.
1435 .associated_items(candidate.def_id())
1436 .filter_by_name_unhygienic(assoc_ident.name)
1438 i.kind == ty::AssocKind::Type && i.ident.normalize_to_macros_2_0() == assoc_ident
1440 .expect("missing associated type");
1442 if !assoc_ty.vis.is_accessible_from(def_scope, tcx) {
1446 &format!("associated type `{}` is private", binding.item_name),
1448 .span_label(binding.span, "private associated type")
1451 tcx.check_stability(assoc_ty.def_id, Some(hir_ref_id), binding.span);
1455 .entry(assoc_ty.def_id)
1456 .and_modify(|prev_span| {
1461 "the value of the associated type `{}` (from trait `{}`) \
1462 is already specified",
1464 tcx.def_path_str(assoc_ty.container.id())
1466 .span_label(binding.span, "re-bound here")
1467 .span_label(*prev_span, format!("`{}` bound here first", binding.item_name))
1470 .or_insert(binding.span);
1473 match binding.kind {
1474 ConvertedBindingKind::Equality(ref ty) => {
1475 // "Desugar" a constraint like `T: Iterator<Item = u32>` this to
1476 // the "projection predicate" for:
1478 // `<T as Iterator>::Item = u32`
1479 bounds.projection_bounds.push((
1480 candidate.map_bound(|trait_ref| ty::ProjectionPredicate {
1481 projection_ty: ty::ProjectionTy::from_ref_and_name(
1491 ConvertedBindingKind::Constraint(ast_bounds) => {
1492 // "Desugar" a constraint like `T: Iterator<Item: Debug>` to
1494 // `<T as Iterator>::Item: Debug`
1496 // Calling `skip_binder` is okay, because `add_bounds` expects the `param_ty`
1497 // parameter to have a skipped binder.
1498 let param_ty = tcx.mk_projection(assoc_ty.def_id, candidate.skip_binder().substs);
1499 self.add_bounds(param_ty, ast_bounds, bounds);
1509 item_segment: &hir::PathSegment<'_>,
1511 let substs = self.ast_path_substs_for_ty(span, did, item_segment);
1512 self.normalize_ty(span, self.tcx().at(span).type_of(did).subst(self.tcx(), substs))
1515 fn conv_object_ty_poly_trait_ref(
1518 trait_bounds: &[hir::PolyTraitRef<'_>],
1519 lifetime: &hir::Lifetime,
1521 let tcx = self.tcx();
1523 let mut bounds = Bounds::default();
1524 let mut potential_assoc_types = Vec::new();
1525 let dummy_self = self.tcx().types.trait_object_dummy_self;
1526 for trait_bound in trait_bounds.iter().rev() {
1527 if let Err(GenericArgCountMismatch {
1528 invalid_args: cur_potential_assoc_types, ..
1529 }) = self.instantiate_poly_trait_ref(
1531 Constness::NotConst,
1535 potential_assoc_types.extend(cur_potential_assoc_types.into_iter());
1539 // Expand trait aliases recursively and check that only one regular (non-auto) trait
1540 // is used and no 'maybe' bounds are used.
1541 let expanded_traits =
1542 traits::expand_trait_aliases(tcx, bounds.trait_bounds.iter().map(|&(a, b, _)| (a, b)));
1543 let (mut auto_traits, regular_traits): (Vec<_>, Vec<_>) =
1544 expanded_traits.partition(|i| tcx.trait_is_auto(i.trait_ref().def_id()));
1545 if regular_traits.len() > 1 {
1546 let first_trait = ®ular_traits[0];
1547 let additional_trait = ®ular_traits[1];
1548 let mut err = struct_span_err!(
1550 additional_trait.bottom().1,
1552 "only auto traits can be used as additional traits in a trait object"
1554 additional_trait.label_with_exp_info(
1556 "additional non-auto trait",
1559 first_trait.label_with_exp_info(&mut err, "first non-auto trait", "first use");
1563 if regular_traits.is_empty() && auto_traits.is_empty() {
1568 "at least one trait is required for an object type"
1571 return tcx.types.err;
1574 // Check that there are no gross object safety violations;
1575 // most importantly, that the supertraits don't contain `Self`,
1577 for item in ®ular_traits {
1578 let object_safety_violations =
1579 astconv_object_safety_violations(tcx, item.trait_ref().def_id());
1580 if !object_safety_violations.is_empty() {
1581 report_object_safety_error(
1584 item.trait_ref().def_id(),
1585 object_safety_violations,
1588 return tcx.types.err;
1592 // Use a `BTreeSet` to keep output in a more consistent order.
1593 let mut associated_types: FxHashMap<Span, BTreeSet<DefId>> = FxHashMap::default();
1595 let regular_traits_refs_spans = bounds
1598 .filter(|(trait_ref, _, _)| !tcx.trait_is_auto(trait_ref.def_id()));
1600 for (base_trait_ref, span, constness) in regular_traits_refs_spans {
1601 assert_eq!(constness, Constness::NotConst);
1603 for trait_ref in traits::elaborate_trait_ref(tcx, base_trait_ref) {
1605 "conv_object_ty_poly_trait_ref: observing object predicate `{:?}`",
1609 ty::Predicate::Trait(pred, _) => {
1610 associated_types.entry(span).or_default().extend(
1611 tcx.associated_items(pred.def_id())
1612 .in_definition_order()
1613 .filter(|item| item.kind == ty::AssocKind::Type)
1614 .map(|item| item.def_id),
1617 ty::Predicate::Projection(pred) => {
1618 // A `Self` within the original bound will be substituted with a
1619 // `trait_object_dummy_self`, so check for that.
1620 let references_self = pred.skip_binder().ty.walk().any(|t| t == dummy_self);
1622 // If the projection output contains `Self`, force the user to
1623 // elaborate it explicitly to avoid a lot of complexity.
1625 // The "classicaly useful" case is the following:
1627 // trait MyTrait: FnMut() -> <Self as MyTrait>::MyOutput {
1632 // Here, the user could theoretically write `dyn MyTrait<Output = X>`,
1633 // but actually supporting that would "expand" to an infinitely-long type
1634 // `fix $ τ → dyn MyTrait<MyOutput = X, Output = <τ as MyTrait>::MyOutput`.
1636 // Instead, we force the user to write
1637 // `dyn MyTrait<MyOutput = X, Output = X>`, which is uglier but works. See
1638 // the discussion in #56288 for alternatives.
1639 if !references_self {
1640 // Include projections defined on supertraits.
1641 bounds.projection_bounds.push((pred, span));
1649 for (projection_bound, _) in &bounds.projection_bounds {
1650 for def_ids in associated_types.values_mut() {
1651 def_ids.remove(&projection_bound.projection_def_id());
1655 self.complain_about_missing_associated_types(
1657 potential_assoc_types,
1661 // De-duplicate auto traits so that, e.g., `dyn Trait + Send + Send` is the same as
1662 // `dyn Trait + Send`.
1663 auto_traits.sort_by_key(|i| i.trait_ref().def_id());
1664 auto_traits.dedup_by_key(|i| i.trait_ref().def_id());
1665 debug!("regular_traits: {:?}", regular_traits);
1666 debug!("auto_traits: {:?}", auto_traits);
1668 // Transform a `PolyTraitRef` into a `PolyExistentialTraitRef` by
1669 // removing the dummy `Self` type (`trait_object_dummy_self`).
1670 let trait_ref_to_existential = |trait_ref: ty::TraitRef<'tcx>| {
1671 if trait_ref.self_ty() != dummy_self {
1672 // FIXME: There appears to be a missing filter on top of `expand_trait_aliases`,
1673 // which picks up non-supertraits where clauses - but also, the object safety
1674 // completely ignores trait aliases, which could be object safety hazards. We
1675 // `delay_span_bug` here to avoid an ICE in stable even when the feature is
1676 // disabled. (#66420)
1677 tcx.sess.delay_span_bug(
1680 "trait_ref_to_existential called on {:?} with non-dummy Self",
1685 ty::ExistentialTraitRef::erase_self_ty(tcx, trait_ref)
1688 // Erase the `dummy_self` (`trait_object_dummy_self`) used above.
1689 let existential_trait_refs =
1690 regular_traits.iter().map(|i| i.trait_ref().map_bound(trait_ref_to_existential));
1691 let existential_projections = bounds.projection_bounds.iter().map(|(bound, _)| {
1692 bound.map_bound(|b| {
1693 let trait_ref = trait_ref_to_existential(b.projection_ty.trait_ref(tcx));
1694 ty::ExistentialProjection {
1696 item_def_id: b.projection_ty.item_def_id,
1697 substs: trait_ref.substs,
1702 // Calling `skip_binder` is okay because the predicates are re-bound.
1703 let regular_trait_predicates = existential_trait_refs
1704 .map(|trait_ref| ty::ExistentialPredicate::Trait(*trait_ref.skip_binder()));
1705 let auto_trait_predicates = auto_traits
1707 .map(|trait_ref| ty::ExistentialPredicate::AutoTrait(trait_ref.trait_ref().def_id()));
1708 let mut v = regular_trait_predicates
1709 .chain(auto_trait_predicates)
1711 existential_projections
1712 .map(|x| ty::ExistentialPredicate::Projection(*x.skip_binder())),
1714 .collect::<SmallVec<[_; 8]>>();
1715 v.sort_by(|a, b| a.stable_cmp(tcx, b));
1717 let existential_predicates = ty::Binder::bind(tcx.mk_existential_predicates(v.into_iter()));
1719 // Use explicitly-specified region bound.
1720 let region_bound = if !lifetime.is_elided() {
1721 self.ast_region_to_region(lifetime, None)
1723 self.compute_object_lifetime_bound(span, existential_predicates).unwrap_or_else(|| {
1724 if tcx.named_region(lifetime.hir_id).is_some() {
1725 self.ast_region_to_region(lifetime, None)
1727 self.re_infer(None, span).unwrap_or_else(|| {
1732 "the lifetime bound for this object type cannot be deduced \
1733 from context; please supply an explicit bound"
1736 tcx.lifetimes.re_static
1741 debug!("region_bound: {:?}", region_bound);
1743 let ty = tcx.mk_dynamic(existential_predicates, region_bound);
1744 debug!("trait_object_type: {:?}", ty);
1748 /// When there are any missing associated types, emit an E0191 error and attempt to supply a
1749 /// reasonable suggestion on how to write it. For the case of multiple associated types in the
1750 /// same trait bound have the same name (as they come from different super-traits), we instead
1751 /// emit a generic note suggesting using a `where` clause to constraint instead.
1752 fn complain_about_missing_associated_types(
1754 associated_types: FxHashMap<Span, BTreeSet<DefId>>,
1755 potential_assoc_types: Vec<Span>,
1756 trait_bounds: &[hir::PolyTraitRef<'_>],
1758 if !associated_types.values().any(|v| !v.is_empty()) {
1761 let tcx = self.tcx();
1762 // FIXME: Marked `mut` so that we can replace the spans further below with a more
1763 // appropriate one, but this should be handled earlier in the span assignment.
1764 let mut associated_types: FxHashMap<Span, Vec<_>> = associated_types
1766 .map(|(span, def_ids)| {
1767 (span, def_ids.into_iter().map(|did| tcx.associated_item(did)).collect())
1770 let mut names = vec![];
1772 // Account for things like `dyn Foo + 'a`, like in tests `issue-22434.rs` and
1773 // `issue-22560.rs`.
1774 let mut trait_bound_spans: Vec<Span> = vec![];
1775 for (span, items) in &associated_types {
1776 if !items.is_empty() {
1777 trait_bound_spans.push(*span);
1779 for assoc_item in items {
1780 let trait_def_id = assoc_item.container.id();
1782 "`{}` (from trait `{}`)",
1784 tcx.def_path_str(trait_def_id),
1788 if let ([], [bound]) = (&potential_assoc_types[..], &trait_bounds) {
1789 match &bound.trait_ref.path.segments[..] {
1790 // FIXME: `trait_ref.path.span` can point to a full path with multiple
1791 // segments, even though `trait_ref.path.segments` is of length `1`. Work
1792 // around that bug here, even though it should be fixed elsewhere.
1793 // This would otherwise cause an invalid suggestion. For an example, look at
1794 // `src/test/ui/issues/issue-28344.rs` where instead of the following:
1796 // error[E0191]: the value of the associated type `Output`
1797 // (from trait `std::ops::BitXor`) must be specified
1798 // --> $DIR/issue-28344.rs:4:17
1800 // LL | let x: u8 = BitXor::bitor(0 as u8, 0 as u8);
1801 // | ^^^^^^ help: specify the associated type:
1802 // | `BitXor<Output = Type>`
1806 // error[E0191]: the value of the associated type `Output`
1807 // (from trait `std::ops::BitXor`) must be specified
1808 // --> $DIR/issue-28344.rs:4:17
1810 // LL | let x: u8 = BitXor::bitor(0 as u8, 0 as u8);
1811 // | ^^^^^^^^^^^^^ help: specify the associated type:
1812 // | `BitXor::bitor<Output = Type>`
1813 [segment] if segment.args.is_none() => {
1814 trait_bound_spans = vec![segment.ident.span];
1815 associated_types = associated_types
1817 .map(|(_, items)| (segment.ident.span, items))
1824 trait_bound_spans.sort();
1825 let mut err = struct_span_err!(
1829 "the value of the associated type{} {} must be specified",
1830 pluralize!(names.len()),
1833 let mut suggestions = vec![];
1834 let mut types_count = 0;
1835 let mut where_constraints = vec![];
1836 for (span, assoc_items) in &associated_types {
1837 let mut names: FxHashMap<_, usize> = FxHashMap::default();
1838 for item in assoc_items {
1840 *names.entry(item.ident.name).or_insert(0) += 1;
1842 let mut dupes = false;
1843 for item in assoc_items {
1844 let prefix = if names[&item.ident.name] > 1 {
1845 let trait_def_id = item.container.id();
1847 format!("{}::", tcx.def_path_str(trait_def_id))
1851 if let Some(sp) = tcx.hir().span_if_local(item.def_id) {
1852 err.span_label(sp, format!("`{}{}` defined here", prefix, item.ident));
1855 if potential_assoc_types.len() == assoc_items.len() {
1856 // Only suggest when the amount of missing associated types equals the number of
1857 // extra type arguments present, as that gives us a relatively high confidence
1858 // that the user forgot to give the associtated type's name. The canonical
1859 // example would be trying to use `Iterator<isize>` instead of
1860 // `Iterator<Item = isize>`.
1861 for (potential, item) in potential_assoc_types.iter().zip(assoc_items.iter()) {
1862 if let Ok(snippet) = tcx.sess.source_map().span_to_snippet(*potential) {
1863 suggestions.push((*potential, format!("{} = {}", item.ident, snippet)));
1866 } else if let (Ok(snippet), false) =
1867 (tcx.sess.source_map().span_to_snippet(*span), dupes)
1870 assoc_items.iter().map(|item| format!("{} = Type", item.ident)).collect();
1871 let code = if snippet.ends_with('>') {
1872 // The user wrote `Trait<'a>` or similar and we don't have a type we can
1873 // suggest, but at least we can clue them to the correct syntax
1874 // `Trait<'a, Item = Type>` while accounting for the `<'a>` in the
1876 format!("{}, {}>", &snippet[..snippet.len() - 1], types.join(", "))
1878 // The user wrote `Iterator`, so we don't have a type we can suggest, but at
1879 // least we can clue them to the correct syntax `Iterator<Item = Type>`.
1880 format!("{}<{}>", snippet, types.join(", "))
1882 suggestions.push((*span, code));
1884 where_constraints.push(*span);
1887 let where_msg = "consider introducing a new type parameter, adding `where` constraints \
1888 using the fully-qualified path to the associated types";
1889 if !where_constraints.is_empty() && suggestions.is_empty() {
1890 // If there are duplicates associated type names and a single trait bound do not
1891 // use structured suggestion, it means that there are multiple super-traits with
1892 // the same associated type name.
1893 err.help(where_msg);
1895 if suggestions.len() != 1 {
1896 // We don't need this label if there's an inline suggestion, show otherwise.
1897 for (span, assoc_items) in &associated_types {
1898 let mut names: FxHashMap<_, usize> = FxHashMap::default();
1899 for item in assoc_items {
1901 *names.entry(item.ident.name).or_insert(0) += 1;
1903 let mut label = vec![];
1904 for item in assoc_items {
1905 let postfix = if names[&item.ident.name] > 1 {
1906 let trait_def_id = item.container.id();
1907 format!(" (from trait `{}`)", tcx.def_path_str(trait_def_id))
1911 label.push(format!("`{}`{}", item.ident, postfix));
1913 if !label.is_empty() {
1917 "associated type{} {} must be specified",
1918 pluralize!(label.len()),
1925 if !suggestions.is_empty() {
1926 err.multipart_suggestion(
1927 &format!("specify the associated type{}", pluralize!(types_count)),
1929 Applicability::HasPlaceholders,
1931 if !where_constraints.is_empty() {
1932 err.span_help(where_constraints, where_msg);
1938 fn report_ambiguous_associated_type(
1945 let mut err = struct_span_err!(self.tcx().sess, span, E0223, "ambiguous associated type");
1946 if let (Some(_), Ok(snippet)) = (
1947 self.tcx().sess.confused_type_with_std_module.borrow().get(&span),
1948 self.tcx().sess.source_map().span_to_snippet(span),
1950 err.span_suggestion(
1952 "you are looking for the module in `std`, not the primitive type",
1953 format!("std::{}", snippet),
1954 Applicability::MachineApplicable,
1957 err.span_suggestion(
1959 "use fully-qualified syntax",
1960 format!("<{} as {}>::{}", type_str, trait_str, name),
1961 Applicability::HasPlaceholders,
1967 // Search for a bound on a type parameter which includes the associated item
1968 // given by `assoc_name`. `ty_param_def_id` is the `DefId` of the type parameter
1969 // This function will fail if there are no suitable bounds or there is
1971 fn find_bound_for_assoc_item(
1973 ty_param_def_id: DefId,
1974 assoc_name: ast::Ident,
1976 ) -> Result<ty::PolyTraitRef<'tcx>, ErrorReported> {
1977 let tcx = self.tcx();
1980 "find_bound_for_assoc_item(ty_param_def_id={:?}, assoc_name={:?}, span={:?})",
1981 ty_param_def_id, assoc_name, span,
1984 let predicates = &self.get_type_parameter_bounds(span, ty_param_def_id).predicates;
1986 debug!("find_bound_for_assoc_item: predicates={:#?}", predicates);
1988 let param_hir_id = tcx.hir().as_local_hir_id(ty_param_def_id).unwrap();
1989 let param_name = tcx.hir().ty_param_name(param_hir_id);
1990 self.one_bound_for_assoc_type(
1992 traits::transitive_bounds(
1994 predicates.iter().filter_map(|(p, _)| p.to_opt_poly_trait_ref()),
1997 || param_name.to_string(),
2004 // Checks that `bounds` contains exactly one element and reports appropriate
2005 // errors otherwise.
2006 fn one_bound_for_assoc_type<I>(
2008 all_candidates: impl Fn() -> I,
2009 ty_param_name: impl Fn() -> String,
2010 assoc_name: ast::Ident,
2012 is_equality: impl Fn() -> Option<String>,
2013 ) -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
2015 I: Iterator<Item = ty::PolyTraitRef<'tcx>>,
2017 let mut matching_candidates = all_candidates()
2018 .filter(|r| self.trait_defines_associated_type_named(r.def_id(), assoc_name));
2020 let bound = match matching_candidates.next() {
2021 Some(bound) => bound,
2023 self.complain_about_assoc_type_not_found(
2029 return Err(ErrorReported);
2033 debug!("one_bound_for_assoc_type: bound = {:?}", bound);
2035 if let Some(bound2) = matching_candidates.next() {
2036 debug!("one_bound_for_assoc_type: bound2 = {:?}", bound2);
2038 let is_equality = is_equality();
2039 let bounds = iter::once(bound).chain(iter::once(bound2)).chain(matching_candidates);
2040 let mut err = if is_equality.is_some() {
2041 // More specific Error Index entry.
2046 "ambiguous associated type `{}` in bounds of `{}`",
2055 "ambiguous associated type `{}` in bounds of `{}`",
2060 err.span_label(span, format!("ambiguous associated type `{}`", assoc_name));
2062 let mut where_bounds = vec![];
2063 for bound in bounds {
2064 let bound_id = bound.def_id();
2065 let bound_span = self
2067 .associated_items(bound_id)
2068 .find_by_name_and_kind(self.tcx(), assoc_name, ty::AssocKind::Type, bound_id)
2069 .and_then(|item| self.tcx().hir().span_if_local(item.def_id));
2071 if let Some(bound_span) = bound_span {
2075 "ambiguous `{}` from `{}`",
2077 bound.print_only_trait_path(),
2080 if let Some(constraint) = &is_equality {
2081 where_bounds.push(format!(
2082 " T: {trait}::{assoc} = {constraint}",
2083 trait=bound.print_only_trait_path(),
2085 constraint=constraint,
2088 err.span_suggestion(
2090 "use fully qualified syntax to disambiguate",
2094 bound.print_only_trait_path(),
2097 Applicability::MaybeIncorrect,
2102 "associated type `{}` could derive from `{}`",
2104 bound.print_only_trait_path(),
2108 if !where_bounds.is_empty() {
2110 "consider introducing a new type parameter `T` and adding `where` constraints:\
2111 \n where\n T: {},\n{}",
2113 where_bounds.join(",\n"),
2117 if !where_bounds.is_empty() {
2118 return Err(ErrorReported);
2124 fn complain_about_assoc_type_not_found<I>(
2126 all_candidates: impl Fn() -> I,
2127 ty_param_name: &str,
2128 assoc_name: ast::Ident,
2131 I: Iterator<Item = ty::PolyTraitRef<'tcx>>,
2133 // The fallback span is needed because `assoc_name` might be an `Fn()`'s `Output` without a
2134 // valid span, so we point at the whole path segment instead.
2135 let span = if assoc_name.span != DUMMY_SP { assoc_name.span } else { span };
2136 let mut err = struct_span_err!(
2140 "associated type `{}` not found for `{}`",
2145 let all_candidate_names: Vec<_> = all_candidates()
2146 .map(|r| self.tcx().associated_items(r.def_id()).in_definition_order())
2149 |item| if item.kind == ty::AssocKind::Type { Some(item.ident.name) } else { None },
2153 if let (Some(suggested_name), true) = (
2154 find_best_match_for_name(all_candidate_names.iter(), &assoc_name.as_str(), None),
2155 assoc_name.span != DUMMY_SP,
2157 err.span_suggestion(
2159 "there is an associated type with a similar name",
2160 suggested_name.to_string(),
2161 Applicability::MaybeIncorrect,
2164 err.span_label(span, format!("associated type `{}` not found", assoc_name));
2170 // Create a type from a path to an associated type.
2171 // For a path `A::B::C::D`, `qself_ty` and `qself_def` are the type and def for `A::B::C`
2172 // and item_segment is the path segment for `D`. We return a type and a def for
2174 // Will fail except for `T::A` and `Self::A`; i.e., if `qself_ty`/`qself_def` are not a type
2175 // parameter or `Self`.
2176 pub fn associated_path_to_ty(
2178 hir_ref_id: hir::HirId,
2182 assoc_segment: &hir::PathSegment<'_>,
2183 permit_variants: bool,
2184 ) -> Result<(Ty<'tcx>, DefKind, DefId), ErrorReported> {
2185 let tcx = self.tcx();
2186 let assoc_ident = assoc_segment.ident;
2188 debug!("associated_path_to_ty: {:?}::{}", qself_ty, assoc_ident);
2190 // Check if we have an enum variant.
2191 let mut variant_resolution = None;
2192 if let ty::Adt(adt_def, _) = qself_ty.kind {
2193 if adt_def.is_enum() {
2194 let variant_def = adt_def
2197 .find(|vd| tcx.hygienic_eq(assoc_ident, vd.ident, adt_def.did));
2198 if let Some(variant_def) = variant_def {
2199 if permit_variants {
2200 tcx.check_stability(variant_def.def_id, Some(hir_ref_id), span);
2201 self.prohibit_generics(slice::from_ref(assoc_segment));
2202 return Ok((qself_ty, DefKind::Variant, variant_def.def_id));
2204 variant_resolution = Some(variant_def.def_id);
2210 // Find the type of the associated item, and the trait where the associated
2211 // item is declared.
2212 let bound = match (&qself_ty.kind, qself_res) {
2213 (_, Res::SelfTy(Some(_), Some(impl_def_id))) => {
2214 // `Self` in an impl of a trait -- we have a concrete self type and a
2216 let trait_ref = match tcx.impl_trait_ref(impl_def_id) {
2217 Some(trait_ref) => trait_ref,
2219 // A cycle error occurred, most likely.
2220 return Err(ErrorReported);
2224 self.one_bound_for_assoc_type(
2225 || traits::supertraits(tcx, ty::Binder::bind(trait_ref)),
2226 || "Self".to_string(),
2232 (&ty::Param(_), Res::SelfTy(Some(param_did), None))
2233 | (&ty::Param(_), Res::Def(DefKind::TyParam, param_did)) => {
2234 self.find_bound_for_assoc_item(param_did, assoc_ident, span)?
2237 if variant_resolution.is_some() {
2238 // Variant in type position
2239 let msg = format!("expected type, found variant `{}`", assoc_ident);
2240 tcx.sess.span_err(span, &msg);
2241 } else if qself_ty.is_enum() {
2242 let mut err = struct_span_err!(
2246 "no variant named `{}` found for enum `{}`",
2251 let adt_def = qself_ty.ty_adt_def().expect("enum is not an ADT");
2252 if let Some(suggested_name) = find_best_match_for_name(
2253 adt_def.variants.iter().map(|variant| &variant.ident.name),
2254 &assoc_ident.as_str(),
2257 err.span_suggestion(
2259 "there is a variant with a similar name",
2260 suggested_name.to_string(),
2261 Applicability::MaybeIncorrect,
2266 format!("variant not found in `{}`", qself_ty),
2270 if let Some(sp) = tcx.hir().span_if_local(adt_def.did) {
2271 let sp = tcx.sess.source_map().guess_head_span(sp);
2272 err.span_label(sp, format!("variant `{}` not found here", assoc_ident));
2276 } else if !qself_ty.references_error() {
2277 // Don't print `TyErr` to the user.
2278 self.report_ambiguous_associated_type(
2280 &qself_ty.to_string(),
2285 return Err(ErrorReported);
2289 let trait_did = bound.def_id();
2290 let (assoc_ident, def_scope) =
2291 tcx.adjust_ident_and_get_scope(assoc_ident, trait_did, hir_ref_id);
2293 // We have already adjusted the item name above, so compare with `ident.normalize_to_macros_2_0()` instead
2294 // of calling `filter_by_name_and_kind`.
2296 .associated_items(trait_did)
2297 .in_definition_order()
2299 i.kind.namespace() == Namespace::TypeNS
2300 && i.ident.normalize_to_macros_2_0() == assoc_ident
2302 .expect("missing associated type");
2304 let ty = self.projected_ty_from_poly_trait_ref(span, item.def_id, assoc_segment, bound);
2305 let ty = self.normalize_ty(span, ty);
2307 let kind = DefKind::AssocTy;
2308 if !item.vis.is_accessible_from(def_scope, tcx) {
2309 let kind = kind.descr(item.def_id);
2310 let msg = format!("{} `{}` is private", kind, assoc_ident);
2312 .struct_span_err(span, &msg)
2313 .span_label(span, &format!("private {}", kind))
2316 tcx.check_stability(item.def_id, Some(hir_ref_id), span);
2318 if let Some(variant_def_id) = variant_resolution {
2319 tcx.struct_span_lint_hir(AMBIGUOUS_ASSOCIATED_ITEMS, hir_ref_id, span, |lint| {
2320 let mut err = lint.build("ambiguous associated item");
2321 let mut could_refer_to = |kind: DefKind, def_id, also| {
2322 let note_msg = format!(
2323 "`{}` could{} refer to the {} defined here",
2328 err.span_note(tcx.def_span(def_id), ¬e_msg);
2331 could_refer_to(DefKind::Variant, variant_def_id, "");
2332 could_refer_to(kind, item.def_id, " also");
2334 err.span_suggestion(
2336 "use fully-qualified syntax",
2337 format!("<{} as {}>::{}", qself_ty, tcx.item_name(trait_did), assoc_ident),
2338 Applicability::MachineApplicable,
2344 Ok((ty, kind, item.def_id))
2350 opt_self_ty: Option<Ty<'tcx>>,
2352 trait_segment: &hir::PathSegment<'_>,
2353 item_segment: &hir::PathSegment<'_>,
2355 let tcx = self.tcx();
2357 let trait_def_id = tcx.parent(item_def_id).unwrap();
2359 debug!("qpath_to_ty: trait_def_id={:?}", trait_def_id);
2361 let self_ty = if let Some(ty) = opt_self_ty {
2364 let path_str = tcx.def_path_str(trait_def_id);
2366 let def_id = self.item_def_id();
2368 debug!("qpath_to_ty: self.item_def_id()={:?}", def_id);
2370 let parent_def_id = def_id
2371 .and_then(|def_id| tcx.hir().as_local_hir_id(def_id))
2372 .map(|hir_id| tcx.hir().get_parent_did(hir_id));
2374 debug!("qpath_to_ty: parent_def_id={:?}", parent_def_id);
2376 // If the trait in segment is the same as the trait defining the item,
2377 // use the `<Self as ..>` syntax in the error.
2378 let is_part_of_self_trait_constraints = def_id == Some(trait_def_id);
2379 let is_part_of_fn_in_self_trait = parent_def_id == Some(trait_def_id);
2381 let type_name = if is_part_of_self_trait_constraints || is_part_of_fn_in_self_trait {
2387 self.report_ambiguous_associated_type(
2391 item_segment.ident.name,
2393 return tcx.types.err;
2396 debug!("qpath_to_ty: self_type={:?}", self_ty);
2398 let trait_ref = self.ast_path_to_mono_trait_ref(span, trait_def_id, self_ty, trait_segment);
2400 let item_substs = self.create_substs_for_associated_item(
2408 debug!("qpath_to_ty: trait_ref={:?}", trait_ref);
2410 self.normalize_ty(span, tcx.mk_projection(item_def_id, item_substs))
2413 pub fn prohibit_generics<'a, T: IntoIterator<Item = &'a hir::PathSegment<'a>>>(
2417 let mut has_err = false;
2418 for segment in segments {
2419 let (mut err_for_lt, mut err_for_ty, mut err_for_ct) = (false, false, false);
2420 for arg in segment.generic_args().args {
2421 let (span, kind) = match arg {
2422 hir::GenericArg::Lifetime(lt) => {
2428 (lt.span, "lifetime")
2430 hir::GenericArg::Type(ty) => {
2438 hir::GenericArg::Const(ct) => {
2447 let mut err = struct_span_err!(
2451 "{} arguments are not allowed for this type",
2454 err.span_label(span, format!("{} argument not allowed", kind));
2456 if err_for_lt && err_for_ty && err_for_ct {
2461 // Only emit the first error to avoid overloading the user with error messages.
2462 if let [binding, ..] = segment.generic_args().bindings {
2464 Self::prohibit_assoc_ty_binding(self.tcx(), binding.span);
2470 pub fn prohibit_assoc_ty_binding(tcx: TyCtxt<'_>, span: Span) {
2471 let mut err = struct_span_err!(
2475 "associated type bindings are not allowed here"
2477 err.span_label(span, "associated type not allowed here").emit();
2480 // FIXME(eddyb, varkor) handle type paths here too, not just value ones.
2481 pub fn def_ids_for_value_path_segments(
2483 segments: &[hir::PathSegment<'_>],
2484 self_ty: Option<Ty<'tcx>>,
2488 // We need to extract the type parameters supplied by the user in
2489 // the path `path`. Due to the current setup, this is a bit of a
2490 // tricky-process; the problem is that resolve only tells us the
2491 // end-point of the path resolution, and not the intermediate steps.
2492 // Luckily, we can (at least for now) deduce the intermediate steps
2493 // just from the end-point.
2495 // There are basically five cases to consider:
2497 // 1. Reference to a constructor of a struct:
2499 // struct Foo<T>(...)
2501 // In this case, the parameters are declared in the type space.
2503 // 2. Reference to a constructor of an enum variant:
2505 // enum E<T> { Foo(...) }
2507 // In this case, the parameters are defined in the type space,
2508 // but may be specified either on the type or the variant.
2510 // 3. Reference to a fn item or a free constant:
2514 // In this case, the path will again always have the form
2515 // `a::b::foo::<T>` where only the final segment should have
2516 // type parameters. However, in this case, those parameters are
2517 // declared on a value, and hence are in the `FnSpace`.
2519 // 4. Reference to a method or an associated constant:
2521 // impl<A> SomeStruct<A> {
2525 // Here we can have a path like
2526 // `a::b::SomeStruct::<A>::foo::<B>`, in which case parameters
2527 // may appear in two places. The penultimate segment,
2528 // `SomeStruct::<A>`, contains parameters in TypeSpace, and the
2529 // final segment, `foo::<B>` contains parameters in fn space.
2531 // The first step then is to categorize the segments appropriately.
2533 let tcx = self.tcx();
2535 assert!(!segments.is_empty());
2536 let last = segments.len() - 1;
2538 let mut path_segs = vec![];
2541 // Case 1. Reference to a struct constructor.
2542 DefKind::Ctor(CtorOf::Struct, ..) => {
2543 // Everything but the final segment should have no
2544 // parameters at all.
2545 let generics = tcx.generics_of(def_id);
2546 // Variant and struct constructors use the
2547 // generics of their parent type definition.
2548 let generics_def_id = generics.parent.unwrap_or(def_id);
2549 path_segs.push(PathSeg(generics_def_id, last));
2552 // Case 2. Reference to a variant constructor.
2553 DefKind::Ctor(CtorOf::Variant, ..) | DefKind::Variant => {
2554 let adt_def = self_ty.map(|t| t.ty_adt_def().unwrap());
2555 let (generics_def_id, index) = if let Some(adt_def) = adt_def {
2556 debug_assert!(adt_def.is_enum());
2558 } else if last >= 1 && segments[last - 1].args.is_some() {
2559 // Everything but the penultimate segment should have no
2560 // parameters at all.
2561 let mut def_id = def_id;
2563 // `DefKind::Ctor` -> `DefKind::Variant`
2564 if let DefKind::Ctor(..) = kind {
2565 def_id = tcx.parent(def_id).unwrap()
2568 // `DefKind::Variant` -> `DefKind::Enum`
2569 let enum_def_id = tcx.parent(def_id).unwrap();
2570 (enum_def_id, last - 1)
2572 // FIXME: lint here recommending `Enum::<...>::Variant` form
2573 // instead of `Enum::Variant::<...>` form.
2575 // Everything but the final segment should have no
2576 // parameters at all.
2577 let generics = tcx.generics_of(def_id);
2578 // Variant and struct constructors use the
2579 // generics of their parent type definition.
2580 (generics.parent.unwrap_or(def_id), last)
2582 path_segs.push(PathSeg(generics_def_id, index));
2585 // Case 3. Reference to a top-level value.
2586 DefKind::Fn | DefKind::Const | DefKind::ConstParam | DefKind::Static => {
2587 path_segs.push(PathSeg(def_id, last));
2590 // Case 4. Reference to a method or associated const.
2591 DefKind::AssocFn | DefKind::AssocConst => {
2592 if segments.len() >= 2 {
2593 let generics = tcx.generics_of(def_id);
2594 path_segs.push(PathSeg(generics.parent.unwrap(), last - 1));
2596 path_segs.push(PathSeg(def_id, last));
2599 kind => bug!("unexpected definition kind {:?} for {:?}", kind, def_id),
2602 debug!("path_segs = {:?}", path_segs);
2607 // Check a type `Path` and convert it to a `Ty`.
2610 opt_self_ty: Option<Ty<'tcx>>,
2611 path: &hir::Path<'_>,
2612 permit_variants: bool,
2614 let tcx = self.tcx();
2617 "res_to_ty(res={:?}, opt_self_ty={:?}, path_segments={:?})",
2618 path.res, opt_self_ty, path.segments
2621 let span = path.span;
2623 Res::Def(DefKind::OpaqueTy, did) => {
2624 // Check for desugared `impl Trait`.
2625 assert!(ty::is_impl_trait_defn(tcx, did).is_none());
2626 let item_segment = path.segments.split_last().unwrap();
2627 self.prohibit_generics(item_segment.1);
2628 let substs = self.ast_path_substs_for_ty(span, did, item_segment.0);
2629 self.normalize_ty(span, tcx.mk_opaque(did, substs))
2631 Res::Def(DefKind::Enum, did)
2632 | Res::Def(DefKind::TyAlias, did)
2633 | Res::Def(DefKind::Struct, did)
2634 | Res::Def(DefKind::Union, did)
2635 | Res::Def(DefKind::ForeignTy, did) => {
2636 assert_eq!(opt_self_ty, None);
2637 self.prohibit_generics(path.segments.split_last().unwrap().1);
2638 self.ast_path_to_ty(span, did, path.segments.last().unwrap())
2640 Res::Def(kind @ DefKind::Variant, def_id) if permit_variants => {
2641 // Convert "variant type" as if it were a real type.
2642 // The resulting `Ty` is type of the variant's enum for now.
2643 assert_eq!(opt_self_ty, None);
2646 self.def_ids_for_value_path_segments(&path.segments, None, kind, def_id);
2647 let generic_segs: FxHashSet<_> =
2648 path_segs.iter().map(|PathSeg(_, index)| index).collect();
2649 self.prohibit_generics(path.segments.iter().enumerate().filter_map(
2651 if !generic_segs.contains(&index) { Some(seg) } else { None }
2655 let PathSeg(def_id, index) = path_segs.last().unwrap();
2656 self.ast_path_to_ty(span, *def_id, &path.segments[*index])
2658 Res::Def(DefKind::TyParam, def_id) => {
2659 assert_eq!(opt_self_ty, None);
2660 self.prohibit_generics(path.segments);
2662 let hir_id = tcx.hir().as_local_hir_id(def_id).unwrap();
2663 let item_id = tcx.hir().get_parent_node(hir_id);
2664 let item_def_id = tcx.hir().local_def_id(item_id);
2665 let generics = tcx.generics_of(item_def_id);
2666 let index = generics.param_def_id_to_index[&def_id];
2667 tcx.mk_ty_param(index, tcx.hir().name(hir_id))
2669 Res::SelfTy(Some(_), None) => {
2670 // `Self` in trait or type alias.
2671 assert_eq!(opt_self_ty, None);
2672 self.prohibit_generics(path.segments);
2673 tcx.types.self_param
2675 Res::SelfTy(_, Some(def_id)) => {
2676 // `Self` in impl (we know the concrete type).
2677 assert_eq!(opt_self_ty, None);
2678 self.prohibit_generics(path.segments);
2679 // Try to evaluate any array length constants.
2680 self.normalize_ty(span, tcx.at(span).type_of(def_id))
2682 Res::Def(DefKind::AssocTy, def_id) => {
2683 debug_assert!(path.segments.len() >= 2);
2684 self.prohibit_generics(&path.segments[..path.segments.len() - 2]);
2689 &path.segments[path.segments.len() - 2],
2690 path.segments.last().unwrap(),
2693 Res::PrimTy(prim_ty) => {
2694 assert_eq!(opt_self_ty, None);
2695 self.prohibit_generics(path.segments);
2697 hir::PrimTy::Bool => tcx.types.bool,
2698 hir::PrimTy::Char => tcx.types.char,
2699 hir::PrimTy::Int(it) => tcx.mk_mach_int(it),
2700 hir::PrimTy::Uint(uit) => tcx.mk_mach_uint(uit),
2701 hir::PrimTy::Float(ft) => tcx.mk_mach_float(ft),
2702 hir::PrimTy::Str => tcx.mk_str(),
2706 self.set_tainted_by_errors();
2707 self.tcx().types.err
2709 _ => span_bug!(span, "unexpected resolution: {:?}", path.res),
2713 /// Parses the programmer's textual representation of a type into our
2714 /// internal notion of a type.
2715 pub fn ast_ty_to_ty(&self, ast_ty: &hir::Ty<'_>) -> Ty<'tcx> {
2716 debug!("ast_ty_to_ty(id={:?}, ast_ty={:?} ty_ty={:?})", ast_ty.hir_id, ast_ty, ast_ty.kind);
2718 let tcx = self.tcx();
2720 let result_ty = match ast_ty.kind {
2721 hir::TyKind::Slice(ref ty) => tcx.mk_slice(self.ast_ty_to_ty(&ty)),
2722 hir::TyKind::Ptr(ref mt) => {
2723 tcx.mk_ptr(ty::TypeAndMut { ty: self.ast_ty_to_ty(&mt.ty), mutbl: mt.mutbl })
2725 hir::TyKind::Rptr(ref region, ref mt) => {
2726 let r = self.ast_region_to_region(region, None);
2727 debug!("ast_ty_to_ty: r={:?}", r);
2728 let t = self.ast_ty_to_ty(&mt.ty);
2729 tcx.mk_ref(r, ty::TypeAndMut { ty: t, mutbl: mt.mutbl })
2731 hir::TyKind::Never => tcx.types.never,
2732 hir::TyKind::Tup(ref fields) => {
2733 tcx.mk_tup(fields.iter().map(|t| self.ast_ty_to_ty(&t)))
2735 hir::TyKind::BareFn(ref bf) => {
2736 require_c_abi_if_c_variadic(tcx, &bf.decl, bf.abi, ast_ty.span);
2737 tcx.mk_fn_ptr(self.ty_of_fn(
2741 &hir::Generics::empty(),
2745 hir::TyKind::TraitObject(ref bounds, ref lifetime) => {
2746 self.conv_object_ty_poly_trait_ref(ast_ty.span, bounds, lifetime)
2748 hir::TyKind::Path(hir::QPath::Resolved(ref maybe_qself, ref path)) => {
2749 debug!("ast_ty_to_ty: maybe_qself={:?} path={:?}", maybe_qself, path);
2750 let opt_self_ty = maybe_qself.as_ref().map(|qself| self.ast_ty_to_ty(qself));
2751 self.res_to_ty(opt_self_ty, path, false)
2753 hir::TyKind::Def(item_id, ref lifetimes) => {
2754 let did = tcx.hir().local_def_id(item_id.id);
2755 self.impl_trait_ty_to_ty(did, lifetimes)
2757 hir::TyKind::Path(hir::QPath::TypeRelative(ref qself, ref segment)) => {
2758 debug!("ast_ty_to_ty: qself={:?} segment={:?}", qself, segment);
2759 let ty = self.ast_ty_to_ty(qself);
2761 let res = if let hir::TyKind::Path(hir::QPath::Resolved(_, ref path)) = qself.kind {
2766 self.associated_path_to_ty(ast_ty.hir_id, ast_ty.span, ty, res, segment, false)
2767 .map(|(ty, _, _)| ty)
2768 .unwrap_or(tcx.types.err)
2770 hir::TyKind::Array(ref ty, ref length) => {
2771 let length_def_id = tcx.hir().local_def_id(length.hir_id).expect_local();
2772 let length = ty::Const::from_anon_const(tcx, length_def_id);
2773 let array_ty = tcx.mk_ty(ty::Array(self.ast_ty_to_ty(&ty), length));
2774 self.normalize_ty(ast_ty.span, array_ty)
2776 hir::TyKind::Typeof(ref _e) => {
2781 "`typeof` is a reserved keyword but unimplemented"
2783 .span_label(ast_ty.span, "reserved keyword")
2788 hir::TyKind::Infer => {
2789 // Infer also appears as the type of arguments or return
2790 // values in a ExprKind::Closure, or as
2791 // the type of local variables. Both of these cases are
2792 // handled specially and will not descend into this routine.
2793 self.ty_infer(None, ast_ty.span)
2795 hir::TyKind::Err => tcx.types.err,
2798 debug!("ast_ty_to_ty: result_ty={:?}", result_ty);
2800 self.record_ty(ast_ty.hir_id, result_ty, ast_ty.span);
2804 pub fn impl_trait_ty_to_ty(
2807 lifetimes: &[hir::GenericArg<'_>],
2809 debug!("impl_trait_ty_to_ty(def_id={:?}, lifetimes={:?})", def_id, lifetimes);
2810 let tcx = self.tcx();
2812 let generics = tcx.generics_of(def_id);
2814 debug!("impl_trait_ty_to_ty: generics={:?}", generics);
2815 let substs = InternalSubsts::for_item(tcx, def_id, |param, _| {
2816 if let Some(i) = (param.index as usize).checked_sub(generics.parent_count) {
2817 // Our own parameters are the resolved lifetimes.
2819 GenericParamDefKind::Lifetime => {
2820 if let hir::GenericArg::Lifetime(lifetime) = &lifetimes[i] {
2821 self.ast_region_to_region(lifetime, None).into()
2829 // Replace all parent lifetimes with `'static`.
2831 GenericParamDefKind::Lifetime => tcx.lifetimes.re_static.into(),
2832 _ => tcx.mk_param_from_def(param),
2836 debug!("impl_trait_ty_to_ty: substs={:?}", substs);
2838 let ty = tcx.mk_opaque(def_id, substs);
2839 debug!("impl_trait_ty_to_ty: {}", ty);
2843 pub fn ty_of_arg(&self, ty: &hir::Ty<'_>, expected_ty: Option<Ty<'tcx>>) -> Ty<'tcx> {
2845 hir::TyKind::Infer if expected_ty.is_some() => {
2846 self.record_ty(ty.hir_id, expected_ty.unwrap(), ty.span);
2847 expected_ty.unwrap()
2849 _ => self.ast_ty_to_ty(ty),
2855 unsafety: hir::Unsafety,
2857 decl: &hir::FnDecl<'_>,
2858 generics: &hir::Generics<'_>,
2859 ident_span: Option<Span>,
2860 ) -> ty::PolyFnSig<'tcx> {
2863 let tcx = self.tcx();
2865 // We proactively collect all the inferred type params to emit a single error per fn def.
2866 let mut visitor = PlaceholderHirTyCollector::default();
2867 for ty in decl.inputs {
2868 visitor.visit_ty(ty);
2870 walk_generics(&mut visitor, generics);
2872 let input_tys = decl.inputs.iter().map(|a| self.ty_of_arg(a, None));
2873 let output_ty = match decl.output {
2874 hir::FnRetTy::Return(ref output) => {
2875 visitor.visit_ty(output);
2876 self.ast_ty_to_ty(output)
2878 hir::FnRetTy::DefaultReturn(..) => tcx.mk_unit(),
2881 debug!("ty_of_fn: output_ty={:?}", output_ty);
2884 ty::Binder::bind(tcx.mk_fn_sig(input_tys, output_ty, decl.c_variadic, unsafety, abi));
2886 if let (false, Some(ident_span)) = (self.allow_ty_infer(), ident_span) {
2887 // We always collect the spans for placeholder types when evaluating `fn`s, but we
2888 // only want to emit an error complaining about them if infer types (`_`) are not
2889 // allowed. `allow_ty_infer` gates this behavior. We check for the presence of
2890 // `ident_span` to not emit an error twice when we have `fn foo(_: fn() -> _)`.
2891 crate::collect::placeholder_type_error(
2893 ident_span.shrink_to_hi(),
2894 &generics.params[..],
2900 // Find any late-bound regions declared in return type that do
2901 // not appear in the arguments. These are not well-formed.
2904 // for<'a> fn() -> &'a str <-- 'a is bad
2905 // for<'a> fn(&'a String) -> &'a str <-- 'a is ok
2906 let inputs = bare_fn_ty.inputs();
2907 let late_bound_in_args =
2908 tcx.collect_constrained_late_bound_regions(&inputs.map_bound(|i| i.to_owned()));
2909 let output = bare_fn_ty.output();
2910 let late_bound_in_ret = tcx.collect_referenced_late_bound_regions(&output);
2911 for br in late_bound_in_ret.difference(&late_bound_in_args) {
2912 let lifetime_name = match *br {
2913 ty::BrNamed(_, name) => format!("lifetime `{}`,", name),
2914 ty::BrAnon(_) | ty::BrEnv => "an anonymous lifetime".to_string(),
2916 let mut err = struct_span_err!(
2920 "return type references {} which is not constrained by the fn input types",
2923 if let ty::BrAnon(_) = *br {
2924 // The only way for an anonymous lifetime to wind up
2925 // in the return type but **also** be unconstrained is
2926 // if it only appears in "associated types" in the
2927 // input. See #47511 for an example. In this case,
2928 // though we can easily give a hint that ought to be
2931 "lifetimes appearing in an associated type are not considered constrained",
2940 /// Given the bounds on an object, determines what single region bound (if any) we can
2941 /// use to summarize this type. The basic idea is that we will use the bound the user
2942 /// provided, if they provided one, and otherwise search the supertypes of trait bounds
2943 /// for region bounds. It may be that we can derive no bound at all, in which case
2944 /// we return `None`.
2945 fn compute_object_lifetime_bound(
2948 existential_predicates: ty::Binder<&'tcx ty::List<ty::ExistentialPredicate<'tcx>>>,
2949 ) -> Option<ty::Region<'tcx>> // if None, use the default
2951 let tcx = self.tcx();
2953 debug!("compute_opt_region_bound(existential_predicates={:?})", existential_predicates);
2955 // No explicit region bound specified. Therefore, examine trait
2956 // bounds and see if we can derive region bounds from those.
2957 let derived_region_bounds = object_region_bounds(tcx, existential_predicates);
2959 // If there are no derived region bounds, then report back that we
2960 // can find no region bound. The caller will use the default.
2961 if derived_region_bounds.is_empty() {
2965 // If any of the derived region bounds are 'static, that is always
2967 if derived_region_bounds.iter().any(|&r| ty::ReStatic == *r) {
2968 return Some(tcx.lifetimes.re_static);
2971 // Determine whether there is exactly one unique region in the set
2972 // of derived region bounds. If so, use that. Otherwise, report an
2974 let r = derived_region_bounds[0];
2975 if derived_region_bounds[1..].iter().any(|r1| r != *r1) {
2980 "ambiguous lifetime bound, explicit lifetime bound required"
2988 /// Collects together a list of bounds that are applied to some type,
2989 /// after they've been converted into `ty` form (from the HIR
2990 /// representations). These lists of bounds occur in many places in
2994 /// trait Foo: Bar + Baz { }
2995 /// ^^^^^^^^^ supertrait list bounding the `Self` type parameter
2997 /// fn foo<T: Bar + Baz>() { }
2998 /// ^^^^^^^^^ bounding the type parameter `T`
3000 /// impl dyn Bar + Baz
3001 /// ^^^^^^^^^ bounding the forgotten dynamic type
3004 /// Our representation is a bit mixed here -- in some cases, we
3005 /// include the self type (e.g., `trait_bounds`) but in others we do
3006 #[derive(Default, PartialEq, Eq, Clone, Debug)]
3007 pub struct Bounds<'tcx> {
3008 /// A list of region bounds on the (implicit) self type. So if you
3009 /// had `T: 'a + 'b` this might would be a list `['a, 'b]` (but
3010 /// the `T` is not explicitly included).
3011 pub region_bounds: Vec<(ty::Region<'tcx>, Span)>,
3013 /// A list of trait bounds. So if you had `T: Debug` this would be
3014 /// `T: Debug`. Note that the self-type is explicit here.
3015 pub trait_bounds: Vec<(ty::PolyTraitRef<'tcx>, Span, Constness)>,
3017 /// A list of projection equality bounds. So if you had `T:
3018 /// Iterator<Item = u32>` this would include `<T as
3019 /// Iterator>::Item => u32`. Note that the self-type is explicit
3021 pub projection_bounds: Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>,
3023 /// `Some` if there is *no* `?Sized` predicate. The `span`
3024 /// is the location in the source of the `T` declaration which can
3025 /// be cited as the source of the `T: Sized` requirement.
3026 pub implicitly_sized: Option<Span>,
3029 impl<'tcx> Bounds<'tcx> {
3030 /// Converts a bounds list into a flat set of predicates (like
3031 /// where-clauses). Because some of our bounds listings (e.g.,
3032 /// regions) don't include the self-type, you must supply the
3033 /// self-type here (the `param_ty` parameter).
3038 ) -> Vec<(ty::Predicate<'tcx>, Span)> {
3039 // If it could be sized, and is, add the `Sized` predicate.
3040 let sized_predicate = self.implicitly_sized.and_then(|span| {
3041 tcx.lang_items().sized_trait().map(|sized| {
3042 let trait_ref = ty::Binder::bind(ty::TraitRef {
3044 substs: tcx.mk_substs_trait(param_ty, &[]),
3046 (trait_ref.without_const().to_predicate(), span)
3055 .map(|&(region_bound, span)| {
3056 // Account for the binder being introduced below; no need to shift `param_ty`
3057 // because, at present at least, it either only refers to early-bound regions,
3058 // or it's a generic associated type that deliberately has escaping bound vars.
3059 let region_bound = ty::fold::shift_region(tcx, region_bound, 1);
3060 let outlives = ty::OutlivesPredicate(param_ty, region_bound);
3061 (ty::Binder::bind(outlives).to_predicate(), span)
3063 .chain(self.trait_bounds.iter().map(|&(bound_trait_ref, span, constness)| {
3064 let predicate = bound_trait_ref.with_constness(constness).to_predicate();
3068 self.projection_bounds
3070 .map(|&(projection, span)| (projection.to_predicate(), span)),