compiler/rustc_trait_selection/src/traits/wf.rs

   1 use crate::infer::InferCtxt;
   2 use crate::traits;
   3 use rustc_hir as hir;
   4 use rustc_hir::def_id::DefId;
   5 use rustc_hir::lang_items::LangItem;
   6 use rustc_middle::ty::subst::{GenericArg, GenericArgKind, SubstsRef};
   7 use rustc_middle::ty::{self, Ty, TyCtxt, TypeVisitable};
   8 use rustc_span::Span;
   9
  10 use std::iter;
  11 /// Returns the set of obligations needed to make `arg` well-formed.
  12 /// If `arg` contains unresolved inference variables, this may include
  13 /// further WF obligations. However, if `arg` IS an unresolved
  14 /// inference variable, returns `None`, because we are not able to
  15 /// make any progress at all. This is to prevent "livelock" where we
  16 /// say "$0 is WF if $0 is WF".
  17 pub fn obligations<'tcx>(
  18     infcx: &InferCtxt<'tcx>,
  19     param_env: ty::ParamEnv<'tcx>,
  20     body_id: hir::HirId,
  21     recursion_depth: usize,
  22     arg: GenericArg<'tcx>,
  23     span: Span,
  24 ) -> Option<Vec<traits::PredicateObligation<'tcx>>> {
  25     // Handle the "livelock" case (see comment above) by bailing out if necessary.
  26     let arg = match arg.unpack() {
  27         GenericArgKind::Type(ty) => {
  28             match ty.kind() {
  29                 ty::Infer(ty::TyVar(_)) => {
  30                     let resolved_ty = infcx.shallow_resolve(ty);
  31                     if resolved_ty == ty {
  32                         // No progress, bail out to prevent "livelock".
  33                         return None;
  34                     } else {
  35                         resolved_ty
  36                     }
  37                 }
  38                 _ => ty,
  39             }
  40             .into()
  41         }
  42         GenericArgKind::Const(ct) => {
  43             match ct.kind() {
  44                 ty::ConstKind::Infer(_) => {
  45                     let resolved = infcx.shallow_resolve(ct);
  46                     if resolved == ct {
  47                         // No progress.
  48                         return None;
  49                     } else {
  50                         resolved
  51                     }
  52                 }
  53                 _ => ct,
  54             }
  55             .into()
  56         }
  57         // There is nothing we have to do for lifetimes.
  58         GenericArgKind::Lifetime(..) => return Some(Vec::new()),
  59     };
  60
  61     let mut wf = WfPredicates {
  62         tcx: infcx.tcx,
  63         param_env,
  64         body_id,
  65         span,
  66         out: vec![],
  67         recursion_depth,
  68         item: None,
  69     };
  70     wf.compute(arg);
  71     debug!("wf::obligations({:?}, body_id={:?}) = {:?}", arg, body_id, wf.out);
  72
  73     let result = wf.normalize(infcx);
  74     debug!("wf::obligations({:?}, body_id={:?}) ~~> {:?}", arg, body_id, result);
  75     Some(result)
  76 }
  77
  78 /// Returns the obligations that make this trait reference
  79 /// well-formed.  For example, if there is a trait `Set` defined like
  80 /// `trait Set<K:Eq>`, then the trait reference `Foo: Set<Bar>` is WF
  81 /// if `Bar: Eq`.
  82 pub fn trait_obligations<'tcx>(
  83     infcx: &InferCtxt<'tcx>,
  84     param_env: ty::ParamEnv<'tcx>,
  85     body_id: hir::HirId,
  86     trait_pred: &ty::TraitPredicate<'tcx>,
  87     span: Span,
  88     item: &'tcx hir::Item<'tcx>,
  89 ) -> Vec<traits::PredicateObligation<'tcx>> {
  90     let mut wf = WfPredicates {
  91         tcx: infcx.tcx,
  92         param_env,
  93         body_id,
  94         span,
  95         out: vec![],
  96         recursion_depth: 0,
  97         item: Some(item),
  98     };
  99     wf.compute_trait_pred(trait_pred, Elaborate::All);
 100     debug!(obligations = ?wf.out);
 101     wf.normalize(infcx)
 102 }
 103
 104 #[instrument(skip(infcx), ret)]
 105 pub fn predicate_obligations<'tcx>(
 106     infcx: &InferCtxt<'tcx>,
 107     param_env: ty::ParamEnv<'tcx>,
 108     body_id: hir::HirId,
 109     predicate: ty::Predicate<'tcx>,
 110     span: Span,
 111 ) -> Vec<traits::PredicateObligation<'tcx>> {
 112     let mut wf = WfPredicates {
 113         tcx: infcx.tcx,
 114         param_env,
 115         body_id,
 116         span,
 117         out: vec![],
 118         recursion_depth: 0,
 119         item: None,
 120     };
 121
 122     // It's ok to skip the binder here because wf code is prepared for it
 123     match predicate.kind().skip_binder() {
 124         ty::PredicateKind::Clause(ty::Clause::Trait(t)) => {
 125             wf.compute_trait_pred(&t, Elaborate::None);
 126         }
 127         ty::PredicateKind::Clause(ty::Clause::RegionOutlives(..)) => {}
 128         ty::PredicateKind::Clause(ty::Clause::TypeOutlives(ty::OutlivesPredicate(ty, _reg))) => {
 129             wf.compute(ty.into());
 130         }
 131         ty::PredicateKind::Clause(ty::Clause::Projection(t)) => {
 132             wf.compute_projection(t.projection_ty);
 133             wf.compute(match t.term.unpack() {
 134                 ty::TermKind::Ty(ty) => ty.into(),
 135                 ty::TermKind::Const(c) => c.into(),
 136             })
 137         }
 138         ty::PredicateKind::WellFormed(arg) => {
 139             wf.compute(arg);
 140         }
 141         ty::PredicateKind::ObjectSafe(_) => {}
 142         ty::PredicateKind::ClosureKind(..) => {}
 143         ty::PredicateKind::Subtype(ty::SubtypePredicate { a, b, a_is_expected: _ }) => {
 144             wf.compute(a.into());
 145             wf.compute(b.into());
 146         }
 147         ty::PredicateKind::Coerce(ty::CoercePredicate { a, b }) => {
 148             wf.compute(a.into());
 149             wf.compute(b.into());
 150         }
 151         ty::PredicateKind::ConstEvaluatable(ct) => {
 152             wf.compute(ct.into());
 153         }
 154         ty::PredicateKind::ConstEquate(c1, c2) => {
 155             wf.compute(c1.into());
 156             wf.compute(c2.into());
 157         }
 158         ty::PredicateKind::Ambiguous => {}
 159         ty::PredicateKind::TypeWellFormedFromEnv(..) => {
 160             bug!("TypeWellFormedFromEnv is only used for Chalk")
 161         }
 162     }
 163
 164     wf.normalize(infcx)
 165 }
 166
 167 struct WfPredicates<'tcx> {
 168     tcx: TyCtxt<'tcx>,
 169     param_env: ty::ParamEnv<'tcx>,
 170     body_id: hir::HirId,
 171     span: Span,
 172     out: Vec<traits::PredicateObligation<'tcx>>,
 173     recursion_depth: usize,
 174     item: Option<&'tcx hir::Item<'tcx>>,
 175 }
 176
 177 /// Controls whether we "elaborate" supertraits and so forth on the WF
 178 /// predicates. This is a kind of hack to address #43784. The
 179 /// underlying problem in that issue was a trait structure like:
 180 ///
 181 /// ```ignore (illustrative)
 182 /// trait Foo: Copy { }
 183 /// trait Bar: Foo { }
 184 /// impl<T: Bar> Foo for T { }
 185 /// impl<T> Bar for T { }
 186 /// ```
 187 ///
 188 /// Here, in the `Foo` impl, we will check that `T: Copy` holds -- but
 189 /// we decide that this is true because `T: Bar` is in the
 190 /// where-clauses (and we can elaborate that to include `T:
 191 /// Copy`). This wouldn't be a problem, except that when we check the
 192 /// `Bar` impl, we decide that `T: Foo` must hold because of the `Foo`
 193 /// impl. And so nowhere did we check that `T: Copy` holds!
 194 ///
 195 /// To resolve this, we elaborate the WF requirements that must be
 196 /// proven when checking impls. This means that (e.g.) the `impl Bar
 197 /// for T` will be forced to prove not only that `T: Foo` but also `T:
 198 /// Copy` (which it won't be able to do, because there is no `Copy`
 199 /// impl for `T`).
 200 #[derive(Debug, PartialEq, Eq, Copy, Clone)]
 201 enum Elaborate {
 202     All,
 203     None,
 204 }
 205
 206 fn extend_cause_with_original_assoc_item_obligation<'tcx>(
 207     tcx: TyCtxt<'tcx>,
 208     trait_ref: &ty::TraitRef<'tcx>,
 209     item: Option<&hir::Item<'tcx>>,
 210     cause: &mut traits::ObligationCause<'tcx>,
 211     pred: ty::Predicate<'tcx>,
 212 ) {
 213     debug!(
 214         "extended_cause_with_original_assoc_item_obligation {:?} {:?} {:?} {:?}",
 215         trait_ref, item, cause, pred
 216     );
 217     let (items, impl_def_id) = match item {
 218         Some(hir::Item { kind: hir::ItemKind::Impl(impl_), owner_id, .. }) => {
 219             (impl_.items, *owner_id)
 220         }
 221         _ => return,
 222     };
 223     let fix_span =
 224         |impl_item_ref: &hir::ImplItemRef| match tcx.hir().impl_item(impl_item_ref.id).kind {
 225             hir::ImplItemKind::Const(ty, _) | hir::ImplItemKind::Type(ty) => ty.span,
 226             _ => impl_item_ref.span,
 227         };
 228
 229     // It is fine to skip the binder as we don't care about regions here.
 230     match pred.kind().skip_binder() {
 231         ty::PredicateKind::Clause(ty::Clause::Projection(proj)) => {
 232             // The obligation comes not from the current `impl` nor the `trait` being implemented,
 233             // but rather from a "second order" obligation, where an associated type has a
 234             // projection coming from another associated type. See
 235             // `src/test/ui/associated-types/point-at-type-on-obligation-failure.rs` and
 236             // `traits-assoc-type-in-supertrait-bad.rs`.
 237             if let Some(ty::Alias(ty::Projection, projection_ty)) = proj.term.ty().map(|ty| ty.kind())
 238                 && let Some(&impl_item_id) =
 239                     tcx.impl_item_implementor_ids(impl_def_id).get(&projection_ty.def_id)
 240                 && let Some(impl_item_span) = items
 241                     .iter()
 242                     .find(|item| item.id.owner_id.to_def_id() == impl_item_id)
 243                     .map(fix_span)
 244             {
 245                 cause.span = impl_item_span;
 246             }
 247         }
 248         ty::PredicateKind::Clause(ty::Clause::Trait(pred)) => {
 249             // An associated item obligation born out of the `trait` failed to be met. An example
 250             // can be seen in `ui/associated-types/point-at-type-on-obligation-failure-2.rs`.
 251             debug!("extended_cause_with_original_assoc_item_obligation trait proj {:?}", pred);
 252             if let ty::Alias(ty::Projection, ty::AliasTy { def_id, .. }) = *pred.self_ty().kind()
 253                 && let Some(&impl_item_id) =
 254                     tcx.impl_item_implementor_ids(impl_def_id).get(&def_id)
 255                 && let Some(impl_item_span) = items
 256                     .iter()
 257                     .find(|item| item.id.owner_id.to_def_id() == impl_item_id)
 258                     .map(fix_span)
 259             {
 260                 cause.span = impl_item_span;
 261             }
 262         }
 263         _ => {}
 264     }
 265 }
 266
 267 impl<'tcx> WfPredicates<'tcx> {
 268     fn tcx(&self) -> TyCtxt<'tcx> {
 269         self.tcx
 270     }
 271
 272     fn cause(&self, code: traits::ObligationCauseCode<'tcx>) -> traits::ObligationCause<'tcx> {
 273         traits::ObligationCause::new(self.span, self.body_id, code)
 274     }
 275
 276     fn normalize(self, infcx: &InferCtxt<'tcx>) -> Vec<traits::PredicateObligation<'tcx>> {
 277         let cause = self.cause(traits::WellFormed(None));
 278         let param_env = self.param_env;
 279         let mut obligations = Vec::with_capacity(self.out.len());
 280         for mut obligation in self.out {
 281             assert!(!obligation.has_escaping_bound_vars());
 282             let mut selcx = traits::SelectionContext::new(infcx);
 283             // Don't normalize the whole obligation, the param env is either
 284             // already normalized, or we're currently normalizing the
 285             // param_env. Either way we should only normalize the predicate.
 286             let normalized_predicate = traits::project::normalize_with_depth_to(
 287                 &mut selcx,
 288                 param_env,
 289                 cause.clone(),
 290                 self.recursion_depth,
 291                 obligation.predicate,
 292                 &mut obligations,
 293             );
 294             obligation.predicate = normalized_predicate;
 295             obligations.push(obligation);
 296         }
 297         obligations
 298     }
 299
 300     /// Pushes the obligations required for `trait_ref` to be WF into `self.out`.
 301     fn compute_trait_pred(&mut self, trait_pred: &ty::TraitPredicate<'tcx>, elaborate: Elaborate) {
 302         let tcx = self.tcx;
 303         let trait_ref = &trait_pred.trait_ref;
 304
 305         // if the trait predicate is not const, the wf obligations should not be const as well.
 306         let obligations = if trait_pred.constness == ty::BoundConstness::NotConst {
 307             self.nominal_obligations_without_const(trait_ref.def_id, trait_ref.substs)
 308         } else {
 309             self.nominal_obligations(trait_ref.def_id, trait_ref.substs)
 310         };
 311
 312         debug!("compute_trait_pred obligations {:?}", obligations);
 313         let param_env = self.param_env;
 314         let depth = self.recursion_depth;
 315
 316         let item = self.item;
 317
 318         let extend = |traits::PredicateObligation { predicate, mut cause, .. }| {
 319             if let Some(parent_trait_pred) = predicate.to_opt_poly_trait_pred() {
 320                 cause = cause.derived_cause(
 321                     parent_trait_pred,
 322                     traits::ObligationCauseCode::DerivedObligation,
 323                 );
 324             }
 325             extend_cause_with_original_assoc_item_obligation(
 326                 tcx, trait_ref, item, &mut cause, predicate,
 327             );
 328             traits::Obligation::with_depth(tcx, cause, depth, param_env, predicate)
 329         };
 330
 331         if let Elaborate::All = elaborate {
 332             let implied_obligations = traits::util::elaborate_obligations(tcx, obligations);
 333             let implied_obligations = implied_obligations.map(extend);
 334             self.out.extend(implied_obligations);
 335         } else {
 336             self.out.extend(obligations);
 337         }
 338
 339         let tcx = self.tcx();
 340         self.out.extend(
 341             trait_ref
 342                 .substs
 343                 .iter()
 344                 .enumerate()
 345                 .filter(|(_, arg)| {
 346                     matches!(arg.unpack(), GenericArgKind::Type(..) | GenericArgKind::Const(..))
 347                 })
 348                 .filter(|(_, arg)| !arg.has_escaping_bound_vars())
 349                 .map(|(i, arg)| {
 350                     let mut cause = traits::ObligationCause::misc(self.span, self.body_id);
 351                     // The first subst is the self ty - use the correct span for it.
 352                     if i == 0 {
 353                         if let Some(hir::ItemKind::Impl(hir::Impl { self_ty, .. })) =
 354                             item.map(|i| &i.kind)
 355                         {
 356                             cause.span = self_ty.span;
 357                         }
 358                     }
 359                     traits::Obligation::with_depth(
 360                         tcx,
 361                         cause,
 362                         depth,
 363                         param_env,
 364                         ty::Binder::dummy(ty::PredicateKind::WellFormed(arg)),
 365                     )
 366                 }),
 367         );
 368     }
 369
 370     /// Pushes the obligations required for `trait_ref::Item` to be WF
 371     /// into `self.out`.
 372     fn compute_projection(&mut self, data: ty::AliasTy<'tcx>) {
 373         // A projection is well-formed if
 374         //
 375         // (a) its predicates hold (*)
 376         // (b) its substs are wf
 377         //
 378         // (*) The predicates of an associated type include the predicates of
 379         //     the trait that it's contained in. For example, given
 380         //
 381         // trait A<T>: Clone {
 382         //     type X where T: Copy;
 383         // }
 384         //
 385         // The predicates of `<() as A<i32>>::X` are:
 386         // [
 387         //     `(): Sized`
 388         //     `(): Clone`
 389         //     `(): A<i32>`
 390         //     `i32: Sized`
 391         //     `i32: Clone`
 392         //     `i32: Copy`
 393         // ]
 394         // Projection types do not require const predicates.
 395         let obligations = self.nominal_obligations_without_const(data.def_id, data.substs);
 396         self.out.extend(obligations);
 397
 398         let tcx = self.tcx();
 399         let cause = self.cause(traits::WellFormed(None));
 400         let param_env = self.param_env;
 401         let depth = self.recursion_depth;
 402
 403         self.out.extend(
 404             data.substs
 405                 .iter()
 406                 .filter(|arg| {
 407                     matches!(arg.unpack(), GenericArgKind::Type(..) | GenericArgKind::Const(..))
 408                 })
 409                 .filter(|arg| !arg.has_escaping_bound_vars())
 410                 .map(|arg| {
 411                     traits::Obligation::with_depth(
 412                         tcx,
 413                         cause.clone(),
 414                         depth,
 415                         param_env,
 416                         ty::Binder::dummy(ty::PredicateKind::WellFormed(arg)),
 417                     )
 418                 }),
 419         );
 420     }
 421
 422     fn require_sized(&mut self, subty: Ty<'tcx>, cause: traits::ObligationCauseCode<'tcx>) {
 423         if !subty.has_escaping_bound_vars() {
 424             let cause = self.cause(cause);
 425             let trait_ref = self.tcx.at(cause.span).mk_trait_ref(LangItem::Sized, [subty]);
 426             self.out.push(traits::Obligation::with_depth(
 427                 self.tcx,
 428                 cause,
 429                 self.recursion_depth,
 430                 self.param_env,
 431                 ty::Binder::dummy(trait_ref).without_const(),
 432             ));
 433         }
 434     }
 435
 436     /// Pushes all the predicates needed to validate that `ty` is WF into `out`.
 437     #[instrument(level = "debug", skip(self))]
 438     fn compute(&mut self, arg: GenericArg<'tcx>) {
 439         let mut walker = arg.walk();
 440         let param_env = self.param_env;
 441         let depth = self.recursion_depth;
 442         while let Some(arg) = walker.next() {
 443             debug!(?arg, ?self.out);
 444             let ty = match arg.unpack() {
 445                 GenericArgKind::Type(ty) => ty,
 446
 447                 // No WF constraints for lifetimes being present, any outlives
 448                 // obligations are handled by the parent (e.g. `ty::Ref`).
 449                 GenericArgKind::Lifetime(_) => continue,
 450
 451                 GenericArgKind::Const(ct) => {
 452                     match ct.kind() {
 453                         ty::ConstKind::Unevaluated(uv) => {
 454                             if !ct.has_escaping_bound_vars() {
 455                                 let obligations = self.nominal_obligations(uv.def.did, uv.substs);
 456                                 self.out.extend(obligations);
 457
 458                                 let predicate =
 459                                     ty::Binder::dummy(ty::PredicateKind::ConstEvaluatable(ct));
 460                                 let cause = self.cause(traits::WellFormed(None));
 461                                 self.out.push(traits::Obligation::with_depth(
 462                                     self.tcx(),
 463                                     cause,
 464                                     self.recursion_depth,
 465                                     self.param_env,
 466                                     predicate,
 467                                 ));
 468                             }
 469                         }
 470                         ty::ConstKind::Infer(_) => {
 471                             let cause = self.cause(traits::WellFormed(None));
 472
 473                             self.out.push(traits::Obligation::with_depth(
 474                                 self.tcx(),
 475                                 cause,
 476                                 self.recursion_depth,
 477                                 self.param_env,
 478                                 ty::Binder::dummy(ty::PredicateKind::WellFormed(ct.into())),
 479                             ));
 480                         }
 481                         ty::ConstKind::Expr(_) => {
 482                             // FIXME(generic_const_exprs): this doesnt verify that given `Expr(N + 1)` the
 483                             // trait bound `typeof(N): Add<typeof(1)>` holds. This is currently unnecessary
 484                             // as `ConstKind::Expr` is only produced via normalization of `ConstKind::Unevaluated`
 485                             // which means that the `DefId` would have been typeck'd elsewhere. However in
 486                             // the future we may allow directly lowering to `ConstKind::Expr` in which case
 487                             // we would not be proving bounds we should.
 488
 489                             let predicate =
 490                                 ty::Binder::dummy(ty::PredicateKind::ConstEvaluatable(ct));
 491                             let cause = self.cause(traits::WellFormed(None));
 492                             self.out.push(traits::Obligation::with_depth(
 493                                 self.tcx(),
 494                                 cause,
 495                                 self.recursion_depth,
 496                                 self.param_env,
 497                                 predicate,
 498                             ));
 499                         }
 500
 501                         ty::ConstKind::Error(_)
 502                         | ty::ConstKind::Param(_)
 503                         | ty::ConstKind::Bound(..)
 504                         | ty::ConstKind::Placeholder(..) => {
 505                             // These variants are trivially WF, so nothing to do here.
 506                         }
 507                         ty::ConstKind::Value(..) => {
 508                             // FIXME: Enforce that values are structurally-matchable.
 509                         }
 510                     }
 511                     continue;
 512                 }
 513             };
 514
 515             debug!("wf bounds for ty={:?} ty.kind={:#?}", ty, ty.kind());
 516
 517             match *ty.kind() {
 518                 ty::Bool
 519                 | ty::Char
 520                 | ty::Int(..)
 521                 | ty::Uint(..)
 522                 | ty::Float(..)
 523                 | ty::Error(_)
 524                 | ty::Str
 525                 | ty::GeneratorWitness(..)
 526                 | ty::Never
 527                 | ty::Param(_)
 528                 | ty::Bound(..)
 529                 | ty::Placeholder(..)
 530                 | ty::Foreign(..) => {
 531                     // WfScalar, WfParameter, etc
 532                 }
 533
 534                 // Can only infer to `ty::Int(_) | ty::Uint(_)`.
 535                 ty::Infer(ty::IntVar(_)) => {}
 536
 537                 // Can only infer to `ty::Float(_)`.
 538                 ty::Infer(ty::FloatVar(_)) => {}
 539
 540                 ty::Slice(subty) => {
 541                     self.require_sized(subty, traits::SliceOrArrayElem);
 542                 }
 543
 544                 ty::Array(subty, _) => {
 545                     self.require_sized(subty, traits::SliceOrArrayElem);
 546                     // Note that we handle the len is implicitly checked while walking `arg`.
 547                 }
 548
 549                 ty::Tuple(ref tys) => {
 550                     if let Some((_last, rest)) = tys.split_last() {
 551                         for &elem in rest {
 552                             self.require_sized(elem, traits::TupleElem);
 553                         }
 554                     }
 555                 }
 556
 557                 ty::RawPtr(_) => {
 558                     // Simple cases that are WF if their type args are WF.
 559                 }
 560
 561                 ty::Alias(ty::Projection, data) => {
 562                     walker.skip_current_subtree(); // Subtree handled by compute_projection.
 563                     self.compute_projection(data);
 564                 }
 565
 566                 ty::Adt(def, substs) => {
 567                     // WfNominalType
 568                     let obligations = self.nominal_obligations(def.did(), substs);
 569                     self.out.extend(obligations);
 570                 }
 571
 572                 ty::FnDef(did, substs) => {
 573                     let obligations = self.nominal_obligations_without_const(did, substs);
 574                     self.out.extend(obligations);
 575                 }
 576
 577                 ty::Ref(r, rty, _) => {
 578                     // WfReference
 579                     if !r.has_escaping_bound_vars() && !rty.has_escaping_bound_vars() {
 580                         let cause = self.cause(traits::ReferenceOutlivesReferent(ty));
 581                         self.out.push(traits::Obligation::with_depth(
 582                             self.tcx(),
 583                             cause,
 584                             depth,
 585                             param_env,
 586                             ty::Binder::dummy(ty::PredicateKind::Clause(ty::Clause::TypeOutlives(
 587                                 ty::OutlivesPredicate(rty, r),
 588                             ))),
 589                         ));
 590                     }
 591                 }
 592
 593                 ty::Generator(did, substs, ..) => {
 594                     // Walk ALL the types in the generator: this will
 595                     // include the upvar types as well as the yield
 596                     // type. Note that this is mildly distinct from
 597                     // the closure case, where we have to be careful
 598                     // about the signature of the closure. We don't
 599                     // have the problem of implied bounds here since
 600                     // generators don't take arguments.
 601                     let obligations = self.nominal_obligations(did, substs);
 602                     self.out.extend(obligations);
 603                 }
 604
 605                 ty::Closure(did, substs) => {
 606                     // Only check the upvar types for WF, not the rest
 607                     // of the types within. This is needed because we
 608                     // capture the signature and it may not be WF
 609                     // without the implied bounds. Consider a closure
 610                     // like `|x: &'a T|` -- it may be that `T: 'a` is
 611                     // not known to hold in the creator's context (and
 612                     // indeed the closure may not be invoked by its
 613                     // creator, but rather turned to someone who *can*
 614                     // verify that).
 615                     //
 616                     // The special treatment of closures here really
 617                     // ought not to be necessary either; the problem
 618                     // is related to #25860 -- there is no way for us
 619                     // to express a fn type complete with the implied
 620                     // bounds that it is assuming. I think in reality
 621                     // the WF rules around fn are a bit messed up, and
 622                     // that is the rot problem: `fn(&'a T)` should
 623                     // probably always be WF, because it should be
 624                     // shorthand for something like `where(T: 'a) {
 625                     // fn(&'a T) }`, as discussed in #25860.
 626                     walker.skip_current_subtree(); // subtree handled below
 627                     // FIXME(eddyb) add the type to `walker` instead of recursing.
 628                     self.compute(substs.as_closure().tupled_upvars_ty().into());
 629                     // Note that we cannot skip the generic types
 630                     // types. Normally, within the fn
 631                     // body where they are created, the generics will
 632                     // always be WF, and outside of that fn body we
 633                     // are not directly inspecting closure types
 634                     // anyway, except via auto trait matching (which
 635                     // only inspects the upvar types).
 636                     // But when a closure is part of a type-alias-impl-trait
 637                     // then the function that created the defining site may
 638                     // have had more bounds available than the type alias
 639                     // specifies. This may cause us to have a closure in the
 640                     // hidden type that is not actually well formed and
 641                     // can cause compiler crashes when the user abuses unsafe
 642                     // code to procure such a closure.
 643                     // See src/test/ui/type-alias-impl-trait/wf_check_closures.rs
 644                     let obligations = self.nominal_obligations(did, substs);
 645                     self.out.extend(obligations);
 646                 }
 647
 648                 ty::FnPtr(_) => {
 649                     // let the loop iterate into the argument/return
 650                     // types appearing in the fn signature
 651                 }
 652
 653                 ty::Alias(ty::Opaque, ty::AliasTy { def_id, substs, .. }) => {
 654                     // All of the requirements on type parameters
 655                     // have already been checked for `impl Trait` in
 656                     // return position. We do need to check type-alias-impl-trait though.
 657                     if ty::is_impl_trait_defn(self.tcx, def_id).is_none() {
 658                         let obligations = self.nominal_obligations(def_id, substs);
 659                         self.out.extend(obligations);
 660                     }
 661                 }
 662
 663                 ty::Dynamic(data, r, _) => {
 664                     // WfObject
 665                     //
 666                     // Here, we defer WF checking due to higher-ranked
 667                     // regions. This is perhaps not ideal.
 668                     self.from_object_ty(ty, data, r);
 669
 670                     // FIXME(#27579) RFC also considers adding trait
 671                     // obligations that don't refer to Self and
 672                     // checking those
 673
 674                     let defer_to_coercion = self.tcx().features().object_safe_for_dispatch;
 675
 676                     if !defer_to_coercion {
 677                         let cause = self.cause(traits::WellFormed(None));
 678                         let component_traits = data.auto_traits().chain(data.principal_def_id());
 679                         let tcx = self.tcx();
 680                         self.out.extend(component_traits.map(|did| {
 681                             traits::Obligation::with_depth(
 682                                 tcx,
 683                                 cause.clone(),
 684                                 depth,
 685                                 param_env,
 686                                 ty::Binder::dummy(ty::PredicateKind::ObjectSafe(did)),
 687                             )
 688                         }));
 689                     }
 690                 }
 691
 692                 // Inference variables are the complicated case, since we don't
 693                 // know what type they are. We do two things:
 694                 //
 695                 // 1. Check if they have been resolved, and if so proceed with
 696                 //    THAT type.
 697                 // 2. If not, we've at least simplified things (e.g., we went
 698                 //    from `Vec<$0>: WF` to `$0: WF`), so we can
 699                 //    register a pending obligation and keep
 700                 //    moving. (Goal is that an "inductive hypothesis"
 701                 //    is satisfied to ensure termination.)
 702                 // See also the comment on `fn obligations`, describing "livelock"
 703                 // prevention, which happens before this can be reached.
 704                 ty::Infer(_) => {
 705                     let cause = self.cause(traits::WellFormed(None));
 706                     self.out.push(traits::Obligation::with_depth(
 707                         self.tcx(),
 708                         cause,
 709                         self.recursion_depth,
 710                         param_env,
 711                         ty::Binder::dummy(ty::PredicateKind::WellFormed(ty.into())),
 712                     ));
 713                 }
 714             }
 715
 716             debug!(?self.out);
 717         }
 718     }
 719
 720     #[instrument(level = "debug", skip(self))]
 721     fn nominal_obligations_inner(
 722         &mut self,
 723         def_id: DefId,
 724         substs: SubstsRef<'tcx>,
 725         remap_constness: bool,
 726     ) -> Vec<traits::PredicateObligation<'tcx>> {
 727         let predicates = self.tcx.predicates_of(def_id);
 728         let mut origins = vec![def_id; predicates.predicates.len()];
 729         let mut head = predicates;
 730         while let Some(parent) = head.parent {
 731             head = self.tcx.predicates_of(parent);
 732             origins.extend(iter::repeat(parent).take(head.predicates.len()));
 733         }
 734
 735         let predicates = predicates.instantiate(self.tcx, substs);
 736         trace!("{:#?}", predicates);
 737         debug_assert_eq!(predicates.predicates.len(), origins.len());
 738
 739         iter::zip(iter::zip(predicates.predicates, predicates.spans), origins.into_iter().rev())
 740             .map(|((mut pred, span), origin_def_id)| {
 741                 let code = if span.is_dummy() {
 742                     traits::ItemObligation(origin_def_id)
 743                 } else {
 744                     traits::BindingObligation(origin_def_id, span)
 745                 };
 746                 let cause = self.cause(code);
 747                 if remap_constness {
 748                     pred = pred.without_const(self.tcx);
 749                 }
 750                 traits::Obligation::with_depth(
 751                     self.tcx,
 752                     cause,
 753                     self.recursion_depth,
 754                     self.param_env,
 755                     pred,
 756                 )
 757             })
 758             .filter(|pred| !pred.has_escaping_bound_vars())
 759             .collect()
 760     }
 761
 762     fn nominal_obligations(
 763         &mut self,
 764         def_id: DefId,
 765         substs: SubstsRef<'tcx>,
 766     ) -> Vec<traits::PredicateObligation<'tcx>> {
 767         self.nominal_obligations_inner(def_id, substs, false)
 768     }
 769
 770     fn nominal_obligations_without_const(
 771         &mut self,
 772         def_id: DefId,
 773         substs: SubstsRef<'tcx>,
 774     ) -> Vec<traits::PredicateObligation<'tcx>> {
 775         self.nominal_obligations_inner(def_id, substs, true)
 776     }
 777
 778     fn from_object_ty(
 779         &mut self,
 780         ty: Ty<'tcx>,
 781         data: &'tcx ty::List<ty::PolyExistentialPredicate<'tcx>>,
 782         region: ty::Region<'tcx>,
 783     ) {
 784         // Imagine a type like this:
 785         //
 786         //     trait Foo { }
 787         //     trait Bar<'c> : 'c { }
 788         //
 789         //     &'b (Foo+'c+Bar<'d>)
 790         //         ^
 791         //
 792         // In this case, the following relationships must hold:
 793         //
 794         //     'b <= 'c
 795         //     'd <= 'c
 796         //
 797         // The first conditions is due to the normal region pointer
 798         // rules, which say that a reference cannot outlive its
 799         // referent.
 800         //
 801         // The final condition may be a bit surprising. In particular,
 802         // you may expect that it would have been `'c <= 'd`, since
 803         // usually lifetimes of outer things are conservative
 804         // approximations for inner things. However, it works somewhat
 805         // differently with trait objects: here the idea is that if the
 806         // user specifies a region bound (`'c`, in this case) it is the
 807         // "master bound" that *implies* that bounds from other traits are
 808         // all met. (Remember that *all bounds* in a type like
 809         // `Foo+Bar+Zed` must be met, not just one, hence if we write
 810         // `Foo<'x>+Bar<'y>`, we know that the type outlives *both* 'x and
 811         // 'y.)
 812         //
 813         // Note: in fact we only permit builtin traits, not `Bar<'d>`, I
 814         // am looking forward to the future here.
 815         if !data.has_escaping_bound_vars() && !region.has_escaping_bound_vars() {
 816             let implicit_bounds = object_region_bounds(self.tcx, data);
 817
 818             let explicit_bound = region;
 819
 820             self.out.reserve(implicit_bounds.len());
 821             for implicit_bound in implicit_bounds {
 822                 let cause = self.cause(traits::ObjectTypeBound(ty, explicit_bound));
 823                 let outlives =
 824                     ty::Binder::dummy(ty::OutlivesPredicate(explicit_bound, implicit_bound));
 825                 self.out.push(traits::Obligation::with_depth(
 826                     self.tcx,
 827                     cause,
 828                     self.recursion_depth,
 829                     self.param_env,
 830                     outlives,
 831                 ));
 832             }
 833         }
 834     }
 835 }
 836
 837 /// Given an object type like `SomeTrait + Send`, computes the lifetime
 838 /// bounds that must hold on the elided self type. These are derived
 839 /// from the declarations of `SomeTrait`, `Send`, and friends -- if
 840 /// they declare `trait SomeTrait : 'static`, for example, then
 841 /// `'static` would appear in the list. The hard work is done by
 842 /// `infer::required_region_bounds`, see that for more information.
 843 pub fn object_region_bounds<'tcx>(
 844     tcx: TyCtxt<'tcx>,
 845     existential_predicates: &'tcx ty::List<ty::PolyExistentialPredicate<'tcx>>,
 846 ) -> Vec<ty::Region<'tcx>> {
 847     // Since we don't actually *know* the self type for an object,
 848     // this "open(err)" serves as a kind of dummy standin -- basically
 849     // a placeholder type.
 850     let open_ty = tcx.mk_ty_infer(ty::FreshTy(0));
 851
 852     let predicates = existential_predicates.iter().filter_map(|predicate| {
 853         if let ty::ExistentialPredicate::Projection(_) = predicate.skip_binder() {
 854             None
 855         } else {
 856             Some(predicate.with_self_ty(tcx, open_ty))
 857         }
 858     });
 859
 860     required_region_bounds(tcx, open_ty, predicates)
 861 }
 862
 863 /// Given a set of predicates that apply to an object type, returns
 864 /// the region bounds that the (erased) `Self` type must
 865 /// outlive. Precisely *because* the `Self` type is erased, the
 866 /// parameter `erased_self_ty` must be supplied to indicate what type
 867 /// has been used to represent `Self` in the predicates
 868 /// themselves. This should really be a unique type; `FreshTy(0)` is a
 869 /// popular choice.
 870 ///
 871 /// N.B., in some cases, particularly around higher-ranked bounds,
 872 /// this function returns a kind of conservative approximation.
 873 /// That is, all regions returned by this function are definitely
 874 /// required, but there may be other region bounds that are not
 875 /// returned, as well as requirements like `for<'a> T: 'a`.
 876 ///
 877 /// Requires that trait definitions have been processed so that we can
 878 /// elaborate predicates and walk supertraits.
 879 #[instrument(skip(tcx, predicates), level = "debug", ret)]
 880 pub(crate) fn required_region_bounds<'tcx>(
 881     tcx: TyCtxt<'tcx>,
 882     erased_self_ty: Ty<'tcx>,
 883     predicates: impl Iterator<Item = ty::Predicate<'tcx>>,
 884 ) -> Vec<ty::Region<'tcx>> {
 885     assert!(!erased_self_ty.has_escaping_bound_vars());
 886
 887     traits::elaborate_predicates(tcx, predicates)
 888         .filter_map(|obligation| {
 889             debug!(?obligation);
 890             match obligation.predicate.kind().skip_binder() {
 891                 ty::PredicateKind::Clause(ty::Clause::Projection(..))
 892                 | ty::PredicateKind::Clause(ty::Clause::Trait(..))
 893                 | ty::PredicateKind::Subtype(..)
 894                 | ty::PredicateKind::Coerce(..)
 895                 | ty::PredicateKind::WellFormed(..)
 896                 | ty::PredicateKind::ObjectSafe(..)
 897                 | ty::PredicateKind::ClosureKind(..)
 898                 | ty::PredicateKind::Clause(ty::Clause::RegionOutlives(..))
 899                 | ty::PredicateKind::ConstEvaluatable(..)
 900                 | ty::PredicateKind::ConstEquate(..)
 901                 | ty::PredicateKind::Ambiguous
 902                 | ty::PredicateKind::TypeWellFormedFromEnv(..) => None,
 903                 ty::PredicateKind::Clause(ty::Clause::TypeOutlives(ty::OutlivesPredicate(
 904                     ref t,
 905                     ref r,
 906                 ))) => {
 907                     // Search for a bound of the form `erased_self_ty
 908                     // : 'a`, but be wary of something like `for<'a>
 909                     // erased_self_ty : 'a` (we interpret a
 910                     // higher-ranked bound like that as 'static,
 911                     // though at present the code in `fulfill.rs`
 912                     // considers such bounds to be unsatisfiable, so
 913                     // it's kind of a moot point since you could never
 914                     // construct such an object, but this seems
 915                     // correct even if that code changes).
 916                     if t == &erased_self_ty && !r.has_escaping_bound_vars() {
 917                         Some(*r)
 918                     } else {
 919                         None
 920                     }
 921                 }
 922             }
 923         })
 924         .collect()
 925 }