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 //! See the Book for more information.
13 pub use self::LateBoundRegionConversionTime::*;
14 pub use self::RegionVariableOrigin::*;
15 pub use self::SubregionOrigin::*;
16 pub use self::ValuePairs::*;
17 pub use ty::IntVarValue;
18 pub use self::freshen::TypeFreshener;
19 pub use self::region_inference::{GenericKind, VerifyBound};
21 use hir::def_id::DefId;
23 use middle::free_region::{FreeRegionMap, RegionRelations};
24 use middle::region::RegionMaps;
25 use middle::mem_categorization as mc;
26 use middle::mem_categorization::McResult;
27 use middle::lang_items;
28 use mir::tcx::LvalueTy;
29 use ty::subst::{Kind, Subst, Substs};
30 use ty::{TyVid, IntVid, FloatVid};
31 use ty::{self, Ty, TyCtxt};
32 use ty::error::{ExpectedFound, TypeError, UnconstrainedNumeric};
33 use ty::fold::{TypeFoldable, TypeFolder, TypeVisitor};
34 use ty::relate::{Relate, RelateResult, TypeRelation};
35 use traits::{self, ObligationCause, PredicateObligations, Reveal};
36 use rustc_data_structures::unify::{self, UnificationTable};
37 use std::cell::{Cell, RefCell, Ref, RefMut};
41 use errors::DiagnosticBuilder;
42 use syntax_pos::{self, Span, DUMMY_SP};
43 use util::nodemap::{FxHashMap, FxHashSet};
44 use arena::DroplessArena;
46 use self::combine::CombineFields;
47 use self::higher_ranked::HrMatchResult;
48 use self::region_inference::{RegionVarBindings, RegionSnapshot};
49 use self::type_variable::TypeVariableOrigin;
50 use self::unify_key::ToType;
54 pub mod error_reporting;
60 pub mod region_inference;
64 pub mod type_variable;
68 pub struct InferOk<'tcx, T> {
70 pub obligations: PredicateObligations<'tcx>,
72 pub type InferResult<'tcx, T> = Result<InferOk<'tcx, T>, TypeError<'tcx>>;
74 pub type Bound<T> = Option<T>;
75 pub type UnitResult<'tcx> = RelateResult<'tcx, ()>; // "unify result"
76 pub type FixupResult<T> = Result<T, FixupError>; // "fixup result"
78 /// A version of &ty::TypeckTables which can be `Missing` (not needed),
79 /// `InProgress` (during typeck) or `Interned` (result of typeck).
80 /// Only the `InProgress` version supports `borrow_mut`.
81 #[derive(Copy, Clone)]
82 pub enum InferTables<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
83 Interned(&'a ty::TypeckTables<'gcx>),
84 InProgress(&'a RefCell<ty::TypeckTables<'tcx>>),
88 pub enum InferTablesRef<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
89 Interned(&'a ty::TypeckTables<'gcx>),
90 InProgress(Ref<'a, ty::TypeckTables<'tcx>>)
93 impl<'a, 'gcx, 'tcx> Deref for InferTablesRef<'a, 'gcx, 'tcx> {
94 type Target = ty::TypeckTables<'tcx>;
95 fn deref(&self) -> &Self::Target {
97 InferTablesRef::Interned(tables) => tables,
98 InferTablesRef::InProgress(ref tables) => tables
103 impl<'a, 'gcx, 'tcx> InferTables<'a, 'gcx, 'tcx> {
104 pub fn borrow(self) -> InferTablesRef<'a, 'gcx, 'tcx> {
106 InferTables::Interned(tables) => InferTablesRef::Interned(tables),
107 InferTables::InProgress(tables) => InferTablesRef::InProgress(tables.borrow()),
108 InferTables::Missing => {
109 bug!("InferTables: infcx.tables.borrow() with no tables")
114 pub fn expect_interned(self) -> &'a ty::TypeckTables<'gcx> {
116 InferTables::Interned(tables) => tables,
117 InferTables::InProgress(_) => {
118 bug!("InferTables: infcx.tables.expect_interned() during type-checking");
120 InferTables::Missing => {
121 bug!("InferTables: infcx.tables.expect_interned() with no tables")
126 pub fn borrow_mut(self) -> RefMut<'a, ty::TypeckTables<'tcx>> {
128 InferTables::Interned(_) => {
129 bug!("InferTables: infcx.tables.borrow_mut() outside of type-checking");
131 InferTables::InProgress(tables) => tables.borrow_mut(),
132 InferTables::Missing => {
133 bug!("InferTables: infcx.tables.borrow_mut() with no tables")
139 pub struct InferCtxt<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
140 pub tcx: TyCtxt<'a, 'gcx, 'tcx>,
142 pub tables: InferTables<'a, 'gcx, 'tcx>,
144 // Cache for projections. This cache is snapshotted along with the
147 // Public so that `traits::project` can use it.
148 pub projection_cache: RefCell<traits::ProjectionCache<'tcx>>,
150 // We instantiate UnificationTable with bounds<Ty> because the
151 // types that might instantiate a general type variable have an
152 // order, represented by its upper and lower bounds.
153 pub type_variables: RefCell<type_variable::TypeVariableTable<'tcx>>,
155 // Map from integral variable to the kind of integer it represents
156 int_unification_table: RefCell<UnificationTable<ty::IntVid>>,
158 // Map from floating variable to the kind of float it represents
159 float_unification_table: RefCell<UnificationTable<ty::FloatVid>>,
161 // For region variables.
162 region_vars: RegionVarBindings<'a, 'gcx, 'tcx>,
164 pub parameter_environment: ty::ParameterEnvironment<'gcx>,
166 /// Caches the results of trait selection. This cache is used
167 /// for things that have to do with the parameters in scope.
168 pub selection_cache: traits::SelectionCache<'tcx>,
170 /// Caches the results of trait evaluation.
171 pub evaluation_cache: traits::EvaluationCache<'tcx>,
173 // the set of predicates on which errors have been reported, to
174 // avoid reporting the same error twice.
175 pub reported_trait_errors: RefCell<FxHashSet<traits::TraitErrorKey<'tcx>>>,
177 // Sadly, the behavior of projection varies a bit depending on the
178 // stage of compilation. The specifics are given in the
179 // documentation for `Reveal`.
180 projection_mode: Reveal,
182 // When an error occurs, we want to avoid reporting "derived"
183 // errors that are due to this original failure. Normally, we
184 // handle this with the `err_count_on_creation` count, which
185 // basically just tracks how many errors were reported when we
186 // started type-checking a fn and checks to see if any new errors
187 // have been reported since then. Not great, but it works.
189 // However, when errors originated in other passes -- notably
190 // resolve -- this heuristic breaks down. Therefore, we have this
191 // auxiliary flag that one can set whenever one creates a
192 // type-error that is due to an error in a prior pass.
194 // Don't read this flag directly, call `is_tainted_by_errors()`
195 // and `set_tainted_by_errors()`.
196 tainted_by_errors_flag: Cell<bool>,
198 // Track how many errors were reported when this infcx is created.
199 // If the number of errors increases, that's also a sign (line
200 // `tained_by_errors`) to avoid reporting certain kinds of errors.
201 err_count_on_creation: usize,
203 // This flag is true while there is an active snapshot.
204 in_snapshot: Cell<bool>,
207 /// A map returned by `skolemize_late_bound_regions()` indicating the skolemized
208 /// region that each late-bound region was replaced with.
209 pub type SkolemizationMap<'tcx> = FxHashMap<ty::BoundRegion, ty::Region<'tcx>>;
211 /// See `error_reporting` module for more details
212 #[derive(Clone, Debug)]
213 pub enum ValuePairs<'tcx> {
214 Types(ExpectedFound<Ty<'tcx>>),
215 TraitRefs(ExpectedFound<ty::TraitRef<'tcx>>),
216 PolyTraitRefs(ExpectedFound<ty::PolyTraitRef<'tcx>>),
219 /// The trace designates the path through inference that we took to
220 /// encounter an error or subtyping constraint.
222 /// See `error_reporting` module for more details.
224 pub struct TypeTrace<'tcx> {
225 cause: ObligationCause<'tcx>,
226 values: ValuePairs<'tcx>,
229 /// The origin of a `r1 <= r2` constraint.
231 /// See `error_reporting` module for more details
232 #[derive(Clone, Debug)]
233 pub enum SubregionOrigin<'tcx> {
234 // Arose from a subtyping relation
235 Subtype(TypeTrace<'tcx>),
237 // Stack-allocated closures cannot outlive innermost loop
238 // or function so as to ensure we only require finite stack
239 InfStackClosure(Span),
241 // Invocation of closure must be within its lifetime
244 // Dereference of reference must be within its lifetime
247 // Closure bound must not outlive captured free variables
248 FreeVariable(Span, ast::NodeId),
250 // Index into slice must be within its lifetime
253 // When casting `&'a T` to an `&'b Trait` object,
254 // relating `'a` to `'b`
255 RelateObjectBound(Span),
257 // Some type parameter was instantiated with the given type,
258 // and that type must outlive some region.
259 RelateParamBound(Span, Ty<'tcx>),
261 // The given region parameter was instantiated with a region
262 // that must outlive some other region.
263 RelateRegionParamBound(Span),
265 // A bound placed on type parameters that states that must outlive
266 // the moment of their instantiation.
267 RelateDefaultParamBound(Span, Ty<'tcx>),
269 // Creating a pointer `b` to contents of another reference
272 // Creating a pointer `b` to contents of an upvar
273 ReborrowUpvar(Span, ty::UpvarId),
275 // Data with type `Ty<'tcx>` was borrowed
276 DataBorrowed(Ty<'tcx>, Span),
278 // (&'a &'b T) where a >= b
279 ReferenceOutlivesReferent(Ty<'tcx>, Span),
281 // Type or region parameters must be in scope.
282 ParameterInScope(ParameterOrigin, Span),
284 // The type T of an expression E must outlive the lifetime for E.
285 ExprTypeIsNotInScope(Ty<'tcx>, Span),
287 // A `ref b` whose region does not enclose the decl site
288 BindingTypeIsNotValidAtDecl(Span),
290 // Regions appearing in a method receiver must outlive method call
293 // Regions appearing in a function argument must outlive func call
296 // Region in return type of invoked fn must enclose call
299 // Operands must be in scope
302 // Region resulting from a `&` expr must enclose the `&` expr
305 // An auto-borrow that does not enclose the expr where it occurs
308 // Region constraint arriving from destructor safety
309 SafeDestructor(Span),
311 // Comparing the signature and requirements of an impl method against
312 // the containing trait.
313 CompareImplMethodObligation {
315 item_name: ast::Name,
316 impl_item_def_id: DefId,
317 trait_item_def_id: DefId,
319 // this is `Some(_)` if this error arises from the bug fix for
320 // #18937. This is a temporary measure.
321 lint_id: Option<ast::NodeId>,
325 /// Places that type/region parameters can appear.
326 #[derive(Clone, Copy, Debug)]
327 pub enum ParameterOrigin {
329 MethodCall, // foo.bar() <-- parameters on impl providing bar()
330 OverloadedOperator, // a + b when overloaded
331 OverloadedDeref, // *a when overloaded
334 /// Times when we replace late-bound regions with variables:
335 #[derive(Clone, Copy, Debug)]
336 pub enum LateBoundRegionConversionTime {
337 /// when a fn is called
340 /// when two higher-ranked types are compared
343 /// when projecting an associated type
344 AssocTypeProjection(ast::Name),
347 /// Reasons to create a region inference variable
349 /// See `error_reporting` module for more details
350 #[derive(Clone, Debug)]
351 pub enum RegionVariableOrigin {
352 // Region variables created for ill-categorized reasons,
353 // mostly indicates places in need of refactoring
356 // Regions created by a `&P` or `[...]` pattern
359 // Regions created by `&` operator
362 // Regions created as part of an autoref of a method receiver
365 // Regions created as part of an automatic coercion
368 // Region variables created as the values for early-bound regions
369 EarlyBoundRegion(Span, ast::Name, Option<ty::Issue32330>),
371 // Region variables created for bound regions
372 // in a function or method that is called
373 LateBoundRegion(Span, ty::BoundRegion, LateBoundRegionConversionTime),
375 UpvarRegion(ty::UpvarId, Span),
377 BoundRegionInCoherence(ast::Name),
380 #[derive(Copy, Clone, Debug)]
381 pub enum FixupError {
382 UnresolvedIntTy(IntVid),
383 UnresolvedFloatTy(FloatVid),
387 impl fmt::Display for FixupError {
388 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
389 use self::FixupError::*;
392 UnresolvedIntTy(_) => {
393 write!(f, "cannot determine the type of this integer; \
394 add a suffix to specify the type explicitly")
396 UnresolvedFloatTy(_) => {
397 write!(f, "cannot determine the type of this number; \
398 add a suffix to specify the type explicitly")
400 UnresolvedTy(_) => write!(f, "unconstrained type")
405 pub trait InferEnv<'a, 'tcx> {
406 fn to_parts(self, tcx: TyCtxt<'a, 'tcx, 'tcx>)
407 -> (Option<&'a ty::TypeckTables<'tcx>>,
408 Option<ty::TypeckTables<'tcx>>,
409 Option<ty::ParameterEnvironment<'tcx>>);
412 impl<'a, 'tcx> InferEnv<'a, 'tcx> for () {
413 fn to_parts(self, _: TyCtxt<'a, 'tcx, 'tcx>)
414 -> (Option<&'a ty::TypeckTables<'tcx>>,
415 Option<ty::TypeckTables<'tcx>>,
416 Option<ty::ParameterEnvironment<'tcx>>) {
421 impl<'a, 'tcx> InferEnv<'a, 'tcx> for ty::ParameterEnvironment<'tcx> {
422 fn to_parts(self, _: TyCtxt<'a, 'tcx, 'tcx>)
423 -> (Option<&'a ty::TypeckTables<'tcx>>,
424 Option<ty::TypeckTables<'tcx>>,
425 Option<ty::ParameterEnvironment<'tcx>>) {
426 (None, None, Some(self))
430 impl<'a, 'tcx> InferEnv<'a, 'tcx> for (&'a ty::TypeckTables<'tcx>, ty::ParameterEnvironment<'tcx>) {
431 fn to_parts(self, _: TyCtxt<'a, 'tcx, 'tcx>)
432 -> (Option<&'a ty::TypeckTables<'tcx>>,
433 Option<ty::TypeckTables<'tcx>>,
434 Option<ty::ParameterEnvironment<'tcx>>) {
435 (Some(self.0), None, Some(self.1))
439 impl<'a, 'tcx> InferEnv<'a, 'tcx> for (ty::TypeckTables<'tcx>, ty::ParameterEnvironment<'tcx>) {
440 fn to_parts(self, _: TyCtxt<'a, 'tcx, 'tcx>)
441 -> (Option<&'a ty::TypeckTables<'tcx>>,
442 Option<ty::TypeckTables<'tcx>>,
443 Option<ty::ParameterEnvironment<'tcx>>) {
444 (None, Some(self.0), Some(self.1))
448 impl<'a, 'tcx> InferEnv<'a, 'tcx> for hir::BodyId {
449 fn to_parts(self, tcx: TyCtxt<'a, 'tcx, 'tcx>)
450 -> (Option<&'a ty::TypeckTables<'tcx>>,
451 Option<ty::TypeckTables<'tcx>>,
452 Option<ty::ParameterEnvironment<'tcx>>) {
453 let def_id = tcx.hir.body_owner_def_id(self);
454 (Some(tcx.typeck_tables_of(def_id)),
456 Some(tcx.parameter_environment(def_id)))
460 /// Helper type of a temporary returned by tcx.infer_ctxt(...).
461 /// Necessary because we can't write the following bound:
462 /// F: for<'b, 'tcx> where 'gcx: 'tcx FnOnce(InferCtxt<'b, 'gcx, 'tcx>).
463 pub struct InferCtxtBuilder<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
464 global_tcx: TyCtxt<'a, 'gcx, 'gcx>,
465 arena: DroplessArena,
466 fresh_tables: Option<RefCell<ty::TypeckTables<'tcx>>>,
467 tables: Option<&'a ty::TypeckTables<'gcx>>,
468 param_env: Option<ty::ParameterEnvironment<'gcx>>,
469 projection_mode: Reveal,
472 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'gcx> {
473 pub fn infer_ctxt<E: InferEnv<'a, 'gcx>>(self,
475 projection_mode: Reveal)
476 -> InferCtxtBuilder<'a, 'gcx, 'tcx> {
477 let (tables, fresh_tables, param_env) = env.to_parts(self);
480 arena: DroplessArena::new(),
481 fresh_tables: fresh_tables.map(RefCell::new),
483 param_env: param_env,
484 projection_mode: projection_mode,
488 /// Fake InferCtxt with the global tcx. Used by pre-MIR borrowck
489 /// for MemCategorizationContext/ExprUseVisitor.
490 /// If any inference functionality is used, ICEs will occur.
491 pub fn borrowck_fake_infer_ctxt(self, body: hir::BodyId)
492 -> InferCtxt<'a, 'gcx, 'gcx> {
493 let (tables, _, param_env) = body.to_parts(self);
496 tables: InferTables::Interned(tables.unwrap()),
497 type_variables: RefCell::new(type_variable::TypeVariableTable::new()),
498 int_unification_table: RefCell::new(UnificationTable::new()),
499 float_unification_table: RefCell::new(UnificationTable::new()),
500 region_vars: RegionVarBindings::new(self),
501 parameter_environment: param_env.unwrap(),
502 selection_cache: traits::SelectionCache::new(),
503 evaluation_cache: traits::EvaluationCache::new(),
504 projection_cache: RefCell::new(traits::ProjectionCache::new()),
505 reported_trait_errors: RefCell::new(FxHashSet()),
506 projection_mode: Reveal::UserFacing,
507 tainted_by_errors_flag: Cell::new(false),
508 err_count_on_creation: self.sess.err_count(),
509 in_snapshot: Cell::new(false),
514 impl<'a, 'gcx, 'tcx> InferCtxtBuilder<'a, 'gcx, 'tcx> {
515 pub fn enter<F, R>(&'tcx mut self, f: F) -> R
516 where F: for<'b> FnOnce(InferCtxt<'b, 'gcx, 'tcx>) -> R
518 let InferCtxtBuilder {
526 let tables = tables.map(InferTables::Interned).unwrap_or_else(|| {
527 fresh_tables.as_ref().map_or(InferTables::Missing, InferTables::InProgress)
529 let param_env = param_env.take().unwrap_or_else(|| {
530 global_tcx.empty_parameter_environment()
532 global_tcx.enter_local(arena, |tcx| f(InferCtxt {
535 projection_cache: RefCell::new(traits::ProjectionCache::new()),
536 type_variables: RefCell::new(type_variable::TypeVariableTable::new()),
537 int_unification_table: RefCell::new(UnificationTable::new()),
538 float_unification_table: RefCell::new(UnificationTable::new()),
539 region_vars: RegionVarBindings::new(tcx),
540 parameter_environment: param_env,
541 selection_cache: traits::SelectionCache::new(),
542 evaluation_cache: traits::EvaluationCache::new(),
543 reported_trait_errors: RefCell::new(FxHashSet()),
544 projection_mode: projection_mode,
545 tainted_by_errors_flag: Cell::new(false),
546 err_count_on_creation: tcx.sess.err_count(),
547 in_snapshot: Cell::new(false),
552 impl<T> ExpectedFound<T> {
553 pub fn new(a_is_expected: bool, a: T, b: T) -> Self {
555 ExpectedFound {expected: a, found: b}
557 ExpectedFound {expected: b, found: a}
562 impl<'tcx, T> InferOk<'tcx, T> {
563 pub fn unit(self) -> InferOk<'tcx, ()> {
564 InferOk { value: (), obligations: self.obligations }
568 #[must_use = "once you start a snapshot, you should always consume it"]
569 pub struct CombinedSnapshot {
570 projection_cache_snapshot: traits::ProjectionCacheSnapshot,
571 type_snapshot: type_variable::Snapshot,
572 int_snapshot: unify::Snapshot<ty::IntVid>,
573 float_snapshot: unify::Snapshot<ty::FloatVid>,
574 region_vars_snapshot: RegionSnapshot,
575 was_in_snapshot: bool,
578 /// Helper trait for shortening the lifetimes inside a
579 /// value for post-type-checking normalization.
580 pub trait TransNormalize<'gcx>: TypeFoldable<'gcx> {
581 fn trans_normalize<'a, 'tcx>(&self, infcx: &InferCtxt<'a, 'gcx, 'tcx>) -> Self;
584 macro_rules! items { ($($item:item)+) => ($($item)+) }
585 macro_rules! impl_trans_normalize {
586 ($lt_gcx:tt, $($ty:ty),+) => {
587 items!($(impl<$lt_gcx> TransNormalize<$lt_gcx> for $ty {
588 fn trans_normalize<'a, 'tcx>(&self,
589 infcx: &InferCtxt<'a, $lt_gcx, 'tcx>)
591 infcx.normalize_projections_in(self)
597 impl_trans_normalize!('gcx,
602 ty::ClosureSubsts<'gcx>,
603 ty::PolyTraitRef<'gcx>,
604 ty::ExistentialTraitRef<'gcx>
607 impl<'gcx> TransNormalize<'gcx> for LvalueTy<'gcx> {
608 fn trans_normalize<'a, 'tcx>(&self, infcx: &InferCtxt<'a, 'gcx, 'tcx>) -> Self {
610 LvalueTy::Ty { ty } => LvalueTy::Ty { ty: ty.trans_normalize(infcx) },
611 LvalueTy::Downcast { adt_def, substs, variant_index } => {
614 substs: substs.trans_normalize(infcx),
615 variant_index: variant_index
622 // NOTE: Callable from trans only!
623 impl<'a, 'tcx> TyCtxt<'a, 'tcx, 'tcx> {
624 /// Currently, higher-ranked type bounds inhibit normalization. Therefore,
625 /// each time we erase them in translation, we need to normalize
627 pub fn erase_late_bound_regions_and_normalize<T>(self, value: &ty::Binder<T>)
629 where T: TransNormalize<'tcx>
631 assert!(!value.needs_subst());
632 let value = self.erase_late_bound_regions(value);
633 self.normalize_associated_type(&value)
636 pub fn normalize_associated_type<T>(self, value: &T) -> T
637 where T: TransNormalize<'tcx>
639 debug!("normalize_associated_type(t={:?})", value);
641 let value = self.erase_regions(value);
643 if !value.has_projection_types() {
647 self.infer_ctxt((), Reveal::All).enter(|infcx| {
648 value.trans_normalize(&infcx)
652 pub fn normalize_associated_type_in_env<T>(
653 self, value: &T, env: &'a ty::ParameterEnvironment<'tcx>
655 where T: TransNormalize<'tcx>
657 debug!("normalize_associated_type_in_env(t={:?})", value);
659 let value = self.erase_regions(value);
661 if !value.has_projection_types() {
665 self.infer_ctxt(env.clone(), Reveal::All).enter(|infcx| {
666 value.trans_normalize(&infcx)
671 impl<'a, 'gcx, 'tcx> InferCtxt<'a, 'gcx, 'tcx> {
672 fn normalize_projections_in<T>(&self, value: &T) -> T::Lifted
673 where T: TypeFoldable<'tcx> + ty::Lift<'gcx>
675 let mut selcx = traits::SelectionContext::new(self);
676 let cause = traits::ObligationCause::dummy();
677 let traits::Normalized { value: result, obligations } =
678 traits::normalize(&mut selcx, cause, value);
680 debug!("normalize_projections_in: result={:?} obligations={:?}",
681 result, obligations);
683 let mut fulfill_cx = traits::FulfillmentContext::new();
685 for obligation in obligations {
686 fulfill_cx.register_predicate_obligation(self, obligation);
689 self.drain_fulfillment_cx_or_panic(DUMMY_SP, &mut fulfill_cx, &result)
692 /// Finishes processes any obligations that remain in the
693 /// fulfillment context, and then returns the result with all type
694 /// variables removed and regions erased. Because this is intended
695 /// for use after type-check has completed, if any errors occur,
696 /// it will panic. It is used during normalization and other cases
697 /// where processing the obligations in `fulfill_cx` may cause
698 /// type inference variables that appear in `result` to be
699 /// unified, and hence we need to process those obligations to get
700 /// the complete picture of the type.
701 pub fn drain_fulfillment_cx_or_panic<T>(&self,
703 fulfill_cx: &mut traits::FulfillmentContext<'tcx>,
706 where T: TypeFoldable<'tcx> + ty::Lift<'gcx>
708 debug!("drain_fulfillment_cx_or_panic()");
710 // In principle, we only need to do this so long as `result`
711 // contains unbound type parameters. It could be a slight
712 // optimization to stop iterating early.
713 match fulfill_cx.select_all_or_error(self) {
716 span_bug!(span, "Encountered errors `{:?}` resolving bounds after type-checking",
721 let result = self.resolve_type_vars_if_possible(result);
722 let result = self.tcx.erase_regions(&result);
724 match self.tcx.lift_to_global(&result) {
725 Some(result) => result,
727 span_bug!(span, "Uninferred types/regions in `{:?}`", result);
732 pub fn projection_mode(&self) -> Reveal {
736 pub fn is_in_snapshot(&self) -> bool {
737 self.in_snapshot.get()
740 pub fn freshen<T:TypeFoldable<'tcx>>(&self, t: T) -> T {
741 t.fold_with(&mut self.freshener())
744 pub fn type_var_diverges(&'a self, ty: Ty) -> bool {
746 ty::TyInfer(ty::TyVar(vid)) => self.type_variables.borrow().var_diverges(vid),
751 pub fn freshener<'b>(&'b self) -> TypeFreshener<'b, 'gcx, 'tcx> {
752 freshen::TypeFreshener::new(self)
755 pub fn type_is_unconstrained_numeric(&'a self, ty: Ty) -> UnconstrainedNumeric {
756 use ty::error::UnconstrainedNumeric::Neither;
757 use ty::error::UnconstrainedNumeric::{UnconstrainedInt, UnconstrainedFloat};
759 ty::TyInfer(ty::IntVar(vid)) => {
760 if self.int_unification_table.borrow_mut().has_value(vid) {
766 ty::TyInfer(ty::FloatVar(vid)) => {
767 if self.float_unification_table.borrow_mut().has_value(vid) {
777 /// Returns a type variable's default fallback if any exists. A default
778 /// must be attached to the variable when created, if it is created
779 /// without a default, this will return None.
781 /// This code does not apply to integral or floating point variables,
782 /// only to use declared defaults.
784 /// See `new_ty_var_with_default` to create a type variable with a default.
785 /// See `type_variable::Default` for details about what a default entails.
786 pub fn default(&self, ty: Ty<'tcx>) -> Option<type_variable::Default<'tcx>> {
788 ty::TyInfer(ty::TyVar(vid)) => self.type_variables.borrow().default(vid),
793 pub fn unsolved_variables(&self) -> Vec<ty::Ty<'tcx>> {
794 let mut variables = Vec::new();
796 let unbound_ty_vars = self.type_variables
798 .unsolved_variables()
800 .map(|t| self.tcx.mk_var(t));
802 let unbound_int_vars = self.int_unification_table
804 .unsolved_variables()
806 .map(|v| self.tcx.mk_int_var(v));
808 let unbound_float_vars = self.float_unification_table
810 .unsolved_variables()
812 .map(|v| self.tcx.mk_float_var(v));
814 variables.extend(unbound_ty_vars);
815 variables.extend(unbound_int_vars);
816 variables.extend(unbound_float_vars);
821 fn combine_fields(&'a self, trace: TypeTrace<'tcx>)
822 -> CombineFields<'a, 'gcx, 'tcx> {
827 obligations: PredicateObligations::new(),
831 pub fn equate<T>(&'a self, a_is_expected: bool, trace: TypeTrace<'tcx>, a: &T, b: &T)
832 -> InferResult<'tcx, T>
833 where T: Relate<'tcx>
835 let mut fields = self.combine_fields(trace);
836 let result = fields.equate(a_is_expected).relate(a, b);
837 result.map(move |t| InferOk { value: t, obligations: fields.obligations })
840 pub fn sub<T>(&'a self, a_is_expected: bool, trace: TypeTrace<'tcx>, a: &T, b: &T)
841 -> InferResult<'tcx, T>
842 where T: Relate<'tcx>
844 let mut fields = self.combine_fields(trace);
845 let result = fields.sub(a_is_expected).relate(a, b);
846 result.map(move |t| InferOk { value: t, obligations: fields.obligations })
849 pub fn lub<T>(&'a self, a_is_expected: bool, trace: TypeTrace<'tcx>, a: &T, b: &T)
850 -> InferResult<'tcx, T>
851 where T: Relate<'tcx>
853 let mut fields = self.combine_fields(trace);
854 let result = fields.lub(a_is_expected).relate(a, b);
855 result.map(move |t| InferOk { value: t, obligations: fields.obligations })
858 pub fn glb<T>(&'a self, a_is_expected: bool, trace: TypeTrace<'tcx>, a: &T, b: &T)
859 -> InferResult<'tcx, T>
860 where T: Relate<'tcx>
862 let mut fields = self.combine_fields(trace);
863 let result = fields.glb(a_is_expected).relate(a, b);
864 result.map(move |t| InferOk { value: t, obligations: fields.obligations })
867 // Clear the "currently in a snapshot" flag, invoke the closure,
868 // then restore the flag to its original value. This flag is a
869 // debugging measure designed to detect cases where we start a
870 // snapshot, create type variables, and register obligations
871 // which may involve those type variables in the fulfillment cx,
872 // potentially leaving "dangling type variables" behind.
873 // In such cases, an assertion will fail when attempting to
874 // register obligations, within a snapshot. Very useful, much
875 // better than grovelling through megabytes of RUST_LOG output.
877 // HOWEVER, in some cases the flag is unhelpful. In particular, we
878 // sometimes create a "mini-fulfilment-cx" in which we enroll
879 // obligations. As long as this fulfillment cx is fully drained
880 // before we return, this is not a problem, as there won't be any
881 // escaping obligations in the main cx. In those cases, you can
882 // use this function.
883 pub fn save_and_restore_in_snapshot_flag<F, R>(&self, func: F) -> R
884 where F: FnOnce(&Self) -> R
886 let flag = self.in_snapshot.get();
887 self.in_snapshot.set(false);
888 let result = func(self);
889 self.in_snapshot.set(flag);
893 fn start_snapshot(&self) -> CombinedSnapshot {
894 debug!("start_snapshot()");
896 let in_snapshot = self.in_snapshot.get();
897 self.in_snapshot.set(true);
900 projection_cache_snapshot: self.projection_cache.borrow_mut().snapshot(),
901 type_snapshot: self.type_variables.borrow_mut().snapshot(),
902 int_snapshot: self.int_unification_table.borrow_mut().snapshot(),
903 float_snapshot: self.float_unification_table.borrow_mut().snapshot(),
904 region_vars_snapshot: self.region_vars.start_snapshot(),
905 was_in_snapshot: in_snapshot,
909 fn rollback_to(&self, cause: &str, snapshot: CombinedSnapshot) {
910 debug!("rollback_to(cause={})", cause);
911 let CombinedSnapshot { projection_cache_snapshot,
915 region_vars_snapshot,
916 was_in_snapshot } = snapshot;
918 self.in_snapshot.set(was_in_snapshot);
920 self.projection_cache
922 .rollback_to(projection_cache_snapshot);
925 .rollback_to(type_snapshot);
926 self.int_unification_table
928 .rollback_to(int_snapshot);
929 self.float_unification_table
931 .rollback_to(float_snapshot);
933 .rollback_to(region_vars_snapshot);
936 fn commit_from(&self, snapshot: CombinedSnapshot) {
937 debug!("commit_from()");
938 let CombinedSnapshot { projection_cache_snapshot,
942 region_vars_snapshot,
943 was_in_snapshot } = snapshot;
945 self.in_snapshot.set(was_in_snapshot);
947 self.projection_cache
949 .commit(projection_cache_snapshot);
952 .commit(type_snapshot);
953 self.int_unification_table
955 .commit(int_snapshot);
956 self.float_unification_table
958 .commit(float_snapshot);
960 .commit(region_vars_snapshot);
963 /// Execute `f` and commit the bindings
964 pub fn commit_unconditionally<R, F>(&self, f: F) -> R where
968 let snapshot = self.start_snapshot();
970 self.commit_from(snapshot);
974 /// Execute `f` and commit the bindings if closure `f` returns `Ok(_)`
975 pub fn commit_if_ok<T, E, F>(&self, f: F) -> Result<T, E> where
976 F: FnOnce(&CombinedSnapshot) -> Result<T, E>
978 debug!("commit_if_ok()");
979 let snapshot = self.start_snapshot();
980 let r = f(&snapshot);
981 debug!("commit_if_ok() -- r.is_ok() = {}", r.is_ok());
983 Ok(_) => { self.commit_from(snapshot); }
984 Err(_) => { self.rollback_to("commit_if_ok -- error", snapshot); }
989 // Execute `f` in a snapshot, and commit the bindings it creates
990 pub fn in_snapshot<T, F>(&self, f: F) -> T where
991 F: FnOnce(&CombinedSnapshot) -> T
993 debug!("in_snapshot()");
994 let snapshot = self.start_snapshot();
995 let r = f(&snapshot);
996 self.commit_from(snapshot);
1000 /// Execute `f` then unroll any bindings it creates
1001 pub fn probe<R, F>(&self, f: F) -> R where
1002 F: FnOnce(&CombinedSnapshot) -> R,
1005 let snapshot = self.start_snapshot();
1006 let r = f(&snapshot);
1007 self.rollback_to("probe", snapshot);
1011 pub fn add_given(&self,
1012 sub: ty::Region<'tcx>,
1015 self.region_vars.add_given(sub, sup);
1018 pub fn sub_types(&self,
1019 a_is_expected: bool,
1020 cause: &ObligationCause<'tcx>,
1023 -> InferResult<'tcx, ()>
1025 debug!("sub_types({:?} <: {:?})", a, b);
1026 self.commit_if_ok(|_| {
1027 let trace = TypeTrace::types(cause, a_is_expected, a, b);
1028 self.sub(a_is_expected, trace, &a, &b).map(|ok| ok.unit())
1032 pub fn can_sub_types(&self,
1038 let origin = &ObligationCause::dummy();
1039 let trace = TypeTrace::types(origin, true, a, b);
1040 self.sub(true, trace, &a, &b).map(|InferOk { obligations: _, .. }| {
1041 // Ignore obligations, since we are unrolling
1042 // everything anyway.
1047 pub fn eq_types(&self,
1048 a_is_expected: bool,
1049 cause: &ObligationCause<'tcx>,
1052 -> InferResult<'tcx, ()>
1054 self.commit_if_ok(|_| {
1055 let trace = TypeTrace::types(cause, a_is_expected, a, b);
1056 self.equate(a_is_expected, trace, &a, &b).map(|ok| ok.unit())
1060 pub fn eq_trait_refs(&self,
1061 a_is_expected: bool,
1062 cause: &ObligationCause<'tcx>,
1063 a: ty::TraitRef<'tcx>,
1064 b: ty::TraitRef<'tcx>)
1065 -> InferResult<'tcx, ()>
1067 debug!("eq_trait_refs({:?} = {:?})", a, b);
1068 self.commit_if_ok(|_| {
1069 let trace = TypeTrace {
1070 cause: cause.clone(),
1071 values: TraitRefs(ExpectedFound::new(a_is_expected, a, b))
1073 self.equate(a_is_expected, trace, &a, &b).map(|ok| ok.unit())
1077 pub fn eq_impl_headers(&self,
1078 a_is_expected: bool,
1079 cause: &ObligationCause<'tcx>,
1080 a: &ty::ImplHeader<'tcx>,
1081 b: &ty::ImplHeader<'tcx>)
1082 -> InferResult<'tcx, ()>
1084 debug!("eq_impl_header({:?} = {:?})", a, b);
1085 match (a.trait_ref, b.trait_ref) {
1086 (Some(a_ref), Some(b_ref)) => self.eq_trait_refs(a_is_expected, cause, a_ref, b_ref),
1087 (None, None) => self.eq_types(a_is_expected, cause, a.self_ty, b.self_ty),
1088 _ => bug!("mk_eq_impl_headers given mismatched impl kinds"),
1092 pub fn sub_poly_trait_refs(&self,
1093 a_is_expected: bool,
1094 cause: ObligationCause<'tcx>,
1095 a: ty::PolyTraitRef<'tcx>,
1096 b: ty::PolyTraitRef<'tcx>)
1097 -> InferResult<'tcx, ()>
1099 debug!("sub_poly_trait_refs({:?} <: {:?})", a, b);
1100 self.commit_if_ok(|_| {
1101 let trace = TypeTrace {
1103 values: PolyTraitRefs(ExpectedFound::new(a_is_expected, a, b))
1105 self.sub(a_is_expected, trace, &a, &b).map(|ok| ok.unit())
1109 pub fn sub_regions(&self,
1110 origin: SubregionOrigin<'tcx>,
1111 a: ty::Region<'tcx>,
1112 b: ty::Region<'tcx>) {
1113 debug!("sub_regions({:?} <: {:?})", a, b);
1114 self.region_vars.make_subregion(origin, a, b);
1117 pub fn equality_predicate(&self,
1118 cause: &ObligationCause<'tcx>,
1119 predicate: &ty::PolyEquatePredicate<'tcx>)
1120 -> InferResult<'tcx, ()>
1122 self.commit_if_ok(|snapshot| {
1123 let (ty::EquatePredicate(a, b), skol_map) =
1124 self.skolemize_late_bound_regions(predicate, snapshot);
1125 let cause_span = cause.span;
1126 let eqty_ok = self.eq_types(false, cause, a, b)?;
1127 self.leak_check(false, cause_span, &skol_map, snapshot)?;
1128 self.pop_skolemized(skol_map, snapshot);
1133 pub fn subtype_predicate(&self,
1134 cause: &ObligationCause<'tcx>,
1135 predicate: &ty::PolySubtypePredicate<'tcx>)
1136 -> Option<InferResult<'tcx, ()>>
1138 // Subtle: it's ok to skip the binder here and resolve because
1139 // `shallow_resolve` just ignores anything that is not a type
1140 // variable, and because type variable's can't (at present, at
1141 // least) capture any of the things bound by this binder.
1143 // Really, there is no *particular* reason to do this
1144 // `shallow_resolve` here except as a
1145 // micro-optimization. Naturally I could not
1146 // resist. -nmatsakis
1147 let two_unbound_type_vars = {
1148 let a = self.shallow_resolve(predicate.skip_binder().a);
1149 let b = self.shallow_resolve(predicate.skip_binder().b);
1150 a.is_ty_var() && b.is_ty_var()
1153 if two_unbound_type_vars {
1154 // Two unbound type variables? Can't make progress.
1158 Some(self.commit_if_ok(|snapshot| {
1159 let (ty::SubtypePredicate { a_is_expected, a, b}, skol_map) =
1160 self.skolemize_late_bound_regions(predicate, snapshot);
1162 let cause_span = cause.span;
1163 let ok = self.sub_types(a_is_expected, cause, a, b)?;
1164 self.leak_check(false, cause_span, &skol_map, snapshot)?;
1165 self.pop_skolemized(skol_map, snapshot);
1170 pub fn region_outlives_predicate(&self,
1171 cause: &traits::ObligationCause<'tcx>,
1172 predicate: &ty::PolyRegionOutlivesPredicate<'tcx>)
1175 self.commit_if_ok(|snapshot| {
1176 let (ty::OutlivesPredicate(r_a, r_b), skol_map) =
1177 self.skolemize_late_bound_regions(predicate, snapshot);
1179 SubregionOrigin::from_obligation_cause(cause,
1180 || RelateRegionParamBound(cause.span));
1181 self.sub_regions(origin, r_b, r_a); // `b : a` ==> `a <= b`
1182 self.leak_check(false, cause.span, &skol_map, snapshot)?;
1183 Ok(self.pop_skolemized(skol_map, snapshot))
1187 pub fn next_ty_var_id(&self, diverging: bool, origin: TypeVariableOrigin) -> TyVid {
1190 .new_var(diverging, origin, None)
1193 pub fn next_ty_var(&self, origin: TypeVariableOrigin) -> Ty<'tcx> {
1194 self.tcx.mk_var(self.next_ty_var_id(false, origin))
1197 pub fn next_diverging_ty_var(&self, origin: TypeVariableOrigin) -> Ty<'tcx> {
1198 self.tcx.mk_var(self.next_ty_var_id(true, origin))
1201 pub fn next_int_var_id(&self) -> IntVid {
1202 self.int_unification_table
1207 pub fn next_float_var_id(&self) -> FloatVid {
1208 self.float_unification_table
1213 pub fn next_region_var(&self, origin: RegionVariableOrigin)
1214 -> ty::Region<'tcx> {
1215 self.tcx.mk_region(ty::ReVar(self.region_vars.new_region_var(origin)))
1218 /// Create a region inference variable for the given
1219 /// region parameter definition.
1220 pub fn region_var_for_def(&self,
1222 def: &ty::RegionParameterDef)
1223 -> ty::Region<'tcx> {
1224 self.next_region_var(EarlyBoundRegion(span, def.name, def.issue_32330))
1227 /// Create a type inference variable for the given
1228 /// type parameter definition. The substitutions are
1229 /// for actual parameters that may be referred to by
1230 /// the default of this type parameter, if it exists.
1231 /// E.g. `struct Foo<A, B, C = (A, B)>(...);` when
1232 /// used in a path such as `Foo::<T, U>::new()` will
1233 /// use an inference variable for `C` with `[T, U]`
1234 /// as the substitutions for the default, `(T, U)`.
1235 pub fn type_var_for_def(&self,
1237 def: &ty::TypeParameterDef,
1238 substs: &[Kind<'tcx>])
1240 let default = if def.has_default {
1241 let default = self.tcx.type_of(def.def_id);
1242 Some(type_variable::Default {
1243 ty: default.subst_spanned(self.tcx, substs, Some(span)),
1252 let ty_var_id = self.type_variables
1255 TypeVariableOrigin::TypeParameterDefinition(span, def.name),
1258 self.tcx.mk_var(ty_var_id)
1261 /// Given a set of generics defined on a type or impl, returns a substitution mapping each
1262 /// type/region parameter to a fresh inference variable.
1263 pub fn fresh_substs_for_item(&self,
1266 -> &'tcx Substs<'tcx> {
1267 Substs::for_item(self.tcx, def_id, |def, _| {
1268 self.region_var_for_def(span, def)
1270 self.type_var_for_def(span, def, substs)
1274 pub fn fresh_bound_region(&self, debruijn: ty::DebruijnIndex) -> ty::Region<'tcx> {
1275 self.region_vars.new_bound(debruijn)
1278 /// True if errors have been reported since this infcx was
1279 /// created. This is sometimes used as a heuristic to skip
1280 /// reporting errors that often occur as a result of earlier
1281 /// errors, but where it's hard to be 100% sure (e.g., unresolved
1282 /// inference variables, regionck errors).
1283 pub fn is_tainted_by_errors(&self) -> bool {
1284 debug!("is_tainted_by_errors(err_count={}, err_count_on_creation={}, \
1285 tainted_by_errors_flag={})",
1286 self.tcx.sess.err_count(),
1287 self.err_count_on_creation,
1288 self.tainted_by_errors_flag.get());
1290 if self.tcx.sess.err_count() > self.err_count_on_creation {
1291 return true; // errors reported since this infcx was made
1293 self.tainted_by_errors_flag.get()
1296 /// Set the "tainted by errors" flag to true. We call this when we
1297 /// observe an error from a prior pass.
1298 pub fn set_tainted_by_errors(&self) {
1299 debug!("set_tainted_by_errors()");
1300 self.tainted_by_errors_flag.set(true)
1303 pub fn node_type(&self, id: ast::NodeId) -> Ty<'tcx> {
1304 match self.tables.borrow().node_types.get(&id) {
1307 None if self.is_tainted_by_errors() =>
1310 bug!("no type for node {}: {} in fcx",
1311 id, self.tcx.hir.node_to_string(id));
1316 pub fn expr_ty(&self, ex: &hir::Expr) -> Ty<'tcx> {
1317 match self.tables.borrow().node_types.get(&ex.id) {
1320 bug!("no type for expr in fcx");
1325 pub fn resolve_regions_and_report_errors(&self,
1326 region_context: DefId,
1327 region_map: &RegionMaps,
1328 free_regions: &FreeRegionMap<'tcx>) {
1329 let region_rels = RegionRelations::new(self.tcx,
1333 let errors = self.region_vars.resolve_regions(®ion_rels);
1334 if !self.is_tainted_by_errors() {
1335 // As a heuristic, just skip reporting region errors
1336 // altogether if other errors have been reported while
1337 // this infcx was in use. This is totally hokey but
1338 // otherwise we have a hard time separating legit region
1339 // errors from silly ones.
1340 self.report_region_errors(&errors); // see error_reporting module
1344 pub fn ty_to_string(&self, t: Ty<'tcx>) -> String {
1345 self.resolve_type_vars_if_possible(&t).to_string()
1348 pub fn tys_to_string(&self, ts: &[Ty<'tcx>]) -> String {
1349 let tstrs: Vec<String> = ts.iter().map(|t| self.ty_to_string(*t)).collect();
1350 format!("({})", tstrs.join(", "))
1353 pub fn trait_ref_to_string(&self, t: &ty::TraitRef<'tcx>) -> String {
1354 self.resolve_type_vars_if_possible(t).to_string()
1357 pub fn shallow_resolve(&self, typ: Ty<'tcx>) -> Ty<'tcx> {
1359 ty::TyInfer(ty::TyVar(v)) => {
1360 // Not entirely obvious: if `typ` is a type variable,
1361 // it can be resolved to an int/float variable, which
1362 // can then be recursively resolved, hence the
1363 // recursion. Note though that we prevent type
1364 // variables from unifying to other type variables
1365 // directly (though they may be embedded
1366 // structurally), and we prevent cycles in any case,
1367 // so this recursion should always be of very limited
1369 self.type_variables.borrow_mut()
1371 .map(|t| self.shallow_resolve(t))
1375 ty::TyInfer(ty::IntVar(v)) => {
1376 self.int_unification_table
1379 .map(|v| v.to_type(self.tcx))
1383 ty::TyInfer(ty::FloatVar(v)) => {
1384 self.float_unification_table
1387 .map(|v| v.to_type(self.tcx))
1397 pub fn resolve_type_vars_if_possible<T>(&self, value: &T) -> T
1398 where T: TypeFoldable<'tcx>
1401 * Where possible, replaces type/int/float variables in
1402 * `value` with their final value. Note that region variables
1403 * are unaffected. If a type variable has not been unified, it
1404 * is left as is. This is an idempotent operation that does
1405 * not affect inference state in any way and so you can do it
1409 if !value.needs_infer() {
1410 return value.clone(); // avoid duplicated subst-folding
1412 let mut r = resolve::OpportunisticTypeResolver::new(self);
1413 value.fold_with(&mut r)
1416 pub fn resolve_type_and_region_vars_if_possible<T>(&self, value: &T) -> T
1417 where T: TypeFoldable<'tcx>
1419 let mut r = resolve::OpportunisticTypeAndRegionResolver::new(self);
1420 value.fold_with(&mut r)
1423 /// Resolves all type variables in `t` and then, if any were left
1424 /// unresolved, substitutes an error type. This is used after the
1425 /// main checking when doing a second pass before writeback. The
1426 /// justification is that writeback will produce an error for
1427 /// these unconstrained type variables.
1428 fn resolve_type_vars_or_error(&self, t: &Ty<'tcx>) -> mc::McResult<Ty<'tcx>> {
1429 let ty = self.resolve_type_vars_if_possible(t);
1430 if ty.references_error() || ty.is_ty_var() {
1431 debug!("resolve_type_vars_or_error: error from {:?}", ty);
1438 pub fn fully_resolve<T:TypeFoldable<'tcx>>(&self, value: &T) -> FixupResult<T> {
1440 * Attempts to resolve all type/region variables in
1441 * `value`. Region inference must have been run already (e.g.,
1442 * by calling `resolve_regions_and_report_errors`). If some
1443 * variable was never unified, an `Err` results.
1445 * This method is idempotent, but it not typically not invoked
1446 * except during the writeback phase.
1449 resolve::fully_resolve(self, value)
1452 // [Note-Type-error-reporting]
1453 // An invariant is that anytime the expected or actual type is TyError (the special
1454 // error type, meaning that an error occurred when typechecking this expression),
1455 // this is a derived error. The error cascaded from another error (that was already
1456 // reported), so it's not useful to display it to the user.
1457 // The following methods implement this logic.
1458 // They check if either the actual or expected type is TyError, and don't print the error
1459 // in this case. The typechecker should only ever report type errors involving mismatched
1460 // types using one of these methods, and should not call span_err directly for such
1463 pub fn type_error_message<M>(&self,
1466 actual_ty: Ty<'tcx>)
1467 where M: FnOnce(String) -> String,
1469 self.type_error_struct(sp, mk_msg, actual_ty).emit();
1472 // FIXME: this results in errors without an error code. Deprecate?
1473 pub fn type_error_struct<M>(&self,
1476 actual_ty: Ty<'tcx>)
1477 -> DiagnosticBuilder<'tcx>
1478 where M: FnOnce(String) -> String,
1480 self.type_error_struct_with_diag(sp, |actual_ty| {
1481 self.tcx.sess.struct_span_err(sp, &mk_msg(actual_ty))
1485 pub fn type_error_struct_with_diag<M>(&self,
1488 actual_ty: Ty<'tcx>)
1489 -> DiagnosticBuilder<'tcx>
1490 where M: FnOnce(String) -> DiagnosticBuilder<'tcx>,
1492 let actual_ty = self.resolve_type_vars_if_possible(&actual_ty);
1493 debug!("type_error_struct_with_diag({:?}, {:?})", sp, actual_ty);
1495 // Don't report an error if actual type is TyError.
1496 if actual_ty.references_error() {
1497 return self.tcx.sess.diagnostic().struct_dummy();
1500 mk_diag(self.ty_to_string(actual_ty))
1503 pub fn report_mismatched_types(&self,
1504 cause: &ObligationCause<'tcx>,
1507 err: TypeError<'tcx>)
1508 -> DiagnosticBuilder<'tcx> {
1509 let trace = TypeTrace::types(cause, true, expected, actual);
1510 self.report_and_explain_type_error(trace, &err)
1513 pub fn report_conflicting_default_types(&self,
1515 body_id: ast::NodeId,
1516 expected: type_variable::Default<'tcx>,
1517 actual: type_variable::Default<'tcx>) {
1518 let trace = TypeTrace {
1519 cause: ObligationCause::misc(span, body_id),
1520 values: Types(ExpectedFound {
1521 expected: expected.ty,
1526 self.report_and_explain_type_error(
1528 &TypeError::TyParamDefaultMismatch(ExpectedFound {
1535 pub fn replace_late_bound_regions_with_fresh_var<T>(
1538 lbrct: LateBoundRegionConversionTime,
1539 value: &ty::Binder<T>)
1540 -> (T, FxHashMap<ty::BoundRegion, ty::Region<'tcx>>)
1541 where T : TypeFoldable<'tcx>
1543 self.tcx.replace_late_bound_regions(
1545 |br| self.next_region_var(LateBoundRegion(span, br, lbrct)))
1548 /// Given a higher-ranked projection predicate like:
1550 /// for<'a> <T as Fn<&'a u32>>::Output = &'a u32
1552 /// and a target trait-ref like:
1554 /// <T as Fn<&'x u32>>
1556 /// find a substitution `S` for the higher-ranked regions (here,
1557 /// `['a => 'x]`) such that the predicate matches the trait-ref,
1558 /// and then return the value (here, `&'a u32`) but with the
1559 /// substitution applied (hence, `&'x u32`).
1561 /// See `higher_ranked_match` in `higher_ranked/mod.rs` for more
1563 pub fn match_poly_projection_predicate(&self,
1564 cause: ObligationCause<'tcx>,
1565 match_a: ty::PolyProjectionPredicate<'tcx>,
1566 match_b: ty::TraitRef<'tcx>)
1567 -> InferResult<'tcx, HrMatchResult<Ty<'tcx>>>
1569 let span = cause.span;
1570 let match_trait_ref = match_a.skip_binder().projection_ty.trait_ref;
1571 let trace = TypeTrace {
1573 values: TraitRefs(ExpectedFound::new(true, match_trait_ref, match_b))
1576 let match_pair = match_a.map_bound(|p| (p.projection_ty.trait_ref, p.ty));
1577 let mut combine = self.combine_fields(trace);
1578 let result = combine.higher_ranked_match(span, &match_pair, &match_b, true)?;
1579 Ok(InferOk { value: result, obligations: combine.obligations })
1582 /// See `verify_generic_bound` method in `region_inference`
1583 pub fn verify_generic_bound(&self,
1584 origin: SubregionOrigin<'tcx>,
1585 kind: GenericKind<'tcx>,
1586 a: ty::Region<'tcx>,
1587 bound: VerifyBound<'tcx>) {
1588 debug!("verify_generic_bound({:?}, {:?} <: {:?})",
1593 self.region_vars.verify_generic_bound(origin, kind, a, bound);
1596 pub fn can_equate<T>(&self, a: &T, b: &T) -> UnitResult<'tcx>
1597 where T: Relate<'tcx> + fmt::Debug
1599 debug!("can_equate({:?}, {:?})", a, b);
1601 // Gin up a dummy trace, since this won't be committed
1602 // anyhow. We should make this typetrace stuff more
1603 // generic so we don't have to do anything quite this
1605 let trace = TypeTrace::dummy(self.tcx);
1606 self.equate(true, trace, a, b).map(|InferOk { obligations: _, .. }| {
1607 // We can intentionally ignore obligations here, since
1608 // this is part of a simple test for general
1609 // "equatability". However, it's not entirely clear
1610 // that we *ought* to be, perhaps a better thing would
1611 // be to use a mini-fulfillment context or something
1617 pub fn node_ty(&self, id: ast::NodeId) -> McResult<Ty<'tcx>> {
1618 let ty = self.node_type(id);
1619 self.resolve_type_vars_or_error(&ty)
1622 pub fn expr_ty_adjusted(&self, expr: &hir::Expr) -> McResult<Ty<'tcx>> {
1623 let ty = self.tables.borrow().expr_ty_adjusted(expr);
1624 self.resolve_type_vars_or_error(&ty)
1627 pub fn type_moves_by_default(&self, ty: Ty<'tcx>, span: Span) -> bool {
1628 let ty = self.resolve_type_vars_if_possible(&ty);
1629 if let Some(ty) = self.tcx.lift_to_global(&ty) {
1630 // Even if the type may have no inference variables, during
1631 // type-checking closure types are in local tables only.
1632 let local_closures = match self.tables {
1633 InferTables::InProgress(_) => ty.has_closure_types(),
1636 if !local_closures {
1637 return ty.moves_by_default(self.tcx.global_tcx(), self.param_env(), span);
1641 let copy_def_id = self.tcx.require_lang_item(lang_items::CopyTraitLangItem);
1643 // this can get called from typeck (by euv), and moves_by_default
1644 // rightly refuses to work with inference variables, but
1645 // moves_by_default has a cache, which we want to use in other
1647 !traits::type_known_to_meet_bound(self, ty, copy_def_id, span)
1650 pub fn node_method_ty(&self, method_call: ty::MethodCall)
1651 -> Option<Ty<'tcx>> {
1656 .map(|method| method.ty)
1657 .map(|ty| self.resolve_type_vars_if_possible(&ty))
1660 pub fn node_method_id(&self, method_call: ty::MethodCall)
1666 .map(|method| method.def_id)
1669 pub fn is_method_call(&self, id: ast::NodeId) -> bool {
1670 self.tables.borrow().method_map.contains_key(&ty::MethodCall::expr(id))
1673 pub fn upvar_capture(&self, upvar_id: ty::UpvarId) -> Option<ty::UpvarCapture<'tcx>> {
1674 self.tables.borrow().upvar_capture_map.get(&upvar_id).cloned()
1677 pub fn param_env(&self) -> &ty::ParameterEnvironment<'gcx> {
1678 &self.parameter_environment
1681 pub fn closure_kind(&self,
1683 -> Option<ty::ClosureKind>
1685 if let InferTables::InProgress(tables) = self.tables {
1686 if let Some(id) = self.tcx.hir.as_local_node_id(def_id) {
1687 return tables.borrow().closure_kinds.get(&id).cloned();
1691 // During typeck, ALL closures are local. But afterwards,
1692 // during trans, we see closure ids from other traits.
1693 // That may require loading the closure data out of the
1695 Some(self.tcx.closure_kind(def_id))
1698 pub fn closure_type(&self, def_id: DefId) -> ty::PolyFnSig<'tcx> {
1699 if let InferTables::InProgress(tables) = self.tables {
1700 if let Some(id) = self.tcx.hir.as_local_node_id(def_id) {
1701 if let Some(&ty) = tables.borrow().closure_tys.get(&id) {
1707 self.tcx.closure_type(def_id)
1711 impl<'a, 'gcx, 'tcx> TypeTrace<'tcx> {
1712 pub fn span(&self) -> Span {
1716 pub fn types(cause: &ObligationCause<'tcx>,
1717 a_is_expected: bool,
1720 -> TypeTrace<'tcx> {
1722 cause: cause.clone(),
1723 values: Types(ExpectedFound::new(a_is_expected, a, b))
1727 pub fn dummy(tcx: TyCtxt<'a, 'gcx, 'tcx>) -> TypeTrace<'tcx> {
1729 cause: ObligationCause::dummy(),
1730 values: Types(ExpectedFound {
1731 expected: tcx.types.err,
1732 found: tcx.types.err,
1738 impl<'tcx> fmt::Debug for TypeTrace<'tcx> {
1739 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
1740 write!(f, "TypeTrace({:?})", self.cause)
1744 impl<'tcx> SubregionOrigin<'tcx> {
1745 pub fn span(&self) -> Span {
1747 Subtype(ref a) => a.span(),
1748 InfStackClosure(a) => a,
1749 InvokeClosure(a) => a,
1750 DerefPointer(a) => a,
1751 FreeVariable(a, _) => a,
1753 RelateObjectBound(a) => a,
1754 RelateParamBound(a, _) => a,
1755 RelateRegionParamBound(a) => a,
1756 RelateDefaultParamBound(a, _) => a,
1758 ReborrowUpvar(a, _) => a,
1759 DataBorrowed(_, a) => a,
1760 ReferenceOutlivesReferent(_, a) => a,
1761 ParameterInScope(_, a) => a,
1762 ExprTypeIsNotInScope(_, a) => a,
1763 BindingTypeIsNotValidAtDecl(a) => a,
1770 SafeDestructor(a) => a,
1771 CompareImplMethodObligation { span, .. } => span,
1775 pub fn from_obligation_cause<F>(cause: &traits::ObligationCause<'tcx>,
1778 where F: FnOnce() -> Self
1781 traits::ObligationCauseCode::ReferenceOutlivesReferent(ref_type) =>
1782 SubregionOrigin::ReferenceOutlivesReferent(ref_type, cause.span),
1784 traits::ObligationCauseCode::CompareImplMethodObligation { item_name,
1788 SubregionOrigin::CompareImplMethodObligation {
1790 item_name: item_name,
1791 impl_item_def_id: impl_item_def_id,
1792 trait_item_def_id: trait_item_def_id,
1801 impl RegionVariableOrigin {
1802 pub fn span(&self) -> Span {
1804 MiscVariable(a) => a,
1805 PatternRegion(a) => a,
1806 AddrOfRegion(a) => a,
1809 EarlyBoundRegion(a, ..) => a,
1810 LateBoundRegion(a, ..) => a,
1811 BoundRegionInCoherence(_) => syntax_pos::DUMMY_SP,
1812 UpvarRegion(_, a) => a
1817 impl<'tcx> TypeFoldable<'tcx> for ValuePairs<'tcx> {
1818 fn super_fold_with<'gcx: 'tcx, F: TypeFolder<'gcx, 'tcx>>(&self, folder: &mut F) -> Self {
1820 ValuePairs::Types(ref ef) => {
1821 ValuePairs::Types(ef.fold_with(folder))
1823 ValuePairs::TraitRefs(ref ef) => {
1824 ValuePairs::TraitRefs(ef.fold_with(folder))
1826 ValuePairs::PolyTraitRefs(ref ef) => {
1827 ValuePairs::PolyTraitRefs(ef.fold_with(folder))
1832 fn super_visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> bool {
1834 ValuePairs::Types(ref ef) => ef.visit_with(visitor),
1835 ValuePairs::TraitRefs(ref ef) => ef.visit_with(visitor),
1836 ValuePairs::PolyTraitRefs(ref ef) => ef.visit_with(visitor),
1841 impl<'tcx> TypeFoldable<'tcx> for TypeTrace<'tcx> {
1842 fn super_fold_with<'gcx: 'tcx, F: TypeFolder<'gcx, 'tcx>>(&self, folder: &mut F) -> Self {
1844 cause: self.cause.fold_with(folder),
1845 values: self.values.fold_with(folder)
1849 fn super_visit_with<V: TypeVisitor<'tcx>>(&self, visitor: &mut V) -> bool {
1850 self.cause.visit_with(visitor) || self.values.visit_with(visitor)