src/librustc_mir/transform/promote_consts.rs

   1 //! A pass that promotes borrows of constant rvalues.
   2 //!
   3 //! The rvalues considered constant are trees of temps,
   4 //! each with exactly one initialization, and holding
   5 //! a constant value with no interior mutability.
   6 //! They are placed into a new MIR constant body in
   7 //! `promoted` and the borrow rvalue is replaced with
   8 //! a `Literal::Promoted` using the index into `promoted`
   9 //! of that constant MIR.
  10 //!
  11 //! This pass assumes that every use is dominated by an
  12 //! initialization and can otherwise silence errors, if
  13 //! move analysis runs after promotion on broken MIR.
  14
  15 use rustc::mir::traversal::ReversePostorder;
  16 use rustc::mir::visit::{MutVisitor, MutatingUseContext, PlaceContext, Visitor};
  17 use rustc::mir::*;
  18 use rustc::ty::cast::CastTy;
  19 use rustc::ty::subst::InternalSubsts;
  20 use rustc::ty::{self, List, TyCtxt, TypeFoldable};
  21 use rustc_ast::ast::LitKind;
  22 use rustc_hir::def_id::DefId;
  23 use rustc_span::symbol::sym;
  24 use rustc_span::{Span, DUMMY_SP};
  25
  26 use rustc_index::vec::{Idx, IndexVec};
  27 use rustc_target::spec::abi::Abi;
  28
  29 use std::cell::Cell;
  30 use std::{cmp, iter, mem, usize};
  31
  32 use crate::const_eval::{is_const_fn, is_unstable_const_fn};
  33 use crate::transform::check_consts::{is_lang_panic_fn, qualifs, ConstKind, Item};
  34 use crate::transform::{MirPass, MirSource};
  35
  36 /// A `MirPass` for promotion.
  37 ///
  38 /// Promotion is the extraction of promotable temps into separate MIR bodies. This pass also emits
  39 /// errors when promotion of `#[rustc_args_required_const]` arguments fails.
  40 ///
  41 /// After this pass is run, `promoted_fragments` will hold the MIR body corresponding to each
  42 /// newly created `Constant`.
  43 #[derive(Default)]
  44 pub struct PromoteTemps<'tcx> {
  45     pub promoted_fragments: Cell<IndexVec<Promoted, BodyAndCache<'tcx>>>,
  46 }
  47
  48 impl<'tcx> MirPass<'tcx> for PromoteTemps<'tcx> {
  49     fn run_pass(&self, tcx: TyCtxt<'tcx>, src: MirSource<'tcx>, body: &mut BodyAndCache<'tcx>) {
  50         // There's not really any point in promoting errorful MIR.
  51         //
  52         // This does not include MIR that failed const-checking, which we still try to promote.
  53         if body.return_ty().references_error() {
  54             tcx.sess.delay_span_bug(body.span, "PromoteTemps: MIR had errors");
  55             return;
  56         }
  57
  58         if src.promoted.is_some() {
  59             return;
  60         }
  61
  62         let def_id = src.def_id();
  63
  64         let mut rpo = traversal::reverse_postorder(body);
  65         let (temps, all_candidates) = collect_temps_and_candidates(tcx, body, &mut rpo);
  66
  67         let promotable_candidates =
  68             validate_candidates(tcx, read_only!(body), def_id, &temps, &all_candidates);
  69
  70         let promoted = promote_candidates(def_id, body, tcx, temps, promotable_candidates);
  71         self.promoted_fragments.set(promoted);
  72     }
  73 }
  74
  75 /// State of a temporary during collection and promotion.
  76 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
  77 pub enum TempState {
  78     /// No references to this temp.
  79     Undefined,
  80     /// One direct assignment and any number of direct uses.
  81     /// A borrow of this temp is promotable if the assigned
  82     /// value is qualified as constant.
  83     Defined { location: Location, uses: usize },
  84     /// Any other combination of assignments/uses.
  85     Unpromotable,
  86     /// This temp was part of an rvalue which got extracted
  87     /// during promotion and needs cleanup.
  88     PromotedOut,
  89 }
  90
  91 impl TempState {
  92     pub fn is_promotable(&self) -> bool {
  93         debug!("is_promotable: self={:?}", self);
  94         if let TempState::Defined { .. } = *self { true } else { false }
  95     }
  96 }
  97
  98 /// A "root candidate" for promotion, which will become the
  99 /// returned value in a promoted MIR, unless it's a subset
 100 /// of a larger candidate.
 101 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
 102 pub enum Candidate {
 103     /// Borrow of a constant temporary.
 104     Ref(Location),
 105
 106     /// Promotion of the `x` in `[x; 32]`.
 107     Repeat(Location),
 108
 109     /// Currently applied to function calls where the callee has the unstable
 110     /// `#[rustc_args_required_const]` attribute as well as the SIMD shuffle
 111     /// intrinsic. The intrinsic requires the arguments are indeed constant and
 112     /// the attribute currently provides the semantic requirement that arguments
 113     /// must be constant.
 114     Argument { bb: BasicBlock, index: usize },
 115 }
 116
 117 impl Candidate {
 118     /// Returns `true` if we should use the "explicit" rules for promotability for this `Candidate`.
 119     fn forces_explicit_promotion(&self) -> bool {
 120         match self {
 121             Candidate::Ref(_) | Candidate::Repeat(_) => false,
 122             Candidate::Argument { .. } => true,
 123         }
 124     }
 125 }
 126
 127 fn args_required_const(tcx: TyCtxt<'_>, def_id: DefId) -> Option<Vec<usize>> {
 128     let attrs = tcx.get_attrs(def_id);
 129     let attr = attrs.iter().find(|a| a.check_name(sym::rustc_args_required_const))?;
 130     let mut ret = vec![];
 131     for meta in attr.meta_item_list()? {
 132         match meta.literal()?.kind {
 133             LitKind::Int(a, _) => {
 134                 ret.push(a as usize);
 135             }
 136             _ => return None,
 137         }
 138     }
 139     Some(ret)
 140 }
 141
 142 struct Collector<'a, 'tcx> {
 143     tcx: TyCtxt<'tcx>,
 144     body: &'a Body<'tcx>,
 145     temps: IndexVec<Local, TempState>,
 146     candidates: Vec<Candidate>,
 147     span: Span,
 148 }
 149
 150 impl<'tcx> Visitor<'tcx> for Collector<'_, 'tcx> {
 151     fn visit_local(&mut self, &index: &Local, context: PlaceContext, location: Location) {
 152         debug!("visit_local: index={:?} context={:?} location={:?}", index, context, location);
 153         // We're only interested in temporaries and the return place
 154         match self.body.local_kind(index) {
 155             LocalKind::Temp | LocalKind::ReturnPointer => {}
 156             LocalKind::Arg | LocalKind::Var => return,
 157         }
 158
 159         // Ignore drops, if the temp gets promoted,
 160         // then it's constant and thus drop is noop.
 161         // Non-uses are also irrelevant.
 162         if context.is_drop() || !context.is_use() {
 163             debug!(
 164                 "visit_local: context.is_drop={:?} context.is_use={:?}",
 165                 context.is_drop(),
 166                 context.is_use(),
 167             );
 168             return;
 169         }
 170
 171         let temp = &mut self.temps[index];
 172         debug!("visit_local: temp={:?}", temp);
 173         if *temp == TempState::Undefined {
 174             match context {
 175                 PlaceContext::MutatingUse(MutatingUseContext::Store)
 176                 | PlaceContext::MutatingUse(MutatingUseContext::Call) => {
 177                     *temp = TempState::Defined { location, uses: 0 };
 178                     return;
 179                 }
 180                 _ => { /* mark as unpromotable below */ }
 181             }
 182         } else if let TempState::Defined { ref mut uses, .. } = *temp {
 183             // We always allow borrows, even mutable ones, as we need
 184             // to promote mutable borrows of some ZSTs e.g., `&mut []`.
 185             let allowed_use = match context {
 186                 PlaceContext::MutatingUse(MutatingUseContext::Borrow)
 187                 | PlaceContext::NonMutatingUse(_) => true,
 188                 PlaceContext::MutatingUse(_) | PlaceContext::NonUse(_) => false,
 189             };
 190             debug!("visit_local: allowed_use={:?}", allowed_use);
 191             if allowed_use {
 192                 *uses += 1;
 193                 return;
 194             }
 195             /* mark as unpromotable below */
 196         }
 197         *temp = TempState::Unpromotable;
 198     }
 199
 200     fn visit_rvalue(&mut self, rvalue: &Rvalue<'tcx>, location: Location) {
 201         self.super_rvalue(rvalue, location);
 202
 203         match *rvalue {
 204             Rvalue::Ref(..) => {
 205                 self.candidates.push(Candidate::Ref(location));
 206             }
 207             Rvalue::Repeat(..) if self.tcx.features().const_in_array_repeat_expressions => {
 208                 // FIXME(#49147) only promote the element when it isn't `Copy`
 209                 // (so that code that can copy it at runtime is unaffected).
 210                 self.candidates.push(Candidate::Repeat(location));
 211             }
 212             _ => {}
 213         }
 214     }
 215
 216     fn visit_terminator_kind(&mut self, kind: &TerminatorKind<'tcx>, location: Location) {
 217         self.super_terminator_kind(kind, location);
 218
 219         if let TerminatorKind::Call { ref func, .. } = *kind {
 220             if let ty::FnDef(def_id, _) = func.ty(self.body, self.tcx).kind {
 221                 let fn_sig = self.tcx.fn_sig(def_id);
 222                 if let Abi::RustIntrinsic | Abi::PlatformIntrinsic = fn_sig.abi() {
 223                     let name = self.tcx.item_name(def_id);
 224                     // FIXME(eddyb) use `#[rustc_args_required_const(2)]` for shuffles.
 225                     if name.as_str().starts_with("simd_shuffle") {
 226                         self.candidates.push(Candidate::Argument { bb: location.block, index: 2 });
 227
 228                         return; // Don't double count `simd_shuffle` candidates
 229                     }
 230                 }
 231
 232                 if let Some(constant_args) = args_required_const(self.tcx, def_id) {
 233                     for index in constant_args {
 234                         self.candidates.push(Candidate::Argument { bb: location.block, index });
 235                     }
 236                 }
 237             }
 238         }
 239     }
 240
 241     fn visit_source_info(&mut self, source_info: &SourceInfo) {
 242         self.span = source_info.span;
 243     }
 244 }
 245
 246 pub fn collect_temps_and_candidates(
 247     tcx: TyCtxt<'tcx>,
 248     body: &Body<'tcx>,
 249     rpo: &mut ReversePostorder<'_, 'tcx>,
 250 ) -> (IndexVec<Local, TempState>, Vec<Candidate>) {
 251     let mut collector = Collector {
 252         tcx,
 253         body,
 254         temps: IndexVec::from_elem(TempState::Undefined, &body.local_decls),
 255         candidates: vec![],
 256         span: body.span,
 257     };
 258     for (bb, data) in rpo {
 259         collector.visit_basic_block_data(bb, data);
 260     }
 261     (collector.temps, collector.candidates)
 262 }
 263
 264 /// Checks whether locals that appear in a promotion context (`Candidate`) are actually promotable.
 265 ///
 266 /// This wraps an `Item`, and has access to all fields of that `Item` via `Deref` coercion.
 267 struct Validator<'a, 'tcx> {
 268     item: Item<'a, 'tcx>,
 269     temps: &'a IndexVec<Local, TempState>,
 270
 271     /// Explicit promotion happens e.g. for constant arguments declared via
 272     /// `rustc_args_required_const`.
 273     /// Implicit promotion has almost the same rules, except that disallows `const fn`
 274     /// except for those marked `#[rustc_promotable]`. This is to avoid changing
 275     /// a legitimate run-time operation into a failing compile-time operation
 276     /// e.g. due to addresses being compared inside the function.
 277     explicit: bool,
 278 }
 279
 280 impl std::ops::Deref for Validator<'a, 'tcx> {
 281     type Target = Item<'a, 'tcx>;
 282
 283     fn deref(&self) -> &Self::Target {
 284         &self.item
 285     }
 286 }
 287
 288 struct Unpromotable;
 289
 290 impl<'tcx> Validator<'_, 'tcx> {
 291     fn validate_candidate(&self, candidate: Candidate) -> Result<(), Unpromotable> {
 292         match candidate {
 293             Candidate::Ref(loc) => {
 294                 assert!(!self.explicit);
 295
 296                 let statement = &self.body[loc.block].statements[loc.statement_index];
 297                 match &statement.kind {
 298                     StatementKind::Assign(box (_, Rvalue::Ref(_, kind, place))) => {
 299                         match kind {
 300                             BorrowKind::Shared | BorrowKind::Mut { .. } => {}
 301
 302                             // FIXME(eddyb) these aren't promoted here but *could*
 303                             // be promoted as part of a larger value because
 304                             // `validate_rvalue`  doesn't check them, need to
 305                             // figure out what is the intended behavior.
 306                             BorrowKind::Shallow | BorrowKind::Unique => return Err(Unpromotable),
 307                         }
 308
 309                         // We can only promote interior borrows of promotable temps (non-temps
 310                         // don't get promoted anyway).
 311                         self.validate_local(place.local)?;
 312
 313                         if place.projection.contains(&ProjectionElem::Deref) {
 314                             return Err(Unpromotable);
 315                         }
 316
 317                         let mut has_mut_interior =
 318                             self.qualif_local::<qualifs::HasMutInterior>(place.local);
 319                         // HACK(eddyb) this should compute the same thing as
 320                         // `<HasMutInterior as Qualif>::in_projection` from
 321                         // `check_consts::qualifs` but without recursion.
 322                         if has_mut_interior {
 323                             // This allows borrowing fields which don't have
 324                             // `HasMutInterior`, from a type that does, e.g.:
 325                             // `let _: &'static _ = &(Cell::new(1), 2).1;`
 326                             let mut place_projection = &place.projection[..];
 327                             // FIXME(eddyb) use a forward loop instead of a reverse one.
 328                             while let [proj_base @ .., elem] = place_projection {
 329                                 // FIXME(eddyb) this is probably excessive, with
 330                                 // the exception of `union` member accesses.
 331                                 let ty =
 332                                     Place::ty_from(place.local, proj_base, *self.body, self.tcx)
 333                                         .projection_ty(self.tcx, elem)
 334                                         .ty;
 335                                 if ty.is_freeze(self.tcx, self.param_env, DUMMY_SP) {
 336                                     has_mut_interior = false;
 337                                     break;
 338                                 }
 339
 340                                 place_projection = proj_base;
 341                             }
 342                         }
 343
 344                         // FIXME(eddyb) this duplicates part of `validate_rvalue`.
 345                         if has_mut_interior {
 346                             return Err(Unpromotable);
 347                         }
 348                         if self.qualif_local::<qualifs::NeedsDrop>(place.local) {
 349                             return Err(Unpromotable);
 350                         }
 351
 352                         if let BorrowKind::Mut { .. } = kind {
 353                             let ty = place.ty(*self.body, self.tcx).ty;
 354
 355                             // In theory, any zero-sized value could be borrowed
 356                             // mutably without consequences. However, only &mut []
 357                             // is allowed right now, and only in functions.
 358                             if self.const_kind == Some(ConstKind::StaticMut) {
 359                                 // Inside a `static mut`, &mut [...] is also allowed.
 360                                 match ty.kind {
 361                                     ty::Array(..) | ty::Slice(_) => {}
 362                                     _ => return Err(Unpromotable),
 363                                 }
 364                             } else if let ty::Array(_, len) = ty.kind {
 365                                 // FIXME(eddyb) the `self.is_non_const_fn` condition
 366                                 // seems unnecessary, given that this is merely a ZST.
 367                                 match len.try_eval_usize(self.tcx, self.param_env) {
 368                                     Some(0) if self.const_kind.is_none() => {}
 369                                     _ => return Err(Unpromotable),
 370                                 }
 371                             } else {
 372                                 return Err(Unpromotable);
 373                             }
 374                         }
 375
 376                         Ok(())
 377                     }
 378                     _ => bug!(),
 379                 }
 380             }
 381             Candidate::Repeat(loc) => {
 382                 assert!(!self.explicit);
 383
 384                 let statement = &self.body[loc.block].statements[loc.statement_index];
 385                 match &statement.kind {
 386                     StatementKind::Assign(box (_, Rvalue::Repeat(ref operand, _))) => {
 387                         if !self.tcx.features().const_in_array_repeat_expressions {
 388                             return Err(Unpromotable);
 389                         }
 390
 391                         self.validate_operand(operand)
 392                     }
 393                     _ => bug!(),
 394                 }
 395             }
 396             Candidate::Argument { bb, index } => {
 397                 assert!(self.explicit);
 398
 399                 let terminator = self.body[bb].terminator();
 400                 match &terminator.kind {
 401                     TerminatorKind::Call { args, .. } => self.validate_operand(&args[index]),
 402                     _ => bug!(),
 403                 }
 404             }
 405         }
 406     }
 407
 408     // FIXME(eddyb) maybe cache this?
 409     fn qualif_local<Q: qualifs::Qualif>(&self, local: Local) -> bool {
 410         let per_local = &mut |l| self.qualif_local::<Q>(l);
 411
 412         if let TempState::Defined { location: loc, .. } = self.temps[local] {
 413             let num_stmts = self.body[loc.block].statements.len();
 414
 415             if loc.statement_index < num_stmts {
 416                 let statement = &self.body[loc.block].statements[loc.statement_index];
 417                 match &statement.kind {
 418                     StatementKind::Assign(box (_, rhs)) => Q::in_rvalue(&self.item, per_local, rhs),
 419                     _ => {
 420                         span_bug!(
 421                             statement.source_info.span,
 422                             "{:?} is not an assignment",
 423                             statement
 424                         );
 425                     }
 426                 }
 427             } else {
 428                 let terminator = self.body[loc.block].terminator();
 429                 match &terminator.kind {
 430                     TerminatorKind::Call { func, args, .. } => {
 431                         let return_ty = self.body.local_decls[local].ty;
 432                         Q::in_call(&self.item, per_local, func, args, return_ty)
 433                     }
 434                     kind => {
 435                         span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 436                     }
 437                 }
 438             }
 439         } else {
 440             let span = self.body.local_decls[local].source_info.span;
 441             span_bug!(span, "{:?} not promotable, qualif_local shouldn't have been called", local);
 442         }
 443     }
 444
 445     // FIXME(eddyb) maybe cache this?
 446     fn validate_local(&self, local: Local) -> Result<(), Unpromotable> {
 447         if let TempState::Defined { location: loc, .. } = self.temps[local] {
 448             let num_stmts = self.body[loc.block].statements.len();
 449
 450             if loc.statement_index < num_stmts {
 451                 let statement = &self.body[loc.block].statements[loc.statement_index];
 452                 match &statement.kind {
 453                     StatementKind::Assign(box (_, rhs)) => self.validate_rvalue(rhs),
 454                     _ => {
 455                         span_bug!(
 456                             statement.source_info.span,
 457                             "{:?} is not an assignment",
 458                             statement
 459                         );
 460                     }
 461                 }
 462             } else {
 463                 let terminator = self.body[loc.block].terminator();
 464                 match &terminator.kind {
 465                     TerminatorKind::Call { func, args, .. } => self.validate_call(func, args),
 466                     TerminatorKind::Yield { .. } => Err(Unpromotable),
 467                     kind => {
 468                         span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 469                     }
 470                 }
 471             }
 472         } else {
 473             Err(Unpromotable)
 474         }
 475     }
 476
 477     fn validate_place(&self, place: PlaceRef<'_, 'tcx>) -> Result<(), Unpromotable> {
 478         match place {
 479             PlaceRef { local, projection: [] } => self.validate_local(local),
 480             PlaceRef { local: _, projection: [proj_base @ .., elem] } => {
 481                 match *elem {
 482                     ProjectionElem::Deref | ProjectionElem::Downcast(..) => {
 483                         return Err(Unpromotable);
 484                     }
 485
 486                     ProjectionElem::ConstantIndex { .. } | ProjectionElem::Subslice { .. } => {}
 487
 488                     ProjectionElem::Index(local) => {
 489                         self.validate_local(local)?;
 490                     }
 491
 492                     ProjectionElem::Field(..) => {
 493                         if self.const_kind.is_none() {
 494                             let base_ty =
 495                                 Place::ty_from(place.local, proj_base, *self.body, self.tcx).ty;
 496                             if let Some(def) = base_ty.ty_adt_def() {
 497                                 // No promotion of union field accesses.
 498                                 if def.is_union() {
 499                                     return Err(Unpromotable);
 500                                 }
 501                             }
 502                         }
 503                     }
 504                 }
 505
 506                 self.validate_place(PlaceRef { local: place.local, projection: proj_base })
 507             }
 508         }
 509     }
 510
 511     fn validate_operand(&self, operand: &Operand<'tcx>) -> Result<(), Unpromotable> {
 512         match operand {
 513             Operand::Copy(place) | Operand::Move(place) => self.validate_place(place.as_ref()),
 514
 515             // The qualifs for a constant (e.g. `HasMutInterior`) are checked in
 516             // `validate_rvalue` upon access.
 517             Operand::Constant(c) => {
 518                 if let Some(def_id) = c.check_static_ptr(self.tcx) {
 519                     // Only allow statics (not consts) to refer to other statics.
 520                     // FIXME(eddyb) does this matter at all for promotion?
 521                     let is_static = self.const_kind.map_or(false, |k| k.is_static());
 522                     if !is_static {
 523                         return Err(Unpromotable);
 524                     }
 525
 526                     let is_thread_local = self.tcx.has_attr(def_id, sym::thread_local);
 527                     if is_thread_local {
 528                         return Err(Unpromotable);
 529                     }
 530                 }
 531
 532                 Ok(())
 533             }
 534         }
 535     }
 536
 537     fn validate_rvalue(&self, rvalue: &Rvalue<'tcx>) -> Result<(), Unpromotable> {
 538         match *rvalue {
 539             Rvalue::Cast(CastKind::Misc, ref operand, cast_ty) if self.const_kind.is_none() => {
 540                 let operand_ty = operand.ty(*self.body, self.tcx);
 541                 let cast_in = CastTy::from_ty(operand_ty).expect("bad input type for cast");
 542                 let cast_out = CastTy::from_ty(cast_ty).expect("bad output type for cast");
 543                 match (cast_in, cast_out) {
 544                     (CastTy::Ptr(_), CastTy::Int(_)) | (CastTy::FnPtr, CastTy::Int(_)) => {
 545                         // in normal functions, mark such casts as not promotable
 546                         return Err(Unpromotable);
 547                     }
 548                     _ => {}
 549                 }
 550             }
 551
 552             Rvalue::BinaryOp(op, ref lhs, _) if self.const_kind.is_none() => {
 553                 if let ty::RawPtr(_) | ty::FnPtr(..) = lhs.ty(*self.body, self.tcx).kind {
 554                     assert!(
 555                         op == BinOp::Eq
 556                             || op == BinOp::Ne
 557                             || op == BinOp::Le
 558                             || op == BinOp::Lt
 559                             || op == BinOp::Ge
 560                             || op == BinOp::Gt
 561                             || op == BinOp::Offset
 562                     );
 563
 564                     // raw pointer operations are not allowed inside promoteds
 565                     return Err(Unpromotable);
 566                 }
 567             }
 568
 569             Rvalue::NullaryOp(NullOp::Box, _) => return Err(Unpromotable),
 570
 571             _ => {}
 572         }
 573
 574         match rvalue {
 575             Rvalue::NullaryOp(..) => Ok(()),
 576
 577             Rvalue::Discriminant(place) | Rvalue::Len(place) => self.validate_place(place.as_ref()),
 578
 579             Rvalue::Use(operand)
 580             | Rvalue::Repeat(operand, _)
 581             | Rvalue::UnaryOp(_, operand)
 582             | Rvalue::Cast(_, operand, _) => self.validate_operand(operand),
 583
 584             Rvalue::BinaryOp(_, lhs, rhs) | Rvalue::CheckedBinaryOp(_, lhs, rhs) => {
 585                 self.validate_operand(lhs)?;
 586                 self.validate_operand(rhs)
 587             }
 588
 589             Rvalue::AddressOf(_, place) => {
 590                 // Raw reborrows can come from reference to pointer coercions,
 591                 // so are allowed.
 592                 if let [proj_base @ .., ProjectionElem::Deref] = place.projection.as_ref() {
 593                     let base_ty = Place::ty_from(place.local, proj_base, *self.body, self.tcx).ty;
 594                     if let ty::Ref(..) = base_ty.kind {
 595                         return self.validate_place(PlaceRef {
 596                             local: place.local,
 597                             projection: proj_base,
 598                         });
 599                     }
 600                 }
 601                 Err(Unpromotable)
 602             }
 603
 604             Rvalue::Ref(_, kind, place) => {
 605                 if let BorrowKind::Mut { .. } = kind {
 606                     let ty = place.ty(*self.body, self.tcx).ty;
 607
 608                     // In theory, any zero-sized value could be borrowed
 609                     // mutably without consequences. However, only &mut []
 610                     // is allowed right now, and only in functions.
 611                     if self.const_kind == Some(ConstKind::StaticMut) {
 612                         // Inside a `static mut`, &mut [...] is also allowed.
 613                         match ty.kind {
 614                             ty::Array(..) | ty::Slice(_) => {}
 615                             _ => return Err(Unpromotable),
 616                         }
 617                     } else if let ty::Array(_, len) = ty.kind {
 618                         // FIXME(eddyb): We only return `Unpromotable` for `&mut []` inside a
 619                         // const context which seems unnecessary given that this is merely a ZST.
 620                         match len.try_eval_usize(self.tcx, self.param_env) {
 621                             Some(0) if self.const_kind.is_none() => {}
 622                             _ => return Err(Unpromotable),
 623                         }
 624                     } else {
 625                         return Err(Unpromotable);
 626                     }
 627                 }
 628
 629                 // Special-case reborrows to be more like a copy of the reference.
 630                 let mut place = place.as_ref();
 631                 if let [proj_base @ .., ProjectionElem::Deref] = &place.projection {
 632                     let base_ty = Place::ty_from(place.local, proj_base, *self.body, self.tcx).ty;
 633                     if let ty::Ref(..) = base_ty.kind {
 634                         place = PlaceRef { local: place.local, projection: proj_base };
 635                     }
 636                 }
 637
 638                 self.validate_place(place)?;
 639
 640                 // HACK(eddyb) this should compute the same thing as
 641                 // `<HasMutInterior as Qualif>::in_projection` from
 642                 // `check_consts::qualifs` but without recursion.
 643                 let mut has_mut_interior =
 644                     self.qualif_local::<qualifs::HasMutInterior>(place.local);
 645                 if has_mut_interior {
 646                     let mut place_projection = place.projection;
 647                     // FIXME(eddyb) use a forward loop instead of a reverse one.
 648                     while let [proj_base @ .., elem] = place_projection {
 649                         // FIXME(eddyb) this is probably excessive, with
 650                         // the exception of `union` member accesses.
 651                         let ty = Place::ty_from(place.local, proj_base, *self.body, self.tcx)
 652                             .projection_ty(self.tcx, elem)
 653                             .ty;
 654                         if ty.is_freeze(self.tcx, self.param_env, DUMMY_SP) {
 655                             has_mut_interior = false;
 656                             break;
 657                         }
 658
 659                         place_projection = proj_base;
 660                     }
 661                 }
 662                 if has_mut_interior {
 663                     return Err(Unpromotable);
 664                 }
 665
 666                 Ok(())
 667             }
 668
 669             Rvalue::Aggregate(_, ref operands) => {
 670                 for o in operands {
 671                     self.validate_operand(o)?;
 672                 }
 673
 674                 Ok(())
 675             }
 676         }
 677     }
 678
 679     fn validate_call(
 680         &self,
 681         callee: &Operand<'tcx>,
 682         args: &[Operand<'tcx>],
 683     ) -> Result<(), Unpromotable> {
 684         let fn_ty = callee.ty(*self.body, self.tcx);
 685
 686         if !self.explicit && self.const_kind.is_none() {
 687             if let ty::FnDef(def_id, _) = fn_ty.kind {
 688                 // Never promote runtime `const fn` calls of
 689                 // functions without `#[rustc_promotable]`.
 690                 if !self.tcx.is_promotable_const_fn(def_id) {
 691                     return Err(Unpromotable);
 692                 }
 693             }
 694         }
 695
 696         let is_const_fn = match fn_ty.kind {
 697             ty::FnDef(def_id, _) => {
 698                 is_const_fn(self.tcx, def_id)
 699                     || is_unstable_const_fn(self.tcx, def_id).is_some()
 700                     || is_lang_panic_fn(self.tcx, self.def_id)
 701             }
 702             _ => false,
 703         };
 704         if !is_const_fn {
 705             return Err(Unpromotable);
 706         }
 707
 708         self.validate_operand(callee)?;
 709         for arg in args {
 710             self.validate_operand(arg)?;
 711         }
 712
 713         Ok(())
 714     }
 715 }
 716
 717 // FIXME(eddyb) remove the differences for promotability in `static`, `const`, `const fn`.
 718 pub fn validate_candidates(
 719     tcx: TyCtxt<'tcx>,
 720     body: ReadOnlyBodyAndCache<'_, 'tcx>,
 721     def_id: DefId,
 722     temps: &IndexVec<Local, TempState>,
 723     candidates: &[Candidate],
 724 ) -> Vec<Candidate> {
 725     let mut validator = Validator { item: Item::new(tcx, def_id, body), temps, explicit: false };
 726
 727     candidates
 728         .iter()
 729         .copied()
 730         .filter(|&candidate| {
 731             validator.explicit = candidate.forces_explicit_promotion();
 732
 733             // FIXME(eddyb) also emit the errors for shuffle indices
 734             // and `#[rustc_args_required_const]` arguments here.
 735
 736             let is_promotable = validator.validate_candidate(candidate).is_ok();
 737             match candidate {
 738                 Candidate::Argument { bb, index } if !is_promotable => {
 739                     let span = body[bb].terminator().source_info.span;
 740                     let msg = format!("argument {} is required to be a constant", index + 1);
 741                     tcx.sess.span_err(span, &msg);
 742                 }
 743                 _ => (),
 744             }
 745
 746             is_promotable
 747         })
 748         .collect()
 749 }
 750
 751 struct Promoter<'a, 'tcx> {
 752     tcx: TyCtxt<'tcx>,
 753     source: &'a mut BodyAndCache<'tcx>,
 754     promoted: BodyAndCache<'tcx>,
 755     temps: &'a mut IndexVec<Local, TempState>,
 756     extra_statements: &'a mut Vec<(Location, Statement<'tcx>)>,
 757
 758     /// If true, all nested temps are also kept in the
 759     /// source MIR, not moved to the promoted MIR.
 760     keep_original: bool,
 761 }
 762
 763 impl<'a, 'tcx> Promoter<'a, 'tcx> {
 764     fn new_block(&mut self) -> BasicBlock {
 765         let span = self.promoted.span;
 766         self.promoted.basic_blocks_mut().push(BasicBlockData {
 767             statements: vec![],
 768             terminator: Some(Terminator {
 769                 source_info: SourceInfo { span, scope: OUTERMOST_SOURCE_SCOPE },
 770                 kind: TerminatorKind::Return,
 771             }),
 772             is_cleanup: false,
 773         })
 774     }
 775
 776     fn assign(&mut self, dest: Local, rvalue: Rvalue<'tcx>, span: Span) {
 777         let last = self.promoted.basic_blocks().last().unwrap();
 778         let data = &mut self.promoted[last];
 779         data.statements.push(Statement {
 780             source_info: SourceInfo { span, scope: OUTERMOST_SOURCE_SCOPE },
 781             kind: StatementKind::Assign(box (Place::from(dest), rvalue)),
 782         });
 783     }
 784
 785     fn is_temp_kind(&self, local: Local) -> bool {
 786         self.source.local_kind(local) == LocalKind::Temp
 787     }
 788
 789     /// Copies the initialization of this temp to the
 790     /// promoted MIR, recursing through temps.
 791     fn promote_temp(&mut self, temp: Local) -> Local {
 792         let old_keep_original = self.keep_original;
 793         let loc = match self.temps[temp] {
 794             TempState::Defined { location, uses } if uses > 0 => {
 795                 if uses > 1 {
 796                     self.keep_original = true;
 797                 }
 798                 location
 799             }
 800             state => {
 801                 span_bug!(self.promoted.span, "{:?} not promotable: {:?}", temp, state);
 802             }
 803         };
 804         if !self.keep_original {
 805             self.temps[temp] = TempState::PromotedOut;
 806         }
 807
 808         let num_stmts = self.source[loc.block].statements.len();
 809         let new_temp = self.promoted.local_decls.push(LocalDecl::new_temp(
 810             self.source.local_decls[temp].ty,
 811             self.source.local_decls[temp].source_info.span,
 812         ));
 813
 814         debug!("promote({:?} @ {:?}/{:?}, {:?})", temp, loc, num_stmts, self.keep_original);
 815
 816         // First, take the Rvalue or Call out of the source MIR,
 817         // or duplicate it, depending on keep_original.
 818         if loc.statement_index < num_stmts {
 819             let (mut rvalue, source_info) = {
 820                 let statement = &mut self.source[loc.block].statements[loc.statement_index];
 821                 let rhs = match statement.kind {
 822                     StatementKind::Assign(box (_, ref mut rhs)) => rhs,
 823                     _ => {
 824                         span_bug!(
 825                             statement.source_info.span,
 826                             "{:?} is not an assignment",
 827                             statement
 828                         );
 829                     }
 830                 };
 831
 832                 (
 833                     if self.keep_original {
 834                         rhs.clone()
 835                     } else {
 836                         let unit = Rvalue::Aggregate(box AggregateKind::Tuple, vec![]);
 837                         mem::replace(rhs, unit)
 838                     },
 839                     statement.source_info,
 840                 )
 841             };
 842
 843             self.visit_rvalue(&mut rvalue, loc);
 844             self.assign(new_temp, rvalue, source_info.span);
 845         } else {
 846             let terminator = if self.keep_original {
 847                 self.source[loc.block].terminator().clone()
 848             } else {
 849                 let terminator = self.source[loc.block].terminator_mut();
 850                 let target = match terminator.kind {
 851                     TerminatorKind::Call { destination: Some((_, target)), .. } => target,
 852                     ref kind => {
 853                         span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 854                     }
 855                 };
 856                 Terminator {
 857                     source_info: terminator.source_info,
 858                     kind: mem::replace(&mut terminator.kind, TerminatorKind::Goto { target }),
 859                 }
 860             };
 861
 862             match terminator.kind {
 863                 TerminatorKind::Call { mut func, mut args, from_hir_call, .. } => {
 864                     self.visit_operand(&mut func, loc);
 865                     for arg in &mut args {
 866                         self.visit_operand(arg, loc);
 867                     }
 868
 869                     let last = self.promoted.basic_blocks().last().unwrap();
 870                     let new_target = self.new_block();
 871
 872                     *self.promoted[last].terminator_mut() = Terminator {
 873                         kind: TerminatorKind::Call {
 874                             func,
 875                             args,
 876                             cleanup: None,
 877                             destination: Some((Place::from(new_temp), new_target)),
 878                             from_hir_call,
 879                         },
 880                         ..terminator
 881                     };
 882                 }
 883                 ref kind => {
 884                     span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 885                 }
 886             };
 887         };
 888
 889         self.keep_original = old_keep_original;
 890         new_temp
 891     }
 892
 893     fn promote_candidate(
 894         mut self,
 895         def_id: DefId,
 896         candidate: Candidate,
 897         next_promoted_id: usize,
 898     ) -> Option<BodyAndCache<'tcx>> {
 899         let mut rvalue = {
 900             let promoted = &mut self.promoted;
 901             let promoted_id = Promoted::new(next_promoted_id);
 902             let tcx = self.tcx;
 903             let mut promoted_operand = |ty, span| {
 904                 promoted.span = span;
 905                 promoted.local_decls[RETURN_PLACE] = LocalDecl::new_return_place(ty, span);
 906
 907                 Operand::Constant(Box::new(Constant {
 908                     span,
 909                     user_ty: None,
 910                     literal: tcx.mk_const(ty::Const {
 911                         ty,
 912                         val: ty::ConstKind::Unevaluated(
 913                             def_id,
 914                             InternalSubsts::identity_for_item(tcx, def_id),
 915                             Some(promoted_id),
 916                         ),
 917                     }),
 918                 }))
 919             };
 920             let (blocks, local_decls) = self.source.basic_blocks_and_local_decls_mut();
 921             match candidate {
 922                 Candidate::Ref(loc) => {
 923                     let ref mut statement = blocks[loc.block].statements[loc.statement_index];
 924                     match statement.kind {
 925                         StatementKind::Assign(box (
 926                             _,
 927                             Rvalue::Ref(ref mut region, borrow_kind, ref mut place),
 928                         )) => {
 929                             // Use the underlying local for this (necessarily interior) borrow.
 930                             let ty = local_decls.local_decls()[place.local].ty;
 931                             let span = statement.source_info.span;
 932
 933                             let ref_ty = tcx.mk_ref(
 934                                 tcx.lifetimes.re_erased,
 935                                 ty::TypeAndMut { ty, mutbl: borrow_kind.to_mutbl_lossy() },
 936                             );
 937
 938                             *region = tcx.lifetimes.re_erased;
 939
 940                             let mut projection = vec![PlaceElem::Deref];
 941                             projection.extend(place.projection);
 942                             place.projection = tcx.intern_place_elems(&projection);
 943
 944                             // Create a temp to hold the promoted reference.
 945                             // This is because `*r` requires `r` to be a local,
 946                             // otherwise we would use the `promoted` directly.
 947                             let mut promoted_ref = LocalDecl::new_temp(ref_ty, span);
 948                             promoted_ref.source_info = statement.source_info;
 949                             let promoted_ref = local_decls.push(promoted_ref);
 950                             assert_eq!(self.temps.push(TempState::Unpromotable), promoted_ref);
 951
 952                             let promoted_ref_statement = Statement {
 953                                 source_info: statement.source_info,
 954                                 kind: StatementKind::Assign(Box::new((
 955                                     Place::from(promoted_ref),
 956                                     Rvalue::Use(promoted_operand(ref_ty, span)),
 957                                 ))),
 958                             };
 959                             self.extra_statements.push((loc, promoted_ref_statement));
 960
 961                             Rvalue::Ref(
 962                                 tcx.lifetimes.re_erased,
 963                                 borrow_kind,
 964                                 Place {
 965                                     local: mem::replace(&mut place.local, promoted_ref),
 966                                     projection: List::empty(),
 967                                 },
 968                             )
 969                         }
 970                         _ => bug!(),
 971                     }
 972                 }
 973                 Candidate::Repeat(loc) => {
 974                     let ref mut statement = blocks[loc.block].statements[loc.statement_index];
 975                     match statement.kind {
 976                         StatementKind::Assign(box (_, Rvalue::Repeat(ref mut operand, _))) => {
 977                             let ty = operand.ty(local_decls, self.tcx);
 978                             let span = statement.source_info.span;
 979
 980                             Rvalue::Use(mem::replace(operand, promoted_operand(ty, span)))
 981                         }
 982                         _ => bug!(),
 983                     }
 984                 }
 985                 Candidate::Argument { bb, index } => {
 986                     let terminator = blocks[bb].terminator_mut();
 987                     match terminator.kind {
 988                         TerminatorKind::Call { ref mut args, .. } => {
 989                             let ty = args[index].ty(local_decls, self.tcx);
 990                             let span = terminator.source_info.span;
 991
 992                             Rvalue::Use(mem::replace(&mut args[index], promoted_operand(ty, span)))
 993                         }
 994                         // We expected a `TerminatorKind::Call` for which we'd like to promote an
 995                         // argument. `qualify_consts` saw a `TerminatorKind::Call` here, but
 996                         // we are seeing a `Goto`. That means that the `promote_temps` method
 997                         // already promoted this call away entirely. This case occurs when calling
 998                         // a function requiring a constant argument and as that constant value
 999                         // providing a value whose computation contains another call to a function
1000                         // requiring a constant argument.
1001                         TerminatorKind::Goto { .. } => return None,
1002                         _ => bug!(),
1003                     }
1004                 }
1005             }
1006         };
1007
1008         assert_eq!(self.new_block(), START_BLOCK);
1009         self.visit_rvalue(
1010             &mut rvalue,
1011             Location { block: BasicBlock::new(0), statement_index: usize::MAX },
1012         );
1013
1014         let span = self.promoted.span;
1015         self.assign(RETURN_PLACE, rvalue, span);
1016         Some(self.promoted)
1017     }
1018 }
1019
1020 /// Replaces all temporaries with their promoted counterparts.
1021 impl<'a, 'tcx> MutVisitor<'tcx> for Promoter<'a, 'tcx> {
1022     fn tcx(&self) -> TyCtxt<'tcx> {
1023         self.tcx
1024     }
1025
1026     fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
1027         if self.is_temp_kind(*local) {
1028             *local = self.promote_temp(*local);
1029         }
1030     }
1031
1032     fn process_projection_elem(&mut self, elem: &PlaceElem<'tcx>) -> Option<PlaceElem<'tcx>> {
1033         match elem {
1034             PlaceElem::Index(local) if self.is_temp_kind(*local) => {
1035                 Some(PlaceElem::Index(self.promote_temp(*local)))
1036             }
1037             _ => None,
1038         }
1039     }
1040 }
1041
1042 pub fn promote_candidates<'tcx>(
1043     def_id: DefId,
1044     body: &mut BodyAndCache<'tcx>,
1045     tcx: TyCtxt<'tcx>,
1046     mut temps: IndexVec<Local, TempState>,
1047     candidates: Vec<Candidate>,
1048 ) -> IndexVec<Promoted, BodyAndCache<'tcx>> {
1049     // Visit candidates in reverse, in case they're nested.
1050     debug!("promote_candidates({:?})", candidates);
1051
1052     let mut promotions = IndexVec::new();
1053
1054     let mut extra_statements = vec![];
1055     for candidate in candidates.into_iter().rev() {
1056         match candidate {
1057             Candidate::Repeat(Location { block, statement_index })
1058             | Candidate::Ref(Location { block, statement_index }) => {
1059                 match &body[block].statements[statement_index].kind {
1060                     StatementKind::Assign(box (place, _)) => {
1061                         if let Some(local) = place.as_local() {
1062                             if temps[local] == TempState::PromotedOut {
1063                                 // Already promoted.
1064                                 continue;
1065                             }
1066                         }
1067                     }
1068                     _ => {}
1069                 }
1070             }
1071             Candidate::Argument { .. } => {}
1072         }
1073
1074         // Declare return place local so that `mir::Body::new` doesn't complain.
1075         let initial_locals =
1076             iter::once(LocalDecl::new_return_place(tcx.types.never, body.span)).collect();
1077
1078         let mut promoted = Body::new(
1079             IndexVec::new(),
1080             // FIXME: maybe try to filter this to avoid blowing up
1081             // memory usage?
1082             body.source_scopes.clone(),
1083             initial_locals,
1084             IndexVec::new(),
1085             0,
1086             vec![],
1087             body.span,
1088             vec![],
1089             body.generator_kind,
1090         );
1091         promoted.ignore_interior_mut_in_const_validation = true;
1092
1093         let promoter = Promoter {
1094             promoted: BodyAndCache::new(promoted),
1095             tcx,
1096             source: body,
1097             temps: &mut temps,
1098             extra_statements: &mut extra_statements,
1099             keep_original: false,
1100         };
1101
1102         //FIXME(oli-obk): having a `maybe_push()` method on `IndexVec` might be nice
1103         if let Some(promoted) = promoter.promote_candidate(def_id, candidate, promotions.len()) {
1104             promotions.push(promoted);
1105         }
1106     }
1107
1108     // Insert each of `extra_statements` before its indicated location, which
1109     // has to be done in reverse location order, to not invalidate the rest.
1110     extra_statements.sort_by_key(|&(loc, _)| cmp::Reverse(loc));
1111     for (loc, statement) in extra_statements {
1112         body[loc.block].statements.insert(loc.statement_index, statement);
1113     }
1114
1115     // Eliminate assignments to, and drops of promoted temps.
1116     let promoted = |index: Local| temps[index] == TempState::PromotedOut;
1117     for block in body.basic_blocks_mut() {
1118         block.statements.retain(|statement| match &statement.kind {
1119             StatementKind::Assign(box (place, _)) => {
1120                 if let Some(index) = place.as_local() {
1121                     !promoted(index)
1122                 } else {
1123                     true
1124                 }
1125             }
1126             StatementKind::StorageLive(index) | StatementKind::StorageDead(index) => {
1127                 !promoted(*index)
1128             }
1129             _ => true,
1130         });
1131         let terminator = block.terminator_mut();
1132         match &terminator.kind {
1133             TerminatorKind::Drop { location: place, target, .. } => {
1134                 if let Some(index) = place.as_local() {
1135                     if promoted(index) {
1136                         terminator.kind = TerminatorKind::Goto { target: *target };
1137                     }
1138                 }
1139             }
1140             _ => {}
1141         }
1142     }
1143
1144     promotions
1145 }
1146
1147 /// This function returns `true` if the `const_in_array_repeat_expressions` feature attribute should
1148 /// be suggested. This function is probably quite expensive, it shouldn't be run in the happy path.
1149 /// Feature attribute should be suggested if `operand` can be promoted and the feature is not
1150 /// enabled.
1151 crate fn should_suggest_const_in_array_repeat_expressions_attribute<'tcx>(
1152     tcx: TyCtxt<'tcx>,
1153     mir_def_id: DefId,
1154     body: ReadOnlyBodyAndCache<'_, 'tcx>,
1155     operand: &Operand<'tcx>,
1156 ) -> bool {
1157     let mut rpo = traversal::reverse_postorder(&body);
1158     let (temps, _) = collect_temps_and_candidates(tcx, &body, &mut rpo);
1159     let validator =
1160         Validator { item: Item::new(tcx, mir_def_id, body), temps: &temps, explicit: false };
1161
1162     let should_promote = validator.validate_operand(operand).is_ok();
1163     let feature_flag = tcx.features().const_in_array_repeat_expressions;
1164     debug!(
1165         "should_suggest_const_in_array_repeat_expressions_flag: mir_def_id={:?} \
1166             should_promote={:?} feature_flag={:?}",
1167         mir_def_id, should_promote, feature_flag
1168     );
1169     should_promote && !feature_flag
1170 }