1 //! Conversion from AST representation of types to the `ty.rs` representation.
2 //! The main routine here is `ast_ty_to_ty()`; each use is parameterized by an
3 //! instance of `AstConv`.
8 use crate::bounds::Bounds;
9 use crate::collect::PlaceholderHirTyCollector;
11 AmbiguousLifetimeBound, MultipleRelaxedDefaultBounds, TraitObjectDeclaredWithNoTraits,
12 TypeofReservedKeywordUsed, ValueOfAssociatedStructAlreadySpecified,
14 use crate::middle::resolve_lifetime as rl;
15 use crate::require_c_abi_if_c_variadic;
16 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
17 use rustc_errors::{struct_span_err, Applicability, ErrorReported, FatalError};
19 use rustc_hir::def::{CtorOf, DefKind, Namespace, Res};
20 use rustc_hir::def_id::{DefId, LocalDefId};
21 use rustc_hir::intravisit::{walk_generics, Visitor as _};
22 use rustc_hir::lang_items::LangItem;
23 use rustc_hir::{Constness, GenericArg, GenericArgs};
24 use rustc_middle::ty::subst::{self, InternalSubsts, Subst, SubstsRef};
25 use rustc_middle::ty::GenericParamDefKind;
26 use rustc_middle::ty::{self, Const, DefIdTree, Ty, TyCtxt, TypeFoldable};
27 use rustc_session::lint::builtin::AMBIGUOUS_ASSOCIATED_ITEMS;
28 use rustc_span::lev_distance::find_best_match_for_name;
29 use rustc_span::symbol::{Ident, Symbol};
30 use rustc_span::{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;
39 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 pub enum IsMethodCall {
147 /// Denotes the "position" of a generic argument, indicating if it is a generic type,
148 /// generic function or generic method call.
149 #[derive(Copy, Clone, PartialEq)]
150 pub(crate) enum GenericArgPosition {
152 Value, // e.g., functions
156 /// A marker denoting that the generic arguments that were
157 /// provided did not match the respective generic parameters.
158 #[derive(Clone, Default)]
159 pub struct GenericArgCountMismatch {
160 /// Indicates whether a fatal error was reported (`Some`), or just a lint (`None`).
161 pub reported: Option<ErrorReported>,
162 /// A list of spans of arguments provided that were not valid.
163 pub invalid_args: Vec<Span>,
166 /// Decorates the result of a generic argument count mismatch
167 /// check with whether explicit late bounds were provided.
169 pub struct GenericArgCountResult {
170 pub explicit_late_bound: ExplicitLateBound,
171 pub correct: Result<(), GenericArgCountMismatch>,
174 pub trait CreateSubstsForGenericArgsCtxt<'a, 'tcx> {
175 fn args_for_def_id(&mut self, def_id: DefId) -> (Option<&'a GenericArgs<'a>>, bool);
179 param: &ty::GenericParamDef,
180 arg: &GenericArg<'_>,
181 ) -> subst::GenericArg<'tcx>;
185 substs: Option<&[subst::GenericArg<'tcx>]>,
186 param: &ty::GenericParamDef,
188 ) -> subst::GenericArg<'tcx>;
191 impl<'o, 'tcx> dyn AstConv<'tcx> + 'o {
192 pub fn ast_region_to_region(
194 lifetime: &hir::Lifetime,
195 def: Option<&ty::GenericParamDef>,
196 ) -> ty::Region<'tcx> {
197 let tcx = self.tcx();
198 let lifetime_name = |def_id| tcx.hir().name(tcx.hir().local_def_id_to_hir_id(def_id));
200 let r = match tcx.named_region(lifetime.hir_id) {
201 Some(rl::Region::Static) => tcx.lifetimes.re_static,
203 Some(rl::Region::LateBound(debruijn, id, _)) => {
204 let name = lifetime_name(id.expect_local());
205 let br = ty::BoundRegion { kind: ty::BrNamed(id, name) };
206 tcx.mk_region(ty::ReLateBound(debruijn, br))
209 Some(rl::Region::LateBoundAnon(debruijn, index)) => {
210 let br = ty::BoundRegion { kind: ty::BrAnon(index) };
211 tcx.mk_region(ty::ReLateBound(debruijn, br))
214 Some(rl::Region::EarlyBound(index, id, _)) => {
215 let name = lifetime_name(id.expect_local());
216 tcx.mk_region(ty::ReEarlyBound(ty::EarlyBoundRegion { def_id: id, index, name }))
219 Some(rl::Region::Free(scope, id)) => {
220 let name = lifetime_name(id.expect_local());
221 tcx.mk_region(ty::ReFree(ty::FreeRegion {
223 bound_region: ty::BrNamed(id, name),
226 // (*) -- not late-bound, won't change
230 self.re_infer(def, lifetime.span).unwrap_or_else(|| {
231 // This indicates an illegal lifetime
232 // elision. `resolve_lifetime` should have
233 // reported an error in this case -- but if
234 // not, let's error out.
235 tcx.sess.delay_span_bug(lifetime.span, "unelided lifetime in signature");
237 // Supply some dummy value. We don't have an
238 // `re_error`, annoyingly, so use `'static`.
239 tcx.lifetimes.re_static
244 debug!("ast_region_to_region(lifetime={:?}) yields {:?}", lifetime, r);
249 /// Given a path `path` that refers to an item `I` with the declared generics `decl_generics`,
250 /// returns an appropriate set of substitutions for this particular reference to `I`.
251 pub fn ast_path_substs_for_ty(
255 item_segment: &hir::PathSegment<'_>,
256 ) -> SubstsRef<'tcx> {
257 let (substs, assoc_bindings, _) = self.create_substs_for_ast_path(
263 item_segment.infer_args,
267 if let Some(b) = assoc_bindings.first() {
268 Self::prohibit_assoc_ty_binding(self.tcx(), b.span);
274 /// Given the type/lifetime/const arguments provided to some path (along with
275 /// an implicit `Self`, if this is a trait reference), returns the complete
276 /// set of substitutions. This may involve applying defaulted type parameters.
277 /// Also returns back constraints on associated types.
282 /// T: std::ops::Index<usize, Output = u32>
283 /// ^1 ^^^^^^^^^^^^^^2 ^^^^3 ^^^^^^^^^^^4
286 /// 1. The `self_ty` here would refer to the type `T`.
287 /// 2. The path in question is the path to the trait `std::ops::Index`,
288 /// which will have been resolved to a `def_id`
289 /// 3. The `generic_args` contains info on the `<...>` contents. The `usize` type
290 /// parameters are returned in the `SubstsRef`, the associated type bindings like
291 /// `Output = u32` are returned in the `Vec<ConvertedBinding...>` result.
293 /// Note that the type listing given here is *exactly* what the user provided.
295 /// For (generic) associated types
298 /// <Vec<u8> as Iterable<u8>>::Iter::<'a>
301 /// We have the parent substs are the substs for the parent trait:
302 /// `[Vec<u8>, u8]` and `generic_args` are the arguments for the associated
303 /// type itself: `['a]`. The returned `SubstsRef` concatenates these two
304 /// lists: `[Vec<u8>, u8, 'a]`.
305 fn create_substs_for_ast_path<'a>(
309 parent_substs: &[subst::GenericArg<'tcx>],
310 seg: &hir::PathSegment<'_>,
311 generic_args: &'a hir::GenericArgs<'_>,
313 self_ty: Option<Ty<'tcx>>,
314 ) -> (SubstsRef<'tcx>, Vec<ConvertedBinding<'a, 'tcx>>, GenericArgCountResult) {
315 // If the type is parameterized by this region, then replace this
316 // region with the current anon region binding (in other words,
317 // whatever & would get replaced with).
319 "create_substs_for_ast_path(def_id={:?}, self_ty={:?}, \
321 def_id, self_ty, generic_args
324 let tcx = self.tcx();
325 let generics = tcx.generics_of(def_id);
327 if generics.has_self {
328 if generics.parent.is_some() {
329 // The parent is a trait so it should have at least one subst
330 // for the `Self` type.
331 assert!(!parent_substs.is_empty())
333 // This item (presumably a trait) needs a self-type.
334 assert!(self_ty.is_some());
337 assert!(self_ty.is_none() && parent_substs.is_empty());
340 let arg_count = Self::check_generic_arg_count(
347 GenericArgPosition::Type,
352 // Skip processing if type has no generic parameters.
353 // Traits always have `Self` as a generic parameter, which means they will not return early
354 // here and so associated type bindings will be handled regardless of whether there are any
355 // non-`Self` generic parameters.
356 if generics.params.len() == 0 {
357 return (tcx.intern_substs(&[]), vec![], arg_count);
360 let is_object = self_ty.map_or(false, |ty| ty == self.tcx().types.trait_object_dummy_self);
362 struct SubstsForAstPathCtxt<'a, 'tcx> {
363 astconv: &'a (dyn AstConv<'tcx> + 'a),
365 generic_args: &'a GenericArgs<'a>,
367 missing_type_params: Vec<String>,
368 inferred_params: Vec<Span>,
373 impl<'tcx, 'a> SubstsForAstPathCtxt<'tcx, 'a> {
374 fn default_needs_object_self(&mut self, param: &ty::GenericParamDef) -> bool {
375 let tcx = self.astconv.tcx();
376 if let GenericParamDefKind::Type { has_default, .. } = param.kind {
377 if self.is_object && has_default {
378 let default_ty = tcx.at(self.span).type_of(param.def_id);
379 let self_param = tcx.types.self_param;
380 if default_ty.walk().any(|arg| arg == self_param.into()) {
381 // There is no suitable inference default for a type parameter
382 // that references self, in an object type.
392 impl<'a, 'tcx> CreateSubstsForGenericArgsCtxt<'a, 'tcx> for SubstsForAstPathCtxt<'a, 'tcx> {
393 fn args_for_def_id(&mut self, did: DefId) -> (Option<&'a GenericArgs<'a>>, bool) {
394 if did == self.def_id {
395 (Some(self.generic_args), self.infer_args)
397 // The last component of this tuple is unimportant.
404 param: &ty::GenericParamDef,
405 arg: &GenericArg<'_>,
406 ) -> subst::GenericArg<'tcx> {
407 let tcx = self.astconv.tcx();
408 match (¶m.kind, arg) {
409 (GenericParamDefKind::Lifetime, GenericArg::Lifetime(lt)) => {
410 self.astconv.ast_region_to_region(<, Some(param)).into()
412 (&GenericParamDefKind::Type { has_default, .. }, GenericArg::Type(ty)) => {
414 tcx.check_optional_stability(
419 // Default generic parameters may not be marked
420 // with stability attributes, i.e. when the
421 // default parameter was defined at the same time
422 // as the rest of the type. As such, we ignore missing
423 // stability attributes.
427 if let (hir::TyKind::Infer, false) =
428 (&ty.kind, self.astconv.allow_ty_infer())
430 self.inferred_params.push(ty.span);
431 tcx.ty_error().into()
433 self.astconv.ast_ty_to_ty(&ty).into()
436 (GenericParamDefKind::Const, GenericArg::Const(ct)) => {
437 ty::Const::from_opt_const_arg_anon_const(
439 ty::WithOptConstParam {
440 did: tcx.hir().local_def_id(ct.value.hir_id),
441 const_param_did: Some(param.def_id),
452 substs: Option<&[subst::GenericArg<'tcx>]>,
453 param: &ty::GenericParamDef,
455 ) -> subst::GenericArg<'tcx> {
456 let tcx = self.astconv.tcx();
458 GenericParamDefKind::Lifetime => tcx.lifetimes.re_static.into(),
459 GenericParamDefKind::Type { has_default, .. } => {
460 if !infer_args && has_default {
461 // No type parameter provided, but a default exists.
463 // If we are converting an object type, then the
464 // `Self` parameter is unknown. However, some of the
465 // other type parameters may reference `Self` in their
466 // defaults. This will lead to an ICE if we are not
468 if self.default_needs_object_self(param) {
469 self.missing_type_params.push(param.name.to_string());
470 tcx.ty_error().into()
472 // This is a default type parameter.
476 tcx.at(self.span).type_of(param.def_id).subst_spanned(
484 } else if infer_args {
485 // No type parameters were provided, we can infer all.
486 let param = if !self.default_needs_object_self(param) {
491 self.astconv.ty_infer(param, self.span).into()
493 // We've already errored above about the mismatch.
494 tcx.ty_error().into()
497 GenericParamDefKind::Const => {
498 let ty = tcx.at(self.span).type_of(param.def_id);
499 // FIXME(const_generics_defaults)
501 // No const parameters were provided, we can infer all.
502 self.astconv.ct_infer(ty, Some(param), self.span).into()
504 // We've already errored above about the mismatch.
505 tcx.const_error(ty).into()
512 let mut substs_ctx = SubstsForAstPathCtxt {
517 missing_type_params: vec![],
518 inferred_params: vec![],
522 let substs = Self::create_substs_for_generic_args(
532 self.complain_about_missing_type_params(
533 substs_ctx.missing_type_params,
536 generic_args.args.is_empty(),
539 // Convert associated-type bindings or constraints into a separate vector.
540 // Example: Given this:
542 // T: Iterator<Item = u32>
544 // The `T` is passed in as a self-type; the `Item = u32` is
545 // not a "type parameter" of the `Iterator` trait, but rather
546 // a restriction on `<T as Iterator>::Item`, so it is passed
548 let assoc_bindings = generic_args
552 let kind = match binding.kind {
553 hir::TypeBindingKind::Equality { ref ty } => {
554 ConvertedBindingKind::Equality(self.ast_ty_to_ty(ty))
556 hir::TypeBindingKind::Constraint { ref bounds } => {
557 ConvertedBindingKind::Constraint(bounds)
560 ConvertedBinding { item_name: binding.ident, kind, span: binding.span }
565 "create_substs_for_ast_path(generic_params={:?}, self_ty={:?}) -> {:?}",
566 generics, self_ty, substs
569 (substs, assoc_bindings, arg_count)
572 crate fn create_substs_for_associated_item(
577 item_segment: &hir::PathSegment<'_>,
578 parent_substs: SubstsRef<'tcx>,
579 ) -> SubstsRef<'tcx> {
580 if tcx.generics_of(item_def_id).params.is_empty() {
581 self.prohibit_generics(slice::from_ref(item_segment));
585 self.create_substs_for_ast_path(
591 item_segment.infer_args,
598 /// Instantiates the path for the given trait reference, assuming that it's
599 /// bound to a valid trait type. Returns the `DefId` of the defining trait.
600 /// The type _cannot_ be a type other than a trait type.
602 /// If the `projections` argument is `None`, then assoc type bindings like `Foo<T = X>`
603 /// are disallowed. Otherwise, they are pushed onto the vector given.
604 pub fn instantiate_mono_trait_ref(
606 trait_ref: &hir::TraitRef<'_>,
608 ) -> ty::TraitRef<'tcx> {
609 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
611 self.ast_path_to_mono_trait_ref(
613 trait_ref.trait_def_id().unwrap_or_else(|| FatalError.raise()),
615 trait_ref.path.segments.last().unwrap(),
619 /// The given trait-ref must actually be a trait.
620 pub(super) fn instantiate_poly_trait_ref_inner(
622 trait_ref: &hir::TraitRef<'_>,
624 constness: Constness,
626 bounds: &mut Bounds<'tcx>,
628 ) -> GenericArgCountResult {
629 let trait_def_id = trait_ref.trait_def_id().unwrap_or_else(|| FatalError.raise());
631 debug!("instantiate_poly_trait_ref({:?}, def_id={:?})", trait_ref, trait_def_id);
633 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
635 let (substs, assoc_bindings, arg_count) = self.create_substs_for_ast_trait_ref(
639 trait_ref.path.segments.last().unwrap(),
641 let poly_trait_ref = ty::Binder::bind(ty::TraitRef::new(trait_def_id, substs));
643 bounds.trait_bounds.push((poly_trait_ref, span, constness));
645 let mut dup_bindings = FxHashMap::default();
646 for binding in &assoc_bindings {
647 // Specify type to assert that error was already reported in `Err` case.
648 let _: Result<_, ErrorReported> = self.add_predicates_for_ast_type_binding(
649 trait_ref.hir_ref_id,
657 // Okay to ignore `Err` because of `ErrorReported` (see above).
661 "instantiate_poly_trait_ref({:?}, bounds={:?}) -> {:?}",
662 trait_ref, bounds, poly_trait_ref
668 /// Given a trait bound like `Debug`, applies that trait bound the given self-type to construct
669 /// a full trait reference. The resulting trait reference is returned. This may also generate
670 /// auxiliary bounds, which are added to `bounds`.
675 /// poly_trait_ref = Iterator<Item = u32>
679 /// this would return `Foo: Iterator` and add `<Foo as Iterator>::Item = u32` into `bounds`.
681 /// **A note on binders:** against our usual convention, there is an implied bounder around
682 /// the `self_ty` and `poly_trait_ref` parameters here. So they may reference bound regions.
683 /// If for example you had `for<'a> Foo<'a>: Bar<'a>`, then the `self_ty` would be `Foo<'a>`
684 /// where `'a` is a bound region at depth 0. Similarly, the `poly_trait_ref` would be
685 /// `Bar<'a>`. The returned poly-trait-ref will have this binder instantiated explicitly,
687 pub fn instantiate_poly_trait_ref(
689 poly_trait_ref: &hir::PolyTraitRef<'_>,
690 constness: Constness,
692 bounds: &mut Bounds<'tcx>,
693 ) -> GenericArgCountResult {
694 self.instantiate_poly_trait_ref_inner(
695 &poly_trait_ref.trait_ref,
704 pub fn instantiate_lang_item_trait_ref(
706 lang_item: hir::LangItem,
709 args: &GenericArgs<'_>,
711 bounds: &mut Bounds<'tcx>,
713 let trait_def_id = self.tcx().require_lang_item(lang_item, Some(span));
715 let (substs, assoc_bindings, _) = self.create_substs_for_ast_path(
719 &hir::PathSegment::invalid(),
724 let poly_trait_ref = ty::Binder::bind(ty::TraitRef::new(trait_def_id, substs));
725 bounds.trait_bounds.push((poly_trait_ref, span, Constness::NotConst));
727 let mut dup_bindings = FxHashMap::default();
728 for binding in assoc_bindings {
729 let _: Result<_, ErrorReported> = self.add_predicates_for_ast_type_binding(
741 fn ast_path_to_mono_trait_ref(
746 trait_segment: &hir::PathSegment<'_>,
747 ) -> ty::TraitRef<'tcx> {
748 let (substs, assoc_bindings, _) =
749 self.create_substs_for_ast_trait_ref(span, trait_def_id, self_ty, trait_segment);
750 if let Some(b) = assoc_bindings.first() {
751 Self::prohibit_assoc_ty_binding(self.tcx(), b.span);
753 ty::TraitRef::new(trait_def_id, substs)
756 fn create_substs_for_ast_trait_ref<'a>(
761 trait_segment: &'a hir::PathSegment<'a>,
762 ) -> (SubstsRef<'tcx>, Vec<ConvertedBinding<'a, 'tcx>>, GenericArgCountResult) {
763 debug!("create_substs_for_ast_trait_ref(trait_segment={:?})", trait_segment);
765 self.complain_about_internal_fn_trait(span, trait_def_id, trait_segment);
767 self.create_substs_for_ast_path(
772 trait_segment.args(),
773 trait_segment.infer_args,
778 fn trait_defines_associated_type_named(&self, trait_def_id: DefId, assoc_name: Ident) -> bool {
780 .associated_items(trait_def_id)
781 .find_by_name_and_kind(self.tcx(), assoc_name, ty::AssocKind::Type, trait_def_id)
785 // Returns `true` if a bounds list includes `?Sized`.
786 pub fn is_unsized(&self, ast_bounds: &[hir::GenericBound<'_>], span: Span) -> bool {
787 let tcx = self.tcx();
789 // Try to find an unbound in bounds.
790 let mut unbound = None;
791 for ab in ast_bounds {
792 if let hir::GenericBound::Trait(ptr, hir::TraitBoundModifier::Maybe) = ab {
793 if unbound.is_none() {
794 unbound = Some(&ptr.trait_ref);
796 tcx.sess.emit_err(MultipleRelaxedDefaultBounds { span });
801 let kind_id = tcx.lang_items().require(LangItem::Sized);
804 // FIXME(#8559) currently requires the unbound to be built-in.
805 if let Ok(kind_id) = kind_id {
806 if tpb.path.res != Res::Def(DefKind::Trait, kind_id) {
809 "default bound relaxed for a type parameter, but \
810 this does nothing because the given bound is not \
811 a default; only `?Sized` is supported",
816 _ if kind_id.is_ok() => {
819 // No lang item for `Sized`, so we can't add it as a bound.
826 /// This helper takes a *converted* parameter type (`param_ty`)
827 /// and an *unconverted* list of bounds:
831 /// ^ ^^^^^ `ast_bounds` parameter, in HIR form
833 /// `param_ty`, in ty form
836 /// It adds these `ast_bounds` into the `bounds` structure.
838 /// **A note on binders:** there is an implied binder around
839 /// `param_ty` and `ast_bounds`. See `instantiate_poly_trait_ref`
840 /// for more details.
844 ast_bounds: &[hir::GenericBound<'_>],
845 bounds: &mut Bounds<'tcx>,
847 let constness = self.default_constness_for_trait_bounds();
848 for ast_bound in ast_bounds {
850 hir::GenericBound::Trait(ref b, hir::TraitBoundModifier::None) => {
851 self.instantiate_poly_trait_ref(b, constness, param_ty, bounds);
853 hir::GenericBound::Trait(ref b, hir::TraitBoundModifier::MaybeConst) => {
854 self.instantiate_poly_trait_ref(b, Constness::NotConst, param_ty, bounds);
856 hir::GenericBound::Trait(_, hir::TraitBoundModifier::Maybe) => {}
857 hir::GenericBound::LangItemTrait(lang_item, span, hir_id, args) => self
858 .instantiate_lang_item_trait_ref(
859 lang_item, span, hir_id, args, param_ty, bounds,
861 hir::GenericBound::Outlives(ref l) => bounds
863 .push((ty::Binder::bind(self.ast_region_to_region(l, None)), l.span)),
868 /// Translates a list of bounds from the HIR into the `Bounds` data structure.
869 /// The self-type for the bounds is given by `param_ty`.
874 /// fn foo<T: Bar + Baz>() { }
875 /// ^ ^^^^^^^^^ ast_bounds
879 /// The `sized_by_default` parameter indicates if, in this context, the `param_ty` should be
880 /// considered `Sized` unless there is an explicit `?Sized` bound. This would be true in the
881 /// example above, but is not true in supertrait listings like `trait Foo: Bar + Baz`.
883 /// `span` should be the declaration size of the parameter.
884 pub fn compute_bounds(
887 ast_bounds: &[hir::GenericBound<'_>],
888 sized_by_default: SizedByDefault,
891 let mut bounds = Bounds::default();
893 self.add_bounds(param_ty, ast_bounds, &mut bounds);
894 bounds.trait_bounds.sort_by_key(|(t, _, _)| t.def_id());
896 bounds.implicitly_sized = if let SizedByDefault::Yes = sized_by_default {
897 if !self.is_unsized(ast_bounds, span) { Some(span) } else { None }
905 /// Given an HIR binding like `Item = Foo` or `Item: Foo`, pushes the corresponding predicates
908 /// **A note on binders:** given something like `T: for<'a> Iterator<Item = &'a u32>`, the
909 /// `trait_ref` here will be `for<'a> T: Iterator`. The `binding` data however is from *inside*
910 /// the binder (e.g., `&'a u32`) and hence may reference bound regions.
911 fn add_predicates_for_ast_type_binding(
913 hir_ref_id: hir::HirId,
914 trait_ref: ty::PolyTraitRef<'tcx>,
915 binding: &ConvertedBinding<'_, 'tcx>,
916 bounds: &mut Bounds<'tcx>,
918 dup_bindings: &mut FxHashMap<DefId, Span>,
920 ) -> Result<(), ErrorReported> {
921 let tcx = self.tcx();
924 // Given something like `U: SomeTrait<T = X>`, we want to produce a
925 // predicate like `<U as SomeTrait>::T = X`. This is somewhat
926 // subtle in the event that `T` is defined in a supertrait of
927 // `SomeTrait`, because in that case we need to upcast.
929 // That is, consider this case:
932 // trait SubTrait: SuperTrait<i32> { }
933 // trait SuperTrait<A> { type T; }
935 // ... B: SubTrait<T = foo> ...
938 // We want to produce `<B as SuperTrait<i32>>::T == foo`.
940 // Find any late-bound regions declared in `ty` that are not
941 // declared in the trait-ref. These are not well-formed.
945 // for<'a> <T as Iterator>::Item = &'a str // <-- 'a is bad
946 // for<'a> <T as FnMut<(&'a u32,)>>::Output = &'a str // <-- 'a is ok
947 if let ConvertedBindingKind::Equality(ty) = binding.kind {
948 let late_bound_in_trait_ref =
949 tcx.collect_constrained_late_bound_regions(&trait_ref);
950 let late_bound_in_ty =
951 tcx.collect_referenced_late_bound_regions(&ty::Binder::bind(ty));
952 debug!("late_bound_in_trait_ref = {:?}", late_bound_in_trait_ref);
953 debug!("late_bound_in_ty = {:?}", late_bound_in_ty);
955 // FIXME: point at the type params that don't have appropriate lifetimes:
956 // struct S1<F: for<'a> Fn(&i32, &i32) -> &'a i32>(F);
958 self.validate_late_bound_regions(
959 late_bound_in_trait_ref,
966 "binding for associated type `{}` references {}, \
967 which does not appear in the trait input types",
977 if self.trait_defines_associated_type_named(trait_ref.def_id(), binding.item_name) {
978 // Simple case: X is defined in the current trait.
981 // Otherwise, we have to walk through the supertraits to find
983 self.one_bound_for_assoc_type(
984 || traits::supertraits(tcx, trait_ref),
985 || trait_ref.print_only_trait_path().to_string(),
988 || match binding.kind {
989 ConvertedBindingKind::Equality(ty) => Some(ty.to_string()),
995 let (assoc_ident, def_scope) =
996 tcx.adjust_ident_and_get_scope(binding.item_name, candidate.def_id(), hir_ref_id);
998 // We have already adjusted the item name above, so compare with `ident.normalize_to_macros_2_0()` instead
999 // of calling `filter_by_name_and_kind`.
1001 .associated_items(candidate.def_id())
1002 .filter_by_name_unhygienic(assoc_ident.name)
1004 i.kind == ty::AssocKind::Type && i.ident.normalize_to_macros_2_0() == assoc_ident
1006 .expect("missing associated type");
1008 if !assoc_ty.vis.is_accessible_from(def_scope, tcx) {
1012 &format!("associated type `{}` is private", binding.item_name),
1014 .span_label(binding.span, "private associated type")
1017 tcx.check_stability(assoc_ty.def_id, Some(hir_ref_id), binding.span);
1021 .entry(assoc_ty.def_id)
1022 .and_modify(|prev_span| {
1023 self.tcx().sess.emit_err(ValueOfAssociatedStructAlreadySpecified {
1025 prev_span: *prev_span,
1026 item_name: binding.item_name,
1027 def_path: tcx.def_path_str(assoc_ty.container.id()),
1030 .or_insert(binding.span);
1033 match binding.kind {
1034 ConvertedBindingKind::Equality(ref ty) => {
1035 // "Desugar" a constraint like `T: Iterator<Item = u32>` this to
1036 // the "projection predicate" for:
1038 // `<T as Iterator>::Item = u32`
1039 bounds.projection_bounds.push((
1040 candidate.map_bound(|trait_ref| ty::ProjectionPredicate {
1041 projection_ty: ty::ProjectionTy::from_ref_and_name(
1051 ConvertedBindingKind::Constraint(ast_bounds) => {
1052 // "Desugar" a constraint like `T: Iterator<Item: Debug>` to
1054 // `<T as Iterator>::Item: Debug`
1056 // Calling `skip_binder` is okay, because `add_bounds` expects the `param_ty`
1057 // parameter to have a skipped binder.
1058 let param_ty = tcx.mk_projection(assoc_ty.def_id, candidate.skip_binder().substs);
1059 self.add_bounds(param_ty, ast_bounds, bounds);
1069 item_segment: &hir::PathSegment<'_>,
1071 let substs = self.ast_path_substs_for_ty(span, did, item_segment);
1072 self.normalize_ty(span, self.tcx().at(span).type_of(did).subst(self.tcx(), substs))
1075 fn conv_object_ty_poly_trait_ref(
1078 trait_bounds: &[hir::PolyTraitRef<'_>],
1079 lifetime: &hir::Lifetime,
1082 let tcx = self.tcx();
1084 let mut bounds = Bounds::default();
1085 let mut potential_assoc_types = Vec::new();
1086 let dummy_self = self.tcx().types.trait_object_dummy_self;
1087 for trait_bound in trait_bounds.iter().rev() {
1088 if let GenericArgCountResult {
1090 Err(GenericArgCountMismatch { invalid_args: cur_potential_assoc_types, .. }),
1092 } = self.instantiate_poly_trait_ref(
1094 Constness::NotConst,
1098 potential_assoc_types.extend(cur_potential_assoc_types);
1102 // Expand trait aliases recursively and check that only one regular (non-auto) trait
1103 // is used and no 'maybe' bounds are used.
1104 let expanded_traits =
1105 traits::expand_trait_aliases(tcx, bounds.trait_bounds.iter().map(|&(a, b, _)| (a, b)));
1106 let (mut auto_traits, regular_traits): (Vec<_>, Vec<_>) =
1107 expanded_traits.partition(|i| tcx.trait_is_auto(i.trait_ref().def_id()));
1108 if regular_traits.len() > 1 {
1109 let first_trait = ®ular_traits[0];
1110 let additional_trait = ®ular_traits[1];
1111 let mut err = struct_span_err!(
1113 additional_trait.bottom().1,
1115 "only auto traits can be used as additional traits in a trait object"
1117 additional_trait.label_with_exp_info(
1119 "additional non-auto trait",
1122 first_trait.label_with_exp_info(&mut err, "first non-auto trait", "first use");
1124 "consider creating a new trait with all of these as super-traits and using that \
1125 trait here instead: `trait NewTrait: {} {{}}`",
1128 .map(|t| t.trait_ref().print_only_trait_path().to_string())
1129 .collect::<Vec<_>>()
1133 "auto-traits like `Send` and `Sync` are traits that have special properties; \
1134 for more information on them, visit \
1135 <https://doc.rust-lang.org/reference/special-types-and-traits.html#auto-traits>",
1140 if regular_traits.is_empty() && auto_traits.is_empty() {
1141 tcx.sess.emit_err(TraitObjectDeclaredWithNoTraits { span });
1142 return tcx.ty_error();
1145 // Check that there are no gross object safety violations;
1146 // most importantly, that the supertraits don't contain `Self`,
1148 for item in ®ular_traits {
1149 let object_safety_violations =
1150 astconv_object_safety_violations(tcx, item.trait_ref().def_id());
1151 if !object_safety_violations.is_empty() {
1152 report_object_safety_error(
1155 item.trait_ref().def_id(),
1156 &object_safety_violations[..],
1159 return tcx.ty_error();
1163 // Use a `BTreeSet` to keep output in a more consistent order.
1164 let mut associated_types: FxHashMap<Span, BTreeSet<DefId>> = FxHashMap::default();
1166 let regular_traits_refs_spans = bounds
1169 .filter(|(trait_ref, _, _)| !tcx.trait_is_auto(trait_ref.def_id()));
1171 for (base_trait_ref, span, constness) in regular_traits_refs_spans {
1172 assert_eq!(constness, Constness::NotConst);
1174 for obligation in traits::elaborate_trait_ref(tcx, base_trait_ref) {
1176 "conv_object_ty_poly_trait_ref: observing object predicate `{:?}`",
1177 obligation.predicate
1180 let bound_predicate = obligation.predicate.kind();
1181 match bound_predicate.skip_binder() {
1182 ty::PredicateKind::Trait(pred, _) => {
1183 let pred = bound_predicate.rebind(pred);
1184 associated_types.entry(span).or_default().extend(
1185 tcx.associated_items(pred.def_id())
1186 .in_definition_order()
1187 .filter(|item| item.kind == ty::AssocKind::Type)
1188 .map(|item| item.def_id),
1191 ty::PredicateKind::Projection(pred) => {
1192 let pred = bound_predicate.rebind(pred);
1193 // A `Self` within the original bound will be substituted with a
1194 // `trait_object_dummy_self`, so check for that.
1195 let references_self =
1196 pred.skip_binder().ty.walk().any(|arg| arg == dummy_self.into());
1198 // If the projection output contains `Self`, force the user to
1199 // elaborate it explicitly to avoid a lot of complexity.
1201 // The "classicaly useful" case is the following:
1203 // trait MyTrait: FnMut() -> <Self as MyTrait>::MyOutput {
1208 // Here, the user could theoretically write `dyn MyTrait<Output = X>`,
1209 // but actually supporting that would "expand" to an infinitely-long type
1210 // `fix $ τ → dyn MyTrait<MyOutput = X, Output = <τ as MyTrait>::MyOutput`.
1212 // Instead, we force the user to write
1213 // `dyn MyTrait<MyOutput = X, Output = X>`, which is uglier but works. See
1214 // the discussion in #56288 for alternatives.
1215 if !references_self {
1216 // Include projections defined on supertraits.
1217 bounds.projection_bounds.push((pred, span));
1225 for (projection_bound, _) in &bounds.projection_bounds {
1226 for def_ids in associated_types.values_mut() {
1227 def_ids.remove(&projection_bound.projection_def_id());
1231 self.complain_about_missing_associated_types(
1233 potential_assoc_types,
1237 // De-duplicate auto traits so that, e.g., `dyn Trait + Send + Send` is the same as
1238 // `dyn Trait + Send`.
1239 auto_traits.sort_by_key(|i| i.trait_ref().def_id());
1240 auto_traits.dedup_by_key(|i| i.trait_ref().def_id());
1241 debug!("regular_traits: {:?}", regular_traits);
1242 debug!("auto_traits: {:?}", auto_traits);
1244 // Transform a `PolyTraitRef` into a `PolyExistentialTraitRef` by
1245 // removing the dummy `Self` type (`trait_object_dummy_self`).
1246 let trait_ref_to_existential = |trait_ref: ty::TraitRef<'tcx>| {
1247 if trait_ref.self_ty() != dummy_self {
1248 // FIXME: There appears to be a missing filter on top of `expand_trait_aliases`,
1249 // which picks up non-supertraits where clauses - but also, the object safety
1250 // completely ignores trait aliases, which could be object safety hazards. We
1251 // `delay_span_bug` here to avoid an ICE in stable even when the feature is
1252 // disabled. (#66420)
1253 tcx.sess.delay_span_bug(
1256 "trait_ref_to_existential called on {:?} with non-dummy Self",
1261 ty::ExistentialTraitRef::erase_self_ty(tcx, trait_ref)
1264 // Erase the `dummy_self` (`trait_object_dummy_self`) used above.
1265 let existential_trait_refs =
1266 regular_traits.iter().map(|i| i.trait_ref().map_bound(trait_ref_to_existential));
1267 let existential_projections = bounds.projection_bounds.iter().map(|(bound, _)| {
1268 bound.map_bound(|b| {
1269 let trait_ref = trait_ref_to_existential(b.projection_ty.trait_ref(tcx));
1270 ty::ExistentialProjection {
1272 item_def_id: b.projection_ty.item_def_id,
1273 substs: trait_ref.substs,
1278 let regular_trait_predicates = existential_trait_refs
1279 .map(|trait_ref| trait_ref.map_bound(ty::ExistentialPredicate::Trait));
1280 let auto_trait_predicates = auto_traits.into_iter().map(|trait_ref| {
1281 ty::Binder::dummy(ty::ExistentialPredicate::AutoTrait(trait_ref.trait_ref().def_id()))
1283 let mut v = regular_trait_predicates
1284 .chain(auto_trait_predicates)
1286 existential_projections.map(|x| x.map_bound(ty::ExistentialPredicate::Projection)),
1288 .collect::<SmallVec<[_; 8]>>();
1289 v.sort_by(|a, b| a.skip_binder().stable_cmp(tcx, &b.skip_binder()));
1291 let existential_predicates = tcx.mk_poly_existential_predicates(v.into_iter());
1293 // Use explicitly-specified region bound.
1294 let region_bound = if !lifetime.is_elided() {
1295 self.ast_region_to_region(lifetime, None)
1297 self.compute_object_lifetime_bound(span, existential_predicates).unwrap_or_else(|| {
1298 if tcx.named_region(lifetime.hir_id).is_some() {
1299 self.ast_region_to_region(lifetime, None)
1301 self.re_infer(None, span).unwrap_or_else(|| {
1302 let mut err = struct_span_err!(
1306 "the lifetime bound for this object type cannot be deduced \
1307 from context; please supply an explicit bound"
1310 // We will have already emitted an error E0106 complaining about a
1311 // missing named lifetime in `&dyn Trait`, so we elide this one.
1316 tcx.lifetimes.re_static
1321 debug!("region_bound: {:?}", region_bound);
1323 let ty = tcx.mk_dynamic(existential_predicates, region_bound);
1324 debug!("trait_object_type: {:?}", ty);
1328 fn report_ambiguous_associated_type(
1335 let mut err = struct_span_err!(self.tcx().sess, span, E0223, "ambiguous associated type");
1336 if let (Some(_), Ok(snippet)) = (
1337 self.tcx().sess.confused_type_with_std_module.borrow().get(&span),
1338 self.tcx().sess.source_map().span_to_snippet(span),
1340 err.span_suggestion(
1342 "you are looking for the module in `std`, not the primitive type",
1343 format!("std::{}", snippet),
1344 Applicability::MachineApplicable,
1347 err.span_suggestion(
1349 "use fully-qualified syntax",
1350 format!("<{} as {}>::{}", type_str, trait_str, name),
1351 Applicability::HasPlaceholders,
1357 // Search for a bound on a type parameter which includes the associated item
1358 // given by `assoc_name`. `ty_param_def_id` is the `DefId` of the type parameter
1359 // This function will fail if there are no suitable bounds or there is
1361 fn find_bound_for_assoc_item(
1363 ty_param_def_id: LocalDefId,
1366 ) -> Result<ty::PolyTraitRef<'tcx>, ErrorReported> {
1367 let tcx = self.tcx();
1370 "find_bound_for_assoc_item(ty_param_def_id={:?}, assoc_name={:?}, span={:?})",
1371 ty_param_def_id, assoc_name, span,
1375 &self.get_type_parameter_bounds(span, ty_param_def_id.to_def_id()).predicates;
1377 debug!("find_bound_for_assoc_item: predicates={:#?}", predicates);
1379 let param_hir_id = tcx.hir().local_def_id_to_hir_id(ty_param_def_id);
1380 let param_name = tcx.hir().ty_param_name(param_hir_id);
1381 self.one_bound_for_assoc_type(
1383 traits::transitive_bounds(
1385 predicates.iter().filter_map(|(p, _)| {
1386 p.to_opt_poly_trait_ref().map(|trait_ref| trait_ref.value)
1390 || param_name.to_string(),
1397 // Checks that `bounds` contains exactly one element and reports appropriate
1398 // errors otherwise.
1399 fn one_bound_for_assoc_type<I>(
1401 all_candidates: impl Fn() -> I,
1402 ty_param_name: impl Fn() -> String,
1405 is_equality: impl Fn() -> Option<String>,
1406 ) -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
1408 I: Iterator<Item = ty::PolyTraitRef<'tcx>>,
1410 let mut matching_candidates = all_candidates()
1411 .filter(|r| self.trait_defines_associated_type_named(r.def_id(), assoc_name));
1413 let bound = match matching_candidates.next() {
1414 Some(bound) => bound,
1416 self.complain_about_assoc_type_not_found(
1422 return Err(ErrorReported);
1426 debug!("one_bound_for_assoc_type: bound = {:?}", bound);
1428 if let Some(bound2) = matching_candidates.next() {
1429 debug!("one_bound_for_assoc_type: bound2 = {:?}", bound2);
1431 let is_equality = is_equality();
1432 let bounds = array::IntoIter::new([bound, bound2]).chain(matching_candidates);
1433 let mut err = if is_equality.is_some() {
1434 // More specific Error Index entry.
1439 "ambiguous associated type `{}` in bounds of `{}`",
1448 "ambiguous associated type `{}` in bounds of `{}`",
1453 err.span_label(span, format!("ambiguous associated type `{}`", assoc_name));
1455 let mut where_bounds = vec![];
1456 for bound in bounds {
1457 let bound_id = bound.def_id();
1458 let bound_span = self
1460 .associated_items(bound_id)
1461 .find_by_name_and_kind(self.tcx(), assoc_name, ty::AssocKind::Type, bound_id)
1462 .and_then(|item| self.tcx().hir().span_if_local(item.def_id));
1464 if let Some(bound_span) = bound_span {
1468 "ambiguous `{}` from `{}`",
1470 bound.print_only_trait_path(),
1473 if let Some(constraint) = &is_equality {
1474 where_bounds.push(format!(
1475 " T: {trait}::{assoc} = {constraint}",
1476 trait=bound.print_only_trait_path(),
1478 constraint=constraint,
1481 err.span_suggestion(
1483 "use fully qualified syntax to disambiguate",
1487 bound.print_only_trait_path(),
1490 Applicability::MaybeIncorrect,
1495 "associated type `{}` could derive from `{}`",
1497 bound.print_only_trait_path(),
1501 if !where_bounds.is_empty() {
1503 "consider introducing a new type parameter `T` and adding `where` constraints:\
1504 \n where\n T: {},\n{}",
1506 where_bounds.join(",\n"),
1510 if !where_bounds.is_empty() {
1511 return Err(ErrorReported);
1517 // Create a type from a path to an associated type.
1518 // For a path `A::B::C::D`, `qself_ty` and `qself_def` are the type and def for `A::B::C`
1519 // and item_segment is the path segment for `D`. We return a type and a def for
1521 // Will fail except for `T::A` and `Self::A`; i.e., if `qself_ty`/`qself_def` are not a type
1522 // parameter or `Self`.
1523 pub fn associated_path_to_ty(
1525 hir_ref_id: hir::HirId,
1529 assoc_segment: &hir::PathSegment<'_>,
1530 permit_variants: bool,
1531 ) -> Result<(Ty<'tcx>, DefKind, DefId), ErrorReported> {
1532 let tcx = self.tcx();
1533 let assoc_ident = assoc_segment.ident;
1535 debug!("associated_path_to_ty: {:?}::{}", qself_ty, assoc_ident);
1537 // Check if we have an enum variant.
1538 let mut variant_resolution = None;
1539 if let ty::Adt(adt_def, _) = qself_ty.kind() {
1540 if adt_def.is_enum() {
1541 let variant_def = adt_def
1544 .find(|vd| tcx.hygienic_eq(assoc_ident, vd.ident, adt_def.did));
1545 if let Some(variant_def) = variant_def {
1546 if permit_variants {
1547 tcx.check_stability(variant_def.def_id, Some(hir_ref_id), span);
1548 self.prohibit_generics(slice::from_ref(assoc_segment));
1549 return Ok((qself_ty, DefKind::Variant, variant_def.def_id));
1551 variant_resolution = Some(variant_def.def_id);
1557 // Find the type of the associated item, and the trait where the associated
1558 // item is declared.
1559 let bound = match (&qself_ty.kind(), qself_res) {
1560 (_, Res::SelfTy(Some(_), Some((impl_def_id, _)))) => {
1561 // `Self` in an impl of a trait -- we have a concrete self type and a
1563 let trait_ref = match tcx.impl_trait_ref(impl_def_id) {
1564 Some(trait_ref) => trait_ref,
1566 // A cycle error occurred, most likely.
1567 return Err(ErrorReported);
1571 self.one_bound_for_assoc_type(
1572 || traits::supertraits(tcx, ty::Binder::bind(trait_ref)),
1573 || "Self".to_string(),
1581 Res::SelfTy(Some(param_did), None) | Res::Def(DefKind::TyParam, param_did),
1582 ) => self.find_bound_for_assoc_item(param_did.expect_local(), assoc_ident, span)?,
1584 if variant_resolution.is_some() {
1585 // Variant in type position
1586 let msg = format!("expected type, found variant `{}`", assoc_ident);
1587 tcx.sess.span_err(span, &msg);
1588 } else if qself_ty.is_enum() {
1589 let mut err = struct_span_err!(
1593 "no variant named `{}` found for enum `{}`",
1598 let adt_def = qself_ty.ty_adt_def().expect("enum is not an ADT");
1599 if let Some(suggested_name) = find_best_match_for_name(
1603 .map(|variant| variant.ident.name)
1604 .collect::<Vec<Symbol>>(),
1608 err.span_suggestion(
1610 "there is a variant with a similar name",
1611 suggested_name.to_string(),
1612 Applicability::MaybeIncorrect,
1617 format!("variant not found in `{}`", qself_ty),
1621 if let Some(sp) = tcx.hir().span_if_local(adt_def.did) {
1622 let sp = tcx.sess.source_map().guess_head_span(sp);
1623 err.span_label(sp, format!("variant `{}` not found here", assoc_ident));
1627 } else if !qself_ty.references_error() {
1628 // Don't print `TyErr` to the user.
1629 self.report_ambiguous_associated_type(
1631 &qself_ty.to_string(),
1636 return Err(ErrorReported);
1640 let trait_did = bound.def_id();
1641 let (assoc_ident, def_scope) =
1642 tcx.adjust_ident_and_get_scope(assoc_ident, trait_did, hir_ref_id);
1644 // We have already adjusted the item name above, so compare with `ident.normalize_to_macros_2_0()` instead
1645 // of calling `filter_by_name_and_kind`.
1647 .associated_items(trait_did)
1648 .in_definition_order()
1650 i.kind.namespace() == Namespace::TypeNS
1651 && i.ident.normalize_to_macros_2_0() == assoc_ident
1653 .expect("missing associated type");
1655 let ty = self.projected_ty_from_poly_trait_ref(span, item.def_id, assoc_segment, bound);
1656 let ty = self.normalize_ty(span, ty);
1658 let kind = DefKind::AssocTy;
1659 if !item.vis.is_accessible_from(def_scope, tcx) {
1660 let kind = kind.descr(item.def_id);
1661 let msg = format!("{} `{}` is private", kind, assoc_ident);
1663 .struct_span_err(span, &msg)
1664 .span_label(span, &format!("private {}", kind))
1667 tcx.check_stability(item.def_id, Some(hir_ref_id), span);
1669 if let Some(variant_def_id) = variant_resolution {
1670 tcx.struct_span_lint_hir(AMBIGUOUS_ASSOCIATED_ITEMS, hir_ref_id, span, |lint| {
1671 let mut err = lint.build("ambiguous associated item");
1672 let mut could_refer_to = |kind: DefKind, def_id, also| {
1673 let note_msg = format!(
1674 "`{}` could{} refer to the {} defined here",
1679 err.span_note(tcx.def_span(def_id), ¬e_msg);
1682 could_refer_to(DefKind::Variant, variant_def_id, "");
1683 could_refer_to(kind, item.def_id, " also");
1685 err.span_suggestion(
1687 "use fully-qualified syntax",
1688 format!("<{} as {}>::{}", qself_ty, tcx.item_name(trait_did), assoc_ident),
1689 Applicability::MachineApplicable,
1695 Ok((ty, kind, item.def_id))
1701 opt_self_ty: Option<Ty<'tcx>>,
1703 trait_segment: &hir::PathSegment<'_>,
1704 item_segment: &hir::PathSegment<'_>,
1706 let tcx = self.tcx();
1708 let trait_def_id = tcx.parent(item_def_id).unwrap();
1710 debug!("qpath_to_ty: trait_def_id={:?}", trait_def_id);
1712 let self_ty = if let Some(ty) = opt_self_ty {
1715 let path_str = tcx.def_path_str(trait_def_id);
1717 let def_id = self.item_def_id();
1719 debug!("qpath_to_ty: self.item_def_id()={:?}", def_id);
1721 let parent_def_id = def_id
1722 .and_then(|def_id| {
1723 def_id.as_local().map(|def_id| tcx.hir().local_def_id_to_hir_id(def_id))
1725 .map(|hir_id| tcx.hir().get_parent_did(hir_id).to_def_id());
1727 debug!("qpath_to_ty: parent_def_id={:?}", parent_def_id);
1729 // If the trait in segment is the same as the trait defining the item,
1730 // use the `<Self as ..>` syntax in the error.
1731 let is_part_of_self_trait_constraints = def_id == Some(trait_def_id);
1732 let is_part_of_fn_in_self_trait = parent_def_id == Some(trait_def_id);
1734 let type_name = if is_part_of_self_trait_constraints || is_part_of_fn_in_self_trait {
1740 self.report_ambiguous_associated_type(
1744 item_segment.ident.name,
1746 return tcx.ty_error();
1749 debug!("qpath_to_ty: self_type={:?}", self_ty);
1751 let trait_ref = self.ast_path_to_mono_trait_ref(span, trait_def_id, self_ty, trait_segment);
1753 let item_substs = self.create_substs_for_associated_item(
1761 debug!("qpath_to_ty: trait_ref={:?}", trait_ref);
1763 self.normalize_ty(span, tcx.mk_projection(item_def_id, item_substs))
1766 pub fn prohibit_generics<'a, T: IntoIterator<Item = &'a hir::PathSegment<'a>>>(
1770 let mut has_err = false;
1771 for segment in segments {
1772 let (mut err_for_lt, mut err_for_ty, mut err_for_ct) = (false, false, false);
1773 for arg in segment.args().args {
1774 let (span, kind) = match arg {
1775 hir::GenericArg::Lifetime(lt) => {
1781 (lt.span, "lifetime")
1783 hir::GenericArg::Type(ty) => {
1791 hir::GenericArg::Const(ct) => {
1800 let mut err = struct_span_err!(
1804 "{} arguments are not allowed for this type",
1807 err.span_label(span, format!("{} argument not allowed", kind));
1809 if err_for_lt && err_for_ty && err_for_ct {
1814 // Only emit the first error to avoid overloading the user with error messages.
1815 if let [binding, ..] = segment.args().bindings {
1817 Self::prohibit_assoc_ty_binding(self.tcx(), binding.span);
1823 // FIXME(eddyb, varkor) handle type paths here too, not just value ones.
1824 pub fn def_ids_for_value_path_segments(
1826 segments: &[hir::PathSegment<'_>],
1827 self_ty: Option<Ty<'tcx>>,
1831 // We need to extract the type parameters supplied by the user in
1832 // the path `path`. Due to the current setup, this is a bit of a
1833 // tricky-process; the problem is that resolve only tells us the
1834 // end-point of the path resolution, and not the intermediate steps.
1835 // Luckily, we can (at least for now) deduce the intermediate steps
1836 // just from the end-point.
1838 // There are basically five cases to consider:
1840 // 1. Reference to a constructor of a struct:
1842 // struct Foo<T>(...)
1844 // In this case, the parameters are declared in the type space.
1846 // 2. Reference to a constructor of an enum variant:
1848 // enum E<T> { Foo(...) }
1850 // In this case, the parameters are defined in the type space,
1851 // but may be specified either on the type or the variant.
1853 // 3. Reference to a fn item or a free constant:
1857 // In this case, the path will again always have the form
1858 // `a::b::foo::<T>` where only the final segment should have
1859 // type parameters. However, in this case, those parameters are
1860 // declared on a value, and hence are in the `FnSpace`.
1862 // 4. Reference to a method or an associated constant:
1864 // impl<A> SomeStruct<A> {
1868 // Here we can have a path like
1869 // `a::b::SomeStruct::<A>::foo::<B>`, in which case parameters
1870 // may appear in two places. The penultimate segment,
1871 // `SomeStruct::<A>`, contains parameters in TypeSpace, and the
1872 // final segment, `foo::<B>` contains parameters in fn space.
1874 // The first step then is to categorize the segments appropriately.
1876 let tcx = self.tcx();
1878 assert!(!segments.is_empty());
1879 let last = segments.len() - 1;
1881 let mut path_segs = vec![];
1884 // Case 1. Reference to a struct constructor.
1885 DefKind::Ctor(CtorOf::Struct, ..) => {
1886 // Everything but the final segment should have no
1887 // parameters at all.
1888 let generics = tcx.generics_of(def_id);
1889 // Variant and struct constructors use the
1890 // generics of their parent type definition.
1891 let generics_def_id = generics.parent.unwrap_or(def_id);
1892 path_segs.push(PathSeg(generics_def_id, last));
1895 // Case 2. Reference to a variant constructor.
1896 DefKind::Ctor(CtorOf::Variant, ..) | DefKind::Variant => {
1897 let adt_def = self_ty.map(|t| t.ty_adt_def().unwrap());
1898 let (generics_def_id, index) = if let Some(adt_def) = adt_def {
1899 debug_assert!(adt_def.is_enum());
1901 } else if last >= 1 && segments[last - 1].args.is_some() {
1902 // Everything but the penultimate segment should have no
1903 // parameters at all.
1904 let mut def_id = def_id;
1906 // `DefKind::Ctor` -> `DefKind::Variant`
1907 if let DefKind::Ctor(..) = kind {
1908 def_id = tcx.parent(def_id).unwrap()
1911 // `DefKind::Variant` -> `DefKind::Enum`
1912 let enum_def_id = tcx.parent(def_id).unwrap();
1913 (enum_def_id, last - 1)
1915 // FIXME: lint here recommending `Enum::<...>::Variant` form
1916 // instead of `Enum::Variant::<...>` form.
1918 // Everything but the final segment should have no
1919 // parameters at all.
1920 let generics = tcx.generics_of(def_id);
1921 // Variant and struct constructors use the
1922 // generics of their parent type definition.
1923 (generics.parent.unwrap_or(def_id), last)
1925 path_segs.push(PathSeg(generics_def_id, index));
1928 // Case 3. Reference to a top-level value.
1929 DefKind::Fn | DefKind::Const | DefKind::ConstParam | DefKind::Static => {
1930 path_segs.push(PathSeg(def_id, last));
1933 // Case 4. Reference to a method or associated const.
1934 DefKind::AssocFn | DefKind::AssocConst => {
1935 if segments.len() >= 2 {
1936 let generics = tcx.generics_of(def_id);
1937 path_segs.push(PathSeg(generics.parent.unwrap(), last - 1));
1939 path_segs.push(PathSeg(def_id, last));
1942 kind => bug!("unexpected definition kind {:?} for {:?}", kind, def_id),
1945 debug!("path_segs = {:?}", path_segs);
1950 // Check a type `Path` and convert it to a `Ty`.
1953 opt_self_ty: Option<Ty<'tcx>>,
1954 path: &hir::Path<'_>,
1955 permit_variants: bool,
1957 let tcx = self.tcx();
1960 "res_to_ty(res={:?}, opt_self_ty={:?}, path_segments={:?})",
1961 path.res, opt_self_ty, path.segments
1964 let span = path.span;
1966 Res::Def(DefKind::OpaqueTy, did) => {
1967 // Check for desugared `impl Trait`.
1968 assert!(ty::is_impl_trait_defn(tcx, did).is_none());
1969 let item_segment = path.segments.split_last().unwrap();
1970 self.prohibit_generics(item_segment.1);
1971 let substs = self.ast_path_substs_for_ty(span, did, item_segment.0);
1972 self.normalize_ty(span, tcx.mk_opaque(did, substs))
1979 | DefKind::ForeignTy,
1982 assert_eq!(opt_self_ty, None);
1983 self.prohibit_generics(path.segments.split_last().unwrap().1);
1984 self.ast_path_to_ty(span, did, path.segments.last().unwrap())
1986 Res::Def(kind @ DefKind::Variant, def_id) if permit_variants => {
1987 // Convert "variant type" as if it were a real type.
1988 // The resulting `Ty` is type of the variant's enum for now.
1989 assert_eq!(opt_self_ty, None);
1992 self.def_ids_for_value_path_segments(&path.segments, None, kind, def_id);
1993 let generic_segs: FxHashSet<_> =
1994 path_segs.iter().map(|PathSeg(_, index)| index).collect();
1995 self.prohibit_generics(path.segments.iter().enumerate().filter_map(
1997 if !generic_segs.contains(&index) { Some(seg) } else { None }
2001 let PathSeg(def_id, index) = path_segs.last().unwrap();
2002 self.ast_path_to_ty(span, *def_id, &path.segments[*index])
2004 Res::Def(DefKind::TyParam, def_id) => {
2005 assert_eq!(opt_self_ty, None);
2006 self.prohibit_generics(path.segments);
2008 let hir_id = tcx.hir().local_def_id_to_hir_id(def_id.expect_local());
2009 let item_id = tcx.hir().get_parent_node(hir_id);
2010 let item_def_id = tcx.hir().local_def_id(item_id);
2011 let generics = tcx.generics_of(item_def_id);
2012 let index = generics.param_def_id_to_index[&def_id];
2013 tcx.mk_ty_param(index, tcx.hir().name(hir_id))
2015 Res::SelfTy(Some(_), None) => {
2016 // `Self` in trait or type alias.
2017 assert_eq!(opt_self_ty, None);
2018 self.prohibit_generics(path.segments);
2019 tcx.types.self_param
2021 Res::SelfTy(_, Some((def_id, forbid_generic))) => {
2022 // `Self` in impl (we know the concrete type).
2023 assert_eq!(opt_self_ty, None);
2024 self.prohibit_generics(path.segments);
2025 // Try to evaluate any array length constants.
2026 let normalized_ty = self.normalize_ty(span, tcx.at(span).type_of(def_id));
2027 if forbid_generic && normalized_ty.needs_subst() {
2028 let mut err = tcx.sess.struct_span_err(
2030 "generic `Self` types are currently not permitted in anonymous constants",
2032 if let Some(hir::Node::Item(&hir::Item {
2033 kind: hir::ItemKind::Impl(ref impl_),
2035 })) = tcx.hir().get_if_local(def_id)
2037 err.span_note(impl_.self_ty.span, "not a concrete type");
2045 Res::Def(DefKind::AssocTy, def_id) => {
2046 debug_assert!(path.segments.len() >= 2);
2047 self.prohibit_generics(&path.segments[..path.segments.len() - 2]);
2052 &path.segments[path.segments.len() - 2],
2053 path.segments.last().unwrap(),
2056 Res::PrimTy(prim_ty) => {
2057 assert_eq!(opt_self_ty, None);
2058 self.prohibit_generics(path.segments);
2060 hir::PrimTy::Bool => tcx.types.bool,
2061 hir::PrimTy::Char => tcx.types.char,
2062 hir::PrimTy::Int(it) => tcx.mk_mach_int(ty::int_ty(it)),
2063 hir::PrimTy::Uint(uit) => tcx.mk_mach_uint(ty::uint_ty(uit)),
2064 hir::PrimTy::Float(ft) => tcx.mk_mach_float(ty::float_ty(ft)),
2065 hir::PrimTy::Str => tcx.types.str_,
2069 self.set_tainted_by_errors();
2070 self.tcx().ty_error()
2072 _ => span_bug!(span, "unexpected resolution: {:?}", path.res),
2076 /// Parses the programmer's textual representation of a type into our
2077 /// internal notion of a type.
2078 pub fn ast_ty_to_ty(&self, ast_ty: &hir::Ty<'_>) -> Ty<'tcx> {
2079 self.ast_ty_to_ty_inner(ast_ty, false)
2082 /// Turns a `hir::Ty` into a `Ty`. For diagnostics' purposes we keep track of whether trait
2083 /// objects are borrowed like `&dyn Trait` to avoid emitting redundant errors.
2084 fn ast_ty_to_ty_inner(&self, ast_ty: &hir::Ty<'_>, borrowed: bool) -> Ty<'tcx> {
2085 debug!("ast_ty_to_ty(id={:?}, ast_ty={:?} ty_ty={:?})", ast_ty.hir_id, ast_ty, ast_ty.kind);
2087 let tcx = self.tcx();
2089 let result_ty = match ast_ty.kind {
2090 hir::TyKind::Slice(ref ty) => tcx.mk_slice(self.ast_ty_to_ty(&ty)),
2091 hir::TyKind::Ptr(ref mt) => {
2092 tcx.mk_ptr(ty::TypeAndMut { ty: self.ast_ty_to_ty(&mt.ty), mutbl: mt.mutbl })
2094 hir::TyKind::Rptr(ref region, ref mt) => {
2095 let r = self.ast_region_to_region(region, None);
2096 debug!("ast_ty_to_ty: r={:?}", r);
2097 let t = self.ast_ty_to_ty_inner(&mt.ty, true);
2098 tcx.mk_ref(r, ty::TypeAndMut { ty: t, mutbl: mt.mutbl })
2100 hir::TyKind::Never => tcx.types.never,
2101 hir::TyKind::Tup(ref fields) => {
2102 tcx.mk_tup(fields.iter().map(|t| self.ast_ty_to_ty(&t)))
2104 hir::TyKind::BareFn(ref bf) => {
2105 require_c_abi_if_c_variadic(tcx, &bf.decl, bf.abi, ast_ty.span);
2106 tcx.mk_fn_ptr(self.ty_of_fn(
2110 &hir::Generics::empty(),
2114 hir::TyKind::TraitObject(ref bounds, ref lifetime) => {
2115 self.conv_object_ty_poly_trait_ref(ast_ty.span, bounds, lifetime, borrowed)
2117 hir::TyKind::Path(hir::QPath::Resolved(ref maybe_qself, ref path)) => {
2118 debug!("ast_ty_to_ty: maybe_qself={:?} path={:?}", maybe_qself, path);
2119 let opt_self_ty = maybe_qself.as_ref().map(|qself| self.ast_ty_to_ty(qself));
2120 self.res_to_ty(opt_self_ty, path, false)
2122 hir::TyKind::OpaqueDef(item_id, ref lifetimes) => {
2123 let opaque_ty = tcx.hir().expect_item(item_id.id);
2124 let def_id = tcx.hir().local_def_id(item_id.id).to_def_id();
2126 match opaque_ty.kind {
2127 hir::ItemKind::OpaqueTy(hir::OpaqueTy { impl_trait_fn, .. }) => {
2128 self.impl_trait_ty_to_ty(def_id, lifetimes, impl_trait_fn.is_some())
2130 ref i => bug!("`impl Trait` pointed to non-opaque type?? {:#?}", i),
2133 hir::TyKind::Path(hir::QPath::TypeRelative(ref qself, ref segment)) => {
2134 debug!("ast_ty_to_ty: qself={:?} segment={:?}", qself, segment);
2135 let ty = self.ast_ty_to_ty(qself);
2137 let res = if let hir::TyKind::Path(hir::QPath::Resolved(_, ref path)) = qself.kind {
2142 self.associated_path_to_ty(ast_ty.hir_id, ast_ty.span, ty, res, segment, false)
2143 .map(|(ty, _, _)| ty)
2144 .unwrap_or_else(|_| tcx.ty_error())
2146 hir::TyKind::Path(hir::QPath::LangItem(lang_item, span)) => {
2147 let def_id = tcx.require_lang_item(lang_item, Some(span));
2148 let (substs, _, _) = self.create_substs_for_ast_path(
2152 &hir::PathSegment::invalid(),
2153 &GenericArgs::none(),
2157 self.normalize_ty(span, tcx.at(span).type_of(def_id).subst(tcx, substs))
2159 hir::TyKind::Array(ref ty, ref length) => {
2160 let length_def_id = tcx.hir().local_def_id(length.hir_id);
2161 let length = ty::Const::from_anon_const(tcx, length_def_id);
2162 let array_ty = tcx.mk_ty(ty::Array(self.ast_ty_to_ty(&ty), length));
2163 self.normalize_ty(ast_ty.span, array_ty)
2165 hir::TyKind::Typeof(ref _e) => {
2166 tcx.sess.emit_err(TypeofReservedKeywordUsed { span: ast_ty.span });
2169 hir::TyKind::Infer => {
2170 // Infer also appears as the type of arguments or return
2171 // values in a ExprKind::Closure, or as
2172 // the type of local variables. Both of these cases are
2173 // handled specially and will not descend into this routine.
2174 self.ty_infer(None, ast_ty.span)
2176 hir::TyKind::Err => tcx.ty_error(),
2179 debug!("ast_ty_to_ty: result_ty={:?}", result_ty);
2181 self.record_ty(ast_ty.hir_id, result_ty, ast_ty.span);
2185 pub fn impl_trait_ty_to_ty(
2188 lifetimes: &[hir::GenericArg<'_>],
2189 replace_parent_lifetimes: bool,
2191 debug!("impl_trait_ty_to_ty(def_id={:?}, lifetimes={:?})", def_id, lifetimes);
2192 let tcx = self.tcx();
2194 let generics = tcx.generics_of(def_id);
2196 debug!("impl_trait_ty_to_ty: generics={:?}", generics);
2197 let substs = InternalSubsts::for_item(tcx, def_id, |param, _| {
2198 if let Some(i) = (param.index as usize).checked_sub(generics.parent_count) {
2199 // Our own parameters are the resolved lifetimes.
2201 GenericParamDefKind::Lifetime => {
2202 if let hir::GenericArg::Lifetime(lifetime) = &lifetimes[i] {
2203 self.ast_region_to_region(lifetime, None).into()
2212 // For RPIT (return position impl trait), only lifetimes
2213 // mentioned in the impl Trait predicate are captured by
2214 // the opaque type, so the lifetime parameters from the
2215 // parent item need to be replaced with `'static`.
2217 // For `impl Trait` in the types of statics, constants,
2218 // locals and type aliases. These capture all parent
2219 // lifetimes, so they can use their identity subst.
2220 GenericParamDefKind::Lifetime if replace_parent_lifetimes => {
2221 tcx.lifetimes.re_static.into()
2223 _ => tcx.mk_param_from_def(param),
2227 debug!("impl_trait_ty_to_ty: substs={:?}", substs);
2229 let ty = tcx.mk_opaque(def_id, substs);
2230 debug!("impl_trait_ty_to_ty: {}", ty);
2234 pub fn ty_of_arg(&self, ty: &hir::Ty<'_>, expected_ty: Option<Ty<'tcx>>) -> Ty<'tcx> {
2236 hir::TyKind::Infer if expected_ty.is_some() => {
2237 self.record_ty(ty.hir_id, expected_ty.unwrap(), ty.span);
2238 expected_ty.unwrap()
2240 _ => self.ast_ty_to_ty(ty),
2246 unsafety: hir::Unsafety,
2248 decl: &hir::FnDecl<'_>,
2249 generics: &hir::Generics<'_>,
2250 ident_span: Option<Span>,
2251 ) -> ty::PolyFnSig<'tcx> {
2254 let tcx = self.tcx();
2256 // We proactively collect all the inferred type params to emit a single error per fn def.
2257 let mut visitor = PlaceholderHirTyCollector::default();
2258 for ty in decl.inputs {
2259 visitor.visit_ty(ty);
2261 walk_generics(&mut visitor, generics);
2263 let input_tys = decl.inputs.iter().map(|a| self.ty_of_arg(a, None));
2264 let output_ty = match decl.output {
2265 hir::FnRetTy::Return(ref output) => {
2266 visitor.visit_ty(output);
2267 self.ast_ty_to_ty(output)
2269 hir::FnRetTy::DefaultReturn(..) => tcx.mk_unit(),
2272 debug!("ty_of_fn: output_ty={:?}", output_ty);
2275 ty::Binder::bind(tcx.mk_fn_sig(input_tys, output_ty, decl.c_variadic, unsafety, abi));
2277 if !self.allow_ty_infer() {
2278 // We always collect the spans for placeholder types when evaluating `fn`s, but we
2279 // only want to emit an error complaining about them if infer types (`_`) are not
2280 // allowed. `allow_ty_infer` gates this behavior. We check for the presence of
2281 // `ident_span` to not emit an error twice when we have `fn foo(_: fn() -> _)`.
2282 crate::collect::placeholder_type_error(
2284 ident_span.map(|sp| sp.shrink_to_hi()),
2285 &generics.params[..],
2291 // Find any late-bound regions declared in return type that do
2292 // not appear in the arguments. These are not well-formed.
2295 // for<'a> fn() -> &'a str <-- 'a is bad
2296 // for<'a> fn(&'a String) -> &'a str <-- 'a is ok
2297 let inputs = bare_fn_ty.inputs();
2298 let late_bound_in_args =
2299 tcx.collect_constrained_late_bound_regions(&inputs.map_bound(|i| i.to_owned()));
2300 let output = bare_fn_ty.output();
2301 let late_bound_in_ret = tcx.collect_referenced_late_bound_regions(&output);
2303 self.validate_late_bound_regions(late_bound_in_args, late_bound_in_ret, |br_name| {
2308 "return type references {}, which is not constrained by the fn input types",
2316 fn validate_late_bound_regions(
2318 constrained_regions: FxHashSet<ty::BoundRegionKind>,
2319 referenced_regions: FxHashSet<ty::BoundRegionKind>,
2320 generate_err: impl Fn(&str) -> rustc_errors::DiagnosticBuilder<'tcx>,
2322 for br in referenced_regions.difference(&constrained_regions) {
2323 let br_name = match *br {
2324 ty::BrNamed(_, name) => format!("lifetime `{}`", name),
2325 ty::BrAnon(_) | ty::BrEnv => "an anonymous lifetime".to_string(),
2328 let mut err = generate_err(&br_name);
2330 if let ty::BrAnon(_) = *br {
2331 // The only way for an anonymous lifetime to wind up
2332 // in the return type but **also** be unconstrained is
2333 // if it only appears in "associated types" in the
2334 // input. See #47511 and #62200 for examples. In this case,
2335 // though we can easily give a hint that ought to be
2338 "lifetimes appearing in an associated type are not considered constrained",
2346 /// Given the bounds on an object, determines what single region bound (if any) we can
2347 /// use to summarize this type. The basic idea is that we will use the bound the user
2348 /// provided, if they provided one, and otherwise search the supertypes of trait bounds
2349 /// for region bounds. It may be that we can derive no bound at all, in which case
2350 /// we return `None`.
2351 fn compute_object_lifetime_bound(
2354 existential_predicates: &'tcx ty::List<ty::Binder<ty::ExistentialPredicate<'tcx>>>,
2355 ) -> Option<ty::Region<'tcx>> // if None, use the default
2357 let tcx = self.tcx();
2359 debug!("compute_opt_region_bound(existential_predicates={:?})", existential_predicates);
2361 // No explicit region bound specified. Therefore, examine trait
2362 // bounds and see if we can derive region bounds from those.
2363 let derived_region_bounds = object_region_bounds(tcx, existential_predicates);
2365 // If there are no derived region bounds, then report back that we
2366 // can find no region bound. The caller will use the default.
2367 if derived_region_bounds.is_empty() {
2371 // If any of the derived region bounds are 'static, that is always
2373 if derived_region_bounds.iter().any(|&r| ty::ReStatic == *r) {
2374 return Some(tcx.lifetimes.re_static);
2377 // Determine whether there is exactly one unique region in the set
2378 // of derived region bounds. If so, use that. Otherwise, report an
2380 let r = derived_region_bounds[0];
2381 if derived_region_bounds[1..].iter().any(|r1| r != *r1) {
2382 tcx.sess.emit_err(AmbiguousLifetimeBound { span });