1 //! Propagates constants for early reporting of statically known
6 use rustc_ast::Mutability;
7 use rustc_data_structures::fx::FxHashSet;
8 use rustc_hir::def::DefKind;
10 use rustc_index::bit_set::BitSet;
11 use rustc_index::vec::IndexVec;
12 use rustc_middle::mir::visit::{
13 MutVisitor, MutatingUseContext, NonMutatingUseContext, PlaceContext, Visitor,
15 use rustc_middle::mir::{
16 AssertKind, BasicBlock, BinOp, Body, ClearCrossCrate, Constant, Local, LocalDecl, LocalKind,
17 Location, Operand, Place, Rvalue, SourceInfo, SourceScope, SourceScopeData, Statement,
18 StatementKind, Terminator, TerminatorKind, UnOp, RETURN_PLACE,
20 use rustc_middle::ty::layout::{HasTyCtxt, LayoutError, TyAndLayout};
21 use rustc_middle::ty::subst::{InternalSubsts, Subst};
22 use rustc_middle::ty::{
23 self, ConstInt, ConstKind, Instance, ParamEnv, ScalarInt, Ty, TyCtxt, TypeFoldable,
25 use rustc_session::lint;
26 use rustc_span::{def_id::DefId, Span};
27 use rustc_target::abi::{HasDataLayout, LayoutOf, Size, TargetDataLayout};
28 use rustc_target::spec::abi::Abi;
29 use rustc_trait_selection::traits;
31 use crate::const_eval::ConstEvalErr;
32 use crate::interpret::{
33 self, compile_time_machine, AllocId, Allocation, ConstValue, CtfeValidationMode, Frame, ImmTy,
34 Immediate, InterpCx, InterpResult, LocalState, LocalValue, MemPlace, Memory, MemoryKind, OpTy,
35 Operand as InterpOperand, PlaceTy, Pointer, Scalar, ScalarMaybeUninit, StackPopCleanup,
37 use crate::transform::MirPass;
39 /// The maximum number of bytes that we'll allocate space for a local or the return value.
40 /// Needed for #66397, because otherwise we eval into large places and that can cause OOM or just
41 /// Severely regress performance.
42 const MAX_ALLOC_LIMIT: u64 = 1024;
44 /// Macro for machine-specific `InterpError` without allocation.
45 /// (These will never be shown to the user, but they help diagnose ICEs.)
46 macro_rules! throw_machine_stop_str {
48 // We make a new local type for it. The type itself does not carry any information,
49 // but its vtable (for the `MachineStopType` trait) does.
51 // Printing this type shows the desired string.
52 impl std::fmt::Display for Zst {
53 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
57 impl rustc_middle::mir::interpret::MachineStopType for Zst {}
58 throw_machine_stop!(Zst)
64 impl<'tcx> MirPass<'tcx> for ConstProp {
65 fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
66 // will be evaluated by miri and produce its errors there
67 if body.source.promoted.is_some() {
71 use rustc_middle::hir::map::blocks::FnLikeNode;
72 let def_id = body.source.def_id().expect_local();
73 let hir_id = tcx.hir().local_def_id_to_hir_id(def_id);
75 let is_fn_like = FnLikeNode::from_node(tcx.hir().get(hir_id)).is_some();
76 let is_assoc_const = tcx.def_kind(def_id.to_def_id()) == DefKind::AssocConst;
78 // Only run const prop on functions, methods, closures and associated constants
79 if !is_fn_like && !is_assoc_const {
80 // skip anon_const/statics/consts because they'll be evaluated by miri anyway
81 trace!("ConstProp skipped for {:?}", def_id);
85 let is_generator = tcx.type_of(def_id.to_def_id()).is_generator();
86 // FIXME(welseywiser) const prop doesn't work on generators because of query cycles
87 // computing their layout.
89 trace!("ConstProp skipped for generator {:?}", def_id);
93 // Check if it's even possible to satisfy the 'where' clauses
95 // This branch will never be taken for any normal function.
96 // However, it's possible to `#!feature(trivial_bounds)]` to write
97 // a function with impossible to satisfy clauses, e.g.:
98 // `fn foo() where String: Copy {}`
100 // We don't usually need to worry about this kind of case,
101 // since we would get a compilation error if the user tried
102 // to call it. However, since we can do const propagation
103 // even without any calls to the function, we need to make
104 // sure that it even makes sense to try to evaluate the body.
105 // If there are unsatisfiable where clauses, then all bets are
106 // off, and we just give up.
108 // We manually filter the predicates, skipping anything that's not
109 // "global". We are in a potentially generic context
110 // (e.g. we are evaluating a function without substituting generic
111 // parameters, so this filtering serves two purposes:
113 // 1. We skip evaluating any predicates that we would
114 // never be able prove are unsatisfiable (e.g. `<T as Foo>`
115 // 2. We avoid trying to normalize predicates involving generic
116 // parameters (e.g. `<T as Foo>::MyItem`). This can confuse
117 // the normalization code (leading to cycle errors), since
118 // it's usually never invoked in this way.
120 .predicates_of(def_id.to_def_id())
123 .filter_map(|(p, _)| if p.is_global() { Some(*p) } else { None });
124 if traits::impossible_predicates(
126 traits::elaborate_predicates(tcx, predicates).map(|o| o.predicate).collect(),
128 trace!("ConstProp skipped for {:?}: found unsatisfiable predicates", def_id);
132 trace!("ConstProp starting for {:?}", def_id);
134 let dummy_body = &Body::new(
136 body.basic_blocks().clone(),
137 body.source_scopes.clone(),
138 body.local_decls.clone(),
146 // FIXME(oli-obk, eddyb) Optimize locals (or even local paths) to hold
147 // constants, instead of just checking for const-folding succeeding.
148 // That would require an uniform one-def no-mutation analysis
149 // and RPO (or recursing when needing the value of a local).
150 let mut optimization_finder = ConstPropagator::new(body, dummy_body, tcx);
151 optimization_finder.visit_body(body);
153 trace!("ConstProp done for {:?}", def_id);
157 struct ConstPropMachine<'mir, 'tcx> {
158 /// The virtual call stack.
159 stack: Vec<Frame<'mir, 'tcx, (), ()>>,
160 /// `OnlyInsideOwnBlock` locals that were written in the current block get erased at the end.
161 written_only_inside_own_block_locals: FxHashSet<Local>,
162 /// Locals that need to be cleared after every block terminates.
163 only_propagate_inside_block_locals: BitSet<Local>,
164 can_const_prop: IndexVec<Local, ConstPropMode>,
167 impl<'mir, 'tcx> ConstPropMachine<'mir, 'tcx> {
169 only_propagate_inside_block_locals: BitSet<Local>,
170 can_const_prop: IndexVec<Local, ConstPropMode>,
174 written_only_inside_own_block_locals: Default::default(),
175 only_propagate_inside_block_locals,
181 impl<'mir, 'tcx> interpret::Machine<'mir, 'tcx> for ConstPropMachine<'mir, 'tcx> {
182 compile_time_machine!(<'mir, 'tcx>);
186 type MemoryExtra = ();
189 _ecx: &InterpCx<'mir, 'tcx, Self>,
190 _instance: ty::InstanceDef<'tcx>,
191 ) -> InterpResult<'tcx, &'tcx Body<'tcx>> {
192 throw_machine_stop_str!("calling functions isn't supported in ConstProp")
195 fn find_mir_or_eval_fn(
196 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
197 _instance: ty::Instance<'tcx>,
199 _args: &[OpTy<'tcx>],
200 _ret: Option<(PlaceTy<'tcx>, BasicBlock)>,
201 _unwind: Option<BasicBlock>,
202 ) -> InterpResult<'tcx, Option<&'mir Body<'tcx>>> {
207 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
208 _instance: ty::Instance<'tcx>,
209 _args: &[OpTy<'tcx>],
210 _ret: Option<(PlaceTy<'tcx>, BasicBlock)>,
211 _unwind: Option<BasicBlock>,
212 ) -> InterpResult<'tcx> {
213 throw_machine_stop_str!("calling intrinsics isn't supported in ConstProp")
217 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
218 _msg: &rustc_middle::mir::AssertMessage<'tcx>,
219 _unwind: Option<rustc_middle::mir::BasicBlock>,
220 ) -> InterpResult<'tcx> {
221 bug!("panics terminators are not evaluated in ConstProp")
224 fn ptr_to_int(_mem: &Memory<'mir, 'tcx, Self>, _ptr: Pointer) -> InterpResult<'tcx, u64> {
225 throw_unsup!(ReadPointerAsBytes)
229 _ecx: &InterpCx<'mir, 'tcx, Self>,
233 ) -> InterpResult<'tcx, (Scalar, bool, Ty<'tcx>)> {
234 // We can't do this because aliasing of memory can differ between const eval and llvm
235 throw_machine_stop_str!("pointer arithmetic or comparisons aren't supported in ConstProp")
239 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
240 _dest: PlaceTy<'tcx>,
241 ) -> InterpResult<'tcx> {
242 throw_machine_stop_str!("can't const prop heap allocations")
246 _ecx: &InterpCx<'mir, 'tcx, Self>,
247 frame: &Frame<'mir, 'tcx, Self::PointerTag, Self::FrameExtra>,
249 ) -> InterpResult<'tcx, InterpOperand<Self::PointerTag>> {
250 let l = &frame.locals[local];
252 if l.value == LocalValue::Uninitialized {
253 throw_machine_stop_str!("tried to access an uninitialized local")
259 fn access_local_mut<'a>(
260 ecx: &'a mut InterpCx<'mir, 'tcx, Self>,
263 ) -> InterpResult<'tcx, Result<&'a mut LocalValue<Self::PointerTag>, MemPlace<Self::PointerTag>>>
265 if ecx.machine.can_const_prop[local] == ConstPropMode::NoPropagation {
266 throw_machine_stop_str!("tried to write to a local that is marked as not propagatable")
268 if frame == 0 && ecx.machine.only_propagate_inside_block_locals.contains(local) {
270 "mutating local {:?} which is restricted to its block. \
271 Will remove it from const-prop after block is finished.",
274 ecx.machine.written_only_inside_own_block_locals.insert(local);
276 ecx.machine.stack[frame].locals[local].access_mut()
279 fn before_access_global(
282 allocation: &Allocation<Self::PointerTag, Self::AllocExtra>,
283 _static_def_id: Option<DefId>,
285 ) -> InterpResult<'tcx> {
287 throw_machine_stop_str!("can't write to global");
289 // If the static allocation is mutable, then we can't const prop it as its content
290 // might be different at runtime.
291 if allocation.mutability == Mutability::Mut {
292 throw_machine_stop_str!("can't access mutable globals in ConstProp");
300 _ecx: &mut InterpCx<'mir, 'tcx, Self>,
301 frame: Frame<'mir, 'tcx>,
302 ) -> InterpResult<'tcx, Frame<'mir, 'tcx>> {
308 ecx: &'a InterpCx<'mir, 'tcx, Self>,
309 ) -> &'a [Frame<'mir, 'tcx, Self::PointerTag, Self::FrameExtra>] {
315 ecx: &'a mut InterpCx<'mir, 'tcx, Self>,
316 ) -> &'a mut Vec<Frame<'mir, 'tcx, Self::PointerTag, Self::FrameExtra>> {
317 &mut ecx.machine.stack
321 /// Finds optimization opportunities on the MIR.
322 struct ConstPropagator<'mir, 'tcx> {
323 ecx: InterpCx<'mir, 'tcx, ConstPropMachine<'mir, 'tcx>>,
325 param_env: ParamEnv<'tcx>,
326 // FIXME(eddyb) avoid cloning these two fields more than once,
327 // by accessing them through `ecx` instead.
328 source_scopes: IndexVec<SourceScope, SourceScopeData<'tcx>>,
329 local_decls: IndexVec<Local, LocalDecl<'tcx>>,
330 // Because we have `MutVisitor` we can't obtain the `SourceInfo` from a `Location`. So we store
331 // the last known `SourceInfo` here and just keep revisiting it.
332 source_info: Option<SourceInfo>,
335 impl<'mir, 'tcx> LayoutOf for ConstPropagator<'mir, 'tcx> {
337 type TyAndLayout = Result<TyAndLayout<'tcx>, LayoutError<'tcx>>;
339 fn layout_of(&self, ty: Ty<'tcx>) -> Self::TyAndLayout {
340 self.tcx.layout_of(self.param_env.and(ty))
344 impl<'mir, 'tcx> HasDataLayout for ConstPropagator<'mir, 'tcx> {
346 fn data_layout(&self) -> &TargetDataLayout {
347 &self.tcx.data_layout
351 impl<'mir, 'tcx> HasTyCtxt<'tcx> for ConstPropagator<'mir, 'tcx> {
353 fn tcx(&self) -> TyCtxt<'tcx> {
358 impl<'mir, 'tcx> ConstPropagator<'mir, 'tcx> {
361 dummy_body: &'mir Body<'tcx>,
363 ) -> ConstPropagator<'mir, 'tcx> {
364 let def_id = body.source.def_id();
365 let substs = &InternalSubsts::identity_for_item(tcx, def_id);
366 let param_env = tcx.param_env_reveal_all_normalized(def_id);
368 let span = tcx.def_span(def_id);
369 // FIXME: `CanConstProp::check` computes the layout of all locals, return those layouts
370 // so we can write them to `ecx.frame_mut().locals.layout, reducing the duplication in
371 // `layout_of` query invocations.
372 let can_const_prop = CanConstProp::check(tcx, param_env, body);
373 let mut only_propagate_inside_block_locals = BitSet::new_empty(can_const_prop.len());
374 for (l, mode) in can_const_prop.iter_enumerated() {
375 if *mode == ConstPropMode::OnlyInsideOwnBlock {
376 only_propagate_inside_block_locals.insert(l);
379 let mut ecx = InterpCx::new(
383 ConstPropMachine::new(only_propagate_inside_block_locals, can_const_prop),
388 .layout_of(body.return_ty().subst(tcx, substs))
390 // Don't bother allocating memory for ZST types which have no values
391 // or for large values.
392 .filter(|ret_layout| {
393 !ret_layout.is_zst() && ret_layout.size < Size::from_bytes(MAX_ALLOC_LIMIT)
395 .map(|ret_layout| ecx.allocate(ret_layout, MemoryKind::Stack));
397 ecx.push_stack_frame(
398 Instance::new(def_id, substs),
401 StackPopCleanup::None { cleanup: false },
403 .expect("failed to push initial stack frame");
409 // FIXME(eddyb) avoid cloning these two fields more than once,
410 // by accessing them through `ecx` instead.
411 source_scopes: body.source_scopes.clone(),
412 //FIXME(wesleywiser) we can't steal this because `Visitor::super_visit_body()` needs it
413 local_decls: body.local_decls.clone(),
418 fn get_const(&self, place: Place<'tcx>) -> Option<OpTy<'tcx>> {
419 let op = match self.ecx.eval_place_to_op(place, None) {
422 trace!("get_const failed: {}", e);
427 // Try to read the local as an immediate so that if it is representable as a scalar, we can
428 // handle it as such, but otherwise, just return the value as is.
429 Some(match self.ecx.try_read_immediate(op) {
430 Ok(Ok(imm)) => imm.into(),
435 /// Remove `local` from the pool of `Locals`. Allows writing to them,
436 /// but not reading from them anymore.
437 fn remove_const(ecx: &mut InterpCx<'mir, 'tcx, ConstPropMachine<'mir, 'tcx>>, local: Local) {
438 ecx.frame_mut().locals[local] =
439 LocalState { value: LocalValue::Uninitialized, layout: Cell::new(None) };
442 fn lint_root(&self, source_info: SourceInfo) -> Option<HirId> {
443 match &self.source_scopes[source_info.scope].local_data {
444 ClearCrossCrate::Set(data) => Some(data.lint_root),
445 ClearCrossCrate::Clear => None,
449 fn use_ecx<F, T>(&mut self, f: F) -> Option<T>
451 F: FnOnce(&mut Self) -> InterpResult<'tcx, T>,
454 Ok(val) => Some(val),
456 trace!("InterpCx operation failed: {:?}", error);
457 // Some errors shouldn't come up because creating them causes
458 // an allocation, which we should avoid. When that happens,
459 // dedicated error variants should be introduced instead.
461 !error.kind.allocates(),
462 "const-prop encountered allocating error: {}",
470 /// Returns the value, if any, of evaluating `c`.
471 fn eval_constant(&mut self, c: &Constant<'tcx>, source_info: SourceInfo) -> Option<OpTy<'tcx>> {
472 // FIXME we need to revisit this for #67176
477 match self.ecx.const_to_op(c.literal, None) {
480 let tcx = self.ecx.tcx.at(c.span);
481 let err = ConstEvalErr::new(&self.ecx, error, Some(c.span));
482 if let Some(lint_root) = self.lint_root(source_info) {
483 let lint_only = match c.literal.val {
484 // Promoteds must lint and not error as the user didn't ask for them
485 ConstKind::Unevaluated(_, _, Some(_)) => true,
486 // Out of backwards compatibility we cannot report hard errors in unused
487 // generic functions using associated constants of the generic parameters.
488 _ => c.literal.needs_subst(),
491 // Out of backwards compatibility we cannot report hard errors in unused
492 // generic functions using associated constants of the generic parameters.
493 err.report_as_lint(tcx, "erroneous constant used", lint_root, Some(c.span));
495 err.report_as_error(tcx, "erroneous constant used");
498 err.report_as_error(tcx, "erroneous constant used");
505 /// Returns the value, if any, of evaluating `place`.
506 fn eval_place(&mut self, place: Place<'tcx>) -> Option<OpTy<'tcx>> {
507 trace!("eval_place(place={:?})", place);
508 self.use_ecx(|this| this.ecx.eval_place_to_op(place, None))
511 /// Returns the value, if any, of evaluating `op`. Calls upon `eval_constant`
512 /// or `eval_place`, depending on the variant of `Operand` used.
513 fn eval_operand(&mut self, op: &Operand<'tcx>, source_info: SourceInfo) -> Option<OpTy<'tcx>> {
515 Operand::Constant(ref c) => self.eval_constant(c, source_info),
516 Operand::Move(place) | Operand::Copy(place) => self.eval_place(place),
520 fn report_assert_as_lint(
522 lint: &'static lint::Lint,
523 source_info: SourceInfo,
524 message: &'static str,
525 panic: AssertKind<impl std::fmt::Debug>,
527 let lint_root = self.lint_root(source_info)?;
528 self.tcx.struct_span_lint_hir(lint, lint_root, source_info.span, |lint| {
529 let mut err = lint.build(message);
530 err.span_label(source_info.span, format!("{:?}", panic));
540 source_info: SourceInfo,
542 if let (val, true) = self.use_ecx(|this| {
543 let val = this.ecx.read_immediate(this.ecx.eval_operand(arg, None)?)?;
544 let (_res, overflow, _ty) = this.ecx.overflowing_unary_op(op, val)?;
547 // `AssertKind` only has an `OverflowNeg` variant, so make sure that is
548 // appropriate to use.
549 assert_eq!(op, UnOp::Neg, "Neg is the only UnOp that can overflow");
550 self.report_assert_as_lint(
551 lint::builtin::ARITHMETIC_OVERFLOW,
553 "this arithmetic operation will overflow",
554 AssertKind::OverflowNeg(val.to_const_int()),
564 left: &Operand<'tcx>,
565 right: &Operand<'tcx>,
566 source_info: SourceInfo,
568 let r = self.use_ecx(|this| this.ecx.read_immediate(this.ecx.eval_operand(right, None)?));
569 let l = self.use_ecx(|this| this.ecx.read_immediate(this.ecx.eval_operand(left, None)?));
570 // Check for exceeding shifts *even if* we cannot evaluate the LHS.
571 if op == BinOp::Shr || op == BinOp::Shl {
573 // We need the type of the LHS. We cannot use `place_layout` as that is the type
574 // of the result, which for checked binops is not the same!
575 let left_ty = left.ty(&self.local_decls, self.tcx);
576 let left_size = self.ecx.layout_of(left_ty).ok()?.size;
577 let right_size = r.layout.size;
578 let r_bits = r.to_scalar().ok();
579 // This is basically `force_bits`.
580 let r_bits = r_bits.and_then(|r| r.to_bits_or_ptr(right_size, &self.tcx).ok());
581 if r_bits.map_or(false, |b| b >= left_size.bits() as u128) {
582 debug!("check_binary_op: reporting assert for {:?}", source_info);
583 self.report_assert_as_lint(
584 lint::builtin::ARITHMETIC_OVERFLOW,
586 "this arithmetic operation will overflow",
587 AssertKind::Overflow(
590 Some(l) => l.to_const_int(),
591 // Invent a dummy value, the diagnostic ignores it anyway
592 None => ConstInt::new(
593 ScalarInt::try_from_uint(1_u8, left_size).unwrap(),
595 left_ty.is_ptr_sized_integral(),
604 if let (Some(l), Some(r)) = (l, r) {
605 // The remaining operators are handled through `overflowing_binary_op`.
606 if self.use_ecx(|this| {
607 let (_res, overflow, _ty) = this.ecx.overflowing_binary_op(op, l, r)?;
610 self.report_assert_as_lint(
611 lint::builtin::ARITHMETIC_OVERFLOW,
613 "this arithmetic operation will overflow",
614 AssertKind::Overflow(op, l.to_const_int(), r.to_const_int()),
621 fn propagate_operand(&mut self, operand: &mut Operand<'tcx>) {
623 Operand::Copy(l) | Operand::Move(l) => {
624 if let Some(value) = self.get_const(l) {
625 if self.should_const_prop(value) {
626 // FIXME(felix91gr): this code only handles `Scalar` cases.
627 // For now, we're not handling `ScalarPair` cases because
628 // doing so here would require a lot of code duplication.
629 // We should hopefully generalize `Operand` handling into a fn,
630 // and use it to do const-prop here and everywhere else
631 // where it makes sense.
632 if let interpret::Operand::Immediate(interpret::Immediate::Scalar(
633 ScalarMaybeUninit::Scalar(scalar),
636 *operand = self.operand_from_scalar(
639 self.source_info.unwrap().span,
645 Operand::Constant(_) => (),
651 rvalue: &Rvalue<'tcx>,
652 source_info: SourceInfo,
655 // Perform any special handling for specific Rvalue types.
656 // Generally, checks here fall into one of two categories:
657 // 1. Additional checking to provide useful lints to the user
658 // - In this case, we will do some validation and then fall through to the
659 // end of the function which evals the assignment.
660 // 2. Working around bugs in other parts of the compiler
661 // - In this case, we'll return `None` from this function to stop evaluation.
663 // Additional checking: give lints to the user if an overflow would occur.
664 // We do this here and not in the `Assert` terminator as that terminator is
665 // only sometimes emitted (overflow checks can be disabled), but we want to always
667 Rvalue::UnaryOp(op, arg) => {
668 trace!("checking UnaryOp(op = {:?}, arg = {:?})", op, arg);
669 self.check_unary_op(*op, arg, source_info)?;
671 Rvalue::BinaryOp(op, left, right) => {
672 trace!("checking BinaryOp(op = {:?}, left = {:?}, right = {:?})", op, left, right);
673 self.check_binary_op(*op, left, right, source_info)?;
675 Rvalue::CheckedBinaryOp(op, left, right) => {
677 "checking CheckedBinaryOp(op = {:?}, left = {:?}, right = {:?})",
682 self.check_binary_op(*op, left, right, source_info)?;
685 // Do not try creating references (#67862)
686 Rvalue::AddressOf(_, place) | Rvalue::Ref(_, _, place) => {
687 trace!("skipping AddressOf | Ref for {:?}", place);
689 // This may be creating mutable references or immutable references to cells.
690 // If that happens, the pointed to value could be mutated via that reference.
691 // Since we aren't tracking references, the const propagator loses track of what
692 // value the local has right now.
693 // Thus, all locals that have their reference taken
694 // must not take part in propagation.
695 Self::remove_const(&mut self.ecx, place.local);
699 Rvalue::ThreadLocalRef(def_id) => {
700 trace!("skipping ThreadLocalRef({:?})", def_id);
705 // There's no other checking to do at this time.
706 Rvalue::Aggregate(..)
711 | Rvalue::Discriminant(..)
712 | Rvalue::NullaryOp(..) => {}
715 // FIXME we need to revisit this for #67176
716 if rvalue.needs_subst() {
720 if self.tcx.sess.opts.debugging_opts.mir_opt_level >= 3 {
721 self.eval_rvalue_with_identities(rvalue, place)
723 self.use_ecx(|this| this.ecx.eval_rvalue_into_place(rvalue, place))
727 // Attempt to use albegraic identities to eliminate constant expressions
728 fn eval_rvalue_with_identities(
730 rvalue: &Rvalue<'tcx>,
733 self.use_ecx(|this| {
735 Rvalue::BinaryOp(op, left, right) | Rvalue::CheckedBinaryOp(op, left, right) => {
736 let l = this.ecx.eval_operand(left, None);
737 let r = this.ecx.eval_operand(right, None);
739 let const_arg = match (l, r) {
740 (Ok(x), Err(_)) | (Err(_), Ok(x)) => this.ecx.read_immediate(x)?,
741 (Err(e), Err(_)) => return Err(e),
743 this.ecx.eval_rvalue_into_place(rvalue, place)?;
749 this.ecx.force_bits(const_arg.to_scalar()?, const_arg.layout.size)?;
750 let dest = this.ecx.eval_place(place)?;
755 this.ecx.write_immediate(*const_arg, dest)?;
759 if arg_value == const_arg.layout.size.truncate(u128::MAX)
760 || (const_arg.layout.ty.is_bool() && arg_value == 1)
762 this.ecx.write_immediate(*const_arg, dest)?;
766 if const_arg.layout.ty.is_integral() && arg_value == 0 {
767 if let Rvalue::CheckedBinaryOp(_, _, _) = rvalue {
768 let val = Immediate::ScalarPair(
769 const_arg.to_scalar()?.into(),
770 Scalar::from_bool(false).into(),
772 this.ecx.write_immediate(val, dest)?;
774 this.ecx.write_immediate(*const_arg, dest)?;
779 this.ecx.eval_rvalue_into_place(rvalue, place)?;
784 this.ecx.eval_rvalue_into_place(rvalue, place)?;
792 /// Creates a new `Operand::Constant` from a `Scalar` value
793 fn operand_from_scalar(&self, scalar: Scalar, ty: Ty<'tcx>, span: Span) -> Operand<'tcx> {
794 Operand::Constant(Box::new(Constant {
797 literal: ty::Const::from_scalar(self.tcx, scalar, ty),
801 fn replace_with_const(
803 rval: &mut Rvalue<'tcx>,
805 source_info: SourceInfo,
807 if let Rvalue::Use(Operand::Constant(c)) = rval {
808 if !matches!(c.literal.val, ConstKind::Unevaluated(..)) {
809 trace!("skipping replace of Rvalue::Use({:?} because it is already a const", c);
814 trace!("attempting to replace {:?} with {:?}", rval, value);
815 if let Err(e) = self.ecx.const_validate_operand(
818 // FIXME: is ref tracking too expensive?
819 // FIXME: what is the point of ref tracking if we do not even check the tracked refs?
820 &mut interpret::RefTracking::empty(),
821 CtfeValidationMode::Regular,
823 trace!("validation error, attempt failed: {:?}", e);
827 // FIXME> figure out what to do when try_read_immediate fails
828 let imm = self.use_ecx(|this| this.ecx.try_read_immediate(value));
830 if let Some(Ok(imm)) = imm {
832 interpret::Immediate::Scalar(ScalarMaybeUninit::Scalar(scalar)) => {
833 *rval = Rvalue::Use(self.operand_from_scalar(
839 Immediate::ScalarPair(
840 ScalarMaybeUninit::Scalar(_),
841 ScalarMaybeUninit::Scalar(_),
843 // Found a value represented as a pair. For now only do const-prop if the type
844 // of `rvalue` is also a tuple with two scalars.
845 // FIXME: enable the general case stated above ^.
846 let ty = &value.layout.ty;
847 // Only do it for tuples
848 if let ty::Tuple(substs) = ty.kind() {
849 // Only do it if tuple is also a pair with two scalars
850 if substs.len() == 2 {
851 let alloc = self.use_ecx(|this| {
852 let ty1 = substs[0].expect_ty();
853 let ty2 = substs[1].expect_ty();
854 let ty_is_scalar = |ty| {
855 this.ecx.layout_of(ty).ok().map(|layout| layout.abi.is_scalar())
858 if ty_is_scalar(ty1) && ty_is_scalar(ty2) {
861 .intern_with_temp_alloc(value.layout, |ecx, dest| {
862 ecx.write_immediate_to_mplace(*imm, dest)
871 if let Some(Some(alloc)) = alloc {
872 // Assign entire constant in a single statement.
873 // We can't use aggregates, as we run after the aggregate-lowering `MirPhase`.
874 *rval = Rvalue::Use(Operand::Constant(Box::new(Constant {
875 span: source_info.span,
877 literal: self.ecx.tcx.mk_const(ty::Const {
879 val: ty::ConstKind::Value(ConstValue::ByRef {
889 // Scalars or scalar pairs that contain undef values are assumed to not have
890 // successfully evaluated and are thus not propagated.
896 /// Returns `true` if and only if this `op` should be const-propagated into.
897 fn should_const_prop(&mut self, op: OpTy<'tcx>) -> bool {
898 let mir_opt_level = self.tcx.sess.opts.debugging_opts.mir_opt_level;
900 if mir_opt_level == 0 {
904 if !self.tcx.consider_optimizing(|| format!("ConstantPropagation - OpTy: {:?}", op)) {
909 interpret::Operand::Immediate(Immediate::Scalar(ScalarMaybeUninit::Scalar(s))) => {
912 interpret::Operand::Immediate(Immediate::ScalarPair(
913 ScalarMaybeUninit::Scalar(l),
914 ScalarMaybeUninit::Scalar(r),
915 )) => l.is_bits() && r.is_bits(),
921 /// The mode that `ConstProp` is allowed to run in for a given `Local`.
922 #[derive(Clone, Copy, Debug, PartialEq)]
924 /// The `Local` can be propagated into and reads of this `Local` can also be propagated.
926 /// The `Local` can only be propagated into and from its own block.
928 /// The `Local` can be propagated into but reads cannot be propagated.
930 /// The `Local` cannot be part of propagation at all. Any statement
931 /// referencing it either for reading or writing will not get propagated.
935 struct CanConstProp {
936 can_const_prop: IndexVec<Local, ConstPropMode>,
937 // False at the beginning. Once set, no more assignments are allowed to that local.
938 found_assignment: BitSet<Local>,
939 // Cache of locals' information
940 local_kinds: IndexVec<Local, LocalKind>,
944 /// Returns true if `local` can be propagated
947 param_env: ParamEnv<'tcx>,
949 ) -> IndexVec<Local, ConstPropMode> {
950 let mut cpv = CanConstProp {
951 can_const_prop: IndexVec::from_elem(ConstPropMode::FullConstProp, &body.local_decls),
952 found_assignment: BitSet::new_empty(body.local_decls.len()),
953 local_kinds: IndexVec::from_fn_n(
954 |local| body.local_kind(local),
955 body.local_decls.len(),
958 for (local, val) in cpv.can_const_prop.iter_enumerated_mut() {
959 let ty = body.local_decls[local].ty;
960 match tcx.layout_of(param_env.and(ty)) {
961 Ok(layout) if layout.size < Size::from_bytes(MAX_ALLOC_LIMIT) => {}
962 // Either the layout fails to compute, then we can't use this local anyway
963 // or the local is too large, then we don't want to.
965 *val = ConstPropMode::NoPropagation;
969 // Cannot use args at all
970 // Cannot use locals because if x < y { y - x } else { x - y } would
972 // FIXME(oli-obk): lint variables until they are used in a condition
973 // FIXME(oli-obk): lint if return value is constant
974 if cpv.local_kinds[local] == LocalKind::Arg {
975 *val = ConstPropMode::OnlyPropagateInto;
977 "local {:?} can't be const propagated because it's a function argument",
980 } else if cpv.local_kinds[local] == LocalKind::Var {
981 *val = ConstPropMode::OnlyInsideOwnBlock;
983 "local {:?} will only be propagated inside its block, because it's a user variable",
988 cpv.visit_body(&body);
993 impl<'tcx> Visitor<'tcx> for CanConstProp {
994 fn visit_local(&mut self, &local: &Local, context: PlaceContext, _: Location) {
995 use rustc_middle::mir::visit::PlaceContext::*;
997 // Projections are fine, because `&mut foo.x` will be caught by
998 // `MutatingUseContext::Borrow` elsewhere.
999 MutatingUse(MutatingUseContext::Projection)
1000 // These are just stores, where the storing is not propagatable, but there may be later
1001 // mutations of the same local via `Store`
1002 | MutatingUse(MutatingUseContext::Call)
1003 // Actual store that can possibly even propagate a value
1004 | MutatingUse(MutatingUseContext::Store) => {
1005 if !self.found_assignment.insert(local) {
1006 match &mut self.can_const_prop[local] {
1007 // If the local can only get propagated in its own block, then we don't have
1008 // to worry about multiple assignments, as we'll nuke the const state at the
1009 // end of the block anyway, and inside the block we overwrite previous
1010 // states as applicable.
1011 ConstPropMode::OnlyInsideOwnBlock => {}
1012 ConstPropMode::NoPropagation => {}
1013 ConstPropMode::OnlyPropagateInto => {}
1014 other @ ConstPropMode::FullConstProp => {
1016 "local {:?} can't be propagated because of multiple assignments. Previous state: {:?}",
1019 *other = ConstPropMode::OnlyInsideOwnBlock;
1024 // Reading constants is allowed an arbitrary number of times
1025 NonMutatingUse(NonMutatingUseContext::Copy)
1026 | NonMutatingUse(NonMutatingUseContext::Move)
1027 | NonMutatingUse(NonMutatingUseContext::Inspect)
1028 | NonMutatingUse(NonMutatingUseContext::Projection)
1031 // These could be propagated with a smarter analysis or just some careful thinking about
1032 // whether they'd be fine right now.
1033 MutatingUse(MutatingUseContext::AsmOutput)
1034 | MutatingUse(MutatingUseContext::Yield)
1035 | MutatingUse(MutatingUseContext::Drop)
1036 | MutatingUse(MutatingUseContext::Retag)
1037 // These can't ever be propagated under any scheme, as we can't reason about indirect
1039 | NonMutatingUse(NonMutatingUseContext::SharedBorrow)
1040 | NonMutatingUse(NonMutatingUseContext::ShallowBorrow)
1041 | NonMutatingUse(NonMutatingUseContext::UniqueBorrow)
1042 | NonMutatingUse(NonMutatingUseContext::AddressOf)
1043 | MutatingUse(MutatingUseContext::Borrow)
1044 | MutatingUse(MutatingUseContext::AddressOf) => {
1045 trace!("local {:?} can't be propagaged because it's used: {:?}", local, context);
1046 self.can_const_prop[local] = ConstPropMode::NoPropagation;
1052 impl<'mir, 'tcx> MutVisitor<'tcx> for ConstPropagator<'mir, 'tcx> {
1053 fn tcx(&self) -> TyCtxt<'tcx> {
1057 fn visit_body(&mut self, body: &mut Body<'tcx>) {
1058 for (bb, data) in body.basic_blocks_mut().iter_enumerated_mut() {
1059 self.visit_basic_block_data(bb, data);
1063 fn visit_operand(&mut self, operand: &mut Operand<'tcx>, location: Location) {
1064 self.super_operand(operand, location);
1066 // Only const prop copies and moves on `mir_opt_level=2` as doing so
1067 // currently slightly increases compile time in some cases.
1068 if self.tcx.sess.opts.debugging_opts.mir_opt_level >= 2 {
1069 self.propagate_operand(operand)
1073 fn visit_constant(&mut self, constant: &mut Constant<'tcx>, location: Location) {
1074 trace!("visit_constant: {:?}", constant);
1075 self.super_constant(constant, location);
1076 self.eval_constant(constant, self.source_info.unwrap());
1079 fn visit_statement(&mut self, statement: &mut Statement<'tcx>, location: Location) {
1080 trace!("visit_statement: {:?}", statement);
1081 let source_info = statement.source_info;
1082 self.source_info = Some(source_info);
1083 if let StatementKind::Assign(box (place, ref mut rval)) = statement.kind {
1084 let can_const_prop = self.ecx.machine.can_const_prop[place.local];
1085 if let Some(()) = self.const_prop(rval, source_info, place) {
1086 // This will return None if the above `const_prop` invocation only "wrote" a
1087 // type whose creation requires no write. E.g. a generator whose initial state
1088 // consists solely of uninitialized memory (so it doesn't capture any locals).
1089 if let Some(value) = self.get_const(place) {
1090 if self.should_const_prop(value) {
1091 trace!("replacing {:?} with {:?}", rval, value);
1092 self.replace_with_const(rval, value, source_info);
1093 if can_const_prop == ConstPropMode::FullConstProp
1094 || can_const_prop == ConstPropMode::OnlyInsideOwnBlock
1096 trace!("propagated into {:?}", place);
1100 match can_const_prop {
1101 ConstPropMode::OnlyInsideOwnBlock => {
1103 "found local restricted to its block. \
1104 Will remove it from const-prop after block is finished. Local: {:?}",
1108 ConstPropMode::OnlyPropagateInto | ConstPropMode::NoPropagation => {
1109 trace!("can't propagate into {:?}", place);
1110 if place.local != RETURN_PLACE {
1111 Self::remove_const(&mut self.ecx, place.local);
1114 ConstPropMode::FullConstProp => {}
1117 // Const prop failed, so erase the destination, ensuring that whatever happens
1118 // from here on, does not know about the previous value.
1119 // This is important in case we have
1122 // x = SOME_MUTABLE_STATIC;
1123 // // x must now be uninit
1125 // FIXME: we overzealously erase the entire local, because that's easier to
1128 "propagation into {:?} failed.
1129 Nuking the entire site from orbit, it's the only way to be sure",
1132 Self::remove_const(&mut self.ecx, place.local);
1135 match statement.kind {
1136 StatementKind::SetDiscriminant { ref place, .. } => {
1137 match self.ecx.machine.can_const_prop[place.local] {
1138 ConstPropMode::FullConstProp | ConstPropMode::OnlyInsideOwnBlock => {
1139 if self.use_ecx(|this| this.ecx.statement(statement)).is_some() {
1140 trace!("propped discriminant into {:?}", place);
1142 Self::remove_const(&mut self.ecx, place.local);
1145 ConstPropMode::OnlyPropagateInto | ConstPropMode::NoPropagation => {
1146 Self::remove_const(&mut self.ecx, place.local);
1150 StatementKind::StorageLive(local) | StatementKind::StorageDead(local) => {
1151 let frame = self.ecx.frame_mut();
1152 frame.locals[local].value =
1153 if let StatementKind::StorageLive(_) = statement.kind {
1154 LocalValue::Uninitialized
1163 self.super_statement(statement, location);
1166 fn visit_terminator(&mut self, terminator: &mut Terminator<'tcx>, location: Location) {
1167 let source_info = terminator.source_info;
1168 self.source_info = Some(source_info);
1169 self.super_terminator(terminator, location);
1170 match &mut terminator.kind {
1171 TerminatorKind::Assert { expected, ref msg, ref mut cond, .. } => {
1172 if let Some(value) = self.eval_operand(&cond, source_info) {
1173 trace!("assertion on {:?} should be {:?}", value, expected);
1174 let expected = ScalarMaybeUninit::from(Scalar::from_bool(*expected));
1175 let value_const = self.ecx.read_scalar(value).unwrap();
1176 if expected != value_const {
1181 impl<T: std::fmt::Debug> std::fmt::Debug for DbgVal<T> {
1182 fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
1184 Self::Val(val) => val.fmt(fmt),
1185 Self::Underscore => fmt.write_str("_"),
1189 let mut eval_to_int = |op| {
1190 // This can be `None` if the lhs wasn't const propagated and we just
1191 // triggered the assert on the value of the rhs.
1192 match self.eval_operand(op, source_info) {
1194 DbgVal::Val(self.ecx.read_immediate(op).unwrap().to_const_int())
1196 None => DbgVal::Underscore,
1199 let msg = match msg {
1200 AssertKind::DivisionByZero(op) => {
1201 Some(AssertKind::DivisionByZero(eval_to_int(op)))
1203 AssertKind::RemainderByZero(op) => {
1204 Some(AssertKind::RemainderByZero(eval_to_int(op)))
1206 AssertKind::BoundsCheck { ref len, ref index } => {
1207 let len = eval_to_int(len);
1208 let index = eval_to_int(index);
1209 Some(AssertKind::BoundsCheck { len, index })
1211 // Overflow is are already covered by checks on the binary operators.
1212 AssertKind::Overflow(..) | AssertKind::OverflowNeg(_) => None,
1213 // Need proper const propagator for these.
1216 // Poison all places this operand references so that further code
1217 // doesn't use the invalid value
1219 Operand::Move(ref place) | Operand::Copy(ref place) => {
1220 Self::remove_const(&mut self.ecx, place.local);
1222 Operand::Constant(_) => {}
1224 if let Some(msg) = msg {
1225 self.report_assert_as_lint(
1226 lint::builtin::UNCONDITIONAL_PANIC,
1228 "this operation will panic at runtime",
1233 if self.should_const_prop(value) {
1234 if let ScalarMaybeUninit::Scalar(scalar) = value_const {
1235 *cond = self.operand_from_scalar(
1237 self.tcx.types.bool,
1245 TerminatorKind::SwitchInt { ref mut discr, .. } => {
1246 // FIXME: This is currently redundant with `visit_operand`, but sadly
1247 // always visiting operands currently causes a perf regression in LLVM codegen, so
1248 // `visit_operand` currently only runs for propagates places for `mir_opt_level=3`.
1249 self.propagate_operand(discr)
1251 // None of these have Operands to const-propagate.
1252 TerminatorKind::Goto { .. }
1253 | TerminatorKind::Resume
1254 | TerminatorKind::Abort
1255 | TerminatorKind::Return
1256 | TerminatorKind::Unreachable
1257 | TerminatorKind::Drop { .. }
1258 | TerminatorKind::DropAndReplace { .. }
1259 | TerminatorKind::Yield { .. }
1260 | TerminatorKind::GeneratorDrop
1261 | TerminatorKind::FalseEdge { .. }
1262 | TerminatorKind::FalseUnwind { .. }
1263 | TerminatorKind::InlineAsm { .. } => {}
1264 // Every argument in our function calls have already been propagated in `visit_operand`.
1266 // NOTE: because LLVM codegen gives slight performance regressions with it, so this is
1267 // gated on `mir_opt_level=2`.
1268 TerminatorKind::Call { .. } => {}
1271 // We remove all Locals which are restricted in propagation to their containing blocks and
1272 // which were modified in the current block.
1273 // Take it out of the ecx so we can get a mutable reference to the ecx for `remove_const`.
1274 let mut locals = std::mem::take(&mut self.ecx.machine.written_only_inside_own_block_locals);
1275 for &local in locals.iter() {
1276 Self::remove_const(&mut self.ecx, local);
1279 // Put it back so we reuse the heap of the storage
1280 self.ecx.machine.written_only_inside_own_block_locals = locals;
1281 if cfg!(debug_assertions) {
1282 // Ensure we are correctly erasing locals with the non-debug-assert logic.
1283 for local in self.ecx.machine.only_propagate_inside_block_locals.iter() {
1285 self.get_const(local.into()).is_none()
1287 .layout_of(self.local_decls[local].ty)
1288 .map_or(true, |layout| layout.is_zst())