Remove overflow checks from ConstProp.
This commit is contained in:
parent
4bd2ebc58b
commit
e34caaf42d
8 changed files with 88 additions and 116 deletions
|
@ -15,7 +15,7 @@ use rustc_middle::mir::visit::{
|
||||||
};
|
};
|
||||||
use rustc_middle::mir::{
|
use rustc_middle::mir::{
|
||||||
BasicBlock, BinOp, Body, Constant, ConstantKind, Local, LocalDecl, LocalKind, Location,
|
BasicBlock, BinOp, Body, Constant, ConstantKind, Local, LocalDecl, LocalKind, Location,
|
||||||
Operand, Place, Rvalue, SourceInfo, Statement, StatementKind, Terminator, TerminatorKind, UnOp,
|
Operand, Place, Rvalue, SourceInfo, Statement, StatementKind, Terminator, TerminatorKind,
|
||||||
RETURN_PLACE,
|
RETURN_PLACE,
|
||||||
};
|
};
|
||||||
use rustc_middle::ty::layout::{LayoutError, LayoutOf, LayoutOfHelpers, TyAndLayout};
|
use rustc_middle::ty::layout::{LayoutError, LayoutOf, LayoutOfHelpers, TyAndLayout};
|
||||||
|
@ -503,55 +503,6 @@ impl<'mir, 'tcx> ConstPropagator<'mir, 'tcx> {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn check_unary_op(&mut self, op: UnOp, arg: &Operand<'tcx>) -> Option<()> {
|
|
||||||
if self.use_ecx(|this| {
|
|
||||||
let val = this.ecx.read_immediate(&this.ecx.eval_operand(arg, None)?)?;
|
|
||||||
let (_res, overflow, _ty) = this.ecx.overflowing_unary_op(op, &val)?;
|
|
||||||
Ok(overflow)
|
|
||||||
})? {
|
|
||||||
// `AssertKind` only has an `OverflowNeg` variant, so make sure that is
|
|
||||||
// appropriate to use.
|
|
||||||
assert_eq!(op, UnOp::Neg, "Neg is the only UnOp that can overflow");
|
|
||||||
return None;
|
|
||||||
}
|
|
||||||
|
|
||||||
Some(())
|
|
||||||
}
|
|
||||||
|
|
||||||
fn check_binary_op(
|
|
||||||
&mut self,
|
|
||||||
op: BinOp,
|
|
||||||
left: &Operand<'tcx>,
|
|
||||||
right: &Operand<'tcx>,
|
|
||||||
) -> Option<()> {
|
|
||||||
let r = self.use_ecx(|this| this.ecx.read_immediate(&this.ecx.eval_operand(right, None)?));
|
|
||||||
let l = self.use_ecx(|this| this.ecx.read_immediate(&this.ecx.eval_operand(left, None)?));
|
|
||||||
// Check for exceeding shifts *even if* we cannot evaluate the LHS.
|
|
||||||
if matches!(op, BinOp::Shr | BinOp::Shl) {
|
|
||||||
let r = r.clone()?;
|
|
||||||
// We need the type of the LHS. We cannot use `place_layout` as that is the type
|
|
||||||
// of the result, which for checked binops is not the same!
|
|
||||||
let left_ty = left.ty(self.local_decls, self.tcx);
|
|
||||||
let left_size = self.ecx.layout_of(left_ty).ok()?.size;
|
|
||||||
let right_size = r.layout.size;
|
|
||||||
let r_bits = r.to_scalar().to_bits(right_size).ok();
|
|
||||||
if r_bits.map_or(false, |b| b >= left_size.bits() as u128) {
|
|
||||||
return None;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if let (Some(l), Some(r)) = (&l, &r) {
|
|
||||||
// The remaining operators are handled through `overflowing_binary_op`.
|
|
||||||
if self.use_ecx(|this| {
|
|
||||||
let (_res, overflow, _ty) = this.ecx.overflowing_binary_op(op, l, r)?;
|
|
||||||
Ok(overflow)
|
|
||||||
})? {
|
|
||||||
return None;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
Some(())
|
|
||||||
}
|
|
||||||
|
|
||||||
fn propagate_operand(&mut self, operand: &mut Operand<'tcx>) {
|
fn propagate_operand(&mut self, operand: &mut Operand<'tcx>) {
|
||||||
match *operand {
|
match *operand {
|
||||||
Operand::Copy(l) | Operand::Move(l) => {
|
Operand::Copy(l) | Operand::Move(l) => {
|
||||||
|
@ -587,28 +538,6 @@ impl<'mir, 'tcx> ConstPropagator<'mir, 'tcx> {
|
||||||
// 2. Working around bugs in other parts of the compiler
|
// 2. Working around bugs in other parts of the compiler
|
||||||
// - In this case, we'll return `None` from this function to stop evaluation.
|
// - In this case, we'll return `None` from this function to stop evaluation.
|
||||||
match rvalue {
|
match rvalue {
|
||||||
// Additional checking: give lints to the user if an overflow would occur.
|
|
||||||
// We do this here and not in the `Assert` terminator as that terminator is
|
|
||||||
// only sometimes emitted (overflow checks can be disabled), but we want to always
|
|
||||||
// lint.
|
|
||||||
Rvalue::UnaryOp(op, arg) => {
|
|
||||||
trace!("checking UnaryOp(op = {:?}, arg = {:?})", op, arg);
|
|
||||||
self.check_unary_op(*op, arg)?;
|
|
||||||
}
|
|
||||||
Rvalue::BinaryOp(op, box (left, right)) => {
|
|
||||||
trace!("checking BinaryOp(op = {:?}, left = {:?}, right = {:?})", op, left, right);
|
|
||||||
self.check_binary_op(*op, left, right)?;
|
|
||||||
}
|
|
||||||
Rvalue::CheckedBinaryOp(op, box (left, right)) => {
|
|
||||||
trace!(
|
|
||||||
"checking CheckedBinaryOp(op = {:?}, left = {:?}, right = {:?})",
|
|
||||||
op,
|
|
||||||
left,
|
|
||||||
right
|
|
||||||
);
|
|
||||||
self.check_binary_op(*op, left, right)?;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Do not try creating references (#67862)
|
// Do not try creating references (#67862)
|
||||||
Rvalue::AddressOf(_, place) | Rvalue::Ref(_, _, place) => {
|
Rvalue::AddressOf(_, place) | Rvalue::Ref(_, _, place) => {
|
||||||
trace!("skipping AddressOf | Ref for {:?}", place);
|
trace!("skipping AddressOf | Ref for {:?}", place);
|
||||||
|
@ -638,7 +567,10 @@ impl<'mir, 'tcx> ConstPropagator<'mir, 'tcx> {
|
||||||
| Rvalue::Cast(..)
|
| Rvalue::Cast(..)
|
||||||
| Rvalue::ShallowInitBox(..)
|
| Rvalue::ShallowInitBox(..)
|
||||||
| Rvalue::Discriminant(..)
|
| Rvalue::Discriminant(..)
|
||||||
| Rvalue::NullaryOp(..) => {}
|
| Rvalue::NullaryOp(..)
|
||||||
|
| Rvalue::UnaryOp(..)
|
||||||
|
| Rvalue::BinaryOp(..)
|
||||||
|
| Rvalue::CheckedBinaryOp(..) => {}
|
||||||
}
|
}
|
||||||
|
|
||||||
// FIXME we need to revisit this for #67176
|
// FIXME we need to revisit this for #67176
|
||||||
|
@ -1079,31 +1011,18 @@ impl<'tcx> MutVisitor<'tcx> for ConstPropagator<'_, 'tcx> {
|
||||||
// Do NOT early return in this function, it does some crucial fixup of the state at the end!
|
// Do NOT early return in this function, it does some crucial fixup of the state at the end!
|
||||||
match &mut terminator.kind {
|
match &mut terminator.kind {
|
||||||
TerminatorKind::Assert { expected, ref mut cond, .. } => {
|
TerminatorKind::Assert { expected, ref mut cond, .. } => {
|
||||||
if let Some(ref value) = self.eval_operand(&cond) {
|
if let Some(ref value) = self.eval_operand(&cond)
|
||||||
trace!("assertion on {:?} should be {:?}", value, expected);
|
|
||||||
let expected = Scalar::from_bool(*expected);
|
|
||||||
// FIXME should be used use_ecx rather than a local match... but we have
|
// FIXME should be used use_ecx rather than a local match... but we have
|
||||||
// quite a few of these read_scalar/read_immediate that need fixing.
|
// quite a few of these read_scalar/read_immediate that need fixing.
|
||||||
if let Ok(value_const) = self.ecx.read_scalar(&value) {
|
&& let Ok(value_const) = self.ecx.read_scalar(&value)
|
||||||
if expected != value_const {
|
&& self.should_const_prop(value)
|
||||||
// Poison all places this operand references so that further code
|
{
|
||||||
// doesn't use the invalid value
|
trace!("assertion on {:?} should be {:?}", value, expected);
|
||||||
match cond {
|
*cond = self.operand_from_scalar(
|
||||||
Operand::Move(ref place) | Operand::Copy(ref place) => {
|
value_const,
|
||||||
Self::remove_const(&mut self.ecx, place.local);
|
self.tcx.types.bool,
|
||||||
}
|
source_info.span,
|
||||||
Operand::Constant(_) => {}
|
);
|
||||||
}
|
|
||||||
} else {
|
|
||||||
if self.should_const_prop(value) {
|
|
||||||
*cond = self.operand_from_scalar(
|
|
||||||
value_const,
|
|
||||||
self.tcx.types.bool,
|
|
||||||
source_info.span,
|
|
||||||
);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
TerminatorKind::SwitchInt { ref mut discr, .. } => {
|
TerminatorKind::SwitchInt { ref mut discr, .. } => {
|
||||||
|
|
|
@ -180,12 +180,7 @@ impl<'tcx> ValueAnalysis<'tcx> for ConstAnalysis<'_, 'tcx> {
|
||||||
let overflow = match overflow {
|
let overflow = match overflow {
|
||||||
FlatSet::Top => FlatSet::Top,
|
FlatSet::Top => FlatSet::Top,
|
||||||
FlatSet::Elem(overflow) => {
|
FlatSet::Elem(overflow) => {
|
||||||
if overflow {
|
self.wrap_scalar(Scalar::from_bool(overflow), self.tcx.types.bool)
|
||||||
// Overflow cannot be reliably propagated. See: https://github.com/rust-lang/rust/pull/101168#issuecomment-1288091446
|
|
||||||
FlatSet::Top
|
|
||||||
} else {
|
|
||||||
self.wrap_scalar(Scalar::from_bool(false), self.tcx.types.bool)
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
FlatSet::Bottom => FlatSet::Bottom,
|
FlatSet::Bottom => FlatSet::Bottom,
|
||||||
};
|
};
|
||||||
|
|
|
@ -24,9 +24,10 @@
|
||||||
StorageLive(_3); // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:18: +2:19
|
StorageLive(_3); // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:18: +2:19
|
||||||
- _3 = _1; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:18: +2:19
|
- _3 = _1; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:18: +2:19
|
||||||
- _4 = Eq(_3, const 0_i32); // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
- _4 = Eq(_3, const 0_i32); // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
||||||
|
- assert(!move _4, "attempt to divide `{}` by zero", const 1_i32) -> bb1; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
||||||
+ _3 = const 0_i32; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:18: +2:19
|
+ _3 = const 0_i32; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:18: +2:19
|
||||||
+ _4 = const true; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
+ _4 = const true; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
||||||
assert(!move _4, "attempt to divide `{}` by zero", const 1_i32) -> bb1; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
+ assert(!const true, "attempt to divide `{}` by zero", const 1_i32) -> bb1; // scope 1 at $DIR/bad_op_div_by_zero.rs:+2:14: +2:19
|
||||||
}
|
}
|
||||||
|
|
||||||
bb1: {
|
bb1: {
|
||||||
|
|
|
@ -0,0 +1,39 @@
|
||||||
|
- // MIR for `main` before ConstProp
|
||||||
|
+ // MIR for `main` after ConstProp
|
||||||
|
|
||||||
|
fn main() -> () {
|
||||||
|
let mut _0: (); // return place in scope 0 at $DIR/inherit_overflow.rs:+0:11: +0:11
|
||||||
|
let mut _1: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
let mut _2: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
let mut _3: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
scope 1 {
|
||||||
|
}
|
||||||
|
scope 2 (inlined <u8 as Add>::add) { // at $DIR/inherit_overflow.rs:8:13: 8:47
|
||||||
|
debug self => _2; // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
debug other => _3; // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
let mut _4: (u8, bool); // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
}
|
||||||
|
|
||||||
|
bb0: {
|
||||||
|
StorageLive(_1); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
StorageLive(_2); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
_2 = const u8::MAX; // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
StorageLive(_3); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
_3 = const 1_u8; // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
- _4 = CheckedAdd(_2, _3); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
- assert(!move (_4.1: bool), "attempt to compute `{} + {}`, which would overflow", _2, _3) -> bb1; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
+ _4 = const (0_u8, true); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", _2, _3) -> bb1; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
}
|
||||||
|
|
||||||
|
bb1: {
|
||||||
|
- _1 = move (_4.0: u8); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
+ _1 = const 0_u8; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
StorageDead(_3); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
StorageDead(_2); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
StorageDead(_1); // scope 0 at $DIR/inherit_overflow.rs:+3:47: +3:48
|
||||||
|
_0 = const (); // scope 0 at $DIR/inherit_overflow.rs:+0:11: +4:2
|
||||||
|
return; // scope 0 at $DIR/inherit_overflow.rs:+4:2: +4:2
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
9
tests/mir-opt/const_prop/inherit_overflow.rs
Normal file
9
tests/mir-opt/const_prop/inherit_overflow.rs
Normal file
|
@ -0,0 +1,9 @@
|
||||||
|
// unit-test: ConstProp
|
||||||
|
// compile-flags: -Zmir-enable-passes=+Inline
|
||||||
|
|
||||||
|
// EMIT_MIR inherit_overflow.main.ConstProp.diff
|
||||||
|
fn main() {
|
||||||
|
// After inlining, this will contain a `CheckedBinaryOp`.
|
||||||
|
// Propagating the overflow is ok as codegen will just skip emitting the panic.
|
||||||
|
let _ = <u8 as std::ops::Add>::add(255, 1);
|
||||||
|
}
|
|
@ -61,7 +61,7 @@
|
||||||
- assert(!move (_10.1: bool), "attempt to compute `{} + {}`, which would overflow", move _9, const 1_i32) -> bb2; // scope 4 at $DIR/checked.rs:+6:13: +6:18
|
- assert(!move (_10.1: bool), "attempt to compute `{} + {}`, which would overflow", move _9, const 1_i32) -> bb2; // scope 4 at $DIR/checked.rs:+6:13: +6:18
|
||||||
+ _9 = const i32::MAX; // scope 4 at $DIR/checked.rs:+6:13: +6:14
|
+ _9 = const i32::MAX; // scope 4 at $DIR/checked.rs:+6:13: +6:14
|
||||||
+ _10 = CheckedAdd(const i32::MAX, const 1_i32); // scope 4 at $DIR/checked.rs:+6:13: +6:18
|
+ _10 = CheckedAdd(const i32::MAX, const 1_i32); // scope 4 at $DIR/checked.rs:+6:13: +6:18
|
||||||
+ assert(!move (_10.1: bool), "attempt to compute `{} + {}`, which would overflow", const i32::MAX, const 1_i32) -> bb2; // scope 4 at $DIR/checked.rs:+6:13: +6:18
|
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", const i32::MAX, const 1_i32) -> bb2; // scope 4 at $DIR/checked.rs:+6:13: +6:18
|
||||||
}
|
}
|
||||||
|
|
||||||
bb2: {
|
bb2: {
|
||||||
|
|
|
@ -5,26 +5,34 @@
|
||||||
let mut _0: (); // return place in scope 0 at $DIR/inherit_overflow.rs:+0:11: +0:11
|
let mut _0: (); // return place in scope 0 at $DIR/inherit_overflow.rs:+0:11: +0:11
|
||||||
let mut _1: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
let mut _1: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
let mut _2: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
let mut _2: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
let mut _3: u8; // in scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
scope 1 {
|
scope 1 {
|
||||||
}
|
}
|
||||||
scope 2 (inlined <u8 as Add>::add) { // at $DIR/inherit_overflow.rs:7:13: 7:47
|
scope 2 (inlined <u8 as Add>::add) { // at $DIR/inherit_overflow.rs:8:13: 8:47
|
||||||
debug self => _1; // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
debug self => _2; // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
debug other => _2; // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
debug other => _3; // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
let mut _3: (u8, bool); // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
let mut _4: (u8, bool); // in scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
}
|
}
|
||||||
|
|
||||||
bb0: {
|
bb0: {
|
||||||
StorageLive(_1); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
StorageLive(_1); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
_1 = const u8::MAX; // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
|
||||||
StorageLive(_2); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
StorageLive(_2); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
_2 = const 1_u8; // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
_2 = const u8::MAX; // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
_3 = CheckedAdd(const u8::MAX, const 1_u8); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
StorageLive(_3); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
assert(!move (_3.1: bool), "attempt to compute `{} + {}`, which would overflow", const u8::MAX, const 1_u8) -> bb1; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
_3 = const 1_u8; // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
|
- _4 = CheckedAdd(_2, _3); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
- assert(!move (_4.1: bool), "attempt to compute `{} + {}`, which would overflow", _2, _3) -> bb1; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
+ _4 = CheckedAdd(const u8::MAX, const 1_u8); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", const u8::MAX, const 1_u8) -> bb1; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
}
|
}
|
||||||
|
|
||||||
bb1: {
|
bb1: {
|
||||||
|
- _1 = move (_4.0: u8); // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
+ _1 = const 0_u8; // scope 2 at $SRC_DIR/core/src/ops/arith.rs:LL:COL
|
||||||
|
StorageDead(_3); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
StorageDead(_2); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
StorageDead(_2); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
||||||
StorageDead(_1); // scope 0 at $DIR/inherit_overflow.rs:+3:13: +3:47
|
StorageDead(_1); // scope 0 at $DIR/inherit_overflow.rs:+3:47: +3:48
|
||||||
|
_0 = const (); // scope 0 at $DIR/inherit_overflow.rs:+0:11: +4:2
|
||||||
return; // scope 0 at $DIR/inherit_overflow.rs:+4:2: +4:2
|
return; // scope 0 at $DIR/inherit_overflow.rs:+4:2: +4:2
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,8 +1,9 @@
|
||||||
// compile-flags: -Zunsound-mir-opts
|
// unit-test: DataflowConstProp
|
||||||
|
// compile-flags: -Zmir-enable-passes=+Inline
|
||||||
|
|
||||||
// EMIT_MIR inherit_overflow.main.DataflowConstProp.diff
|
// EMIT_MIR inherit_overflow.main.DataflowConstProp.diff
|
||||||
fn main() {
|
fn main() {
|
||||||
// After inlining, this will contain a `CheckedBinaryOp`. The overflow
|
// After inlining, this will contain a `CheckedBinaryOp`.
|
||||||
// must be ignored by the constant propagation to avoid triggering a panic.
|
// Propagating the overflow is ok as codegen will just skip emitting the panic.
|
||||||
let _ = <u8 as std::ops::Add>::add(255, 1);
|
let _ = <u8 as std::ops::Add>::add(255, 1);
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue