1 //! A pass that promotes borrows of constant rvalues.
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.
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.
16 use rustc_middle::mir;
17 use rustc_middle::mir::traversal::ReversePostorderIter;
18 use rustc_middle::mir::visit::{MutVisitor, MutatingUseContext, PlaceContext, Visitor};
19 use rustc_middle::mir::*;
20 use rustc_middle::ty::subst::InternalSubsts;
21 use rustc_middle::ty::{self, List, TyCtxt, TypeVisitable};
24 use rustc_index::vec::{Idx, IndexVec};
27 use std::{cmp, iter, mem};
29 use crate::transform::check_consts::{qualifs, ConstCx};
31 /// A `MirPass` for promotion.
33 /// Promotion is the extraction of promotable temps into separate MIR bodies so they can have
34 /// `'static` lifetime.
36 /// After this pass is run, `promoted_fragments` will hold the MIR body corresponding to each
37 /// newly created `Constant`.
39 pub struct PromoteTemps<'tcx> {
40 pub promoted_fragments: Cell<IndexVec<Promoted, Body<'tcx>>>,
43 impl<'tcx> MirPass<'tcx> for PromoteTemps<'tcx> {
44 fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
45 // There's not really any point in promoting errorful MIR.
47 // This does not include MIR that failed const-checking, which we still try to promote.
48 if let Err(_) = body.return_ty().error_reported() {
49 debug!("PromoteTemps: MIR had errors");
52 if body.source.promoted.is_some() {
56 let mut rpo = traversal::reverse_postorder(body);
57 let ccx = ConstCx::new(tcx, body);
58 let (mut temps, all_candidates) = collect_temps_and_candidates(&ccx, &mut rpo);
60 let promotable_candidates = validate_candidates(&ccx, &mut temps, &all_candidates);
62 let promoted = promote_candidates(body, tcx, temps, promotable_candidates);
63 self.promoted_fragments.set(promoted);
67 /// State of a temporary during collection and promotion.
68 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
70 /// No references to this temp.
72 /// One direct assignment and any number of direct uses.
73 /// A borrow of this temp is promotable if the assigned
74 /// value is qualified as constant.
75 Defined { location: Location, uses: usize, valid: Result<(), ()> },
76 /// Any other combination of assignments/uses.
78 /// This temp was part of an rvalue which got extracted
79 /// during promotion and needs cleanup.
84 pub fn is_promotable(&self) -> bool {
85 debug!("is_promotable: self={:?}", self);
86 matches!(self, TempState::Defined { .. })
90 /// A "root candidate" for promotion, which will become the
91 /// returned value in a promoted MIR, unless it's a subset
92 /// of a larger candidate.
93 #[derive(Copy, Clone, PartialEq, Eq, Debug)]
94 pub struct Candidate {
98 struct Collector<'a, 'tcx> {
99 ccx: &'a ConstCx<'a, 'tcx>,
100 temps: IndexVec<Local, TempState>,
101 candidates: Vec<Candidate>,
104 impl<'tcx> Visitor<'tcx> for Collector<'_, 'tcx> {
105 fn visit_local(&mut self, index: Local, context: PlaceContext, location: Location) {
106 debug!("visit_local: index={:?} context={:?} location={:?}", index, context, location);
107 // We're only interested in temporaries and the return place
108 match self.ccx.body.local_kind(index) {
109 LocalKind::Temp | LocalKind::ReturnPointer => {}
110 LocalKind::Arg | LocalKind::Var => return,
113 // Ignore drops, if the temp gets promoted,
114 // then it's constant and thus drop is noop.
115 // Non-uses are also irrelevant.
116 if context.is_drop() || !context.is_use() {
118 "visit_local: context.is_drop={:?} context.is_use={:?}",
125 let temp = &mut self.temps[index];
126 debug!("visit_local: temp={:?}", temp);
127 if *temp == TempState::Undefined {
129 PlaceContext::MutatingUse(MutatingUseContext::Store)
130 | PlaceContext::MutatingUse(MutatingUseContext::Call) => {
131 *temp = TempState::Defined { location, uses: 0, valid: Err(()) };
134 _ => { /* mark as unpromotable below */ }
136 } else if let TempState::Defined { ref mut uses, .. } = *temp {
137 // We always allow borrows, even mutable ones, as we need
138 // to promote mutable borrows of some ZSTs e.g., `&mut []`.
139 let allowed_use = match context {
140 PlaceContext::MutatingUse(MutatingUseContext::Borrow)
141 | PlaceContext::NonMutatingUse(_) => true,
142 PlaceContext::MutatingUse(_) | PlaceContext::NonUse(_) => false,
144 debug!("visit_local: allowed_use={:?}", allowed_use);
149 /* mark as unpromotable below */
151 *temp = TempState::Unpromotable;
154 fn visit_rvalue(&mut self, rvalue: &Rvalue<'tcx>, location: Location) {
155 self.super_rvalue(rvalue, location);
159 self.candidates.push(Candidate { location });
166 pub fn collect_temps_and_candidates<'tcx>(
167 ccx: &ConstCx<'_, 'tcx>,
168 rpo: &mut ReversePostorderIter<'_, 'tcx>,
169 ) -> (IndexVec<Local, TempState>, Vec<Candidate>) {
170 let mut collector = Collector {
171 temps: IndexVec::from_elem(TempState::Undefined, &ccx.body.local_decls),
175 for (bb, data) in rpo {
176 collector.visit_basic_block_data(bb, data);
178 (collector.temps, collector.candidates)
181 /// Checks whether locals that appear in a promotion context (`Candidate`) are actually promotable.
183 /// This wraps an `Item`, and has access to all fields of that `Item` via `Deref` coercion.
184 struct Validator<'a, 'tcx> {
185 ccx: &'a ConstCx<'a, 'tcx>,
186 temps: &'a mut IndexVec<Local, TempState>,
189 impl<'a, 'tcx> std::ops::Deref for Validator<'a, 'tcx> {
190 type Target = ConstCx<'a, 'tcx>;
192 fn deref(&self) -> &Self::Target {
199 impl<'tcx> Validator<'_, 'tcx> {
200 fn validate_candidate(&mut self, candidate: Candidate) -> Result<(), Unpromotable> {
201 let loc = candidate.location;
202 let statement = &self.body[loc.block].statements[loc.statement_index];
203 match &statement.kind {
204 StatementKind::Assign(box (_, Rvalue::Ref(_, kind, place))) => {
205 // We can only promote interior borrows of promotable temps (non-temps
206 // don't get promoted anyway).
207 self.validate_local(place.local)?;
209 // The reference operation itself must be promotable.
210 // (Needs to come after `validate_local` to avoid ICEs.)
211 self.validate_ref(*kind, place)?;
213 // We do not check all the projections (they do not get promoted anyway),
214 // but we do stay away from promoting anything involving a dereference.
215 if place.projection.contains(&ProjectionElem::Deref) {
216 return Err(Unpromotable);
219 // We cannot promote things that need dropping, since the promoted value
220 // would not get dropped.
221 if self.qualif_local::<qualifs::NeedsDrop>(place.local) {
222 return Err(Unpromotable);
231 // FIXME(eddyb) maybe cache this?
232 fn qualif_local<Q: qualifs::Qualif>(&mut self, local: Local) -> bool {
233 if let TempState::Defined { location: loc, .. } = self.temps[local] {
234 let num_stmts = self.body[loc.block].statements.len();
236 if loc.statement_index < num_stmts {
237 let statement = &self.body[loc.block].statements[loc.statement_index];
238 match &statement.kind {
239 StatementKind::Assign(box (_, rhs)) => qualifs::in_rvalue::<Q, _>(
241 &mut |l| self.qualif_local::<Q>(l),
246 statement.source_info.span,
247 "{:?} is not an assignment",
253 let terminator = self.body[loc.block].terminator();
254 match &terminator.kind {
255 TerminatorKind::Call { .. } => {
256 let return_ty = self.body.local_decls[local].ty;
257 Q::in_any_value_of_ty(&self.ccx, return_ty)
260 span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
265 let span = self.body.local_decls[local].source_info.span;
266 span_bug!(span, "{:?} not promotable, qualif_local shouldn't have been called", local);
270 fn validate_local(&mut self, local: Local) -> Result<(), Unpromotable> {
271 if let TempState::Defined { location: loc, uses, valid } = self.temps[local] {
274 let block = &self.body[loc.block];
275 let num_stmts = block.statements.len();
277 if loc.statement_index < num_stmts {
278 let statement = &block.statements[loc.statement_index];
279 match &statement.kind {
280 StatementKind::Assign(box (_, rhs)) => self.validate_rvalue(rhs),
283 statement.source_info.span,
284 "{:?} is not an assignment",
290 let terminator = block.terminator();
291 match &terminator.kind {
292 TerminatorKind::Call { func, args, .. } => {
293 self.validate_call(func, args)
295 TerminatorKind::Yield { .. } => Err(Unpromotable),
297 span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
302 self.temps[local] = match ok {
303 Ok(()) => TempState::Defined { location: loc, uses, valid: Ok(()) },
304 Err(_) => TempState::Unpromotable,
313 fn validate_place(&mut self, place: PlaceRef<'tcx>) -> Result<(), Unpromotable> {
314 match place.last_projection() {
315 None => self.validate_local(place.local),
316 Some((place_base, elem)) => {
317 // Validate topmost projection, then recurse.
319 ProjectionElem::Deref => {
320 let mut promotable = false;
321 // We need to make sure this is a `Deref` of a local with no further projections.
322 // Discussion can be found at
323 // https://github.com/rust-lang/rust/pull/74945#discussion_r463063247
324 if let Some(local) = place_base.as_local() {
325 // This is a special treatment for cases like *&STATIC where STATIC is a
326 // global static variable.
327 // This pattern is generated only when global static variables are directly
328 // accessed and is qualified for promotion safely.
329 if let TempState::Defined { location, .. } = self.temps[local] {
330 let def_stmt = self.body[location.block]
332 .get(location.statement_index);
333 if let Some(Statement {
335 StatementKind::Assign(box (
337 Rvalue::Use(Operand::Constant(c)),
342 if let Some(did) = c.check_static_ptr(self.tcx) {
343 // Evaluating a promoted may not read statics except if it got
344 // promoted from a static (this is a CTFE check). So we
345 // can only promote static accesses inside statics.
346 if let Some(hir::ConstContext::Static(..)) = self.const_kind
348 if !self.tcx.is_thread_local_static(did) {
357 return Err(Unpromotable);
360 ProjectionElem::OpaqueCast(..) | ProjectionElem::Downcast(..) => {
361 return Err(Unpromotable);
364 ProjectionElem::ConstantIndex { .. } | ProjectionElem::Subslice { .. } => {}
366 ProjectionElem::Index(local) => {
367 let mut promotable = false;
368 // Only accept if we can predict the index and are indexing an array.
370 if let TempState::Defined { location: loc, .. } = self.temps[local] {
371 let block = &self.body[loc.block];
372 if loc.statement_index < block.statements.len() {
373 let statement = &block.statements[loc.statement_index];
374 match &statement.kind {
375 StatementKind::Assign(box (
377 Rvalue::Use(Operand::Constant(c)),
378 )) => c.literal.try_eval_usize(self.tcx, self.param_env),
387 if let Some(idx) = val {
388 // Determine the type of the thing we are indexing.
389 let ty = place_base.ty(self.body, self.tcx).ty;
391 ty::Array(_, len) => {
392 // It's an array; determine its length.
393 if let Some(len) = len.try_eval_usize(self.tcx, self.param_env)
395 // If the index is in-bounds, go ahead.
405 return Err(Unpromotable);
408 self.validate_local(local)?;
411 ProjectionElem::Field(..) => {
412 let base_ty = place_base.ty(self.body, self.tcx).ty;
413 if base_ty.is_union() {
414 // No promotion of union field accesses.
415 return Err(Unpromotable);
420 self.validate_place(place_base)
425 fn validate_operand(&mut self, operand: &Operand<'tcx>) -> Result<(), Unpromotable> {
427 Operand::Copy(place) | Operand::Move(place) => self.validate_place(place.as_ref()),
429 // The qualifs for a constant (e.g. `HasMutInterior`) are checked in
430 // `validate_rvalue` upon access.
431 Operand::Constant(c) => {
432 if let Some(def_id) = c.check_static_ptr(self.tcx) {
433 // Only allow statics (not consts) to refer to other statics.
434 // FIXME(eddyb) does this matter at all for promotion?
435 // FIXME(RalfJung) it makes little sense to not promote this in `fn`/`const fn`,
436 // and in `const` this cannot occur anyway. The only concern is that we might
437 // promote even `let x = &STATIC` which would be useless, but this applies to
438 // promotion inside statics as well.
439 let is_static = matches!(self.const_kind, Some(hir::ConstContext::Static(_)));
441 return Err(Unpromotable);
444 let is_thread_local = self.tcx.is_thread_local_static(def_id);
446 return Err(Unpromotable);
455 fn validate_ref(&mut self, kind: BorrowKind, place: &Place<'tcx>) -> Result<(), Unpromotable> {
457 // Reject these borrow types just to be safe.
458 // FIXME(RalfJung): could we allow them? Should we? No point in it until we have a usecase.
459 BorrowKind::Shallow | BorrowKind::Unique => return Err(Unpromotable),
461 BorrowKind::Shared => {
462 let has_mut_interior = self.qualif_local::<qualifs::HasMutInterior>(place.local);
463 if has_mut_interior {
464 return Err(Unpromotable);
468 BorrowKind::Mut { .. } => {
469 let ty = place.ty(self.body, self.tcx).ty;
471 // In theory, any zero-sized value could be borrowed
472 // mutably without consequences. However, only &mut []
473 // is allowed right now.
474 if let ty::Array(_, len) = ty.kind() {
475 match len.try_eval_usize(self.tcx, self.param_env) {
477 _ => return Err(Unpromotable),
480 return Err(Unpromotable);
488 fn validate_rvalue(&mut self, rvalue: &Rvalue<'tcx>) -> Result<(), Unpromotable> {
490 Rvalue::Use(operand) | Rvalue::Repeat(operand, _) => {
491 self.validate_operand(operand)?;
493 Rvalue::CopyForDeref(place) => {
494 let op = &Operand::Copy(*place);
495 self.validate_operand(op)?
498 Rvalue::Discriminant(place) | Rvalue::Len(place) => {
499 self.validate_place(place.as_ref())?
502 Rvalue::ThreadLocalRef(_) => return Err(Unpromotable),
504 // ptr-to-int casts are not possible in consts and thus not promotable
505 Rvalue::Cast(CastKind::PointerExposeAddress, _, _) => return Err(Unpromotable),
507 // all other casts including int-to-ptr casts are fine, they just use the integer value
509 Rvalue::Cast(_, operand, _) => {
510 self.validate_operand(operand)?;
513 Rvalue::NullaryOp(op, _) => match op {
515 NullOp::AlignOf => {}
518 Rvalue::ShallowInitBox(_, _) => return Err(Unpromotable),
520 Rvalue::UnaryOp(op, operand) => {
522 // These operations can never fail.
523 UnOp::Neg | UnOp::Not => {}
526 self.validate_operand(operand)?;
529 Rvalue::BinaryOp(op, box (lhs, rhs)) | Rvalue::CheckedBinaryOp(op, box (lhs, rhs)) => {
531 let lhs_ty = lhs.ty(self.body, self.tcx);
533 if let ty::RawPtr(_) | ty::FnPtr(..) = lhs_ty.kind() {
534 // Raw and fn pointer operations are not allowed inside consts and thus not promotable.
545 return Err(Unpromotable);
549 BinOp::Div | BinOp::Rem => {
550 if lhs_ty.is_integral() {
551 // Integer division: the RHS must be a non-zero const.
552 let const_val = match rhs {
553 Operand::Constant(c) => {
554 c.literal.try_eval_bits(self.tcx, self.param_env, lhs_ty)
559 Some(x) if x != 0 => {} // okay
560 _ => return Err(Unpromotable), // value not known or 0 -- not okay
564 // The remaining operations can never fail.
582 self.validate_operand(lhs)?;
583 self.validate_operand(rhs)?;
586 Rvalue::AddressOf(_, place) => {
587 // We accept `&raw *`, i.e., raw reborrows -- creating a raw pointer is
588 // no problem, only using it is.
589 if let Some((place_base, ProjectionElem::Deref)) = place.as_ref().last_projection()
591 let base_ty = place_base.ty(self.body, self.tcx).ty;
592 if let ty::Ref(..) = base_ty.kind() {
593 return self.validate_place(place_base);
596 return Err(Unpromotable);
599 Rvalue::Ref(_, kind, place) => {
600 // Special-case reborrows to be more like a copy of the reference.
601 let mut place_simplified = place.as_ref();
602 if let Some((place_base, ProjectionElem::Deref)) =
603 place_simplified.last_projection()
605 let base_ty = place_base.ty(self.body, self.tcx).ty;
606 if let ty::Ref(..) = base_ty.kind() {
607 place_simplified = place_base;
611 self.validate_place(place_simplified)?;
613 // Check that the reference is fine (using the original place!).
614 // (Needs to come after `validate_place` to avoid ICEs.)
615 self.validate_ref(*kind, place)?;
618 Rvalue::Aggregate(_, operands) => {
620 self.validate_operand(o)?;
630 callee: &Operand<'tcx>,
631 args: &[Operand<'tcx>],
632 ) -> Result<(), Unpromotable> {
633 let fn_ty = callee.ty(self.body, self.tcx);
635 // Inside const/static items, we promote all (eligible) function calls.
636 // Everywhere else, we require `#[rustc_promotable]` on the callee.
637 let promote_all_const_fn = matches!(
639 Some(hir::ConstContext::Static(_) | hir::ConstContext::Const)
641 if !promote_all_const_fn {
642 if let ty::FnDef(def_id, _) = *fn_ty.kind() {
643 // Never promote runtime `const fn` calls of
644 // functions without `#[rustc_promotable]`.
645 if !self.tcx.is_promotable_const_fn(def_id) {
646 return Err(Unpromotable);
651 let is_const_fn = match *fn_ty.kind() {
652 ty::FnDef(def_id, _) => self.tcx.is_const_fn_raw(def_id),
656 return Err(Unpromotable);
659 self.validate_operand(callee)?;
661 self.validate_operand(arg)?;
668 // FIXME(eddyb) remove the differences for promotability in `static`, `const`, `const fn`.
669 pub fn validate_candidates(
670 ccx: &ConstCx<'_, '_>,
671 temps: &mut IndexVec<Local, TempState>,
672 candidates: &[Candidate],
673 ) -> Vec<Candidate> {
674 let mut validator = Validator { ccx, temps };
679 .filter(|&candidate| validator.validate_candidate(candidate).is_ok())
683 struct Promoter<'a, 'tcx> {
685 source: &'a mut Body<'tcx>,
686 promoted: Body<'tcx>,
687 temps: &'a mut IndexVec<Local, TempState>,
688 extra_statements: &'a mut Vec<(Location, Statement<'tcx>)>,
690 /// If true, all nested temps are also kept in the
691 /// source MIR, not moved to the promoted MIR.
695 impl<'a, 'tcx> Promoter<'a, 'tcx> {
696 fn new_block(&mut self) -> BasicBlock {
697 let span = self.promoted.span;
698 self.promoted.basic_blocks_mut().push(BasicBlockData {
700 terminator: Some(Terminator {
701 source_info: SourceInfo::outermost(span),
702 kind: TerminatorKind::Return,
708 fn assign(&mut self, dest: Local, rvalue: Rvalue<'tcx>, span: Span) {
709 let last = self.promoted.basic_blocks.last().unwrap();
710 let data = &mut self.promoted[last];
711 data.statements.push(Statement {
712 source_info: SourceInfo::outermost(span),
713 kind: StatementKind::Assign(Box::new((Place::from(dest), rvalue))),
717 fn is_temp_kind(&self, local: Local) -> bool {
718 self.source.local_kind(local) == LocalKind::Temp
721 /// Copies the initialization of this temp to the
722 /// promoted MIR, recursing through temps.
723 fn promote_temp(&mut self, temp: Local) -> Local {
724 let old_keep_original = self.keep_original;
725 let loc = match self.temps[temp] {
726 TempState::Defined { location, uses, .. } if uses > 0 => {
728 self.keep_original = true;
733 span_bug!(self.promoted.span, "{:?} not promotable: {:?}", temp, state);
736 if !self.keep_original {
737 self.temps[temp] = TempState::PromotedOut;
740 let num_stmts = self.source[loc.block].statements.len();
741 let new_temp = self.promoted.local_decls.push(LocalDecl::new(
742 self.source.local_decls[temp].ty,
743 self.source.local_decls[temp].source_info.span,
746 debug!("promote({:?} @ {:?}/{:?}, {:?})", temp, loc, num_stmts, self.keep_original);
748 // First, take the Rvalue or Call out of the source MIR,
749 // or duplicate it, depending on keep_original.
750 if loc.statement_index < num_stmts {
751 let (mut rvalue, source_info) = {
752 let statement = &mut self.source[loc.block].statements[loc.statement_index];
753 let StatementKind::Assign(box (_, ref mut rhs)) = statement.kind else {
755 statement.source_info.span,
756 "{:?} is not an assignment",
762 if self.keep_original {
765 let unit = Rvalue::Use(Operand::Constant(Box::new(Constant {
766 span: statement.source_info.span,
768 literal: ConstantKind::zero_sized(self.tcx.types.unit),
770 mem::replace(rhs, unit)
772 statement.source_info,
776 self.visit_rvalue(&mut rvalue, loc);
777 self.assign(new_temp, rvalue, source_info.span);
779 let terminator = if self.keep_original {
780 self.source[loc.block].terminator().clone()
782 let terminator = self.source[loc.block].terminator_mut();
783 let target = match terminator.kind {
784 TerminatorKind::Call { target: Some(target), .. } => target,
786 span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
790 source_info: terminator.source_info,
791 kind: mem::replace(&mut terminator.kind, TerminatorKind::Goto { target }),
795 match terminator.kind {
796 TerminatorKind::Call { mut func, mut args, from_hir_call, fn_span, .. } => {
797 self.visit_operand(&mut func, loc);
798 for arg in &mut args {
799 self.visit_operand(arg, loc);
802 let last = self.promoted.basic_blocks.last().unwrap();
803 let new_target = self.new_block();
805 *self.promoted[last].terminator_mut() = Terminator {
806 kind: TerminatorKind::Call {
810 destination: Place::from(new_temp),
811 target: Some(new_target),
815 source_info: SourceInfo::outermost(terminator.source_info.span),
820 span_bug!(terminator.source_info.span, "{:?} not promotable", kind);
825 self.keep_original = old_keep_original;
829 fn promote_candidate(mut self, candidate: Candidate, next_promoted_id: usize) -> Body<'tcx> {
830 let def = self.source.source.with_opt_param();
832 let promoted = &mut self.promoted;
833 let promoted_id = Promoted::new(next_promoted_id);
835 let mut promoted_operand = |ty, span| {
836 promoted.span = span;
837 promoted.local_decls[RETURN_PLACE] = LocalDecl::new(ty, span);
838 let substs = tcx.erase_regions(InternalSubsts::identity_for_item(tcx, def.did));
839 let uneval = mir::UnevaluatedConst { def, substs, promoted: Some(promoted_id) };
841 Operand::Constant(Box::new(Constant {
844 literal: ConstantKind::Unevaluated(uneval, ty),
848 let blocks = self.source.basic_blocks.as_mut();
849 let local_decls = &mut self.source.local_decls;
850 let loc = candidate.location;
851 let statement = &mut blocks[loc.block].statements[loc.statement_index];
852 match statement.kind {
853 StatementKind::Assign(box (
855 Rvalue::Ref(ref mut region, borrow_kind, ref mut place),
857 // Use the underlying local for this (necessarily interior) borrow.
858 let ty = local_decls[place.local].ty;
859 let span = statement.source_info.span;
861 let ref_ty = tcx.mk_ref(
862 tcx.lifetimes.re_erased,
863 ty::TypeAndMut { ty, mutbl: borrow_kind.to_mutbl_lossy() },
866 *region = tcx.lifetimes.re_erased;
868 let mut projection = vec![PlaceElem::Deref];
869 projection.extend(place.projection);
870 place.projection = tcx.intern_place_elems(&projection);
872 // Create a temp to hold the promoted reference.
873 // This is because `*r` requires `r` to be a local,
874 // otherwise we would use the `promoted` directly.
875 let mut promoted_ref = LocalDecl::new(ref_ty, span);
876 promoted_ref.source_info = statement.source_info;
877 let promoted_ref = local_decls.push(promoted_ref);
878 assert_eq!(self.temps.push(TempState::Unpromotable), promoted_ref);
880 let promoted_ref_statement = Statement {
881 source_info: statement.source_info,
882 kind: StatementKind::Assign(Box::new((
883 Place::from(promoted_ref),
884 Rvalue::Use(promoted_operand(ref_ty, span)),
887 self.extra_statements.push((loc, promoted_ref_statement));
890 tcx.lifetimes.re_erased,
893 local: mem::replace(&mut place.local, promoted_ref),
894 projection: List::empty(),
902 assert_eq!(self.new_block(), START_BLOCK);
905 Location { block: BasicBlock::new(0), statement_index: usize::MAX },
908 let span = self.promoted.span;
909 self.assign(RETURN_PLACE, rvalue, span);
914 /// Replaces all temporaries with their promoted counterparts.
915 impl<'a, 'tcx> MutVisitor<'tcx> for Promoter<'a, 'tcx> {
916 fn tcx(&self) -> TyCtxt<'tcx> {
920 fn visit_local(&mut self, local: &mut Local, _: PlaceContext, _: Location) {
921 if self.is_temp_kind(*local) {
922 *local = self.promote_temp(*local);
927 pub fn promote_candidates<'tcx>(
928 body: &mut Body<'tcx>,
930 mut temps: IndexVec<Local, TempState>,
931 candidates: Vec<Candidate>,
932 ) -> IndexVec<Promoted, Body<'tcx>> {
933 // Visit candidates in reverse, in case they're nested.
934 debug!("promote_candidates({:?})", candidates);
936 let mut promotions = IndexVec::new();
938 let mut extra_statements = vec![];
939 for candidate in candidates.into_iter().rev() {
940 let Location { block, statement_index } = candidate.location;
941 if let StatementKind::Assign(box (place, _)) = &body[block].statements[statement_index].kind
943 if let Some(local) = place.as_local() {
944 if temps[local] == TempState::PromotedOut {
951 // Declare return place local so that `mir::Body::new` doesn't complain.
952 let initial_locals = iter::once(LocalDecl::new(tcx.types.never, body.span)).collect();
954 let mut scope = body.source_scopes[body.source_info(candidate.location).scope].clone();
955 scope.parent_scope = None;
957 let mut promoted = Body::new(
958 body.source, // `promoted` gets filled in below
960 IndexVec::from_elem_n(scope, 1),
966 body.generator_kind(),
967 body.tainted_by_errors,
969 promoted.phase = MirPhase::Analysis(AnalysisPhase::Initial);
971 let promoter = Promoter {
976 extra_statements: &mut extra_statements,
977 keep_original: false,
980 let mut promoted = promoter.promote_candidate(candidate, promotions.len());
981 promoted.source.promoted = Some(promotions.next_index());
982 promotions.push(promoted);
985 // Insert each of `extra_statements` before its indicated location, which
986 // has to be done in reverse location order, to not invalidate the rest.
987 extra_statements.sort_by_key(|&(loc, _)| cmp::Reverse(loc));
988 for (loc, statement) in extra_statements {
989 body[loc.block].statements.insert(loc.statement_index, statement);
992 // Eliminate assignments to, and drops of promoted temps.
993 let promoted = |index: Local| temps[index] == TempState::PromotedOut;
994 for block in body.basic_blocks_mut() {
995 block.statements.retain(|statement| match &statement.kind {
996 StatementKind::Assign(box (place, _)) => {
997 if let Some(index) = place.as_local() {
1003 StatementKind::StorageLive(index) | StatementKind::StorageDead(index) => {
1008 let terminator = block.terminator_mut();
1009 if let TerminatorKind::Drop { place, target, .. } = &terminator.kind {
1010 if let Some(index) = place.as_local() {
1011 if promoted(index) {
1012 terminator.kind = TerminatorKind::Goto { target: *target };
1021 /// This function returns `true` if the function being called in the array
1022 /// repeat expression is a `const` function.
1023 pub fn is_const_fn_in_array_repeat_expression<'tcx>(
1024 ccx: &ConstCx<'_, 'tcx>,
1025 place: &Place<'tcx>,
1028 match place.as_local() {
1029 // rule out cases such as: `let my_var = some_fn(); [my_var; N]`
1030 Some(local) if body.local_decls[local].is_user_variable() => return false,
1031 None => return false,
1035 for block in body.basic_blocks.iter() {
1036 if let Some(Terminator { kind: TerminatorKind::Call { func, destination, .. }, .. }) =
1039 if let Operand::Constant(box Constant { literal, .. }) = func {
1040 if let ty::FnDef(def_id, _) = *literal.ty().kind() {
1041 if destination == place {
1042 if ccx.tcx.is_const_fn(def_id) {