1 //! A nice interface for working with the infcx. The basic idea is to
2 //! do `infcx.at(cause, param_env)`, which sets the "cause" of the
3 //! operation as well as the surrounding parameter environment. Then
4 //! you can do something like `.sub(a, b)` or `.eq(a, b)` to create a
5 //! subtype or equality relationship respectively. The first argument
6 //! is always the "expected" output from the POV of diagnostics.
10 //! infcx.at(cause, param_env).sub(a, b)
11 //! // requires that `a <: b`, with `a` considered the "expected" type
13 //! infcx.at(cause, param_env).sup(a, b)
14 //! // requires that `b <: a`, with `a` considered the "expected" type
16 //! infcx.at(cause, param_env).eq(a, b)
17 //! // requires that `a == b`, with `a` considered the "expected" type
19 //! For finer-grained control, you can also do use `trace`:
21 //! infcx.at(...).trace(a, b).sub(&c, &d)
23 //! This will set `a` and `b` as the "root" values for
24 //! error-reporting, but actually operate on `c` and `d`. This is
25 //! sometimes useful when the types of `c` and `d` are not traceable
26 //! things. (That system should probably be refactored.)
30 use rustc_middle
::ty
::relate
::{Relate, TypeRelation}
;
31 use rustc_middle
::ty
::Const
;
33 pub struct At
<'a
, 'tcx
> {
34 pub infcx
: &'a InferCtxt
<'a
, 'tcx
>,
35 pub cause
: &'a ObligationCause
<'tcx
>,
36 pub param_env
: ty
::ParamEnv
<'tcx
>,
39 pub struct Trace
<'a
, 'tcx
> {
42 trace
: TypeTrace
<'tcx
>,
45 impl<'a
, 'tcx
> InferCtxt
<'a
, 'tcx
> {
49 cause
: &'a ObligationCause
<'tcx
>,
50 param_env
: ty
::ParamEnv
<'tcx
>,
52 At { infcx: self, cause, param_env }
56 pub trait ToTrace
<'tcx
>: Relate
<'tcx
> + Copy
{
58 cause
: &ObligationCause
<'tcx
>,
65 impl<'a
, 'tcx
> At
<'a
, 'tcx
> {
66 /// Hacky routine for equating two impl headers in coherence.
67 pub fn eq_impl_headers(
69 expected
: &ty
::ImplHeader
<'tcx
>,
70 actual
: &ty
::ImplHeader
<'tcx
>,
71 ) -> InferResult
<'tcx
, ()> {
72 debug
!("eq_impl_header({:?} = {:?})", expected
, actual
);
73 match (expected
.trait_ref
, actual
.trait_ref
) {
74 (Some(a_ref
), Some(b_ref
)) => self.eq(a_ref
, b_ref
),
75 (None
, None
) => self.eq(expected
.self_ty
, actual
.self_ty
),
76 _
=> bug
!("mk_eq_impl_headers given mismatched impl kinds"),
80 /// Makes `a <: b`, where `a` may or may not be expected.
81 pub fn sub_exp
<T
>(self, a_is_expected
: bool
, a
: T
, b
: T
) -> InferResult
<'tcx
, ()>
85 self.trace_exp(a_is_expected
, a
, b
).sub(a
, b
)
88 /// Makes `actual <: expected`. For example, if type-checking a
89 /// call like `foo(x)`, where `foo: fn(i32)`, you might have
90 /// `sup(i32, x)`, since the "expected" type is the type that
91 /// appears in the signature.
92 pub fn sup
<T
>(self, expected
: T
, actual
: T
) -> InferResult
<'tcx
, ()>
96 self.sub_exp(false, actual
, expected
)
99 /// Makes `expected <: actual`.
100 pub fn sub
<T
>(self, expected
: T
, actual
: T
) -> InferResult
<'tcx
, ()>
104 self.sub_exp(true, expected
, actual
)
107 /// Makes `expected <: actual`.
108 pub fn eq_exp
<T
>(self, a_is_expected
: bool
, a
: T
, b
: T
) -> InferResult
<'tcx
, ()>
112 self.trace_exp(a_is_expected
, a
, b
).eq(a
, b
)
115 /// Makes `expected <: actual`.
116 pub fn eq
<T
>(self, expected
: T
, actual
: T
) -> InferResult
<'tcx
, ()>
120 self.trace(expected
, actual
).eq(expected
, actual
)
123 pub fn relate
<T
>(self, expected
: T
, variance
: ty
::Variance
, actual
: T
) -> InferResult
<'tcx
, ()>
128 ty
::Variance
::Covariant
=> self.sub(expected
, actual
),
129 ty
::Variance
::Invariant
=> self.eq(expected
, actual
),
130 ty
::Variance
::Contravariant
=> self.sup(expected
, actual
),
132 // We could make this make sense but it's not readily
133 // exposed and I don't feel like dealing with it. Note
134 // that bivariance in general does a bit more than just
135 // *nothing*, it checks that the types are the same
136 // "modulo variance" basically.
137 ty
::Variance
::Bivariant
=> panic
!("Bivariant given to `relate()`"),
141 /// Computes the least-upper-bound, or mutual supertype, of two
142 /// values. The order of the arguments doesn't matter, but since
143 /// this can result in an error (e.g., if asked to compute LUB of
144 /// u32 and i32), it is meaningful to call one of them the
146 pub fn lub
<T
>(self, expected
: T
, actual
: T
) -> InferResult
<'tcx
, T
>
150 self.trace(expected
, actual
).lub(expected
, actual
)
153 /// Computes the greatest-lower-bound, or mutual subtype, of two
154 /// values. As with `lub` order doesn't matter, except for error
156 pub fn glb
<T
>(self, expected
: T
, actual
: T
) -> InferResult
<'tcx
, T
>
160 self.trace(expected
, actual
).glb(expected
, actual
)
163 /// Sets the "trace" values that will be used for
164 /// error-reporting, but doesn't actually perform any operation
165 /// yet (this is useful when you want to set the trace using
166 /// distinct values from those you wish to operate upon).
167 pub fn trace
<T
>(self, expected
: T
, actual
: T
) -> Trace
<'a
, 'tcx
>
171 self.trace_exp(true, expected
, actual
)
174 /// Like `trace`, but the expected value is determined by the
175 /// boolean argument (if true, then the first argument `a` is the
176 /// "expected" value).
177 pub fn trace_exp
<T
>(self, a_is_expected
: bool
, a
: T
, b
: T
) -> Trace
<'a
, 'tcx
>
181 let trace
= ToTrace
::to_trace(self.cause
, a_is_expected
, a
, b
);
182 Trace { at: self, trace, a_is_expected }
186 impl<'a
, 'tcx
> Trace
<'a
, 'tcx
> {
187 /// Makes `a <: b` where `a` may or may not be expected (if
188 /// `a_is_expected` is true, then `a` is expected).
189 pub fn sub
<T
>(self, a
: T
, b
: T
) -> InferResult
<'tcx
, ()>
193 debug
!("sub({:?} <: {:?})", a
, b
);
194 let Trace { at, trace, a_is_expected }
= self;
195 at
.infcx
.commit_if_ok(|_
| {
196 let mut fields
= at
.infcx
.combine_fields(trace
, at
.param_env
);
200 .map(move |_
| InferOk { value: (), obligations: fields.obligations }
)
204 /// Makes `a == b`; the expectation is set by the call to
206 pub fn eq
<T
>(self, a
: T
, b
: T
) -> InferResult
<'tcx
, ()>
210 debug
!("eq({:?} == {:?})", a
, b
);
211 let Trace { at, trace, a_is_expected }
= self;
212 at
.infcx
.commit_if_ok(|_
| {
213 let mut fields
= at
.infcx
.combine_fields(trace
, at
.param_env
);
215 .equate(a_is_expected
)
217 .map(move |_
| InferOk { value: (), obligations: fields.obligations }
)
221 pub fn lub
<T
>(self, a
: T
, b
: T
) -> InferResult
<'tcx
, T
>
225 debug
!("lub({:?} \\/ {:?})", a
, b
);
226 let Trace { at, trace, a_is_expected }
= self;
227 at
.infcx
.commit_if_ok(|_
| {
228 let mut fields
= at
.infcx
.combine_fields(trace
, at
.param_env
);
232 .map(move |t
| InferOk { value: t, obligations: fields.obligations }
)
236 pub fn glb
<T
>(self, a
: T
, b
: T
) -> InferResult
<'tcx
, T
>
240 debug
!("glb({:?} /\\ {:?})", a
, b
);
241 let Trace { at, trace, a_is_expected }
= self;
242 at
.infcx
.commit_if_ok(|_
| {
243 let mut fields
= at
.infcx
.combine_fields(trace
, at
.param_env
);
247 .map(move |t
| InferOk { value: t, obligations: fields.obligations }
)
252 impl<'tcx
> ToTrace
<'tcx
> for Ty
<'tcx
> {
254 cause
: &ObligationCause
<'tcx
>,
258 ) -> TypeTrace
<'tcx
> {
259 TypeTrace { cause: cause.clone(), values: Types(ExpectedFound::new(a_is_expected, a, b)) }
263 impl<'tcx
> ToTrace
<'tcx
> for ty
::Region
<'tcx
> {
265 cause
: &ObligationCause
<'tcx
>,
269 ) -> TypeTrace
<'tcx
> {
270 TypeTrace { cause: cause.clone(), values: Regions(ExpectedFound::new(a_is_expected, a, b)) }
274 impl<'tcx
> ToTrace
<'tcx
> for &'tcx Const
<'tcx
> {
276 cause
: &ObligationCause
<'tcx
>,
280 ) -> TypeTrace
<'tcx
> {
281 TypeTrace { cause: cause.clone(), values: Consts(ExpectedFound::new(a_is_expected, a, b)) }
285 impl<'tcx
> ToTrace
<'tcx
> for ty
::TraitRef
<'tcx
> {
287 cause
: &ObligationCause
<'tcx
>,
291 ) -> TypeTrace
<'tcx
> {
293 cause
: cause
.clone(),
294 values
: TraitRefs(ExpectedFound
::new(a_is_expected
, a
, b
)),
299 impl<'tcx
> ToTrace
<'tcx
> for ty
::PolyTraitRef
<'tcx
> {
301 cause
: &ObligationCause
<'tcx
>,
305 ) -> TypeTrace
<'tcx
> {
307 cause
: cause
.clone(),
308 values
: PolyTraitRefs(ExpectedFound
::new(a_is_expected
, a
, b
)),