1 use super::combine
::{CombineFields, ConstEquateRelation, RelationDir}
;
4 use rustc_middle
::ty
::relate
::{self, Relate, RelateResult, TypeRelation}
;
5 use rustc_middle
::ty
::subst
::SubstsRef
;
6 use rustc_middle
::ty
::TyVar
;
7 use rustc_middle
::ty
::{self, Ty, TyCtxt}
;
9 use rustc_hir
::def_id
::DefId
;
11 /// Ensures `a` is made equal to `b`. Returns `a` on success.
12 pub struct Equate
<'combine
, 'infcx
, 'tcx
> {
13 fields
: &'combine
mut CombineFields
<'infcx
, 'tcx
>,
17 impl<'combine
, 'infcx
, 'tcx
> Equate
<'combine
, 'infcx
, 'tcx
> {
19 fields
: &'combine
mut CombineFields
<'infcx
, 'tcx
>,
21 ) -> Equate
<'combine
, 'infcx
, 'tcx
> {
22 Equate { fields, a_is_expected }
26 impl<'tcx
> TypeRelation
<'tcx
> for Equate
<'_
, '_
, 'tcx
> {
27 fn tag(&self) -> &'
static str {
31 fn tcx(&self) -> TyCtxt
<'tcx
> {
35 fn param_env(&self) -> ty
::ParamEnv
<'tcx
> {
39 fn a_is_expected(&self) -> bool
{
43 fn relate_item_substs(
46 a_subst
: SubstsRef
<'tcx
>,
47 b_subst
: SubstsRef
<'tcx
>,
48 ) -> RelateResult
<'tcx
, SubstsRef
<'tcx
>> {
49 // N.B., once we are equating types, we don't care about
50 // variance, so don't try to lookup the variance here. This
51 // also avoids some cycles (e.g., #41849) since looking up
52 // variance requires computing types which can require
53 // performing trait matching (which then performs equality
56 relate
::relate_substs(self, None
, a_subst
, b_subst
)
59 fn relate_with_variance
<T
: Relate
<'tcx
>>(
62 _info
: ty
::VarianceDiagInfo
<'tcx
>,
65 ) -> RelateResult
<'tcx
, T
> {
69 #[instrument(skip(self), level = "debug")]
70 fn tys(&mut self, a
: Ty
<'tcx
>, b
: Ty
<'tcx
>) -> RelateResult
<'tcx
, Ty
<'tcx
>> {
75 trace
!(a
= ?a
.kind(), b
= ?b
.kind());
77 let infcx
= self.fields
.infcx
;
79 let a
= infcx
.inner
.borrow_mut().type_variables().replace_if_possible(a
);
80 let b
= infcx
.inner
.borrow_mut().type_variables().replace_if_possible(b
);
82 match (a
.kind(), b
.kind()) {
83 (&ty
::Infer(TyVar(a_id
)), &ty
::Infer(TyVar(b_id
))) => {
84 infcx
.inner
.borrow_mut().type_variables().equate(a_id
, b_id
);
87 (&ty
::Infer(TyVar(a_id
)), _
) => {
88 self.fields
.instantiate(b
, RelationDir
::EqTo
, a_id
, self.a_is_expected
)?
;
91 (_
, &ty
::Infer(TyVar(b_id
))) => {
92 self.fields
.instantiate(a
, RelationDir
::EqTo
, b_id
, self.a_is_expected
)?
;
95 (&ty
::Opaque(a_def_id
, _
), &ty
::Opaque(b_def_id
, _
)) if a_def_id
== b_def_id
=> {
96 self.fields
.infcx
.super_combine_tys(self, a
, b
)?
;
98 (&ty
::Opaque(did
, ..), _
) | (_
, &ty
::Opaque(did
, ..))
99 if self.fields
.define_opaque_types
&& did
.is_local() =>
101 self.fields
.obligations
.extend(
106 self.a_is_expected(),
107 &self.fields
.trace
.cause
,
115 self.fields
.infcx
.super_combine_tys(self, a
, b
)?
;
126 ) -> RelateResult
<'tcx
, ty
::Region
<'tcx
>> {
127 debug
!("{}.regions({:?}, {:?})", self.tag(), a
, b
);
128 let origin
= Subtype(Box
::new(self.fields
.trace
.clone()));
133 .unwrap_region_constraints()
134 .make_eqregion(origin
, a
, b
);
142 ) -> RelateResult
<'tcx
, ty
::Const
<'tcx
>> {
143 self.fields
.infcx
.super_combine_consts(self, a
, b
)
148 a
: ty
::Binder
<'tcx
, T
>,
149 b
: ty
::Binder
<'tcx
, T
>,
150 ) -> RelateResult
<'tcx
, ty
::Binder
<'tcx
, T
>>
154 if a
.skip_binder().has_escaping_bound_vars() || b
.skip_binder().has_escaping_bound_vars() {
155 self.fields
.higher_ranked_sub(a
, b
, self.a_is_expected
)?
;
156 self.fields
.higher_ranked_sub(b
, a
, self.a_is_expected
)
158 // Fast path for the common case.
159 self.relate(a
.skip_binder(), b
.skip_binder())?
;
165 impl<'tcx
> ConstEquateRelation
<'tcx
> for Equate
<'_
, '_
, 'tcx
> {
166 fn const_equate_obligation(&mut self, a
: ty
::Const
<'tcx
>, b
: ty
::Const
<'tcx
>) {
167 self.fields
.add_const_equate_obligation(self.a_is_expected
, a
, b
);