1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Conversion from AST representation of types to the `ty.rs`
12 //! representation. The main routine here is `ast_ty_to_ty()`: each use
13 //! is parameterized by an instance of `AstConv`.
15 use smallvec::SmallVec;
16 use hir::{self, GenericArg, GenericArgs};
18 use hir::def_id::DefId;
20 use middle::resolve_lifetime as rl;
21 use namespace::Namespace;
22 use rustc::ty::subst::{Kind, Subst, Substs};
24 use rustc::ty::{self, Ty, TyCtxt, ToPredicate, TypeFoldable};
25 use rustc::ty::{GenericParamDef, GenericParamDefKind};
26 use rustc::ty::wf::object_region_bounds;
27 use rustc_target::spec::abi;
28 use std::collections::BTreeSet;
30 use require_c_abi_if_variadic;
31 use util::common::ErrorReported;
32 use util::nodemap::FxHashMap;
33 use errors::{Applicability, FatalError, DiagnosticId};
39 use syntax::feature_gate::{GateIssue, emit_feature_err};
40 use syntax_pos::{Span, MultiSpan};
42 pub trait AstConv<'gcx, 'tcx> {
43 fn tcx<'a>(&'a self) -> TyCtxt<'a, 'gcx, 'tcx>;
45 /// Returns the set of bounds in scope for the type parameter with
47 fn get_type_parameter_bounds(&self, span: Span, def_id: DefId)
48 -> ty::GenericPredicates<'tcx>;
50 /// What lifetime should we use when a lifetime is omitted (and not elided)?
51 fn re_infer(&self, span: Span, _def: Option<&ty::GenericParamDef>)
52 -> Option<ty::Region<'tcx>>;
54 /// What type should we use when a type is omitted?
55 fn ty_infer(&self, span: Span) -> Ty<'tcx>;
57 /// Same as ty_infer, but with a known type parameter definition.
58 fn ty_infer_for_def(&self,
59 _def: &ty::GenericParamDef,
60 span: Span) -> Ty<'tcx> {
64 /// Projecting an associated type from a (potentially)
65 /// higher-ranked trait reference is more complicated, because of
66 /// the possibility of late-bound regions appearing in the
67 /// associated type binding. This is not legal in function
68 /// signatures for that reason. In a function body, we can always
69 /// handle it because we can use inference variables to remove the
70 /// late-bound regions.
71 fn projected_ty_from_poly_trait_ref(&self,
74 poly_trait_ref: ty::PolyTraitRef<'tcx>)
77 /// Normalize an associated type coming from the user.
78 fn normalize_ty(&self, span: Span, ty: Ty<'tcx>) -> Ty<'tcx>;
80 /// Invoked when we encounter an error from some prior pass
81 /// (e.g. resolve) that is translated into a ty-error. This is
82 /// used to help suppress derived errors typeck might otherwise
84 fn set_tainted_by_errors(&self);
86 fn record_ty(&self, hir_id: hir::HirId, ty: Ty<'tcx>, span: Span);
89 struct ConvertedBinding<'tcx> {
90 item_name: ast::Ident,
96 enum GenericArgPosition {
98 Value, // e.g. functions
102 /// Dummy type used for the `Self` of a `TraitRef` created for converting
103 /// a trait object, and which gets removed in `ExistentialTraitRef`.
104 /// This type must not appear anywhere in other converted types.
105 const TRAIT_OBJECT_DUMMY_SELF: ty::TyKind<'static> = ty::Infer(ty::FreshTy(0));
107 impl<'o, 'gcx: 'tcx, 'tcx> dyn AstConv<'gcx, 'tcx>+'o {
108 pub fn ast_region_to_region(&self,
109 lifetime: &hir::Lifetime,
110 def: Option<&ty::GenericParamDef>)
113 let tcx = self.tcx();
114 let lifetime_name = |def_id| {
115 tcx.hir.name(tcx.hir.as_local_node_id(def_id).unwrap()).as_interned_str()
118 let hir_id = tcx.hir.node_to_hir_id(lifetime.id);
119 let r = match tcx.named_region(hir_id) {
120 Some(rl::Region::Static) => {
124 Some(rl::Region::LateBound(debruijn, id, _)) => {
125 let name = lifetime_name(id);
126 tcx.mk_region(ty::ReLateBound(debruijn,
127 ty::BrNamed(id, name)))
130 Some(rl::Region::LateBoundAnon(debruijn, index)) => {
131 tcx.mk_region(ty::ReLateBound(debruijn, ty::BrAnon(index)))
134 Some(rl::Region::EarlyBound(index, id, _)) => {
135 let name = lifetime_name(id);
136 tcx.mk_region(ty::ReEarlyBound(ty::EarlyBoundRegion {
143 Some(rl::Region::Free(scope, id)) => {
144 let name = lifetime_name(id);
145 tcx.mk_region(ty::ReFree(ty::FreeRegion {
147 bound_region: ty::BrNamed(id, name)
150 // (*) -- not late-bound, won't change
154 self.re_infer(lifetime.span, def)
156 // This indicates an illegal lifetime
157 // elision. `resolve_lifetime` should have
158 // reported an error in this case -- but if
159 // not, let's error out.
160 tcx.sess.delay_span_bug(lifetime.span, "unelided lifetime in signature");
162 // Supply some dummy value. We don't have an
163 // `re_error`, annoyingly, so use `'static`.
169 debug!("ast_region_to_region(lifetime={:?}) yields {:?}",
176 /// Given a path `path` that refers to an item `I` with the declared generics `decl_generics`,
177 /// returns an appropriate set of substitutions for this particular reference to `I`.
178 pub fn ast_path_substs_for_ty(&self,
181 item_segment: &hir::PathSegment)
182 -> &'tcx Substs<'tcx>
184 let (substs, assoc_bindings) = item_segment.with_generic_args(|generic_args| {
185 self.create_substs_for_ast_path(
189 item_segment.infer_types,
194 assoc_bindings.first().map(|b| Self::prohibit_assoc_ty_binding(self.tcx(), b.span));
199 /// Report error if there is an explicit type parameter when using `impl Trait`.
203 seg: &hir::PathSegment,
204 generics: &ty::Generics,
206 let explicit = !seg.infer_types;
207 let impl_trait = generics.params.iter().any(|param| match param.kind {
208 ty::GenericParamDefKind::Type {
209 synthetic: Some(hir::SyntheticTyParamKind::ImplTrait), ..
214 if explicit && impl_trait {
215 let mut err = struct_span_err! {
219 "cannot provide explicit type parameters when `impl Trait` is \
220 used in argument position."
229 /// Check that the correct number of generic arguments have been provided.
230 /// Used specifically for function calls.
231 pub fn check_generic_arg_count_for_call(
235 seg: &hir::PathSegment,
236 is_method_call: bool,
238 let empty_args = P(hir::GenericArgs {
239 args: HirVec::new(), bindings: HirVec::new(), parenthesized: false,
241 let suppress_mismatch = Self::check_impl_trait(tcx, span, seg, &def);
242 Self::check_generic_arg_count(
246 if let Some(ref args) = seg.args {
252 GenericArgPosition::MethodCall
254 GenericArgPosition::Value
256 def.parent.is_none() && def.has_self, // `has_self`
257 seg.infer_types || suppress_mismatch, // `infer_types`
261 /// Check that the correct number of generic arguments have been provided.
262 /// This is used both for datatypes and function calls.
263 fn check_generic_arg_count(
267 args: &hir::GenericArgs,
268 position: GenericArgPosition,
272 // At this stage we are guaranteed that the generic arguments are in the correct order, e.g.
273 // that lifetimes will proceed types. So it suffices to check the number of each generic
274 // arguments in order to validate them with respect to the generic parameters.
275 let param_counts = def.own_counts();
276 let arg_counts = args.own_counts();
277 let infer_lifetimes = position != GenericArgPosition::Type && arg_counts.lifetimes == 0;
279 let mut defaults: ty::GenericParamCount = Default::default();
280 for param in &def.params {
282 GenericParamDefKind::Lifetime => {}
283 GenericParamDefKind::Type { has_default, .. } => {
284 defaults.types += has_default as usize
289 if position != GenericArgPosition::Type && !args.bindings.is_empty() {
290 AstConv::prohibit_assoc_ty_binding(tcx, args.bindings[0].span);
293 // Prohibit explicit lifetime arguments if late-bound lifetime parameters are present.
294 if !infer_lifetimes {
295 if let Some(span_late) = def.has_late_bound_regions {
296 let msg = "cannot specify lifetime arguments explicitly \
297 if late bound lifetime parameters are present";
298 let note = "the late bound lifetime parameter is introduced here";
299 let span = args.args[0].span();
300 if position == GenericArgPosition::Value
301 && arg_counts.lifetimes != param_counts.lifetimes {
302 let mut err = tcx.sess.struct_span_err(span, msg);
303 err.span_note(span_late, note);
307 let mut multispan = MultiSpan::from_span(span);
308 multispan.push_span_label(span_late, note.to_string());
309 tcx.lint_node(lint::builtin::LATE_BOUND_LIFETIME_ARGUMENTS,
310 args.args[0].id(), multispan, msg);
316 let check_kind_count = |kind,
321 // We enforce the following: `required` <= `provided` <= `permitted`.
322 // For kinds without defaults (i.e. lifetimes), `required == permitted`.
323 // For other kinds (i.e. types), `permitted` may be greater than `required`.
324 if required <= provided && provided <= permitted {
328 // Unfortunately lifetime and type parameter mismatches are typically styled
329 // differently in diagnostics, which means we have a few cases to consider here.
330 let (bound, quantifier) = if required != permitted {
331 if provided < required {
332 (required, "at least ")
333 } else { // provided > permitted
334 (permitted, "at most ")
341 let label = if required == permitted && provided > permitted {
342 let diff = provided - permitted;
344 // In the case when the user has provided too many arguments,
345 // we want to point to the first unexpected argument.
346 let first_superfluous_arg: &GenericArg = &args.args[offset + permitted];
347 span = first_superfluous_arg.span();
350 "{}unexpected {} argument{}",
351 if diff != 1 { format!("{} ", diff) } else { String::new() },
353 if diff != 1 { "s" } else { "" },
357 "expected {}{} {} argument{}",
361 if bound != 1 { "s" } else { "" },
365 tcx.sess.struct_span_err_with_code(
368 "wrong number of {} arguments: expected {}{}, found {}",
374 DiagnosticId::Error("E0107".into())
375 ).span_label(span, label).emit();
377 provided > required // `suppress_error`
380 if !infer_lifetimes || arg_counts.lifetimes > param_counts.lifetimes {
383 param_counts.lifetimes,
384 param_counts.lifetimes,
385 arg_counts.lifetimes,
390 || arg_counts.types > param_counts.types - defaults.types - has_self as usize {
393 param_counts.types - defaults.types - has_self as usize,
394 param_counts.types - has_self as usize,
396 arg_counts.lifetimes,
403 /// Creates the relevant generic argument substitutions
404 /// corresponding to a set of generic parameters. This is a
405 /// rather complex little function. Let me try to explain the
406 /// role of each of its parameters:
408 /// To start, we are given the `def_id` of the thing we are
409 /// creating the substitutions for, and a partial set of
410 /// substitutions `parent_substs`. In general, the substitutions
411 /// for an item begin with substitutions for all the "parents" of
412 /// that item -- so e.g. for a method it might include the
413 /// parameters from the impl.
415 /// Therefore, the method begins by walking down these parents,
416 /// starting with the outermost parent and proceed inwards until
417 /// it reaches `def_id`. For each parent P, it will check `parent_substs`
418 /// first to see if the parent's substitutions are listed in there. If so,
419 /// we can append those and move on. Otherwise, it invokes the
420 /// three callback functions:
422 /// - `args_for_def_id`: given the def-id P, supplies back the
423 /// generic arguments that were given to that parent from within
424 /// the path; so e.g. if you have `<T as Foo>::Bar`, the def-id
425 /// might refer to the trait `Foo`, and the arguments might be
426 /// `[T]`. The boolean value indicates whether to infer values
427 /// for arguments whose values were not explicitly provided.
428 /// - `provided_kind`: given the generic parameter and the value from `args_for_def_id`,
429 /// instantiate a `Kind`
430 /// - `inferred_kind`: if no parameter was provided, and inference is enabled, then
431 /// creates a suitable inference variable.
432 pub fn create_substs_for_generic_args<'a, 'b>(
433 tcx: TyCtxt<'a, 'gcx, 'tcx>,
435 parent_substs: &[Kind<'tcx>],
437 self_ty: Option<Ty<'tcx>>,
438 args_for_def_id: impl Fn(DefId) -> (Option<&'b GenericArgs>, bool),
439 provided_kind: impl Fn(&GenericParamDef, &GenericArg) -> Kind<'tcx>,
440 inferred_kind: impl Fn(Option<&[Kind<'tcx>]>, &GenericParamDef, bool) -> Kind<'tcx>,
441 ) -> &'tcx Substs<'tcx> {
442 // Collect the segments of the path: we need to substitute arguments
443 // for parameters throughout the entire path (wherever there are
444 // generic parameters).
445 let mut parent_defs = tcx.generics_of(def_id);
446 let count = parent_defs.count();
447 let mut stack = vec![(def_id, parent_defs)];
448 while let Some(def_id) = parent_defs.parent {
449 parent_defs = tcx.generics_of(def_id);
450 stack.push((def_id, parent_defs));
453 // We manually build up the substitution, rather than using convenience
454 // methods in subst.rs so that we can iterate over the arguments and
455 // parameters in lock-step linearly, rather than trying to match each pair.
456 let mut substs: SmallVec<[Kind<'tcx>; 8]> = SmallVec::with_capacity(count);
458 // Iterate over each segment of the path.
459 while let Some((def_id, defs)) = stack.pop() {
460 let mut params = defs.params.iter().peekable();
462 // If we have already computed substitutions for parents, we can use those directly.
463 while let Some(¶m) = params.peek() {
464 if let Some(&kind) = parent_substs.get(param.index as usize) {
472 // (Unless it's been handled in `parent_substs`) `Self` is handled first.
474 if let Some(¶m) = params.peek() {
475 if param.index == 0 {
476 if let GenericParamDefKind::Type { .. } = param.kind {
477 substs.push(self_ty.map(|ty| ty.into())
478 .unwrap_or_else(|| inferred_kind(None, param, true)));
485 // Check whether this segment takes generic arguments and the user has provided any.
486 let (generic_args, infer_types) = args_for_def_id(def_id);
488 let mut args = generic_args.iter().flat_map(|generic_args| generic_args.args.iter())
492 // We're going to iterate through the generic arguments that the user
493 // provided, matching them with the generic parameters we expect.
494 // Mismatches can occur as a result of elided lifetimes, or for malformed
495 // input. We try to handle both sensibly.
496 match (args.peek(), params.peek()) {
497 (Some(&arg), Some(¶m)) => {
498 match (arg, ¶m.kind) {
499 (GenericArg::Lifetime(_), GenericParamDefKind::Lifetime)
500 | (GenericArg::Type(_), GenericParamDefKind::Type { .. }) => {
501 substs.push(provided_kind(param, arg));
505 (GenericArg::Lifetime(_), GenericParamDefKind::Type { .. }) => {
506 // We expected a type argument, but got a lifetime
507 // argument. This is an error, but we need to handle it
508 // gracefully so we can report sensible errors. In this
509 // case, we're simply going to infer this argument.
512 (GenericArg::Type(_), GenericParamDefKind::Lifetime) => {
513 // We expected a lifetime argument, but got a type
514 // argument. That means we're inferring the lifetimes.
515 substs.push(inferred_kind(None, param, infer_types));
521 // We should never be able to reach this point with well-formed input.
522 // Getting to this point means the user supplied more arguments than
523 // there are parameters.
526 (None, Some(¶m)) => {
527 // If there are fewer arguments than parameters, it means
528 // we're inferring the remaining arguments.
530 GenericParamDefKind::Lifetime | GenericParamDefKind::Type { .. } => {
531 let kind = inferred_kind(Some(&substs), param, infer_types);
538 (None, None) => break,
543 tcx.intern_substs(&substs)
546 /// Given the type/region arguments provided to some path (along with
547 /// an implicit `Self`, if this is a trait reference) returns the complete
548 /// set of substitutions. This may involve applying defaulted type parameters.
550 /// Note that the type listing given here is *exactly* what the user provided.
551 fn create_substs_for_ast_path(&self,
554 generic_args: &hir::GenericArgs,
556 self_ty: Option<Ty<'tcx>>)
557 -> (&'tcx Substs<'tcx>, Vec<ConvertedBinding<'tcx>>)
559 // If the type is parameterized by this region, then replace this
560 // region with the current anon region binding (in other words,
561 // whatever & would get replaced with).
562 debug!("create_substs_for_ast_path(def_id={:?}, self_ty={:?}, \
564 def_id, self_ty, generic_args);
566 let tcx = self.tcx();
567 let generic_params = tcx.generics_of(def_id);
569 // If a self-type was declared, one should be provided.
570 assert_eq!(generic_params.has_self, self_ty.is_some());
572 let has_self = generic_params.has_self;
573 Self::check_generic_arg_count(
578 GenericArgPosition::Type,
583 let is_object = self_ty.map_or(false, |ty| ty.sty == TRAIT_OBJECT_DUMMY_SELF);
584 let default_needs_object_self = |param: &ty::GenericParamDef| {
585 if let GenericParamDefKind::Type { has_default, .. } = param.kind {
586 if is_object && has_default {
587 if tcx.at(span).type_of(param.def_id).has_self_ty() {
588 // There is no suitable inference default for a type parameter
589 // that references self, in an object type.
598 let substs = Self::create_substs_for_generic_args(
604 // Provide the generic args, and whether types should be inferred.
605 |_| (Some(generic_args), infer_types),
606 // Provide substitutions for parameters for which (valid) arguments have been provided.
608 match (¶m.kind, arg) {
609 (GenericParamDefKind::Lifetime, GenericArg::Lifetime(lt)) => {
610 self.ast_region_to_region(<, Some(param)).into()
612 (GenericParamDefKind::Type { .. }, GenericArg::Type(ty)) => {
613 self.ast_ty_to_ty(&ty).into()
618 // Provide substitutions for parameters for which arguments are inferred.
619 |substs, param, infer_types| {
621 GenericParamDefKind::Lifetime => tcx.types.re_static.into(),
622 GenericParamDefKind::Type { has_default, .. } => {
623 if !infer_types && has_default {
624 // No type parameter provided, but a default exists.
626 // If we are converting an object type, then the
627 // `Self` parameter is unknown. However, some of the
628 // other type parameters may reference `Self` in their
629 // defaults. This will lead to an ICE if we are not
631 if default_needs_object_self(param) {
632 struct_span_err!(tcx.sess, span, E0393,
633 "the type parameter `{}` must be explicitly \
637 format!("missing reference to `{}`", param.name))
638 .note(&format!("because of the default `Self` reference, \
639 type parameters must be specified on object \
644 // This is a default type parameter.
647 tcx.at(span).type_of(param.def_id)
648 .subst_spanned(tcx, substs.unwrap(), Some(span))
651 } else if infer_types {
652 // No type parameters were provided, we can infer all.
653 if !default_needs_object_self(param) {
654 self.ty_infer_for_def(param, span).into()
656 self.ty_infer(span).into()
659 // We've already errored above about the mismatch.
667 let assoc_bindings = generic_args.bindings.iter().map(|binding| {
669 item_name: binding.ident,
670 ty: self.ast_ty_to_ty(&binding.ty),
675 debug!("create_substs_for_ast_path(generic_params={:?}, self_ty={:?}) -> {:?}",
676 generic_params, self_ty, substs);
678 (substs, assoc_bindings)
681 /// Instantiates the path for the given trait reference, assuming that it's
682 /// bound to a valid trait type. Returns the def_id for the defining trait.
683 /// The type _cannot_ be a type other than a trait type.
685 /// If the `projections` argument is `None`, then assoc type bindings like `Foo<T=X>`
686 /// are disallowed. Otherwise, they are pushed onto the vector given.
687 pub fn instantiate_mono_trait_ref(&self,
688 trait_ref: &hir::TraitRef,
690 -> ty::TraitRef<'tcx>
692 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
694 let trait_def_id = self.trait_def_id(trait_ref);
695 self.ast_path_to_mono_trait_ref(trait_ref.path.span,
698 trait_ref.path.segments.last().unwrap())
701 /// Get the DefId of the given trait ref. It _must_ actually be a trait.
702 fn trait_def_id(&self, trait_ref: &hir::TraitRef) -> DefId {
703 let path = &trait_ref.path;
705 Def::Trait(trait_def_id) => trait_def_id,
706 Def::TraitAlias(alias_def_id) => alias_def_id,
714 /// The given `trait_ref` must actually be trait.
715 pub(super) fn instantiate_poly_trait_ref_inner(&self,
716 trait_ref: &hir::TraitRef,
718 poly_projections: &mut Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>,
720 -> ty::PolyTraitRef<'tcx>
722 let trait_def_id = self.trait_def_id(trait_ref);
724 debug!("instantiate_poly_trait_ref({:?}, def_id={:?})", trait_ref, trait_def_id);
726 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
728 let (substs, assoc_bindings) =
729 self.create_substs_for_ast_trait_ref(trait_ref.path.span,
732 trait_ref.path.segments.last().unwrap());
733 let poly_trait_ref = ty::Binder::bind(ty::TraitRef::new(trait_def_id, substs));
735 let mut dup_bindings = FxHashMap::default();
736 poly_projections.extend(assoc_bindings.iter().filter_map(|binding| {
737 // specify type to assert that error was already reported in Err case:
738 let predicate: Result<_, ErrorReported> =
739 self.ast_type_binding_to_poly_projection_predicate(
740 trait_ref.ref_id, poly_trait_ref, binding, speculative, &mut dup_bindings);
741 // ok to ignore Err because ErrorReported (see above)
742 Some((predicate.ok()?, binding.span))
745 debug!("instantiate_poly_trait_ref({:?}, projections={:?}) -> {:?}",
746 trait_ref, poly_projections, poly_trait_ref);
750 pub fn instantiate_poly_trait_ref(&self,
751 poly_trait_ref: &hir::PolyTraitRef,
753 poly_projections: &mut Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>)
754 -> ty::PolyTraitRef<'tcx>
756 self.instantiate_poly_trait_ref_inner(&poly_trait_ref.trait_ref, self_ty,
757 poly_projections, false)
760 fn ast_path_to_mono_trait_ref(&self,
764 trait_segment: &hir::PathSegment)
765 -> ty::TraitRef<'tcx>
767 let (substs, assoc_bindings) =
768 self.create_substs_for_ast_trait_ref(span,
772 assoc_bindings.first().map(|b| AstConv::prohibit_assoc_ty_binding(self.tcx(), b.span));
773 ty::TraitRef::new(trait_def_id, substs)
776 fn create_substs_for_ast_trait_ref(&self,
780 trait_segment: &hir::PathSegment)
781 -> (&'tcx Substs<'tcx>, Vec<ConvertedBinding<'tcx>>)
783 debug!("create_substs_for_ast_trait_ref(trait_segment={:?})",
786 let trait_def = self.tcx().trait_def(trait_def_id);
788 if !self.tcx().features().unboxed_closures &&
789 trait_segment.with_generic_args(|generic_args| generic_args.parenthesized)
790 != trait_def.paren_sugar {
791 // For now, require that parenthetical notation be used only with `Fn()` etc.
792 let msg = if trait_def.paren_sugar {
793 "the precise format of `Fn`-family traits' type parameters is subject to change. \
794 Use parenthetical notation (Fn(Foo, Bar) -> Baz) instead"
796 "parenthetical notation is only stable when used with `Fn`-family traits"
798 emit_feature_err(&self.tcx().sess.parse_sess, "unboxed_closures",
799 span, GateIssue::Language, msg);
802 trait_segment.with_generic_args(|generic_args| {
803 self.create_substs_for_ast_path(span,
806 trait_segment.infer_types,
811 fn trait_defines_associated_type_named(&self,
813 assoc_name: ast::Ident)
816 self.tcx().associated_items(trait_def_id).any(|item| {
817 item.kind == ty::AssociatedKind::Type &&
818 self.tcx().hygienic_eq(assoc_name, item.ident, trait_def_id)
822 fn ast_type_binding_to_poly_projection_predicate(
825 trait_ref: ty::PolyTraitRef<'tcx>,
826 binding: &ConvertedBinding<'tcx>,
828 dup_bindings: &mut FxHashMap<DefId, Span>)
829 -> Result<ty::PolyProjectionPredicate<'tcx>, ErrorReported>
831 let tcx = self.tcx();
834 // Given something like `U : SomeTrait<T=X>`, we want to produce a
835 // predicate like `<U as SomeTrait>::T = X`. This is somewhat
836 // subtle in the event that `T` is defined in a supertrait of
837 // `SomeTrait`, because in that case we need to upcast.
839 // That is, consider this case:
842 // trait SubTrait : SuperTrait<int> { }
843 // trait SuperTrait<A> { type T; }
845 // ... B : SubTrait<T=foo> ...
848 // We want to produce `<B as SuperTrait<int>>::T == foo`.
850 // Find any late-bound regions declared in `ty` that are not
851 // declared in the trait-ref. These are not wellformed.
855 // for<'a> <T as Iterator>::Item = &'a str // <-- 'a is bad
856 // for<'a> <T as FnMut<(&'a u32,)>>::Output = &'a str // <-- 'a is ok
857 let late_bound_in_trait_ref = tcx.collect_constrained_late_bound_regions(&trait_ref);
858 let late_bound_in_ty =
859 tcx.collect_referenced_late_bound_regions(&ty::Binder::bind(binding.ty));
860 debug!("late_bound_in_trait_ref = {:?}", late_bound_in_trait_ref);
861 debug!("late_bound_in_ty = {:?}", late_bound_in_ty);
862 for br in late_bound_in_ty.difference(&late_bound_in_trait_ref) {
863 let br_name = match *br {
864 ty::BrNamed(_, name) => name,
868 "anonymous bound region {:?} in binding but not trait ref",
872 struct_span_err!(tcx.sess,
875 "binding for associated type `{}` references lifetime `{}`, \
876 which does not appear in the trait input types",
877 binding.item_name, br_name)
882 let candidate = if self.trait_defines_associated_type_named(trait_ref.def_id(),
884 // Simple case: X is defined in the current trait.
887 // Otherwise, we have to walk through the supertraits to find
889 let candidates = traits::supertraits(tcx, trait_ref).filter(|r| {
890 self.trait_defines_associated_type_named(r.def_id(), binding.item_name)
892 self.one_bound_for_assoc_type(candidates, &trait_ref.to_string(),
893 binding.item_name, binding.span)
896 let (assoc_ident, def_scope) =
897 tcx.adjust_ident(binding.item_name, candidate.def_id(), ref_id);
898 let assoc_ty = tcx.associated_items(candidate.def_id()).find(|i| {
899 i.kind == ty::AssociatedKind::Type && i.ident.modern() == assoc_ident
900 }).expect("missing associated type");
902 if !assoc_ty.vis.is_accessible_from(def_scope, tcx) {
903 let msg = format!("associated type `{}` is private", binding.item_name);
904 tcx.sess.span_err(binding.span, &msg);
906 tcx.check_stability(assoc_ty.def_id, Some(ref_id), binding.span);
909 dup_bindings.entry(assoc_ty.def_id)
910 .and_modify(|prev_span| {
911 let mut err = self.tcx().struct_span_lint_node(
912 ::rustc::lint::builtin::DUPLICATE_ASSOCIATED_TYPE_BINDINGS,
915 &format!("associated type binding `{}` specified more than once",
918 err.span_label(binding.span, "used more than once");
919 err.span_label(*prev_span, format!("first use of `{}`", binding.item_name));
922 .or_insert(binding.span);
925 Ok(candidate.map_bound(|trait_ref| {
926 ty::ProjectionPredicate {
927 projection_ty: ty::ProjectionTy::from_ref_and_name(
937 fn ast_path_to_ty(&self,
940 item_segment: &hir::PathSegment)
943 let substs = self.ast_path_substs_for_ty(span, did, item_segment);
946 self.tcx().at(span).type_of(did).subst(self.tcx(), substs)
950 /// Transform a `PolyTraitRef` into a `PolyExistentialTraitRef` by
951 /// removing the dummy `Self` type (`TRAIT_OBJECT_DUMMY_SELF`).
952 fn trait_ref_to_existential(&self, trait_ref: ty::TraitRef<'tcx>)
953 -> ty::ExistentialTraitRef<'tcx> {
954 assert_eq!(trait_ref.self_ty().sty, TRAIT_OBJECT_DUMMY_SELF);
955 ty::ExistentialTraitRef::erase_self_ty(self.tcx(), trait_ref)
958 fn conv_object_ty_poly_trait_ref(&self,
960 trait_bounds: &[hir::PolyTraitRef],
961 lifetime: &hir::Lifetime)
964 let tcx = self.tcx();
966 if trait_bounds.is_empty() {
967 span_err!(tcx.sess, span, E0224,
968 "at least one non-builtin trait is required for an object type");
969 return tcx.types.err;
972 let mut projection_bounds = vec![];
973 let dummy_self = tcx.mk_ty(TRAIT_OBJECT_DUMMY_SELF);
974 let principal = self.instantiate_poly_trait_ref(&trait_bounds[0],
976 &mut projection_bounds);
977 debug!("principal: {:?}", principal);
979 for trait_bound in trait_bounds[1..].iter() {
980 // sanity check for non-principal trait bounds
981 self.instantiate_poly_trait_ref(trait_bound,
986 let (mut auto_traits, trait_bounds) = split_auto_traits(tcx, &trait_bounds[1..]);
988 if !trait_bounds.is_empty() {
989 let b = &trait_bounds[0];
990 let span = b.trait_ref.path.span;
991 struct_span_err!(self.tcx().sess, span, E0225,
992 "only auto traits can be used as additional traits in a trait object")
993 .span_label(span, "non-auto additional trait")
997 // Erase the dummy_self (TRAIT_OBJECT_DUMMY_SELF) used above.
998 let existential_principal = principal.map_bound(|trait_ref| {
999 self.trait_ref_to_existential(trait_ref)
1001 let existential_projections = projection_bounds.iter().map(|(bound, _)| {
1002 bound.map_bound(|b| {
1003 let trait_ref = self.trait_ref_to_existential(b.projection_ty.trait_ref(tcx));
1004 ty::ExistentialProjection {
1006 item_def_id: b.projection_ty.item_def_id,
1007 substs: trait_ref.substs,
1012 // Check that there are no gross object safety violations;
1013 // most importantly, that the supertraits don't contain Self,
1015 let object_safety_violations =
1016 tcx.global_tcx().astconv_object_safety_violations(principal.def_id());
1017 if !object_safety_violations.is_empty() {
1018 tcx.report_object_safety_error(
1019 span, principal.def_id(), object_safety_violations)
1021 return tcx.types.err;
1024 // Use a BTreeSet to keep output in a more consistent order.
1025 let mut associated_types = BTreeSet::default();
1027 for tr in traits::supertraits(tcx, principal) {
1028 associated_types.extend(tcx.associated_items(tr.def_id())
1029 .filter(|item| item.kind == ty::AssociatedKind::Type)
1030 .map(|item| item.def_id));
1033 for (projection_bound, _) in &projection_bounds {
1034 associated_types.remove(&projection_bound.projection_def_id());
1037 for item_def_id in associated_types {
1038 let assoc_item = tcx.associated_item(item_def_id);
1039 let trait_def_id = assoc_item.container.id();
1040 struct_span_err!(tcx.sess, span, E0191, "the value of the associated type `{}` \
1041 (from the trait `{}`) must be specified",
1043 tcx.item_path_str(trait_def_id))
1044 .span_label(span, format!("missing associated type `{}` value",
1049 // Dedup auto traits so that `dyn Trait + Send + Send` is the same as `dyn Trait + Send`.
1051 auto_traits.dedup();
1053 // skip_binder is okay, because the predicates are re-bound.
1055 iter::once(ty::ExistentialPredicate::Trait(*existential_principal.skip_binder()))
1056 .chain(auto_traits.into_iter().map(ty::ExistentialPredicate::AutoTrait))
1057 .chain(existential_projections
1058 .map(|x| ty::ExistentialPredicate::Projection(*x.skip_binder())))
1059 .collect::<SmallVec<[_; 8]>>();
1060 v.sort_by(|a, b| a.stable_cmp(tcx, b));
1061 let existential_predicates = ty::Binder::bind(tcx.mk_existential_predicates(v.into_iter()));
1063 // Use explicitly-specified region bound.
1064 let region_bound = if !lifetime.is_elided() {
1065 self.ast_region_to_region(lifetime, None)
1067 self.compute_object_lifetime_bound(span, existential_predicates).unwrap_or_else(|| {
1068 let hir_id = tcx.hir.node_to_hir_id(lifetime.id);
1069 if tcx.named_region(hir_id).is_some() {
1070 self.ast_region_to_region(lifetime, None)
1072 self.re_infer(span, None).unwrap_or_else(|| {
1073 span_err!(tcx.sess, span, E0228,
1074 "the lifetime bound for this object type cannot be deduced \
1075 from context; please supply an explicit bound");
1082 debug!("region_bound: {:?}", region_bound);
1084 let ty = tcx.mk_dynamic(existential_predicates, region_bound);
1085 debug!("trait_object_type: {:?}", ty);
1089 fn report_ambiguous_associated_type(&self,
1094 struct_span_err!(self.tcx().sess, span, E0223, "ambiguous associated type")
1095 .span_suggestion_with_applicability(
1097 "use fully-qualified syntax",
1098 format!("<{} as {}>::{}", type_str, trait_str, name),
1099 Applicability::HasPlaceholders
1103 // Search for a bound on a type parameter which includes the associated item
1104 // given by `assoc_name`. `ty_param_def_id` is the `DefId` for the type parameter
1105 // This function will fail if there are no suitable bounds or there is
1107 fn find_bound_for_assoc_item(&self,
1108 ty_param_def_id: DefId,
1109 assoc_name: ast::Ident,
1111 -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
1113 let tcx = self.tcx();
1115 let bounds = self.get_type_parameter_bounds(span, ty_param_def_id)
1116 .predicates.into_iter().filter_map(|(p, _)| p.to_opt_poly_trait_ref());
1118 // Check that there is exactly one way to find an associated type with the
1120 let suitable_bounds = traits::transitive_bounds(tcx, bounds)
1121 .filter(|b| self.trait_defines_associated_type_named(b.def_id(), assoc_name));
1123 let param_node_id = tcx.hir.as_local_node_id(ty_param_def_id).unwrap();
1124 let param_name = tcx.hir.ty_param_name(param_node_id);
1125 self.one_bound_for_assoc_type(suitable_bounds,
1126 ¶m_name.as_str(),
1132 // Checks that bounds contains exactly one element and reports appropriate
1133 // errors otherwise.
1134 fn one_bound_for_assoc_type<I>(&self,
1136 ty_param_name: &str,
1137 assoc_name: ast::Ident,
1139 -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
1140 where I: Iterator<Item=ty::PolyTraitRef<'tcx>>
1142 let bound = match bounds.next() {
1143 Some(bound) => bound,
1145 struct_span_err!(self.tcx().sess, span, E0220,
1146 "associated type `{}` not found for `{}`",
1149 .span_label(span, format!("associated type `{}` not found", assoc_name))
1151 return Err(ErrorReported);
1155 if let Some(bound2) = bounds.next() {
1156 let bounds = iter::once(bound).chain(iter::once(bound2)).chain(bounds);
1157 let mut err = struct_span_err!(
1158 self.tcx().sess, span, E0221,
1159 "ambiguous associated type `{}` in bounds of `{}`",
1162 err.span_label(span, format!("ambiguous associated type `{}`", assoc_name));
1164 for bound in bounds {
1165 let bound_span = self.tcx().associated_items(bound.def_id()).find(|item| {
1166 item.kind == ty::AssociatedKind::Type &&
1167 self.tcx().hygienic_eq(assoc_name, item.ident, bound.def_id())
1169 .and_then(|item| self.tcx().hir.span_if_local(item.def_id));
1171 if let Some(span) = bound_span {
1172 err.span_label(span, format!("ambiguous `{}` from `{}`",
1176 span_note!(&mut err, span,
1177 "associated type `{}` could derive from `{}`",
1188 // Create a type from a path to an associated type.
1189 // For a path A::B::C::D, ty and ty_path_def are the type and def for A::B::C
1190 // and item_segment is the path segment for D. We return a type and a def for
1192 // Will fail except for T::A and Self::A; i.e., if ty/ty_path_def are not a type
1193 // parameter or Self.
1194 pub fn associated_path_def_to_ty(&self,
1195 ref_id: ast::NodeId,
1199 item_segment: &hir::PathSegment)
1202 let tcx = self.tcx();
1203 let assoc_name = item_segment.ident;
1205 debug!("associated_path_def_to_ty: {:?}::{}", ty, assoc_name);
1207 self.prohibit_generics(slice::from_ref(item_segment));
1209 // Find the type of the associated item, and the trait where the associated
1210 // item is declared.
1211 let bound = match (&ty.sty, ty_path_def) {
1212 (_, Def::SelfTy(Some(_), Some(impl_def_id))) => {
1213 // `Self` in an impl of a trait - we have a concrete self type and a
1215 let trait_ref = match tcx.impl_trait_ref(impl_def_id) {
1216 Some(trait_ref) => trait_ref,
1218 // A cycle error occurred, most likely.
1219 return (tcx.types.err, Def::Err);
1223 let candidates = traits::supertraits(tcx, ty::Binder::bind(trait_ref))
1224 .filter(|r| self.trait_defines_associated_type_named(r.def_id(), assoc_name));
1226 match self.one_bound_for_assoc_type(candidates, "Self", assoc_name, span) {
1228 Err(ErrorReported) => return (tcx.types.err, Def::Err),
1231 (&ty::Param(_), Def::SelfTy(Some(param_did), None)) |
1232 (&ty::Param(_), Def::TyParam(param_did)) => {
1233 match self.find_bound_for_assoc_item(param_did, assoc_name, span) {
1235 Err(ErrorReported) => return (tcx.types.err, Def::Err),
1239 // Don't print TyErr to the user.
1240 if !ty.references_error() {
1241 self.report_ambiguous_associated_type(span,
1244 &assoc_name.as_str());
1246 return (tcx.types.err, Def::Err);
1250 let trait_did = bound.def_id();
1251 let (assoc_ident, def_scope) = tcx.adjust_ident(assoc_name, trait_did, ref_id);
1252 let item = tcx.associated_items(trait_did).find(|i| {
1253 Namespace::from(i.kind) == Namespace::Type &&
1254 i.ident.modern() == assoc_ident
1256 .expect("missing associated type");
1258 let ty = self.projected_ty_from_poly_trait_ref(span, item.def_id, bound);
1259 let ty = self.normalize_ty(span, ty);
1261 let def = Def::AssociatedTy(item.def_id);
1262 if !item.vis.is_accessible_from(def_scope, tcx) {
1263 let msg = format!("{} `{}` is private", def.kind_name(), assoc_name);
1264 tcx.sess.span_err(span, &msg);
1266 tcx.check_stability(item.def_id, Some(ref_id), span);
1271 fn qpath_to_ty(&self,
1273 opt_self_ty: Option<Ty<'tcx>>,
1275 trait_segment: &hir::PathSegment,
1276 item_segment: &hir::PathSegment)
1279 let tcx = self.tcx();
1280 let trait_def_id = tcx.parent_def_id(item_def_id).unwrap();
1282 self.prohibit_generics(slice::from_ref(item_segment));
1284 let self_ty = if let Some(ty) = opt_self_ty {
1287 let path_str = tcx.item_path_str(trait_def_id);
1288 self.report_ambiguous_associated_type(span,
1291 &item_segment.ident.as_str());
1292 return tcx.types.err;
1295 debug!("qpath_to_ty: self_type={:?}", self_ty);
1297 let trait_ref = self.ast_path_to_mono_trait_ref(span,
1302 debug!("qpath_to_ty: trait_ref={:?}", trait_ref);
1304 self.normalize_ty(span, tcx.mk_projection(item_def_id, trait_ref.substs))
1307 pub fn prohibit_generics<'a, T: IntoIterator<Item = &'a hir::PathSegment>>(&self, segments: T) {
1308 for segment in segments {
1309 segment.with_generic_args(|generic_args| {
1310 let (mut err_for_lt, mut err_for_ty) = (false, false);
1311 for arg in &generic_args.args {
1312 let (mut span_err, span, kind) = match arg {
1313 hir::GenericArg::Lifetime(lt) => {
1314 if err_for_lt { continue }
1316 (struct_span_err!(self.tcx().sess, lt.span, E0110,
1317 "lifetime parameters are not allowed on this type"),
1321 hir::GenericArg::Type(ty) => {
1322 if err_for_ty { continue }
1324 (struct_span_err!(self.tcx().sess, ty.span, E0109,
1325 "type parameters are not allowed on this type"),
1330 span_err.span_label(span, format!("{} parameter not allowed", kind))
1332 if err_for_lt && err_for_ty {
1336 for binding in &generic_args.bindings {
1337 Self::prohibit_assoc_ty_binding(self.tcx(), binding.span);
1344 pub fn prohibit_assoc_ty_binding(tcx: TyCtxt, span: Span) {
1345 let mut err = struct_span_err!(tcx.sess, span, E0229,
1346 "associated type bindings are not allowed here");
1347 err.span_label(span, "associated type not allowed here").emit();
1350 // Check a type `Path` and convert it to a `Ty`.
1351 pub fn def_to_ty(&self,
1352 opt_self_ty: Option<Ty<'tcx>>,
1354 permit_variants: bool)
1356 let tcx = self.tcx();
1358 debug!("def_to_ty(def={:?}, opt_self_ty={:?}, path_segments={:?})",
1359 path.def, opt_self_ty, path.segments);
1361 let span = path.span;
1363 Def::Existential(did) => {
1364 // check for desugared impl trait
1365 assert!(ty::is_impl_trait_defn(tcx, did).is_none());
1366 let item_segment = path.segments.split_last().unwrap();
1367 self.prohibit_generics(item_segment.1);
1368 let substs = self.ast_path_substs_for_ty(span, did, item_segment.0);
1371 tcx.mk_opaque(did, substs),
1374 Def::Enum(did) | Def::TyAlias(did) | Def::Struct(did) |
1375 Def::Union(did) | Def::ForeignTy(did) => {
1376 assert_eq!(opt_self_ty, None);
1377 self.prohibit_generics(path.segments.split_last().unwrap().1);
1378 self.ast_path_to_ty(span, did, path.segments.last().unwrap())
1380 Def::Variant(did) if permit_variants => {
1381 // Convert "variant type" as if it were a real type.
1382 // The resulting `Ty` is type of the variant's enum for now.
1383 assert_eq!(opt_self_ty, None);
1384 self.prohibit_generics(path.segments.split_last().unwrap().1);
1385 self.ast_path_to_ty(span,
1386 tcx.parent_def_id(did).unwrap(),
1387 path.segments.last().unwrap())
1389 Def::TyParam(did) => {
1390 assert_eq!(opt_self_ty, None);
1391 self.prohibit_generics(&path.segments);
1393 let node_id = tcx.hir.as_local_node_id(did).unwrap();
1394 let item_id = tcx.hir.get_parent_node(node_id);
1395 let item_def_id = tcx.hir.local_def_id(item_id);
1396 let generics = tcx.generics_of(item_def_id);
1397 let index = generics.param_def_id_to_index[&tcx.hir.local_def_id(node_id)];
1398 tcx.mk_ty_param(index, tcx.hir.name(node_id).as_interned_str())
1400 Def::SelfTy(_, Some(def_id)) => {
1401 // Self in impl (we know the concrete type).
1403 assert_eq!(opt_self_ty, None);
1404 self.prohibit_generics(&path.segments);
1406 tcx.at(span).type_of(def_id)
1408 Def::SelfTy(Some(_), None) => {
1410 assert_eq!(opt_self_ty, None);
1411 self.prohibit_generics(&path.segments);
1414 Def::AssociatedTy(def_id) => {
1415 self.prohibit_generics(&path.segments[..path.segments.len()-2]);
1416 self.qpath_to_ty(span,
1419 &path.segments[path.segments.len()-2],
1420 path.segments.last().unwrap())
1422 Def::PrimTy(prim_ty) => {
1423 assert_eq!(opt_self_ty, None);
1424 self.prohibit_generics(&path.segments);
1426 hir::Bool => tcx.types.bool,
1427 hir::Char => tcx.types.char,
1428 hir::Int(it) => tcx.mk_mach_int(it),
1429 hir::Uint(uit) => tcx.mk_mach_uint(uit),
1430 hir::Float(ft) => tcx.mk_mach_float(ft),
1431 hir::Str => tcx.mk_str()
1435 self.set_tainted_by_errors();
1436 return self.tcx().types.err;
1438 _ => span_bug!(span, "unexpected definition: {:?}", path.def)
1442 /// Parses the programmer's textual representation of a type into our
1443 /// internal notion of a type.
1444 pub fn ast_ty_to_ty(&self, ast_ty: &hir::Ty) -> Ty<'tcx> {
1445 debug!("ast_ty_to_ty(id={:?}, ast_ty={:?} ty_ty={:?})",
1446 ast_ty.id, ast_ty, ast_ty.node);
1448 let tcx = self.tcx();
1450 let result_ty = match ast_ty.node {
1451 hir::TyKind::Slice(ref ty) => {
1452 tcx.mk_slice(self.ast_ty_to_ty(&ty))
1454 hir::TyKind::Ptr(ref mt) => {
1455 tcx.mk_ptr(ty::TypeAndMut {
1456 ty: self.ast_ty_to_ty(&mt.ty),
1460 hir::TyKind::Rptr(ref region, ref mt) => {
1461 let r = self.ast_region_to_region(region, None);
1462 debug!("Ref r={:?}", r);
1463 let t = self.ast_ty_to_ty(&mt.ty);
1464 tcx.mk_ref(r, ty::TypeAndMut {ty: t, mutbl: mt.mutbl})
1466 hir::TyKind::Never => {
1469 hir::TyKind::Tup(ref fields) => {
1470 tcx.mk_tup(fields.iter().map(|t| self.ast_ty_to_ty(&t)))
1472 hir::TyKind::BareFn(ref bf) => {
1473 require_c_abi_if_variadic(tcx, &bf.decl, bf.abi, ast_ty.span);
1474 tcx.mk_fn_ptr(self.ty_of_fn(bf.unsafety, bf.abi, &bf.decl))
1476 hir::TyKind::TraitObject(ref bounds, ref lifetime) => {
1477 self.conv_object_ty_poly_trait_ref(ast_ty.span, bounds, lifetime)
1479 hir::TyKind::Path(hir::QPath::Resolved(ref maybe_qself, ref path)) => {
1480 debug!("ast_ty_to_ty: maybe_qself={:?} path={:?}", maybe_qself, path);
1481 let opt_self_ty = maybe_qself.as_ref().map(|qself| {
1482 self.ast_ty_to_ty(qself)
1484 self.def_to_ty(opt_self_ty, path, false)
1486 hir::TyKind::Def(item_id, ref lifetimes) => {
1487 let did = tcx.hir.local_def_id(item_id.id);
1488 self.impl_trait_ty_to_ty(did, lifetimes)
1490 hir::TyKind::Path(hir::QPath::TypeRelative(ref qself, ref segment)) => {
1491 debug!("ast_ty_to_ty: qself={:?} segment={:?}", qself, segment);
1492 let ty = self.ast_ty_to_ty(qself);
1494 let def = if let hir::TyKind::Path(hir::QPath::Resolved(_, ref path)) = qself.node {
1499 self.associated_path_def_to_ty(ast_ty.id, ast_ty.span, ty, def, segment).0
1501 hir::TyKind::Array(ref ty, ref length) => {
1502 let length_def_id = tcx.hir.local_def_id(length.id);
1503 let substs = Substs::identity_for_item(tcx, length_def_id);
1504 let length = ty::Const::unevaluated(tcx, length_def_id, substs, tcx.types.usize);
1505 let array_ty = tcx.mk_ty(ty::Array(self.ast_ty_to_ty(&ty), length));
1506 self.normalize_ty(ast_ty.span, array_ty)
1508 hir::TyKind::Typeof(ref _e) => {
1509 struct_span_err!(tcx.sess, ast_ty.span, E0516,
1510 "`typeof` is a reserved keyword but unimplemented")
1511 .span_label(ast_ty.span, "reserved keyword")
1516 hir::TyKind::Infer => {
1517 // Infer also appears as the type of arguments or return
1518 // values in a ExprKind::Closure, or as
1519 // the type of local variables. Both of these cases are
1520 // handled specially and will not descend into this routine.
1521 self.ty_infer(ast_ty.span)
1523 hir::TyKind::Err => {
1528 self.record_ty(ast_ty.hir_id, result_ty, ast_ty.span);
1532 pub fn impl_trait_ty_to_ty(
1535 lifetimes: &[hir::GenericArg],
1537 debug!("impl_trait_ty_to_ty(def_id={:?}, lifetimes={:?})", def_id, lifetimes);
1538 let tcx = self.tcx();
1540 let generics = tcx.generics_of(def_id);
1542 debug!("impl_trait_ty_to_ty: generics={:?}", generics);
1543 let substs = Substs::for_item(tcx, def_id, |param, _| {
1544 if let Some(i) = (param.index as usize).checked_sub(generics.parent_count) {
1545 // Our own parameters are the resolved lifetimes.
1547 GenericParamDefKind::Lifetime => {
1548 if let hir::GenericArg::Lifetime(lifetime) = &lifetimes[i] {
1549 self.ast_region_to_region(lifetime, None).into()
1557 // Replace all parent lifetimes with 'static.
1559 GenericParamDefKind::Lifetime => {
1560 tcx.types.re_static.into()
1562 _ => tcx.mk_param_from_def(param)
1566 debug!("impl_trait_ty_to_ty: final substs = {:?}", substs);
1568 let ty = tcx.mk_opaque(def_id, substs);
1569 debug!("impl_trait_ty_to_ty: {}", ty);
1573 pub fn ty_of_arg(&self,
1575 expected_ty: Option<Ty<'tcx>>)
1579 hir::TyKind::Infer if expected_ty.is_some() => {
1580 self.record_ty(ty.hir_id, expected_ty.unwrap(), ty.span);
1581 expected_ty.unwrap()
1583 _ => self.ast_ty_to_ty(ty),
1587 pub fn ty_of_fn(&self,
1588 unsafety: hir::Unsafety,
1591 -> ty::PolyFnSig<'tcx> {
1594 let tcx = self.tcx();
1596 decl.inputs.iter().map(|a| self.ty_of_arg(a, None));
1598 let output_ty = match decl.output {
1599 hir::Return(ref output) => self.ast_ty_to_ty(output),
1600 hir::DefaultReturn(..) => tcx.mk_unit(),
1603 debug!("ty_of_fn: output_ty={:?}", output_ty);
1605 let bare_fn_ty = ty::Binder::bind(tcx.mk_fn_sig(
1613 // Find any late-bound regions declared in return type that do
1614 // not appear in the arguments. These are not well-formed.
1617 // for<'a> fn() -> &'a str <-- 'a is bad
1618 // for<'a> fn(&'a String) -> &'a str <-- 'a is ok
1619 let inputs = bare_fn_ty.inputs();
1620 let late_bound_in_args = tcx.collect_constrained_late_bound_regions(
1621 &inputs.map_bound(|i| i.to_owned()));
1622 let output = bare_fn_ty.output();
1623 let late_bound_in_ret = tcx.collect_referenced_late_bound_regions(&output);
1624 for br in late_bound_in_ret.difference(&late_bound_in_args) {
1625 let lifetime_name = match *br {
1626 ty::BrNamed(_, name) => format!("lifetime `{}`,", name),
1627 ty::BrAnon(_) | ty::BrFresh(_) | ty::BrEnv => "an anonymous lifetime".to_string(),
1629 let mut err = struct_span_err!(tcx.sess,
1632 "return type references {} \
1633 which is not constrained by the fn input types",
1635 if let ty::BrAnon(_) = *br {
1636 // The only way for an anonymous lifetime to wind up
1637 // in the return type but **also** be unconstrained is
1638 // if it only appears in "associated types" in the
1639 // input. See #47511 for an example. In this case,
1640 // though we can easily give a hint that ought to be
1642 err.note("lifetimes appearing in an associated type \
1643 are not considered constrained");
1651 /// Given the bounds on an object, determines what single region bound (if any) we can
1652 /// use to summarize this type. The basic idea is that we will use the bound the user
1653 /// provided, if they provided one, and otherwise search the supertypes of trait bounds
1654 /// for region bounds. It may be that we can derive no bound at all, in which case
1655 /// we return `None`.
1656 fn compute_object_lifetime_bound(&self,
1658 existential_predicates: ty::Binder<&'tcx ty::List<ty::ExistentialPredicate<'tcx>>>)
1659 -> Option<ty::Region<'tcx>> // if None, use the default
1661 let tcx = self.tcx();
1663 debug!("compute_opt_region_bound(existential_predicates={:?})",
1664 existential_predicates);
1666 // No explicit region bound specified. Therefore, examine trait
1667 // bounds and see if we can derive region bounds from those.
1668 let derived_region_bounds =
1669 object_region_bounds(tcx, existential_predicates);
1671 // If there are no derived region bounds, then report back that we
1672 // can find no region bound. The caller will use the default.
1673 if derived_region_bounds.is_empty() {
1677 // If any of the derived region bounds are 'static, that is always
1679 if derived_region_bounds.iter().any(|&r| ty::ReStatic == *r) {
1680 return Some(tcx.types.re_static);
1683 // Determine whether there is exactly one unique region in the set
1684 // of derived region bounds. If so, use that. Otherwise, report an
1686 let r = derived_region_bounds[0];
1687 if derived_region_bounds[1..].iter().any(|r1| r != *r1) {
1688 span_err!(tcx.sess, span, E0227,
1689 "ambiguous lifetime bound, explicit lifetime bound required");
1695 /// Divides a list of general trait bounds into two groups: auto traits (e.g. Sync and Send) and the
1696 /// remaining general trait bounds.
1697 fn split_auto_traits<'a, 'b, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1698 trait_bounds: &'b [hir::PolyTraitRef])
1699 -> (Vec<DefId>, Vec<&'b hir::PolyTraitRef>)
1701 let (auto_traits, trait_bounds): (Vec<_>, _) = trait_bounds.iter().partition(|bound| {
1702 // Checks whether `trait_did` is an auto trait and adds it to `auto_traits` if so.
1703 match bound.trait_ref.path.def {
1704 Def::Trait(trait_did) if tcx.trait_is_auto(trait_did) => {
1711 let auto_traits = auto_traits.into_iter().map(|tr| {
1712 if let Def::Trait(trait_did) = tr.trait_ref.path.def {
1717 }).collect::<Vec<_>>();
1719 (auto_traits, trait_bounds)
1722 // A helper struct for conveniently grouping a set of bounds which we pass to
1723 // and return from functions in multiple places.
1724 #[derive(PartialEq, Eq, Clone, Debug)]
1725 pub struct Bounds<'tcx> {
1726 pub region_bounds: Vec<(ty::Region<'tcx>, Span)>,
1727 pub implicitly_sized: Option<Span>,
1728 pub trait_bounds: Vec<(ty::PolyTraitRef<'tcx>, Span)>,
1729 pub projection_bounds: Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>,
1732 impl<'a, 'gcx, 'tcx> Bounds<'tcx> {
1733 pub fn predicates(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, param_ty: Ty<'tcx>)
1734 -> Vec<(ty::Predicate<'tcx>, Span)>
1736 // If it could be sized, and is, add the sized predicate
1737 let sized_predicate = self.implicitly_sized.and_then(|span| {
1738 tcx.lang_items().sized_trait().map(|sized| {
1739 let trait_ref = ty::TraitRef {
1741 substs: tcx.mk_substs_trait(param_ty, &[])
1743 (trait_ref.to_predicate(), span)
1747 sized_predicate.into_iter().chain(
1748 self.region_bounds.iter().map(|&(region_bound, span)| {
1749 // account for the binder being introduced below; no need to shift `param_ty`
1750 // because, at present at least, it can only refer to early-bound regions
1751 let region_bound = ty::fold::shift_region(tcx, region_bound, 1);
1752 let outlives = ty::OutlivesPredicate(param_ty, region_bound);
1753 (ty::Binder::dummy(outlives).to_predicate(), span)
1755 self.trait_bounds.iter().map(|&(bound_trait_ref, span)| {
1756 (bound_trait_ref.to_predicate(), span)
1759 self.projection_bounds.iter().map(|&(projection, span)| {
1760 (projection.to_predicate(), span)