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         if let TempState::Defined { location: loc, .. } = self.temps[local] {
 411             let num_stmts = self.body[loc.block].statements.len();
 412
 413             if loc.statement_index < num_stmts {
 414                 let statement = &self.body[loc.block].statements[loc.statement_index];
 415                 match &statement.kind {
 416                     StatementKind::Assign(box (_, rhs)) => qualifs::in_rvalue::<Q, _>(
 417                         &self.item,
 418                         &mut |l| self.qualif_local::<Q>(l),
 419                         rhs,
 420                     ),
 421                     _ => {
 422                         span_bug!(
 423                             statement.source_info.span,
 424                             "{:?} is not an assignment",
 425                             statement
 426                         );
 427                     }
 428                 }
 429             } else {
 430                 let terminator = self.body[loc.block].terminator();
 431                 match &terminator.kind {
 432                     TerminatorKind::Call { .. } => {
 433                         let return_ty = self.body.local_decls[local].ty;
 434                         Q::in_any_value_of_ty(&self.item, return_ty)
 435                     }
 436                     kind => {
 437                         span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 438                     }
 439                 }
 440             }
 441         } else {
 442             let span = self.body.local_decls[local].source_info.span;
 443             span_bug!(span, "{:?} not promotable, qualif_local shouldn't have been called", local);
 444         }
 445     }
 446
 447     // FIXME(eddyb) maybe cache this?
 448     fn validate_local(&self, local: Local) -> Result<(), Unpromotable> {
 449         if let TempState::Defined { location: loc, .. } = self.temps[local] {
 450             let num_stmts = self.body[loc.block].statements.len();
 451
 452             if loc.statement_index < num_stmts {
 453                 let statement = &self.body[loc.block].statements[loc.statement_index];
 454                 match &statement.kind {
 455                     StatementKind::Assign(box (_, rhs)) => self.validate_rvalue(rhs),
 456                     _ => {
 457                         span_bug!(
 458                             statement.source_info.span,
 459                             "{:?} is not an assignment",
 460                             statement
 461                         );
 462                     }
 463                 }
 464             } else {
 465                 let terminator = self.body[loc.block].terminator();
 466                 match &terminator.kind {
 467                     TerminatorKind::Call { func, args, .. } => self.validate_call(func, args),
 468                     TerminatorKind::Yield { .. } => Err(Unpromotable),
 469                     kind => {
 470                         span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 471                     }
 472                 }
 473             }
 474         } else {
 475             Err(Unpromotable)
 476         }
 477     }
 478
 479     fn validate_place(&self, place: PlaceRef<'tcx>) -> Result<(), Unpromotable> {
 480         match place {
 481             PlaceRef { local, projection: [] } => self.validate_local(local),
 482             PlaceRef { local: _, projection: [proj_base @ .., elem] } => {
 483                 match *elem {
 484                     ProjectionElem::Deref | ProjectionElem::Downcast(..) => {
 485                         return Err(Unpromotable);
 486                     }
 487
 488                     ProjectionElem::ConstantIndex { .. } | ProjectionElem::Subslice { .. } => {}
 489
 490                     ProjectionElem::Index(local) => {
 491                         self.validate_local(local)?;
 492                     }
 493
 494                     ProjectionElem::Field(..) => {
 495                         if self.const_kind.is_none() {
 496                             let base_ty =
 497                                 Place::ty_from(place.local, proj_base, *self.body, self.tcx).ty;
 498                             if let Some(def) = base_ty.ty_adt_def() {
 499                                 // No promotion of union field accesses.
 500                                 if def.is_union() {
 501                                     return Err(Unpromotable);
 502                                 }
 503                             }
 504                         }
 505                     }
 506                 }
 507
 508                 self.validate_place(PlaceRef { local: place.local, projection: proj_base })
 509             }
 510         }
 511     }
 512
 513     fn validate_operand(&self, operand: &Operand<'tcx>) -> Result<(), Unpromotable> {
 514         match operand {
 515             Operand::Copy(place) | Operand::Move(place) => self.validate_place(place.as_ref()),
 516
 517             // The qualifs for a constant (e.g. `HasMutInterior`) are checked in
 518             // `validate_rvalue` upon access.
 519             Operand::Constant(c) => {
 520                 if let Some(def_id) = c.check_static_ptr(self.tcx) {
 521                     // Only allow statics (not consts) to refer to other statics.
 522                     // FIXME(eddyb) does this matter at all for promotion?
 523                     let is_static = self.const_kind.map_or(false, |k| k.is_static());
 524                     if !is_static {
 525                         return Err(Unpromotable);
 526                     }
 527
 528                     let is_thread_local = self.tcx.has_attr(def_id, sym::thread_local);
 529                     if is_thread_local {
 530                         return Err(Unpromotable);
 531                     }
 532                 }
 533
 534                 Ok(())
 535             }
 536         }
 537     }
 538
 539     fn validate_rvalue(&self, rvalue: &Rvalue<'tcx>) -> Result<(), Unpromotable> {
 540         match *rvalue {
 541             Rvalue::Cast(CastKind::Misc, ref operand, cast_ty) if self.const_kind.is_none() => {
 542                 let operand_ty = operand.ty(*self.body, self.tcx);
 543                 let cast_in = CastTy::from_ty(operand_ty).expect("bad input type for cast");
 544                 let cast_out = CastTy::from_ty(cast_ty).expect("bad output type for cast");
 545                 match (cast_in, cast_out) {
 546                     (CastTy::Ptr(_), CastTy::Int(_)) | (CastTy::FnPtr, CastTy::Int(_)) => {
 547                         // in normal functions, mark such casts as not promotable
 548                         return Err(Unpromotable);
 549                     }
 550                     _ => {}
 551                 }
 552             }
 553
 554             Rvalue::BinaryOp(op, ref lhs, _) if self.const_kind.is_none() => {
 555                 if let ty::RawPtr(_) | ty::FnPtr(..) = lhs.ty(*self.body, self.tcx).kind {
 556                     assert!(
 557                         op == BinOp::Eq
 558                             || op == BinOp::Ne
 559                             || op == BinOp::Le
 560                             || op == BinOp::Lt
 561                             || op == BinOp::Ge
 562                             || op == BinOp::Gt
 563                             || op == BinOp::Offset
 564                     );
 565
 566                     // raw pointer operations are not allowed inside promoteds
 567                     return Err(Unpromotable);
 568                 }
 569             }
 570
 571             Rvalue::NullaryOp(NullOp::Box, _) => return Err(Unpromotable),
 572
 573             _ => {}
 574         }
 575
 576         match rvalue {
 577             Rvalue::NullaryOp(..) => Ok(()),
 578
 579             Rvalue::Discriminant(place) | Rvalue::Len(place) => self.validate_place(place.as_ref()),
 580
 581             Rvalue::Use(operand)
 582             | Rvalue::Repeat(operand, _)
 583             | Rvalue::UnaryOp(_, operand)
 584             | Rvalue::Cast(_, operand, _) => self.validate_operand(operand),
 585
 586             Rvalue::BinaryOp(_, lhs, rhs) | Rvalue::CheckedBinaryOp(_, lhs, rhs) => {
 587                 self.validate_operand(lhs)?;
 588                 self.validate_operand(rhs)
 589             }
 590
 591             Rvalue::AddressOf(_, place) => {
 592                 // Raw reborrows can come from reference to pointer coercions,
 593                 // so are allowed.
 594                 if let [proj_base @ .., ProjectionElem::Deref] = place.projection.as_ref() {
 595                     let base_ty = Place::ty_from(place.local, proj_base, *self.body, self.tcx).ty;
 596                     if let ty::Ref(..) = base_ty.kind {
 597                         return self.validate_place(PlaceRef {
 598                             local: place.local,
 599                             projection: proj_base,
 600                         });
 601                     }
 602                 }
 603                 Err(Unpromotable)
 604             }
 605
 606             Rvalue::Ref(_, kind, place) => {
 607                 if let BorrowKind::Mut { .. } = kind {
 608                     let ty = place.ty(*self.body, self.tcx).ty;
 609
 610                     // In theory, any zero-sized value could be borrowed
 611                     // mutably without consequences. However, only &mut []
 612                     // is allowed right now, and only in functions.
 613                     if self.const_kind == Some(ConstKind::StaticMut) {
 614                         // Inside a `static mut`, &mut [...] is also allowed.
 615                         match ty.kind {
 616                             ty::Array(..) | ty::Slice(_) => {}
 617                             _ => return Err(Unpromotable),
 618                         }
 619                     } else if let ty::Array(_, len) = ty.kind {
 620                         // FIXME(eddyb): We only return `Unpromotable` for `&mut []` inside a
 621                         // const context which seems unnecessary given that this is merely a ZST.
 622                         match len.try_eval_usize(self.tcx, self.param_env) {
 623                             Some(0) if self.const_kind.is_none() => {}
 624                             _ => return Err(Unpromotable),
 625                         }
 626                     } else {
 627                         return Err(Unpromotable);
 628                     }
 629                 }
 630
 631                 // Special-case reborrows to be more like a copy of the reference.
 632                 let mut place = place.as_ref();
 633                 if let [proj_base @ .., ProjectionElem::Deref] = &place.projection {
 634                     let base_ty = Place::ty_from(place.local, proj_base, *self.body, self.tcx).ty;
 635                     if let ty::Ref(..) = base_ty.kind {
 636                         place = PlaceRef { local: place.local, projection: proj_base };
 637                     }
 638                 }
 639
 640                 self.validate_place(place)?;
 641
 642                 // HACK(eddyb) this should compute the same thing as
 643                 // `<HasMutInterior as Qualif>::in_projection` from
 644                 // `check_consts::qualifs` but without recursion.
 645                 let mut has_mut_interior =
 646                     self.qualif_local::<qualifs::HasMutInterior>(place.local);
 647                 if has_mut_interior {
 648                     let mut place_projection = place.projection;
 649                     // FIXME(eddyb) use a forward loop instead of a reverse one.
 650                     while let [proj_base @ .., elem] = place_projection {
 651                         // FIXME(eddyb) this is probably excessive, with
 652                         // the exception of `union` member accesses.
 653                         let ty = Place::ty_from(place.local, proj_base, *self.body, self.tcx)
 654                             .projection_ty(self.tcx, elem)
 655                             .ty;
 656                         if ty.is_freeze(self.tcx, self.param_env, DUMMY_SP) {
 657                             has_mut_interior = false;
 658                             break;
 659                         }
 660
 661                         place_projection = proj_base;
 662                     }
 663                 }
 664                 if has_mut_interior {
 665                     return Err(Unpromotable);
 666                 }
 667
 668                 Ok(())
 669             }
 670
 671             Rvalue::Aggregate(_, ref operands) => {
 672                 for o in operands {
 673                     self.validate_operand(o)?;
 674                 }
 675
 676                 Ok(())
 677             }
 678         }
 679     }
 680
 681     fn validate_call(
 682         &self,
 683         callee: &Operand<'tcx>,
 684         args: &[Operand<'tcx>],
 685     ) -> Result<(), Unpromotable> {
 686         let fn_ty = callee.ty(*self.body, self.tcx);
 687
 688         if !self.explicit && self.const_kind.is_none() {
 689             if let ty::FnDef(def_id, _) = fn_ty.kind {
 690                 // Never promote runtime `const fn` calls of
 691                 // functions without `#[rustc_promotable]`.
 692                 if !self.tcx.is_promotable_const_fn(def_id) {
 693                     return Err(Unpromotable);
 694                 }
 695             }
 696         }
 697
 698         let is_const_fn = match fn_ty.kind {
 699             ty::FnDef(def_id, _) => {
 700                 is_const_fn(self.tcx, def_id)
 701                     || is_unstable_const_fn(self.tcx, def_id).is_some()
 702                     || is_lang_panic_fn(self.tcx, self.def_id)
 703             }
 704             _ => false,
 705         };
 706         if !is_const_fn {
 707             return Err(Unpromotable);
 708         }
 709
 710         self.validate_operand(callee)?;
 711         for arg in args {
 712             self.validate_operand(arg)?;
 713         }
 714
 715         Ok(())
 716     }
 717 }
 718
 719 // FIXME(eddyb) remove the differences for promotability in `static`, `const`, `const fn`.
 720 pub fn validate_candidates(
 721     tcx: TyCtxt<'tcx>,
 722     body: ReadOnlyBodyAndCache<'_, 'tcx>,
 723     def_id: DefId,
 724     temps: &IndexVec<Local, TempState>,
 725     candidates: &[Candidate],
 726 ) -> Vec<Candidate> {
 727     let mut validator = Validator { item: Item::new(tcx, def_id, body), temps, explicit: false };
 728
 729     candidates
 730         .iter()
 731         .copied()
 732         .filter(|&candidate| {
 733             validator.explicit = candidate.forces_explicit_promotion();
 734
 735             // FIXME(eddyb) also emit the errors for shuffle indices
 736             // and `#[rustc_args_required_const]` arguments here.
 737
 738             let is_promotable = validator.validate_candidate(candidate).is_ok();
 739             match candidate {
 740                 Candidate::Argument { bb, index } if !is_promotable => {
 741                     let span = body[bb].terminator().source_info.span;
 742                     let msg = format!("argument {} is required to be a constant", index + 1);
 743                     tcx.sess.span_err(span, &msg);
 744                 }
 745                 _ => (),
 746             }
 747
 748             is_promotable
 749         })
 750         .collect()
 751 }
 752
 753 struct Promoter<'a, 'tcx> {
 754     tcx: TyCtxt<'tcx>,
 755     source: &'a mut BodyAndCache<'tcx>,
 756     promoted: BodyAndCache<'tcx>,
 757     temps: &'a mut IndexVec<Local, TempState>,
 758     extra_statements: &'a mut Vec<(Location, Statement<'tcx>)>,
 759
 760     /// If true, all nested temps are also kept in the
 761     /// source MIR, not moved to the promoted MIR.
 762     keep_original: bool,
 763 }
 764
 765 impl<'a, 'tcx> Promoter<'a, 'tcx> {
 766     fn new_block(&mut self) -> BasicBlock {
 767         let span = self.promoted.span;
 768         self.promoted.basic_blocks_mut().push(BasicBlockData {
 769             statements: vec![],
 770             terminator: Some(Terminator {
 771                 source_info: SourceInfo { span, scope: OUTERMOST_SOURCE_SCOPE },
 772                 kind: TerminatorKind::Return,
 773             }),
 774             is_cleanup: false,
 775         })
 776     }
 777
 778     fn assign(&mut self, dest: Local, rvalue: Rvalue<'tcx>, span: Span) {
 779         let last = self.promoted.basic_blocks().last().unwrap();
 780         let data = &mut self.promoted[last];
 781         data.statements.push(Statement {
 782             source_info: SourceInfo { span, scope: OUTERMOST_SOURCE_SCOPE },
 783             kind: StatementKind::Assign(box (Place::from(dest), rvalue)),
 784         });
 785     }
 786
 787     fn is_temp_kind(&self, local: Local) -> bool {
 788         self.source.local_kind(local) == LocalKind::Temp
 789     }
 790
 791     /// Copies the initialization of this temp to the
 792     /// promoted MIR, recursing through temps.
 793     fn promote_temp(&mut self, temp: Local) -> Local {
 794         let old_keep_original = self.keep_original;
 795         let loc = match self.temps[temp] {
 796             TempState::Defined { location, uses } if uses > 0 => {
 797                 if uses > 1 {
 798                     self.keep_original = true;
 799                 }
 800                 location
 801             }
 802             state => {
 803                 span_bug!(self.promoted.span, "{:?} not promotable: {:?}", temp, state);
 804             }
 805         };
 806         if !self.keep_original {
 807             self.temps[temp] = TempState::PromotedOut;
 808         }
 809
 810         let num_stmts = self.source[loc.block].statements.len();
 811         let new_temp = self.promoted.local_decls.push(LocalDecl::new_temp(
 812             self.source.local_decls[temp].ty,
 813             self.source.local_decls[temp].source_info.span,
 814         ));
 815
 816         debug!("promote({:?} @ {:?}/{:?}, {:?})", temp, loc, num_stmts, self.keep_original);
 817
 818         // First, take the Rvalue or Call out of the source MIR,
 819         // or duplicate it, depending on keep_original.
 820         if loc.statement_index < num_stmts {
 821             let (mut rvalue, source_info) = {
 822                 let statement = &mut self.source[loc.block].statements[loc.statement_index];
 823                 let rhs = match statement.kind {
 824                     StatementKind::Assign(box (_, ref mut rhs)) => rhs,
 825                     _ => {
 826                         span_bug!(
 827                             statement.source_info.span,
 828                             "{:?} is not an assignment",
 829                             statement
 830                         );
 831                     }
 832                 };
 833
 834                 (
 835                     if self.keep_original {
 836                         rhs.clone()
 837                     } else {
 838                         let unit = Rvalue::Aggregate(box AggregateKind::Tuple, vec![]);
 839                         mem::replace(rhs, unit)
 840                     },
 841                     statement.source_info,
 842                 )
 843             };
 844
 845             self.visit_rvalue(&mut rvalue, loc);
 846             self.assign(new_temp, rvalue, source_info.span);
 847         } else {
 848             let terminator = if self.keep_original {
 849                 self.source[loc.block].terminator().clone()
 850             } else {
 851                 let terminator = self.source[loc.block].terminator_mut();
 852                 let target = match terminator.kind {
 853                     TerminatorKind::Call { destination: Some((_, target)), .. } => target,
 854                     ref kind => {
 855                         span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 856                     }
 857                 };
 858                 Terminator {
 859                     source_info: terminator.source_info,
 860                     kind: mem::replace(&mut terminator.kind, TerminatorKind::Goto { target }),
 861                 }
 862             };
 863
 864             match terminator.kind {
 865                 TerminatorKind::Call { mut func, mut args, from_hir_call, .. } => {
 866                     self.visit_operand(&mut func, loc);
 867                     for arg in &mut args {
 868                         self.visit_operand(arg, loc);
 869                     }
 870
 871                     let last = self.promoted.basic_blocks().last().unwrap();
 872                     let new_target = self.new_block();
 873
 874                     *self.promoted[last].terminator_mut() = Terminator {
 875                         kind: TerminatorKind::Call {
 876                             func,
 877                             args,
 878                             cleanup: None,
 879                             destination: Some((Place::from(new_temp), new_target)),
 880                             from_hir_call,
 881                         },
 882                         ..terminator
 883                     };
 884                 }
 885                 ref kind => {
 886                     span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
 887                 }
 888             };
 889         };
 890
 891         self.keep_original = old_keep_original;
 892         new_temp
 893     }
 894
 895     fn promote_candidate(
 896         mut self,
 897         def_id: DefId,
 898         candidate: Candidate,
 899         next_promoted_id: usize,
 900     ) -> Option<BodyAndCache<'tcx>> {
 901         let mut rvalue = {
 902             let promoted = &mut self.promoted;
 903             let promoted_id = Promoted::new(next_promoted_id);
 904             let tcx = self.tcx;
 905             let mut promoted_operand = |ty, span| {
 906                 promoted.span = span;
 907                 promoted.local_decls[RETURN_PLACE] = LocalDecl::new_return_place(ty, span);
 908
 909                 Operand::Constant(Box::new(Constant {
 910                     span,
 911                     user_ty: None,
 912                     literal: tcx.mk_const(ty::Const {
 913                         ty,
 914                         val: ty::ConstKind::Unevaluated(
 915                             def_id,
 916                             InternalSubsts::identity_for_item(tcx, def_id),
 917                             Some(promoted_id),
 918                         ),
 919                     }),
 920                 }))
 921             };
 922             let (blocks, local_decls) = self.source.basic_blocks_and_local_decls_mut();
 923             match candidate {
 924                 Candidate::Ref(loc) => {
 925                     let statement = &mut blocks[loc.block].statements[loc.statement_index];
 926                     match statement.kind {
 927                         StatementKind::Assign(box (
 928                             _,
 929                             Rvalue::Ref(ref mut region, borrow_kind, ref mut place),
 930                         )) => {
 931                             // Use the underlying local for this (necessarily interior) borrow.
 932                             let ty = local_decls.local_decls()[place.local].ty;
 933                             let span = statement.source_info.span;
 934
 935                             let ref_ty = tcx.mk_ref(
 936                                 tcx.lifetimes.re_erased,
 937                                 ty::TypeAndMut { ty, mutbl: borrow_kind.to_mutbl_lossy() },
 938                             );
 939
 940                             *region = tcx.lifetimes.re_erased;
 941
 942                             let mut projection = vec![PlaceElem::Deref];
 943                             projection.extend(place.projection);
 944                             place.projection = tcx.intern_place_elems(&projection);
 945
 946                             // Create a temp to hold the promoted reference.
 947                             // This is because `*r` requires `r` to be a local,
 948                             // otherwise we would use the `promoted` directly.
 949                             let mut promoted_ref = LocalDecl::new_temp(ref_ty, span);
 950                             promoted_ref.source_info = statement.source_info;
 951                             let promoted_ref = local_decls.push(promoted_ref);
 952                             assert_eq!(self.temps.push(TempState::Unpromotable), promoted_ref);
 953
 954                             let promoted_ref_statement = Statement {
 955                                 source_info: statement.source_info,
 956                                 kind: StatementKind::Assign(Box::new((
 957                                     Place::from(promoted_ref),
 958                                     Rvalue::Use(promoted_operand(ref_ty, span)),
 959                                 ))),
 960                             };
 961                             self.extra_statements.push((loc, promoted_ref_statement));
 962
 963                             Rvalue::Ref(
 964                                 tcx.lifetimes.re_erased,
 965                                 borrow_kind,
 966                                 Place {
 967                                     local: mem::replace(&mut place.local, promoted_ref),
 968                                     projection: List::empty(),
 969                                 },
 970                             )
 971                         }
 972                         _ => bug!(),
 973                     }
 974                 }
 975                 Candidate::Repeat(loc) => {
 976                     let statement = &mut blocks[loc.block].statements[loc.statement_index];
 977                     match statement.kind {
 978                         StatementKind::Assign(box (_, Rvalue::Repeat(ref mut operand, _))) => {
 979                             let ty = operand.ty(local_decls, self.tcx);
 980                             let span = statement.source_info.span;
 981
 982                             Rvalue::Use(mem::replace(operand, promoted_operand(ty, span)))
 983                         }
 984                         _ => bug!(),
 985                     }
 986                 }
 987                 Candidate::Argument { bb, index } => {
 988                     let terminator = blocks[bb].terminator_mut();
 989                     match terminator.kind {
 990                         TerminatorKind::Call { ref mut args, .. } => {
 991                             let ty = args[index].ty(local_decls, self.tcx);
 992                             let span = terminator.source_info.span;
 993
 994                             Rvalue::Use(mem::replace(&mut args[index], promoted_operand(ty, span)))
 995                         }
 996                         // We expected a `TerminatorKind::Call` for which we'd like to promote an
 997                         // argument. `qualify_consts` saw a `TerminatorKind::Call` here, but
 998                         // we are seeing a `Goto`. That means that the `promote_temps` method
 999                         // already promoted this call away entirely. This case occurs when calling
1000                         // a function requiring a constant argument and as that constant value
1001                         // providing a value whose computation contains another call to a function
1002                         // requiring a constant argument.
1003                         TerminatorKind::Goto { .. } => return None,
1004                         _ => bug!(),
1005                     }
1006                 }
1007             }
1008         };
1009
1010         assert_eq!(self.new_block(), START_BLOCK);
1011         self.visit_rvalue(
1012             &mut rvalue,
1013             Location { block: BasicBlock::new(0), statement_index: usize::MAX },
1014         );
1015
1016         let span = self.promoted.span;
1017         self.assign(RETURN_PLACE, rvalue, span);
1018         Some(self.promoted)
1019     }
1020 }
1021
1022 /// Replaces all temporaries with their promoted counterparts.
1023 impl<'a, 'tcx> MutVisitor<'tcx> for Promoter<'a, 'tcx> {
1024     fn tcx(&self) -> TyCtxt<'tcx> {
1025         self.tcx
1026     }
1027
1028     fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
1029         if self.is_temp_kind(*local) {
1030             *local = self.promote_temp(*local);
1031         }
1032     }
1033
1034     fn process_projection_elem(&mut self, elem: &PlaceElem<'tcx>) -> Option<PlaceElem<'tcx>> {
1035         match elem {
1036             PlaceElem::Index(local) if self.is_temp_kind(*local) => {
1037                 Some(PlaceElem::Index(self.promote_temp(*local)))
1038             }
1039             _ => None,
1040         }
1041     }
1042 }
1043
1044 pub fn promote_candidates<'tcx>(
1045     def_id: DefId,
1046     body: &mut BodyAndCache<'tcx>,
1047     tcx: TyCtxt<'tcx>,
1048     mut temps: IndexVec<Local, TempState>,
1049     candidates: Vec<Candidate>,
1050 ) -> IndexVec<Promoted, BodyAndCache<'tcx>> {
1051     // Visit candidates in reverse, in case they're nested.
1052     debug!("promote_candidates({:?})", candidates);
1053
1054     let mut promotions = IndexVec::new();
1055
1056     let mut extra_statements = vec![];
1057     for candidate in candidates.into_iter().rev() {
1058         match candidate {
1059             Candidate::Repeat(Location { block, statement_index })
1060             | Candidate::Ref(Location { block, statement_index }) => {
1061                 match &body[block].statements[statement_index].kind {
1062                     StatementKind::Assign(box (place, _)) => {
1063                         if let Some(local) = place.as_local() {
1064                             if temps[local] == TempState::PromotedOut {
1065                                 // Already promoted.
1066                                 continue;
1067                             }
1068                         }
1069                     }
1070                     _ => {}
1071                 }
1072             }
1073             Candidate::Argument { .. } => {}
1074         }
1075
1076         // Declare return place local so that `mir::Body::new` doesn't complain.
1077         let initial_locals =
1078             iter::once(LocalDecl::new_return_place(tcx.types.never, body.span)).collect();
1079
1080         let mut promoted = Body::new(
1081             IndexVec::new(),
1082             // FIXME: maybe try to filter this to avoid blowing up
1083             // memory usage?
1084             body.source_scopes.clone(),
1085             initial_locals,
1086             IndexVec::new(),
1087             0,
1088             vec![],
1089             body.span,
1090             vec![],
1091             body.generator_kind,
1092         );
1093         promoted.ignore_interior_mut_in_const_validation = true;
1094
1095         let promoter = Promoter {
1096             promoted: BodyAndCache::new(promoted),
1097             tcx,
1098             source: body,
1099             temps: &mut temps,
1100             extra_statements: &mut extra_statements,
1101             keep_original: false,
1102         };
1103
1104         //FIXME(oli-obk): having a `maybe_push()` method on `IndexVec` might be nice
1105         if let Some(promoted) = promoter.promote_candidate(def_id, candidate, promotions.len()) {
1106             promotions.push(promoted);
1107         }
1108     }
1109
1110     // Insert each of `extra_statements` before its indicated location, which
1111     // has to be done in reverse location order, to not invalidate the rest.
1112     extra_statements.sort_by_key(|&(loc, _)| cmp::Reverse(loc));
1113     for (loc, statement) in extra_statements {
1114         body[loc.block].statements.insert(loc.statement_index, statement);
1115     }
1116
1117     // Eliminate assignments to, and drops of promoted temps.
1118     let promoted = |index: Local| temps[index] == TempState::PromotedOut;
1119     for block in body.basic_blocks_mut() {
1120         block.statements.retain(|statement| match &statement.kind {
1121             StatementKind::Assign(box (place, _)) => {
1122                 if let Some(index) = place.as_local() {
1123                     !promoted(index)
1124                 } else {
1125                     true
1126                 }
1127             }
1128             StatementKind::StorageLive(index) | StatementKind::StorageDead(index) => {
1129                 !promoted(*index)
1130             }
1131             _ => true,
1132         });
1133         let terminator = block.terminator_mut();
1134         match &terminator.kind {
1135             TerminatorKind::Drop { location: place, target, .. } => {
1136                 if let Some(index) = place.as_local() {
1137                     if promoted(index) {
1138                         terminator.kind = TerminatorKind::Goto { target: *target };
1139                     }
1140                 }
1141             }
1142             _ => {}
1143         }
1144     }
1145
1146     promotions
1147 }
1148
1149 /// This function returns `true` if the `const_in_array_repeat_expressions` feature attribute should
1150 /// be suggested. This function is probably quite expensive, it shouldn't be run in the happy path.
1151 /// Feature attribute should be suggested if `operand` can be promoted and the feature is not
1152 /// enabled.
1153 crate fn should_suggest_const_in_array_repeat_expressions_attribute<'tcx>(
1154     tcx: TyCtxt<'tcx>,
1155     mir_def_id: DefId,
1156     body: ReadOnlyBodyAndCache<'_, 'tcx>,
1157     operand: &Operand<'tcx>,
1158 ) -> bool {
1159     let mut rpo = traversal::reverse_postorder(&body);
1160     let (temps, _) = collect_temps_and_candidates(tcx, &body, &mut rpo);
1161     let validator =
1162         Validator { item: Item::new(tcx, mir_def_id, body), temps: &temps, explicit: false };
1163
1164     let should_promote = validator.validate_operand(operand).is_ok();
1165     let feature_flag = tcx.features().const_in_array_repeat_expressions;
1166     debug!(
1167         "should_suggest_const_in_array_repeat_expressions_flag: mir_def_id={:?} \
1168             should_promote={:?} feature_flag={:?}",
1169         mir_def_id, should_promote, feature_flag
1170     );
1171     should_promote && !feature_flag
1172 }