rustc_infer/infer/outlives/

obligations.rs

//! Code that handles "type-outlives" constraints like `T: 'a`. This
//! is based on the `push_outlives_components` function defined in rustc_infer,
//! but it adds a bit of heuristics on top, in particular to deal with
//! associated types and projections.
//!
//! When we process a given `T: 'a` obligation, we may produce two
//! kinds of constraints for the region inferencer:
//!
//! - Relationships between inference variables and other regions.
//!   For example, if we have `&'?0 u32: 'a`, then we would produce
//!   a constraint that `'a <= '?0`.
//! - "Verifys" that must be checked after inferencing is done.
//!   For example, if we know that, for some type parameter `T`,
//!   `T: 'a + 'b`, and we have a requirement that `T: '?1`,
//!   then we add a "verify" that checks that `'?1 <= 'a || '?1 <= 'b`.
//!   - Note the difference with the previous case: here, the region
//!     variable must be less than something else, so this doesn't
//!     affect how inference works (it finds the smallest region that
//!     will do); it's just a post-condition that we have to check.
//!
//! **The key point is that once this function is done, we have
//! reduced all of our "type-region outlives" obligations into relationships
//! between individual regions.**
//!
//! One key input to this function is the set of "region-bound pairs".
//! These are basically the relationships between type parameters and
//! regions that are in scope at the point where the outlives
//! obligation was incurred. **When type-checking a function,
//! particularly in the face of closures, this is not known until
//! regionck runs!** This is because some of those bounds come
//! from things we have yet to infer.
//!
//! Consider:
//!
//! ```
//! fn bar<T>(a: T, b: impl for<'a> Fn(&'a T)) {}
//! fn foo<T>(x: T) {
//!     bar(x, |y| { /* ... */})
//!     //      ^ closure arg
//! }
//! ```
//!
//! Here, the type of `y` may involve inference variables and the
//! like, and it may also contain implied bounds that are needed to
//! type-check the closure body (e.g., here it informs us that `T`
//! outlives the late-bound region `'a`).
//!
//! Note that by delaying the gathering of implied bounds until all
//! inference information is known, we may find relationships between
//! bound regions and other regions in the environment. For example,
//! when we first check a closure like the one expected as argument
//! to `foo`:
//!
//! ```
//! fn foo<U, F: for<'a> FnMut(&'a U)>(_f: F) {}
//! ```
//!
//! the type of the closure's first argument would be `&'a ?U`. We
//! might later infer `?U` to something like `&'b u32`, which would
//! imply that `'b: 'a`.

use rustc_data_structures::transitive_relation::{TransitiveRelation, TransitiveRelationBuilder};
use rustc_data_structures::undo_log::UndoLogs;
use rustc_middle::bug;
use rustc_middle::mir::ConstraintCategory;
use rustc_middle::ty::outlives::{Component, push_outlives_components};
use rustc_middle::ty::{
    self, GenericArgKind, GenericArgsRef, PolyTypeOutlivesClause, Region, RegionVid, Ty, TyCtxt,
    TypeVisitableExt, Upcast,
};
use rustc_type_ir::region_constraint::{self, LeafRegionConstraint};
use smallvec::smallvec;
use tracing::{debug, instrument};

use super::env::OutlivesEnvironment;
use crate::infer::outlives::env::RegionBoundPairs;
use crate::infer::outlives::verify::VerifyBoundCx;
use crate::infer::snapshot::undo_log::UndoLog;
use crate::infer::{
    self, GenericKind, InferCtxt, SolverRegionConstraint, SubregionOrigin, TypeOutlivesConstraint,
    VerifyBound,
};
use crate::traits::{ObligationCause, ObligationCauseCode};

impl<'tcx> InferCtxt<'tcx> {
    pub fn register_outlives_constraint(
        &self,
        ty::OutlivesClause(arg, r2): ty::ArgOutlivesClause<'tcx>,
        vis: ty::VisibleForLeakCheck,
        cause: &ObligationCause<'tcx>,
    ) {
        match arg.kind() {
            ty::GenericArgKind::Lifetime(r1) => {
                self.register_region_outlives_constraint(ty::OutlivesClause(r1, r2), vis, cause);
            }
            ty::GenericArgKind::Type(ty1) => {
                self.register_type_outlives_constraint(ty1, r2, cause);
            }
            ty::GenericArgKind::Const(_) => unreachable!(),
        }
    }

    pub fn register_region_eq_constraint(
        &self,
        ty::RegionEqPredicate(r_a, r_b): ty::RegionEqPredicate<'tcx>,
        vis: ty::VisibleForLeakCheck,
        cause: &ObligationCause<'tcx>,
    ) {
        let origin = SubregionOrigin::from_obligation_cause(cause, || {
            SubregionOrigin::RelateRegionParamBound(cause.span, None)
        });
        self.equate_regions(origin, r_a, r_b, vis);
    }

    pub fn register_region_outlives_constraint(
        &self,
        ty::OutlivesClause(r_a, r_b): ty::RegionOutlivesClause<'tcx>,
        vis: ty::VisibleForLeakCheck,
        cause: &ObligationCause<'tcx>,
    ) {
        let origin = SubregionOrigin::from_obligation_cause(cause, || {
            SubregionOrigin::RelateRegionParamBound(cause.span, None)
        });
        // `'a: 'b` ==> `'b <= 'a`
        self.sub_regions(origin, r_b, r_a, vis);
    }

    /// Registers that the given region obligation must be resolved
    /// from within the scope of `body_id`. These regions are enqueued
    /// and later processed by regionck, when full type information is
    /// available (see `region_obligations` field for more
    /// information).
    #[instrument(level = "debug", skip(self))]
    pub fn register_type_outlives_constraint_inner(
        &self,
        obligation: TypeOutlivesConstraint<'tcx>,
    ) {
        let mut inner = self.inner.borrow_mut();
        inner.undo_log.push(UndoLog::PushTypeOutlivesConstraint);
        inner.region_obligations.push(obligation);
    }

    pub fn register_solver_region_constraint(&self, c: SolverRegionConstraint<'tcx>) {
        let mut inner = self.inner.borrow_mut();

        let old_constraint = inner.solver_region_constraint_storage.get_constraint();
        let new_constraint = rustc_type_ir::region_constraint::RegionConstraint::build_and(
            c,
            old_constraint.clone(),
        );

        // FIXME(-Zassumptions-on-binders): This is pretty bad for perf, we don't make incremental
        // changes to the region constraints, instead we just rewrite the entire thing every time
        // and store the old version.
        inner.undo_log.push(UndoLog::OverwriteSolverRegionConstraint { old_constraint });
        inner.solver_region_constraint_storage.overwrite(new_constraint);
    }

    pub fn register_type_outlives_constraint(
        &self,
        sup_type: Ty<'tcx>,
        sub_region: Region<'tcx>,
        cause: &ObligationCause<'tcx>,
    ) {
        assert!(!self.tcx.assumptions_on_binders());

        // `is_global` means the type has no params, infer, placeholder, or non-`'static`
        // free regions. If the type has none of these things, then we can skip registering
        // this outlives obligation since it has no components which affect lifetime
        // checking in an interesting way.
        if sup_type.is_global() {
            return;
        }

        debug!(?sup_type, ?sub_region, ?cause);
        let origin = SubregionOrigin::from_obligation_cause(cause, || {
            SubregionOrigin::RelateParamBound(
                cause.span,
                sup_type,
                match cause.code().peel_derives() {
                    ObligationCauseCode::WhereClause(_, span)
                    | ObligationCauseCode::WhereClauseInExpr(_, span, ..)
                    | ObligationCauseCode::OpaqueTypeBound(span, _)
                        if !span.is_dummy() =>
                    {
                        Some(*span)
                    }
                    _ => None,
                },
            )
        });

        self.register_type_outlives_constraint_inner(TypeOutlivesConstraint {
            sup_type,
            sub_region,
            origin,
        });
    }

    /// Trait queries just want to pass back type obligations "as is"
    pub fn take_registered_region_obligations(&self) -> Vec<TypeOutlivesConstraint<'tcx>> {
        assert!(!self.in_snapshot(), "cannot take registered region obligations in a snapshot");
        std::mem::take(&mut self.inner.borrow_mut().region_obligations)
    }

    pub fn num_registered_region_obligations(&self) -> usize {
        self.inner.borrow().region_obligations.len()
    }

    pub fn registered_region_obligations_since(
        &self,
        prev: usize,
    ) -> Vec<TypeOutlivesConstraint<'tcx>> {
        self.inner.borrow().region_obligations.iter().skip(prev).cloned().collect()
    }

    pub fn clone_registered_region_obligations(&self) -> Vec<TypeOutlivesConstraint<'tcx>> {
        self.inner.borrow().region_obligations.clone()
    }

    pub fn register_region_assumption(&self, assumption: ty::ArgOutlivesClause<'tcx>) {
        let mut inner = self.inner.borrow_mut();
        inner.undo_log.push(UndoLog::PushRegionAssumption);
        inner.region_assumptions.push(assumption);
    }

    pub fn take_registered_region_assumptions(&self) -> Vec<ty::ArgOutlivesClause<'tcx>> {
        assert!(!self.in_snapshot(), "cannot take registered region assumptions in a snapshot");
        std::mem::take(&mut self.inner.borrow_mut().region_assumptions)
    }

    pub fn destructure_solver_region_constraints_for_regionck(
        &self,
        outlives_env: &OutlivesEnvironment<'tcx>,
    ) {
        // `FreeRegionMap::relation` stores `'sub <= 'sup` edges while
        // `Assumptions::region_outlives` expects `'longer: 'shorter` ones, so the
        // edges have to be inverted here.
        let mut region_outlives = TransitiveRelationBuilder::default();
        for (r1, r2) in outlives_env.free_region_map().relation.base_edges() {
            region_outlives.add(r2, r1);
        }
        let assumptions = rustc_type_ir::region_constraint::Assumptions::new(
            self,
            assumed_type_outlives(
                self.tcx,
                outlives_env.known_type_outlives(),
                outlives_env.region_bound_pairs(),
            ),
            region_outlives.freeze(),
            ty::UniverseIndex::ROOT,
        );
        self.destructure_solver_region_constraints(assumptions, self);
    }

    pub fn destructure_solver_region_constraints_for_borrowck(
        &self,
        // this is always ConstraintConversion but lol
        conversion: impl TypeOutlivesDelegate<'tcx>,
        known_type_outlives: &[PolyTypeOutlivesClause<'tcx>],
        region_bound_pairs: &RegionBoundPairs<'tcx>,
        region_outlives: TransitiveRelation<RegionVid>,
    ) {
        let assumptions = region_constraint::Assumptions::new(
            self,
            assumed_type_outlives(self.tcx, known_type_outlives, region_bound_pairs),
            region_outlives.maybe_map(|r| Some(Region::new_var(self.tcx, r))).unwrap(),
            ty::UniverseIndex::ROOT,
        );
        self.destructure_solver_region_constraints(assumptions, conversion);
    }

    #[instrument(level = "debug", skip(self, conversion))]
    pub fn destructure_solver_region_constraints(
        &self,
        assumptions: rustc_type_ir::region_constraint::Assumptions<TyCtxt<'tcx>>,
        mut conversion: impl TypeOutlivesDelegate<'tcx>,
    ) {
        assert!(self.tcx.assumptions_on_binders());
        assert!(self.next_trait_solver());

        let constraint = self.inner.borrow().solver_region_constraint_storage.get_constraint();
        debug!(?constraint);
        let constraint = region_constraint::destructure_type_outlives_constraints_in_root(
            self,
            constraint,
            &assumptions,
        );
        debug!(?constraint);
        let constraint = region_constraint::propagate_ambiguity(constraint);
        debug!(?constraint);

        // FIXME(-Zassumptions-on-binders): actually implement OR as an  OR
        for c in constraint.and_constraint.0.into_iter().chain(
            constraint
                .or_constraint
                .0
                .into_iter()
                .flat_map(|and_constraint| and_constraint.0.into_iter()),
        ) {
            use LeafRegionConstraint::*;

            match c {
                Ambiguity(span) => {
                    self.dcx()
                        .struct_span_err(
                            span,
                            "unable to satisfy constraints involving placeholders due to unknown implied bounds",
                        )
                        .emit();
                }
                RegionOutlives(a, b, span) => {
                    let origin = SubregionOrigin::SolverRegionConstraint(span);
                    let category = origin.to_constraint_category();
                    conversion.push_sub_region_constraint(
                        origin, // we flip these because regionck is silly :>
                        b, a, category,
                    );
                }
                AliasTyOutlivesViaEnv(..) | PlaceholderTyOutlives(..) => {
                    unreachable!()
                }
            }
        }
    }

    /// Process the region obligations that must be proven (during
    /// `regionck`) for the given `body_id`, given information about
    /// the region bounds in scope and so forth.
    ///
    /// See the `region_obligations` field of `InferCtxt` for some
    /// comments about how this function fits into the overall expected
    /// flow of the inferencer. The key point is that it is
    /// invoked after all type-inference variables have been bound --
    /// right before lexical region resolution.
    #[instrument(level = "debug", skip(self, outlives_env))]
    pub fn process_registered_region_obligations(&self, outlives_env: &OutlivesEnvironment<'tcx>) {
        use rustc_type_ir::InferCtxtLike;
        assert!(!self.in_snapshot(), "cannot process registered region obligations in a snapshot");

        if self.tcx.assumptions_on_binders() {
            self.destructure_solver_region_constraints_for_regionck(outlives_env);
        }

        // Must loop since the process of normalizing may itself register region obligations.
        for iteration in 0.. {
            let my_region_obligations = self.take_registered_region_obligations();
            if my_region_obligations.is_empty() {
                break;
            }

            if !self.tcx.recursion_limit().value_within_limit(iteration) {
                // This may actually be reachable. If so, we should convert
                // this to a proper error/consider whether we should detect
                // this somewhere else.
                bug!(
                    "unexpected overflowed when processing region obligations: {my_region_obligations:#?}"
                );
            }

            for TypeOutlivesConstraint { sup_type, sub_region, origin } in my_region_obligations {
                // `TypeOutlives` is structural, so we should try to opportunistically resolve all
                // region vids before processing regions, so we have a better chance to match clauses
                // in our param-env.
                //
                // We *want* this folder to live in `rustc_type_ir`. Our best way to call into it is
                // through `InferCtxtLike` and it is not defined as an inherent method on `InferCtxt`.
                #[allow(rustc::usage_of_type_ir_traits)]
                let (sup_type, sub_region) =
                    self.deeply_resolve_via_unification_table((sup_type, sub_region));

                if self.tcx.sess.opts.unstable_opts.higher_ranked_assumptions
                    && outlives_env
                        .higher_ranked_assumptions()
                        .contains(&ty::OutlivesClause(sup_type.into(), sub_region))
                {
                    continue;
                }

                debug!(?sup_type, ?sub_region, ?origin);

                let outlives = &mut TypeOutlives::new(
                    self,
                    self.tcx,
                    outlives_env.region_bound_pairs(),
                    None,
                    outlives_env.known_type_outlives(),
                );
                let category = origin.to_constraint_category();
                outlives.type_must_outlive(origin, sup_type, sub_region, category);
            }
        }
    }
}

/// The type outlives assumptions available in the root context, as clauses for
/// [`region_constraint::Assumptions::new`] to elaborate.
///
/// `known_type_outlives` only contains the explicit `Ty: 'a` where clauses. The implied bounds,
/// e.g. `T: 'a` from a `&'a T` argument, are only tracked in `region_bound_pairs` so we have to
/// pull them in separately. Without them we'd fail to prove `T: 'a` for a `&'a T` argument
/// whenever the only explicit bound on `T` mentions a different region.
fn assumed_type_outlives<'tcx>(
    tcx: TyCtxt<'tcx>,
    known_type_outlives: &[PolyTypeOutlivesClause<'tcx>],
    region_bound_pairs: &RegionBoundPairs<'tcx>,
) -> Vec<ty::Clause<'tcx>> {
    known_type_outlives
        .iter()
        .copied()
        .chain(region_bound_pairs.iter().map(|&ty::OutlivesClause(kind, r)| {
            ty::Binder::dummy(ty::OutlivesClause(kind.to_ty(tcx), r))
        }))
        .map(|c| c.map_bound(ty::ClauseKind::TypeOutlives).upcast(tcx))
        .collect()
}

/// The `TypeOutlives` struct has the job of "lowering" a `T: 'a`
/// obligation into a series of `'a: 'b` constraints and "verify"s, as
/// described on the module comment. The final constraints are emitted
/// via a "delegate" of type `D` -- this is usually the `infcx`, which
/// accrues them into the `region_obligations` code, but for NLL we
/// use something else.
pub struct TypeOutlives<'cx, 'tcx, D>
where
    D: TypeOutlivesDelegate<'tcx>,
{
    // See the comments on `process_registered_region_obligations` for the meaning
    // of these fields.
    delegate: D,
    tcx: TyCtxt<'tcx>,
    verify_bound: VerifyBoundCx<'cx, 'tcx>,
}

pub trait TypeOutlivesDelegate<'tcx> {
    fn push_sub_region_constraint(
        &mut self,
        origin: SubregionOrigin<'tcx>,
        a: ty::Region<'tcx>,
        b: ty::Region<'tcx>,
        constraint_category: ConstraintCategory<'tcx>,
    );

    fn push_verify(
        &mut self,
        origin: SubregionOrigin<'tcx>,
        kind: GenericKind<'tcx>,
        a: ty::Region<'tcx>,
        bound: VerifyBound<'tcx>,
    );
}

impl<'cx, 'tcx, D> TypeOutlives<'cx, 'tcx, D>
where
    D: TypeOutlivesDelegate<'tcx>,
{
    pub fn new(
        delegate: D,
        tcx: TyCtxt<'tcx>,
        region_bound_pairs: &'cx RegionBoundPairs<'tcx>,
        implicit_region_bound: Option<ty::Region<'tcx>>,
        caller_bounds: &'cx [ty::PolyTypeOutlivesClause<'tcx>],
    ) -> Self {
        Self {
            delegate,
            tcx,
            verify_bound: VerifyBoundCx::new(
                tcx,
                region_bound_pairs,
                implicit_region_bound,
                caller_bounds,
            ),
        }
    }

    /// Adds constraints to inference such that `T: 'a` holds (or
    /// reports an error if it cannot).
    ///
    /// # Parameters
    ///
    /// - `origin`, the reason we need this constraint
    /// - `ty`, the type `T`
    /// - `region`, the region `'a`
    #[instrument(level = "debug", skip(self))]
    pub fn type_must_outlive(
        &mut self,
        origin: infer::SubregionOrigin<'tcx>,
        ty: Ty<'tcx>,
        region: ty::Region<'tcx>,
        category: ConstraintCategory<'tcx>,
    ) {
        assert!(!ty.has_escaping_bound_vars());
        debug_assert!(!ty.has_non_region_infer());
        debug_assert!(
            !self.tcx.next_trait_solver_globally() || !ty.has_non_rigid_aliases(),
            "{ty:?} has non-rigid aliases"
        );

        let mut components = smallvec![];
        push_outlives_components(self.tcx, ty, &mut components);
        self.components_must_outlive(origin, &components, region, category);
    }

    fn components_must_outlive(
        &mut self,
        origin: infer::SubregionOrigin<'tcx>,
        components: &[Component<TyCtxt<'tcx>>],
        region: ty::Region<'tcx>,
        category: ConstraintCategory<'tcx>,
    ) {
        for component in components.iter() {
            let origin = origin.clone();
            match component {
                Component::Region(region1) => {
                    self.delegate.push_sub_region_constraint(origin, region, *region1, category);
                }
                Component::Param(param_ty) => {
                    self.param_ty_must_outlive(origin, region, *param_ty);
                }
                Component::Placeholder(placeholder_ty) => {
                    self.placeholder_ty_must_outlive(origin, region, *placeholder_ty);
                }
                Component::Alias(is_rigid, alias_ty) => {
                    debug_assert_eq!(*is_rigid, ty::IsRigid::yes_if_next_solver(self.tcx));
                    self.alias_ty_must_outlive(origin, region, *alias_ty);
                }
                Component::EscapingAlias(subcomponents) => {
                    self.components_must_outlive(origin, subcomponents, region, category);
                }
                Component::UnresolvedInferenceVariable(v) => {
                    // Ignore this, we presume it will yield an error later,
                    // since if a type variable is not resolved by this point
                    // it never will be.
                    self.tcx.dcx().span_delayed_bug(
                        origin.span(),
                        format!("unresolved inference variable in outlives: {v:?}"),
                    );
                }
            }
        }
    }

    #[instrument(level = "debug", skip(self))]
    fn param_ty_must_outlive(
        &mut self,
        origin: infer::SubregionOrigin<'tcx>,
        region: ty::Region<'tcx>,
        param_ty: ty::ParamTy,
    ) {
        let verify_bound = self.verify_bound.param_or_placeholder_bound(param_ty.to_ty(self.tcx));
        self.delegate.push_verify(origin, GenericKind::Param(param_ty), region, verify_bound);
    }

    #[instrument(level = "debug", skip(self))]
    fn placeholder_ty_must_outlive(
        &mut self,
        origin: infer::SubregionOrigin<'tcx>,
        region: ty::Region<'tcx>,
        placeholder_ty: ty::PlaceholderType<'tcx>,
    ) {
        let verify_bound = self
            .verify_bound
            .param_or_placeholder_bound(Ty::new_placeholder(self.tcx, placeholder_ty));
        self.delegate.push_verify(
            origin,
            GenericKind::Placeholder(placeholder_ty),
            region,
            verify_bound,
        );
    }

    #[instrument(level = "debug", skip(self))]
    fn alias_ty_must_outlive(
        &mut self,
        origin: infer::SubregionOrigin<'tcx>,
        region: ty::Region<'tcx>,
        alias_ty: ty::AliasTy<'tcx>,
    ) {
        // An optimization for a common case with opaque types.
        if alias_ty.args.is_empty() {
            return;
        }

        if alias_ty.has_non_region_infer() {
            self.tcx
                .dcx()
                .span_delayed_bug(origin.span(), "an alias has infers during region solving");
            return;
        }

        // This case is thorny for inference. The fundamental problem is
        // that there are many cases where we have choice, and inference
        // doesn't like choice (the current region inference in
        // particular). :) First off, we have to choose between using the
        // OutlivesProjectionEnv, OutlivesProjectionTraitDef, and
        // OutlivesProjectionComponent rules, any one of which is
        // sufficient. If there are no inference variables involved, it's
        // not hard to pick the right rule, but if there are, we're in a
        // bit of a catch 22: if we picked which rule we were going to
        // use, we could add constraints to the region inference graph
        // that make it apply, but if we don't add those constraints, the
        // rule might not apply (but another rule might). For now, we err
        // on the side of adding too few edges into the graph.

        // Compute the bounds we can derive from the trait definition.
        // These are guaranteed to apply, no matter the inference
        // results.
        let trait_bounds: Vec<_> =
            rustc_type_ir::outlives::declared_bounds_from_definition(self.tcx, alias_ty).collect();

        debug!(?trait_bounds);

        // Compute the bounds we can derive from the environment. This
        // is an "approximate" match -- in some cases, these bounds
        // may not apply.
        let approx_env_bounds = self.verify_bound.approx_declared_bounds_from_env(alias_ty);
        debug!(?approx_env_bounds);

        // If declared bounds list is empty, the only applicable rule is
        // OutlivesProjectionComponent. If there are inference variables,
        // then, we can break down the outlives into more primitive
        // components without adding unnecessary edges.
        //
        // If there are *no* inference variables, however, we COULD do
        // this, but we choose not to, because the error messages are less
        // good. For example, a requirement like `T::Item: 'r` would be
        // translated to a requirement that `T: 'r`; when this is reported
        // to the user, it will thus say "T: 'r must hold so that T::Item:
        // 'r holds". But that makes it sound like the only way to fix
        // the problem is to add `T: 'r`, which isn't true. So, if there are no
        // inference variables, we use a verify constraint instead of adding
        // edges, which winds up enforcing the same condition.
        let kind = alias_ty.kind;
        if approx_env_bounds.is_empty()
            && trait_bounds.is_empty()
            && (alias_ty.has_infer_regions() || matches!(kind, ty::Opaque { .. }))
        {
            debug!("no declared bounds");
            let opt_variances = self.tcx.opt_alias_variances(kind);
            self.args_must_outlive(alias_ty.args, origin, region, opt_variances);
            return;
        }

        // If we found a unique bound `'b` from the trait, and we
        // found nothing else from the environment, then the best
        // action is to require that `'b: 'r`, so do that.
        //
        // This is best no matter what rule we use:
        //
        // - OutlivesProjectionEnv: these would translate to the requirement that `'b:'r`
        // - OutlivesProjectionTraitDef: these would translate to the requirement that `'b:'r`
        // - OutlivesProjectionComponent: this would require `'b:'r`
        //   in addition to other conditions
        if !trait_bounds.is_empty()
            && trait_bounds[1..]
                .iter()
                .map(|r| Some(*r))
                .chain(
                    // NB: The environment may contain `for<'a> T: 'a` style bounds.
                    // In that case, we don't know if they are equal to the trait bound
                    // or not (since we don't *know* whether the environment bound even applies),
                    // so just map to `None` here if there are bound vars, ensuring that
                    // the call to `all` will fail below.
                    approx_env_bounds.iter().map(|b| b.map_bound(|b| b.1).no_bound_vars()),
                )
                .all(|b| b == Some(trait_bounds[0]))
        {
            let unique_bound = trait_bounds[0];
            debug!(?unique_bound);
            debug!("unique declared bound appears in trait ref");
            let category = origin.to_constraint_category();
            self.delegate.push_sub_region_constraint(origin, region, unique_bound, category);
            return;
        }

        // Fallback to verifying after the fact that there exists a
        // declared bound, or that all the components appearing in the
        // projection outlive; in some cases, this may add insufficient
        // edges into the inference graph, leading to inference failures
        // even though a satisfactory solution exists.
        let verify_bound = self.verify_bound.alias_bound(alias_ty);
        debug!("alias_must_outlive: pushing {:?}", verify_bound);
        self.delegate.push_verify(origin, GenericKind::Alias(alias_ty), region, verify_bound);
    }

    #[instrument(level = "debug", skip(self))]
    fn args_must_outlive(
        &mut self,
        args: GenericArgsRef<'tcx>,
        origin: infer::SubregionOrigin<'tcx>,
        region: ty::Region<'tcx>,
        opt_variances: Option<&[ty::Variance]>,
    ) {
        let constraint = origin.to_constraint_category();
        for (index, arg) in args.iter().enumerate() {
            match arg.kind() {
                GenericArgKind::Lifetime(lt) => {
                    let variance = if let Some(variances) = opt_variances {
                        variances[index]
                    } else {
                        ty::Invariant
                    };
                    if variance == ty::Invariant {
                        self.delegate.push_sub_region_constraint(
                            origin.clone(),
                            region,
                            lt,
                            constraint,
                        );
                    }
                }
                GenericArgKind::Type(ty) => {
                    self.type_must_outlive(origin.clone(), ty, region, constraint);
                }
                GenericArgKind::Const(_) => {
                    // Const parameters don't impose constraints.
                }
            }
        }
    }
}

impl<'cx, 'tcx> TypeOutlivesDelegate<'tcx> for &'cx InferCtxt<'tcx> {
    fn push_sub_region_constraint(
        &mut self,
        origin: SubregionOrigin<'tcx>,
        a: ty::Region<'tcx>,
        b: ty::Region<'tcx>,
        _constraint_category: ConstraintCategory<'tcx>,
    ) {
        // We don't do leak check in lexical region resolution
        self.sub_regions(origin, a, b, ty::VisibleForLeakCheck::Unreachable)
    }

    fn push_verify(
        &mut self,
        origin: SubregionOrigin<'tcx>,
        kind: GenericKind<'tcx>,
        a: ty::Region<'tcx>,
        bound: VerifyBound<'tcx>,
    ) {
        self.verify_generic_bound(origin, kind, a, bound)
    }
}