src/librustc_mir/borrow_check/nll/type_check/mod.rs

   1 // Copyright 2016 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.
   4 //
   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.
  10
  11 //! This pass type-checks the MIR to ensure it is not broken.
  12 #![allow(unreachable_code)]
  13
  14 use borrow_check::borrow_set::BorrowSet;
  15 use borrow_check::location::LocationTable;
  16 use borrow_check::nll::constraints::{ConstraintSet, OutlivesConstraint};
  17 use borrow_check::nll::facts::AllFacts;
  18 use borrow_check::nll::region_infer::values::LivenessValues;
  19 use borrow_check::nll::region_infer::values::PlaceholderIndex;
  20 use borrow_check::nll::region_infer::values::PlaceholderIndices;
  21 use borrow_check::nll::region_infer::values::RegionValueElements;
  22 use borrow_check::nll::region_infer::{ClosureRegionRequirementsExt, TypeTest};
  23 use borrow_check::nll::renumber;
  24 use borrow_check::nll::type_check::free_region_relations::{
  25     CreateResult, UniversalRegionRelations,
  26 };
  27 use borrow_check::nll::universal_regions::{DefiningTy, UniversalRegions};
  28 use borrow_check::nll::ToRegionVid;
  29 use dataflow::move_paths::MoveData;
  30 use dataflow::FlowAtLocation;
  31 use dataflow::MaybeInitializedPlaces;
  32 use either::Either;
  33 use rustc::hir;
  34 use rustc::hir::def_id::DefId;
  35 use rustc::infer::canonical::QueryRegionConstraint;
  36 use rustc::infer::outlives::env::RegionBoundPairs;
  37 use rustc::infer::{InferCtxt, InferOk, LateBoundRegionConversionTime, NLLRegionVariableOrigin};
  38 use rustc::mir::interpret::EvalErrorKind::BoundsCheck;
  39 use rustc::mir::tcx::PlaceTy;
  40 use rustc::mir::visit::{PlaceContext, Visitor, MutatingUseContext, NonMutatingUseContext};
  41 use rustc::mir::*;
  42 use rustc::traits::query::type_op;
  43 use rustc::traits::query::type_op::custom::CustomTypeOp;
  44 use rustc::traits::query::{Fallible, NoSolution};
  45 use rustc::traits::{ObligationCause, PredicateObligations};
  46 use rustc::ty::fold::TypeFoldable;
  47 use rustc::ty::subst::{Subst, Substs, UnpackedKind};
  48 use rustc::ty::{self, RegionVid, ToPolyTraitRef, Ty, TyCtxt, TyKind};
  49 use rustc_data_structures::fx::{FxHashMap, FxHashSet};
  50 use rustc_data_structures::indexed_vec::IndexVec;
  51 use std::rc::Rc;
  52 use std::{fmt, iter};
  53 use syntax_pos::{Span, DUMMY_SP};
  54 use transform::{MirPass, MirSource};
  55
  56 macro_rules! span_mirbug {
  57     ($context:expr, $elem:expr, $($message:tt)*) => ({
  58         $crate::borrow_check::nll::type_check::mirbug(
  59             $context.tcx(),
  60             $context.last_span,
  61             &format!(
  62                 "broken MIR in {:?} ({:?}): {}",
  63                 $context.mir_def_id,
  64                 $elem,
  65                 format_args!($($message)*),
  66             ),
  67         )
  68     })
  69 }
  70
  71 macro_rules! span_mirbug_and_err {
  72     ($context:expr, $elem:expr, $($message:tt)*) => ({
  73         {
  74             span_mirbug!($context, $elem, $($message)*);
  75             $context.error()
  76         }
  77     })
  78 }
  79
  80 mod constraint_conversion;
  81 pub mod free_region_relations;
  82 mod input_output;
  83 crate mod liveness;
  84 mod relate_tys;
  85
  86 /// Type checks the given `mir` in the context of the inference
  87 /// context `infcx`. Returns any region constraints that have yet to
  88 /// be proven. This result is includes liveness constraints that
  89 /// ensure that regions appearing in the types of all local variables
  90 /// are live at all points where that local variable may later be
  91 /// used.
  92 ///
  93 /// This phase of type-check ought to be infallible -- this is because
  94 /// the original, HIR-based type-check succeeded. So if any errors
  95 /// occur here, we will get a `bug!` reported.
  96 ///
  97 /// # Parameters
  98 ///
  99 /// - `infcx` -- inference context to use
 100 /// - `param_env` -- parameter environment to use for trait solving
 101 /// - `mir` -- MIR to type-check
 102 /// - `mir_def_id` -- DefId from which the MIR is derived (must be local)
 103 /// - `region_bound_pairs` -- the implied outlives obligations between type parameters
 104 ///   and lifetimes (e.g., `&'a T` implies `T: 'a`)
 105 /// - `implicit_region_bound` -- a region which all generic parameters are assumed
 106 ///   to outlive; should represent the fn body
 107 /// - `input_tys` -- fully liberated, but **not** normalized, expected types of the arguments;
 108 ///   the types of the input parameters found in the MIR itself will be equated with these
 109 /// - `output_ty` -- fully liberated, but **not** normalized, expected return type;
 110 ///   the type for the RETURN_PLACE will be equated with this
 111 /// - `liveness` -- results of a liveness computation on the MIR; used to create liveness
 112 ///   constraints for the regions in the types of variables
 113 /// - `flow_inits` -- results of a maybe-init dataflow analysis
 114 /// - `move_data` -- move-data constructed when performing the maybe-init dataflow analysiss
 115 pub(crate) fn type_check<'gcx, 'tcx>(
 116     infcx: &InferCtxt<'_, 'gcx, 'tcx>,
 117     param_env: ty::ParamEnv<'gcx>,
 118     mir: &Mir<'tcx>,
 119     mir_def_id: DefId,
 120     universal_regions: &Rc<UniversalRegions<'tcx>>,
 121     location_table: &LocationTable,
 122     borrow_set: &BorrowSet<'tcx>,
 123     all_facts: &mut Option<AllFacts>,
 124     flow_inits: &mut FlowAtLocation<MaybeInitializedPlaces<'_, 'gcx, 'tcx>>,
 125     move_data: &MoveData<'tcx>,
 126     elements: &Rc<RegionValueElements>,
 127 ) -> MirTypeckResults<'tcx> {
 128     let implicit_region_bound = infcx.tcx.mk_region(ty::ReVar(universal_regions.fr_fn_body));
 129     let mut constraints = MirTypeckRegionConstraints {
 130         placeholder_indices: PlaceholderIndices::default(),
 131         placeholder_index_to_region: IndexVec::default(),
 132         liveness_constraints: LivenessValues::new(elements),
 133         outlives_constraints: ConstraintSet::default(),
 134         closure_bounds_mapping: Default::default(),
 135         type_tests: Vec::default(),
 136     };
 137
 138     let CreateResult {
 139         universal_region_relations,
 140         region_bound_pairs,
 141         normalized_inputs_and_output,
 142     } = free_region_relations::create(
 143         infcx,
 144         param_env,
 145         Some(implicit_region_bound),
 146         universal_regions,
 147         &mut constraints,
 148     );
 149
 150     let mut borrowck_context = BorrowCheckContext {
 151         universal_regions,
 152         location_table,
 153         borrow_set,
 154         all_facts,
 155         constraints: &mut constraints,
 156     };
 157
 158     type_check_internal(
 159         infcx,
 160         mir_def_id,
 161         param_env,
 162         mir,
 163         &region_bound_pairs,
 164         Some(implicit_region_bound),
 165         Some(&mut borrowck_context),
 166         Some(&universal_region_relations),
 167         |cx| {
 168             cx.equate_inputs_and_outputs(mir, universal_regions, &normalized_inputs_and_output);
 169             liveness::generate(cx, mir, elements, flow_inits, move_data, location_table);
 170
 171             cx.borrowck_context
 172                 .as_mut()
 173                 .map(|bcx| translate_outlives_facts(bcx));
 174         },
 175     );
 176
 177     MirTypeckResults {
 178         constraints,
 179         universal_region_relations,
 180     }
 181 }
 182
 183 fn type_check_internal<'a, 'gcx, 'tcx, R>(
 184     infcx: &'a InferCtxt<'a, 'gcx, 'tcx>,
 185     mir_def_id: DefId,
 186     param_env: ty::ParamEnv<'gcx>,
 187     mir: &'a Mir<'tcx>,
 188     region_bound_pairs: &'a RegionBoundPairs<'tcx>,
 189     implicit_region_bound: Option<ty::Region<'tcx>>,
 190     borrowck_context: Option<&'a mut BorrowCheckContext<'a, 'tcx>>,
 191     universal_region_relations: Option<&'a UniversalRegionRelations<'tcx>>,
 192     mut extra: impl FnMut(&mut TypeChecker<'a, 'gcx, 'tcx>) -> R,
 193 ) -> R where {
 194     let mut checker = TypeChecker::new(
 195         infcx,
 196         mir,
 197         mir_def_id,
 198         param_env,
 199         region_bound_pairs,
 200         implicit_region_bound,
 201         borrowck_context,
 202         universal_region_relations,
 203     );
 204     let errors_reported = {
 205         let mut verifier = TypeVerifier::new(&mut checker, mir);
 206         verifier.visit_mir(mir);
 207         verifier.errors_reported
 208     };
 209
 210     if !errors_reported {
 211         // if verifier failed, don't do further checks to avoid ICEs
 212         checker.typeck_mir(mir);
 213     }
 214
 215     extra(&mut checker)
 216 }
 217
 218 fn translate_outlives_facts(cx: &mut BorrowCheckContext) {
 219     if let Some(facts) = cx.all_facts {
 220         let location_table = cx.location_table;
 221         facts
 222             .outlives
 223             .extend(cx.constraints.outlives_constraints.iter().flat_map(
 224                 |constraint: &OutlivesConstraint| {
 225                     if let Some(from_location) = constraint.locations.from_location() {
 226                         Either::Left(iter::once((
 227                             constraint.sup,
 228                             constraint.sub,
 229                             location_table.mid_index(from_location),
 230                         )))
 231                     } else {
 232                         Either::Right(
 233                             location_table
 234                                 .all_points()
 235                                 .map(move |location| (constraint.sup, constraint.sub, location)),
 236                         )
 237                     }
 238                 },
 239             ));
 240     }
 241 }
 242
 243 fn mirbug(tcx: TyCtxt, span: Span, msg: &str) {
 244     // We sometimes see MIR failures (notably predicate failures) due to
 245     // the fact that we check rvalue sized predicates here. So use `delay_span_bug`
 246     // to avoid reporting bugs in those cases.
 247     tcx.sess.diagnostic().delay_span_bug(span, msg);
 248 }
 249
 250 enum FieldAccessError {
 251     OutOfRange { field_count: usize },
 252 }
 253
 254 /// Verifies that MIR types are sane to not crash further checks.
 255 ///
 256 /// The sanitize_XYZ methods here take an MIR object and compute its
 257 /// type, calling `span_mirbug` and returning an error type if there
 258 /// is a problem.
 259 struct TypeVerifier<'a, 'b: 'a, 'gcx: 'tcx, 'tcx: 'b> {
 260     cx: &'a mut TypeChecker<'b, 'gcx, 'tcx>,
 261     mir: &'a Mir<'tcx>,
 262     last_span: Span,
 263     mir_def_id: DefId,
 264     errors_reported: bool,
 265 }
 266
 267 impl<'a, 'b, 'gcx, 'tcx> Visitor<'tcx> for TypeVerifier<'a, 'b, 'gcx, 'tcx> {
 268     fn visit_span(&mut self, span: &Span) {
 269         if !span.is_dummy() {
 270             self.last_span = *span;
 271         }
 272     }
 273
 274     fn visit_place(&mut self, place: &Place<'tcx>, context: PlaceContext, location: Location) {
 275         self.sanitize_place(place, location, context);
 276     }
 277
 278     fn visit_constant(&mut self, constant: &Constant<'tcx>, location: Location) {
 279         self.super_constant(constant, location);
 280         self.sanitize_constant(constant, location);
 281         self.sanitize_type(constant, constant.ty);
 282
 283         if let Some(user_ty) = constant.user_ty {
 284             if let Err(terr) = self.cx.relate_type_and_user_type(
 285                 constant.ty,
 286                 ty::Variance::Invariant,
 287                 &UserTypeProjection { base: user_ty, projs: vec![], },
 288                 location.to_locations(),
 289                 ConstraintCategory::Boring,
 290             ) {
 291                 span_mirbug!(
 292                     self,
 293                     constant,
 294                     "bad constant user type {:?} vs {:?}: {:?}",
 295                     user_ty,
 296                     constant.ty,
 297                     terr,
 298                 );
 299             }
 300         }
 301     }
 302
 303     fn visit_rvalue(&mut self, rvalue: &Rvalue<'tcx>, location: Location) {
 304         self.super_rvalue(rvalue, location);
 305         let rval_ty = rvalue.ty(self.mir, self.tcx());
 306         self.sanitize_type(rvalue, rval_ty);
 307     }
 308
 309     fn visit_local_decl(&mut self, local: Local, local_decl: &LocalDecl<'tcx>) {
 310         self.super_local_decl(local, local_decl);
 311         self.sanitize_type(local_decl, local_decl.ty);
 312
 313         for (user_ty, span) in local_decl.user_ty.projections_and_spans() {
 314             if let Err(terr) = self.cx.relate_type_and_user_type(
 315                 local_decl.ty,
 316                 ty::Variance::Invariant,
 317                 user_ty,
 318                 Locations::All(*span),
 319                 ConstraintCategory::TypeAnnotation,
 320             ) {
 321                 span_mirbug!(
 322                     self,
 323                     local,
 324                     "bad user type on variable {:?}: {:?} != {:?} ({:?})",
 325                     local,
 326                     local_decl.ty,
 327                     local_decl.user_ty,
 328                     terr,
 329                 );
 330             }
 331         }
 332     }
 333
 334     fn visit_mir(&mut self, mir: &Mir<'tcx>) {
 335         self.sanitize_type(&"return type", mir.return_ty());
 336         for local_decl in &mir.local_decls {
 337             self.sanitize_type(local_decl, local_decl.ty);
 338         }
 339         if self.errors_reported {
 340             return;
 341         }
 342         self.super_mir(mir);
 343     }
 344 }
 345
 346 impl<'a, 'b, 'gcx, 'tcx> TypeVerifier<'a, 'b, 'gcx, 'tcx> {
 347     fn new(cx: &'a mut TypeChecker<'b, 'gcx, 'tcx>, mir: &'a Mir<'tcx>) -> Self {
 348         TypeVerifier {
 349             mir,
 350             mir_def_id: cx.mir_def_id,
 351             cx,
 352             last_span: mir.span,
 353             errors_reported: false,
 354         }
 355     }
 356
 357     fn tcx(&self) -> TyCtxt<'a, 'gcx, 'tcx> {
 358         self.cx.infcx.tcx
 359     }
 360
 361     fn sanitize_type(&mut self, parent: &dyn fmt::Debug, ty: Ty<'tcx>) -> Ty<'tcx> {
 362         if ty.has_escaping_bound_vars() || ty.references_error() {
 363             span_mirbug_and_err!(self, parent, "bad type {:?}", ty)
 364         } else {
 365             ty
 366         }
 367     }
 368
 369     /// Checks that the constant's `ty` field matches up with what
 370     /// would be expected from its literal.
 371     fn sanitize_constant(&mut self, constant: &Constant<'tcx>, location: Location) {
 372         debug!(
 373             "sanitize_constant(constant={:?}, location={:?})",
 374             constant, location
 375         );
 376
 377         // FIXME(#46702) -- We need some way to get the predicates
 378         // associated with the "pre-evaluated" form of the
 379         // constant. For example, consider that the constant
 380         // may have associated constant projections (`<Foo as
 381         // Trait<'a, 'b>>::SOME_CONST`) that impose
 382         // constraints on `'a` and `'b`. These constraints
 383         // would be lost if we just look at the normalized
 384         // value.
 385         if let ty::FnDef(def_id, substs) = constant.literal.ty.sty {
 386             let tcx = self.tcx();
 387             let type_checker = &mut self.cx;
 388
 389             // FIXME -- For now, use the substitutions from
 390             // `value.ty` rather than `value.val`. The
 391             // renumberer will rewrite them to independent
 392             // sets of regions; in principle, we ought to
 393             // derive the type of the `value.val` from "first
 394             // principles" and equate with value.ty, but as we
 395             // are transitioning to the miri-based system, we
 396             // don't have a handy function for that, so for
 397             // now we just ignore `value.val` regions.
 398
 399             let instantiated_predicates = tcx.predicates_of(def_id).instantiate(tcx, substs);
 400             type_checker.normalize_and_prove_instantiated_predicates(
 401                 instantiated_predicates,
 402                 location.to_locations(),
 403             );
 404         }
 405
 406         debug!("sanitize_constant: expected_ty={:?}", constant.literal.ty);
 407
 408         if let Err(terr) = self.cx.eq_types(
 409             constant.literal.ty,
 410             constant.ty,
 411             location.to_locations(),
 412             ConstraintCategory::Boring,
 413         ) {
 414             span_mirbug!(
 415                 self,
 416                 constant,
 417                 "constant {:?} should have type {:?} but has {:?} ({:?})",
 418                 constant,
 419                 constant.literal.ty,
 420                 constant.ty,
 421                 terr,
 422             );
 423         }
 424     }
 425
 426     /// Checks that the types internal to the `place` match up with
 427     /// what would be expected.
 428     fn sanitize_place(
 429         &mut self,
 430         place: &Place<'tcx>,
 431         location: Location,
 432         context: PlaceContext,
 433     ) -> PlaceTy<'tcx> {
 434         debug!("sanitize_place: {:?}", place);
 435         let place_ty = match *place {
 436             Place::Local(index) => PlaceTy::Ty {
 437                 ty: self.mir.local_decls[index].ty,
 438             },
 439             Place::Promoted(box (_index, sty)) => {
 440                 let sty = self.sanitize_type(place, sty);
 441                 // FIXME -- promoted MIR return types reference
 442                 // various "free regions" (e.g., scopes and things)
 443                 // that they ought not to do. We have to figure out
 444                 // how best to handle that -- probably we want treat
 445                 // promoted MIR much like closures, renumbering all
 446                 // their free regions and propagating constraints
 447                 // upwards. We have the same acyclic guarantees, so
 448                 // that should be possible. But for now, ignore them.
 449                 //
 450                 // let promoted_mir = &self.mir.promoted[index];
 451                 // promoted_mir.return_ty()
 452                 PlaceTy::Ty { ty: sty }
 453             }
 454             Place::Static(box Static { def_id, ty: sty }) => {
 455                 let sty = self.sanitize_type(place, sty);
 456                 let ty = self.tcx().type_of(def_id);
 457                 let ty = self.cx.normalize(ty, location);
 458                 if let Err(terr) =
 459                     self.cx
 460                         .eq_types(ty, sty, location.to_locations(), ConstraintCategory::Boring)
 461                 {
 462                     span_mirbug!(
 463                         self,
 464                         place,
 465                         "bad static type ({:?}: {:?}): {:?}",
 466                         ty,
 467                         sty,
 468                         terr
 469                     );
 470                 }
 471                 PlaceTy::Ty { ty: sty }
 472             }
 473             Place::Projection(ref proj) => {
 474                 let base_context = if context.is_mutating_use() {
 475                     PlaceContext::MutatingUse(MutatingUseContext::Projection)
 476                 } else {
 477                     PlaceContext::NonMutatingUse(NonMutatingUseContext::Projection)
 478                 };
 479                 let base_ty = self.sanitize_place(&proj.base, location, base_context);
 480                 if let PlaceTy::Ty { ty } = base_ty {
 481                     if ty.references_error() {
 482                         assert!(self.errors_reported);
 483                         return PlaceTy::Ty {
 484                             ty: self.tcx().types.err,
 485                         };
 486                     }
 487                 }
 488                 self.sanitize_projection(base_ty, &proj.elem, place, location)
 489             }
 490         };
 491         if let PlaceContext::NonMutatingUse(NonMutatingUseContext::Copy) = context {
 492             let tcx = self.tcx();
 493             let trait_ref = ty::TraitRef {
 494                 def_id: tcx.lang_items().copy_trait().unwrap(),
 495                 substs: tcx.mk_substs_trait(place_ty.to_ty(tcx), &[]),
 496             };
 497
 498             // In order to have a Copy operand, the type T of the value must be Copy. Note that we
 499             // prove that T: Copy, rather than using the type_moves_by_default test. This is
 500             // important because type_moves_by_default ignores the resulting region obligations and
 501             // assumes they pass. This can result in bounds from Copy impls being unsoundly ignored
 502             // (e.g., #29149). Note that we decide to use Copy before knowing whether the bounds
 503             // fully apply: in effect, the rule is that if a value of some type could implement
 504             // Copy, then it must.
 505             self.cx.prove_trait_ref(
 506                 trait_ref,
 507                 location.to_locations(),
 508                 ConstraintCategory::CopyBound,
 509             );
 510         }
 511         place_ty
 512     }
 513
 514     fn sanitize_projection(
 515         &mut self,
 516         base: PlaceTy<'tcx>,
 517         pi: &PlaceElem<'tcx>,
 518         place: &Place<'tcx>,
 519         location: Location,
 520     ) -> PlaceTy<'tcx> {
 521         debug!("sanitize_projection: {:?} {:?} {:?}", base, pi, place);
 522         let tcx = self.tcx();
 523         let base_ty = base.to_ty(tcx);
 524         match *pi {
 525             ProjectionElem::Deref => {
 526                 let deref_ty = base_ty.builtin_deref(true);
 527                 PlaceTy::Ty {
 528                     ty: deref_ty.map(|t| t.ty).unwrap_or_else(|| {
 529                         span_mirbug_and_err!(self, place, "deref of non-pointer {:?}", base_ty)
 530                     }),
 531                 }
 532             }
 533             ProjectionElem::Index(i) => {
 534                 let index_ty = Place::Local(i).ty(self.mir, tcx).to_ty(tcx);
 535                 if index_ty != tcx.types.usize {
 536                     PlaceTy::Ty {
 537                         ty: span_mirbug_and_err!(self, i, "index by non-usize {:?}", i),
 538                     }
 539                 } else {
 540                     PlaceTy::Ty {
 541                         ty: base_ty.builtin_index().unwrap_or_else(|| {
 542                             span_mirbug_and_err!(self, place, "index of non-array {:?}", base_ty)
 543                         }),
 544                     }
 545                 }
 546             }
 547             ProjectionElem::ConstantIndex { .. } => {
 548                 // consider verifying in-bounds
 549                 PlaceTy::Ty {
 550                     ty: base_ty.builtin_index().unwrap_or_else(|| {
 551                         span_mirbug_and_err!(self, place, "index of non-array {:?}", base_ty)
 552                     }),
 553                 }
 554             }
 555             ProjectionElem::Subslice { from, to } => PlaceTy::Ty {
 556                 ty: match base_ty.sty {
 557                     ty::Array(inner, size) => {
 558                         let size = size.unwrap_usize(tcx);
 559                         let min_size = (from as u64) + (to as u64);
 560                         if let Some(rest_size) = size.checked_sub(min_size) {
 561                             tcx.mk_array(inner, rest_size)
 562                         } else {
 563                             span_mirbug_and_err!(
 564                                 self,
 565                                 place,
 566                                 "taking too-small slice of {:?}",
 567                                 base_ty
 568                             )
 569                         }
 570                     }
 571                     ty::Slice(..) => base_ty,
 572                     _ => span_mirbug_and_err!(self, place, "slice of non-array {:?}", base_ty),
 573                 },
 574             },
 575             ProjectionElem::Downcast(adt_def1, index) => match base_ty.sty {
 576                 ty::Adt(adt_def, substs) if adt_def.is_enum() && adt_def == adt_def1 => {
 577                     if index >= adt_def.variants.len() {
 578                         PlaceTy::Ty {
 579                             ty: span_mirbug_and_err!(
 580                                 self,
 581                                 place,
 582                                 "cast to variant #{:?} but enum only has {:?}",
 583                                 index,
 584                                 adt_def.variants.len()
 585                             ),
 586                         }
 587                     } else {
 588                         PlaceTy::Downcast {
 589                             adt_def,
 590                             substs,
 591                             variant_index: index,
 592                         }
 593                     }
 594                 }
 595                 _ => PlaceTy::Ty {
 596                     ty: span_mirbug_and_err!(
 597                         self,
 598                         place,
 599                         "can't downcast {:?} as {:?}",
 600                         base_ty,
 601                         adt_def1
 602                     ),
 603                 },
 604             },
 605             ProjectionElem::Field(field, fty) => {
 606                 let fty = self.sanitize_type(place, fty);
 607                 match self.field_ty(place, base, field, location) {
 608                     Ok(ty) => if let Err(terr) = self.cx.eq_types(
 609                         ty,
 610                         fty,
 611                         location.to_locations(),
 612                         ConstraintCategory::Boring,
 613                     ) {
 614                         span_mirbug!(
 615                             self,
 616                             place,
 617                             "bad field access ({:?}: {:?}): {:?}",
 618                             ty,
 619                             fty,
 620                             terr
 621                         );
 622                     },
 623                     Err(FieldAccessError::OutOfRange { field_count }) => span_mirbug!(
 624                         self,
 625                         place,
 626                         "accessed field #{} but variant only has {}",
 627                         field.index(),
 628                         field_count
 629                     ),
 630                 }
 631                 PlaceTy::Ty { ty: fty }
 632             }
 633         }
 634     }
 635
 636     fn error(&mut self) -> Ty<'tcx> {
 637         self.errors_reported = true;
 638         self.tcx().types.err
 639     }
 640
 641     fn field_ty(
 642         &mut self,
 643         parent: &dyn fmt::Debug,
 644         base_ty: PlaceTy<'tcx>,
 645         field: Field,
 646         location: Location,
 647     ) -> Result<Ty<'tcx>, FieldAccessError> {
 648         let tcx = self.tcx();
 649
 650         let (variant, substs) = match base_ty {
 651             PlaceTy::Downcast {
 652                 adt_def,
 653                 substs,
 654                 variant_index,
 655             } => (&adt_def.variants[variant_index], substs),
 656             PlaceTy::Ty { ty } => match ty.sty {
 657                 ty::Adt(adt_def, substs) if !adt_def.is_enum() => (&adt_def.variants[0], substs),
 658                 ty::Closure(def_id, substs) => {
 659                     return match substs.upvar_tys(def_id, tcx).nth(field.index()) {
 660                         Some(ty) => Ok(ty),
 661                         None => Err(FieldAccessError::OutOfRange {
 662                             field_count: substs.upvar_tys(def_id, tcx).count(),
 663                         }),
 664                     }
 665                 }
 666                 ty::Generator(def_id, substs, _) => {
 667                     // Try pre-transform fields first (upvars and current state)
 668                     if let Some(ty) = substs.pre_transforms_tys(def_id, tcx).nth(field.index()) {
 669                         return Ok(ty);
 670                     }
 671
 672                     // Then try `field_tys` which contains all the fields, but it
 673                     // requires the final optimized MIR.
 674                     return match substs.field_tys(def_id, tcx).nth(field.index()) {
 675                         Some(ty) => Ok(ty),
 676                         None => Err(FieldAccessError::OutOfRange {
 677                             field_count: substs.field_tys(def_id, tcx).count(),
 678                         }),
 679                     };
 680                 }
 681                 ty::Tuple(tys) => {
 682                     return match tys.get(field.index()) {
 683                         Some(&ty) => Ok(ty),
 684                         None => Err(FieldAccessError::OutOfRange {
 685                             field_count: tys.len(),
 686                         }),
 687                     }
 688                 }
 689                 _ => {
 690                     return Ok(span_mirbug_and_err!(
 691                         self,
 692                         parent,
 693                         "can't project out of {:?}",
 694                         base_ty
 695                     ))
 696                 }
 697             },
 698         };
 699
 700         if let Some(field) = variant.fields.get(field.index()) {
 701             Ok(self.cx.normalize(&field.ty(tcx, substs), location))
 702         } else {
 703             Err(FieldAccessError::OutOfRange {
 704                 field_count: variant.fields.len(),
 705             })
 706         }
 707     }
 708 }
 709
 710 /// The MIR type checker. Visits the MIR and enforces all the
 711 /// constraints needed for it to be valid and well-typed. Along the
 712 /// way, it accrues region constraints -- these can later be used by
 713 /// NLL region checking.
 714 struct TypeChecker<'a, 'gcx: 'tcx, 'tcx: 'a> {
 715     infcx: &'a InferCtxt<'a, 'gcx, 'tcx>,
 716     param_env: ty::ParamEnv<'gcx>,
 717     last_span: Span,
 718     mir: &'a Mir<'tcx>,
 719     mir_def_id: DefId,
 720     region_bound_pairs: &'a RegionBoundPairs<'tcx>,
 721     implicit_region_bound: Option<ty::Region<'tcx>>,
 722     reported_errors: FxHashSet<(Ty<'tcx>, Span)>,
 723     borrowck_context: Option<&'a mut BorrowCheckContext<'a, 'tcx>>,
 724     universal_region_relations: Option<&'a UniversalRegionRelations<'tcx>>,
 725 }
 726
 727 struct BorrowCheckContext<'a, 'tcx: 'a> {
 728     universal_regions: &'a UniversalRegions<'tcx>,
 729     location_table: &'a LocationTable,
 730     all_facts: &'a mut Option<AllFacts>,
 731     borrow_set: &'a BorrowSet<'tcx>,
 732     constraints: &'a mut MirTypeckRegionConstraints<'tcx>,
 733 }
 734
 735 crate struct MirTypeckResults<'tcx> {
 736     crate constraints: MirTypeckRegionConstraints<'tcx>,
 737     crate universal_region_relations: Rc<UniversalRegionRelations<'tcx>>,
 738 }
 739
 740 /// A collection of region constraints that must be satisfied for the
 741 /// program to be considered well-typed.
 742 crate struct MirTypeckRegionConstraints<'tcx> {
 743     /// Maps from a `ty::Placeholder` to the corresponding
 744     /// `PlaceholderIndex` bit that we will use for it.
 745     ///
 746     /// To keep everything in sync, do not insert this set
 747     /// directly. Instead, use the `placeholder_region` helper.
 748     crate placeholder_indices: PlaceholderIndices,
 749
 750     /// Each time we add a placeholder to `placeholder_indices`, we
 751     /// also create a corresponding "representative" region vid for
 752     /// that wraps it. This vector tracks those. This way, when we
 753     /// convert the same `ty::RePlaceholder(p)` twice, we can map to
 754     /// the same underlying `RegionVid`.
 755     crate placeholder_index_to_region: IndexVec<PlaceholderIndex, ty::Region<'tcx>>,
 756
 757     /// In general, the type-checker is not responsible for enforcing
 758     /// liveness constraints; this job falls to the region inferencer,
 759     /// which performs a liveness analysis. However, in some limited
 760     /// cases, the MIR type-checker creates temporary regions that do
 761     /// not otherwise appear in the MIR -- in particular, the
 762     /// late-bound regions that it instantiates at call-sites -- and
 763     /// hence it must report on their liveness constraints.
 764     crate liveness_constraints: LivenessValues<RegionVid>,
 765
 766     crate outlives_constraints: ConstraintSet,
 767
 768     crate closure_bounds_mapping:
 769         FxHashMap<Location, FxHashMap<(RegionVid, RegionVid), (ConstraintCategory, Span)>>,
 770
 771     crate type_tests: Vec<TypeTest<'tcx>>,
 772 }
 773
 774 impl MirTypeckRegionConstraints<'tcx> {
 775     fn placeholder_region(
 776         &mut self,
 777         infcx: &InferCtxt<'_, '_, 'tcx>,
 778         placeholder: ty::Placeholder,
 779     ) -> ty::Region<'tcx> {
 780         let placeholder_index = self.placeholder_indices.insert(placeholder);
 781         match self.placeholder_index_to_region.get(placeholder_index) {
 782             Some(&v) => v,
 783             None => {
 784                 let origin = NLLRegionVariableOrigin::Placeholder(placeholder);
 785                 let region = infcx.next_nll_region_var_in_universe(origin, placeholder.universe);
 786                 self.placeholder_index_to_region.push(region);
 787                 region
 788             }
 789         }
 790     }
 791 }
 792
 793 /// The `Locations` type summarizes *where* region constraints are
 794 /// required to hold. Normally, this is at a particular point which
 795 /// created the obligation, but for constraints that the user gave, we
 796 /// want the constraint to hold at all points.
 797 #[derive(Copy, Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
 798 pub enum Locations {
 799     /// Indicates that a type constraint should always be true. This
 800     /// is particularly important in the new borrowck analysis for
 801     /// things like the type of the return slot. Consider this
 802     /// example:
 803     ///
 804     /// ```
 805     /// fn foo<'a>(x: &'a u32) -> &'a u32 {
 806     ///     let y = 22;
 807     ///     return &y; // error
 808     /// }
 809     /// ```
 810     ///
 811     /// Here, we wind up with the signature from the return type being
 812     /// something like `&'1 u32` where `'1` is a universal region. But
 813     /// the type of the return slot `_0` is something like `&'2 u32`
 814     /// where `'2` is an existential region variable. The type checker
 815     /// requires that `&'2 u32 = &'1 u32` -- but at what point? In the
 816     /// older NLL analysis, we required this only at the entry point
 817     /// to the function. By the nature of the constraints, this wound
 818     /// up propagating to all points reachable from start (because
 819     /// `'1` -- as a universal region -- is live everywhere).  In the
 820     /// newer analysis, though, this doesn't work: `_0` is considered
 821     /// dead at the start (it has no usable value) and hence this type
 822     /// equality is basically a no-op. Then, later on, when we do `_0
 823     /// = &'3 y`, that region `'3` never winds up related to the
 824     /// universal region `'1` and hence no error occurs. Therefore, we
 825     /// use Locations::All instead, which ensures that the `'1` and
 826     /// `'2` are equal everything. We also use this for other
 827     /// user-given type annotations; e.g., if the user wrote `let mut
 828     /// x: &'static u32 = ...`, we would ensure that all values
 829     /// assigned to `x` are of `'static` lifetime.
 830     ///
 831     /// The span points to the place the constraint arose. For example,
 832     /// it points to the type in a user-given type annotation. If
 833     /// there's no sensible span then it's DUMMY_SP.
 834     All(Span),
 835
 836     /// An outlives constraint that only has to hold at a single location,
 837     /// usually it represents a point where references flow from one spot to
 838     /// another (e.g., `x = y`)
 839     Single(Location),
 840 }
 841
 842 impl Locations {
 843     pub fn from_location(&self) -> Option<Location> {
 844         match self {
 845             Locations::All(_) => None,
 846             Locations::Single(from_location) => Some(*from_location),
 847         }
 848     }
 849
 850     /// Gets a span representing the location.
 851     pub fn span(&self, mir: &Mir<'_>) -> Span {
 852         match self {
 853             Locations::All(span) => *span,
 854             Locations::Single(l) => mir.source_info(*l).span,
 855         }
 856     }
 857 }
 858
 859 impl<'a, 'gcx, 'tcx> TypeChecker<'a, 'gcx, 'tcx> {
 860     fn new(
 861         infcx: &'a InferCtxt<'a, 'gcx, 'tcx>,
 862         mir: &'a Mir<'tcx>,
 863         mir_def_id: DefId,
 864         param_env: ty::ParamEnv<'gcx>,
 865         region_bound_pairs: &'a RegionBoundPairs<'tcx>,
 866         implicit_region_bound: Option<ty::Region<'tcx>>,
 867         borrowck_context: Option<&'a mut BorrowCheckContext<'a, 'tcx>>,
 868         universal_region_relations: Option<&'a UniversalRegionRelations<'tcx>>,
 869     ) -> Self {
 870         TypeChecker {
 871             infcx,
 872             last_span: DUMMY_SP,
 873             mir,
 874             mir_def_id,
 875             param_env,
 876             region_bound_pairs,
 877             implicit_region_bound,
 878             borrowck_context,
 879             reported_errors: Default::default(),
 880             universal_region_relations,
 881         }
 882     }
 883
 884     /// Given some operation `op` that manipulates types, proves
 885     /// predicates, or otherwise uses the inference context, executes
 886     /// `op` and then executes all the further obligations that `op`
 887     /// returns. This will yield a set of outlives constraints amongst
 888     /// regions which are extracted and stored as having occurred at
 889     /// `locations`.
 890     ///
 891     /// **Any `rustc::infer` operations that might generate region
 892     /// constraints should occur within this method so that those
 893     /// constraints can be properly localized!**
 894     fn fully_perform_op<R>(
 895         &mut self,
 896         locations: Locations,
 897         category: ConstraintCategory,
 898         op: impl type_op::TypeOp<'gcx, 'tcx, Output = R>,
 899     ) -> Fallible<R> {
 900         let (r, opt_data) = op.fully_perform(self.infcx)?;
 901
 902         if let Some(data) = &opt_data {
 903             self.push_region_constraints(locations, category, data);
 904         }
 905
 906         Ok(r)
 907     }
 908
 909     fn push_region_constraints(
 910         &mut self,
 911         locations: Locations,
 912         category: ConstraintCategory,
 913         data: &[QueryRegionConstraint<'tcx>],
 914     ) {
 915         debug!(
 916             "push_region_constraints: constraints generated at {:?} are {:#?}",
 917             locations, data
 918         );
 919
 920         if let Some(ref mut borrowck_context) = self.borrowck_context {
 921             constraint_conversion::ConstraintConversion::new(
 922                 self.infcx,
 923                 borrowck_context.universal_regions,
 924                 self.region_bound_pairs,
 925                 self.implicit_region_bound,
 926                 self.param_env,
 927                 locations,
 928                 category,
 929                 &mut borrowck_context.constraints,
 930             ).convert_all(&data);
 931         }
 932     }
 933
 934     /// Convenient wrapper around `relate_tys::relate_types` -- see
 935     /// that fn for docs.
 936     fn relate_types(
 937         &mut self,
 938         a: Ty<'tcx>,
 939         v: ty::Variance,
 940         b: Ty<'tcx>,
 941         locations: Locations,
 942         category: ConstraintCategory,
 943     ) -> Fallible<()> {
 944         relate_tys::relate_types(
 945             self.infcx,
 946             a,
 947             v,
 948             b,
 949             locations,
 950             category,
 951             self.borrowck_context.as_mut().map(|x| &mut **x),
 952         )
 953     }
 954
 955     fn sub_types(
 956         &mut self,
 957         sub: Ty<'tcx>,
 958         sup: Ty<'tcx>,
 959         locations: Locations,
 960         category: ConstraintCategory,
 961     ) -> Fallible<()> {
 962         self.relate_types(sub, ty::Variance::Covariant, sup, locations, category)
 963     }
 964
 965     /// Try to relate `sub <: sup`; if this fails, instantiate opaque
 966     /// variables in `sub` with their inferred definitions and try
 967     /// again. This is used for opaque types in places (e.g., `let x:
 968     /// impl Foo = ..`).
 969     fn sub_types_or_anon(
 970         &mut self,
 971         sub: Ty<'tcx>,
 972         sup: Ty<'tcx>,
 973         locations: Locations,
 974         category: ConstraintCategory,
 975     ) -> Fallible<()> {
 976         if let Err(terr) = self.sub_types(sub, sup, locations, category) {
 977             if let TyKind::Opaque(..) = sup.sty {
 978                 // When you have `let x: impl Foo = ...` in a closure,
 979                 // the resulting inferend values are stored with the
 980                 // def-id of the base function.
 981                 let parent_def_id = self.tcx().closure_base_def_id(self.mir_def_id);
 982                 return self.eq_opaque_type_and_type(sub, sup, parent_def_id, locations, category);
 983             } else {
 984                 return Err(terr);
 985             }
 986         }
 987         Ok(())
 988     }
 989
 990     fn eq_types(
 991         &mut self,
 992         a: Ty<'tcx>,
 993         b: Ty<'tcx>,
 994         locations: Locations,
 995         category: ConstraintCategory,
 996     ) -> Fallible<()> {
 997         self.relate_types(a, ty::Variance::Invariant, b, locations, category)
 998     }
 999
1000     fn relate_type_and_user_type(
1001         &mut self,
1002         a: Ty<'tcx>,
1003         v: ty::Variance,
1004         user_ty: &UserTypeProjection<'tcx>,
1005         locations: Locations,
1006         category: ConstraintCategory,
1007     ) -> Fallible<()> {
1008         debug!(
1009             "relate_type_and_user_type(a={:?}, v={:?}, user_ty={:?}, locations={:?})",
1010             a, v, user_ty, locations,
1011         );
1012
1013         match user_ty.base {
1014             UserTypeAnnotation::Ty(canonical_ty) => {
1015                 let (ty, _) = self.infcx
1016                     .instantiate_canonical_with_fresh_inference_vars(DUMMY_SP, &canonical_ty);
1017
1018                 // The `TypeRelating` code assumes that "unresolved inference
1019                 // variables" appear in the "a" side, so flip `Contravariant`
1020                 // ambient variance to get the right relationship.
1021                 let v1 = ty::Contravariant.xform(v);
1022
1023                 let tcx = self.infcx.tcx;
1024                 let mut projected_ty = PlaceTy::from_ty(ty);
1025                 for proj in &user_ty.projs {
1026                     projected_ty = projected_ty.projection_ty_core(
1027                         tcx, proj, |this, field, &()| {
1028                             let ty = this.field_ty(tcx, field);
1029                             self.normalize(ty, locations)
1030                         });
1031                 }
1032                 debug!("user_ty base: {:?} freshened: {:?} projs: {:?} yields: {:?}",
1033                        user_ty.base, ty, user_ty.projs, projected_ty);
1034
1035                 let ty = projected_ty.to_ty(tcx);
1036
1037                 self.relate_types(ty, v1, a, locations, category)?;
1038             }
1039             UserTypeAnnotation::TypeOf(def_id, canonical_substs) => {
1040                 let (
1041                     user_substs,
1042                     _,
1043                 ) = self.infcx
1044                     .instantiate_canonical_with_fresh_inference_vars(DUMMY_SP, &canonical_substs);
1045
1046                 let projs = self.infcx.tcx.intern_projs(&user_ty.projs);
1047                 self.fully_perform_op(
1048                     locations,
1049                     category,
1050                     self.param_env.and(type_op::ascribe_user_type::AscribeUserType::new(
1051                         a, v, def_id, user_substs, projs,
1052                     )),
1053                 )?;
1054             }
1055         }
1056
1057         Ok(())
1058     }
1059
1060     fn eq_opaque_type_and_type(
1061         &mut self,
1062         revealed_ty: Ty<'tcx>,
1063         anon_ty: Ty<'tcx>,
1064         anon_owner_def_id: DefId,
1065         locations: Locations,
1066         category: ConstraintCategory,
1067     ) -> Fallible<()> {
1068         debug!(
1069             "eq_opaque_type_and_type( \
1070              revealed_ty={:?}, \
1071              anon_ty={:?})",
1072             revealed_ty, anon_ty
1073         );
1074         let infcx = self.infcx;
1075         let tcx = infcx.tcx;
1076         let param_env = self.param_env;
1077         debug!("eq_opaque_type_and_type: mir_def_id={:?}", self.mir_def_id);
1078         let opaque_type_map = self.fully_perform_op(
1079             locations,
1080             category,
1081             CustomTypeOp::new(
1082                 |infcx| {
1083                     let mut obligations = ObligationAccumulator::default();
1084
1085                     let dummy_body_id = ObligationCause::dummy().body_id;
1086                     let (output_ty, opaque_type_map) =
1087                         obligations.add(infcx.instantiate_opaque_types(
1088                             anon_owner_def_id,
1089                             dummy_body_id,
1090                             param_env,
1091                             &anon_ty,
1092                         ));
1093                     debug!(
1094                         "eq_opaque_type_and_type: \
1095                          instantiated output_ty={:?} \
1096                          opaque_type_map={:#?} \
1097                          revealed_ty={:?}",
1098                         output_ty, opaque_type_map, revealed_ty
1099                     );
1100                     obligations.add(infcx
1101                         .at(&ObligationCause::dummy(), param_env)
1102                         .eq(output_ty, revealed_ty)?);
1103
1104                     for (&opaque_def_id, opaque_decl) in &opaque_type_map {
1105                         let opaque_defn_ty = tcx.type_of(opaque_def_id);
1106                         let opaque_defn_ty = opaque_defn_ty.subst(tcx, opaque_decl.substs);
1107                         let opaque_defn_ty = renumber::renumber_regions(infcx, &opaque_defn_ty);
1108                         debug!(
1109                             "eq_opaque_type_and_type: concrete_ty={:?}={:?} opaque_defn_ty={:?}",
1110                             opaque_decl.concrete_ty,
1111                             infcx.resolve_type_vars_if_possible(&opaque_decl.concrete_ty),
1112                             opaque_defn_ty
1113                         );
1114                         obligations.add(infcx
1115                             .at(&ObligationCause::dummy(), param_env)
1116                             .eq(opaque_decl.concrete_ty, opaque_defn_ty)?);
1117                     }
1118
1119                     debug!("eq_opaque_type_and_type: equated");
1120
1121                     Ok(InferOk {
1122                         value: Some(opaque_type_map),
1123                         obligations: obligations.into_vec(),
1124                     })
1125                 },
1126                 || "input_output".to_string(),
1127             ),
1128         )?;
1129
1130         let universal_region_relations = match self.universal_region_relations {
1131             Some(rel) => rel,
1132             None => return Ok(()),
1133         };
1134
1135         // Finally, if we instantiated the anon types successfully, we
1136         // have to solve any bounds (e.g., `-> impl Iterator` needs to
1137         // prove that `T: Iterator` where `T` is the type we
1138         // instantiated it with).
1139         if let Some(opaque_type_map) = opaque_type_map {
1140             for (opaque_def_id, opaque_decl) in opaque_type_map {
1141                 self.fully_perform_op(
1142                     locations,
1143                     ConstraintCategory::OpaqueType,
1144                     CustomTypeOp::new(
1145                         |_cx| {
1146                             infcx.constrain_opaque_type(
1147                                 opaque_def_id,
1148                                 &opaque_decl,
1149                                 universal_region_relations,
1150                             );
1151                             Ok(InferOk {
1152                                 value: (),
1153                                 obligations: vec![],
1154                             })
1155                         },
1156                         || "opaque_type_map".to_string(),
1157                     ),
1158                 )?;
1159             }
1160         }
1161         Ok(())
1162     }
1163
1164     fn tcx(&self) -> TyCtxt<'a, 'gcx, 'tcx> {
1165         self.infcx.tcx
1166     }
1167
1168     fn check_stmt(&mut self, mir: &Mir<'tcx>, stmt: &Statement<'tcx>, location: Location) {
1169         debug!("check_stmt: {:?}", stmt);
1170         let tcx = self.tcx();
1171         match stmt.kind {
1172             StatementKind::Assign(ref place, ref rv) => {
1173                 // Assignments to temporaries are not "interesting";
1174                 // they are not caused by the user, but rather artifacts
1175                 // of lowering. Assignments to other sorts of places *are* interesting
1176                 // though.
1177                 let category = match *place {
1178                     Place::Local(RETURN_PLACE) => if let Some(BorrowCheckContext {
1179                         universal_regions:
1180                             UniversalRegions {
1181                                 defining_ty: DefiningTy::Const(def_id, _),
1182                                 ..
1183                             },
1184                         ..
1185                     }) = self.borrowck_context
1186                     {
1187                         if tcx.is_static(*def_id).is_some() {
1188                             ConstraintCategory::UseAsStatic
1189                         } else {
1190                             ConstraintCategory::UseAsConst
1191                         }
1192                     } else {
1193                         ConstraintCategory::Return
1194                     },
1195                     Place::Local(l) if !mir.local_decls[l].is_user_variable.is_some() => {
1196                         ConstraintCategory::Boring
1197                     }
1198                     _ => ConstraintCategory::Assignment,
1199                 };
1200
1201                 let place_ty = place.ty(mir, tcx).to_ty(tcx);
1202                 let rv_ty = rv.ty(mir, tcx);
1203                 if let Err(terr) =
1204                     self.sub_types_or_anon(rv_ty, place_ty, location.to_locations(), category)
1205                 {
1206                     span_mirbug!(
1207                         self,
1208                         stmt,
1209                         "bad assignment ({:?} = {:?}): {:?}",
1210                         place_ty,
1211                         rv_ty,
1212                         terr
1213                     );
1214                 }
1215
1216                 if let Some(user_ty) = self.rvalue_user_ty(rv) {
1217                     if let Err(terr) = self.relate_type_and_user_type(
1218                         rv_ty,
1219                         ty::Variance::Invariant,
1220                         &UserTypeProjection { base: user_ty, projs: vec![], },
1221                         location.to_locations(),
1222                         ConstraintCategory::Boring,
1223                     ) {
1224                         span_mirbug!(
1225                             self,
1226                             stmt,
1227                             "bad user type on rvalue ({:?} = {:?}): {:?}",
1228                             user_ty,
1229                             rv_ty,
1230                             terr
1231                         );
1232                     }
1233                 }
1234
1235                 self.check_rvalue(mir, rv, location);
1236                 if !self.tcx().features().unsized_locals {
1237                     let trait_ref = ty::TraitRef {
1238                         def_id: tcx.lang_items().sized_trait().unwrap(),
1239                         substs: tcx.mk_substs_trait(place_ty, &[]),
1240                     };
1241                     self.prove_trait_ref(
1242                         trait_ref,
1243                         location.to_locations(),
1244                         ConstraintCategory::SizedBound,
1245                     );
1246                 }
1247             }
1248             StatementKind::SetDiscriminant {
1249                 ref place,
1250                 variant_index,
1251             } => {
1252                 let place_type = place.ty(mir, tcx).to_ty(tcx);
1253                 let adt = match place_type.sty {
1254                     TyKind::Adt(adt, _) if adt.is_enum() => adt,
1255                     _ => {
1256                         span_bug!(
1257                             stmt.source_info.span,
1258                             "bad set discriminant ({:?} = {:?}): lhs is not an enum",
1259                             place,
1260                             variant_index
1261                         );
1262                     }
1263                 };
1264                 if variant_index >= adt.variants.len() {
1265                     span_bug!(
1266                         stmt.source_info.span,
1267                         "bad set discriminant ({:?} = {:?}): value of of range",
1268                         place,
1269                         variant_index
1270                     );
1271                 };
1272             }
1273             StatementKind::AscribeUserType(ref place, variance, box ref c_ty) => {
1274                 let place_ty = place.ty(mir, tcx).to_ty(tcx);
1275                 if let Err(terr) = self.relate_type_and_user_type(
1276                     place_ty,
1277                     variance,
1278                     c_ty,
1279                     Locations::All(stmt.source_info.span),
1280                     ConstraintCategory::TypeAnnotation,
1281                 ) {
1282                     span_mirbug!(
1283                         self,
1284                         stmt,
1285                         "bad type assert ({:?} <: {:?}): {:?}",
1286                         place_ty,
1287                         c_ty,
1288                         terr
1289                     );
1290                 }
1291             }
1292             StatementKind::FakeRead(..)
1293             | StatementKind::StorageLive(_)
1294             | StatementKind::StorageDead(_)
1295             | StatementKind::InlineAsm { .. }
1296             | StatementKind::EndRegion(_)
1297             | StatementKind::Retag { .. }
1298             | StatementKind::Nop => {}
1299         }
1300     }
1301
1302     fn check_terminator(
1303         &mut self,
1304         mir: &Mir<'tcx>,
1305         term: &Terminator<'tcx>,
1306         term_location: Location,
1307     ) {
1308         debug!("check_terminator: {:?}", term);
1309         let tcx = self.tcx();
1310         match term.kind {
1311             TerminatorKind::Goto { .. }
1312             | TerminatorKind::Resume
1313             | TerminatorKind::Abort
1314             | TerminatorKind::Return
1315             | TerminatorKind::GeneratorDrop
1316             | TerminatorKind::Unreachable
1317             | TerminatorKind::Drop { .. }
1318             | TerminatorKind::FalseEdges { .. }
1319             | TerminatorKind::FalseUnwind { .. } => {
1320                 // no checks needed for these
1321             }
1322
1323             TerminatorKind::DropAndReplace {
1324                 ref location,
1325                 ref value,
1326                 target: _,
1327                 unwind: _,
1328             } => {
1329                 let place_ty = location.ty(mir, tcx).to_ty(tcx);
1330                 let rv_ty = value.ty(mir, tcx);
1331
1332                 let locations = term_location.to_locations();
1333                 if let Err(terr) =
1334                     self.sub_types(rv_ty, place_ty, locations, ConstraintCategory::Assignment)
1335                 {
1336                     span_mirbug!(
1337                         self,
1338                         term,
1339                         "bad DropAndReplace ({:?} = {:?}): {:?}",
1340                         place_ty,
1341                         rv_ty,
1342                         terr
1343                     );
1344                 }
1345             }
1346             TerminatorKind::SwitchInt {
1347                 ref discr,
1348                 switch_ty,
1349                 ..
1350             } => {
1351                 let discr_ty = discr.ty(mir, tcx);
1352                 if let Err(terr) = self.sub_types(
1353                     discr_ty,
1354                     switch_ty,
1355                     term_location.to_locations(),
1356                     ConstraintCategory::Assignment,
1357                 ) {
1358                     span_mirbug!(
1359                         self,
1360                         term,
1361                         "bad SwitchInt ({:?} on {:?}): {:?}",
1362                         switch_ty,
1363                         discr_ty,
1364                         terr
1365                     );
1366                 }
1367                 if !switch_ty.is_integral() && !switch_ty.is_char() && !switch_ty.is_bool() {
1368                     span_mirbug!(self, term, "bad SwitchInt discr ty {:?}", switch_ty);
1369                 }
1370                 // FIXME: check the values
1371             }
1372             TerminatorKind::Call {
1373                 ref func,
1374                 ref args,
1375                 ref destination,
1376                 from_hir_call,
1377                 ..
1378             } => {
1379                 let func_ty = func.ty(mir, tcx);
1380                 debug!("check_terminator: call, func_ty={:?}", func_ty);
1381                 let sig = match func_ty.sty {
1382                     ty::FnDef(..) | ty::FnPtr(_) => func_ty.fn_sig(tcx),
1383                     _ => {
1384                         span_mirbug!(self, term, "call to non-function {:?}", func_ty);
1385                         return;
1386                     }
1387                 };
1388                 let (sig, map) = self.infcx.replace_late_bound_regions_with_fresh_var(
1389                     term.source_info.span,
1390                     LateBoundRegionConversionTime::FnCall,
1391                     &sig,
1392                 );
1393                 let sig = self.normalize(sig, term_location);
1394                 self.check_call_dest(mir, term, &sig, destination, term_location);
1395
1396                 self.prove_predicates(
1397                     sig.inputs().iter().map(|ty| ty::Predicate::WellFormed(ty)),
1398                     term_location.to_locations(),
1399                     ConstraintCategory::Boring,
1400                 );
1401
1402                 // The ordinary liveness rules will ensure that all
1403                 // regions in the type of the callee are live here. We
1404                 // then further constrain the late-bound regions that
1405                 // were instantiated at the call site to be live as
1406                 // well. The resulting is that all the input (and
1407                 // output) types in the signature must be live, since
1408                 // all the inputs that fed into it were live.
1409                 for &late_bound_region in map.values() {
1410                     if let Some(ref mut borrowck_context) = self.borrowck_context {
1411                         let region_vid = borrowck_context
1412                             .universal_regions
1413                             .to_region_vid(late_bound_region);
1414                         borrowck_context
1415                             .constraints
1416                             .liveness_constraints
1417                             .add_element(region_vid, term_location);
1418                     }
1419                 }
1420
1421                 self.check_call_inputs(mir, term, &sig, args, term_location, from_hir_call);
1422             }
1423             TerminatorKind::Assert {
1424                 ref cond, ref msg, ..
1425             } => {
1426                 let cond_ty = cond.ty(mir, tcx);
1427                 if cond_ty != tcx.types.bool {
1428                     span_mirbug!(self, term, "bad Assert ({:?}, not bool", cond_ty);
1429                 }
1430
1431                 if let BoundsCheck { ref len, ref index } = *msg {
1432                     if len.ty(mir, tcx) != tcx.types.usize {
1433                         span_mirbug!(self, len, "bounds-check length non-usize {:?}", len)
1434                     }
1435                     if index.ty(mir, tcx) != tcx.types.usize {
1436                         span_mirbug!(self, index, "bounds-check index non-usize {:?}", index)
1437                     }
1438                 }
1439             }
1440             TerminatorKind::Yield { ref value, .. } => {
1441                 let value_ty = value.ty(mir, tcx);
1442                 match mir.yield_ty {
1443                     None => span_mirbug!(self, term, "yield in non-generator"),
1444                     Some(ty) => {
1445                         if let Err(terr) = self.sub_types(
1446                             value_ty,
1447                             ty,
1448                             term_location.to_locations(),
1449                             ConstraintCategory::Return,
1450                         ) {
1451                             span_mirbug!(
1452                                 self,
1453                                 term,
1454                                 "type of yield value is {:?}, but the yield type is {:?}: {:?}",
1455                                 value_ty,
1456                                 ty,
1457                                 terr
1458                             );
1459                         }
1460                     }
1461                 }
1462             }
1463         }
1464     }
1465
1466     fn check_call_dest(
1467         &mut self,
1468         mir: &Mir<'tcx>,
1469         term: &Terminator<'tcx>,
1470         sig: &ty::FnSig<'tcx>,
1471         destination: &Option<(Place<'tcx>, BasicBlock)>,
1472         term_location: Location,
1473     ) {
1474         let tcx = self.tcx();
1475         match *destination {
1476             Some((ref dest, _target_block)) => {
1477                 let dest_ty = dest.ty(mir, tcx).to_ty(tcx);
1478                 let category = match *dest {
1479                     Place::Local(RETURN_PLACE) => {
1480                         if let Some(BorrowCheckContext {
1481                             universal_regions:
1482                                 UniversalRegions {
1483                                     defining_ty: DefiningTy::Const(def_id, _),
1484                                     ..
1485                                 },
1486                             ..
1487                         }) = self.borrowck_context
1488                         {
1489                             if tcx.is_static(*def_id).is_some() {
1490                                 ConstraintCategory::UseAsStatic
1491                             } else {
1492                                 ConstraintCategory::UseAsConst
1493                             }
1494                         } else {
1495                             ConstraintCategory::Return
1496                         }
1497                     }
1498                     Place::Local(l) if !mir.local_decls[l].is_user_variable.is_some() => {
1499                         ConstraintCategory::Boring
1500                     }
1501                     _ => ConstraintCategory::Assignment,
1502                 };
1503
1504                 let locations = term_location.to_locations();
1505
1506                 if let Err(terr) =
1507                     self.sub_types_or_anon(sig.output(), dest_ty, locations, category)
1508                 {
1509                     span_mirbug!(
1510                         self,
1511                         term,
1512                         "call dest mismatch ({:?} <- {:?}): {:?}",
1513                         dest_ty,
1514                         sig.output(),
1515                         terr
1516                     );
1517                 }
1518
1519                 // When `#![feature(unsized_locals)]` is not enabled,
1520                 // this check is done at `check_local`.
1521                 if self.tcx().features().unsized_locals {
1522                     let span = term.source_info.span;
1523                     self.ensure_place_sized(dest_ty, span);
1524                 }
1525             }
1526             None => {
1527                 // FIXME(canndrew): This is_never should probably be an is_uninhabited
1528                 if !sig.output().is_never() {
1529                     span_mirbug!(self, term, "call to converging function {:?} w/o dest", sig);
1530                 }
1531             }
1532         }
1533     }
1534
1535     fn check_call_inputs(
1536         &mut self,
1537         mir: &Mir<'tcx>,
1538         term: &Terminator<'tcx>,
1539         sig: &ty::FnSig<'tcx>,
1540         args: &[Operand<'tcx>],
1541         term_location: Location,
1542         from_hir_call: bool,
1543     ) {
1544         debug!("check_call_inputs({:?}, {:?})", sig, args);
1545         if args.len() < sig.inputs().len() || (args.len() > sig.inputs().len() && !sig.variadic) {
1546             span_mirbug!(self, term, "call to {:?} with wrong # of args", sig);
1547         }
1548         for (n, (fn_arg, op_arg)) in sig.inputs().iter().zip(args).enumerate() {
1549             let op_arg_ty = op_arg.ty(mir, self.tcx());
1550             let category = if from_hir_call {
1551                 ConstraintCategory::CallArgument
1552             } else {
1553                 ConstraintCategory::Boring
1554             };
1555             if let Err(terr) =
1556                 self.sub_types(op_arg_ty, fn_arg, term_location.to_locations(), category)
1557             {
1558                 span_mirbug!(
1559                     self,
1560                     term,
1561                     "bad arg #{:?} ({:?} <- {:?}): {:?}",
1562                     n,
1563                     fn_arg,
1564                     op_arg_ty,
1565                     terr
1566                 );
1567             }
1568         }
1569     }
1570
1571     fn check_iscleanup(&mut self, mir: &Mir<'tcx>, block_data: &BasicBlockData<'tcx>) {
1572         let is_cleanup = block_data.is_cleanup;
1573         self.last_span = block_data.terminator().source_info.span;
1574         match block_data.terminator().kind {
1575             TerminatorKind::Goto { target } => {
1576                 self.assert_iscleanup(mir, block_data, target, is_cleanup)
1577             }
1578             TerminatorKind::SwitchInt { ref targets, .. } => for target in targets {
1579                 self.assert_iscleanup(mir, block_data, *target, is_cleanup);
1580             },
1581             TerminatorKind::Resume => if !is_cleanup {
1582                 span_mirbug!(self, block_data, "resume on non-cleanup block!")
1583             },
1584             TerminatorKind::Abort => if !is_cleanup {
1585                 span_mirbug!(self, block_data, "abort on non-cleanup block!")
1586             },
1587             TerminatorKind::Return => if is_cleanup {
1588                 span_mirbug!(self, block_data, "return on cleanup block")
1589             },
1590             TerminatorKind::GeneratorDrop { .. } => if is_cleanup {
1591                 span_mirbug!(self, block_data, "generator_drop in cleanup block")
1592             },
1593             TerminatorKind::Yield { resume, drop, .. } => {
1594                 if is_cleanup {
1595                     span_mirbug!(self, block_data, "yield in cleanup block")
1596                 }
1597                 self.assert_iscleanup(mir, block_data, resume, is_cleanup);
1598                 if let Some(drop) = drop {
1599                     self.assert_iscleanup(mir, block_data, drop, is_cleanup);
1600                 }
1601             }
1602             TerminatorKind::Unreachable => {}
1603             TerminatorKind::Drop { target, unwind, .. }
1604             | TerminatorKind::DropAndReplace { target, unwind, .. }
1605             | TerminatorKind::Assert {
1606                 target,
1607                 cleanup: unwind,
1608                 ..
1609             } => {
1610                 self.assert_iscleanup(mir, block_data, target, is_cleanup);
1611                 if let Some(unwind) = unwind {
1612                     if is_cleanup {
1613                         span_mirbug!(self, block_data, "unwind on cleanup block")
1614                     }
1615                     self.assert_iscleanup(mir, block_data, unwind, true);
1616                 }
1617             }
1618             TerminatorKind::Call {
1619                 ref destination,
1620                 cleanup,
1621                 ..
1622             } => {
1623                 if let &Some((_, target)) = destination {
1624                     self.assert_iscleanup(mir, block_data, target, is_cleanup);
1625                 }
1626                 if let Some(cleanup) = cleanup {
1627                     if is_cleanup {
1628                         span_mirbug!(self, block_data, "cleanup on cleanup block")
1629                     }
1630                     self.assert_iscleanup(mir, block_data, cleanup, true);
1631                 }
1632             }
1633             TerminatorKind::FalseEdges {
1634                 real_target,
1635                 ref imaginary_targets,
1636             } => {
1637                 self.assert_iscleanup(mir, block_data, real_target, is_cleanup);
1638                 for target in imaginary_targets {
1639                     self.assert_iscleanup(mir, block_data, *target, is_cleanup);
1640                 }
1641             }
1642             TerminatorKind::FalseUnwind {
1643                 real_target,
1644                 unwind,
1645             } => {
1646                 self.assert_iscleanup(mir, block_data, real_target, is_cleanup);
1647                 if let Some(unwind) = unwind {
1648                     if is_cleanup {
1649                         span_mirbug!(
1650                             self,
1651                             block_data,
1652                             "cleanup in cleanup block via false unwind"
1653                         );
1654                     }
1655                     self.assert_iscleanup(mir, block_data, unwind, true);
1656                 }
1657             }
1658         }
1659     }
1660
1661     fn assert_iscleanup(
1662         &mut self,
1663         mir: &Mir<'tcx>,
1664         ctxt: &dyn fmt::Debug,
1665         bb: BasicBlock,
1666         iscleanuppad: bool,
1667     ) {
1668         if mir[bb].is_cleanup != iscleanuppad {
1669             span_mirbug!(
1670                 self,
1671                 ctxt,
1672                 "cleanuppad mismatch: {:?} should be {:?}",
1673                 bb,
1674                 iscleanuppad
1675             );
1676         }
1677     }
1678
1679     fn check_local(&mut self, mir: &Mir<'tcx>, local: Local, local_decl: &LocalDecl<'tcx>) {
1680         match mir.local_kind(local) {
1681             LocalKind::ReturnPointer | LocalKind::Arg => {
1682                 // return values of normal functions are required to be
1683                 // sized by typeck, but return values of ADT constructors are
1684                 // not because we don't include a `Self: Sized` bounds on them.
1685                 //
1686                 // Unbound parts of arguments were never required to be Sized
1687                 // - maybe we should make that a warning.
1688                 return;
1689             }
1690             LocalKind::Var | LocalKind::Temp => {}
1691         }
1692
1693         // When `#![feature(unsized_locals)]` is enabled, only function calls
1694         // and nullary ops are checked in `check_call_dest`.
1695         if !self.tcx().features().unsized_locals {
1696             let span = local_decl.source_info.span;
1697             let ty = local_decl.ty;
1698             self.ensure_place_sized(ty, span);
1699         }
1700     }
1701
1702     fn ensure_place_sized(&mut self, ty: Ty<'tcx>, span: Span) {
1703         let tcx = self.tcx();
1704
1705         // Erase the regions from `ty` to get a global type.  The
1706         // `Sized` bound in no way depends on precise regions, so this
1707         // shouldn't affect `is_sized`.
1708         let gcx = tcx.global_tcx();
1709         let erased_ty = gcx.lift(&tcx.erase_regions(&ty)).unwrap();
1710         if !erased_ty.is_sized(gcx.at(span), self.param_env) {
1711             // in current MIR construction, all non-control-flow rvalue
1712             // expressions evaluate through `as_temp` or `into` a return
1713             // slot or local, so to find all unsized rvalues it is enough
1714             // to check all temps, return slots and locals.
1715             if let None = self.reported_errors.replace((ty, span)) {
1716                 let mut diag = struct_span_err!(
1717                     self.tcx().sess,
1718                     span,
1719                     E0161,
1720                     "cannot move a value of type {0}: the size of {0} \
1721                      cannot be statically determined",
1722                     ty
1723                 );
1724
1725                 // While this is located in `nll::typeck` this error is not
1726                 // an NLL error, it's a required check to prevent creation
1727                 // of unsized rvalues in certain cases:
1728                 // * operand of a box expression
1729                 // * callee in a call expression
1730                 diag.emit();
1731             }
1732         }
1733     }
1734
1735     fn aggregate_field_ty(
1736         &mut self,
1737         ak: &AggregateKind<'tcx>,
1738         field_index: usize,
1739         location: Location,
1740     ) -> Result<Ty<'tcx>, FieldAccessError> {
1741         let tcx = self.tcx();
1742
1743         match *ak {
1744             AggregateKind::Adt(def, variant_index, substs, _, active_field_index) => {
1745                 let variant = &def.variants[variant_index];
1746                 let adj_field_index = active_field_index.unwrap_or(field_index);
1747                 if let Some(field) = variant.fields.get(adj_field_index) {
1748                     Ok(self.normalize(field.ty(tcx, substs), location))
1749                 } else {
1750                     Err(FieldAccessError::OutOfRange {
1751                         field_count: variant.fields.len(),
1752                     })
1753                 }
1754             }
1755             AggregateKind::Closure(def_id, substs) => {
1756                 match substs.upvar_tys(def_id, tcx).nth(field_index) {
1757                     Some(ty) => Ok(ty),
1758                     None => Err(FieldAccessError::OutOfRange {
1759                         field_count: substs.upvar_tys(def_id, tcx).count(),
1760                     }),
1761                 }
1762             }
1763             AggregateKind::Generator(def_id, substs, _) => {
1764                 // Try pre-transform fields first (upvars and current state)
1765                 if let Some(ty) = substs.pre_transforms_tys(def_id, tcx).nth(field_index) {
1766                     Ok(ty)
1767                 } else {
1768                     // Then try `field_tys` which contains all the fields, but it
1769                     // requires the final optimized MIR.
1770                     match substs.field_tys(def_id, tcx).nth(field_index) {
1771                         Some(ty) => Ok(ty),
1772                         None => Err(FieldAccessError::OutOfRange {
1773                             field_count: substs.field_tys(def_id, tcx).count(),
1774                         }),
1775                     }
1776                 }
1777             }
1778             AggregateKind::Array(ty) => Ok(ty),
1779             AggregateKind::Tuple => {
1780                 unreachable!("This should have been covered in check_rvalues");
1781             }
1782         }
1783     }
1784
1785     fn check_rvalue(&mut self, mir: &Mir<'tcx>, rvalue: &Rvalue<'tcx>, location: Location) {
1786         let tcx = self.tcx();
1787
1788         match rvalue {
1789             Rvalue::Aggregate(ak, ops) => {
1790                 self.check_aggregate_rvalue(mir, rvalue, ak, ops, location)
1791             }
1792
1793             Rvalue::Repeat(operand, len) => if *len > 1 {
1794                 let operand_ty = operand.ty(mir, tcx);
1795
1796                 let trait_ref = ty::TraitRef {
1797                     def_id: tcx.lang_items().copy_trait().unwrap(),
1798                     substs: tcx.mk_substs_trait(operand_ty, &[]),
1799                 };
1800
1801                 self.prove_trait_ref(
1802                     trait_ref,
1803                     location.to_locations(),
1804                     ConstraintCategory::CopyBound,
1805                 );
1806             },
1807
1808             Rvalue::NullaryOp(_, ty) => {
1809                 // Even with unsized locals cannot box an unsized value.
1810                 if self.tcx().features().unsized_locals {
1811                     let span = mir.source_info(location).span;
1812                     self.ensure_place_sized(ty, span);
1813                 }
1814
1815                 let trait_ref = ty::TraitRef {
1816                     def_id: tcx.lang_items().sized_trait().unwrap(),
1817                     substs: tcx.mk_substs_trait(ty, &[]),
1818                 };
1819
1820                 self.prove_trait_ref(
1821                     trait_ref,
1822                     location.to_locations(),
1823                     ConstraintCategory::SizedBound,
1824                 );
1825             }
1826
1827             Rvalue::Cast(cast_kind, op, ty) => {
1828                 match cast_kind {
1829                     CastKind::ReifyFnPointer => {
1830                         let fn_sig = op.ty(mir, tcx).fn_sig(tcx);
1831
1832                         // The type that we see in the fcx is like
1833                         // `foo::<'a, 'b>`, where `foo` is the path to a
1834                         // function definition. When we extract the
1835                         // signature, it comes from the `fn_sig` query,
1836                         // and hence may contain unnormalized results.
1837                         let fn_sig = self.normalize(fn_sig, location);
1838
1839                         let ty_fn_ptr_from = tcx.mk_fn_ptr(fn_sig);
1840
1841                         if let Err(terr) = self.eq_types(
1842                             ty_fn_ptr_from,
1843                             ty,
1844                             location.to_locations(),
1845                             ConstraintCategory::Cast,
1846                         ) {
1847                             span_mirbug!(
1848                                 self,
1849                                 rvalue,
1850                                 "equating {:?} with {:?} yields {:?}",
1851                                 ty_fn_ptr_from,
1852                                 ty,
1853                                 terr
1854                             );
1855                         }
1856                     }
1857
1858                     CastKind::ClosureFnPointer => {
1859                         let sig = match op.ty(mir, tcx).sty {
1860                             ty::Closure(def_id, substs) => {
1861                                 substs.closure_sig_ty(def_id, tcx).fn_sig(tcx)
1862                             }
1863                             _ => bug!(),
1864                         };
1865                         let ty_fn_ptr_from = tcx.coerce_closure_fn_ty(sig);
1866
1867                         if let Err(terr) = self.eq_types(
1868                             ty_fn_ptr_from,
1869                             ty,
1870                             location.to_locations(),
1871                             ConstraintCategory::Cast,
1872                         ) {
1873                             span_mirbug!(
1874                                 self,
1875                                 rvalue,
1876                                 "equating {:?} with {:?} yields {:?}",
1877                                 ty_fn_ptr_from,
1878                                 ty,
1879                                 terr
1880                             );
1881                         }
1882                     }
1883
1884                     CastKind::UnsafeFnPointer => {
1885                         let fn_sig = op.ty(mir, tcx).fn_sig(tcx);
1886
1887                         // The type that we see in the fcx is like
1888                         // `foo::<'a, 'b>`, where `foo` is the path to a
1889                         // function definition. When we extract the
1890                         // signature, it comes from the `fn_sig` query,
1891                         // and hence may contain unnormalized results.
1892                         let fn_sig = self.normalize(fn_sig, location);
1893
1894                         let ty_fn_ptr_from = tcx.safe_to_unsafe_fn_ty(fn_sig);
1895
1896                         if let Err(terr) = self.eq_types(
1897                             ty_fn_ptr_from,
1898                             ty,
1899                             location.to_locations(),
1900                             ConstraintCategory::Cast,
1901                         ) {
1902                             span_mirbug!(
1903                                 self,
1904                                 rvalue,
1905                                 "equating {:?} with {:?} yields {:?}",
1906                                 ty_fn_ptr_from,
1907                                 ty,
1908                                 terr
1909                             );
1910                         }
1911                     }
1912
1913                     CastKind::Unsize => {
1914                         let &ty = ty;
1915                         let trait_ref = ty::TraitRef {
1916                             def_id: tcx.lang_items().coerce_unsized_trait().unwrap(),
1917                             substs: tcx.mk_substs_trait(op.ty(mir, tcx), &[ty.into()]),
1918                         };
1919
1920                         self.prove_trait_ref(
1921                             trait_ref,
1922                             location.to_locations(),
1923                             ConstraintCategory::Cast,
1924                         );
1925                     }
1926
1927                     CastKind::Misc => {}
1928                 }
1929             }
1930
1931             Rvalue::Ref(region, _borrow_kind, borrowed_place) => {
1932                 self.add_reborrow_constraint(location, region, borrowed_place);
1933             }
1934
1935             // FIXME: These other cases have to be implemented in future PRs
1936             Rvalue::Use(..)
1937             | Rvalue::Len(..)
1938             | Rvalue::BinaryOp(..)
1939             | Rvalue::CheckedBinaryOp(..)
1940             | Rvalue::UnaryOp(..)
1941             | Rvalue::Discriminant(..) => {}
1942         }
1943     }
1944
1945     /// If this rvalue supports a user-given type annotation, then
1946     /// extract and return it. This represents the final type of the
1947     /// rvalue and will be unified with the inferred type.
1948     fn rvalue_user_ty(&self, rvalue: &Rvalue<'tcx>) -> Option<UserTypeAnnotation<'tcx>> {
1949         match rvalue {
1950             Rvalue::Use(_)
1951             | Rvalue::Repeat(..)
1952             | Rvalue::Ref(..)
1953             | Rvalue::Len(..)
1954             | Rvalue::Cast(..)
1955             | Rvalue::BinaryOp(..)
1956             | Rvalue::CheckedBinaryOp(..)
1957             | Rvalue::NullaryOp(..)
1958             | Rvalue::UnaryOp(..)
1959             | Rvalue::Discriminant(..) => None,
1960
1961             Rvalue::Aggregate(aggregate, _) => match **aggregate {
1962                 AggregateKind::Adt(_, _, _, user_ty, _) => user_ty,
1963                 AggregateKind::Array(_) => None,
1964                 AggregateKind::Tuple => None,
1965                 AggregateKind::Closure(_, _) => None,
1966                 AggregateKind::Generator(_, _, _) => None,
1967             },
1968         }
1969     }
1970
1971     fn check_aggregate_rvalue(
1972         &mut self,
1973         mir: &Mir<'tcx>,
1974         rvalue: &Rvalue<'tcx>,
1975         aggregate_kind: &AggregateKind<'tcx>,
1976         operands: &[Operand<'tcx>],
1977         location: Location,
1978     ) {
1979         let tcx = self.tcx();
1980
1981         self.prove_aggregate_predicates(aggregate_kind, location);
1982
1983         if *aggregate_kind == AggregateKind::Tuple {
1984             // tuple rvalue field type is always the type of the op. Nothing to check here.
1985             return;
1986         }
1987
1988         for (i, operand) in operands.iter().enumerate() {
1989             let field_ty = match self.aggregate_field_ty(aggregate_kind, i, location) {
1990                 Ok(field_ty) => field_ty,
1991                 Err(FieldAccessError::OutOfRange { field_count }) => {
1992                     span_mirbug!(
1993                         self,
1994                         rvalue,
1995                         "accessed field #{} but variant only has {}",
1996                         i,
1997                         field_count
1998                     );
1999                     continue;
2000                 }
2001             };
2002             let operand_ty = operand.ty(mir, tcx);
2003
2004             if let Err(terr) = self.sub_types(
2005                 operand_ty,
2006                 field_ty,
2007                 location.to_locations(),
2008                 ConstraintCategory::Boring,
2009             ) {
2010                 span_mirbug!(
2011                     self,
2012                     rvalue,
2013                     "{:?} is not a subtype of {:?}: {:?}",
2014                     operand_ty,
2015                     field_ty,
2016                     terr
2017                 );
2018             }
2019         }
2020     }
2021
2022     /// Add the constraints that arise from a borrow expression `&'a P` at the location `L`.
2023     ///
2024     /// # Parameters
2025     ///
2026     /// - `location`: the location `L` where the borrow expression occurs
2027     /// - `borrow_region`: the region `'a` associated with the borrow
2028     /// - `borrowed_place`: the place `P` being borrowed
2029     fn add_reborrow_constraint(
2030         &mut self,
2031         location: Location,
2032         borrow_region: ty::Region<'tcx>,
2033         borrowed_place: &Place<'tcx>,
2034     ) {
2035         // These constraints are only meaningful during borrowck:
2036         let BorrowCheckContext {
2037             borrow_set,
2038             location_table,
2039             all_facts,
2040             constraints,
2041             ..
2042         } = match self.borrowck_context {
2043             Some(ref mut borrowck_context) => borrowck_context,
2044             None => return,
2045         };
2046
2047         // In Polonius mode, we also push a `borrow_region` fact
2048         // linking the loan to the region (in some cases, though,
2049         // there is no loan associated with this borrow expression --
2050         // that occurs when we are borrowing an unsafe place, for
2051         // example).
2052         if let Some(all_facts) = all_facts {
2053             if let Some(borrow_index) = borrow_set.location_map.get(&location) {
2054                 let region_vid = borrow_region.to_region_vid();
2055                 all_facts.borrow_region.push((
2056                     region_vid,
2057                     *borrow_index,
2058                     location_table.mid_index(location),
2059                 ));
2060             }
2061         }
2062
2063         // If we are reborrowing the referent of another reference, we
2064         // need to add outlives relationships. In a case like `&mut
2065         // *p`, where the `p` has type `&'b mut Foo`, for example, we
2066         // need to ensure that `'b: 'a`.
2067
2068         let mut borrowed_place = borrowed_place;
2069
2070         debug!(
2071             "add_reborrow_constraint({:?}, {:?}, {:?})",
2072             location, borrow_region, borrowed_place
2073         );
2074         while let Place::Projection(box PlaceProjection { base, elem }) = borrowed_place {
2075             debug!("add_reborrow_constraint - iteration {:?}", borrowed_place);
2076
2077             match *elem {
2078                 ProjectionElem::Deref => {
2079                     let tcx = self.infcx.tcx;
2080                     let base_ty = base.ty(self.mir, tcx).to_ty(tcx);
2081
2082                     debug!("add_reborrow_constraint - base_ty = {:?}", base_ty);
2083                     match base_ty.sty {
2084                         ty::Ref(ref_region, _, mutbl) => {
2085                             constraints.outlives_constraints.push(OutlivesConstraint {
2086                                 sup: ref_region.to_region_vid(),
2087                                 sub: borrow_region.to_region_vid(),
2088                                 locations: location.to_locations(),
2089                                 category: ConstraintCategory::Boring,
2090                             });
2091
2092                             match mutbl {
2093                                 hir::Mutability::MutImmutable => {
2094                                     // Immutable reference. We don't need the base
2095                                     // to be valid for the entire lifetime of
2096                                     // the borrow.
2097                                     break;
2098                                 }
2099                                 hir::Mutability::MutMutable => {
2100                                     // Mutable reference. We *do* need the base
2101                                     // to be valid, because after the base becomes
2102                                     // invalid, someone else can use our mutable deref.
2103
2104                                     // This is in order to make the following function
2105                                     // illegal:
2106                                     // ```
2107                                     // fn unsafe_deref<'a, 'b>(x: &'a &'b mut T) -> &'b mut T {
2108                                     //     &mut *x
2109                                     // }
2110                                     // ```
2111                                     //
2112                                     // As otherwise you could clone `&mut T` using the
2113                                     // following function:
2114                                     // ```
2115                                     // fn bad(x: &mut T) -> (&mut T, &mut T) {
2116                                     //     let my_clone = unsafe_deref(&'a x);
2117                                     //     ENDREGION 'a;
2118                                     //     (my_clone, x)
2119                                     // }
2120                                     // ```
2121                                 }
2122                             }
2123                         }
2124                         ty::RawPtr(..) => {
2125                             // deref of raw pointer, guaranteed to be valid
2126                             break;
2127                         }
2128                         ty::Adt(def, _) if def.is_box() => {
2129                             // deref of `Box`, need the base to be valid - propagate
2130                         }
2131                         _ => bug!("unexpected deref ty {:?} in {:?}", base_ty, borrowed_place),
2132                     }
2133                 }
2134                 ProjectionElem::Field(..)
2135                 | ProjectionElem::Downcast(..)
2136                 | ProjectionElem::Index(..)
2137                 | ProjectionElem::ConstantIndex { .. }
2138                 | ProjectionElem::Subslice { .. } => {
2139                     // other field access
2140                 }
2141             }
2142
2143             // The "propagate" case. We need to check that our base is valid
2144             // for the borrow's lifetime.
2145             borrowed_place = base;
2146         }
2147     }
2148
2149     fn prove_aggregate_predicates(
2150         &mut self,
2151         aggregate_kind: &AggregateKind<'tcx>,
2152         location: Location,
2153     ) {
2154         let tcx = self.tcx();
2155
2156         debug!(
2157             "prove_aggregate_predicates(aggregate_kind={:?}, location={:?})",
2158             aggregate_kind, location
2159         );
2160
2161         let instantiated_predicates = match aggregate_kind {
2162             AggregateKind::Adt(def, _, substs, _, _) => {
2163                 tcx.predicates_of(def.did).instantiate(tcx, substs)
2164             }
2165
2166             // For closures, we have some **extra requirements** we
2167             //
2168             // have to check. In particular, in their upvars and
2169             // signatures, closures often reference various regions
2170             // from the surrounding function -- we call those the
2171             // closure's free regions. When we borrow-check (and hence
2172             // region-check) closures, we may find that the closure
2173             // requires certain relationships between those free
2174             // regions. However, because those free regions refer to
2175             // portions of the CFG of their caller, the closure is not
2176             // in a position to verify those relationships. In that
2177             // case, the requirements get "propagated" to us, and so
2178             // we have to solve them here where we instantiate the
2179             // closure.
2180             //
2181             // Despite the opacity of the previous parapgrah, this is
2182             // actually relatively easy to understand in terms of the
2183             // desugaring. A closure gets desugared to a struct, and
2184             // these extra requirements are basically like where
2185             // clauses on the struct.
2186             AggregateKind::Closure(def_id, ty::ClosureSubsts { substs })
2187             | AggregateKind::Generator(def_id, ty::GeneratorSubsts { substs }, _) => {
2188                 self.prove_closure_bounds(tcx, *def_id, substs, location)
2189             }
2190
2191             AggregateKind::Array(_) | AggregateKind::Tuple => ty::InstantiatedPredicates::empty(),
2192         };
2193
2194         self.normalize_and_prove_instantiated_predicates(
2195             instantiated_predicates,
2196             location.to_locations(),
2197         );
2198     }
2199
2200     fn prove_closure_bounds(
2201         &mut self,
2202         tcx: TyCtxt<'a, 'gcx, 'tcx>,
2203         def_id: DefId,
2204         substs: &'tcx Substs<'tcx>,
2205         location: Location,
2206     ) -> ty::InstantiatedPredicates<'tcx> {
2207         if let Some(closure_region_requirements) = tcx.mir_borrowck(def_id).closure_requirements {
2208             let closure_constraints =
2209                 closure_region_requirements.apply_requirements(tcx, location, def_id, substs);
2210
2211             if let Some(ref mut borrowck_context) = self.borrowck_context {
2212                 let bounds_mapping = closure_constraints
2213                     .iter()
2214                     .enumerate()
2215                     .filter_map(|(idx, constraint)| {
2216                         let ty::OutlivesPredicate(k1, r2) =
2217                             constraint.no_bound_vars().unwrap_or_else(|| {
2218                                 bug!("query_constraint {:?} contained bound vars", constraint,);
2219                             });
2220
2221                         match k1.unpack() {
2222                             UnpackedKind::Lifetime(r1) => {
2223                                 // constraint is r1: r2
2224                                 let r1_vid = borrowck_context.universal_regions.to_region_vid(r1);
2225                                 let r2_vid = borrowck_context.universal_regions.to_region_vid(r2);
2226                                 let outlives_requirements =
2227                                     &closure_region_requirements.outlives_requirements[idx];
2228                                 Some((
2229                                     (r1_vid, r2_vid),
2230                                     (
2231                                         outlives_requirements.category,
2232                                         outlives_requirements.blame_span,
2233                                     ),
2234                                 ))
2235                             }
2236                             UnpackedKind::Type(_) => None,
2237                         }
2238                     })
2239                     .collect();
2240
2241                 let existing = borrowck_context
2242                     .constraints
2243                     .closure_bounds_mapping
2244                     .insert(location, bounds_mapping);
2245                 assert!(
2246                     existing.is_none(),
2247                     "Multiple closures at the same location."
2248                 );
2249             }
2250
2251             self.push_region_constraints(
2252                 location.to_locations(),
2253                 ConstraintCategory::ClosureBounds,
2254                 &closure_constraints,
2255             );
2256         }
2257
2258         tcx.predicates_of(def_id).instantiate(tcx, substs)
2259     }
2260
2261     fn prove_trait_ref(
2262         &mut self,
2263         trait_ref: ty::TraitRef<'tcx>,
2264         locations: Locations,
2265         category: ConstraintCategory,
2266     ) {
2267         self.prove_predicates(
2268             Some(ty::Predicate::Trait(
2269                 trait_ref.to_poly_trait_ref().to_poly_trait_predicate(),
2270             )),
2271             locations,
2272             category,
2273         );
2274     }
2275
2276     fn normalize_and_prove_instantiated_predicates(
2277         &mut self,
2278         instantiated_predicates: ty::InstantiatedPredicates<'tcx>,
2279         locations: Locations,
2280     ) {
2281         for predicate in instantiated_predicates.predicates {
2282             let predicate = self.normalize(predicate, locations);
2283             self.prove_predicate(predicate, locations, ConstraintCategory::Boring);
2284         }
2285     }
2286
2287     fn prove_predicates(
2288         &mut self,
2289         predicates: impl IntoIterator<Item = ty::Predicate<'tcx>>,
2290         locations: Locations,
2291         category: ConstraintCategory,
2292     ) {
2293         for predicate in predicates {
2294             debug!(
2295                 "prove_predicates(predicate={:?}, locations={:?})",
2296                 predicate, locations,
2297             );
2298
2299             self.prove_predicate(predicate, locations, category);
2300         }
2301     }
2302
2303     fn prove_predicate(
2304         &mut self,
2305         predicate: ty::Predicate<'tcx>,
2306         locations: Locations,
2307         category: ConstraintCategory,
2308     ) {
2309         debug!(
2310             "prove_predicate(predicate={:?}, location={:?})",
2311             predicate, locations,
2312         );
2313
2314         let param_env = self.param_env;
2315         self.fully_perform_op(
2316             locations,
2317             category,
2318             param_env.and(type_op::prove_predicate::ProvePredicate::new(predicate)),
2319         ).unwrap_or_else(|NoSolution| {
2320             span_mirbug!(self, NoSolution, "could not prove {:?}", predicate);
2321         })
2322     }
2323
2324     fn typeck_mir(&mut self, mir: &Mir<'tcx>) {
2325         self.last_span = mir.span;
2326         debug!("run_on_mir: {:?}", mir.span);
2327
2328         for (local, local_decl) in mir.local_decls.iter_enumerated() {
2329             self.check_local(mir, local, local_decl);
2330         }
2331
2332         for (block, block_data) in mir.basic_blocks().iter_enumerated() {
2333             let mut location = Location {
2334                 block,
2335                 statement_index: 0,
2336             };
2337             for stmt in &block_data.statements {
2338                 if !stmt.source_info.span.is_dummy() {
2339                     self.last_span = stmt.source_info.span;
2340                 }
2341                 self.check_stmt(mir, stmt, location);
2342                 location.statement_index += 1;
2343             }
2344
2345             self.check_terminator(mir, block_data.terminator(), location);
2346             self.check_iscleanup(mir, block_data);
2347         }
2348     }
2349
2350     fn normalize<T>(&mut self, value: T, location: impl NormalizeLocation) -> T
2351     where
2352         T: type_op::normalize::Normalizable<'gcx, 'tcx> + Copy,
2353     {
2354         debug!("normalize(value={:?}, location={:?})", value, location);
2355         let param_env = self.param_env;
2356         self.fully_perform_op(
2357             location.to_locations(),
2358             ConstraintCategory::Boring,
2359             param_env.and(type_op::normalize::Normalize::new(value)),
2360         ).unwrap_or_else(|NoSolution| {
2361             span_mirbug!(self, NoSolution, "failed to normalize `{:?}`", value);
2362             value
2363         })
2364     }
2365 }
2366
2367 pub struct TypeckMir;
2368
2369 impl MirPass for TypeckMir {
2370     fn run_pass<'a, 'tcx>(&self, tcx: TyCtxt<'a, 'tcx, 'tcx>, src: MirSource, mir: &mut Mir<'tcx>) {
2371         let def_id = src.def_id;
2372         debug!("run_pass: {:?}", def_id);
2373
2374         // When NLL is enabled, the borrow checker runs the typeck
2375         // itself, so we don't need this MIR pass anymore.
2376         if tcx.use_mir_borrowck() {
2377             return;
2378         }
2379
2380         if tcx.sess.err_count() > 0 {
2381             // compiling a broken program can obviously result in a
2382             // broken MIR, so try not to report duplicate errors.
2383             return;
2384         }
2385
2386         if tcx.is_struct_constructor(def_id) {
2387             // We just assume that the automatically generated struct constructors are
2388             // correct. See the comment in the `mir_borrowck` implementation for an
2389             // explanation why we need this.
2390             return;
2391         }
2392
2393         let param_env = tcx.param_env(def_id);
2394         tcx.infer_ctxt().enter(|infcx| {
2395             type_check_internal(
2396                 &infcx,
2397                 def_id,
2398                 param_env,
2399                 mir,
2400                 &vec![],
2401                 None,
2402                 None,
2403                 None,
2404                 |_| (),
2405             );
2406
2407             // For verification purposes, we just ignore the resulting
2408             // region constraint sets. Not our problem. =)
2409         });
2410     }
2411 }
2412
2413 trait NormalizeLocation: fmt::Debug + Copy {
2414     fn to_locations(self) -> Locations;
2415 }
2416
2417 impl NormalizeLocation for Locations {
2418     fn to_locations(self) -> Locations {
2419         self
2420     }
2421 }
2422
2423 impl NormalizeLocation for Location {
2424     fn to_locations(self) -> Locations {
2425         Locations::Single(self)
2426     }
2427 }
2428
2429 #[derive(Debug, Default)]
2430 struct ObligationAccumulator<'tcx> {
2431     obligations: PredicateObligations<'tcx>,
2432 }
2433
2434 impl<'tcx> ObligationAccumulator<'tcx> {
2435     fn add<T>(&mut self, value: InferOk<'tcx, T>) -> T {
2436         let InferOk { value, obligations } = value;
2437         self.obligations.extend(obligations);
2438         value
2439     }
2440
2441     fn into_vec(self) -> PredicateObligations<'tcx> {
2442         self.obligations
2443     }
2444 }