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;
11 use rustc_ast::{ast::ParamKindOrd, util::lev_distance::find_best_match_for_name};
12 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
13 use rustc_errors::ErrorReported;
14 use rustc_errors::{pluralize, struct_span_err, Applicability, DiagnosticId, FatalError};
16 use rustc_hir::def::{CtorOf, DefKind, Namespace, Res};
17 use rustc_hir::def_id::{DefId, LocalDefId};
18 use rustc_hir::intravisit::{walk_generics, Visitor as _};
19 use rustc_hir::lang_items::SizedTraitLangItem;
20 use rustc_hir::{Constness, GenericArg, GenericArgs};
21 use rustc_middle::ty::subst::{self, InternalSubsts, Subst, SubstsRef};
22 use rustc_middle::ty::{
23 self, Const, DefIdTree, ToPredicate, Ty, TyCtxt, TypeFoldable, WithConstness,
25 use rustc_middle::ty::{GenericParamDef, GenericParamDefKind};
26 use rustc_session::lint::builtin::{AMBIGUOUS_ASSOCIATED_ITEMS, LATE_BOUND_LIFETIME_ARGUMENTS};
27 use rustc_session::parse::feature_err;
28 use rustc_session::Session;
29 use rustc_span::symbol::{kw, sym, Ident, Symbol};
30 use rustc_span::{MultiSpan, Span, DUMMY_SP};
31 use rustc_target::spec::abi;
32 use rustc_trait_selection::traits;
33 use rustc_trait_selection::traits::astconv_object_safety_violations;
34 use rustc_trait_selection::traits::error_reporting::report_object_safety_error;
35 use rustc_trait_selection::traits::wf::object_region_bounds;
37 use smallvec::SmallVec;
38 use std::collections::BTreeSet;
43 pub struct PathSeg(pub DefId, pub usize);
45 pub trait AstConv<'tcx> {
46 fn tcx<'a>(&'a self) -> TyCtxt<'tcx>;
48 fn item_def_id(&self) -> Option<DefId>;
50 fn default_constness_for_trait_bounds(&self) -> Constness;
52 /// Returns predicates in scope of the form `X: Foo`, where `X` is
53 /// a type parameter `X` with the given id `def_id`. This is a
54 /// subset of the full set of predicates.
56 /// This is used for one specific purpose: resolving "short-hand"
57 /// associated type references like `T::Item`. In principle, we
58 /// would do that by first getting the full set of predicates in
59 /// scope and then filtering down to find those that apply to `T`,
60 /// but this can lead to cycle errors. The problem is that we have
61 /// to do this resolution *in order to create the predicates in
62 /// the first place*. Hence, we have this "special pass".
63 fn get_type_parameter_bounds(&self, span: Span, def_id: DefId) -> ty::GenericPredicates<'tcx>;
65 /// Returns the lifetime to use when a lifetime is omitted (and not elided).
66 fn re_infer(&self, param: Option<&ty::GenericParamDef>, span: Span)
67 -> Option<ty::Region<'tcx>>;
69 /// Returns the type to use when a type is omitted.
70 fn ty_infer(&self, param: Option<&ty::GenericParamDef>, span: Span) -> Ty<'tcx>;
72 /// Returns `true` if `_` is allowed in type signatures in the current context.
73 fn allow_ty_infer(&self) -> bool;
75 /// Returns the const to use when a const is omitted.
79 param: Option<&ty::GenericParamDef>,
81 ) -> &'tcx Const<'tcx>;
83 /// Projecting an associated type from a (potentially)
84 /// higher-ranked trait reference is more complicated, because of
85 /// the possibility of late-bound regions appearing in the
86 /// associated type binding. This is not legal in function
87 /// signatures for that reason. In a function body, we can always
88 /// handle it because we can use inference variables to remove the
89 /// late-bound regions.
90 fn projected_ty_from_poly_trait_ref(
94 item_segment: &hir::PathSegment<'_>,
95 poly_trait_ref: ty::PolyTraitRef<'tcx>,
98 /// Normalize an associated type coming from the user.
99 fn normalize_ty(&self, span: Span, ty: Ty<'tcx>) -> Ty<'tcx>;
101 /// Invoked when we encounter an error from some prior pass
102 /// (e.g., resolve) that is translated into a ty-error. This is
103 /// used to help suppress derived errors typeck might otherwise
105 fn set_tainted_by_errors(&self);
107 fn record_ty(&self, hir_id: hir::HirId, ty: Ty<'tcx>, span: Span);
110 pub enum SizedByDefault {
115 struct ConvertedBinding<'a, 'tcx> {
117 kind: ConvertedBindingKind<'a, 'tcx>,
121 enum ConvertedBindingKind<'a, 'tcx> {
123 Constraint(&'a [hir::GenericBound<'a>]),
126 /// New-typed boolean indicating whether explicit late-bound lifetimes
127 /// are present in a set of generic arguments.
129 /// For example if we have some method `fn f<'a>(&'a self)` implemented
130 /// for some type `T`, although `f` is generic in the lifetime `'a`, `'a`
131 /// is late-bound so should not be provided explicitly. Thus, if `f` is
132 /// instantiated with some generic arguments providing `'a` explicitly,
133 /// we taint those arguments with `ExplicitLateBound::Yes` so that we
134 /// can provide an appropriate diagnostic later.
135 #[derive(Copy, Clone, PartialEq)]
136 pub enum ExplicitLateBound {
141 #[derive(Copy, Clone, PartialEq)]
142 enum GenericArgPosition {
144 Value, // e.g., functions
148 /// A marker denoting that the generic arguments that were
149 /// provided did not match the respective generic parameters.
150 #[derive(Clone, Default)]
151 pub struct GenericArgCountMismatch {
152 /// Indicates whether a fatal error was reported (`Some`), or just a lint (`None`).
153 pub reported: Option<ErrorReported>,
154 /// A list of spans of arguments provided that were not valid.
155 pub invalid_args: Vec<Span>,
158 /// Decorates the result of a generic argument count mismatch
159 /// check with whether explicit late bounds were provided.
161 pub struct GenericArgCountResult {
162 pub explicit_late_bound: ExplicitLateBound,
163 pub correct: Result<(), GenericArgCountMismatch>,
166 impl<'o, 'tcx> dyn AstConv<'tcx> + 'o {
167 pub fn ast_region_to_region(
169 lifetime: &hir::Lifetime,
170 def: Option<&ty::GenericParamDef>,
171 ) -> ty::Region<'tcx> {
172 let tcx = self.tcx();
173 let lifetime_name = |def_id| tcx.hir().name(tcx.hir().as_local_hir_id(def_id));
175 let r = match tcx.named_region(lifetime.hir_id) {
176 Some(rl::Region::Static) => tcx.lifetimes.re_static,
178 Some(rl::Region::LateBound(debruijn, id, _)) => {
179 let name = lifetime_name(id.expect_local());
180 tcx.mk_region(ty::ReLateBound(debruijn, ty::BrNamed(id, name)))
183 Some(rl::Region::LateBoundAnon(debruijn, index)) => {
184 tcx.mk_region(ty::ReLateBound(debruijn, ty::BrAnon(index)))
187 Some(rl::Region::EarlyBound(index, id, _)) => {
188 let name = lifetime_name(id.expect_local());
189 tcx.mk_region(ty::ReEarlyBound(ty::EarlyBoundRegion { def_id: id, index, name }))
192 Some(rl::Region::Free(scope, id)) => {
193 let name = lifetime_name(id.expect_local());
194 tcx.mk_region(ty::ReFree(ty::FreeRegion {
196 bound_region: ty::BrNamed(id, name),
199 // (*) -- not late-bound, won't change
203 self.re_infer(def, lifetime.span).unwrap_or_else(|| {
204 // This indicates an illegal lifetime
205 // elision. `resolve_lifetime` should have
206 // reported an error in this case -- but if
207 // not, let's error out.
208 tcx.sess.delay_span_bug(lifetime.span, "unelided lifetime in signature");
210 // Supply some dummy value. We don't have an
211 // `re_error`, annoyingly, so use `'static`.
212 tcx.lifetimes.re_static
217 debug!("ast_region_to_region(lifetime={:?}) yields {:?}", lifetime, r);
222 /// Given a path `path` that refers to an item `I` with the declared generics `decl_generics`,
223 /// returns an appropriate set of substitutions for this particular reference to `I`.
224 pub fn ast_path_substs_for_ty(
228 item_segment: &hir::PathSegment<'_>,
229 ) -> SubstsRef<'tcx> {
230 let (substs, assoc_bindings, _) = self.create_substs_for_ast_path(
234 item_segment.generic_args(),
235 item_segment.infer_args,
239 if let Some(b) = assoc_bindings.first() {
240 Self::prohibit_assoc_ty_binding(self.tcx(), b.span);
246 /// Report error if there is an explicit type parameter when using `impl Trait`.
249 seg: &hir::PathSegment<'_>,
250 generics: &ty::Generics,
252 let explicit = !seg.infer_args;
253 let impl_trait = generics.params.iter().any(|param| match param.kind {
254 ty::GenericParamDefKind::Type {
255 synthetic: Some(hir::SyntheticTyParamKind::ImplTrait),
261 if explicit && impl_trait {
266 .filter_map(|arg| match arg {
267 GenericArg::Type(_) => Some(arg.span()),
270 .collect::<Vec<_>>();
272 let mut err = struct_span_err! {
276 "cannot provide explicit generic arguments when `impl Trait` is \
277 used in argument position"
281 err.span_label(span, "explicit generic argument not allowed");
290 /// Checks that the correct number of generic arguments have been provided.
291 /// Used specifically for function calls.
292 pub fn check_generic_arg_count_for_call(
296 seg: &hir::PathSegment<'_>,
297 is_method_call: bool,
298 ) -> GenericArgCountResult {
299 let empty_args = hir::GenericArgs::none();
300 let suppress_mismatch = Self::check_impl_trait(tcx, seg, &def);
301 Self::check_generic_arg_count(
305 if let Some(ref args) = seg.args { args } else { &empty_args },
306 if is_method_call { GenericArgPosition::MethodCall } else { GenericArgPosition::Value },
307 def.parent.is_none() && def.has_self, // `has_self`
308 seg.infer_args || suppress_mismatch, // `infer_args`
312 /// Checks that the correct number of generic arguments have been provided.
313 /// This is used both for datatypes and function calls.
314 fn check_generic_arg_count(
318 args: &hir::GenericArgs<'_>,
319 position: GenericArgPosition,
322 ) -> GenericArgCountResult {
323 // At this stage we are guaranteed that the generic arguments are in the correct order, e.g.
324 // that lifetimes will proceed types. So it suffices to check the number of each generic
325 // arguments in order to validate them with respect to the generic parameters.
326 let param_counts = def.own_counts();
327 let arg_counts = args.own_counts();
328 let infer_lifetimes = position != GenericArgPosition::Type && arg_counts.lifetimes == 0;
330 let mut defaults: ty::GenericParamCount = Default::default();
331 for param in &def.params {
333 GenericParamDefKind::Lifetime => {}
334 GenericParamDefKind::Type { has_default, .. } => {
335 defaults.types += has_default as usize
337 GenericParamDefKind::Const => {
338 // FIXME(const_generics:defaults)
343 if position != GenericArgPosition::Type && !args.bindings.is_empty() {
344 AstConv::prohibit_assoc_ty_binding(tcx, args.bindings[0].span);
347 let explicit_late_bound =
348 Self::prohibit_explicit_late_bound_lifetimes(tcx, def, args, position);
350 let check_kind_count = |kind,
355 unexpected_spans: &mut Vec<Span>,
358 "check_kind_count: kind: {} required: {} permitted: {} provided: {} offset: {}",
359 kind, required, permitted, provided, offset
361 // We enforce the following: `required` <= `provided` <= `permitted`.
362 // For kinds without defaults (e.g.., lifetimes), `required == permitted`.
363 // For other kinds (i.e., types), `permitted` may be greater than `required`.
364 if required <= provided && provided <= permitted {
372 // Unfortunately lifetime and type parameter mismatches are typically styled
373 // differently in diagnostics, which means we have a few cases to consider here.
374 let (bound, quantifier) = if required != permitted {
375 if provided < required {
376 (required, "at least ")
378 // provided > permitted
379 (permitted, "at most ")
385 let (spans, label) = if required == permitted && provided > permitted {
386 // In the case when the user has provided too many arguments,
387 // we want to point to the unexpected arguments.
388 let spans: Vec<Span> = args.args[offset + permitted..offset + provided]
390 .map(|arg| arg.span())
392 unexpected_spans.extend(spans.clone());
393 (spans, format!("unexpected {} argument", kind))
398 "expected {}{} {} argument{}",
407 let mut err = tcx.sess.struct_span_err_with_code(
410 "wrong number of {} arguments: expected {}{}, found {}",
411 kind, quantifier, bound, provided,
413 DiagnosticId::Error("E0107".into()),
416 err.span_label(span, label.as_str());
423 let mut arg_count_correct = Ok(());
424 let mut unexpected_spans = vec![];
426 if !infer_lifetimes || arg_counts.lifetimes > param_counts.lifetimes {
427 arg_count_correct = check_kind_count(
429 param_counts.lifetimes,
430 param_counts.lifetimes,
431 arg_counts.lifetimes,
433 &mut unexpected_spans,
434 explicit_late_bound == ExplicitLateBound::Yes,
436 .and(arg_count_correct);
438 // FIXME(const_generics:defaults)
439 if !infer_args || arg_counts.consts > param_counts.consts {
440 arg_count_correct = check_kind_count(
445 arg_counts.lifetimes + arg_counts.types,
446 &mut unexpected_spans,
449 .and(arg_count_correct);
451 // Note that type errors are currently be emitted *after* const errors.
452 if !infer_args || arg_counts.types > param_counts.types - defaults.types - has_self as usize
454 arg_count_correct = check_kind_count(
456 param_counts.types - defaults.types - has_self as usize,
457 param_counts.types - has_self as usize,
459 arg_counts.lifetimes,
460 &mut unexpected_spans,
463 .and(arg_count_correct);
466 GenericArgCountResult {
468 correct: arg_count_correct.map_err(|reported_err| GenericArgCountMismatch {
469 reported: if reported_err { Some(ErrorReported) } else { None },
470 invalid_args: unexpected_spans,
475 /// Report an error that a generic argument did not match the generic parameter that was
477 fn generic_arg_mismatch_err(
479 arg: &GenericArg<'_>,
483 let mut err = struct_span_err!(
487 "{} provided when a {} was expected",
492 let kind_ord = match kind {
493 "lifetime" => ParamKindOrd::Lifetime,
494 "type" => ParamKindOrd::Type,
495 "constant" => ParamKindOrd::Const,
496 // It's more concise to match on the string representation, though it means
497 // the match is non-exhaustive.
498 _ => bug!("invalid generic parameter kind {}", kind),
500 let arg_ord = match arg {
501 GenericArg::Lifetime(_) => ParamKindOrd::Lifetime,
502 GenericArg::Type(_) => ParamKindOrd::Type,
503 GenericArg::Const(_) => ParamKindOrd::Const,
506 // This note will be true as long as generic parameters are strictly ordered by their kind.
508 if kind_ord < arg_ord { (kind, arg.descr()) } else { (arg.descr(), kind) };
509 err.note(&format!("{} arguments must be provided before {} arguments", first, last));
511 if let Some(help) = help {
517 /// Creates the relevant generic argument substitutions
518 /// corresponding to a set of generic parameters. This is a
519 /// rather complex function. Let us try to explain the role
520 /// of each of its parameters:
522 /// To start, we are given the `def_id` of the thing we are
523 /// creating the substitutions for, and a partial set of
524 /// substitutions `parent_substs`. In general, the substitutions
525 /// for an item begin with substitutions for all the "parents" of
526 /// that item -- e.g., for a method it might include the
527 /// parameters from the impl.
529 /// Therefore, the method begins by walking down these parents,
530 /// starting with the outermost parent and proceed inwards until
531 /// it reaches `def_id`. For each parent `P`, it will check `parent_substs`
532 /// first to see if the parent's substitutions are listed in there. If so,
533 /// we can append those and move on. Otherwise, it invokes the
534 /// three callback functions:
536 /// - `args_for_def_id`: given the `DefId` `P`, supplies back the
537 /// generic arguments that were given to that parent from within
538 /// the path; so e.g., if you have `<T as Foo>::Bar`, the `DefId`
539 /// might refer to the trait `Foo`, and the arguments might be
540 /// `[T]`. The boolean value indicates whether to infer values
541 /// for arguments whose values were not explicitly provided.
542 /// - `provided_kind`: given the generic parameter and the value from `args_for_def_id`,
543 /// instantiate a `GenericArg`.
544 /// - `inferred_kind`: if no parameter was provided, and inference is enabled, then
545 /// creates a suitable inference variable.
546 pub fn create_substs_for_generic_args<'b>(
549 parent_substs: &[subst::GenericArg<'tcx>],
551 self_ty: Option<Ty<'tcx>>,
552 arg_count: GenericArgCountResult,
553 args_for_def_id: impl Fn(DefId) -> (Option<&'b GenericArgs<'b>>, bool),
554 mut provided_kind: impl FnMut(&GenericParamDef, &GenericArg<'_>) -> subst::GenericArg<'tcx>,
555 mut inferred_kind: impl FnMut(
556 Option<&[subst::GenericArg<'tcx>]>,
559 ) -> subst::GenericArg<'tcx>,
560 ) -> SubstsRef<'tcx> {
561 // Collect the segments of the path; we need to substitute arguments
562 // for parameters throughout the entire path (wherever there are
563 // generic parameters).
564 let mut parent_defs = tcx.generics_of(def_id);
565 let count = parent_defs.count();
566 let mut stack = vec![(def_id, parent_defs)];
567 while let Some(def_id) = parent_defs.parent {
568 parent_defs = tcx.generics_of(def_id);
569 stack.push((def_id, parent_defs));
572 // We manually build up the substitution, rather than using convenience
573 // methods in `subst.rs`, so that we can iterate over the arguments and
574 // parameters in lock-step linearly, instead of trying to match each pair.
575 let mut substs: SmallVec<[subst::GenericArg<'tcx>; 8]> = SmallVec::with_capacity(count);
576 // Iterate over each segment of the path.
577 while let Some((def_id, defs)) = stack.pop() {
578 let mut params = defs.params.iter().peekable();
580 // If we have already computed substitutions for parents, we can use those directly.
581 while let Some(¶m) = params.peek() {
582 if let Some(&kind) = parent_substs.get(param.index as usize) {
590 // `Self` is handled first, unless it's been handled in `parent_substs`.
592 if let Some(¶m) = params.peek() {
593 if param.index == 0 {
594 if let GenericParamDefKind::Type { .. } = param.kind {
598 .unwrap_or_else(|| inferred_kind(None, param, true)),
606 // Check whether this segment takes generic arguments and the user has provided any.
607 let (generic_args, infer_args) = args_for_def_id(def_id);
610 generic_args.iter().flat_map(|generic_args| generic_args.args.iter()).peekable();
612 // If we encounter a type or const when we expect a lifetime, we infer the lifetimes.
613 // If we later encounter a lifetime, we know that the arguments were provided in the
614 // wrong order. `force_infer_lt` records the type or const that forced lifetimes to be
615 // inferred, so we can use it for diagnostics later.
616 let mut force_infer_lt = None;
619 // We're going to iterate through the generic arguments that the user
620 // provided, matching them with the generic parameters we expect.
621 // Mismatches can occur as a result of elided lifetimes, or for malformed
622 // input. We try to handle both sensibly.
623 match (args.peek(), params.peek()) {
624 (Some(&arg), Some(¶m)) => {
625 match (arg, ¶m.kind, arg_count.explicit_late_bound) {
626 (GenericArg::Lifetime(_), GenericParamDefKind::Lifetime, _)
627 | (GenericArg::Type(_), GenericParamDefKind::Type { .. }, _)
628 | (GenericArg::Const(_), GenericParamDefKind::Const, _) => {
629 substs.push(provided_kind(param, arg));
634 GenericArg::Type(_) | GenericArg::Const(_),
635 GenericParamDefKind::Lifetime,
638 // We expected a lifetime argument, but got a type or const
639 // argument. That means we're inferring the lifetimes.
640 substs.push(inferred_kind(None, param, infer_args));
641 force_infer_lt = Some(arg);
644 (GenericArg::Lifetime(_), _, ExplicitLateBound::Yes) => {
645 // We've come across a lifetime when we expected something else in
646 // the presence of explicit late bounds. This is most likely
647 // due to the presence of the explicit bound so we're just going to
652 // We expected one kind of parameter, but the user provided
653 // another. This is an error. However, if we already know that
654 // the arguments don't match up with the parameters, we won't issue
655 // an additional error, as the user already knows what's wrong.
656 if arg_count.correct.is_ok()
657 && arg_count.explicit_late_bound == ExplicitLateBound::No
659 // We're going to iterate over the parameters to sort them out, and
660 // show that order to the user as a possible order for the parameters
661 let mut param_types_present = defs
668 GenericParamDefKind::Lifetime => {
669 ParamKindOrd::Lifetime
671 GenericParamDefKind::Type { .. } => {
674 GenericParamDefKind::Const => {
681 .collect::<Vec<(ParamKindOrd, GenericParamDef)>>();
682 param_types_present.sort_by_key(|(ord, _)| *ord);
683 let (mut param_types_present, ordered_params): (
685 Vec<GenericParamDef>,
686 ) = param_types_present.into_iter().unzip();
687 param_types_present.dedup();
689 Self::generic_arg_mismatch_err(
694 "reorder the arguments: {}: `<{}>`",
697 .map(|ord| format!("{}s", ord.to_string()))
698 .collect::<Vec<String>>()
702 .filter_map(|param| {
703 if param.name == kw::SelfUpper {
706 Some(param.name.to_string())
709 .collect::<Vec<String>>()
715 // We've reported the error, but we want to make sure that this
716 // problem doesn't bubble down and create additional, irrelevant
717 // errors. In this case, we're simply going to ignore the argument
718 // and any following arguments. The rest of the parameters will be
720 while args.next().is_some() {}
725 (Some(&arg), None) => {
726 // We should never be able to reach this point with well-formed input.
727 // There are three situations in which we can encounter this issue.
729 // 1. The number of arguments is incorrect. In this case, an error
730 // will already have been emitted, and we can ignore it.
731 // 2. There are late-bound lifetime parameters present, yet the
732 // lifetime arguments have also been explicitly specified by the
734 // 3. We've inferred some lifetimes, which have been provided later (i.e.
735 // after a type or const). We want to throw an error in this case.
737 if arg_count.correct.is_ok()
738 && arg_count.explicit_late_bound == ExplicitLateBound::No
740 let kind = arg.descr();
741 assert_eq!(kind, "lifetime");
743 force_infer_lt.expect("lifetimes ought to have been inferred");
744 Self::generic_arg_mismatch_err(tcx.sess, provided, kind, None);
750 (None, Some(¶m)) => {
751 // If there are fewer arguments than parameters, it means
752 // we're inferring the remaining arguments.
753 substs.push(inferred_kind(Some(&substs), param, infer_args));
757 (None, None) => break,
762 tcx.intern_substs(&substs)
765 /// Given the type/lifetime/const arguments provided to some path (along with
766 /// an implicit `Self`, if this is a trait reference), returns the complete
767 /// set of substitutions. This may involve applying defaulted type parameters.
768 /// Also returns back constraints on associated types.
773 /// T: std::ops::Index<usize, Output = u32>
774 /// ^1 ^^^^^^^^^^^^^^2 ^^^^3 ^^^^^^^^^^^4
777 /// 1. The `self_ty` here would refer to the type `T`.
778 /// 2. The path in question is the path to the trait `std::ops::Index`,
779 /// which will have been resolved to a `def_id`
780 /// 3. The `generic_args` contains info on the `<...>` contents. The `usize` type
781 /// parameters are returned in the `SubstsRef`, the associated type bindings like
782 /// `Output = u32` are returned in the `Vec<ConvertedBinding...>` result.
784 /// Note that the type listing given here is *exactly* what the user provided.
786 /// For (generic) associated types
789 /// <Vec<u8> as Iterable<u8>>::Iter::<'a>
792 /// We have the parent substs are the substs for the parent trait:
793 /// `[Vec<u8>, u8]` and `generic_args` are the arguments for the associated
794 /// type itself: `['a]`. The returned `SubstsRef` concatenates these two
795 /// lists: `[Vec<u8>, u8, 'a]`.
796 fn create_substs_for_ast_path<'a>(
800 parent_substs: &[subst::GenericArg<'tcx>],
801 generic_args: &'a hir::GenericArgs<'_>,
803 self_ty: Option<Ty<'tcx>>,
804 ) -> (SubstsRef<'tcx>, Vec<ConvertedBinding<'a, 'tcx>>, GenericArgCountResult) {
805 // If the type is parameterized by this region, then replace this
806 // region with the current anon region binding (in other words,
807 // whatever & would get replaced with).
809 "create_substs_for_ast_path(def_id={:?}, self_ty={:?}, \
811 def_id, self_ty, generic_args
814 let tcx = self.tcx();
815 let generic_params = tcx.generics_of(def_id);
817 if generic_params.has_self {
818 if generic_params.parent.is_some() {
819 // The parent is a trait so it should have at least one subst
820 // for the `Self` type.
821 assert!(!parent_substs.is_empty())
823 // This item (presumably a trait) needs a self-type.
824 assert!(self_ty.is_some());
827 assert!(self_ty.is_none() && parent_substs.is_empty());
830 let arg_count = Self::check_generic_arg_count(
835 GenericArgPosition::Type,
840 let is_object = self_ty.map_or(false, |ty| ty == self.tcx().types.trait_object_dummy_self);
841 let default_needs_object_self = |param: &ty::GenericParamDef| {
842 if let GenericParamDefKind::Type { has_default, .. } = param.kind {
843 if is_object && has_default {
844 let default_ty = tcx.at(span).type_of(param.def_id);
845 let self_param = tcx.types.self_param;
846 if default_ty.walk().any(|arg| arg == self_param.into()) {
847 // There is no suitable inference default for a type parameter
848 // that references self, in an object type.
857 let mut missing_type_params = vec![];
858 let mut inferred_params = vec![];
859 let substs = Self::create_substs_for_generic_args(
866 // Provide the generic args, and whether types should be inferred.
869 (Some(generic_args), infer_args)
871 // The last component of this tuple is unimportant.
875 // Provide substitutions for parameters for which (valid) arguments have been provided.
876 |param, arg| match (¶m.kind, arg) {
877 (GenericParamDefKind::Lifetime, GenericArg::Lifetime(lt)) => {
878 self.ast_region_to_region(<, Some(param)).into()
880 (GenericParamDefKind::Type { .. }, GenericArg::Type(ty)) => {
881 if let (hir::TyKind::Infer, false) = (&ty.kind, self.allow_ty_infer()) {
882 inferred_params.push(ty.span);
883 tcx.ty_error().into()
885 self.ast_ty_to_ty(&ty).into()
888 (GenericParamDefKind::Const, GenericArg::Const(ct)) => {
889 ty::Const::const_arg_from_anon_const(
892 did: tcx.hir().local_def_id(ct.value.hir_id),
893 param_did: Some(param.def_id),
900 // Provide substitutions for parameters for which arguments are inferred.
901 |substs, param, infer_args| {
903 GenericParamDefKind::Lifetime => tcx.lifetimes.re_static.into(),
904 GenericParamDefKind::Type { has_default, .. } => {
905 if !infer_args && has_default {
906 // No type parameter provided, but a default exists.
908 // If we are converting an object type, then the
909 // `Self` parameter is unknown. However, some of the
910 // other type parameters may reference `Self` in their
911 // defaults. This will lead to an ICE if we are not
913 if default_needs_object_self(param) {
914 missing_type_params.push(param.name.to_string());
915 tcx.ty_error().into()
917 // This is a default type parameter.
920 tcx.at(span).type_of(param.def_id).subst_spanned(
928 } else if infer_args {
929 // No type parameters were provided, we can infer all.
931 if !default_needs_object_self(param) { Some(param) } else { None };
932 self.ty_infer(param, span).into()
934 // We've already errored above about the mismatch.
935 tcx.ty_error().into()
938 GenericParamDefKind::Const => {
939 let ty = tcx.at(span).type_of(param.def_id);
940 // FIXME(const_generics:defaults)
942 // No const parameters were provided, we can infer all.
943 self.ct_infer(ty, Some(param), span).into()
945 // We've already errored above about the mismatch.
946 tcx.const_error(ty).into()
953 self.complain_about_missing_type_params(
957 generic_args.args.is_empty(),
960 // Convert associated-type bindings or constraints into a separate vector.
961 // Example: Given this:
963 // T: Iterator<Item = u32>
965 // The `T` is passed in as a self-type; the `Item = u32` is
966 // not a "type parameter" of the `Iterator` trait, but rather
967 // a restriction on `<T as Iterator>::Item`, so it is passed
969 let assoc_bindings = generic_args
973 let kind = match binding.kind {
974 hir::TypeBindingKind::Equality { ref ty } => {
975 ConvertedBindingKind::Equality(self.ast_ty_to_ty(ty))
977 hir::TypeBindingKind::Constraint { ref bounds } => {
978 ConvertedBindingKind::Constraint(bounds)
981 ConvertedBinding { item_name: binding.ident, kind, span: binding.span }
986 "create_substs_for_ast_path(generic_params={:?}, self_ty={:?}) -> {:?}",
987 generic_params, self_ty, substs
990 (substs, assoc_bindings, arg_count)
993 crate fn create_substs_for_associated_item(
998 item_segment: &hir::PathSegment<'_>,
999 parent_substs: SubstsRef<'tcx>,
1000 ) -> SubstsRef<'tcx> {
1001 if tcx.generics_of(item_def_id).params.is_empty() {
1002 self.prohibit_generics(slice::from_ref(item_segment));
1006 self.create_substs_for_ast_path(
1010 item_segment.generic_args(),
1011 item_segment.infer_args,
1018 /// On missing type parameters, emit an E0393 error and provide a structured suggestion using
1019 /// the type parameter's name as a placeholder.
1020 fn complain_about_missing_type_params(
1022 missing_type_params: Vec<String>,
1025 empty_generic_args: bool,
1027 if missing_type_params.is_empty() {
1031 missing_type_params.iter().map(|n| format!("`{}`", n)).collect::<Vec<_>>().join(", ");
1032 let mut err = struct_span_err!(
1036 "the type parameter{} {} must be explicitly specified",
1037 pluralize!(missing_type_params.len()),
1041 self.tcx().def_span(def_id),
1043 "type parameter{} {} must be specified for this",
1044 pluralize!(missing_type_params.len()),
1048 let mut suggested = false;
1049 if let (Ok(snippet), true) = (
1050 self.tcx().sess.source_map().span_to_snippet(span),
1051 // Don't suggest setting the type params if there are some already: the order is
1052 // tricky to get right and the user will already know what the syntax is.
1055 if snippet.ends_with('>') {
1056 // The user wrote `Trait<'a, T>` or similar. To provide an accurate suggestion
1057 // we would have to preserve the right order. For now, as clearly the user is
1058 // aware of the syntax, we do nothing.
1060 // The user wrote `Iterator`, so we don't have a type we can suggest, but at
1061 // least we can clue them to the correct syntax `Iterator<Type>`.
1062 err.span_suggestion(
1065 "set the type parameter{plural} to the desired type{plural}",
1066 plural = pluralize!(missing_type_params.len()),
1068 format!("{}<{}>", snippet, missing_type_params.join(", ")),
1069 Applicability::HasPlaceholders,
1078 "missing reference{} to {}",
1079 pluralize!(missing_type_params.len()),
1085 "because of the default `Self` reference, type parameters must be \
1086 specified on object types",
1091 /// Instantiates the path for the given trait reference, assuming that it's
1092 /// bound to a valid trait type. Returns the `DefId` of the defining trait.
1093 /// The type _cannot_ be a type other than a trait type.
1095 /// If the `projections` argument is `None`, then assoc type bindings like `Foo<T = X>`
1096 /// are disallowed. Otherwise, they are pushed onto the vector given.
1097 pub fn instantiate_mono_trait_ref(
1099 trait_ref: &hir::TraitRef<'_>,
1101 ) -> ty::TraitRef<'tcx> {
1102 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
1104 self.ast_path_to_mono_trait_ref(
1105 trait_ref.path.span,
1106 trait_ref.trait_def_id().unwrap_or_else(|| FatalError.raise()),
1108 trait_ref.path.segments.last().unwrap(),
1112 /// The given trait-ref must actually be a trait.
1113 pub(super) fn instantiate_poly_trait_ref_inner(
1115 trait_ref: &hir::TraitRef<'_>,
1117 constness: Constness,
1119 bounds: &mut Bounds<'tcx>,
1121 ) -> GenericArgCountResult {
1122 let trait_def_id = trait_ref.trait_def_id().unwrap_or_else(|| FatalError.raise());
1124 debug!("instantiate_poly_trait_ref({:?}, def_id={:?})", trait_ref, trait_def_id);
1126 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
1128 let (substs, assoc_bindings, arg_count) = self.create_substs_for_ast_trait_ref(
1129 trait_ref.path.span,
1132 trait_ref.path.segments.last().unwrap(),
1134 let poly_trait_ref = ty::Binder::bind(ty::TraitRef::new(trait_def_id, substs));
1136 bounds.trait_bounds.push((poly_trait_ref, span, constness));
1138 let mut dup_bindings = FxHashMap::default();
1139 for binding in &assoc_bindings {
1140 // Specify type to assert that error was already reported in `Err` case.
1141 let _: Result<_, ErrorReported> = self.add_predicates_for_ast_type_binding(
1142 trait_ref.hir_ref_id,
1150 // Okay to ignore `Err` because of `ErrorReported` (see above).
1154 "instantiate_poly_trait_ref({:?}, bounds={:?}) -> {:?}",
1155 trait_ref, bounds, poly_trait_ref
1161 /// Given a trait bound like `Debug`, applies that trait bound the given self-type to construct
1162 /// a full trait reference. The resulting trait reference is returned. This may also generate
1163 /// auxiliary bounds, which are added to `bounds`.
1168 /// poly_trait_ref = Iterator<Item = u32>
1172 /// this would return `Foo: Iterator` and add `<Foo as Iterator>::Item = u32` into `bounds`.
1174 /// **A note on binders:** against our usual convention, there is an implied bounder around
1175 /// the `self_ty` and `poly_trait_ref` parameters here. So they may reference bound regions.
1176 /// If for example you had `for<'a> Foo<'a>: Bar<'a>`, then the `self_ty` would be `Foo<'a>`
1177 /// where `'a` is a bound region at depth 0. Similarly, the `poly_trait_ref` would be
1178 /// `Bar<'a>`. The returned poly-trait-ref will have this binder instantiated explicitly,
1180 pub fn instantiate_poly_trait_ref(
1182 poly_trait_ref: &hir::PolyTraitRef<'_>,
1183 constness: Constness,
1185 bounds: &mut Bounds<'tcx>,
1186 ) -> GenericArgCountResult {
1187 self.instantiate_poly_trait_ref_inner(
1188 &poly_trait_ref.trait_ref,
1189 poly_trait_ref.span,
1197 fn ast_path_to_mono_trait_ref(
1200 trait_def_id: DefId,
1202 trait_segment: &hir::PathSegment<'_>,
1203 ) -> ty::TraitRef<'tcx> {
1204 let (substs, assoc_bindings, _) =
1205 self.create_substs_for_ast_trait_ref(span, trait_def_id, self_ty, trait_segment);
1206 if let Some(b) = assoc_bindings.first() {
1207 AstConv::prohibit_assoc_ty_binding(self.tcx(), b.span);
1209 ty::TraitRef::new(trait_def_id, substs)
1212 /// When the code is using the `Fn` traits directly, instead of the `Fn(A) -> B` syntax, emit
1213 /// an error and attempt to build a reasonable structured suggestion.
1214 fn complain_about_internal_fn_trait(
1217 trait_def_id: DefId,
1218 trait_segment: &'a hir::PathSegment<'a>,
1220 let trait_def = self.tcx().trait_def(trait_def_id);
1222 if !self.tcx().features().unboxed_closures
1223 && trait_segment.generic_args().parenthesized != trait_def.paren_sugar
1225 let sess = &self.tcx().sess.parse_sess;
1226 // For now, require that parenthetical notation be used only with `Fn()` etc.
1227 let (msg, sugg) = if trait_def.paren_sugar {
1229 "the precise format of `Fn`-family traits' type parameters is subject to \
1233 trait_segment.ident,
1237 .and_then(|args| args.args.get(0))
1238 .and_then(|arg| match arg {
1239 hir::GenericArg::Type(ty) => match ty.kind {
1240 hir::TyKind::Tup(t) => t
1242 .map(|e| sess.source_map().span_to_snippet(e.span))
1243 .collect::<Result<Vec<_>, _>>()
1244 .map(|a| a.join(", ")),
1245 _ => sess.source_map().span_to_snippet(ty.span),
1247 .map(|s| format!("({})", s))
1251 .unwrap_or_else(|| "()".to_string()),
1256 .find_map(|b| match (b.ident.name == sym::Output, &b.kind) {
1257 (true, hir::TypeBindingKind::Equality { ty }) => {
1258 sess.source_map().span_to_snippet(ty.span).ok()
1262 .unwrap_or_else(|| "()".to_string()),
1266 ("parenthetical notation is only stable when used with `Fn`-family traits", None)
1268 let mut err = feature_err(sess, sym::unboxed_closures, span, msg);
1269 if let Some(sugg) = sugg {
1270 let msg = "use parenthetical notation instead";
1271 err.span_suggestion(span, msg, sugg, Applicability::MaybeIncorrect);
1277 fn create_substs_for_ast_trait_ref<'a>(
1280 trait_def_id: DefId,
1282 trait_segment: &'a hir::PathSegment<'a>,
1283 ) -> (SubstsRef<'tcx>, Vec<ConvertedBinding<'a, 'tcx>>, GenericArgCountResult) {
1284 debug!("create_substs_for_ast_trait_ref(trait_segment={:?})", trait_segment);
1286 self.complain_about_internal_fn_trait(span, trait_def_id, trait_segment);
1288 self.create_substs_for_ast_path(
1292 trait_segment.generic_args(),
1293 trait_segment.infer_args,
1298 fn trait_defines_associated_type_named(&self, trait_def_id: DefId, assoc_name: Ident) -> bool {
1300 .associated_items(trait_def_id)
1301 .find_by_name_and_kind(self.tcx(), assoc_name, ty::AssocKind::Type, trait_def_id)
1305 // Returns `true` if a bounds list includes `?Sized`.
1306 pub fn is_unsized(&self, ast_bounds: &[hir::GenericBound<'_>], span: Span) -> bool {
1307 let tcx = self.tcx();
1309 // Try to find an unbound in bounds.
1310 let mut unbound = None;
1311 for ab in ast_bounds {
1312 if let &hir::GenericBound::Trait(ref ptr, hir::TraitBoundModifier::Maybe) = ab {
1313 if unbound.is_none() {
1314 unbound = Some(&ptr.trait_ref);
1320 "type parameter has more than one relaxed default \
1321 bound, only one is supported"
1328 let kind_id = tcx.lang_items().require(SizedTraitLangItem);
1331 // FIXME(#8559) currently requires the unbound to be built-in.
1332 if let Ok(kind_id) = kind_id {
1333 if tpb.path.res != Res::Def(DefKind::Trait, kind_id) {
1336 "default bound relaxed for a type parameter, but \
1337 this does nothing because the given bound is not \
1338 a default; only `?Sized` is supported",
1343 _ if kind_id.is_ok() => {
1346 // No lang item for `Sized`, so we can't add it as a bound.
1353 /// This helper takes a *converted* parameter type (`param_ty`)
1354 /// and an *unconverted* list of bounds:
1357 /// fn foo<T: Debug>
1358 /// ^ ^^^^^ `ast_bounds` parameter, in HIR form
1360 /// `param_ty`, in ty form
1363 /// It adds these `ast_bounds` into the `bounds` structure.
1365 /// **A note on binders:** there is an implied binder around
1366 /// `param_ty` and `ast_bounds`. See `instantiate_poly_trait_ref`
1367 /// for more details.
1371 ast_bounds: &[hir::GenericBound<'_>],
1372 bounds: &mut Bounds<'tcx>,
1374 let mut trait_bounds = Vec::new();
1375 let mut region_bounds = Vec::new();
1377 let constness = self.default_constness_for_trait_bounds();
1378 for ast_bound in ast_bounds {
1380 hir::GenericBound::Trait(ref b, hir::TraitBoundModifier::None) => {
1381 trait_bounds.push((b, constness))
1383 hir::GenericBound::Trait(ref b, hir::TraitBoundModifier::MaybeConst) => {
1384 trait_bounds.push((b, Constness::NotConst))
1386 hir::GenericBound::Trait(_, hir::TraitBoundModifier::Maybe) => {}
1387 hir::GenericBound::Outlives(ref l) => region_bounds.push(l),
1391 for (bound, constness) in trait_bounds {
1392 let _ = self.instantiate_poly_trait_ref(bound, constness, param_ty, bounds);
1395 bounds.region_bounds.extend(
1396 region_bounds.into_iter().map(|r| (self.ast_region_to_region(r, None), r.span)),
1400 /// Translates a list of bounds from the HIR into the `Bounds` data structure.
1401 /// The self-type for the bounds is given by `param_ty`.
1406 /// fn foo<T: Bar + Baz>() { }
1407 /// ^ ^^^^^^^^^ ast_bounds
1411 /// The `sized_by_default` parameter indicates if, in this context, the `param_ty` should be
1412 /// considered `Sized` unless there is an explicit `?Sized` bound. This would be true in the
1413 /// example above, but is not true in supertrait listings like `trait Foo: Bar + Baz`.
1415 /// `span` should be the declaration size of the parameter.
1416 pub fn compute_bounds(
1419 ast_bounds: &[hir::GenericBound<'_>],
1420 sized_by_default: SizedByDefault,
1423 let mut bounds = Bounds::default();
1425 self.add_bounds(param_ty, ast_bounds, &mut bounds);
1426 bounds.trait_bounds.sort_by_key(|(t, _, _)| t.def_id());
1428 bounds.implicitly_sized = if let SizedByDefault::Yes = sized_by_default {
1429 if !self.is_unsized(ast_bounds, span) { Some(span) } else { None }
1437 /// Given an HIR binding like `Item = Foo` or `Item: Foo`, pushes the corresponding predicates
1440 /// **A note on binders:** given something like `T: for<'a> Iterator<Item = &'a u32>`, the
1441 /// `trait_ref` here will be `for<'a> T: Iterator`. The `binding` data however is from *inside*
1442 /// the binder (e.g., `&'a u32`) and hence may reference bound regions.
1443 fn add_predicates_for_ast_type_binding(
1445 hir_ref_id: hir::HirId,
1446 trait_ref: ty::PolyTraitRef<'tcx>,
1447 binding: &ConvertedBinding<'_, 'tcx>,
1448 bounds: &mut Bounds<'tcx>,
1450 dup_bindings: &mut FxHashMap<DefId, Span>,
1452 ) -> Result<(), ErrorReported> {
1453 let tcx = self.tcx();
1456 // Given something like `U: SomeTrait<T = X>`, we want to produce a
1457 // predicate like `<U as SomeTrait>::T = X`. This is somewhat
1458 // subtle in the event that `T` is defined in a supertrait of
1459 // `SomeTrait`, because in that case we need to upcast.
1461 // That is, consider this case:
1464 // trait SubTrait: SuperTrait<i32> { }
1465 // trait SuperTrait<A> { type T; }
1467 // ... B: SubTrait<T = foo> ...
1470 // We want to produce `<B as SuperTrait<i32>>::T == foo`.
1472 // Find any late-bound regions declared in `ty` that are not
1473 // declared in the trait-ref. These are not well-formed.
1477 // for<'a> <T as Iterator>::Item = &'a str // <-- 'a is bad
1478 // for<'a> <T as FnMut<(&'a u32,)>>::Output = &'a str // <-- 'a is ok
1479 if let ConvertedBindingKind::Equality(ty) = binding.kind {
1480 let late_bound_in_trait_ref =
1481 tcx.collect_constrained_late_bound_regions(&trait_ref);
1482 let late_bound_in_ty =
1483 tcx.collect_referenced_late_bound_regions(&ty::Binder::bind(ty));
1484 debug!("late_bound_in_trait_ref = {:?}", late_bound_in_trait_ref);
1485 debug!("late_bound_in_ty = {:?}", late_bound_in_ty);
1486 for br in late_bound_in_ty.difference(&late_bound_in_trait_ref) {
1487 let br_name = match *br {
1488 ty::BrNamed(_, name) => name,
1492 "anonymous bound region {:?} in binding but not trait ref",
1497 // FIXME: point at the type params that don't have appropriate lifetimes:
1498 // struct S1<F: for<'a> Fn(&i32, &i32) -> &'a i32>(F);
1499 // ---- ---- ^^^^^^^
1504 "binding for associated type `{}` references lifetime `{}`, \
1505 which does not appear in the trait input types",
1515 if self.trait_defines_associated_type_named(trait_ref.def_id(), binding.item_name) {
1516 // Simple case: X is defined in the current trait.
1519 // Otherwise, we have to walk through the supertraits to find
1521 self.one_bound_for_assoc_type(
1522 || traits::supertraits(tcx, trait_ref),
1523 || trait_ref.print_only_trait_path().to_string(),
1526 || match binding.kind {
1527 ConvertedBindingKind::Equality(ty) => Some(ty.to_string()),
1533 let (assoc_ident, def_scope) =
1534 tcx.adjust_ident_and_get_scope(binding.item_name, candidate.def_id(), hir_ref_id);
1536 // We have already adjusted the item name above, so compare with `ident.normalize_to_macros_2_0()` instead
1537 // of calling `filter_by_name_and_kind`.
1539 .associated_items(candidate.def_id())
1540 .filter_by_name_unhygienic(assoc_ident.name)
1542 i.kind == ty::AssocKind::Type && i.ident.normalize_to_macros_2_0() == assoc_ident
1544 .expect("missing associated type");
1546 if !assoc_ty.vis.is_accessible_from(def_scope, tcx) {
1550 &format!("associated type `{}` is private", binding.item_name),
1552 .span_label(binding.span, "private associated type")
1555 tcx.check_stability(assoc_ty.def_id, Some(hir_ref_id), binding.span);
1559 .entry(assoc_ty.def_id)
1560 .and_modify(|prev_span| {
1565 "the value of the associated type `{}` (from trait `{}`) \
1566 is already specified",
1568 tcx.def_path_str(assoc_ty.container.id())
1570 .span_label(binding.span, "re-bound here")
1571 .span_label(*prev_span, format!("`{}` bound here first", binding.item_name))
1574 .or_insert(binding.span);
1577 match binding.kind {
1578 ConvertedBindingKind::Equality(ref ty) => {
1579 // "Desugar" a constraint like `T: Iterator<Item = u32>` this to
1580 // the "projection predicate" for:
1582 // `<T as Iterator>::Item = u32`
1583 bounds.projection_bounds.push((
1584 candidate.map_bound(|trait_ref| ty::ProjectionPredicate {
1585 projection_ty: ty::ProjectionTy::from_ref_and_name(
1595 ConvertedBindingKind::Constraint(ast_bounds) => {
1596 // "Desugar" a constraint like `T: Iterator<Item: Debug>` to
1598 // `<T as Iterator>::Item: Debug`
1600 // Calling `skip_binder` is okay, because `add_bounds` expects the `param_ty`
1601 // parameter to have a skipped binder.
1602 let param_ty = tcx.mk_projection(assoc_ty.def_id, candidate.skip_binder().substs);
1603 self.add_bounds(param_ty, ast_bounds, bounds);
1613 item_segment: &hir::PathSegment<'_>,
1615 let substs = self.ast_path_substs_for_ty(span, did, item_segment);
1616 self.normalize_ty(span, self.tcx().at(span).type_of(did).subst(self.tcx(), substs))
1619 fn conv_object_ty_poly_trait_ref(
1622 trait_bounds: &[hir::PolyTraitRef<'_>],
1623 lifetime: &hir::Lifetime,
1625 let tcx = self.tcx();
1627 let mut bounds = Bounds::default();
1628 let mut potential_assoc_types = Vec::new();
1629 let dummy_self = self.tcx().types.trait_object_dummy_self;
1630 for trait_bound in trait_bounds.iter().rev() {
1631 if let GenericArgCountResult {
1633 Err(GenericArgCountMismatch { invalid_args: cur_potential_assoc_types, .. }),
1635 } = self.instantiate_poly_trait_ref(
1637 Constness::NotConst,
1641 potential_assoc_types.extend(cur_potential_assoc_types.into_iter());
1645 // Expand trait aliases recursively and check that only one regular (non-auto) trait
1646 // is used and no 'maybe' bounds are used.
1647 let expanded_traits =
1648 traits::expand_trait_aliases(tcx, bounds.trait_bounds.iter().map(|&(a, b, _)| (a, b)));
1649 let (mut auto_traits, regular_traits): (Vec<_>, Vec<_>) =
1650 expanded_traits.partition(|i| tcx.trait_is_auto(i.trait_ref().def_id()));
1651 if regular_traits.len() > 1 {
1652 let first_trait = ®ular_traits[0];
1653 let additional_trait = ®ular_traits[1];
1654 let mut err = struct_span_err!(
1656 additional_trait.bottom().1,
1658 "only auto traits can be used as additional traits in a trait object"
1660 additional_trait.label_with_exp_info(
1662 "additional non-auto trait",
1665 first_trait.label_with_exp_info(&mut err, "first non-auto trait", "first use");
1669 if regular_traits.is_empty() && auto_traits.is_empty() {
1674 "at least one trait is required for an object type"
1677 return tcx.ty_error();
1680 // Check that there are no gross object safety violations;
1681 // most importantly, that the supertraits don't contain `Self`,
1683 for item in ®ular_traits {
1684 let object_safety_violations =
1685 astconv_object_safety_violations(tcx, item.trait_ref().def_id());
1686 if !object_safety_violations.is_empty() {
1687 report_object_safety_error(
1690 item.trait_ref().def_id(),
1691 &object_safety_violations[..],
1694 return tcx.ty_error();
1698 // Use a `BTreeSet` to keep output in a more consistent order.
1699 let mut associated_types: FxHashMap<Span, BTreeSet<DefId>> = FxHashMap::default();
1701 let regular_traits_refs_spans = bounds
1704 .filter(|(trait_ref, _, _)| !tcx.trait_is_auto(trait_ref.def_id()));
1706 for (base_trait_ref, span, constness) in regular_traits_refs_spans {
1707 assert_eq!(constness, Constness::NotConst);
1709 for obligation in traits::elaborate_trait_ref(tcx, base_trait_ref) {
1711 "conv_object_ty_poly_trait_ref: observing object predicate `{:?}`",
1712 obligation.predicate
1714 match obligation.predicate.kind() {
1715 ty::PredicateKind::Trait(pred, _) => {
1716 associated_types.entry(span).or_default().extend(
1717 tcx.associated_items(pred.def_id())
1718 .in_definition_order()
1719 .filter(|item| item.kind == ty::AssocKind::Type)
1720 .map(|item| item.def_id),
1723 &ty::PredicateKind::Projection(pred) => {
1724 // A `Self` within the original bound will be substituted with a
1725 // `trait_object_dummy_self`, so check for that.
1726 let references_self =
1727 pred.skip_binder().ty.walk().any(|arg| arg == dummy_self.into());
1729 // If the projection output contains `Self`, force the user to
1730 // elaborate it explicitly to avoid a lot of complexity.
1732 // The "classicaly useful" case is the following:
1734 // trait MyTrait: FnMut() -> <Self as MyTrait>::MyOutput {
1739 // Here, the user could theoretically write `dyn MyTrait<Output = X>`,
1740 // but actually supporting that would "expand" to an infinitely-long type
1741 // `fix $ τ → dyn MyTrait<MyOutput = X, Output = <τ as MyTrait>::MyOutput`.
1743 // Instead, we force the user to write
1744 // `dyn MyTrait<MyOutput = X, Output = X>`, which is uglier but works. See
1745 // the discussion in #56288 for alternatives.
1746 if !references_self {
1747 // Include projections defined on supertraits.
1748 bounds.projection_bounds.push((pred, span));
1756 for (projection_bound, _) in &bounds.projection_bounds {
1757 for def_ids in associated_types.values_mut() {
1758 def_ids.remove(&projection_bound.projection_def_id());
1762 self.complain_about_missing_associated_types(
1764 potential_assoc_types,
1768 // De-duplicate auto traits so that, e.g., `dyn Trait + Send + Send` is the same as
1769 // `dyn Trait + Send`.
1770 auto_traits.sort_by_key(|i| i.trait_ref().def_id());
1771 auto_traits.dedup_by_key(|i| i.trait_ref().def_id());
1772 debug!("regular_traits: {:?}", regular_traits);
1773 debug!("auto_traits: {:?}", auto_traits);
1775 // Transform a `PolyTraitRef` into a `PolyExistentialTraitRef` by
1776 // removing the dummy `Self` type (`trait_object_dummy_self`).
1777 let trait_ref_to_existential = |trait_ref: ty::TraitRef<'tcx>| {
1778 if trait_ref.self_ty() != dummy_self {
1779 // FIXME: There appears to be a missing filter on top of `expand_trait_aliases`,
1780 // which picks up non-supertraits where clauses - but also, the object safety
1781 // completely ignores trait aliases, which could be object safety hazards. We
1782 // `delay_span_bug` here to avoid an ICE in stable even when the feature is
1783 // disabled. (#66420)
1784 tcx.sess.delay_span_bug(
1787 "trait_ref_to_existential called on {:?} with non-dummy Self",
1792 ty::ExistentialTraitRef::erase_self_ty(tcx, trait_ref)
1795 // Erase the `dummy_self` (`trait_object_dummy_self`) used above.
1796 let existential_trait_refs =
1797 regular_traits.iter().map(|i| i.trait_ref().map_bound(trait_ref_to_existential));
1798 let existential_projections = bounds.projection_bounds.iter().map(|(bound, _)| {
1799 bound.map_bound(|b| {
1800 let trait_ref = trait_ref_to_existential(b.projection_ty.trait_ref(tcx));
1801 ty::ExistentialProjection {
1803 item_def_id: b.projection_ty.item_def_id,
1804 substs: trait_ref.substs,
1809 // Calling `skip_binder` is okay because the predicates are re-bound.
1810 let regular_trait_predicates = existential_trait_refs
1811 .map(|trait_ref| ty::ExistentialPredicate::Trait(trait_ref.skip_binder()));
1812 let auto_trait_predicates = auto_traits
1814 .map(|trait_ref| ty::ExistentialPredicate::AutoTrait(trait_ref.trait_ref().def_id()));
1815 let mut v = regular_trait_predicates
1816 .chain(auto_trait_predicates)
1818 existential_projections
1819 .map(|x| ty::ExistentialPredicate::Projection(x.skip_binder())),
1821 .collect::<SmallVec<[_; 8]>>();
1822 v.sort_by(|a, b| a.stable_cmp(tcx, b));
1824 let existential_predicates = ty::Binder::bind(tcx.mk_existential_predicates(v.into_iter()));
1826 // Use explicitly-specified region bound.
1827 let region_bound = if !lifetime.is_elided() {
1828 self.ast_region_to_region(lifetime, None)
1830 self.compute_object_lifetime_bound(span, existential_predicates).unwrap_or_else(|| {
1831 if tcx.named_region(lifetime.hir_id).is_some() {
1832 self.ast_region_to_region(lifetime, None)
1834 self.re_infer(None, span).unwrap_or_else(|| {
1835 // FIXME: these can be redundant with E0106, but not always.
1840 "the lifetime bound for this object type cannot be deduced \
1841 from context; please supply an explicit bound"
1844 tcx.lifetimes.re_static
1849 debug!("region_bound: {:?}", region_bound);
1851 let ty = tcx.mk_dynamic(existential_predicates, region_bound);
1852 debug!("trait_object_type: {:?}", ty);
1856 /// When there are any missing associated types, emit an E0191 error and attempt to supply a
1857 /// reasonable suggestion on how to write it. For the case of multiple associated types in the
1858 /// same trait bound have the same name (as they come from different super-traits), we instead
1859 /// emit a generic note suggesting using a `where` clause to constraint instead.
1860 fn complain_about_missing_associated_types(
1862 associated_types: FxHashMap<Span, BTreeSet<DefId>>,
1863 potential_assoc_types: Vec<Span>,
1864 trait_bounds: &[hir::PolyTraitRef<'_>],
1866 if associated_types.values().all(|v| v.is_empty()) {
1869 let tcx = self.tcx();
1870 // FIXME: Marked `mut` so that we can replace the spans further below with a more
1871 // appropriate one, but this should be handled earlier in the span assignment.
1872 let mut associated_types: FxHashMap<Span, Vec<_>> = associated_types
1874 .map(|(span, def_ids)| {
1875 (span, def_ids.into_iter().map(|did| tcx.associated_item(did)).collect())
1878 let mut names = vec![];
1880 // Account for things like `dyn Foo + 'a`, like in tests `issue-22434.rs` and
1881 // `issue-22560.rs`.
1882 let mut trait_bound_spans: Vec<Span> = vec![];
1883 for (span, items) in &associated_types {
1884 if !items.is_empty() {
1885 trait_bound_spans.push(*span);
1887 for assoc_item in items {
1888 let trait_def_id = assoc_item.container.id();
1890 "`{}` (from trait `{}`)",
1892 tcx.def_path_str(trait_def_id),
1896 if let ([], [bound]) = (&potential_assoc_types[..], &trait_bounds) {
1897 match &bound.trait_ref.path.segments[..] {
1898 // FIXME: `trait_ref.path.span` can point to a full path with multiple
1899 // segments, even though `trait_ref.path.segments` is of length `1`. Work
1900 // around that bug here, even though it should be fixed elsewhere.
1901 // This would otherwise cause an invalid suggestion. For an example, look at
1902 // `src/test/ui/issues/issue-28344.rs` where instead of the following:
1904 // error[E0191]: the value of the associated type `Output`
1905 // (from trait `std::ops::BitXor`) must be specified
1906 // --> $DIR/issue-28344.rs:4:17
1908 // LL | let x: u8 = BitXor::bitor(0 as u8, 0 as u8);
1909 // | ^^^^^^ help: specify the associated type:
1910 // | `BitXor<Output = Type>`
1914 // error[E0191]: the value of the associated type `Output`
1915 // (from trait `std::ops::BitXor`) must be specified
1916 // --> $DIR/issue-28344.rs:4:17
1918 // LL | let x: u8 = BitXor::bitor(0 as u8, 0 as u8);
1919 // | ^^^^^^^^^^^^^ help: specify the associated type:
1920 // | `BitXor::bitor<Output = Type>`
1921 [segment] if segment.args.is_none() => {
1922 trait_bound_spans = vec![segment.ident.span];
1923 associated_types = associated_types
1925 .map(|(_, items)| (segment.ident.span, items))
1932 trait_bound_spans.sort();
1933 let mut err = struct_span_err!(
1937 "the value of the associated type{} {} must be specified",
1938 pluralize!(names.len()),
1941 let mut suggestions = vec![];
1942 let mut types_count = 0;
1943 let mut where_constraints = vec![];
1944 for (span, assoc_items) in &associated_types {
1945 let mut names: FxHashMap<_, usize> = FxHashMap::default();
1946 for item in assoc_items {
1948 *names.entry(item.ident.name).or_insert(0) += 1;
1950 let mut dupes = false;
1951 for item in assoc_items {
1952 let prefix = if names[&item.ident.name] > 1 {
1953 let trait_def_id = item.container.id();
1955 format!("{}::", tcx.def_path_str(trait_def_id))
1959 if let Some(sp) = tcx.hir().span_if_local(item.def_id) {
1960 err.span_label(sp, format!("`{}{}` defined here", prefix, item.ident));
1963 if potential_assoc_types.len() == assoc_items.len() {
1964 // Only suggest when the amount of missing associated types equals the number of
1965 // extra type arguments present, as that gives us a relatively high confidence
1966 // that the user forgot to give the associtated type's name. The canonical
1967 // example would be trying to use `Iterator<isize>` instead of
1968 // `Iterator<Item = isize>`.
1969 for (potential, item) in potential_assoc_types.iter().zip(assoc_items.iter()) {
1970 if let Ok(snippet) = tcx.sess.source_map().span_to_snippet(*potential) {
1971 suggestions.push((*potential, format!("{} = {}", item.ident, snippet)));
1974 } else if let (Ok(snippet), false) =
1975 (tcx.sess.source_map().span_to_snippet(*span), dupes)
1978 assoc_items.iter().map(|item| format!("{} = Type", item.ident)).collect();
1979 let code = if snippet.ends_with('>') {
1980 // The user wrote `Trait<'a>` or similar and we don't have a type we can
1981 // suggest, but at least we can clue them to the correct syntax
1982 // `Trait<'a, Item = Type>` while accounting for the `<'a>` in the
1984 format!("{}, {}>", &snippet[..snippet.len() - 1], types.join(", "))
1986 // The user wrote `Iterator`, so we don't have a type we can suggest, but at
1987 // least we can clue them to the correct syntax `Iterator<Item = Type>`.
1988 format!("{}<{}>", snippet, types.join(", "))
1990 suggestions.push((*span, code));
1992 where_constraints.push(*span);
1995 let where_msg = "consider introducing a new type parameter, adding `where` constraints \
1996 using the fully-qualified path to the associated types";
1997 if !where_constraints.is_empty() && suggestions.is_empty() {
1998 // If there are duplicates associated type names and a single trait bound do not
1999 // use structured suggestion, it means that there are multiple super-traits with
2000 // the same associated type name.
2001 err.help(where_msg);
2003 if suggestions.len() != 1 {
2004 // We don't need this label if there's an inline suggestion, show otherwise.
2005 for (span, assoc_items) in &associated_types {
2006 let mut names: FxHashMap<_, usize> = FxHashMap::default();
2007 for item in assoc_items {
2009 *names.entry(item.ident.name).or_insert(0) += 1;
2011 let mut label = vec![];
2012 for item in assoc_items {
2013 let postfix = if names[&item.ident.name] > 1 {
2014 let trait_def_id = item.container.id();
2015 format!(" (from trait `{}`)", tcx.def_path_str(trait_def_id))
2019 label.push(format!("`{}`{}", item.ident, postfix));
2021 if !label.is_empty() {
2025 "associated type{} {} must be specified",
2026 pluralize!(label.len()),
2033 if !suggestions.is_empty() {
2034 err.multipart_suggestion(
2035 &format!("specify the associated type{}", pluralize!(types_count)),
2037 Applicability::HasPlaceholders,
2039 if !where_constraints.is_empty() {
2040 err.span_help(where_constraints, where_msg);
2046 fn report_ambiguous_associated_type(
2053 let mut err = struct_span_err!(self.tcx().sess, span, E0223, "ambiguous associated type");
2054 if let (Some(_), Ok(snippet)) = (
2055 self.tcx().sess.confused_type_with_std_module.borrow().get(&span),
2056 self.tcx().sess.source_map().span_to_snippet(span),
2058 err.span_suggestion(
2060 "you are looking for the module in `std`, not the primitive type",
2061 format!("std::{}", snippet),
2062 Applicability::MachineApplicable,
2065 err.span_suggestion(
2067 "use fully-qualified syntax",
2068 format!("<{} as {}>::{}", type_str, trait_str, name),
2069 Applicability::HasPlaceholders,
2075 // Search for a bound on a type parameter which includes the associated item
2076 // given by `assoc_name`. `ty_param_def_id` is the `DefId` of the type parameter
2077 // This function will fail if there are no suitable bounds or there is
2079 fn find_bound_for_assoc_item(
2081 ty_param_def_id: LocalDefId,
2084 ) -> Result<ty::PolyTraitRef<'tcx>, ErrorReported> {
2085 let tcx = self.tcx();
2088 "find_bound_for_assoc_item(ty_param_def_id={:?}, assoc_name={:?}, span={:?})",
2089 ty_param_def_id, assoc_name, span,
2093 &self.get_type_parameter_bounds(span, ty_param_def_id.to_def_id()).predicates;
2095 debug!("find_bound_for_assoc_item: predicates={:#?}", predicates);
2097 let param_hir_id = tcx.hir().as_local_hir_id(ty_param_def_id);
2098 let param_name = tcx.hir().ty_param_name(param_hir_id);
2099 self.one_bound_for_assoc_type(
2101 traits::transitive_bounds(
2103 predicates.iter().filter_map(|(p, _)| p.to_opt_poly_trait_ref()),
2106 || param_name.to_string(),
2113 // Checks that `bounds` contains exactly one element and reports appropriate
2114 // errors otherwise.
2115 fn one_bound_for_assoc_type<I>(
2117 all_candidates: impl Fn() -> I,
2118 ty_param_name: impl Fn() -> String,
2121 is_equality: impl Fn() -> Option<String>,
2122 ) -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
2124 I: Iterator<Item = ty::PolyTraitRef<'tcx>>,
2126 let mut matching_candidates = all_candidates()
2127 .filter(|r| self.trait_defines_associated_type_named(r.def_id(), assoc_name));
2129 let bound = match matching_candidates.next() {
2130 Some(bound) => bound,
2132 self.complain_about_assoc_type_not_found(
2138 return Err(ErrorReported);
2142 debug!("one_bound_for_assoc_type: bound = {:?}", bound);
2144 if let Some(bound2) = matching_candidates.next() {
2145 debug!("one_bound_for_assoc_type: bound2 = {:?}", bound2);
2147 let is_equality = is_equality();
2148 let bounds = iter::once(bound).chain(iter::once(bound2)).chain(matching_candidates);
2149 let mut err = if is_equality.is_some() {
2150 // More specific Error Index entry.
2155 "ambiguous associated type `{}` in bounds of `{}`",
2164 "ambiguous associated type `{}` in bounds of `{}`",
2169 err.span_label(span, format!("ambiguous associated type `{}`", assoc_name));
2171 let mut where_bounds = vec![];
2172 for bound in bounds {
2173 let bound_id = bound.def_id();
2174 let bound_span = self
2176 .associated_items(bound_id)
2177 .find_by_name_and_kind(self.tcx(), assoc_name, ty::AssocKind::Type, bound_id)
2178 .and_then(|item| self.tcx().hir().span_if_local(item.def_id));
2180 if let Some(bound_span) = bound_span {
2184 "ambiguous `{}` from `{}`",
2186 bound.print_only_trait_path(),
2189 if let Some(constraint) = &is_equality {
2190 where_bounds.push(format!(
2191 " T: {trait}::{assoc} = {constraint}",
2192 trait=bound.print_only_trait_path(),
2194 constraint=constraint,
2197 err.span_suggestion(
2199 "use fully qualified syntax to disambiguate",
2203 bound.print_only_trait_path(),
2206 Applicability::MaybeIncorrect,
2211 "associated type `{}` could derive from `{}`",
2213 bound.print_only_trait_path(),
2217 if !where_bounds.is_empty() {
2219 "consider introducing a new type parameter `T` and adding `where` constraints:\
2220 \n where\n T: {},\n{}",
2222 where_bounds.join(",\n"),
2226 if !where_bounds.is_empty() {
2227 return Err(ErrorReported);
2233 fn complain_about_assoc_type_not_found<I>(
2235 all_candidates: impl Fn() -> I,
2236 ty_param_name: &str,
2240 I: Iterator<Item = ty::PolyTraitRef<'tcx>>,
2242 // The fallback span is needed because `assoc_name` might be an `Fn()`'s `Output` without a
2243 // valid span, so we point at the whole path segment instead.
2244 let span = if assoc_name.span != DUMMY_SP { assoc_name.span } else { span };
2245 let mut err = struct_span_err!(
2249 "associated type `{}` not found for `{}`",
2254 let all_candidate_names: Vec<_> = all_candidates()
2255 .map(|r| self.tcx().associated_items(r.def_id()).in_definition_order())
2258 |item| if item.kind == ty::AssocKind::Type { Some(item.ident.name) } else { None },
2262 if let (Some(suggested_name), true) = (
2263 find_best_match_for_name(all_candidate_names.iter(), assoc_name.name, None),
2264 assoc_name.span != DUMMY_SP,
2266 err.span_suggestion(
2268 "there is an associated type with a similar name",
2269 suggested_name.to_string(),
2270 Applicability::MaybeIncorrect,
2273 err.span_label(span, format!("associated type `{}` not found", assoc_name));
2279 // Create a type from a path to an associated type.
2280 // For a path `A::B::C::D`, `qself_ty` and `qself_def` are the type and def for `A::B::C`
2281 // and item_segment is the path segment for `D`. We return a type and a def for
2283 // Will fail except for `T::A` and `Self::A`; i.e., if `qself_ty`/`qself_def` are not a type
2284 // parameter or `Self`.
2285 pub fn associated_path_to_ty(
2287 hir_ref_id: hir::HirId,
2291 assoc_segment: &hir::PathSegment<'_>,
2292 permit_variants: bool,
2293 ) -> Result<(Ty<'tcx>, DefKind, DefId), ErrorReported> {
2294 let tcx = self.tcx();
2295 let assoc_ident = assoc_segment.ident;
2297 debug!("associated_path_to_ty: {:?}::{}", qself_ty, assoc_ident);
2299 // Check if we have an enum variant.
2300 let mut variant_resolution = None;
2301 if let ty::Adt(adt_def, _) = qself_ty.kind {
2302 if adt_def.is_enum() {
2303 let variant_def = adt_def
2306 .find(|vd| tcx.hygienic_eq(assoc_ident, vd.ident, adt_def.did));
2307 if let Some(variant_def) = variant_def {
2308 if permit_variants {
2309 tcx.check_stability(variant_def.def_id, Some(hir_ref_id), span);
2310 self.prohibit_generics(slice::from_ref(assoc_segment));
2311 return Ok((qself_ty, DefKind::Variant, variant_def.def_id));
2313 variant_resolution = Some(variant_def.def_id);
2319 // Find the type of the associated item, and the trait where the associated
2320 // item is declared.
2321 let bound = match (&qself_ty.kind, qself_res) {
2322 (_, Res::SelfTy(Some(_), Some(impl_def_id))) => {
2323 // `Self` in an impl of a trait -- we have a concrete self type and a
2325 let trait_ref = match tcx.impl_trait_ref(impl_def_id) {
2326 Some(trait_ref) => trait_ref,
2328 // A cycle error occurred, most likely.
2329 return Err(ErrorReported);
2333 self.one_bound_for_assoc_type(
2334 || traits::supertraits(tcx, ty::Binder::bind(trait_ref)),
2335 || "Self".to_string(),
2343 Res::SelfTy(Some(param_did), None) | Res::Def(DefKind::TyParam, param_did),
2344 ) => self.find_bound_for_assoc_item(param_did.expect_local(), assoc_ident, span)?,
2346 if variant_resolution.is_some() {
2347 // Variant in type position
2348 let msg = format!("expected type, found variant `{}`", assoc_ident);
2349 tcx.sess.span_err(span, &msg);
2350 } else if qself_ty.is_enum() {
2351 let mut err = struct_span_err!(
2355 "no variant named `{}` found for enum `{}`",
2360 let adt_def = qself_ty.ty_adt_def().expect("enum is not an ADT");
2361 if let Some(suggested_name) = find_best_match_for_name(
2362 adt_def.variants.iter().map(|variant| &variant.ident.name),
2366 err.span_suggestion(
2368 "there is a variant with a similar name",
2369 suggested_name.to_string(),
2370 Applicability::MaybeIncorrect,
2375 format!("variant not found in `{}`", qself_ty),
2379 if let Some(sp) = tcx.hir().span_if_local(adt_def.did) {
2380 let sp = tcx.sess.source_map().guess_head_span(sp);
2381 err.span_label(sp, format!("variant `{}` not found here", assoc_ident));
2385 } else if !qself_ty.references_error() {
2386 // Don't print `TyErr` to the user.
2387 self.report_ambiguous_associated_type(
2389 &qself_ty.to_string(),
2394 return Err(ErrorReported);
2398 let trait_did = bound.def_id();
2399 let (assoc_ident, def_scope) =
2400 tcx.adjust_ident_and_get_scope(assoc_ident, trait_did, hir_ref_id);
2402 // We have already adjusted the item name above, so compare with `ident.normalize_to_macros_2_0()` instead
2403 // of calling `filter_by_name_and_kind`.
2405 .associated_items(trait_did)
2406 .in_definition_order()
2408 i.kind.namespace() == Namespace::TypeNS
2409 && i.ident.normalize_to_macros_2_0() == assoc_ident
2411 .expect("missing associated type");
2413 let ty = self.projected_ty_from_poly_trait_ref(span, item.def_id, assoc_segment, bound);
2414 let ty = self.normalize_ty(span, ty);
2416 let kind = DefKind::AssocTy;
2417 if !item.vis.is_accessible_from(def_scope, tcx) {
2418 let kind = kind.descr(item.def_id);
2419 let msg = format!("{} `{}` is private", kind, assoc_ident);
2421 .struct_span_err(span, &msg)
2422 .span_label(span, &format!("private {}", kind))
2425 tcx.check_stability(item.def_id, Some(hir_ref_id), span);
2427 if let Some(variant_def_id) = variant_resolution {
2428 tcx.struct_span_lint_hir(AMBIGUOUS_ASSOCIATED_ITEMS, hir_ref_id, span, |lint| {
2429 let mut err = lint.build("ambiguous associated item");
2430 let mut could_refer_to = |kind: DefKind, def_id, also| {
2431 let note_msg = format!(
2432 "`{}` could{} refer to the {} defined here",
2437 err.span_note(tcx.def_span(def_id), ¬e_msg);
2440 could_refer_to(DefKind::Variant, variant_def_id, "");
2441 could_refer_to(kind, item.def_id, " also");
2443 err.span_suggestion(
2445 "use fully-qualified syntax",
2446 format!("<{} as {}>::{}", qself_ty, tcx.item_name(trait_did), assoc_ident),
2447 Applicability::MachineApplicable,
2453 Ok((ty, kind, item.def_id))
2459 opt_self_ty: Option<Ty<'tcx>>,
2461 trait_segment: &hir::PathSegment<'_>,
2462 item_segment: &hir::PathSegment<'_>,
2464 let tcx = self.tcx();
2466 let trait_def_id = tcx.parent(item_def_id).unwrap();
2468 debug!("qpath_to_ty: trait_def_id={:?}", trait_def_id);
2470 let self_ty = if let Some(ty) = opt_self_ty {
2473 let path_str = tcx.def_path_str(trait_def_id);
2475 let def_id = self.item_def_id();
2477 debug!("qpath_to_ty: self.item_def_id()={:?}", def_id);
2479 let parent_def_id = def_id
2480 .and_then(|def_id| {
2481 def_id.as_local().map(|def_id| tcx.hir().as_local_hir_id(def_id))
2483 .map(|hir_id| tcx.hir().get_parent_did(hir_id).to_def_id());
2485 debug!("qpath_to_ty: parent_def_id={:?}", parent_def_id);
2487 // If the trait in segment is the same as the trait defining the item,
2488 // use the `<Self as ..>` syntax in the error.
2489 let is_part_of_self_trait_constraints = def_id == Some(trait_def_id);
2490 let is_part_of_fn_in_self_trait = parent_def_id == Some(trait_def_id);
2492 let type_name = if is_part_of_self_trait_constraints || is_part_of_fn_in_self_trait {
2498 self.report_ambiguous_associated_type(
2502 item_segment.ident.name,
2504 return tcx.ty_error();
2507 debug!("qpath_to_ty: self_type={:?}", self_ty);
2509 let trait_ref = self.ast_path_to_mono_trait_ref(span, trait_def_id, self_ty, trait_segment);
2511 let item_substs = self.create_substs_for_associated_item(
2519 debug!("qpath_to_ty: trait_ref={:?}", trait_ref);
2521 self.normalize_ty(span, tcx.mk_projection(item_def_id, item_substs))
2524 pub fn prohibit_generics<'a, T: IntoIterator<Item = &'a hir::PathSegment<'a>>>(
2528 let mut has_err = false;
2529 for segment in segments {
2530 let (mut err_for_lt, mut err_for_ty, mut err_for_ct) = (false, false, false);
2531 for arg in segment.generic_args().args {
2532 let (span, kind) = match arg {
2533 hir::GenericArg::Lifetime(lt) => {
2539 (lt.span, "lifetime")
2541 hir::GenericArg::Type(ty) => {
2549 hir::GenericArg::Const(ct) => {
2558 let mut err = struct_span_err!(
2562 "{} arguments are not allowed for this type",
2565 err.span_label(span, format!("{} argument not allowed", kind));
2567 if err_for_lt && err_for_ty && err_for_ct {
2572 // Only emit the first error to avoid overloading the user with error messages.
2573 if let [binding, ..] = segment.generic_args().bindings {
2575 Self::prohibit_assoc_ty_binding(self.tcx(), binding.span);
2581 pub fn prohibit_assoc_ty_binding(tcx: TyCtxt<'_>, span: Span) {
2582 let mut err = struct_span_err!(
2586 "associated type bindings are not allowed here"
2588 err.span_label(span, "associated type not allowed here").emit();
2591 /// Prohibits explicit lifetime arguments if late-bound lifetime parameters
2592 /// are present. This is used both for datatypes and function calls.
2593 fn prohibit_explicit_late_bound_lifetimes(
2596 args: &hir::GenericArgs<'_>,
2597 position: GenericArgPosition,
2598 ) -> ExplicitLateBound {
2599 let param_counts = def.own_counts();
2600 let arg_counts = args.own_counts();
2601 let infer_lifetimes = position != GenericArgPosition::Type && arg_counts.lifetimes == 0;
2603 if infer_lifetimes {
2604 ExplicitLateBound::No
2605 } else if let Some(span_late) = def.has_late_bound_regions {
2606 let msg = "cannot specify lifetime arguments explicitly \
2607 if late bound lifetime parameters are present";
2608 let note = "the late bound lifetime parameter is introduced here";
2609 let span = args.args[0].span();
2610 if position == GenericArgPosition::Value
2611 && arg_counts.lifetimes != param_counts.lifetimes
2613 let mut err = tcx.sess.struct_span_err(span, msg);
2614 err.span_note(span_late, note);
2617 let mut multispan = MultiSpan::from_span(span);
2618 multispan.push_span_label(span_late, note.to_string());
2619 tcx.struct_span_lint_hir(
2620 LATE_BOUND_LIFETIME_ARGUMENTS,
2623 |lint| lint.build(msg).emit(),
2626 ExplicitLateBound::Yes
2628 ExplicitLateBound::No
2632 // FIXME(eddyb, varkor) handle type paths here too, not just value ones.
2633 pub fn def_ids_for_value_path_segments(
2635 segments: &[hir::PathSegment<'_>],
2636 self_ty: Option<Ty<'tcx>>,
2640 // We need to extract the type parameters supplied by the user in
2641 // the path `path`. Due to the current setup, this is a bit of a
2642 // tricky-process; the problem is that resolve only tells us the
2643 // end-point of the path resolution, and not the intermediate steps.
2644 // Luckily, we can (at least for now) deduce the intermediate steps
2645 // just from the end-point.
2647 // There are basically five cases to consider:
2649 // 1. Reference to a constructor of a struct:
2651 // struct Foo<T>(...)
2653 // In this case, the parameters are declared in the type space.
2655 // 2. Reference to a constructor of an enum variant:
2657 // enum E<T> { Foo(...) }
2659 // In this case, the parameters are defined in the type space,
2660 // but may be specified either on the type or the variant.
2662 // 3. Reference to a fn item or a free constant:
2666 // In this case, the path will again always have the form
2667 // `a::b::foo::<T>` where only the final segment should have
2668 // type parameters. However, in this case, those parameters are
2669 // declared on a value, and hence are in the `FnSpace`.
2671 // 4. Reference to a method or an associated constant:
2673 // impl<A> SomeStruct<A> {
2677 // Here we can have a path like
2678 // `a::b::SomeStruct::<A>::foo::<B>`, in which case parameters
2679 // may appear in two places. The penultimate segment,
2680 // `SomeStruct::<A>`, contains parameters in TypeSpace, and the
2681 // final segment, `foo::<B>` contains parameters in fn space.
2683 // The first step then is to categorize the segments appropriately.
2685 let tcx = self.tcx();
2687 assert!(!segments.is_empty());
2688 let last = segments.len() - 1;
2690 let mut path_segs = vec![];
2693 // Case 1. Reference to a struct constructor.
2694 DefKind::Ctor(CtorOf::Struct, ..) => {
2695 // Everything but the final segment should have no
2696 // parameters at all.
2697 let generics = tcx.generics_of(def_id);
2698 // Variant and struct constructors use the
2699 // generics of their parent type definition.
2700 let generics_def_id = generics.parent.unwrap_or(def_id);
2701 path_segs.push(PathSeg(generics_def_id, last));
2704 // Case 2. Reference to a variant constructor.
2705 DefKind::Ctor(CtorOf::Variant, ..) | DefKind::Variant => {
2706 let adt_def = self_ty.map(|t| t.ty_adt_def().unwrap());
2707 let (generics_def_id, index) = if let Some(adt_def) = adt_def {
2708 debug_assert!(adt_def.is_enum());
2710 } else if last >= 1 && segments[last - 1].args.is_some() {
2711 // Everything but the penultimate segment should have no
2712 // parameters at all.
2713 let mut def_id = def_id;
2715 // `DefKind::Ctor` -> `DefKind::Variant`
2716 if let DefKind::Ctor(..) = kind {
2717 def_id = tcx.parent(def_id).unwrap()
2720 // `DefKind::Variant` -> `DefKind::Enum`
2721 let enum_def_id = tcx.parent(def_id).unwrap();
2722 (enum_def_id, last - 1)
2724 // FIXME: lint here recommending `Enum::<...>::Variant` form
2725 // instead of `Enum::Variant::<...>` form.
2727 // Everything but the final segment should have no
2728 // parameters at all.
2729 let generics = tcx.generics_of(def_id);
2730 // Variant and struct constructors use the
2731 // generics of their parent type definition.
2732 (generics.parent.unwrap_or(def_id), last)
2734 path_segs.push(PathSeg(generics_def_id, index));
2737 // Case 3. Reference to a top-level value.
2738 DefKind::Fn | DefKind::Const | DefKind::ConstParam | DefKind::Static => {
2739 path_segs.push(PathSeg(def_id, last));
2742 // Case 4. Reference to a method or associated const.
2743 DefKind::AssocFn | DefKind::AssocConst => {
2744 if segments.len() >= 2 {
2745 let generics = tcx.generics_of(def_id);
2746 path_segs.push(PathSeg(generics.parent.unwrap(), last - 1));
2748 path_segs.push(PathSeg(def_id, last));
2751 kind => bug!("unexpected definition kind {:?} for {:?}", kind, def_id),
2754 debug!("path_segs = {:?}", path_segs);
2759 // Check a type `Path` and convert it to a `Ty`.
2762 opt_self_ty: Option<Ty<'tcx>>,
2763 path: &hir::Path<'_>,
2764 permit_variants: bool,
2766 let tcx = self.tcx();
2769 "res_to_ty(res={:?}, opt_self_ty={:?}, path_segments={:?})",
2770 path.res, opt_self_ty, path.segments
2773 let span = path.span;
2775 Res::Def(DefKind::OpaqueTy, did) => {
2776 // Check for desugared `impl Trait`.
2777 assert!(ty::is_impl_trait_defn(tcx, did).is_none());
2778 let item_segment = path.segments.split_last().unwrap();
2779 self.prohibit_generics(item_segment.1);
2780 let substs = self.ast_path_substs_for_ty(span, did, item_segment.0);
2781 self.normalize_ty(span, tcx.mk_opaque(did, substs))
2788 | DefKind::ForeignTy,
2791 assert_eq!(opt_self_ty, None);
2792 self.prohibit_generics(path.segments.split_last().unwrap().1);
2793 self.ast_path_to_ty(span, did, path.segments.last().unwrap())
2795 Res::Def(kind @ DefKind::Variant, def_id) if permit_variants => {
2796 // Convert "variant type" as if it were a real type.
2797 // The resulting `Ty` is type of the variant's enum for now.
2798 assert_eq!(opt_self_ty, None);
2801 self.def_ids_for_value_path_segments(&path.segments, None, kind, def_id);
2802 let generic_segs: FxHashSet<_> =
2803 path_segs.iter().map(|PathSeg(_, index)| index).collect();
2804 self.prohibit_generics(path.segments.iter().enumerate().filter_map(
2806 if !generic_segs.contains(&index) { Some(seg) } else { None }
2810 let PathSeg(def_id, index) = path_segs.last().unwrap();
2811 self.ast_path_to_ty(span, *def_id, &path.segments[*index])
2813 Res::Def(DefKind::TyParam, def_id) => {
2814 assert_eq!(opt_self_ty, None);
2815 self.prohibit_generics(path.segments);
2817 let hir_id = tcx.hir().as_local_hir_id(def_id.expect_local());
2818 let item_id = tcx.hir().get_parent_node(hir_id);
2819 let item_def_id = tcx.hir().local_def_id(item_id);
2820 let generics = tcx.generics_of(item_def_id);
2821 let index = generics.param_def_id_to_index[&def_id];
2822 tcx.mk_ty_param(index, tcx.hir().name(hir_id))
2824 Res::SelfTy(Some(_), None) => {
2825 // `Self` in trait or type alias.
2826 assert_eq!(opt_self_ty, None);
2827 self.prohibit_generics(path.segments);
2828 tcx.types.self_param
2830 Res::SelfTy(_, Some(def_id)) => {
2831 // `Self` in impl (we know the concrete type).
2832 assert_eq!(opt_self_ty, None);
2833 self.prohibit_generics(path.segments);
2834 // Try to evaluate any array length constants.
2835 self.normalize_ty(span, tcx.at(span).type_of(def_id))
2837 Res::Def(DefKind::AssocTy, def_id) => {
2838 debug_assert!(path.segments.len() >= 2);
2839 self.prohibit_generics(&path.segments[..path.segments.len() - 2]);
2844 &path.segments[path.segments.len() - 2],
2845 path.segments.last().unwrap(),
2848 Res::PrimTy(prim_ty) => {
2849 assert_eq!(opt_self_ty, None);
2850 self.prohibit_generics(path.segments);
2852 hir::PrimTy::Bool => tcx.types.bool,
2853 hir::PrimTy::Char => tcx.types.char,
2854 hir::PrimTy::Int(it) => tcx.mk_mach_int(it),
2855 hir::PrimTy::Uint(uit) => tcx.mk_mach_uint(uit),
2856 hir::PrimTy::Float(ft) => tcx.mk_mach_float(ft),
2857 hir::PrimTy::Str => tcx.types.str_,
2861 self.set_tainted_by_errors();
2862 self.tcx().ty_error()
2864 _ => span_bug!(span, "unexpected resolution: {:?}", path.res),
2868 /// Parses the programmer's textual representation of a type into our
2869 /// internal notion of a type.
2870 pub fn ast_ty_to_ty(&self, ast_ty: &hir::Ty<'_>) -> Ty<'tcx> {
2871 debug!("ast_ty_to_ty(id={:?}, ast_ty={:?} ty_ty={:?})", ast_ty.hir_id, ast_ty, ast_ty.kind);
2873 let tcx = self.tcx();
2875 let result_ty = match ast_ty.kind {
2876 hir::TyKind::Slice(ref ty) => tcx.mk_slice(self.ast_ty_to_ty(&ty)),
2877 hir::TyKind::Ptr(ref mt) => {
2878 tcx.mk_ptr(ty::TypeAndMut { ty: self.ast_ty_to_ty(&mt.ty), mutbl: mt.mutbl })
2880 hir::TyKind::Rptr(ref region, ref mt) => {
2881 let r = self.ast_region_to_region(region, None);
2882 debug!("ast_ty_to_ty: r={:?}", r);
2883 let t = self.ast_ty_to_ty(&mt.ty);
2884 tcx.mk_ref(r, ty::TypeAndMut { ty: t, mutbl: mt.mutbl })
2886 hir::TyKind::Never => tcx.types.never,
2887 hir::TyKind::Tup(ref fields) => {
2888 tcx.mk_tup(fields.iter().map(|t| self.ast_ty_to_ty(&t)))
2890 hir::TyKind::BareFn(ref bf) => {
2891 require_c_abi_if_c_variadic(tcx, &bf.decl, bf.abi, ast_ty.span);
2892 tcx.mk_fn_ptr(self.ty_of_fn(
2896 &hir::Generics::empty(),
2900 hir::TyKind::TraitObject(ref bounds, ref lifetime) => {
2901 self.conv_object_ty_poly_trait_ref(ast_ty.span, bounds, lifetime)
2903 hir::TyKind::Path(hir::QPath::Resolved(ref maybe_qself, ref path)) => {
2904 debug!("ast_ty_to_ty: maybe_qself={:?} path={:?}", maybe_qself, path);
2905 let opt_self_ty = maybe_qself.as_ref().map(|qself| self.ast_ty_to_ty(qself));
2906 self.res_to_ty(opt_self_ty, path, false)
2908 hir::TyKind::OpaqueDef(item_id, ref lifetimes) => {
2909 let opaque_ty = tcx.hir().expect_item(item_id.id);
2910 let def_id = tcx.hir().local_def_id(item_id.id).to_def_id();
2912 match opaque_ty.kind {
2913 hir::ItemKind::OpaqueTy(hir::OpaqueTy { impl_trait_fn, .. }) => {
2914 self.impl_trait_ty_to_ty(def_id, lifetimes, impl_trait_fn.is_some())
2916 ref i => bug!("`impl Trait` pointed to non-opaque type?? {:#?}", i),
2919 hir::TyKind::Path(hir::QPath::TypeRelative(ref qself, ref segment)) => {
2920 debug!("ast_ty_to_ty: qself={:?} segment={:?}", qself, segment);
2921 let ty = self.ast_ty_to_ty(qself);
2923 let res = if let hir::TyKind::Path(hir::QPath::Resolved(_, ref path)) = qself.kind {
2928 self.associated_path_to_ty(ast_ty.hir_id, ast_ty.span, ty, res, segment, false)
2929 .map(|(ty, _, _)| ty)
2930 .unwrap_or_else(|_| tcx.ty_error())
2932 hir::TyKind::Array(ref ty, ref length) => {
2933 let length_def_id = tcx.hir().local_def_id(length.hir_id);
2934 let length = ty::Const::from_anon_const(tcx, length_def_id);
2935 let array_ty = tcx.mk_ty(ty::Array(self.ast_ty_to_ty(&ty), length));
2936 self.normalize_ty(ast_ty.span, array_ty)
2938 hir::TyKind::Typeof(ref _e) => {
2943 "`typeof` is a reserved keyword but unimplemented"
2945 .span_label(ast_ty.span, "reserved keyword")
2950 hir::TyKind::Infer => {
2951 // Infer also appears as the type of arguments or return
2952 // values in a ExprKind::Closure, or as
2953 // the type of local variables. Both of these cases are
2954 // handled specially and will not descend into this routine.
2955 self.ty_infer(None, ast_ty.span)
2957 hir::TyKind::Err => tcx.ty_error(),
2960 debug!("ast_ty_to_ty: result_ty={:?}", result_ty);
2962 self.record_ty(ast_ty.hir_id, result_ty, ast_ty.span);
2966 pub fn impl_trait_ty_to_ty(
2969 lifetimes: &[hir::GenericArg<'_>],
2970 replace_parent_lifetimes: bool,
2972 debug!("impl_trait_ty_to_ty(def_id={:?}, lifetimes={:?})", def_id, lifetimes);
2973 let tcx = self.tcx();
2975 let generics = tcx.generics_of(def_id);
2977 debug!("impl_trait_ty_to_ty: generics={:?}", generics);
2978 let substs = InternalSubsts::for_item(tcx, def_id, |param, _| {
2979 if let Some(i) = (param.index as usize).checked_sub(generics.parent_count) {
2980 // Our own parameters are the resolved lifetimes.
2982 GenericParamDefKind::Lifetime => {
2983 if let hir::GenericArg::Lifetime(lifetime) = &lifetimes[i] {
2984 self.ast_region_to_region(lifetime, None).into()
2993 // For RPIT (return position impl trait), only lifetimes
2994 // mentioned in the impl Trait predicate are captured by
2995 // the opaque type, so the lifetime parameters from the
2996 // parent item need to be replaced with `'static`.
2998 // For `impl Trait` in the types of statics, constants,
2999 // locals and type aliases. These capture all parent
3000 // lifetimes, so they can use their identity subst.
3001 GenericParamDefKind::Lifetime if replace_parent_lifetimes => {
3002 tcx.lifetimes.re_static.into()
3004 _ => tcx.mk_param_from_def(param),
3008 debug!("impl_trait_ty_to_ty: substs={:?}", substs);
3010 let ty = tcx.mk_opaque(def_id, substs);
3011 debug!("impl_trait_ty_to_ty: {}", ty);
3015 pub fn ty_of_arg(&self, ty: &hir::Ty<'_>, expected_ty: Option<Ty<'tcx>>) -> Ty<'tcx> {
3017 hir::TyKind::Infer if expected_ty.is_some() => {
3018 self.record_ty(ty.hir_id, expected_ty.unwrap(), ty.span);
3019 expected_ty.unwrap()
3021 _ => self.ast_ty_to_ty(ty),
3027 unsafety: hir::Unsafety,
3029 decl: &hir::FnDecl<'_>,
3030 generics: &hir::Generics<'_>,
3031 ident_span: Option<Span>,
3032 ) -> ty::PolyFnSig<'tcx> {
3035 let tcx = self.tcx();
3037 // We proactively collect all the inferred type params to emit a single error per fn def.
3038 let mut visitor = PlaceholderHirTyCollector::default();
3039 for ty in decl.inputs {
3040 visitor.visit_ty(ty);
3042 walk_generics(&mut visitor, generics);
3044 let input_tys = decl.inputs.iter().map(|a| self.ty_of_arg(a, None));
3045 let output_ty = match decl.output {
3046 hir::FnRetTy::Return(ref output) => {
3047 visitor.visit_ty(output);
3048 self.ast_ty_to_ty(output)
3050 hir::FnRetTy::DefaultReturn(..) => tcx.mk_unit(),
3053 debug!("ty_of_fn: output_ty={:?}", output_ty);
3056 ty::Binder::bind(tcx.mk_fn_sig(input_tys, output_ty, decl.c_variadic, unsafety, abi));
3058 if !self.allow_ty_infer() {
3059 // We always collect the spans for placeholder types when evaluating `fn`s, but we
3060 // only want to emit an error complaining about them if infer types (`_`) are not
3061 // allowed. `allow_ty_infer` gates this behavior. We check for the presence of
3062 // `ident_span` to not emit an error twice when we have `fn foo(_: fn() -> _)`.
3063 crate::collect::placeholder_type_error(
3065 ident_span.map(|sp| sp.shrink_to_hi()),
3066 &generics.params[..],
3072 // Find any late-bound regions declared in return type that do
3073 // not appear in the arguments. These are not well-formed.
3076 // for<'a> fn() -> &'a str <-- 'a is bad
3077 // for<'a> fn(&'a String) -> &'a str <-- 'a is ok
3078 let inputs = bare_fn_ty.inputs();
3079 let late_bound_in_args =
3080 tcx.collect_constrained_late_bound_regions(&inputs.map_bound(|i| i.to_owned()));
3081 let output = bare_fn_ty.output();
3082 let late_bound_in_ret = tcx.collect_referenced_late_bound_regions(&output);
3083 for br in late_bound_in_ret.difference(&late_bound_in_args) {
3084 let lifetime_name = match *br {
3085 ty::BrNamed(_, name) => format!("lifetime `{}`,", name),
3086 ty::BrAnon(_) | ty::BrEnv => "an anonymous lifetime".to_string(),
3088 let mut err = struct_span_err!(
3092 "return type references {} which is not constrained by the fn input types",
3095 if let ty::BrAnon(_) = *br {
3096 // The only way for an anonymous lifetime to wind up
3097 // in the return type but **also** be unconstrained is
3098 // if it only appears in "associated types" in the
3099 // input. See #47511 for an example. In this case,
3100 // though we can easily give a hint that ought to be
3103 "lifetimes appearing in an associated type are not considered constrained",
3112 /// Given the bounds on an object, determines what single region bound (if any) we can
3113 /// use to summarize this type. The basic idea is that we will use the bound the user
3114 /// provided, if they provided one, and otherwise search the supertypes of trait bounds
3115 /// for region bounds. It may be that we can derive no bound at all, in which case
3116 /// we return `None`.
3117 fn compute_object_lifetime_bound(
3120 existential_predicates: ty::Binder<&'tcx ty::List<ty::ExistentialPredicate<'tcx>>>,
3121 ) -> Option<ty::Region<'tcx>> // if None, use the default
3123 let tcx = self.tcx();
3125 debug!("compute_opt_region_bound(existential_predicates={:?})", existential_predicates);
3127 // No explicit region bound specified. Therefore, examine trait
3128 // bounds and see if we can derive region bounds from those.
3129 let derived_region_bounds = object_region_bounds(tcx, existential_predicates);
3131 // If there are no derived region bounds, then report back that we
3132 // can find no region bound. The caller will use the default.
3133 if derived_region_bounds.is_empty() {
3137 // If any of the derived region bounds are 'static, that is always
3139 if derived_region_bounds.iter().any(|&r| ty::ReStatic == *r) {
3140 return Some(tcx.lifetimes.re_static);
3143 // Determine whether there is exactly one unique region in the set
3144 // of derived region bounds. If so, use that. Otherwise, report an
3146 let r = derived_region_bounds[0];
3147 if derived_region_bounds[1..].iter().any(|r1| r != *r1) {
3152 "ambiguous lifetime bound, explicit lifetime bound required"
3160 /// Collects together a list of bounds that are applied to some type,
3161 /// after they've been converted into `ty` form (from the HIR
3162 /// representations). These lists of bounds occur in many places in
3166 /// trait Foo: Bar + Baz { }
3167 /// ^^^^^^^^^ supertrait list bounding the `Self` type parameter
3169 /// fn foo<T: Bar + Baz>() { }
3170 /// ^^^^^^^^^ bounding the type parameter `T`
3172 /// impl dyn Bar + Baz
3173 /// ^^^^^^^^^ bounding the forgotten dynamic type
3176 /// Our representation is a bit mixed here -- in some cases, we
3177 /// include the self type (e.g., `trait_bounds`) but in others we do
3178 #[derive(Default, PartialEq, Eq, Clone, Debug)]
3179 pub struct Bounds<'tcx> {
3180 /// A list of region bounds on the (implicit) self type. So if you
3181 /// had `T: 'a + 'b` this might would be a list `['a, 'b]` (but
3182 /// the `T` is not explicitly included).
3183 pub region_bounds: Vec<(ty::Region<'tcx>, Span)>,
3185 /// A list of trait bounds. So if you had `T: Debug` this would be
3186 /// `T: Debug`. Note that the self-type is explicit here.
3187 pub trait_bounds: Vec<(ty::PolyTraitRef<'tcx>, Span, Constness)>,
3189 /// A list of projection equality bounds. So if you had `T:
3190 /// Iterator<Item = u32>` this would include `<T as
3191 /// Iterator>::Item => u32`. Note that the self-type is explicit
3193 pub projection_bounds: Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>,
3195 /// `Some` if there is *no* `?Sized` predicate. The `span`
3196 /// is the location in the source of the `T` declaration which can
3197 /// be cited as the source of the `T: Sized` requirement.
3198 pub implicitly_sized: Option<Span>,
3201 impl<'tcx> Bounds<'tcx> {
3202 /// Converts a bounds list into a flat set of predicates (like
3203 /// where-clauses). Because some of our bounds listings (e.g.,
3204 /// regions) don't include the self-type, you must supply the
3205 /// self-type here (the `param_ty` parameter).
3210 ) -> Vec<(ty::Predicate<'tcx>, Span)> {
3211 // If it could be sized, and is, add the `Sized` predicate.
3212 let sized_predicate = self.implicitly_sized.and_then(|span| {
3213 tcx.lang_items().sized_trait().map(|sized| {
3214 let trait_ref = ty::Binder::bind(ty::TraitRef {
3216 substs: tcx.mk_substs_trait(param_ty, &[]),
3218 (trait_ref.without_const().to_predicate(tcx), span)
3227 .map(|&(region_bound, span)| {
3228 // Account for the binder being introduced below; no need to shift `param_ty`
3229 // because, at present at least, it either only refers to early-bound regions,
3230 // or it's a generic associated type that deliberately has escaping bound vars.
3231 let region_bound = ty::fold::shift_region(tcx, region_bound, 1);
3232 let outlives = ty::OutlivesPredicate(param_ty, region_bound);
3233 (ty::Binder::bind(outlives).to_predicate(tcx), span)
3235 .chain(self.trait_bounds.iter().map(|&(bound_trait_ref, span, constness)| {
3236 let predicate = bound_trait_ref.with_constness(constness).to_predicate(tcx);
3240 self.projection_bounds
3242 .map(|&(projection, span)| (projection.to_predicate(tcx), span)),