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_data_structures::sync::Lrc;
28 use rustc_target::spec::abi;
29 use std::collections::BTreeSet;
31 use require_c_abi_if_variadic;
32 use util::common::ErrorReported;
33 use util::nodemap::FxHashMap;
34 use errors::{Applicability, FatalError, DiagnosticId};
40 use syntax::feature_gate::{GateIssue, emit_feature_err};
41 use syntax_pos::{DUMMY_SP, Span, MultiSpan};
43 pub trait AstConv<'gcx, 'tcx> {
44 fn tcx<'a>(&'a self) -> TyCtxt<'a, 'gcx, 'tcx>;
46 /// Returns the set of bounds in scope for the type parameter with
48 fn get_type_parameter_bounds(&self, span: Span, def_id: DefId)
49 -> Lrc<ty::GenericPredicates<'tcx>>;
51 /// What lifetime should we use when a lifetime is omitted (and not elided)?
52 fn re_infer(&self, span: Span, _def: Option<&ty::GenericParamDef>)
53 -> Option<ty::Region<'tcx>>;
55 /// What type should we use when a type is omitted?
56 fn ty_infer(&self, span: Span) -> Ty<'tcx>;
58 /// Same as ty_infer, but with a known type parameter definition.
59 fn ty_infer_for_def(&self,
60 _def: &ty::GenericParamDef,
61 span: Span) -> Ty<'tcx> {
65 /// Projecting an associated type from a (potentially)
66 /// higher-ranked trait reference is more complicated, because of
67 /// the possibility of late-bound regions appearing in the
68 /// associated type binding. This is not legal in function
69 /// signatures for that reason. In a function body, we can always
70 /// handle it because we can use inference variables to remove the
71 /// late-bound regions.
72 fn projected_ty_from_poly_trait_ref(&self,
75 poly_trait_ref: ty::PolyTraitRef<'tcx>)
78 /// Normalize an associated type coming from the user.
79 fn normalize_ty(&self, span: Span, ty: Ty<'tcx>) -> Ty<'tcx>;
81 /// Invoked when we encounter an error from some prior pass
82 /// (e.g. resolve) that is translated into a ty-error. This is
83 /// used to help suppress derived errors typeck might otherwise
85 fn set_tainted_by_errors(&self);
87 fn record_ty(&self, hir_id: hir::HirId, ty: Ty<'tcx>, span: Span);
90 struct ConvertedBinding<'tcx> {
91 item_name: ast::Ident,
97 enum GenericArgPosition {
99 Value, // e.g. functions
103 /// Dummy type used for the `Self` of a `TraitRef` created for converting
104 /// a trait object, and which gets removed in `ExistentialTraitRef`.
105 /// This type must not appear anywhere in other converted types.
106 const TRAIT_OBJECT_DUMMY_SELF: ty::TyKind<'static> = ty::Infer(ty::FreshTy(0));
108 impl<'o, 'gcx: 'tcx, 'tcx> dyn AstConv<'gcx, 'tcx>+'o {
109 pub fn ast_region_to_region(&self,
110 lifetime: &hir::Lifetime,
111 def: Option<&ty::GenericParamDef>)
114 let tcx = self.tcx();
115 let lifetime_name = |def_id| {
116 tcx.hir.name(tcx.hir.as_local_node_id(def_id).unwrap()).as_interned_str()
119 let hir_id = tcx.hir.node_to_hir_id(lifetime.id);
120 let r = match tcx.named_region(hir_id) {
121 Some(rl::Region::Static) => {
125 Some(rl::Region::LateBound(debruijn, id, _)) => {
126 let name = lifetime_name(id);
127 tcx.mk_region(ty::ReLateBound(debruijn,
128 ty::BrNamed(id, name)))
131 Some(rl::Region::LateBoundAnon(debruijn, index)) => {
132 tcx.mk_region(ty::ReLateBound(debruijn, ty::BrAnon(index)))
135 Some(rl::Region::EarlyBound(index, id, _)) => {
136 let name = lifetime_name(id);
137 tcx.mk_region(ty::ReEarlyBound(ty::EarlyBoundRegion {
144 Some(rl::Region::Free(scope, id)) => {
145 let name = lifetime_name(id);
146 tcx.mk_region(ty::ReFree(ty::FreeRegion {
148 bound_region: ty::BrNamed(id, name)
151 // (*) -- not late-bound, won't change
155 self.re_infer(lifetime.span, def)
157 // This indicates an illegal lifetime
158 // elision. `resolve_lifetime` should have
159 // reported an error in this case -- but if
160 // not, let's error out.
161 tcx.sess.delay_span_bug(lifetime.span, "unelided lifetime in signature");
163 // Supply some dummy value. We don't have an
164 // `re_error`, annoyingly, so use `'static`.
170 debug!("ast_region_to_region(lifetime={:?}) yields {:?}",
177 /// Given a path `path` that refers to an item `I` with the declared generics `decl_generics`,
178 /// returns an appropriate set of substitutions for this particular reference to `I`.
179 pub fn ast_path_substs_for_ty(&self,
182 item_segment: &hir::PathSegment)
183 -> &'tcx Substs<'tcx>
185 let (substs, assoc_bindings, _) = item_segment.with_generic_args(|generic_args| {
186 self.create_substs_for_ast_path(
190 item_segment.infer_types,
195 assoc_bindings.first().map(|b| Self::prohibit_assoc_ty_binding(self.tcx(), b.span));
200 /// Report error if there is an explicit type parameter when using `impl Trait`.
204 seg: &hir::PathSegment,
205 generics: &ty::Generics,
207 let explicit = !seg.infer_types;
208 let impl_trait = generics.params.iter().any(|param| match param.kind {
209 ty::GenericParamDefKind::Type {
210 synthetic: Some(hir::SyntheticTyParamKind::ImplTrait), ..
215 if explicit && impl_trait {
216 let mut err = struct_span_err! {
220 "cannot provide explicit type parameters when `impl Trait` is \
221 used in argument position."
230 /// Check that the correct number of generic arguments have been provided.
231 /// Used specifically for function calls.
232 pub fn check_generic_arg_count_for_call(
236 seg: &hir::PathSegment,
237 is_method_call: bool,
239 let empty_args = P(hir::GenericArgs {
240 args: HirVec::new(), bindings: HirVec::new(), parenthesized: false,
242 let suppress_mismatch = Self::check_impl_trait(tcx, span, seg, &def);
243 Self::check_generic_arg_count(
247 if let Some(ref args) = seg.args {
253 GenericArgPosition::MethodCall
255 GenericArgPosition::Value
257 def.parent.is_none() && def.has_self, // `has_self`
258 seg.infer_types || suppress_mismatch, // `infer_types`
262 /// Check that the correct number of generic arguments have been provided.
263 /// This is used both for datatypes and function calls.
264 fn check_generic_arg_count(
268 args: &hir::GenericArgs,
269 position: GenericArgPosition,
272 ) -> (bool, Option<Vec<Span>>) {
273 // At this stage we are guaranteed that the generic arguments are in the correct order, e.g.
274 // that lifetimes will proceed types. So it suffices to check the number of each generic
275 // arguments in order to validate them with respect to the generic parameters.
276 let param_counts = def.own_counts();
277 let arg_counts = args.own_counts();
278 let infer_lifetimes = position != GenericArgPosition::Type && arg_counts.lifetimes == 0;
280 let mut defaults: ty::GenericParamCount = Default::default();
281 for param in &def.params {
283 GenericParamDefKind::Lifetime => {}
284 GenericParamDefKind::Type { has_default, .. } => {
285 defaults.types += has_default as usize
290 if position != GenericArgPosition::Type && !args.bindings.is_empty() {
291 AstConv::prohibit_assoc_ty_binding(tcx, args.bindings[0].span);
294 // Prohibit explicit lifetime arguments if late-bound lifetime parameters are present.
295 if !infer_lifetimes {
296 if let Some(span_late) = def.has_late_bound_regions {
297 let msg = "cannot specify lifetime arguments explicitly \
298 if late bound lifetime parameters are present";
299 let note = "the late bound lifetime parameter is introduced here";
300 let span = args.args[0].span();
301 if position == GenericArgPosition::Value
302 && arg_counts.lifetimes != param_counts.lifetimes {
303 let mut err = tcx.sess.struct_span_err(span, msg);
304 err.span_note(span_late, note);
308 let mut multispan = MultiSpan::from_span(span);
309 multispan.push_span_label(span_late, note.to_string());
310 tcx.lint_node(lint::builtin::LATE_BOUND_LIFETIME_ARGUMENTS,
311 args.args[0].id(), multispan, msg);
312 return (false, None);
317 let check_kind_count = |kind,
322 // We enforce the following: `required` <= `provided` <= `permitted`.
323 // For kinds without defaults (i.e. lifetimes), `required == permitted`.
324 // For other kinds (i.e. types), `permitted` may be greater than `required`.
325 if required <= provided && provided <= permitted {
326 return (false, None);
329 // Unfortunately lifetime and type parameter mismatches are typically styled
330 // differently in diagnostics, which means we have a few cases to consider here.
331 let (bound, quantifier) = if required != permitted {
332 if provided < required {
333 (required, "at least ")
334 } else { // provided > permitted
335 (permitted, "at most ")
341 let mut potential_assoc_types: Option<Vec<Span>> = None;
342 let (spans, label) = if required == permitted && provided > permitted {
343 // In the case when the user has provided too many arguments,
344 // we want to point to the unexpected arguments.
345 let spans: Vec<Span> = args.args[offset+permitted .. offset+provided]
347 .map(|arg| arg.span())
349 potential_assoc_types = Some(spans.clone());
350 (spans, format!( "unexpected {} argument", kind))
352 (vec![span], format!(
353 "expected {}{} {} argument{}",
357 if bound != 1 { "s" } else { "" },
361 let mut err = tcx.sess.struct_span_err_with_code(
364 "wrong number of {} arguments: expected {}{}, found {}",
370 DiagnosticId::Error("E0107".into())
373 err.span_label(span, label.as_str());
377 (provided > required, // `suppress_error`
378 potential_assoc_types)
381 if !infer_lifetimes || arg_counts.lifetimes > param_counts.lifetimes {
384 param_counts.lifetimes,
385 param_counts.lifetimes,
386 arg_counts.lifetimes,
391 || arg_counts.types > param_counts.types - defaults.types - has_self as usize {
394 param_counts.types - defaults.types - has_self as usize,
395 param_counts.types - has_self as usize,
397 arg_counts.lifetimes,
404 /// Creates the relevant generic argument substitutions
405 /// corresponding to a set of generic parameters. This is a
406 /// rather complex little function. Let me try to explain the
407 /// role of each of its parameters:
409 /// To start, we are given the `def_id` of the thing we are
410 /// creating the substitutions for, and a partial set of
411 /// substitutions `parent_substs`. In general, the substitutions
412 /// for an item begin with substitutions for all the "parents" of
413 /// that item -- so e.g. for a method it might include the
414 /// parameters from the impl.
416 /// Therefore, the method begins by walking down these parents,
417 /// starting with the outermost parent and proceed inwards until
418 /// it reaches `def_id`. For each parent P, it will check `parent_substs`
419 /// first to see if the parent's substitutions are listed in there. If so,
420 /// we can append those and move on. Otherwise, it invokes the
421 /// three callback functions:
423 /// - `args_for_def_id`: given the def-id P, supplies back the
424 /// generic arguments that were given to that parent from within
425 /// the path; so e.g. if you have `<T as Foo>::Bar`, the def-id
426 /// might refer to the trait `Foo`, and the arguments might be
427 /// `[T]`. The boolean value indicates whether to infer values
428 /// for arguments whose values were not explicitly provided.
429 /// - `provided_kind`: given the generic parameter and the value from `args_for_def_id`,
430 /// instantiate a `Kind`
431 /// - `inferred_kind`: if no parameter was provided, and inference is enabled, then
432 /// creates a suitable inference variable.
433 pub fn create_substs_for_generic_args<'a, 'b>(
434 tcx: TyCtxt<'a, 'gcx, 'tcx>,
436 parent_substs: &[Kind<'tcx>],
438 self_ty: Option<Ty<'tcx>>,
439 args_for_def_id: impl Fn(DefId) -> (Option<&'b GenericArgs>, bool),
440 provided_kind: impl Fn(&GenericParamDef, &GenericArg) -> Kind<'tcx>,
441 inferred_kind: impl Fn(Option<&[Kind<'tcx>]>, &GenericParamDef, bool) -> Kind<'tcx>,
442 ) -> &'tcx Substs<'tcx> {
443 // Collect the segments of the path: we need to substitute arguments
444 // for parameters throughout the entire path (wherever there are
445 // generic parameters).
446 let mut parent_defs = tcx.generics_of(def_id);
447 let count = parent_defs.count();
448 let mut stack = vec![(def_id, parent_defs)];
449 while let Some(def_id) = parent_defs.parent {
450 parent_defs = tcx.generics_of(def_id);
451 stack.push((def_id, parent_defs));
454 // We manually build up the substitution, rather than using convenience
455 // methods in `subst.rs` so that we can iterate over the arguments and
456 // parameters in lock-step linearly, rather than trying to match each pair.
457 let mut substs: SmallVec<[Kind<'tcx>; 8]> = SmallVec::with_capacity(count);
459 // Iterate over each segment of the path.
460 while let Some((def_id, defs)) = stack.pop() {
461 let mut params = defs.params.iter().peekable();
463 // If we have already computed substitutions for parents, we can use those directly.
464 while let Some(¶m) = params.peek() {
465 if let Some(&kind) = parent_substs.get(param.index as usize) {
473 // `Self` is handled first, unless it's been handled in `parent_substs`.
475 if let Some(¶m) = params.peek() {
476 if param.index == 0 {
477 if let GenericParamDefKind::Type { .. } = param.kind {
478 substs.push(self_ty.map(|ty| ty.into())
479 .unwrap_or_else(|| inferred_kind(None, param, true)));
486 // Check whether this segment takes generic arguments and the user has provided any.
487 let (generic_args, infer_types) = args_for_def_id(def_id);
489 let mut args = generic_args.iter().flat_map(|generic_args| generic_args.args.iter())
493 // We're going to iterate through the generic arguments that the user
494 // provided, matching them with the generic parameters we expect.
495 // Mismatches can occur as a result of elided lifetimes, or for malformed
496 // input. We try to handle both sensibly.
497 match (args.peek(), params.peek()) {
498 (Some(&arg), Some(¶m)) => {
499 match (arg, ¶m.kind) {
500 (GenericArg::Lifetime(_), GenericParamDefKind::Lifetime)
501 | (GenericArg::Type(_), GenericParamDefKind::Type { .. }) => {
502 substs.push(provided_kind(param, arg));
506 (GenericArg::Lifetime(_), GenericParamDefKind::Type { .. }) => {
507 // We expected a type argument, but got a lifetime
508 // argument. This is an error, but we need to handle it
509 // gracefully so we can report sensible errors. In this
510 // case, we're simply going to infer this argument.
513 (GenericArg::Type(_), GenericParamDefKind::Lifetime) => {
514 // We expected a lifetime argument, but got a type
515 // argument. That means we're inferring the lifetimes.
516 substs.push(inferred_kind(None, param, infer_types));
522 // We should never be able to reach this point with well-formed input.
523 // Getting to this point means the user supplied more arguments than
524 // there are parameters.
527 (None, Some(¶m)) => {
528 // If there are fewer arguments than parameters, it means
529 // we're inferring the remaining arguments.
531 GenericParamDefKind::Lifetime | GenericParamDefKind::Type { .. } => {
532 let kind = inferred_kind(Some(&substs), param, infer_types);
539 (None, None) => break,
544 tcx.intern_substs(&substs)
547 /// Given the type/region arguments provided to some path (along with
548 /// an implicit `Self`, if this is a trait reference) returns the complete
549 /// set of substitutions. This may involve applying defaulted type parameters.
551 /// Note that the type listing given here is *exactly* what the user provided.
552 fn create_substs_for_ast_path(&self,
555 generic_args: &hir::GenericArgs,
557 self_ty: Option<Ty<'tcx>>)
558 -> (&'tcx Substs<'tcx>, Vec<ConvertedBinding<'tcx>>, Option<Vec<Span>>)
560 // If the type is parameterized by this region, then replace this
561 // region with the current anon region binding (in other words,
562 // whatever & would get replaced with).
563 debug!("create_substs_for_ast_path(def_id={:?}, self_ty={:?}, \
565 def_id, self_ty, generic_args);
567 let tcx = self.tcx();
568 let generic_params = tcx.generics_of(def_id);
570 // If a self-type was declared, one should be provided.
571 assert_eq!(generic_params.has_self, self_ty.is_some());
573 let has_self = generic_params.has_self;
574 let (_, potential_assoc_types) = Self::check_generic_arg_count(
579 GenericArgPosition::Type,
584 let is_object = self_ty.map_or(false, |ty| ty.sty == TRAIT_OBJECT_DUMMY_SELF);
585 let default_needs_object_self = |param: &ty::GenericParamDef| {
586 if let GenericParamDefKind::Type { has_default, .. } = param.kind {
587 if is_object && has_default {
588 if tcx.at(span).type_of(param.def_id).has_self_ty() {
589 // There is no suitable inference default for a type parameter
590 // that references self, in an object type.
599 let substs = Self::create_substs_for_generic_args(
605 // Provide the generic args, and whether types should be inferred.
606 |_| (Some(generic_args), infer_types),
607 // Provide substitutions for parameters for which (valid) arguments have been provided.
609 match (¶m.kind, arg) {
610 (GenericParamDefKind::Lifetime, GenericArg::Lifetime(lt)) => {
611 self.ast_region_to_region(<, Some(param)).into()
613 (GenericParamDefKind::Type { .. }, GenericArg::Type(ty)) => {
614 self.ast_ty_to_ty(&ty).into()
619 // Provide substitutions for parameters for which arguments are inferred.
620 |substs, param, infer_types| {
622 GenericParamDefKind::Lifetime => tcx.types.re_static.into(),
623 GenericParamDefKind::Type { has_default, .. } => {
624 if !infer_types && has_default {
625 // No type parameter provided, but a default exists.
627 // If we are converting an object type, then the
628 // `Self` parameter is unknown. However, some of the
629 // other type parameters may reference `Self` in their
630 // defaults. This will lead to an ICE if we are not
632 if default_needs_object_self(param) {
633 struct_span_err!(tcx.sess, span, E0393,
634 "the type parameter `{}` must be explicitly \
638 format!("missing reference to `{}`", param.name))
639 .note(&format!("because of the default `Self` reference, \
640 type parameters must be specified on object \
645 // This is a default type parameter.
648 tcx.at(span).type_of(param.def_id)
649 .subst_spanned(tcx, substs.unwrap(), Some(span))
652 } else if infer_types {
653 // No type parameters were provided, we can infer all.
654 if !default_needs_object_self(param) {
655 self.ty_infer_for_def(param, span).into()
657 self.ty_infer(span).into()
660 // We've already errored above about the mismatch.
668 let assoc_bindings = generic_args.bindings.iter().map(|binding| {
670 item_name: binding.ident,
671 ty: self.ast_ty_to_ty(&binding.ty),
676 debug!("create_substs_for_ast_path(generic_params={:?}, self_ty={:?}) -> {:?}",
677 generic_params, self_ty, substs);
679 (substs, assoc_bindings, potential_assoc_types)
682 /// Instantiates the path for the given trait reference, assuming that it's
683 /// bound to a valid trait type. Returns the def_id for the defining trait.
684 /// The type _cannot_ be a type other than a trait type.
686 /// If the `projections` argument is `None`, then assoc type bindings like `Foo<T=X>`
687 /// are disallowed. Otherwise, they are pushed onto the vector given.
688 pub fn instantiate_mono_trait_ref(&self,
689 trait_ref: &hir::TraitRef,
691 -> ty::TraitRef<'tcx>
693 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
695 let trait_def_id = self.trait_def_id(trait_ref);
696 self.ast_path_to_mono_trait_ref(trait_ref.path.span,
699 trait_ref.path.segments.last().unwrap())
702 /// Get the `DefId` of the given trait ref. It _must_ actually be a trait.
703 fn trait_def_id(&self, trait_ref: &hir::TraitRef) -> DefId {
704 let path = &trait_ref.path;
706 Def::Trait(trait_def_id) => trait_def_id,
707 Def::TraitAlias(alias_def_id) => alias_def_id,
715 /// The given trait ref must actually be a trait.
716 pub(super) fn instantiate_poly_trait_ref_inner(&self,
717 trait_ref: &hir::TraitRef,
719 poly_projections: &mut Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>,
721 -> (ty::PolyTraitRef<'tcx>, Option<Vec<Span>>)
723 let trait_def_id = self.trait_def_id(trait_ref);
725 debug!("instantiate_poly_trait_ref({:?}, def_id={:?})", trait_ref, trait_def_id);
727 self.prohibit_generics(trait_ref.path.segments.split_last().unwrap().1);
729 let (substs, assoc_bindings, potential_assoc_types) = self.create_substs_for_ast_trait_ref(
733 trait_ref.path.segments.last().unwrap(),
735 let poly_trait_ref = ty::Binder::bind(ty::TraitRef::new(trait_def_id, substs));
737 let mut dup_bindings = FxHashMap::default();
738 poly_projections.extend(assoc_bindings.iter().filter_map(|binding| {
739 // specify type to assert that error was already reported in Err case:
740 let predicate: Result<_, ErrorReported> =
741 self.ast_type_binding_to_poly_projection_predicate(
742 trait_ref.ref_id, poly_trait_ref, binding, speculative, &mut dup_bindings);
743 // okay to ignore Err because of ErrorReported (see above)
744 Some((predicate.ok()?, binding.span))
747 debug!("instantiate_poly_trait_ref({:?}, projections={:?}) -> {:?}",
748 trait_ref, poly_projections, poly_trait_ref);
749 (poly_trait_ref, potential_assoc_types)
752 pub fn instantiate_poly_trait_ref(&self,
753 poly_trait_ref: &hir::PolyTraitRef,
755 poly_projections: &mut Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>)
756 -> (ty::PolyTraitRef<'tcx>, Option<Vec<Span>>)
758 self.instantiate_poly_trait_ref_inner(&poly_trait_ref.trait_ref, self_ty,
759 poly_projections, false)
762 fn ast_path_to_mono_trait_ref(&self,
766 trait_segment: &hir::PathSegment)
767 -> ty::TraitRef<'tcx>
769 let (substs, assoc_bindings, _) =
770 self.create_substs_for_ast_trait_ref(span,
774 assoc_bindings.first().map(|b| AstConv::prohibit_assoc_ty_binding(self.tcx(), b.span));
775 ty::TraitRef::new(trait_def_id, substs)
778 fn create_substs_for_ast_trait_ref(
783 trait_segment: &hir::PathSegment,
784 ) -> (&'tcx Substs<'tcx>, Vec<ConvertedBinding<'tcx>>, Option<Vec<Span>>) {
785 debug!("create_substs_for_ast_trait_ref(trait_segment={:?})",
788 let trait_def = self.tcx().trait_def(trait_def_id);
790 if !self.tcx().features().unboxed_closures &&
791 trait_segment.with_generic_args(|generic_args| generic_args.parenthesized)
792 != trait_def.paren_sugar {
793 // For now, require that parenthetical notation be used only with `Fn()` etc.
794 let msg = if trait_def.paren_sugar {
795 "the precise format of `Fn`-family traits' type parameters is subject to change. \
796 Use parenthetical notation (Fn(Foo, Bar) -> Baz) instead"
798 "parenthetical notation is only stable when used with `Fn`-family traits"
800 emit_feature_err(&self.tcx().sess.parse_sess, "unboxed_closures",
801 span, GateIssue::Language, msg);
804 trait_segment.with_generic_args(|generic_args| {
805 self.create_substs_for_ast_path(span,
808 trait_segment.infer_types,
813 fn trait_defines_associated_type_named(&self,
815 assoc_name: ast::Ident)
818 self.tcx().associated_items(trait_def_id).any(|item| {
819 item.kind == ty::AssociatedKind::Type &&
820 self.tcx().hygienic_eq(assoc_name, item.ident, trait_def_id)
824 fn ast_type_binding_to_poly_projection_predicate(
827 trait_ref: ty::PolyTraitRef<'tcx>,
828 binding: &ConvertedBinding<'tcx>,
830 dup_bindings: &mut FxHashMap<DefId, Span>)
831 -> Result<ty::PolyProjectionPredicate<'tcx>, ErrorReported>
833 let tcx = self.tcx();
836 // Given something like `U: SomeTrait<T = X>`, we want to produce a
837 // predicate like `<U as SomeTrait>::T = X`. This is somewhat
838 // subtle in the event that `T` is defined in a supertrait of
839 // `SomeTrait`, because in that case we need to upcast.
841 // That is, consider this case:
844 // trait SubTrait: SuperTrait<int> { }
845 // trait SuperTrait<A> { type T; }
847 // ... B : SubTrait<T=foo> ...
850 // We want to produce `<B as SuperTrait<int>>::T == foo`.
852 // Find any late-bound regions declared in `ty` that are not
853 // declared in the trait-ref. These are not wellformed.
857 // for<'a> <T as Iterator>::Item = &'a str // <-- 'a is bad
858 // for<'a> <T as FnMut<(&'a u32,)>>::Output = &'a str // <-- 'a is ok
859 let late_bound_in_trait_ref = tcx.collect_constrained_late_bound_regions(&trait_ref);
860 let late_bound_in_ty =
861 tcx.collect_referenced_late_bound_regions(&ty::Binder::bind(binding.ty));
862 debug!("late_bound_in_trait_ref = {:?}", late_bound_in_trait_ref);
863 debug!("late_bound_in_ty = {:?}", late_bound_in_ty);
864 for br in late_bound_in_ty.difference(&late_bound_in_trait_ref) {
865 let br_name = match *br {
866 ty::BrNamed(_, name) => name,
870 "anonymous bound region {:?} in binding but not trait ref",
874 struct_span_err!(tcx.sess,
877 "binding for associated type `{}` references lifetime `{}`, \
878 which does not appear in the trait input types",
879 binding.item_name, br_name)
884 let candidate = if self.trait_defines_associated_type_named(trait_ref.def_id(),
886 // Simple case: X is defined in the current trait.
889 // Otherwise, we have to walk through the supertraits to find
891 let candidates = traits::supertraits(tcx, trait_ref).filter(|r| {
892 self.trait_defines_associated_type_named(r.def_id(), binding.item_name)
894 self.one_bound_for_assoc_type(candidates, &trait_ref.to_string(),
895 binding.item_name, binding.span)
898 let (assoc_ident, def_scope) =
899 tcx.adjust_ident(binding.item_name, candidate.def_id(), ref_id);
900 let assoc_ty = tcx.associated_items(candidate.def_id()).find(|i| {
901 i.kind == ty::AssociatedKind::Type && i.ident.modern() == assoc_ident
902 }).expect("missing associated type");
904 if !assoc_ty.vis.is_accessible_from(def_scope, tcx) {
905 let msg = format!("associated type `{}` is private", binding.item_name);
906 tcx.sess.span_err(binding.span, &msg);
908 tcx.check_stability(assoc_ty.def_id, Some(ref_id), binding.span);
911 dup_bindings.entry(assoc_ty.def_id)
912 .and_modify(|prev_span| {
913 struct_span_err!(self.tcx().sess, binding.span, E0719,
914 "the value of the associated type `{}` (from the trait `{}`) \
915 is already specified",
917 tcx.item_path_str(assoc_ty.container.id()))
918 .span_label(binding.span, "re-bound here")
919 .span_label(*prev_span, format!("`{}` bound here first", 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::new();
973 let dummy_self = tcx.mk_ty(TRAIT_OBJECT_DUMMY_SELF);
974 let (principal, potential_assoc_types) = self.instantiate_poly_trait_ref(
977 &mut projection_bounds,
979 debug!("principal: {:?}", principal);
981 for trait_bound in trait_bounds[1..].iter() {
982 // sanity check for non-principal trait bounds
983 self.instantiate_poly_trait_ref(trait_bound,
988 let (mut auto_traits, trait_bounds) = split_auto_traits(tcx, &trait_bounds[1..]);
990 if !trait_bounds.is_empty() {
991 let b = &trait_bounds[0];
992 let span = b.trait_ref.path.span;
993 struct_span_err!(self.tcx().sess, span, E0225,
994 "only auto traits can be used as additional traits in a trait object")
995 .span_label(span, "non-auto additional trait")
999 // Check that there are no gross object safety violations;
1000 // most importantly, that the supertraits don't contain `Self`,
1002 let object_safety_violations =
1003 tcx.global_tcx().astconv_object_safety_violations(principal.def_id());
1004 if !object_safety_violations.is_empty() {
1005 tcx.report_object_safety_error(
1006 span, principal.def_id(), object_safety_violations)
1008 return tcx.types.err;
1011 // Use a `BTreeSet` to keep output in a more consistent order.
1012 let mut associated_types = BTreeSet::default();
1014 for tr in traits::elaborate_trait_ref(tcx, principal) {
1016 ty::Predicate::Trait(pred) => {
1017 associated_types.extend(tcx.associated_items(pred.def_id())
1018 .filter(|item| item.kind == ty::AssociatedKind::Type)
1019 .map(|item| item.def_id));
1021 ty::Predicate::Projection(pred) => {
1022 // Include projections defined on supertraits.
1023 projection_bounds.push((pred, DUMMY_SP))
1029 for (projection_bound, _) in &projection_bounds {
1030 associated_types.remove(&projection_bound.projection_def_id());
1033 if !associated_types.is_empty() {
1034 let names = associated_types.iter().map(|item_def_id| {
1035 let assoc_item = tcx.associated_item(*item_def_id);
1036 let trait_def_id = assoc_item.container.id();
1038 "`{}` (from the trait `{}`)",
1040 tcx.item_path_str(trait_def_id),
1042 }).collect::<Vec<_>>().join(", ");
1043 let mut err = struct_span_err!(
1047 "the value of the associated type{} {} must be specified",
1048 if associated_types.len() == 1 { "" } else { "s" },
1051 let mut suggest = false;
1052 let mut potential_assoc_types_spans = vec![];
1053 if let Some(potential_assoc_types) = potential_assoc_types {
1054 if potential_assoc_types.len() == associated_types.len() {
1055 // Only suggest when the amount of missing associated types is equals to the
1056 // extra type arguments present, as that gives us a relatively high confidence
1057 // that the user forgot to give the associtated type's name. The canonical
1058 // example would be trying to use `Iterator<isize>` instead of
1059 // `Iterator<Item=isize>`.
1061 potential_assoc_types_spans = potential_assoc_types;
1064 let mut suggestions = vec![];
1065 for (i, item_def_id) in associated_types.iter().enumerate() {
1066 let assoc_item = tcx.associated_item(*item_def_id);
1069 format!("missing associated type `{}` value", assoc_item.ident),
1072 tcx.def_span(*item_def_id),
1073 format!("`{}` defined here", assoc_item.ident),
1076 if let Ok(snippet) = tcx.sess.source_map().span_to_snippet(
1077 potential_assoc_types_spans[i],
1080 potential_assoc_types_spans[i],
1081 format!("{} = {}", assoc_item.ident, snippet),
1086 if !suggestions.is_empty() {
1087 err.multipart_suggestion_with_applicability(
1088 "if you meant to assign the missing associated type, use the name",
1090 Applicability::MaybeIncorrect,
1096 // Erase the `dummy_self` (`TRAIT_OBJECT_DUMMY_SELF`) used above.
1097 let existential_principal = principal.map_bound(|trait_ref| {
1098 self.trait_ref_to_existential(trait_ref)
1100 let existential_projections = projection_bounds.iter().map(|(bound, _)| {
1101 bound.map_bound(|b| {
1102 let trait_ref = self.trait_ref_to_existential(b.projection_ty.trait_ref(tcx));
1103 ty::ExistentialProjection {
1105 item_def_id: b.projection_ty.item_def_id,
1106 substs: trait_ref.substs,
1111 // Dedup auto traits so that `dyn Trait + Send + Send` is the same as `dyn Trait + Send`.
1113 auto_traits.dedup();
1115 // Calling `skip_binder` is okay, because the predicates are re-bound.
1117 iter::once(ty::ExistentialPredicate::Trait(*existential_principal.skip_binder()))
1118 .chain(auto_traits.into_iter().map(ty::ExistentialPredicate::AutoTrait))
1119 .chain(existential_projections
1120 .map(|x| ty::ExistentialPredicate::Projection(*x.skip_binder())))
1121 .collect::<SmallVec<[_; 8]>>();
1122 v.sort_by(|a, b| a.stable_cmp(tcx, b));
1123 let existential_predicates = ty::Binder::bind(tcx.mk_existential_predicates(v.into_iter()));
1125 // Use explicitly-specified region bound.
1126 let region_bound = if !lifetime.is_elided() {
1127 self.ast_region_to_region(lifetime, None)
1129 self.compute_object_lifetime_bound(span, existential_predicates).unwrap_or_else(|| {
1130 let hir_id = tcx.hir.node_to_hir_id(lifetime.id);
1131 if tcx.named_region(hir_id).is_some() {
1132 self.ast_region_to_region(lifetime, None)
1134 self.re_infer(span, None).unwrap_or_else(|| {
1135 span_err!(tcx.sess, span, E0228,
1136 "the lifetime bound for this object type cannot be deduced \
1137 from context; please supply an explicit bound");
1144 debug!("region_bound: {:?}", region_bound);
1146 let ty = tcx.mk_dynamic(existential_predicates, region_bound);
1147 debug!("trait_object_type: {:?}", ty);
1151 fn report_ambiguous_associated_type(&self,
1156 struct_span_err!(self.tcx().sess, span, E0223, "ambiguous associated type")
1157 .span_suggestion_with_applicability(
1159 "use fully-qualified syntax",
1160 format!("<{} as {}>::{}", type_str, trait_str, name),
1161 Applicability::HasPlaceholders
1165 // Search for a bound on a type parameter which includes the associated item
1166 // given by `assoc_name`. `ty_param_def_id` is the `DefId` for the type parameter
1167 // This function will fail if there are no suitable bounds or there is
1169 fn find_bound_for_assoc_item(&self,
1170 ty_param_def_id: DefId,
1171 assoc_name: ast::Ident,
1173 -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
1175 let tcx = self.tcx();
1177 let predicates = &self.get_type_parameter_bounds(span, ty_param_def_id).predicates;
1178 let bounds = predicates.iter().filter_map(|(p, _)| p.to_opt_poly_trait_ref());
1180 // Check that there is exactly one way to find an associated type with the
1182 let suitable_bounds = traits::transitive_bounds(tcx, bounds)
1183 .filter(|b| self.trait_defines_associated_type_named(b.def_id(), assoc_name));
1185 let param_node_id = tcx.hir.as_local_node_id(ty_param_def_id).unwrap();
1186 let param_name = tcx.hir.ty_param_name(param_node_id);
1187 self.one_bound_for_assoc_type(suitable_bounds,
1188 ¶m_name.as_str(),
1193 // Checks that `bounds` contains exactly one element and reports appropriate
1194 // errors otherwise.
1195 fn one_bound_for_assoc_type<I>(&self,
1197 ty_param_name: &str,
1198 assoc_name: ast::Ident,
1200 -> Result<ty::PolyTraitRef<'tcx>, ErrorReported>
1201 where I: Iterator<Item=ty::PolyTraitRef<'tcx>>
1203 let bound = match bounds.next() {
1204 Some(bound) => bound,
1206 struct_span_err!(self.tcx().sess, span, E0220,
1207 "associated type `{}` not found for `{}`",
1210 .span_label(span, format!("associated type `{}` not found", assoc_name))
1212 return Err(ErrorReported);
1216 if let Some(bound2) = bounds.next() {
1217 let bounds = iter::once(bound).chain(iter::once(bound2)).chain(bounds);
1218 let mut err = struct_span_err!(
1219 self.tcx().sess, span, E0221,
1220 "ambiguous associated type `{}` in bounds of `{}`",
1223 err.span_label(span, format!("ambiguous associated type `{}`", assoc_name));
1225 for bound in bounds {
1226 let bound_span = self.tcx().associated_items(bound.def_id()).find(|item| {
1227 item.kind == ty::AssociatedKind::Type &&
1228 self.tcx().hygienic_eq(assoc_name, item.ident, bound.def_id())
1230 .and_then(|item| self.tcx().hir.span_if_local(item.def_id));
1232 if let Some(span) = bound_span {
1233 err.span_label(span, format!("ambiguous `{}` from `{}`",
1237 span_note!(&mut err, span,
1238 "associated type `{}` could derive from `{}`",
1249 // Create a type from a path to an associated type.
1250 // For a path `A::B::C::D`, `ty` and `ty_path_def` are the type and def for `A::B::C`
1251 // and item_segment is the path segment for `D`. We return a type and a def for
1253 // Will fail except for `T::A` and `Self::A`; i.e., if `ty`/`ty_path_def` are not a type
1254 // parameter or `Self`.
1255 pub fn associated_path_def_to_ty(&self,
1256 ref_id: ast::NodeId,
1260 item_segment: &hir::PathSegment)
1263 let tcx = self.tcx();
1264 let assoc_name = item_segment.ident;
1266 debug!("associated_path_def_to_ty: {:?}::{}", ty, assoc_name);
1268 self.prohibit_generics(slice::from_ref(item_segment));
1270 // Find the type of the associated item, and the trait where the associated
1271 // item is declared.
1272 let bound = match (&ty.sty, ty_path_def) {
1273 (_, Def::SelfTy(Some(_), Some(impl_def_id))) => {
1274 // `Self` in an impl of a trait - we have a concrete `self` type and a
1276 let trait_ref = match tcx.impl_trait_ref(impl_def_id) {
1277 Some(trait_ref) => trait_ref,
1279 // A cycle error occurred, most likely.
1280 return (tcx.types.err, Def::Err);
1284 let candidates = traits::supertraits(tcx, ty::Binder::bind(trait_ref))
1285 .filter(|r| self.trait_defines_associated_type_named(r.def_id(), assoc_name));
1287 match self.one_bound_for_assoc_type(candidates, "Self", assoc_name, span) {
1289 Err(ErrorReported) => return (tcx.types.err, Def::Err),
1292 (&ty::Param(_), Def::SelfTy(Some(param_did), None)) |
1293 (&ty::Param(_), Def::TyParam(param_did)) => {
1294 match self.find_bound_for_assoc_item(param_did, assoc_name, span) {
1296 Err(ErrorReported) => return (tcx.types.err, Def::Err),
1300 // Don't print TyErr to the user.
1301 if !ty.references_error() {
1302 self.report_ambiguous_associated_type(span,
1305 &assoc_name.as_str());
1307 return (tcx.types.err, Def::Err);
1311 let trait_did = bound.def_id();
1312 let (assoc_ident, def_scope) = tcx.adjust_ident(assoc_name, trait_did, ref_id);
1313 let item = tcx.associated_items(trait_did).find(|i| {
1314 Namespace::from(i.kind) == Namespace::Type &&
1315 i.ident.modern() == assoc_ident
1317 .expect("missing associated type");
1319 let ty = self.projected_ty_from_poly_trait_ref(span, item.def_id, bound);
1320 let ty = self.normalize_ty(span, ty);
1322 let def = Def::AssociatedTy(item.def_id);
1323 if !item.vis.is_accessible_from(def_scope, tcx) {
1324 let msg = format!("{} `{}` is private", def.kind_name(), assoc_name);
1325 tcx.sess.span_err(span, &msg);
1327 tcx.check_stability(item.def_id, Some(ref_id), span);
1332 fn qpath_to_ty(&self,
1334 opt_self_ty: Option<Ty<'tcx>>,
1336 trait_segment: &hir::PathSegment,
1337 item_segment: &hir::PathSegment)
1340 let tcx = self.tcx();
1341 let trait_def_id = tcx.parent_def_id(item_def_id).unwrap();
1343 self.prohibit_generics(slice::from_ref(item_segment));
1345 let self_ty = if let Some(ty) = opt_self_ty {
1348 let path_str = tcx.item_path_str(trait_def_id);
1349 self.report_ambiguous_associated_type(span,
1352 &item_segment.ident.as_str());
1353 return tcx.types.err;
1356 debug!("qpath_to_ty: self_type={:?}", self_ty);
1358 let trait_ref = self.ast_path_to_mono_trait_ref(span,
1363 debug!("qpath_to_ty: trait_ref={:?}", trait_ref);
1365 self.normalize_ty(span, tcx.mk_projection(item_def_id, trait_ref.substs))
1368 pub fn prohibit_generics<'a, T: IntoIterator<Item = &'a hir::PathSegment>>(&self, segments: T) {
1369 for segment in segments {
1370 segment.with_generic_args(|generic_args| {
1371 let (mut err_for_lt, mut err_for_ty) = (false, false);
1372 for arg in &generic_args.args {
1373 let (mut span_err, span, kind) = match arg {
1374 hir::GenericArg::Lifetime(lt) => {
1375 if err_for_lt { continue }
1377 (struct_span_err!(self.tcx().sess, lt.span, E0110,
1378 "lifetime parameters are not allowed on this type"),
1382 hir::GenericArg::Type(ty) => {
1383 if err_for_ty { continue }
1385 (struct_span_err!(self.tcx().sess, ty.span, E0109,
1386 "type parameters are not allowed on this type"),
1391 span_err.span_label(span, format!("{} parameter not allowed", kind))
1393 if err_for_lt && err_for_ty {
1397 for binding in &generic_args.bindings {
1398 Self::prohibit_assoc_ty_binding(self.tcx(), binding.span);
1405 pub fn prohibit_assoc_ty_binding(tcx: TyCtxt, span: Span) {
1406 let mut err = struct_span_err!(tcx.sess, span, E0229,
1407 "associated type bindings are not allowed here");
1408 err.span_label(span, "associated type not allowed here").emit();
1411 // Check a type `Path` and convert it to a `Ty`.
1412 pub fn def_to_ty(&self,
1413 opt_self_ty: Option<Ty<'tcx>>,
1415 permit_variants: bool)
1417 let tcx = self.tcx();
1419 debug!("def_to_ty(def={:?}, opt_self_ty={:?}, path_segments={:?})",
1420 path.def, opt_self_ty, path.segments);
1422 let span = path.span;
1424 Def::Existential(did) => {
1425 // Check for desugared impl trait.
1426 assert!(ty::is_impl_trait_defn(tcx, did).is_none());
1427 let item_segment = path.segments.split_last().unwrap();
1428 self.prohibit_generics(item_segment.1);
1429 let substs = self.ast_path_substs_for_ty(span, did, item_segment.0);
1432 tcx.mk_opaque(did, substs),
1435 Def::Enum(did) | Def::TyAlias(did) | Def::Struct(did) |
1436 Def::Union(did) | Def::ForeignTy(did) => {
1437 assert_eq!(opt_self_ty, None);
1438 self.prohibit_generics(path.segments.split_last().unwrap().1);
1439 self.ast_path_to_ty(span, did, path.segments.last().unwrap())
1441 Def::Variant(did) if permit_variants => {
1442 // Convert "variant type" as if it were a real type.
1443 // The resulting `Ty` is type of the variant's enum for now.
1444 assert_eq!(opt_self_ty, None);
1445 self.prohibit_generics(path.segments.split_last().unwrap().1);
1446 self.ast_path_to_ty(span,
1447 tcx.parent_def_id(did).unwrap(),
1448 path.segments.last().unwrap())
1450 Def::TyParam(did) => {
1451 assert_eq!(opt_self_ty, None);
1452 self.prohibit_generics(&path.segments);
1454 let node_id = tcx.hir.as_local_node_id(did).unwrap();
1455 let item_id = tcx.hir.get_parent_node(node_id);
1456 let item_def_id = tcx.hir.local_def_id(item_id);
1457 let generics = tcx.generics_of(item_def_id);
1458 let index = generics.param_def_id_to_index[&tcx.hir.local_def_id(node_id)];
1459 tcx.mk_ty_param(index, tcx.hir.name(node_id).as_interned_str())
1461 Def::SelfTy(_, Some(def_id)) => {
1462 // `Self` in impl (we know the concrete type)
1464 assert_eq!(opt_self_ty, None);
1465 self.prohibit_generics(&path.segments);
1467 tcx.at(span).type_of(def_id)
1469 Def::SelfTy(Some(_), None) => {
1471 assert_eq!(opt_self_ty, None);
1472 self.prohibit_generics(&path.segments);
1475 Def::AssociatedTy(def_id) => {
1476 self.prohibit_generics(&path.segments[..path.segments.len()-2]);
1477 self.qpath_to_ty(span,
1480 &path.segments[path.segments.len()-2],
1481 path.segments.last().unwrap())
1483 Def::PrimTy(prim_ty) => {
1484 assert_eq!(opt_self_ty, None);
1485 self.prohibit_generics(&path.segments);
1487 hir::Bool => tcx.types.bool,
1488 hir::Char => tcx.types.char,
1489 hir::Int(it) => tcx.mk_mach_int(it),
1490 hir::Uint(uit) => tcx.mk_mach_uint(uit),
1491 hir::Float(ft) => tcx.mk_mach_float(ft),
1492 hir::Str => tcx.mk_str()
1496 self.set_tainted_by_errors();
1497 return self.tcx().types.err;
1499 _ => span_bug!(span, "unexpected definition: {:?}", path.def)
1503 /// Parses the programmer's textual representation of a type into our
1504 /// internal notion of a type.
1505 pub fn ast_ty_to_ty(&self, ast_ty: &hir::Ty) -> Ty<'tcx> {
1506 debug!("ast_ty_to_ty(id={:?}, ast_ty={:?} ty_ty={:?})",
1507 ast_ty.id, ast_ty, ast_ty.node);
1509 let tcx = self.tcx();
1511 let result_ty = match ast_ty.node {
1512 hir::TyKind::Slice(ref ty) => {
1513 tcx.mk_slice(self.ast_ty_to_ty(&ty))
1515 hir::TyKind::Ptr(ref mt) => {
1516 tcx.mk_ptr(ty::TypeAndMut {
1517 ty: self.ast_ty_to_ty(&mt.ty),
1521 hir::TyKind::Rptr(ref region, ref mt) => {
1522 let r = self.ast_region_to_region(region, None);
1523 debug!("Ref r={:?}", r);
1524 let t = self.ast_ty_to_ty(&mt.ty);
1525 tcx.mk_ref(r, ty::TypeAndMut {ty: t, mutbl: mt.mutbl})
1527 hir::TyKind::Never => {
1530 hir::TyKind::Tup(ref fields) => {
1531 tcx.mk_tup(fields.iter().map(|t| self.ast_ty_to_ty(&t)))
1533 hir::TyKind::BareFn(ref bf) => {
1534 require_c_abi_if_variadic(tcx, &bf.decl, bf.abi, ast_ty.span);
1535 tcx.mk_fn_ptr(self.ty_of_fn(bf.unsafety, bf.abi, &bf.decl))
1537 hir::TyKind::TraitObject(ref bounds, ref lifetime) => {
1538 self.conv_object_ty_poly_trait_ref(ast_ty.span, bounds, lifetime)
1540 hir::TyKind::Path(hir::QPath::Resolved(ref maybe_qself, ref path)) => {
1541 debug!("ast_ty_to_ty: maybe_qself={:?} path={:?}", maybe_qself, path);
1542 let opt_self_ty = maybe_qself.as_ref().map(|qself| {
1543 self.ast_ty_to_ty(qself)
1545 self.def_to_ty(opt_self_ty, path, false)
1547 hir::TyKind::Def(item_id, ref lifetimes) => {
1548 let did = tcx.hir.local_def_id(item_id.id);
1549 self.impl_trait_ty_to_ty(did, lifetimes)
1551 hir::TyKind::Path(hir::QPath::TypeRelative(ref qself, ref segment)) => {
1552 debug!("ast_ty_to_ty: qself={:?} segment={:?}", qself, segment);
1553 let ty = self.ast_ty_to_ty(qself);
1555 let def = if let hir::TyKind::Path(hir::QPath::Resolved(_, ref path)) = qself.node {
1560 self.associated_path_def_to_ty(ast_ty.id, ast_ty.span, ty, def, segment).0
1562 hir::TyKind::Array(ref ty, ref length) => {
1563 let length_def_id = tcx.hir.local_def_id(length.id);
1564 let substs = Substs::identity_for_item(tcx, length_def_id);
1565 let length = ty::Const::unevaluated(tcx, length_def_id, substs, tcx.types.usize);
1566 let array_ty = tcx.mk_ty(ty::Array(self.ast_ty_to_ty(&ty), length));
1567 self.normalize_ty(ast_ty.span, array_ty)
1569 hir::TyKind::Typeof(ref _e) => {
1570 struct_span_err!(tcx.sess, ast_ty.span, E0516,
1571 "`typeof` is a reserved keyword but unimplemented")
1572 .span_label(ast_ty.span, "reserved keyword")
1577 hir::TyKind::Infer => {
1578 // Infer also appears as the type of arguments or return
1579 // values in a ExprKind::Closure, or as
1580 // the type of local variables. Both of these cases are
1581 // handled specially and will not descend into this routine.
1582 self.ty_infer(ast_ty.span)
1584 hir::TyKind::Err => {
1589 self.record_ty(ast_ty.hir_id, result_ty, ast_ty.span);
1593 pub fn impl_trait_ty_to_ty(
1596 lifetimes: &[hir::GenericArg],
1598 debug!("impl_trait_ty_to_ty(def_id={:?}, lifetimes={:?})", def_id, lifetimes);
1599 let tcx = self.tcx();
1601 let generics = tcx.generics_of(def_id);
1603 debug!("impl_trait_ty_to_ty: generics={:?}", generics);
1604 let substs = Substs::for_item(tcx, def_id, |param, _| {
1605 if let Some(i) = (param.index as usize).checked_sub(generics.parent_count) {
1606 // Our own parameters are the resolved lifetimes.
1608 GenericParamDefKind::Lifetime => {
1609 if let hir::GenericArg::Lifetime(lifetime) = &lifetimes[i] {
1610 self.ast_region_to_region(lifetime, None).into()
1618 // Replace all parent lifetimes with 'static.
1620 GenericParamDefKind::Lifetime => {
1621 tcx.types.re_static.into()
1623 _ => tcx.mk_param_from_def(param)
1627 debug!("impl_trait_ty_to_ty: final substs = {:?}", substs);
1629 let ty = tcx.mk_opaque(def_id, substs);
1630 debug!("impl_trait_ty_to_ty: {}", ty);
1634 pub fn ty_of_arg(&self,
1636 expected_ty: Option<Ty<'tcx>>)
1640 hir::TyKind::Infer if expected_ty.is_some() => {
1641 self.record_ty(ty.hir_id, expected_ty.unwrap(), ty.span);
1642 expected_ty.unwrap()
1644 _ => self.ast_ty_to_ty(ty),
1648 pub fn ty_of_fn(&self,
1649 unsafety: hir::Unsafety,
1652 -> ty::PolyFnSig<'tcx> {
1655 let tcx = self.tcx();
1657 decl.inputs.iter().map(|a| self.ty_of_arg(a, None));
1659 let output_ty = match decl.output {
1660 hir::Return(ref output) => self.ast_ty_to_ty(output),
1661 hir::DefaultReturn(..) => tcx.mk_unit(),
1664 debug!("ty_of_fn: output_ty={:?}", output_ty);
1666 let bare_fn_ty = ty::Binder::bind(tcx.mk_fn_sig(
1674 // Find any late-bound regions declared in return type that do
1675 // not appear in the arguments. These are not well-formed.
1678 // for<'a> fn() -> &'a str <-- 'a is bad
1679 // for<'a> fn(&'a String) -> &'a str <-- 'a is ok
1680 let inputs = bare_fn_ty.inputs();
1681 let late_bound_in_args = tcx.collect_constrained_late_bound_regions(
1682 &inputs.map_bound(|i| i.to_owned()));
1683 let output = bare_fn_ty.output();
1684 let late_bound_in_ret = tcx.collect_referenced_late_bound_regions(&output);
1685 for br in late_bound_in_ret.difference(&late_bound_in_args) {
1686 let lifetime_name = match *br {
1687 ty::BrNamed(_, name) => format!("lifetime `{}`,", name),
1688 ty::BrAnon(_) | ty::BrFresh(_) | ty::BrEnv => "an anonymous lifetime".to_string(),
1690 let mut err = struct_span_err!(tcx.sess,
1693 "return type references {} \
1694 which is not constrained by the fn input types",
1696 if let ty::BrAnon(_) = *br {
1697 // The only way for an anonymous lifetime to wind up
1698 // in the return type but **also** be unconstrained is
1699 // if it only appears in "associated types" in the
1700 // input. See #47511 for an example. In this case,
1701 // though we can easily give a hint that ought to be
1703 err.note("lifetimes appearing in an associated type \
1704 are not considered constrained");
1712 /// Given the bounds on an object, determines what single region bound (if any) we can
1713 /// use to summarize this type. The basic idea is that we will use the bound the user
1714 /// provided, if they provided one, and otherwise search the supertypes of trait bounds
1715 /// for region bounds. It may be that we can derive no bound at all, in which case
1716 /// we return `None`.
1717 fn compute_object_lifetime_bound(&self,
1719 existential_predicates: ty::Binder<&'tcx ty::List<ty::ExistentialPredicate<'tcx>>>)
1720 -> Option<ty::Region<'tcx>> // if None, use the default
1722 let tcx = self.tcx();
1724 debug!("compute_opt_region_bound(existential_predicates={:?})",
1725 existential_predicates);
1727 // No explicit region bound specified. Therefore, examine trait
1728 // bounds and see if we can derive region bounds from those.
1729 let derived_region_bounds =
1730 object_region_bounds(tcx, existential_predicates);
1732 // If there are no derived region bounds, then report back that we
1733 // can find no region bound. The caller will use the default.
1734 if derived_region_bounds.is_empty() {
1738 // If any of the derived region bounds are 'static, that is always
1740 if derived_region_bounds.iter().any(|&r| ty::ReStatic == *r) {
1741 return Some(tcx.types.re_static);
1744 // Determine whether there is exactly one unique region in the set
1745 // of derived region bounds. If so, use that. Otherwise, report an
1747 let r = derived_region_bounds[0];
1748 if derived_region_bounds[1..].iter().any(|r1| r != *r1) {
1749 span_err!(tcx.sess, span, E0227,
1750 "ambiguous lifetime bound, explicit lifetime bound required");
1756 /// Divides a list of general trait bounds into two groups: auto traits (e.g. Sync and Send) and the
1757 /// remaining general trait bounds.
1758 fn split_auto_traits<'a, 'b, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1759 trait_bounds: &'b [hir::PolyTraitRef])
1760 -> (Vec<DefId>, Vec<&'b hir::PolyTraitRef>)
1762 let (auto_traits, trait_bounds): (Vec<_>, _) = trait_bounds.iter().partition(|bound| {
1763 // Checks whether `trait_did` is an auto trait and adds it to `auto_traits` if so.
1764 match bound.trait_ref.path.def {
1765 Def::Trait(trait_did) if tcx.trait_is_auto(trait_did) => {
1772 let auto_traits = auto_traits.into_iter().map(|tr| {
1773 if let Def::Trait(trait_did) = tr.trait_ref.path.def {
1778 }).collect::<Vec<_>>();
1780 (auto_traits, trait_bounds)
1783 // A helper struct for conveniently grouping a set of bounds which we pass to
1784 // and return from functions in multiple places.
1785 #[derive(PartialEq, Eq, Clone, Debug)]
1786 pub struct Bounds<'tcx> {
1787 pub region_bounds: Vec<(ty::Region<'tcx>, Span)>,
1788 pub implicitly_sized: Option<Span>,
1789 pub trait_bounds: Vec<(ty::PolyTraitRef<'tcx>, Span)>,
1790 pub projection_bounds: Vec<(ty::PolyProjectionPredicate<'tcx>, Span)>,
1793 impl<'a, 'gcx, 'tcx> Bounds<'tcx> {
1794 pub fn predicates(&self, tcx: TyCtxt<'a, 'gcx, 'tcx>, param_ty: Ty<'tcx>)
1795 -> Vec<(ty::Predicate<'tcx>, Span)>
1797 // If it could be sized, and is, add the sized predicate
1798 let sized_predicate = self.implicitly_sized.and_then(|span| {
1799 tcx.lang_items().sized_trait().map(|sized| {
1800 let trait_ref = ty::TraitRef {
1802 substs: tcx.mk_substs_trait(param_ty, &[])
1804 (trait_ref.to_predicate(), span)
1808 sized_predicate.into_iter().chain(
1809 self.region_bounds.iter().map(|&(region_bound, span)| {
1810 // account for the binder being introduced below; no need to shift `param_ty`
1811 // because, at present at least, it can only refer to early-bound regions
1812 let region_bound = ty::fold::shift_region(tcx, region_bound, 1);
1813 let outlives = ty::OutlivesPredicate(param_ty, region_bound);
1814 (ty::Binder::dummy(outlives).to_predicate(), span)
1816 self.trait_bounds.iter().map(|&(bound_trait_ref, span)| {
1817 (bound_trait_ref.to_predicate(), span)
1820 self.projection_bounds.iter().map(|&(projection, span)| {
1821 (projection.to_predicate(), span)