1 - // MIR for `add` before ConstProp
2 + // MIR for `add` after ConstProp
5 let mut _0: u32; // return place in scope 0 at $DIR/return_place.rs:5:13: 5:16
6 let mut _1: (u32, bool); // in scope 0 at $DIR/return_place.rs:6:5: 6:10
9 - _1 = CheckedAdd(const 2_u32, const 2_u32); // scope 0 at $DIR/return_place.rs:6:5: 6:10
10 - assert(!move (_1.1: bool), "attempt to compute `{} + {}` which would overflow", const 2_u32, const 2_u32) -> bb1; // scope 0 at $DIR/return_place.rs:6:5: 6:10
11 + _1 = const (4_u32, false); // scope 0 at $DIR/return_place.rs:6:5: 6:10
13 + // + ty: (u32, bool)
14 + // + val: Value(ByRef { alloc: Allocation { bytes: [4, 0, 0, 0, 0, 0, 0, 0], relocations: Relocations(SortedMap { data: [] }), init_mask: InitMask { blocks: [31], len: Size { raw: 8 } }, size: Size { raw: 8 }, align: Align { pow2: 2 }, mutability: Not, extra: () }, offset: Size { raw: 0 } })
16 + // + span: $DIR/return_place.rs:6:5: 6:10
17 + // + literal: Const { ty: (u32, bool), val: Value(ByRef { alloc: Allocation { bytes: [4, 0, 0, 0, 0, 0, 0, 0], relocations: Relocations(SortedMap { data: [] }), init_mask: InitMask { blocks: [31], len: Size { raw: 8 } }, size: Size { raw: 8 }, align: Align { pow2: 2 }, mutability: Not, extra: () }, offset: Size { raw: 0 } }) }
18 + assert(!const false, "attempt to compute `{} + {}` which would overflow", const 2_u32, const 2_u32) -> bb1; // scope 0 at $DIR/return_place.rs:6:5: 6:10
22 - _0 = move (_1.0: u32); // scope 0 at $DIR/return_place.rs:6:5: 6:10
23 + _0 = const 4_u32; // scope 0 at $DIR/return_place.rs:6:5: 6:10
24 return; // scope 0 at $DIR/return_place.rs:7:2: 7:2