src/librustc_mir/transform/qualify_consts.rs

   1 //! A pass that qualifies constness of temporaries in constants,
   2 //! static initializers and functions and also drives promotion.
   3 //!
   4 //! The Qualif flags below can be used to also provide better
   5 //! diagnostics as to why a constant rvalue wasn't promoted.
   6
   7 use rustc_index::bit_set::BitSet;
   8 use rustc_index::vec::IndexVec;
   9 use rustc_data_structures::fx::FxHashSet;
  10 use rustc_target::spec::abi::Abi;
  11 use rustc::hir;
  12 use rustc::hir::def_id::DefId;
  13 use rustc::traits::{self, TraitEngine};
  14 use rustc::ty::{self, TyCtxt, Ty, TypeFoldable};
  15 use rustc::ty::cast::CastTy;
  16 use rustc::ty::query::Providers;
  17 use rustc::mir::*;
  18 use rustc::mir::interpret::ConstValue;
  19 use rustc::mir::traversal::ReversePostorder;
  20 use rustc::mir::visit::{PlaceContext, Visitor, MutatingUseContext, NonMutatingUseContext};
  21 use rustc::middle::lang_items;
  22 use rustc::session::config::nightly_options;
  23 use syntax::ast::LitKind;
  24 use syntax::feature_gate::{emit_feature_err, GateIssue};
  25 use syntax::symbol::sym;
  26 use syntax_pos::{Span, DUMMY_SP};
  27
  28 use std::borrow::Cow;
  29 use std::cell::Cell;
  30 use std::fmt;
  31 use std::ops::{Deref, Index, IndexMut};
  32 use std::usize;
  33
  34 use rustc::hir::HirId;
  35 use crate::transform::{MirPass, MirSource};
  36 use super::promote_consts::{self, Candidate, TempState};
  37 use crate::transform::check_consts::ops::{self, NonConstOp};
  38
  39 /// What kind of item we are in.
  40 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
  41 enum Mode {
  42     /// A `static` item.
  43     Static,
  44     /// A `static mut` item.
  45     StaticMut,
  46     /// A `const fn` item.
  47     ConstFn,
  48     /// A `const` item or an anonymous constant (e.g. in array lengths).
  49     Const,
  50     /// Other type of `fn`.
  51     NonConstFn,
  52 }
  53
  54 impl Mode {
  55     /// Determine whether we have to do full const-checking because syntactically, we
  56     /// are required to be "const".
  57     #[inline]
  58     fn requires_const_checking(self) -> bool {
  59         self != Mode::NonConstFn
  60     }
  61 }
  62
  63 impl fmt::Display for Mode {
  64     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
  65         match *self {
  66             Mode::Const => write!(f, "constant"),
  67             Mode::Static | Mode::StaticMut => write!(f, "static"),
  68             Mode::ConstFn => write!(f, "constant function"),
  69             Mode::NonConstFn => write!(f, "function")
  70         }
  71     }
  72 }
  73
  74 const QUALIF_COUNT: usize = 4;
  75
  76 // FIXME(eddyb) once we can use const generics, replace this array with
  77 // something like `IndexVec` but for fixed-size arrays (`IndexArray`?).
  78 #[derive(Copy, Clone, Default)]
  79 struct PerQualif<T>([T; QUALIF_COUNT]);
  80
  81 impl<T: Clone> PerQualif<T> {
  82     fn new(x: T) -> Self {
  83         PerQualif([x.clone(), x.clone(), x.clone(), x])
  84     }
  85 }
  86
  87 impl<T> PerQualif<T> {
  88     fn as_mut(&mut self) -> PerQualif<&mut T> {
  89         let [x0, x1, x2, x3] = &mut self.0;
  90         PerQualif([x0, x1, x2, x3])
  91     }
  92
  93     fn zip<U>(self, other: PerQualif<U>) -> PerQualif<(T, U)> {
  94         let [x0, x1, x2, x3] = self.0;
  95         let [y0, y1, y2, y3] = other.0;
  96         PerQualif([(x0, y0), (x1, y1), (x2, y2), (x3, y3)])
  97     }
  98 }
  99
 100 impl PerQualif<bool> {
 101     fn encode_to_bits(self) -> u8 {
 102         self.0.iter().enumerate().fold(0, |bits, (i, &qualif)| {
 103             bits | ((qualif as u8) << i)
 104         })
 105     }
 106
 107     fn decode_from_bits(bits: u8) -> Self {
 108         let mut qualifs = Self::default();
 109         for (i, qualif) in qualifs.0.iter_mut().enumerate() {
 110             *qualif = (bits & (1 << i)) != 0;
 111         }
 112         qualifs
 113     }
 114 }
 115
 116 impl<Q: Qualif, T> Index<Q> for PerQualif<T> {
 117     type Output = T;
 118
 119     fn index(&self, _: Q) -> &T {
 120         &self.0[Q::IDX]
 121     }
 122 }
 123
 124 impl<Q: Qualif, T> IndexMut<Q> for PerQualif<T> {
 125     fn index_mut(&mut self, _: Q) -> &mut T {
 126         &mut self.0[Q::IDX]
 127     }
 128 }
 129
 130 struct ConstCx<'a, 'tcx> {
 131     tcx: TyCtxt<'tcx>,
 132     param_env: ty::ParamEnv<'tcx>,
 133     mode: Mode,
 134     body: &'a Body<'tcx>,
 135
 136     per_local: PerQualif<BitSet<Local>>,
 137 }
 138
 139 impl<'a, 'tcx> ConstCx<'a, 'tcx> {
 140     fn is_const_panic_fn(&self, def_id: DefId) -> bool {
 141         Some(def_id) == self.tcx.lang_items().panic_fn() ||
 142         Some(def_id) == self.tcx.lang_items().begin_panic_fn()
 143     }
 144 }
 145
 146 #[derive(Copy, Clone, Debug)]
 147 enum ValueSource<'a, 'tcx> {
 148     Rvalue(&'a Rvalue<'tcx>),
 149     DropAndReplace(&'a Operand<'tcx>),
 150     Call {
 151         callee: &'a Operand<'tcx>,
 152         args: &'a [Operand<'tcx>],
 153         return_ty: Ty<'tcx>,
 154     },
 155 }
 156
 157 /// A "qualif"(-ication) is a way to look for something "bad" in the MIR that would disqualify some
 158 /// code for promotion or prevent it from evaluating at compile time. So `return true` means
 159 /// "I found something bad, no reason to go on searching". `false` is only returned if we
 160 /// definitely cannot find anything bad anywhere.
 161 ///
 162 /// The default implementations proceed structurally.
 163 trait Qualif {
 164     const IDX: usize;
 165
 166     /// Return the qualification that is (conservatively) correct for any value
 167     /// of the type, or `None` if the qualification is not value/type-based.
 168     fn in_any_value_of_ty(_cx: &ConstCx<'_, 'tcx>, _ty: Ty<'tcx>) -> Option<bool> {
 169         None
 170     }
 171
 172     /// Return a mask for the qualification, given a type. This is `false` iff
 173     /// no value of that type can have the qualification.
 174     fn mask_for_ty(cx: &ConstCx<'_, 'tcx>, ty: Ty<'tcx>) -> bool {
 175         Self::in_any_value_of_ty(cx, ty).unwrap_or(true)
 176     }
 177
 178     fn in_local(cx: &ConstCx<'_, '_>, local: Local) -> bool {
 179         cx.per_local.0[Self::IDX].contains(local)
 180     }
 181
 182     fn in_static(_cx: &ConstCx<'_, 'tcx>, _static: &Static<'tcx>) -> bool {
 183         // FIXME(eddyb) should we do anything here for value properties?
 184         false
 185     }
 186
 187     fn in_projection_structurally(
 188         cx: &ConstCx<'_, 'tcx>,
 189         place: PlaceRef<'_, 'tcx>,
 190     ) -> bool {
 191         if let [proj_base @ .., elem] = place.projection {
 192             let base_qualif = Self::in_place(cx, PlaceRef {
 193                 base: place.base,
 194                 projection: proj_base,
 195             });
 196             let qualif = base_qualif && Self::mask_for_ty(
 197                 cx,
 198                 Place::ty_from(place.base, proj_base, cx.body, cx.tcx)
 199                     .projection_ty(cx.tcx, elem)
 200                     .ty,
 201             );
 202             match elem {
 203                 ProjectionElem::Deref |
 204                 ProjectionElem::Subslice { .. } |
 205                 ProjectionElem::Field(..) |
 206                 ProjectionElem::ConstantIndex { .. } |
 207                 ProjectionElem::Downcast(..) => qualif,
 208
 209                 ProjectionElem::Index(local) => qualif || Self::in_local(cx, *local),
 210             }
 211         } else {
 212             bug!("This should be called if projection is not empty");
 213         }
 214     }
 215
 216     fn in_projection(
 217         cx: &ConstCx<'_, 'tcx>,
 218         place: PlaceRef<'_, 'tcx>,
 219     ) -> bool {
 220         Self::in_projection_structurally(cx, place)
 221     }
 222
 223     fn in_place(cx: &ConstCx<'_, 'tcx>, place: PlaceRef<'_, 'tcx>) -> bool {
 224         match place {
 225             PlaceRef {
 226                 base: PlaceBase::Local(local),
 227                 projection: [],
 228             } => Self::in_local(cx, *local),
 229             PlaceRef {
 230                 base: PlaceBase::Static(box Static {
 231                     kind: StaticKind::Promoted(..),
 232                     ..
 233                 }),
 234                 projection: [],
 235             } => bug!("qualifying already promoted MIR"),
 236             PlaceRef {
 237                 base: PlaceBase::Static(static_),
 238                 projection: [],
 239             } => {
 240                 Self::in_static(cx, static_)
 241             },
 242             PlaceRef {
 243                 base: _,
 244                 projection: [.., _],
 245             } => Self::in_projection(cx, place),
 246         }
 247     }
 248
 249     fn in_operand(cx: &ConstCx<'_, 'tcx>, operand: &Operand<'tcx>) -> bool {
 250         match *operand {
 251             Operand::Copy(ref place) |
 252             Operand::Move(ref place) => Self::in_place(cx, place.as_ref()),
 253
 254             Operand::Constant(ref constant) => {
 255                 if let ConstValue::Unevaluated(def_id, _) = constant.literal.val {
 256                     // Don't peek inside trait associated constants.
 257                     if cx.tcx.trait_of_item(def_id).is_some() {
 258                         Self::in_any_value_of_ty(cx, constant.literal.ty).unwrap_or(false)
 259                     } else {
 260                         let (bits, _) = cx.tcx.at(constant.span).mir_const_qualif(def_id);
 261
 262                         let qualif = PerQualif::decode_from_bits(bits).0[Self::IDX];
 263
 264                         // Just in case the type is more specific than
 265                         // the definition, e.g., impl associated const
 266                         // with type parameters, take it into account.
 267                         qualif && Self::mask_for_ty(cx, constant.literal.ty)
 268                     }
 269                 } else {
 270                     false
 271                 }
 272             }
 273         }
 274     }
 275
 276     fn in_rvalue_structurally(cx: &ConstCx<'_, 'tcx>, rvalue: &Rvalue<'tcx>) -> bool {
 277         match *rvalue {
 278             Rvalue::NullaryOp(..) => false,
 279
 280             Rvalue::Discriminant(ref place) |
 281             Rvalue::Len(ref place) => Self::in_place(cx, place.as_ref()),
 282
 283             Rvalue::Use(ref operand) |
 284             Rvalue::Repeat(ref operand, _) |
 285             Rvalue::UnaryOp(_, ref operand) |
 286             Rvalue::Cast(_, ref operand, _) => Self::in_operand(cx, operand),
 287
 288             Rvalue::BinaryOp(_, ref lhs, ref rhs) |
 289             Rvalue::CheckedBinaryOp(_, ref lhs, ref rhs) => {
 290                 Self::in_operand(cx, lhs) || Self::in_operand(cx, rhs)
 291             }
 292
 293             Rvalue::Ref(_, _, ref place) => {
 294                 // Special-case reborrows to be more like a copy of the reference.
 295                 if let &[ref proj_base @ .., elem] = place.projection.as_ref() {
 296                     if ProjectionElem::Deref == elem {
 297                         let base_ty = Place::ty_from(&place.base, proj_base, cx.body, cx.tcx).ty;
 298                         if let ty::Ref(..) = base_ty.kind {
 299                             return Self::in_place(cx, PlaceRef {
 300                                 base: &place.base,
 301                                 projection: proj_base,
 302                             });
 303                         }
 304                     }
 305                 }
 306
 307                 Self::in_place(cx, place.as_ref())
 308             }
 309
 310             Rvalue::Aggregate(_, ref operands) => {
 311                 operands.iter().any(|o| Self::in_operand(cx, o))
 312             }
 313         }
 314     }
 315
 316     fn in_rvalue(cx: &ConstCx<'_, 'tcx>, rvalue: &Rvalue<'tcx>) -> bool {
 317         Self::in_rvalue_structurally(cx, rvalue)
 318     }
 319
 320     fn in_call(
 321         cx: &ConstCx<'_, 'tcx>,
 322         _callee: &Operand<'tcx>,
 323         _args: &[Operand<'tcx>],
 324         return_ty: Ty<'tcx>,
 325     ) -> bool {
 326         // Be conservative about the returned value of a const fn.
 327         Self::in_any_value_of_ty(cx, return_ty).unwrap_or(false)
 328     }
 329
 330     fn in_value(cx: &ConstCx<'_, 'tcx>, source: ValueSource<'_, 'tcx>) -> bool {
 331         match source {
 332             ValueSource::Rvalue(rvalue) => Self::in_rvalue(cx, rvalue),
 333             ValueSource::DropAndReplace(source) => Self::in_operand(cx, source),
 334             ValueSource::Call { callee, args, return_ty } => {
 335                 Self::in_call(cx, callee, args, return_ty)
 336             }
 337         }
 338     }
 339 }
 340
 341 /// Constant containing interior mutability (`UnsafeCell<T>`).
 342 /// This must be ruled out to make sure that evaluating the constant at compile-time
 343 /// and at *any point* during the run-time would produce the same result. In particular,
 344 /// promotion of temporaries must not change program behavior; if the promoted could be
 345 /// written to, that would be a problem.
 346 struct HasMutInterior;
 347
 348 impl Qualif for HasMutInterior {
 349     const IDX: usize = 0;
 350
 351     fn in_any_value_of_ty(cx: &ConstCx<'_, 'tcx>, ty: Ty<'tcx>) -> Option<bool> {
 352         Some(!ty.is_freeze(cx.tcx, cx.param_env, DUMMY_SP))
 353     }
 354
 355     fn in_rvalue(cx: &ConstCx<'_, 'tcx>, rvalue: &Rvalue<'tcx>) -> bool {
 356         match *rvalue {
 357             // Returning `true` for `Rvalue::Ref` indicates the borrow isn't
 358             // allowed in constants (and the `Checker` will error), and/or it
 359             // won't be promoted, due to `&mut ...` or interior mutability.
 360             Rvalue::Ref(_, kind, ref place) => {
 361                 let ty = place.ty(cx.body, cx.tcx).ty;
 362
 363                 if let BorrowKind::Mut { .. } = kind {
 364                     // In theory, any zero-sized value could be borrowed
 365                     // mutably without consequences. However, only &mut []
 366                     // is allowed right now, and only in functions.
 367                     if cx.mode == Mode::StaticMut {
 368                         // Inside a `static mut`, &mut [...] is also allowed.
 369                         match ty.kind {
 370                             ty::Array(..) | ty::Slice(_) => {}
 371                             _ => return true,
 372                         }
 373                     } else if let ty::Array(_, len) = ty.kind {
 374                         // FIXME(eddyb) the `cx.mode == Mode::NonConstFn` condition
 375                         // seems unnecessary, given that this is merely a ZST.
 376                         match len.try_eval_usize(cx.tcx, cx.param_env) {
 377                             Some(0) if cx.mode == Mode::NonConstFn => {},
 378                             _ => return true,
 379                         }
 380                     } else {
 381                         return true;
 382                     }
 383                 }
 384             }
 385
 386             Rvalue::Aggregate(ref kind, _) => {
 387                 if let AggregateKind::Adt(def, ..) = **kind {
 388                     if Some(def.did) == cx.tcx.lang_items().unsafe_cell_type() {
 389                         let ty = rvalue.ty(cx.body, cx.tcx);
 390                         assert_eq!(Self::in_any_value_of_ty(cx, ty), Some(true));
 391                         return true;
 392                     }
 393                 }
 394             }
 395
 396             _ => {}
 397         }
 398
 399         Self::in_rvalue_structurally(cx, rvalue)
 400     }
 401 }
 402
 403 /// Constant containing an ADT that implements `Drop`.
 404 /// This must be ruled out (a) because we cannot run `Drop` during compile-time
 405 /// as that might not be a `const fn`, and (b) because implicit promotion would
 406 /// remove side-effects that occur as part of dropping that value.
 407 struct NeedsDrop;
 408
 409 impl Qualif for NeedsDrop {
 410     const IDX: usize = 1;
 411
 412     fn in_any_value_of_ty(cx: &ConstCx<'_, 'tcx>, ty: Ty<'tcx>) -> Option<bool> {
 413         Some(ty.needs_drop(cx.tcx, cx.param_env))
 414     }
 415
 416     fn in_rvalue(cx: &ConstCx<'_, 'tcx>, rvalue: &Rvalue<'tcx>) -> bool {
 417         if let Rvalue::Aggregate(ref kind, _) = *rvalue {
 418             if let AggregateKind::Adt(def, ..) = **kind {
 419                 if def.has_dtor(cx.tcx) {
 420                     return true;
 421                 }
 422             }
 423         }
 424
 425         Self::in_rvalue_structurally(cx, rvalue)
 426     }
 427 }
 428
 429 /// Not promotable at all - non-`const fn` calls, `asm!`,
 430 /// pointer comparisons, ptr-to-int casts, etc.
 431 /// Inside a const context all constness rules apply, so promotion simply has to follow the regular
 432 /// constant rules (modulo interior mutability or `Drop` rules which are handled `HasMutInterior`
 433 /// and `NeedsDrop` respectively). Basically this duplicates the checks that the const-checking
 434 /// visitor enforces by emitting errors when working in const context.
 435 struct IsNotPromotable;
 436
 437 impl Qualif for IsNotPromotable {
 438     const IDX: usize = 2;
 439
 440     fn in_static(cx: &ConstCx<'_, 'tcx>, static_: &Static<'tcx>) -> bool {
 441         match static_.kind {
 442             StaticKind::Promoted(_, _) => unreachable!(),
 443             StaticKind::Static => {
 444                 // Only allow statics (not consts) to refer to other statics.
 445                 let allowed = cx.mode == Mode::Static || cx.mode == Mode::StaticMut;
 446
 447                 !allowed ||
 448                     cx.tcx.get_attrs(static_.def_id).iter().any(
 449                         |attr| attr.check_name(sym::thread_local)
 450                     )
 451             }
 452         }
 453     }
 454
 455     fn in_projection(
 456         cx: &ConstCx<'_, 'tcx>,
 457         place: PlaceRef<'_, 'tcx>,
 458     ) -> bool {
 459         if let [proj_base @ .., elem] = place.projection {
 460             match elem {
 461                 ProjectionElem::Deref |
 462                 ProjectionElem::Downcast(..) => return true,
 463
 464                 ProjectionElem::ConstantIndex {..} |
 465                 ProjectionElem::Subslice {..} |
 466                 ProjectionElem::Index(_) => {}
 467
 468                 ProjectionElem::Field(..) => {
 469                     if cx.mode == Mode::NonConstFn {
 470                         let base_ty = Place::ty_from(place.base, proj_base, cx.body, cx.tcx).ty;
 471                         if let Some(def) = base_ty.ty_adt_def() {
 472                             // No promotion of union field accesses.
 473                             if def.is_union() {
 474                                 return true;
 475                             }
 476                         }
 477                     }
 478                 }
 479             }
 480
 481             Self::in_projection_structurally(cx, place)
 482         } else {
 483             bug!("This should be called if projection is not empty");
 484         }
 485     }
 486
 487     fn in_rvalue(cx: &ConstCx<'_, 'tcx>, rvalue: &Rvalue<'tcx>) -> bool {
 488         match *rvalue {
 489             Rvalue::Cast(CastKind::Misc, ref operand, cast_ty) if cx.mode == Mode::NonConstFn => {
 490                 let operand_ty = operand.ty(cx.body, cx.tcx);
 491                 let cast_in = CastTy::from_ty(operand_ty).expect("bad input type for cast");
 492                 let cast_out = CastTy::from_ty(cast_ty).expect("bad output type for cast");
 493                 match (cast_in, cast_out) {
 494                     (CastTy::Ptr(_), CastTy::Int(_)) |
 495                     (CastTy::FnPtr, CastTy::Int(_)) => {
 496                         // in normal functions, mark such casts as not promotable
 497                         return true;
 498                     }
 499                     _ => {}
 500                 }
 501             }
 502
 503             Rvalue::BinaryOp(op, ref lhs, _) if cx.mode == Mode::NonConstFn => {
 504                 if let ty::RawPtr(_) | ty::FnPtr(..) = lhs.ty(cx.body, cx.tcx).kind {
 505                     assert!(op == BinOp::Eq || op == BinOp::Ne ||
 506                             op == BinOp::Le || op == BinOp::Lt ||
 507                             op == BinOp::Ge || op == BinOp::Gt ||
 508                             op == BinOp::Offset);
 509
 510                     // raw pointer operations are not allowed inside promoteds
 511                     return true;
 512                 }
 513             }
 514
 515             Rvalue::NullaryOp(NullOp::Box, _) => return true,
 516
 517             _ => {}
 518         }
 519
 520         Self::in_rvalue_structurally(cx, rvalue)
 521     }
 522
 523     fn in_call(
 524         cx: &ConstCx<'_, 'tcx>,
 525         callee: &Operand<'tcx>,
 526         args: &[Operand<'tcx>],
 527         _return_ty: Ty<'tcx>,
 528     ) -> bool {
 529         let fn_ty = callee.ty(cx.body, cx.tcx);
 530         match fn_ty.kind {
 531             ty::FnDef(def_id, _) => {
 532                 match cx.tcx.fn_sig(def_id).abi() {
 533                     Abi::RustIntrinsic |
 534                     Abi::PlatformIntrinsic => {
 535                         assert!(!cx.tcx.is_const_fn(def_id));
 536                         match &cx.tcx.item_name(def_id).as_str()[..] {
 537                             | "size_of"
 538                             | "min_align_of"
 539                             | "needs_drop"
 540                             | "type_id"
 541                             | "bswap"
 542                             | "bitreverse"
 543                             | "ctpop"
 544                             | "cttz"
 545                             | "cttz_nonzero"
 546                             | "ctlz"
 547                             | "ctlz_nonzero"
 548                             | "wrapping_add"
 549                             | "wrapping_sub"
 550                             | "wrapping_mul"
 551                             | "unchecked_shl"
 552                             | "unchecked_shr"
 553                             | "rotate_left"
 554                             | "rotate_right"
 555                             | "add_with_overflow"
 556                             | "sub_with_overflow"
 557                             | "mul_with_overflow"
 558                             | "saturating_add"
 559                             | "saturating_sub"
 560                             | "transmute"
 561                             | "simd_insert"
 562                             | "simd_extract"
 563                             => return true,
 564
 565                             _ => {}
 566                         }
 567                     }
 568                     _ => {
 569                         let is_const_fn =
 570                             cx.tcx.is_const_fn(def_id) ||
 571                             cx.tcx.is_unstable_const_fn(def_id).is_some() ||
 572                             cx.is_const_panic_fn(def_id);
 573                         if !is_const_fn {
 574                             return true;
 575                         }
 576                     }
 577                 }
 578             }
 579             _ => return true,
 580         }
 581
 582         Self::in_operand(cx, callee) || args.iter().any(|arg| Self::in_operand(cx, arg))
 583     }
 584 }
 585
 586 /// Refers to temporaries which cannot be promoted *implicitly*.
 587 /// Explicit promotion happens e.g. for constant arguments declared via `rustc_args_required_const`.
 588 /// Implicit promotion has almost the same rules, except that disallows `const fn` except for
 589 /// those marked `#[rustc_promotable]`. This is to avoid changing a legitimate run-time operation
 590 /// into a failing compile-time operation e.g. due to addresses being compared inside the function.
 591 struct IsNotImplicitlyPromotable;
 592
 593 impl Qualif for IsNotImplicitlyPromotable {
 594     const IDX: usize = 3;
 595
 596     fn in_call(
 597         cx: &ConstCx<'_, 'tcx>,
 598         callee: &Operand<'tcx>,
 599         args: &[Operand<'tcx>],
 600         _return_ty: Ty<'tcx>,
 601     ) -> bool {
 602         if cx.mode == Mode::NonConstFn {
 603             if let ty::FnDef(def_id, _) = callee.ty(cx.body, cx.tcx).kind {
 604                 // Never promote runtime `const fn` calls of
 605                 // functions without `#[rustc_promotable]`.
 606                 if !cx.tcx.is_promotable_const_fn(def_id) {
 607                     return true;
 608                 }
 609             }
 610         }
 611
 612         Self::in_operand(cx, callee) || args.iter().any(|arg| Self::in_operand(cx, arg))
 613     }
 614 }
 615
 616 // Ensure the `IDX` values are sequential (`0..QUALIF_COUNT`).
 617 macro_rules! static_assert_seq_qualifs {
 618     ($i:expr => $first:ident $(, $rest:ident)*) => {
 619         static_assert!({
 620             static_assert_seq_qualifs!($i + 1 => $($rest),*);
 621
 622             $first::IDX == $i
 623         });
 624     };
 625     ($i:expr =>) => {
 626         static_assert!(QUALIF_COUNT == $i);
 627     };
 628 }
 629 static_assert_seq_qualifs!(
 630     0 => HasMutInterior, NeedsDrop, IsNotPromotable, IsNotImplicitlyPromotable
 631 );
 632
 633 impl ConstCx<'_, 'tcx> {
 634     fn qualifs_in_any_value_of_ty(&self, ty: Ty<'tcx>) -> PerQualif<bool> {
 635         let mut qualifs = PerQualif::default();
 636         qualifs[HasMutInterior] = HasMutInterior::in_any_value_of_ty(self, ty).unwrap_or(false);
 637         qualifs[NeedsDrop] = NeedsDrop::in_any_value_of_ty(self, ty).unwrap_or(false);
 638         qualifs[IsNotPromotable] = IsNotPromotable::in_any_value_of_ty(self, ty).unwrap_or(false);
 639         qualifs[IsNotImplicitlyPromotable] =
 640             IsNotImplicitlyPromotable::in_any_value_of_ty(self, ty).unwrap_or(false);
 641         qualifs
 642     }
 643
 644     fn qualifs_in_local(&self, local: Local) -> PerQualif<bool> {
 645         let mut qualifs = PerQualif::default();
 646         qualifs[HasMutInterior] = HasMutInterior::in_local(self, local);
 647         qualifs[NeedsDrop] = NeedsDrop::in_local(self, local);
 648         qualifs[IsNotPromotable] = IsNotPromotable::in_local(self, local);
 649         qualifs[IsNotImplicitlyPromotable] = IsNotImplicitlyPromotable::in_local(self, local);
 650         qualifs
 651     }
 652
 653     fn qualifs_in_value(&self, source: ValueSource<'_, 'tcx>) -> PerQualif<bool> {
 654         let mut qualifs = PerQualif::default();
 655         qualifs[HasMutInterior] = HasMutInterior::in_value(self, source);
 656         qualifs[NeedsDrop] = NeedsDrop::in_value(self, source);
 657         qualifs[IsNotPromotable] = IsNotPromotable::in_value(self, source);
 658         qualifs[IsNotImplicitlyPromotable] = IsNotImplicitlyPromotable::in_value(self, source);
 659         qualifs
 660     }
 661 }
 662
 663 /// Checks MIR for being admissible as a compile-time constant, using `ConstCx`
 664 /// for value qualifications, and accumulates writes of
 665 /// rvalue/call results to locals, in `local_qualif`.
 666 /// It also records candidates for promotion in `promotion_candidates`,
 667 /// both in functions and const/static items.
 668 struct Checker<'a, 'tcx> {
 669     cx: ConstCx<'a, 'tcx>,
 670
 671     span: Span,
 672     def_id: DefId,
 673     rpo: ReversePostorder<'a, 'tcx>,
 674
 675     temp_promotion_state: IndexVec<Local, TempState>,
 676     promotion_candidates: Vec<Candidate>,
 677
 678     /// If `true`, do not emit errors to the user, merely collect them in `errors`.
 679     suppress_errors: bool,
 680     errors: Vec<(Span, String)>,
 681 }
 682
 683 macro_rules! unleash_miri {
 684     ($this:expr) => {{
 685         if $this.tcx.sess.opts.debugging_opts.unleash_the_miri_inside_of_you {
 686             if $this.mode.requires_const_checking() && !$this.suppress_errors {
 687                 $this.tcx.sess.span_warn($this.span, "skipping const checks");
 688             }
 689             return;
 690         }
 691     }}
 692 }
 693
 694 impl Deref for Checker<'a, 'tcx> {
 695     type Target = ConstCx<'a, 'tcx>;
 696
 697     fn deref(&self) -> &Self::Target {
 698         &self.cx
 699     }
 700 }
 701
 702 impl<'a, 'tcx> Checker<'a, 'tcx> {
 703     fn new(tcx: TyCtxt<'tcx>, def_id: DefId, body: &'a Body<'tcx>, mode: Mode) -> Self {
 704         assert!(def_id.is_local());
 705         let mut rpo = traversal::reverse_postorder(body);
 706         let temps = promote_consts::collect_temps(body, &mut rpo);
 707         rpo.reset();
 708
 709         let param_env = tcx.param_env(def_id);
 710
 711         let mut cx = ConstCx {
 712             tcx,
 713             param_env,
 714             mode,
 715             body,
 716             per_local: PerQualif::new(BitSet::new_empty(body.local_decls.len())),
 717         };
 718
 719         for (local, decl) in body.local_decls.iter_enumerated() {
 720             if let LocalKind::Arg = body.local_kind(local) {
 721                 let qualifs = cx.qualifs_in_any_value_of_ty(decl.ty);
 722                 for (per_local, qualif) in &mut cx.per_local.as_mut().zip(qualifs).0 {
 723                     if *qualif {
 724                         per_local.insert(local);
 725                     }
 726                 }
 727             }
 728             if !temps[local].is_promotable() {
 729                 cx.per_local[IsNotPromotable].insert(local);
 730             }
 731             if let LocalKind::Var = body.local_kind(local) {
 732                 // Sanity check to prevent implicit and explicit promotion of
 733                 // named locals
 734                 assert!(cx.per_local[IsNotPromotable].contains(local));
 735             }
 736         }
 737
 738         Checker {
 739             cx,
 740             span: body.span,
 741             def_id,
 742             rpo,
 743             temp_promotion_state: temps,
 744             promotion_candidates: vec![],
 745             errors: vec![],
 746             suppress_errors: false,
 747         }
 748     }
 749
 750     // FIXME(eddyb) we could split the errors into meaningful
 751     // categories, but enabling full miri would make that
 752     // slightly pointless (even with feature-gating).
 753     fn not_const(&mut self, op: impl NonConstOp) {
 754         unleash_miri!(self);
 755         if self.mode.requires_const_checking() && !self.suppress_errors {
 756             self.record_error(op);
 757             let mut err = struct_span_err!(
 758                 self.tcx.sess,
 759                 self.span,
 760                 E0019,
 761                 "{} contains unimplemented expression type",
 762                 self.mode
 763             );
 764             if self.tcx.sess.teach(&err.get_code().unwrap()) {
 765                 err.note("A function call isn't allowed in the const's initialization expression \
 766                           because the expression's value must be known at compile-time.");
 767                 err.note("Remember: you can't use a function call inside a const's initialization \
 768                           expression! However, you can use it anywhere else.");
 769             }
 770             err.emit();
 771         }
 772     }
 773
 774     fn record_error(&mut self, op: impl NonConstOp) {
 775         self.record_error_spanned(op, self.span);
 776     }
 777
 778     fn record_error_spanned(&mut self, op: impl NonConstOp, span: Span) {
 779         self.errors.push((span, format!("{:?}", op)));
 780     }
 781
 782     /// Assigns an rvalue/call qualification to the given destination.
 783     fn assign(&mut self, dest: &Place<'tcx>, source: ValueSource<'_, 'tcx>, location: Location) {
 784         trace!("assign: {:?} <- {:?}", dest, source);
 785
 786         let mut qualifs = self.qualifs_in_value(source);
 787
 788         match source {
 789             ValueSource::Rvalue(&Rvalue::Ref(_, kind, ref place)) => {
 790                 // Getting `true` from `HasMutInterior::in_rvalue` means
 791                 // the borrowed place is disallowed from being borrowed,
 792                 // due to either a mutable borrow (with some exceptions),
 793                 // or an shared borrow of a value with interior mutability.
 794                 // Then `HasMutInterior` is replaced with `IsNotPromotable`,
 795                 // to avoid duplicate errors (e.g. from reborrowing).
 796                 if qualifs[HasMutInterior] {
 797                     qualifs[HasMutInterior] = false;
 798                     qualifs[IsNotPromotable] = true;
 799
 800                     debug!("suppress_errors: {}", self.suppress_errors);
 801                     if self.mode.requires_const_checking() && !self.suppress_errors {
 802                         if !self.tcx.sess.opts.debugging_opts.unleash_the_miri_inside_of_you {
 803                             self.record_error(ops::MutBorrow(kind));
 804                             if let BorrowKind::Mut { .. } = kind {
 805                                 let mut err = struct_span_err!(self.tcx.sess,  self.span, E0017,
 806                                                                "references in {}s may only refer \
 807                                                                 to immutable values", self.mode);
 808                                 err.span_label(self.span, format!("{}s require immutable values",
 809                                                                     self.mode));
 810                                 if self.tcx.sess.teach(&err.get_code().unwrap()) {
 811                                     err.note("References in statics and constants may only refer \
 812                                               to immutable values.\n\n\
 813                                               Statics are shared everywhere, and if they refer to \
 814                                               mutable data one might violate memory safety since \
 815                                               holding multiple mutable references to shared data \
 816                                               is not allowed.\n\n\
 817                                               If you really want global mutable state, try using \
 818                                               static mut or a global UnsafeCell.");
 819                                 }
 820                                 err.emit();
 821                             } else {
 822                                 span_err!(self.tcx.sess, self.span, E0492,
 823                                           "cannot borrow a constant which may contain \
 824                                            interior mutability, create a static instead");
 825                             }
 826                         }
 827                     }
 828                 } else if let BorrowKind::Mut { .. } | BorrowKind::Shared = kind {
 829                     // Don't promote BorrowKind::Shallow borrows, as they don't
 830                     // reach codegen.
 831
 832                     // We might have a candidate for promotion.
 833                     let candidate = Candidate::Ref(location);
 834                     // Start by traversing to the "base", with non-deref projections removed.
 835                     let deref_proj =
 836                         place.projection.iter().rev().find(|&elem| *elem == ProjectionElem::Deref);
 837
 838                     debug!(
 839                         "qualify_consts: promotion candidate: place={:?} {:?}",
 840                         place.base, deref_proj
 841                     );
 842                     // We can only promote interior borrows of promotable temps (non-temps
 843                     // don't get promoted anyway).
 844                     // (If we bailed out of the loop due to a `Deref` above, we will definitely
 845                     // not enter the conditional here.)
 846                     if let (PlaceBase::Local(local), None) = (&place.base, deref_proj) {
 847                         if self.body.local_kind(*local) == LocalKind::Temp {
 848                             debug!("qualify_consts: promotion candidate: local={:?}", local);
 849                             // The borrowed place doesn't have `HasMutInterior`
 850                             // (from `in_rvalue`), so we can safely ignore
 851                             // `HasMutInterior` from the local's qualifications.
 852                             // This allows borrowing fields which don't have
 853                             // `HasMutInterior`, from a type that does, e.g.:
 854                             // `let _: &'static _ = &(Cell::new(1), 2).1;`
 855                             let mut local_qualifs = self.qualifs_in_local(*local);
 856                             // Any qualifications, except HasMutInterior (see above), disqualify
 857                             // from promotion.
 858                             // This is, in particular, the "implicit promotion" version of
 859                             // the check making sure that we don't run drop glue during const-eval.
 860                             local_qualifs[HasMutInterior] = false;
 861                             if !local_qualifs.0.iter().any(|&qualif| qualif) {
 862                                 debug!("qualify_consts: promotion candidate: {:?}", candidate);
 863                                 self.promotion_candidates.push(candidate);
 864                             }
 865                         }
 866                     }
 867                 }
 868             },
 869             ValueSource::Rvalue(&Rvalue::Repeat(ref operand, _)) => {
 870                 let candidate = Candidate::Repeat(location);
 871                 let not_promotable = IsNotImplicitlyPromotable::in_operand(self, operand) ||
 872                                      IsNotPromotable::in_operand(self, operand);
 873                 debug!("assign: self.def_id={:?} operand={:?}", self.def_id, operand);
 874                 if !not_promotable && self.tcx.features().const_in_array_repeat_expressions {
 875                     debug!("assign: candidate={:?}", candidate);
 876                     self.promotion_candidates.push(candidate);
 877                 }
 878             },
 879             _ => {},
 880         }
 881
 882         let mut dest_projection = &dest.projection[..];
 883         let index = loop {
 884             match (&dest.base, dest_projection) {
 885                 // We treat all locals equal in constants
 886                 (&PlaceBase::Local(index), []) => break index,
 887                 // projections are transparent for assignments
 888                 // we qualify the entire destination at once, even if just a field would have
 889                 // stricter qualification
 890                 (base, [proj_base @ .., _]) => {
 891                     // Catch more errors in the destination. `visit_place` also checks various
 892                     // projection rules like union field access and raw pointer deref
 893                     let context = PlaceContext::MutatingUse(MutatingUseContext::Store);
 894                     self.visit_place_base(base, context, location);
 895                     self.visit_projection(base, dest_projection, context, location);
 896                     dest_projection = proj_base;
 897                 },
 898                 (&PlaceBase::Static(box Static {
 899                     kind: StaticKind::Promoted(..),
 900                     ..
 901                 }), []) => bug!("promoteds don't exist yet during promotion"),
 902                 (&PlaceBase::Static(box Static{ kind: _, .. }), []) => {
 903                     // Catch more errors in the destination. `visit_place` also checks that we
 904                     // do not try to access statics from constants or try to mutate statics
 905                     let context = PlaceContext::MutatingUse(MutatingUseContext::Store);
 906                     self.visit_place_base(&dest.base, context, location);
 907                     return;
 908                 }
 909             }
 910         };
 911
 912         let kind = self.body.local_kind(index);
 913         debug!("store to {:?} {:?}", kind, index);
 914
 915         // Only handle promotable temps in non-const functions.
 916         if self.mode == Mode::NonConstFn {
 917             if kind != LocalKind::Temp ||
 918                !self.temp_promotion_state[index].is_promotable() {
 919                 return;
 920             }
 921         }
 922
 923         // this is overly restrictive, because even full assignments do not clear the qualif
 924         // While we could special case full assignments, this would be inconsistent with
 925         // aggregates where we overwrite all fields via assignments, which would not get
 926         // that feature.
 927         for (per_local, qualif) in &mut self.cx.per_local.as_mut().zip(qualifs).0 {
 928             if *qualif {
 929                 per_local.insert(index);
 930             }
 931         }
 932
 933         // Ensure the `IsNotPromotable` qualification is preserved.
 934         // NOTE(eddyb) this is actually unnecessary right now, as
 935         // we never replace the local's qualif, but we might in
 936         // the future, and so it serves to catch changes that unset
 937         // important bits (in which case, asserting `contains` could
 938         // be replaced with calling `insert` to re-set the bit).
 939         if kind == LocalKind::Temp {
 940             if !self.temp_promotion_state[index].is_promotable() {
 941                 assert!(self.cx.per_local[IsNotPromotable].contains(index));
 942             }
 943         }
 944     }
 945
 946     /// Check a whole const, static initializer or const fn.
 947     fn check_const(&mut self) -> (u8, &'tcx BitSet<Local>) {
 948         use crate::transform::check_consts as new_checker;
 949
 950         debug!("const-checking {} {:?}", self.mode, self.def_id);
 951
 952         // FIXME: Also use the new validator when features that require it (e.g. `const_if`) are
 953         // enabled.
 954         let use_new_validator = self.tcx.sess.opts.debugging_opts.unleash_the_miri_inside_of_you;
 955         if use_new_validator {
 956             debug!("Using dataflow-based const validator");
 957         }
 958
 959         let item = new_checker::Item::new(self.tcx, self.def_id, self.body);
 960         let mut_borrowed_locals = new_checker::validation::compute_indirectly_mutable_locals(&item);
 961         let mut validator = new_checker::validation::Validator::new(&item, &mut_borrowed_locals);
 962
 963         validator.suppress_errors = !use_new_validator;
 964         self.suppress_errors = use_new_validator;
 965
 966         let body = self.body;
 967
 968         let mut seen_blocks = BitSet::new_empty(body.basic_blocks().len());
 969         let mut bb = START_BLOCK;
 970         loop {
 971             seen_blocks.insert(bb.index());
 972
 973             self.visit_basic_block_data(bb, &body[bb]);
 974             validator.visit_basic_block_data(bb, &body[bb]);
 975
 976             let target = match body[bb].terminator().kind {
 977                 TerminatorKind::Goto { target } |
 978                 TerminatorKind::FalseUnwind { real_target: target, .. } |
 979                 TerminatorKind::Drop { target, .. } |
 980                 TerminatorKind::DropAndReplace { target, .. } |
 981                 TerminatorKind::Assert { target, .. } |
 982                 TerminatorKind::Call { destination: Some((_, target)), .. } => {
 983                     Some(target)
 984                 }
 985
 986                 // Non-terminating calls cannot produce any value.
 987                 TerminatorKind::Call { destination: None, .. } => {
 988                     break;
 989                 }
 990
 991                 TerminatorKind::SwitchInt {..} |
 992                 TerminatorKind::Resume |
 993                 TerminatorKind::Abort |
 994                 TerminatorKind::GeneratorDrop |
 995                 TerminatorKind::Yield { .. } |
 996                 TerminatorKind::Unreachable |
 997                 TerminatorKind::FalseEdges { .. } => None,
 998
 999                 TerminatorKind::Return => {
1000                     break;
1001                 }
1002             };
1003
1004             match target {
1005                 // No loops allowed.
1006                 Some(target) if !seen_blocks.contains(target.index()) => {
1007                     bb = target;
1008                 }
1009                 _ => {
1010                     self.not_const(ops::Loop);
1011                     validator.check_op(ops::Loop);
1012                     break;
1013                 }
1014             }
1015         }
1016
1017         // The new validation pass should agree with the old when running on simple const bodies
1018         // (e.g. no `if` or `loop`).
1019         if !use_new_validator {
1020             let mut new_errors = validator.take_errors();
1021
1022             // FIXME: each checker sometimes emits the same error with the same span twice in a row.
1023             self.errors.dedup();
1024             new_errors.dedup();
1025
1026             if self.errors != new_errors {
1027                 validator_mismatch(
1028                     self.tcx,
1029                     body,
1030                     std::mem::replace(&mut self.errors, vec![]),
1031                     new_errors,
1032                 );
1033             }
1034         }
1035
1036         // Collect all the temps we need to promote.
1037         let mut promoted_temps = BitSet::new_empty(self.temp_promotion_state.len());
1038
1039         debug!("qualify_const: promotion_candidates={:?}", self.promotion_candidates);
1040         for candidate in &self.promotion_candidates {
1041             match *candidate {
1042                 Candidate::Repeat(Location { block: bb, statement_index: stmt_idx }) => {
1043                     if let StatementKind::Assign(box(_, Rvalue::Repeat(
1044                         Operand::Move(place),
1045                         _
1046                     ))) = &self.body[bb].statements[stmt_idx].kind {
1047                         if let Some(index) = place.as_local() {
1048                             promoted_temps.insert(index);
1049                         }
1050                     }
1051                 }
1052                 Candidate::Ref(Location { block: bb, statement_index: stmt_idx }) => {
1053                     if let StatementKind::Assign(
1054                         box(
1055                             _,
1056                             Rvalue::Ref(_, _, place)
1057                         )
1058                     ) = &self.body[bb].statements[stmt_idx].kind {
1059                         if let Some(index) = place.as_local() {
1060                             promoted_temps.insert(index);
1061                         }
1062                     }
1063                 }
1064                 Candidate::Argument { .. } => {}
1065             }
1066         }
1067
1068         let mut qualifs = self.qualifs_in_local(RETURN_PLACE);
1069
1070         // Account for errors in consts by using the
1071         // conservative type qualification instead.
1072         if qualifs[IsNotPromotable] {
1073             qualifs = self.qualifs_in_any_value_of_ty(body.return_ty());
1074         }
1075
1076         (qualifs.encode_to_bits(), self.tcx.arena.alloc(promoted_temps))
1077     }
1078 }
1079
1080 impl<'a, 'tcx> Visitor<'tcx> for Checker<'a, 'tcx> {
1081     fn visit_place_base(
1082         &mut self,
1083         place_base: &PlaceBase<'tcx>,
1084         context: PlaceContext,
1085         location: Location,
1086     ) {
1087         self.super_place_base(place_base, context, location);
1088         match place_base {
1089             PlaceBase::Local(_) => {}
1090             PlaceBase::Static(box Static{ kind: StaticKind::Promoted(_, _), .. }) => {
1091                 unreachable!()
1092             }
1093             PlaceBase::Static(box Static{ kind: StaticKind::Static, def_id, .. }) => {
1094                 if self.tcx
1095                         .get_attrs(*def_id)
1096                         .iter()
1097                         .any(|attr| attr.check_name(sym::thread_local)) {
1098                     if self.mode.requires_const_checking() && !self.suppress_errors {
1099                         self.record_error(ops::ThreadLocalAccess);
1100                         span_err!(self.tcx.sess, self.span, E0625,
1101                                     "thread-local statics cannot be \
1102                                     accessed at compile-time");
1103                     }
1104                     return;
1105                 }
1106
1107                 // Only allow statics (not consts) to refer to other statics.
1108                 if self.mode == Mode::Static || self.mode == Mode::StaticMut {
1109                     if self.mode == Mode::Static
1110                         && context.is_mutating_use()
1111                         && !self.suppress_errors
1112                     {
1113                         // this is not strictly necessary as miri will also bail out
1114                         // For interior mutability we can't really catch this statically as that
1115                         // goes through raw pointers and intermediate temporaries, so miri has
1116                         // to catch this anyway
1117                         self.tcx.sess.span_err(
1118                             self.span,
1119                             "cannot mutate statics in the initializer of another static",
1120                         );
1121                     }
1122                     return;
1123                 }
1124                 unleash_miri!(self);
1125
1126                 if self.mode.requires_const_checking() && !self.suppress_errors {
1127                     self.record_error(ops::StaticAccess);
1128                     let mut err = struct_span_err!(self.tcx.sess, self.span, E0013,
1129                                                     "{}s cannot refer to statics, use \
1130                                                     a constant instead", self.mode);
1131                     if self.tcx.sess.teach(&err.get_code().unwrap()) {
1132                         err.note(
1133                             "Static and const variables can refer to other const variables. \
1134                                 But a const variable cannot refer to a static variable."
1135                         );
1136                         err.help(
1137                             "To fix this, the value can be extracted as a const and then used."
1138                         );
1139                     }
1140                     err.emit()
1141                 }
1142             }
1143         }
1144     }
1145
1146     fn visit_projection_elem(
1147         &mut self,
1148         place_base: &PlaceBase<'tcx>,
1149         proj_base: &[PlaceElem<'tcx>],
1150         elem: &PlaceElem<'tcx>,
1151         context: PlaceContext,
1152         location: Location,
1153     ) {
1154         debug!(
1155             "visit_projection_elem: place_base={:?} proj_base={:?} elem={:?} \
1156             context={:?} location={:?}",
1157             place_base,
1158             proj_base,
1159             elem,
1160             context,
1161             location,
1162         );
1163
1164         self.super_projection_elem(place_base, proj_base, elem, context, location);
1165
1166         match elem {
1167             ProjectionElem::Deref => {
1168                 if context.is_mutating_use() {
1169                     // `not_const` errors out in const contexts
1170                     self.not_const(ops::MutDeref)
1171                 }
1172                 let base_ty = Place::ty_from(place_base, proj_base, self.body, self.tcx).ty;
1173                 match self.mode {
1174                     Mode::NonConstFn => {}
1175                     _ if self.suppress_errors => {}
1176                     _ => {
1177                         if let ty::RawPtr(_) = base_ty.kind {
1178                             if !self.tcx.features().const_raw_ptr_deref {
1179                                 self.record_error(ops::RawPtrDeref);
1180                                 emit_feature_err(
1181                                     &self.tcx.sess.parse_sess, sym::const_raw_ptr_deref,
1182                                     self.span, GateIssue::Language,
1183                                     &format!(
1184                                         "dereferencing raw pointers in {}s is unstable",
1185                                         self.mode,
1186                                     ),
1187                                 );
1188                             }
1189                         }
1190                     }
1191                 }
1192             }
1193
1194             ProjectionElem::ConstantIndex {..} |
1195             ProjectionElem::Subslice {..} |
1196             ProjectionElem::Field(..) |
1197             ProjectionElem::Index(_) => {
1198                 let base_ty = Place::ty_from(place_base, proj_base, self.body, self.tcx).ty;
1199                 if let Some(def) = base_ty.ty_adt_def() {
1200                     if def.is_union() {
1201                         match self.mode {
1202                             Mode::ConstFn => {
1203                                 if !self.tcx.features().const_fn_union
1204                                     && !self.suppress_errors
1205                                 {
1206                                     self.record_error(ops::UnionAccess);
1207                                     emit_feature_err(
1208                                         &self.tcx.sess.parse_sess, sym::const_fn_union,
1209                                         self.span, GateIssue::Language,
1210                                         "unions in const fn are unstable",
1211                                     );
1212                                 }
1213                             },
1214
1215                             | Mode::NonConstFn
1216                             | Mode::Static
1217                             | Mode::StaticMut
1218                             | Mode::Const
1219                             => {},
1220                         }
1221                     }
1222                 }
1223             }
1224
1225             ProjectionElem::Downcast(..) => {
1226                 self.not_const(ops::Downcast)
1227             }
1228         }
1229     }
1230
1231     fn visit_operand(&mut self, operand: &Operand<'tcx>, location: Location) {
1232         debug!("visit_operand: operand={:?} location={:?}", operand, location);
1233         self.super_operand(operand, location);
1234
1235         match *operand {
1236             Operand::Move(ref place) => {
1237                 // Mark the consumed locals to indicate later drops are noops.
1238                 if let Some(local) = place.as_local() {
1239                     self.cx.per_local[NeedsDrop].remove(local);
1240                 }
1241             }
1242             Operand::Copy(_) |
1243             Operand::Constant(_) => {}
1244         }
1245     }
1246
1247     fn visit_rvalue(&mut self, rvalue: &Rvalue<'tcx>, location: Location) {
1248         debug!("visit_rvalue: rvalue={:?} location={:?}", rvalue, location);
1249
1250         // Check nested operands and places.
1251         if let Rvalue::Ref(_, kind, ref place) = *rvalue {
1252             // Special-case reborrows.
1253             let mut reborrow_place = None;
1254             if let &[ref proj_base @ .., elem] = place.projection.as_ref() {
1255                 if elem == ProjectionElem::Deref {
1256                     let base_ty = Place::ty_from(&place.base, proj_base, self.body, self.tcx).ty;
1257                     if let ty::Ref(..) = base_ty.kind {
1258                         reborrow_place = Some(proj_base);
1259                     }
1260                 }
1261             }
1262
1263             if let Some(proj) = reborrow_place {
1264                 let ctx = match kind {
1265                     BorrowKind::Shared => PlaceContext::NonMutatingUse(
1266                         NonMutatingUseContext::SharedBorrow,
1267                     ),
1268                     BorrowKind::Shallow => PlaceContext::NonMutatingUse(
1269                         NonMutatingUseContext::ShallowBorrow,
1270                     ),
1271                     BorrowKind::Unique => PlaceContext::NonMutatingUse(
1272                         NonMutatingUseContext::UniqueBorrow,
1273                     ),
1274                     BorrowKind::Mut { .. } => PlaceContext::MutatingUse(
1275                         MutatingUseContext::Borrow,
1276                     ),
1277                 };
1278                 self.visit_place_base(&place.base, ctx, location);
1279                 self.visit_projection(&place.base, proj, ctx, location);
1280             } else {
1281                 self.super_rvalue(rvalue, location);
1282             }
1283         } else {
1284             self.super_rvalue(rvalue, location);
1285         }
1286
1287         match *rvalue {
1288             Rvalue::Use(_) |
1289             Rvalue::Repeat(..) |
1290             Rvalue::UnaryOp(UnOp::Neg, _) |
1291             Rvalue::UnaryOp(UnOp::Not, _) |
1292             Rvalue::NullaryOp(NullOp::SizeOf, _) |
1293             Rvalue::CheckedBinaryOp(..) |
1294             Rvalue::Cast(CastKind::Pointer(_), ..) |
1295             Rvalue::Discriminant(..) |
1296             Rvalue::Len(_) |
1297             Rvalue::Ref(..) |
1298             Rvalue::Aggregate(..) => {}
1299
1300             Rvalue::Cast(CastKind::Misc, ref operand, cast_ty) => {
1301                 let operand_ty = operand.ty(self.body, self.tcx);
1302                 let cast_in = CastTy::from_ty(operand_ty).expect("bad input type for cast");
1303                 let cast_out = CastTy::from_ty(cast_ty).expect("bad output type for cast");
1304                 match (cast_in, cast_out) {
1305                     (CastTy::Ptr(_), CastTy::Int(_)) |
1306                     (CastTy::FnPtr, CastTy::Int(_)) if self.mode != Mode::NonConstFn => {
1307                         unleash_miri!(self);
1308                         if !self.tcx.features().const_raw_ptr_to_usize_cast
1309                             && !self.suppress_errors
1310                         {
1311                             // in const fn and constants require the feature gate
1312                             // FIXME: make it unsafe inside const fn and constants
1313                             self.record_error(ops::RawPtrToIntCast);
1314                             emit_feature_err(
1315                                 &self.tcx.sess.parse_sess, sym::const_raw_ptr_to_usize_cast,
1316                                 self.span, GateIssue::Language,
1317                                 &format!(
1318                                     "casting pointers to integers in {}s is unstable",
1319                                     self.mode,
1320                                 ),
1321                             );
1322                         }
1323                     }
1324                     _ => {}
1325                 }
1326             }
1327
1328             Rvalue::BinaryOp(op, ref lhs, _) => {
1329                 if let ty::RawPtr(_) | ty::FnPtr(..) = lhs.ty(self.body, self.tcx).kind {
1330                     assert!(op == BinOp::Eq || op == BinOp::Ne ||
1331                             op == BinOp::Le || op == BinOp::Lt ||
1332                             op == BinOp::Ge || op == BinOp::Gt ||
1333                             op == BinOp::Offset);
1334
1335                     unleash_miri!(self);
1336                     if self.mode.requires_const_checking() &&
1337                         !self.tcx.features().const_compare_raw_pointers &&
1338                         !self.suppress_errors
1339                     {
1340                         self.record_error(ops::RawPtrComparison);
1341                         // require the feature gate inside constants and const fn
1342                         // FIXME: make it unsafe to use these operations
1343                         emit_feature_err(
1344                             &self.tcx.sess.parse_sess,
1345                             sym::const_compare_raw_pointers,
1346                             self.span,
1347                             GateIssue::Language,
1348                             &format!("comparing raw pointers inside {}", self.mode),
1349                         );
1350                     }
1351                 }
1352             }
1353
1354             Rvalue::NullaryOp(NullOp::Box, _) => {
1355                 unleash_miri!(self);
1356                 if self.mode.requires_const_checking() && !self.suppress_errors {
1357                     self.record_error(ops::HeapAllocation);
1358                     let mut err = struct_span_err!(self.tcx.sess, self.span, E0010,
1359                                                    "allocations are not allowed in {}s", self.mode);
1360                     err.span_label(self.span, format!("allocation not allowed in {}s", self.mode));
1361                     if self.tcx.sess.teach(&err.get_code().unwrap()) {
1362                         err.note(
1363                             "The value of statics and constants must be known at compile time, \
1364                              and they live for the entire lifetime of a program. Creating a boxed \
1365                              value allocates memory on the heap at runtime, and therefore cannot \
1366                              be done at compile time."
1367                         );
1368                     }
1369                     err.emit();
1370                 }
1371             }
1372         }
1373     }
1374
1375     fn visit_terminator_kind(&mut self,
1376                              kind: &TerminatorKind<'tcx>,
1377                              location: Location) {
1378         debug!("visit_terminator_kind: kind={:?} location={:?}", kind, location);
1379         if let TerminatorKind::Call { ref func, ref args, ref destination, .. } = *kind {
1380             if let Some((ref dest, _)) = *destination {
1381                 self.assign(dest, ValueSource::Call {
1382                     callee: func,
1383                     args,
1384                     return_ty: dest.ty(self.body, self.tcx).ty,
1385                 }, location);
1386             }
1387
1388             let fn_ty = func.ty(self.body, self.tcx);
1389             let mut callee_def_id = None;
1390             let mut is_shuffle = false;
1391             match fn_ty.kind {
1392                 ty::FnDef(def_id, _) => {
1393                     callee_def_id = Some(def_id);
1394                     match self.tcx.fn_sig(def_id).abi() {
1395                         Abi::RustIntrinsic |
1396                         Abi::PlatformIntrinsic => {
1397                             assert!(!self.tcx.is_const_fn(def_id));
1398                             match &self.tcx.item_name(def_id).as_str()[..] {
1399                                 // special intrinsic that can be called diretly without an intrinsic
1400                                 // feature gate needs a language feature gate
1401                                 "transmute" => {
1402                                     if self.mode.requires_const_checking()
1403                                         && !self.suppress_errors
1404                                     {
1405                                         // const eval transmute calls only with the feature gate
1406                                         if !self.tcx.features().const_transmute {
1407                                             self.record_error(ops::Transmute);
1408                                             emit_feature_err(
1409                                                 &self.tcx.sess.parse_sess, sym::const_transmute,
1410                                                 self.span, GateIssue::Language,
1411                                                 &format!("The use of std::mem::transmute() \
1412                                                 is gated in {}s", self.mode));
1413                                         }
1414                                     }
1415                                 }
1416
1417                                 name if name.starts_with("simd_shuffle") => {
1418                                     is_shuffle = true;
1419                                 }
1420
1421                                 // no need to check feature gates, intrinsics are only callable
1422                                 // from the libstd or with forever unstable feature gates
1423                                 _ => {}
1424                             }
1425                         }
1426                         _ => {
1427                             // In normal functions no calls are feature-gated.
1428                             if self.mode.requires_const_checking() {
1429                                 let unleash_miri = self
1430                                     .tcx
1431                                     .sess
1432                                     .opts
1433                                     .debugging_opts
1434                                     .unleash_the_miri_inside_of_you;
1435                                 if self.tcx.is_const_fn(def_id)
1436                                     || unleash_miri
1437                                     || self.suppress_errors
1438                                 {
1439                                     // stable const fns or unstable const fns
1440                                     // with their feature gate active
1441                                     // FIXME(eddyb) move stability checks from `is_const_fn` here.
1442                                 } else if self.is_const_panic_fn(def_id) {
1443                                     // Check the const_panic feature gate.
1444                                     // FIXME: cannot allow this inside `allow_internal_unstable`
1445                                     // because that would make `panic!` insta stable in constants,
1446                                     // since the macro is marked with the attribute.
1447                                     if !self.tcx.features().const_panic {
1448                                         // Don't allow panics in constants without the feature gate.
1449                                         self.record_error(ops::Panic);
1450                                         emit_feature_err(
1451                                             &self.tcx.sess.parse_sess,
1452                                             sym::const_panic,
1453                                             self.span,
1454                                             GateIssue::Language,
1455                                             &format!("panicking in {}s is unstable", self.mode),
1456                                         );
1457                                     }
1458                                 } else if let Some(feature)
1459                                               = self.tcx.is_unstable_const_fn(def_id) {
1460                                     // Check `#[unstable]` const fns or `#[rustc_const_unstable]`
1461                                     // functions without the feature gate active in this crate in
1462                                     // order to report a better error message than the one below.
1463                                     if !self.span.allows_unstable(feature) {
1464                                         self.record_error(ops::FnCallUnstable(def_id, feature));
1465                                         let mut err = self.tcx.sess.struct_span_err(self.span,
1466                                             &format!("`{}` is not yet stable as a const fn",
1467                                                     self.tcx.def_path_str(def_id)));
1468                                         if nightly_options::is_nightly_build() {
1469                                             help!(&mut err,
1470                                                   "add `#![feature({})]` to the \
1471                                                    crate attributes to enable",
1472                                                   feature);
1473                                         }
1474                                         err.emit();
1475                                     }
1476                                 } else {
1477                                     self.record_error(ops::FnCallNonConst(def_id));
1478                                     let mut err = struct_span_err!(
1479                                         self.tcx.sess,
1480                                         self.span,
1481                                         E0015,
1482                                         "calls in {}s are limited to constant functions, \
1483                                          tuple structs and tuple variants",
1484                                         self.mode,
1485                                     );
1486                                     err.emit();
1487                                 }
1488                             }
1489                         }
1490                     }
1491                 }
1492                 ty::FnPtr(_) => {
1493                     unleash_miri!(self);
1494                     if self.mode.requires_const_checking() && !self.suppress_errors {
1495                         self.record_error(ops::FnCallIndirect);
1496                         let mut err = self.tcx.sess.struct_span_err(
1497                             self.span,
1498                             "function pointers are not allowed in const fn"
1499                         );
1500                         err.emit();
1501                     }
1502                 }
1503                 _ => {
1504                     self.not_const(ops::FnCallOther);
1505                 }
1506             }
1507
1508             // No need to do anything in constants and statics, as everything is "constant" anyway
1509             // so promotion would be useless.
1510             if self.mode != Mode::Static && self.mode != Mode::Const {
1511                 let constant_args = callee_def_id.and_then(|id| {
1512                     args_required_const(self.tcx, id)
1513                 }).unwrap_or_default();
1514                 for (i, arg) in args.iter().enumerate() {
1515                     if !(is_shuffle && i == 2 || constant_args.contains(&i)) {
1516                         continue;
1517                     }
1518
1519                     let candidate = Candidate::Argument { bb: location.block, index: i };
1520                     // Since the argument is required to be constant,
1521                     // we care about constness, not promotability.
1522                     // If we checked for promotability, we'd miss out on
1523                     // the results of function calls (which are never promoted
1524                     // in runtime code).
1525                     // This is not a problem, because the argument explicitly
1526                     // requests constness, in contrast to regular promotion
1527                     // which happens even without the user requesting it.
1528                     // We can error out with a hard error if the argument is not
1529                     // constant here.
1530                     if !IsNotPromotable::in_operand(self, arg) {
1531                         debug!("visit_terminator_kind: candidate={:?}", candidate);
1532                         self.promotion_candidates.push(candidate);
1533                     } else {
1534                         if is_shuffle {
1535                             span_err!(self.tcx.sess, self.span, E0526,
1536                                       "shuffle indices are not constant");
1537                         } else {
1538                             self.tcx.sess.span_err(self.span,
1539                                 &format!("argument {} is required to be a constant",
1540                                          i + 1));
1541                         }
1542                     }
1543                 }
1544             }
1545
1546             // Check callee and argument operands.
1547             self.visit_operand(func, location);
1548             for arg in args {
1549                 self.visit_operand(arg, location);
1550             }
1551         } else if let TerminatorKind::Drop {
1552             location: ref place, ..
1553         } | TerminatorKind::DropAndReplace {
1554             location: ref place, ..
1555         } = *kind {
1556             match *kind {
1557                 TerminatorKind::DropAndReplace { .. } => {}
1558                 _ => self.super_terminator_kind(kind, location),
1559             }
1560
1561             // Deny *any* live drops anywhere other than functions.
1562             if self.mode.requires_const_checking() && !self.suppress_errors {
1563                 unleash_miri!(self);
1564                 // HACK(eddyb): emulate a bit of dataflow analysis,
1565                 // conservatively, that drop elaboration will do.
1566                 let needs_drop = if let Some(local) = place.as_local() {
1567                     if NeedsDrop::in_local(self, local) {
1568                         Some(self.body.local_decls[local].source_info.span)
1569                     } else {
1570                         None
1571                     }
1572                 } else {
1573                     Some(self.span)
1574                 };
1575
1576                 if let Some(span) = needs_drop {
1577                     // Double-check the type being dropped, to minimize false positives.
1578                     let ty = place.ty(self.body, self.tcx).ty;
1579                     if ty.needs_drop(self.tcx, self.param_env) {
1580                         self.record_error_spanned(ops::LiveDrop, span);
1581                         struct_span_err!(self.tcx.sess, span, E0493,
1582                                          "destructors cannot be evaluated at compile-time")
1583                             .span_label(span, format!("{}s cannot evaluate destructors",
1584                                                       self.mode))
1585                             .emit();
1586                     }
1587                 }
1588             }
1589
1590             match *kind {
1591                 TerminatorKind::DropAndReplace { ref value, .. } => {
1592                     self.assign(place, ValueSource::DropAndReplace(value), location);
1593                     self.visit_operand(value, location);
1594                 }
1595                 _ => {}
1596             }
1597         } else {
1598             // Qualify any operands inside other terminators.
1599             self.super_terminator_kind(kind, location);
1600         }
1601     }
1602
1603     fn visit_assign(&mut self,
1604                     dest: &Place<'tcx>,
1605                     rvalue: &Rvalue<'tcx>,
1606                     location: Location) {
1607         debug!("visit_assign: dest={:?} rvalue={:?} location={:?}", dest, rvalue, location);
1608         self.assign(dest, ValueSource::Rvalue(rvalue), location);
1609
1610         self.visit_rvalue(rvalue, location);
1611     }
1612
1613     fn visit_source_info(&mut self, source_info: &SourceInfo) {
1614         debug!("visit_source_info: source_info={:?}", source_info);
1615         self.span = source_info.span;
1616     }
1617
1618     fn visit_statement(&mut self, statement: &Statement<'tcx>, location: Location) {
1619         debug!("visit_statement: statement={:?} location={:?}", statement, location);
1620         match statement.kind {
1621             StatementKind::Assign(..) => {
1622                 self.super_statement(statement, location);
1623             }
1624             StatementKind::FakeRead(FakeReadCause::ForMatchedPlace, _) => {
1625                 self.not_const(ops::IfOrMatch);
1626             }
1627             // FIXME(eddyb) should these really do nothing?
1628             StatementKind::FakeRead(..) |
1629             StatementKind::SetDiscriminant { .. } |
1630             StatementKind::StorageLive(_) |
1631             StatementKind::StorageDead(_) |
1632             StatementKind::InlineAsm {..} |
1633             StatementKind::Retag { .. } |
1634             StatementKind::AscribeUserType(..) |
1635             StatementKind::Nop => {}
1636         }
1637     }
1638 }
1639
1640 pub fn provide(providers: &mut Providers<'_>) {
1641     *providers = Providers {
1642         mir_const_qualif,
1643         ..*providers
1644     };
1645 }
1646
1647 fn mir_const_qualif(tcx: TyCtxt<'_>, def_id: DefId) -> (u8, &BitSet<Local>) {
1648     // N.B., this `borrow()` is guaranteed to be valid (i.e., the value
1649     // cannot yet be stolen), because `mir_validated()`, which steals
1650     // from `mir_const(), forces this query to execute before
1651     // performing the steal.
1652     let body = &tcx.mir_const(def_id).borrow();
1653
1654     if body.return_ty().references_error() {
1655         tcx.sess.delay_span_bug(body.span, "mir_const_qualif: MIR had errors");
1656         return (1 << IsNotPromotable::IDX, tcx.arena.alloc(BitSet::new_empty(0)));
1657     }
1658
1659     Checker::new(tcx, def_id, body, Mode::Const).check_const()
1660 }
1661
1662 pub struct QualifyAndPromoteConstants<'tcx> {
1663     pub promoted: Cell<IndexVec<Promoted, Body<'tcx>>>,
1664 }
1665
1666 impl<'tcx> Default for QualifyAndPromoteConstants<'tcx> {
1667     fn default() -> Self {
1668         QualifyAndPromoteConstants {
1669             promoted: Cell::new(IndexVec::new()),
1670         }
1671     }
1672 }
1673
1674 impl<'tcx> MirPass<'tcx> for QualifyAndPromoteConstants<'tcx> {
1675     fn run_pass(&self, tcx: TyCtxt<'tcx>, src: MirSource<'tcx>, body: &mut Body<'tcx>) {
1676         // There's not really any point in promoting errorful MIR.
1677         if body.return_ty().references_error() {
1678             tcx.sess.delay_span_bug(body.span, "QualifyAndPromoteConstants: MIR had errors");
1679             return;
1680         }
1681
1682         if src.promoted.is_some() {
1683             return;
1684         }
1685
1686         let def_id = src.def_id();
1687         let hir_id = tcx.hir().as_local_hir_id(def_id).unwrap();
1688
1689         let mode = determine_mode(tcx, hir_id, def_id);
1690
1691         debug!("run_pass: mode={:?}", mode);
1692         if let Mode::NonConstFn | Mode::ConstFn = mode {
1693             // This is ugly because Checker holds onto mir,
1694             // which can't be mutated until its scope ends.
1695             let (temps, candidates) = {
1696                 let mut checker = Checker::new(tcx, def_id, body, mode);
1697                 if let Mode::ConstFn = mode {
1698                     if tcx.sess.opts.debugging_opts.unleash_the_miri_inside_of_you {
1699                         checker.check_const();
1700                     } else if tcx.is_min_const_fn(def_id) {
1701                         // Enforce `min_const_fn` for stable `const fn`s.
1702                         use super::qualify_min_const_fn::is_min_const_fn;
1703                         if let Err((span, err)) = is_min_const_fn(tcx, def_id, body) {
1704                             error_min_const_fn_violation(tcx, span, err);
1705                         } else {
1706                             // this should not produce any errors, but better safe than sorry
1707                             // FIXME(#53819)
1708                             checker.check_const();
1709                         }
1710                     } else {
1711                         // Enforce a constant-like CFG for `const fn`.
1712                         checker.check_const();
1713                     }
1714                 } else {
1715                     while let Some((bb, data)) = checker.rpo.next() {
1716                         checker.visit_basic_block_data(bb, data);
1717                     }
1718                 }
1719
1720                 (checker.temp_promotion_state, checker.promotion_candidates)
1721             };
1722
1723             // Do the actual promotion, now that we know what's viable.
1724             self.promoted.set(
1725                 promote_consts::promote_candidates(def_id, body, tcx, temps, candidates)
1726             );
1727         } else {
1728             check_short_circuiting_in_const_local(tcx, body, mode);
1729
1730             let promoted_temps = match mode {
1731                 Mode::Const => tcx.mir_const_qualif(def_id).1,
1732                 _ => Checker::new(tcx, def_id, body, mode).check_const().1,
1733             };
1734             remove_drop_and_storage_dead_on_promoted_locals(body, promoted_temps);
1735         }
1736
1737         if mode == Mode::Static && !tcx.has_attr(def_id, sym::thread_local) {
1738             // `static`s (not `static mut`s) which are not `#[thread_local]` must be `Sync`.
1739             check_static_is_sync(tcx, body, hir_id);
1740         }
1741     }
1742 }
1743
1744 fn determine_mode(tcx: TyCtxt<'_>, hir_id: HirId, def_id: DefId) -> Mode {
1745     match tcx.hir().body_owner_kind(hir_id) {
1746         hir::BodyOwnerKind::Closure => Mode::NonConstFn,
1747         hir::BodyOwnerKind::Fn if tcx.is_const_fn(def_id) => Mode::ConstFn,
1748         hir::BodyOwnerKind::Fn => Mode::NonConstFn,
1749         hir::BodyOwnerKind::Const => Mode::Const,
1750         hir::BodyOwnerKind::Static(hir::MutImmutable) => Mode::Static,
1751         hir::BodyOwnerKind::Static(hir::MutMutable) => Mode::StaticMut,
1752     }
1753 }
1754
1755 fn error_min_const_fn_violation(tcx: TyCtxt<'_>, span: Span, msg: Cow<'_, str>) {
1756     struct_span_err!(tcx.sess, span, E0723, "{}", msg)
1757         .note("for more information, see issue https://github.com/rust-lang/rust/issues/57563")
1758         .help("add `#![feature(const_fn)]` to the crate attributes to enable")
1759         .emit();
1760 }
1761
1762 fn check_short_circuiting_in_const_local(tcx: TyCtxt<'_>, body: &mut Body<'tcx>, mode: Mode) {
1763     if body.control_flow_destroyed.is_empty() {
1764         return;
1765     }
1766
1767     let mut locals = body.vars_iter();
1768     if let Some(local) = locals.next() {
1769         let span = body.local_decls[local].source_info.span;
1770         let mut error = tcx.sess.struct_span_err(
1771             span,
1772             &format!(
1773                 "new features like let bindings are not permitted in {}s \
1774                 which also use short circuiting operators",
1775                 mode,
1776             ),
1777         );
1778         for (span, kind) in body.control_flow_destroyed.iter() {
1779             error.span_note(
1780                 *span,
1781                 &format!("use of {} here does not actually short circuit due to \
1782                 the const evaluator presently not being able to do control flow. \
1783                 See https://github.com/rust-lang/rust/issues/49146 for more \
1784                 information.", kind),
1785             );
1786         }
1787         for local in locals {
1788             let span = body.local_decls[local].source_info.span;
1789             error.span_note(span, "more locals defined here");
1790         }
1791         error.emit();
1792     }
1793 }
1794
1795 /// In `const` and `static` everything without `StorageDead`
1796 /// is `'static`, we don't have to create promoted MIR fragments,
1797 /// just remove `Drop` and `StorageDead` on "promoted" locals.
1798 fn remove_drop_and_storage_dead_on_promoted_locals(
1799     body: &mut Body<'tcx>,
1800     promoted_temps: &BitSet<Local>,
1801 ) {
1802     debug!("run_pass: promoted_temps={:?}", promoted_temps);
1803
1804     for block in body.basic_blocks_mut() {
1805         block.statements.retain(|statement| {
1806             match statement.kind {
1807                 StatementKind::StorageDead(index) => !promoted_temps.contains(index),
1808                 _ => true
1809             }
1810         });
1811         let terminator = block.terminator_mut();
1812         match &terminator.kind {
1813             TerminatorKind::Drop {
1814                 location,
1815                 target,
1816                 ..
1817             } => {
1818                 if let Some(index) = location.as_local() {
1819                     if promoted_temps.contains(index) {
1820                         terminator.kind = TerminatorKind::Goto { target: *target };
1821                     }
1822                 }
1823             }
1824             _ => {}
1825         }
1826     }
1827 }
1828
1829 fn check_static_is_sync(tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>, hir_id: HirId) {
1830     let ty = body.return_ty();
1831     tcx.infer_ctxt().enter(|infcx| {
1832         let cause = traits::ObligationCause::new(body.span, hir_id, traits::SharedStatic);
1833         let mut fulfillment_cx = traits::FulfillmentContext::new();
1834         let sync_def_id = tcx.require_lang_item(lang_items::SyncTraitLangItem, Some(body.span));
1835         fulfillment_cx.register_bound(&infcx, ty::ParamEnv::empty(), ty, sync_def_id, cause);
1836         if let Err(err) = fulfillment_cx.select_all_or_error(&infcx) {
1837             infcx.report_fulfillment_errors(&err, None, false);
1838         }
1839     });
1840 }
1841
1842 fn args_required_const(tcx: TyCtxt<'_>, def_id: DefId) -> Option<FxHashSet<usize>> {
1843     let attrs = tcx.get_attrs(def_id);
1844     let attr = attrs.iter().find(|a| a.check_name(sym::rustc_args_required_const))?;
1845     let mut ret = FxHashSet::default();
1846     for meta in attr.meta_item_list()? {
1847         match meta.literal()?.kind {
1848             LitKind::Int(a, _) => { ret.insert(a as usize); }
1849             _ => return None,
1850         }
1851     }
1852     Some(ret)
1853 }
1854
1855 fn validator_mismatch(
1856     tcx: TyCtxt<'tcx>,
1857     body: &Body<'tcx>,
1858     mut old_errors: Vec<(Span, String)>,
1859     mut new_errors: Vec<(Span, String)>,
1860 ) {
1861     error!("old validator: {:?}", old_errors);
1862     error!("new validator: {:?}", new_errors);
1863
1864     // ICE on nightly if the validators do not emit exactly the same errors.
1865     // Users can supress this panic with an unstable compiler flag (hopefully after
1866     // filing an issue).
1867     let opts = &tcx.sess.opts;
1868     let strict_validation_enabled = opts.unstable_features.is_nightly_build()
1869         && !opts.debugging_opts.suppress_const_validation_back_compat_ice;
1870
1871     if !strict_validation_enabled {
1872         return;
1873     }
1874
1875     // If this difference would cause a regression from the old to the new or vice versa, trigger
1876     // the ICE.
1877     if old_errors.is_empty() || new_errors.is_empty() {
1878         span_bug!(body.span, "{}", VALIDATOR_MISMATCH_ERR);
1879     }
1880
1881     // HACK: Borrows that would allow mutation are forbidden in const contexts, but they cause the
1882     // new validator to be more conservative about when a dropped local has been moved out of.
1883     //
1884     // Supress the mismatch ICE in cases where the validators disagree only on the number of
1885     // `LiveDrop` errors and both observe the same sequence of `MutBorrow`s.
1886
1887     let is_live_drop = |(_, s): &mut (_, String)| s.starts_with("LiveDrop");
1888     let is_mut_borrow = |(_, s): &&(_, String)| s.starts_with("MutBorrow");
1889
1890     let old_live_drops: Vec<_> = old_errors.drain_filter(is_live_drop).collect();
1891     let new_live_drops: Vec<_> = new_errors.drain_filter(is_live_drop).collect();
1892
1893     let only_live_drops_differ = old_live_drops != new_live_drops && old_errors == new_errors;
1894
1895     let old_mut_borrows = old_errors.iter().filter(is_mut_borrow);
1896     let new_mut_borrows = new_errors.iter().filter(is_mut_borrow);
1897
1898     let at_least_one_mut_borrow = old_mut_borrows.clone().next().is_some();
1899
1900     if only_live_drops_differ && at_least_one_mut_borrow && old_mut_borrows.eq(new_mut_borrows) {
1901         return;
1902     }
1903
1904     span_bug!(body.span, "{}", VALIDATOR_MISMATCH_ERR);
1905 }
1906
1907 const VALIDATOR_MISMATCH_ERR: &str =
1908     r"Disagreement between legacy and dataflow-based const validators.
1909     After filing an issue, use `-Zsuppress-const-validation-back-compat-ice` to compile your code.";