Bless tests
This commit is contained in:
parent
c462291e0c
commit
19ce326a08
168 changed files with 344 additions and 344 deletions
|
@ -36,7 +36,7 @@ fn main() -> () {
|
|||
StorageLive(_5);
|
||||
StorageLive(_6);
|
||||
_6 = _3;
|
||||
_5 = foo(move _6) -> bb1;
|
||||
_5 = foo(move _6) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -45,7 +45,7 @@ fn main() -> () {
|
|||
_7 = _2;
|
||||
_8 = Len(_1);
|
||||
_9 = Lt(_7, _8);
|
||||
assert(move _9, "index out of bounds: the length is {} but the index is {}", move _8, _7) -> bb2;
|
||||
assert(move _9, "index out of bounds: the length is {} but the index is {}", move _8, _7) -> [success: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -58,7 +58,7 @@
|
|||
|
||||
bb4: {
|
||||
StorageDead(_5);
|
||||
- drop(_4) -> bb5;
|
||||
- drop(_4) -> [return: bb5, unwind continue];
|
||||
+ goto -> bb5;
|
||||
}
|
||||
|
||||
|
|
|
@ -19,7 +19,7 @@ fn main() -> () {
|
|||
StorageLive(_1);
|
||||
_2 = SizeOf(S);
|
||||
_3 = AlignOf(S);
|
||||
_4 = alloc::alloc::exchange_malloc(move _2, move _3) -> bb1;
|
||||
_4 = alloc::alloc::exchange_malloc(move _2, move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -30,7 +30,7 @@ fn main() -> () {
|
|||
|
||||
bb2: {
|
||||
_1 = move _5;
|
||||
drop(_5) -> bb3;
|
||||
drop(_5) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
@ -45,7 +45,7 @@ fn main() -> () {
|
|||
StorageDead(_7);
|
||||
StorageDead(_6);
|
||||
_0 = const ();
|
||||
drop(_1) -> bb5;
|
||||
drop(_1) -> [return: bb5, unwind continue];
|
||||
}
|
||||
|
||||
bb5: {
|
||||
|
|
|
@ -30,7 +30,7 @@ fn a::{closure#0}(_1: Pin<&mut [async fn body@$DIR/async_await.rs:11:14: 11:16]>
|
|||
}
|
||||
|
||||
bb2: {
|
||||
assert(const false, "`async fn` resumed after completion") -> bb2;
|
||||
assert(const false, "`async fn` resumed after completion") -> [success: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
|
|
@ -310,7 +310,7 @@ fn b::{closure#0}(_1: Pin<&mut [async fn body@$DIR/async_await.rs:14:18: 17:2]>,
|
|||
}
|
||||
|
||||
bb28: {
|
||||
assert(const false, "`async fn` resumed after completion") -> bb28;
|
||||
assert(const false, "`async fn` resumed after completion") -> [success: bb28, unwind continue];
|
||||
}
|
||||
|
||||
bb29: {
|
||||
|
|
|
@ -4,7 +4,7 @@ fn direct_call(_1: i32) -> i32 {
|
|||
let mut _0: i32;
|
||||
|
||||
bb0: {
|
||||
_0 = ident::<i32>(_1) -> bb1;
|
||||
_0 = ident::<i32>(_1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -4,7 +4,7 @@ fn drop_first(_1: WriteOnDrop<'_>, _2: WriteOnDrop<'_>) -> () {
|
|||
let mut _0: ();
|
||||
|
||||
bb0: {
|
||||
drop(_1) -> bb1;
|
||||
drop(_1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -4,7 +4,7 @@ fn drop_second(_1: WriteOnDrop<'_>, _2: WriteOnDrop<'_>) -> () {
|
|||
let mut _0: ();
|
||||
|
||||
bb0: {
|
||||
drop(_2) -> bb1;
|
||||
drop(_2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -4,7 +4,7 @@ fn indirect_call(_1: i32, _2: fn(i32) -> i32) -> i32 {
|
|||
let mut _0: i32;
|
||||
|
||||
bb0: {
|
||||
_0 = _2(_1) -> bb1;
|
||||
_0 = _2(_1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -32,7 +32,7 @@
|
|||
- _4 = Len(_1);
|
||||
+ _4 = const 2_usize;
|
||||
_5 = Lt(_3, _4);
|
||||
assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -44,7 +44,7 @@
|
|||
- _8 = Len(_1);
|
||||
+ _8 = const 2_usize;
|
||||
_9 = Lt(_7, _8);
|
||||
assert(move _9, "index out of bounds: the length is {} but the index is {}", move _8, _7) -> bb2;
|
||||
assert(move _9, "index out of bounds: the length is {} but the index is {}", move _8, _7) -> [success: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -21,7 +21,7 @@
|
|||
_4 = &((*_1).0: T);
|
||||
- _3 = &(*_4);
|
||||
+ _3 = _4;
|
||||
_2 = <T as Clone>::clone(move _3) -> bb1;
|
||||
_2 = <T as Clone>::clone(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -27,7 +27,7 @@
|
|||
StorageLive(_5);
|
||||
- _5 = _1;
|
||||
+ _5 = const 1_u8;
|
||||
_4 = foo(move _5) -> bb1;
|
||||
_4 = foo(move _5) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -23,7 +23,7 @@ fn main() -> () {
|
|||
StorageLive(_4);
|
||||
StorageLive(_5);
|
||||
_5 = const 1_u8;
|
||||
_4 = foo(move _5) -> bb1;
|
||||
_4 = foo(move _5) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -20,10 +20,10 @@
|
|||
_3 = const 2_usize;
|
||||
- _4 = Len(_2);
|
||||
- _5 = Lt(_3, _4);
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
+ _4 = const 4_usize;
|
||||
+ _5 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -20,10 +20,10 @@
|
|||
_3 = const 2_usize;
|
||||
- _4 = Len(_2);
|
||||
- _5 = Lt(_3, _4);
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
+ _4 = const 4_usize;
|
||||
+ _5 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -24,21 +24,21 @@
|
|||
StorageLive(_3);
|
||||
- _3 = _1;
|
||||
- _4 = Eq(_3, const 0_i32);
|
||||
- assert(!move _4, "attempt to divide `{}` by zero", const 1_i32) -> bb1;
|
||||
- assert(!move _4, "attempt to divide `{}` by zero", const 1_i32) -> [success: bb1, unwind continue];
|
||||
+ _3 = const 0_i32;
|
||||
+ _4 = const true;
|
||||
+ assert(!const true, "attempt to divide `{}` by zero", const 1_i32) -> bb1;
|
||||
+ assert(!const true, "attempt to divide `{}` by zero", const 1_i32) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
- _5 = Eq(_3, const -1_i32);
|
||||
- _6 = Eq(const 1_i32, const i32::MIN);
|
||||
- _7 = BitAnd(move _5, move _6);
|
||||
- assert(!move _7, "attempt to compute `{} / {}`, which would overflow", const 1_i32, _3) -> bb2;
|
||||
- assert(!move _7, "attempt to compute `{} / {}`, which would overflow", const 1_i32, _3) -> [success: bb2, unwind continue];
|
||||
+ _5 = const false;
|
||||
+ _6 = const false;
|
||||
+ _7 = const false;
|
||||
+ assert(!const false, "attempt to compute `{} / {}`, which would overflow", const 1_i32, _3) -> bb2;
|
||||
+ assert(!const false, "attempt to compute `{} / {}`, which would overflow", const 1_i32, _3) -> [success: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -24,21 +24,21 @@
|
|||
StorageLive(_3);
|
||||
- _3 = _1;
|
||||
- _4 = Eq(_3, const 0_i32);
|
||||
- assert(!move _4, "attempt to calculate the remainder of `{}` with a divisor of zero", const 1_i32) -> bb1;
|
||||
- assert(!move _4, "attempt to calculate the remainder of `{}` with a divisor of zero", const 1_i32) -> [success: bb1, unwind continue];
|
||||
+ _3 = const 0_i32;
|
||||
+ _4 = const true;
|
||||
+ assert(!const true, "attempt to calculate the remainder of `{}` with a divisor of zero", const 1_i32) -> bb1;
|
||||
+ assert(!const true, "attempt to calculate the remainder of `{}` with a divisor of zero", const 1_i32) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
- _5 = Eq(_3, const -1_i32);
|
||||
- _6 = Eq(const 1_i32, const i32::MIN);
|
||||
- _7 = BitAnd(move _5, move _6);
|
||||
- assert(!move _7, "attempt to compute the remainder of `{} % {}`, which would overflow", const 1_i32, _3) -> bb2;
|
||||
- assert(!move _7, "attempt to compute the remainder of `{} % {}`, which would overflow", const 1_i32, _3) -> [success: bb2, unwind continue];
|
||||
+ _5 = const false;
|
||||
+ _6 = const false;
|
||||
+ _7 = const false;
|
||||
+ assert(!const false, "attempt to compute the remainder of `{} % {}`, which would overflow", const 1_i32, _3) -> bb2;
|
||||
+ assert(!const false, "attempt to compute the remainder of `{} % {}`, which would overflow", const 1_i32, _3) -> [success: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -36,9 +36,9 @@
|
|||
_6 = const 3_usize;
|
||||
_7 = const 3_usize;
|
||||
- _8 = Lt(_6, _7);
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
+ _8 = const false;
|
||||
+ assert(const false, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
+ assert(const false, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -36,9 +36,9 @@
|
|||
_6 = const 3_usize;
|
||||
_7 = const 3_usize;
|
||||
- _8 = Lt(_6, _7);
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
+ _8 = const false;
|
||||
+ assert(const false, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
+ assert(const false, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -26,7 +26,7 @@
|
|||
- _5 = AlignOf(i32);
|
||||
+ _4 = const 4_usize;
|
||||
+ _5 = const 4_usize;
|
||||
_6 = alloc::alloc::exchange_malloc(move _4, move _5) -> bb1;
|
||||
_6 = alloc::alloc::exchange_malloc(move _4, move _5) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -12,9 +12,9 @@
|
|||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _2 = CheckedAdd(const 1_u32, const 1_u32);
|
||||
- assert(!move (_2.1: bool), "attempt to compute `{} + {}`, which would overflow", const 1_u32, const 1_u32) -> bb1;
|
||||
- assert(!move (_2.1: bool), "attempt to compute `{} + {}`, which would overflow", const 1_u32, const 1_u32) -> [success: bb1, unwind continue];
|
||||
+ _2 = const (2_u32, false);
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 1_u32, const 1_u32) -> bb1;
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 1_u32, const 1_u32) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -24,7 +24,7 @@
|
|||
StorageLive(_4);
|
||||
StorageLive(_5);
|
||||
_5 = _1;
|
||||
_4 = read(move _5) -> bb1;
|
||||
_4 = read(move _5) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -14,7 +14,7 @@
|
|||
}
|
||||
|
||||
bb1: {
|
||||
_2 = begin_panic::<&str>(const "explicit panic");
|
||||
_2 = begin_panic::<&str>(const "explicit panic") -> unwind continue;
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -15,10 +15,10 @@
|
|||
StorageLive(_2);
|
||||
- _2 = const 2_u32 as u8 (IntToInt);
|
||||
- _3 = CheckedAdd(_2, const 1_u8);
|
||||
- assert(!move (_3.1: bool), "attempt to compute `{} + {}`, which would overflow", move _2, const 1_u8) -> bb1;
|
||||
- assert(!move (_3.1: bool), "attempt to compute `{} + {}`, which would overflow", move _2, const 1_u8) -> [success: bb1, unwind continue];
|
||||
+ _2 = const 2_u8;
|
||||
+ _3 = const (3_u8, false);
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", move _2, const 1_u8) -> bb1;
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", move _2, const 1_u8) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -21,9 +21,9 @@
|
|||
StorageLive(_3);
|
||||
_3 = const 1_u8;
|
||||
- _4 = CheckedAdd(_2, _3);
|
||||
- assert(!move (_4.1: bool), "attempt to compute `{} + {}`, which would overflow", _2, _3) -> bb1;
|
||||
- assert(!move (_4.1: bool), "attempt to compute `{} + {}`, which would overflow", _2, _3) -> [success: bb1, unwind continue];
|
||||
+ _4 = const (0_u8, true);
|
||||
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", _2, _3) -> bb1;
|
||||
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", _2, _3) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
bb0: {
|
||||
StorageLive(_2);
|
||||
_2 = (const (), const 0_u8, const 0_u8);
|
||||
_1 = encode(move _2) -> bb1;
|
||||
_1 = encode(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -14,7 +14,7 @@
|
|||
+ _3 = const (1_u8, 2_u8);
|
||||
_2 = (move _3,);
|
||||
StorageDead(_3);
|
||||
_1 = test(move _2) -> bb1;
|
||||
_1 = test(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -20,10 +20,10 @@
|
|||
_3 = const 2_usize;
|
||||
- _4 = Len(_2);
|
||||
- _5 = Lt(_3, _4);
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
+ _4 = const 5000_usize;
|
||||
+ _5 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -20,10 +20,10 @@
|
|||
_3 = const 2_usize;
|
||||
- _4 = Len(_2);
|
||||
- _5 = Lt(_3, _4);
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
- assert(move _5, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
+ _4 = const 5000_usize;
|
||||
+ _5 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _4, _3) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -14,7 +14,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = foo() -> bb1;
|
||||
_1 = foo() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -23,7 +23,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = foo() -> bb1;
|
||||
_1 = foo() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -29,7 +29,7 @@
|
|||
StorageLive(_2);
|
||||
- _2 = OffsetOf(Alpha, [0]);
|
||||
+ _2 = const 4_usize;
|
||||
_1 = must_use::<usize>(move _2) -> bb1;
|
||||
_1 = must_use::<usize>(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -38,7 +38,7 @@
|
|||
StorageLive(_4);
|
||||
- _4 = OffsetOf(Alpha, [1]);
|
||||
+ _4 = const 0_usize;
|
||||
_3 = must_use::<usize>(move _4) -> bb2;
|
||||
_3 = must_use::<usize>(move _4) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
@ -47,7 +47,7 @@
|
|||
StorageLive(_6);
|
||||
- _6 = OffsetOf(Alpha, [2, 0]);
|
||||
+ _6 = const 2_usize;
|
||||
_5 = must_use::<usize>(move _6) -> bb3;
|
||||
_5 = must_use::<usize>(move _6) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
@ -56,7 +56,7 @@
|
|||
StorageLive(_8);
|
||||
- _8 = OffsetOf(Alpha, [2, 1]);
|
||||
+ _8 = const 3_usize;
|
||||
_7 = must_use::<usize>(move _8) -> bb4;
|
||||
_7 = must_use::<usize>(move _8) -> [return: bb4, unwind continue];
|
||||
}
|
||||
|
||||
bb4: {
|
||||
|
|
|
@ -28,7 +28,7 @@
|
|||
StorageLive(_1);
|
||||
StorageLive(_2);
|
||||
_2 = OffsetOf(Gamma<T>, [0]);
|
||||
_1 = must_use::<usize>(move _2) -> bb1;
|
||||
_1 = must_use::<usize>(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -36,7 +36,7 @@
|
|||
StorageLive(_3);
|
||||
StorageLive(_4);
|
||||
_4 = OffsetOf(Gamma<T>, [1]);
|
||||
_3 = must_use::<usize>(move _4) -> bb2;
|
||||
_3 = must_use::<usize>(move _4) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
@ -44,7 +44,7 @@
|
|||
StorageLive(_5);
|
||||
StorageLive(_6);
|
||||
_6 = OffsetOf(Delta<T>, [1]);
|
||||
_5 = must_use::<usize>(move _6) -> bb3;
|
||||
_5 = must_use::<usize>(move _6) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
@ -52,7 +52,7 @@
|
|||
StorageLive(_7);
|
||||
StorageLive(_8);
|
||||
_8 = OffsetOf(Delta<T>, [2]);
|
||||
_7 = must_use::<usize>(move _8) -> bb4;
|
||||
_7 = must_use::<usize>(move _8) -> [return: bb4, unwind continue];
|
||||
}
|
||||
|
||||
bb4: {
|
||||
|
|
|
@ -22,10 +22,10 @@
|
|||
_4 = const 2_usize;
|
||||
- _5 = Len(_3);
|
||||
- _6 = Lt(_4, _5);
|
||||
- assert(move _6, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> bb1;
|
||||
- assert(move _6, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> [success: bb1, unwind continue];
|
||||
+ _5 = const 8_usize;
|
||||
+ _6 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -22,10 +22,10 @@
|
|||
_4 = const 2_usize;
|
||||
- _5 = Len(_3);
|
||||
- _6 = Lt(_4, _5);
|
||||
- assert(move _6, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> bb1;
|
||||
- assert(move _6, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> [success: bb1, unwind continue];
|
||||
+ _5 = const 8_usize;
|
||||
+ _6 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _5, _4) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -7,9 +7,9 @@
|
|||
|
||||
bb0: {
|
||||
- _1 = CheckedAdd(const 2_u32, const 2_u32);
|
||||
- assert(!move (_1.1: bool), "attempt to compute `{} + {}`, which would overflow", const 2_u32, const 2_u32) -> bb1;
|
||||
- assert(!move (_1.1: bool), "attempt to compute `{} + {}`, which would overflow", const 2_u32, const 2_u32) -> [success: bb1, unwind continue];
|
||||
+ _1 = const (4_u32, false);
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 2_u32, const 2_u32) -> bb1;
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 2_u32, const 2_u32) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -6,7 +6,7 @@ fn add() -> u32 {
|
|||
|
||||
bb0: {
|
||||
_1 = const (4_u32, false);
|
||||
assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 2_u32, const 2_u32) -> bb1;
|
||||
assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 2_u32, const 2_u32) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -17,7 +17,7 @@
|
|||
StorageLive(_3);
|
||||
- _3 = _1;
|
||||
+ _3 = const 1_u32;
|
||||
_2 = consume(move _3) -> bb1;
|
||||
_2 = consume(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -27,10 +27,10 @@
|
|||
_6 = const 1_usize;
|
||||
- _7 = Len((*_2));
|
||||
- _8 = Lt(_6, _7);
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
+ _7 = const 3_usize;
|
||||
+ _8 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -27,10 +27,10 @@
|
|||
_6 = const 1_usize;
|
||||
- _7 = Len((*_2));
|
||||
- _8 = Lt(_6, _7);
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
- assert(move _8, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
+ _7 = const 3_usize;
|
||||
+ _8 = const true;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> bb1;
|
||||
+ assert(const true, "index out of bounds: the length is {} but the index is {}", move _7, _6) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -13,11 +13,11 @@
|
|||
}
|
||||
|
||||
bb1: {
|
||||
_0 = foo(const -1_i32) -> bb3;
|
||||
_0 = foo(const -1_i32) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
_0 = foo(const 0_i32) -> bb3;
|
||||
_0 = foo(const 0_i32) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
|
|
@ -13,11 +13,11 @@
|
|||
}
|
||||
|
||||
bb1: {
|
||||
_0 = foo(const -1_i32) -> bb3;
|
||||
_0 = foo(const -1_i32) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
_0 = foo(const 0_i32) -> bb3;
|
||||
_0 = foo(const 0_i32) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
|
|
@ -18,7 +18,7 @@
|
|||
StorageLive(_3);
|
||||
- _3 = _1;
|
||||
+ _3 = const (1_u32, 2_u32);
|
||||
_2 = consume(move _3) -> bb1;
|
||||
_2 = consume(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -13,11 +13,11 @@
|
|||
_2 = &_1;
|
||||
_3 = _1;
|
||||
_4 = &_3;
|
||||
_0 = cmp_ref(_2, _4) -> bb1;
|
||||
_0 = cmp_ref(_2, _4) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
_0 = opaque::<u8>(_3) -> bb2;
|
||||
_0 = opaque::<u8>(_3) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -16,13 +16,13 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = val() -> bb1;
|
||||
_1 = val() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
StorageLive(_2);
|
||||
StorageLive(_3);
|
||||
_3 = cond() -> bb2;
|
||||
_3 = cond() -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
@ -36,7 +36,7 @@
|
|||
|
||||
bb4: {
|
||||
StorageLive(_4);
|
||||
_4 = val() -> bb5;
|
||||
_4 = val() -> [return: bb5, unwind continue];
|
||||
}
|
||||
|
||||
bb5: {
|
||||
|
|
|
@ -11,7 +11,7 @@
|
|||
StorageLive(_2);
|
||||
StorageLive(_3);
|
||||
_3 = _1;
|
||||
_2 = dummy(move _3) -> bb1;
|
||||
_2 = dummy(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -11,7 +11,7 @@
|
|||
StorageLive(_2);
|
||||
StorageLive(_3);
|
||||
_3 = _1;
|
||||
_2 = dummy(move _3) -> bb1;
|
||||
_2 = dummy(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -8,14 +8,14 @@
|
|||
|
||||
bb0: {
|
||||
- _2 = _1;
|
||||
- _0 = opaque::<NotCopy>(move _1) -> bb1;
|
||||
+ _0 = opaque::<NotCopy>(_1) -> bb1;
|
||||
- _0 = opaque::<NotCopy>(move _1) -> [return: bb1, unwind continue];
|
||||
+ _0 = opaque::<NotCopy>(_1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
- _3 = move _2;
|
||||
- _0 = opaque::<NotCopy>(_3) -> bb2;
|
||||
+ _0 = opaque::<NotCopy>(_1) -> bb2;
|
||||
- _0 = opaque::<NotCopy>(_3) -> [return: bb2, unwind continue];
|
||||
+ _0 = opaque::<NotCopy>(_1) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -22,7 +22,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = val() -> bb1;
|
||||
_1 = val() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -38,7 +38,7 @@
|
|||
StorageLive(_5);
|
||||
StorageLive(_6);
|
||||
_6 = _1;
|
||||
_5 = std::mem::drop::<i32>(move _6) -> bb2;
|
||||
_5 = std::mem::drop::<i32>(move _6) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -16,7 +16,7 @@ fn f(_1: usize) -> usize {
|
|||
_1 = _2;
|
||||
StorageLive(_4);
|
||||
_4 = _1;
|
||||
_0 = id::<usize>(move _4) -> bb1;
|
||||
_0 = id::<usize>(move _4) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -16,7 +16,7 @@ fn f(_1: usize) -> usize {
|
|||
_1 = _2;
|
||||
StorageLive(_4);
|
||||
_4 = _1;
|
||||
_0 = id::<usize>(move _4) -> bb1;
|
||||
_0 = id::<usize>(move _4) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -49,14 +49,14 @@
|
|||
_7 = &_2;
|
||||
_6 = move _7 as &[i32] (Pointer(Unsize));
|
||||
StorageDead(_7);
|
||||
_5 = core::slice::<impl [i32]>::len(move _6) -> bb1;
|
||||
_5 = core::slice::<impl [i32]>::len(move _6) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
StorageDead(_6);
|
||||
_4 = std::ops::Range::<usize> { start: const 0_usize, end: move _5 };
|
||||
StorageDead(_5);
|
||||
_3 = <std::ops::Range<usize> as IntoIterator>::into_iter(move _4) -> bb2;
|
||||
_3 = <std::ops::Range<usize> as IntoIterator>::into_iter(move _4) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
@ -73,7 +73,7 @@
|
|||
StorageLive(_13);
|
||||
_13 = &mut _8;
|
||||
_12 = &mut (*_13);
|
||||
_11 = <std::ops::Range<usize> as Iterator>::next(move _12) -> bb4;
|
||||
_11 = <std::ops::Range<usize> as Iterator>::next(move _12) -> [return: bb4, unwind continue];
|
||||
}
|
||||
|
||||
bb4: {
|
||||
|
@ -90,9 +90,9 @@
|
|||
- _18 = _16;
|
||||
_19 = Len(_2);
|
||||
- _20 = Lt(_18, _19);
|
||||
- assert(move _20, "index out of bounds: the length is {} but the index is {}", move _19, _18) -> bb8;
|
||||
- assert(move _20, "index out of bounds: the length is {} but the index is {}", move _19, _18) -> [success: bb8, unwind continue];
|
||||
+ _20 = Lt(_16, _19);
|
||||
+ assert(move _20, "index out of bounds: the length is {} but the index is {}", move _19, _16) -> bb8;
|
||||
+ assert(move _20, "index out of bounds: the length is {} but the index is {}", move _19, _16) -> [success: bb8, unwind continue];
|
||||
}
|
||||
|
||||
bb6: {
|
||||
|
|
|
@ -21,8 +21,8 @@
|
|||
- _4 = _1;
|
||||
- StorageLive(_5);
|
||||
- _5 = _2;
|
||||
- _3 = g::<T>(move _4, move _5) -> bb1;
|
||||
+ _3 = g::<T>(_1, _1) -> bb1;
|
||||
- _3 = g::<T>(move _4, move _5) -> [return: bb1, unwind continue];
|
||||
+ _3 = g::<T>(_1, _1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -9,13 +9,13 @@
|
|||
bb0: {
|
||||
- _2 = _1;
|
||||
- _3 = move (_2.0: u8);
|
||||
- _0 = opaque::<Foo>(move _1) -> bb1;
|
||||
- _0 = opaque::<Foo>(move _1) -> [return: bb1, unwind continue];
|
||||
+ _3 = (_1.0: u8);
|
||||
+ _0 = opaque::<Foo>(_1) -> bb1;
|
||||
+ _0 = opaque::<Foo>(_1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
_0 = opaque::<u8>(move _3) -> bb2;
|
||||
_0 = opaque::<u8>(move _3) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -36,8 +36,8 @@
|
|||
StorageLive(_6);
|
||||
- StorageLive(_7);
|
||||
- _7 = _5;
|
||||
- _6 = opaque::<*mut u8>(move _7) -> bb1;
|
||||
+ _6 = opaque::<*mut u8>(_2) -> bb1;
|
||||
- _6 = opaque::<*mut u8>(move _7) -> [return: bb1, unwind continue];
|
||||
+ _6 = opaque::<*mut u8>(_2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -32,8 +32,8 @@
|
|||
StorageLive(_5);
|
||||
- StorageLive(_6);
|
||||
- _6 = _4;
|
||||
- _5 = opaque::<*mut u8>(move _6) -> bb1;
|
||||
+ _5 = opaque::<*mut u8>(_2) -> bb1;
|
||||
- _5 = opaque::<*mut u8>(move _6) -> [return: bb1, unwind continue];
|
||||
+ _5 = opaque::<*mut u8>(_2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -30,8 +30,8 @@
|
|||
StorageLive(_5);
|
||||
- StorageLive(_6);
|
||||
- _6 = move _4;
|
||||
- _5 = opaque::<&mut u8>(move _6) -> bb1;
|
||||
+ _5 = opaque::<&mut u8>(move _2) -> bb1;
|
||||
- _5 = opaque::<&mut u8>(move _6) -> [return: bb1, unwind continue];
|
||||
+ _5 = opaque::<&mut u8>(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -30,8 +30,8 @@
|
|||
StorageLive(_5);
|
||||
- StorageLive(_6);
|
||||
- _6 = move _4;
|
||||
- _5 = opaque::<&mut u8>(move _6) -> bb1;
|
||||
+ _5 = opaque::<&mut u8>(move _2) -> bb1;
|
||||
- _5 = opaque::<&mut u8>(move _6) -> [return: bb1, unwind continue];
|
||||
+ _5 = opaque::<&mut u8>(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -41,10 +41,10 @@
|
|||
StorageLive(_5);
|
||||
- _5 = _2;
|
||||
- _6 = CheckedAdd(_4, _5);
|
||||
- assert(!move (_6.1: bool), "attempt to compute `{} + {}`, which would overflow", move _4, move _5) -> bb1;
|
||||
- assert(!move (_6.1: bool), "attempt to compute `{} + {}`, which would overflow", move _4, move _5) -> [success: bb1, unwind continue];
|
||||
+ _5 = const 2_i32;
|
||||
+ _6 = CheckedAdd(const 1_i32, const 2_i32);
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 1_i32, const 2_i32) -> bb1;
|
||||
+ assert(!const false, "attempt to compute `{} + {}`, which would overflow", const 1_i32, const 2_i32) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -58,10 +58,10 @@
|
|||
StorageLive(_9);
|
||||
- _9 = _7;
|
||||
- _10 = CheckedAdd(_9, const 1_i32);
|
||||
- assert(!move (_10.1: bool), "attempt to compute `{} + {}`, which would overflow", move _9, const 1_i32) -> bb2;
|
||||
- assert(!move (_10.1: bool), "attempt to compute `{} + {}`, which would overflow", move _9, const 1_i32) -> [success: bb2, unwind continue];
|
||||
+ _9 = const i32::MAX;
|
||||
+ _10 = CheckedAdd(const i32::MAX, const 1_i32);
|
||||
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", const i32::MAX, const 1_i32) -> bb2;
|
||||
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", const i32::MAX, const 1_i32) -> [success: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -21,9 +21,9 @@
|
|||
StorageLive(_3);
|
||||
_3 = const 1_u8;
|
||||
- _4 = CheckedAdd(_2, _3);
|
||||
- assert(!move (_4.1: bool), "attempt to compute `{} + {}`, which would overflow", _2, _3) -> bb1;
|
||||
- assert(!move (_4.1: bool), "attempt to compute `{} + {}`, which would overflow", _2, _3) -> [success: bb1, unwind continue];
|
||||
+ _4 = CheckedAdd(const u8::MAX, const 1_u8);
|
||||
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", const u8::MAX, const 1_u8) -> bb1;
|
||||
+ assert(!const true, "attempt to compute `{} + {}`, which would overflow", const u8::MAX, const 1_u8) -> [success: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -24,7 +24,7 @@
|
|||
StorageLive(_4);
|
||||
_4 = &_1;
|
||||
_3 = &(*_4);
|
||||
_2 = escape::<i32>(move _3) -> bb1;
|
||||
_2 = escape::<i32>(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -33,7 +33,7 @@
|
|||
StorageDead(_2);
|
||||
_1 = const 1_i32;
|
||||
StorageLive(_5);
|
||||
_5 = some_function() -> bb2;
|
||||
_5 = some_function() -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -30,7 +30,7 @@
|
|||
StorageLive(_4);
|
||||
StorageLive(_5);
|
||||
_5 = _3;
|
||||
_4 = ptr::mut_ptr::<impl *mut u8>::add(move _5, const 1_usize) -> bb1;
|
||||
_4 = ptr::mut_ptr::<impl *mut u8>::add(move _5, const 1_usize) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -22,8 +22,8 @@
|
|||
+ _4 = const 1_i32;
|
||||
+ _3 = const 2_i32;
|
||||
StorageDead(_4);
|
||||
- _2 = foo(move _3) -> bb1;
|
||||
+ _2 = foo(const 2_i32) -> bb1;
|
||||
- _2 = foo(move _3) -> [return: bb1, unwind continue];
|
||||
+ _2 = foo(const 2_i32) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -28,9 +28,9 @@
|
|||
|
||||
bb1: {
|
||||
- StorageLive(_5);
|
||||
- _5 = cond() -> bb2;
|
||||
- _5 = cond() -> [return: bb2, unwind continue];
|
||||
+ StorageLive(_4);
|
||||
+ _4 = cond() -> bb2;
|
||||
+ _4 = cond() -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -17,7 +17,7 @@
|
|||
StorageLive(_2);
|
||||
StorageLive(_3);
|
||||
_3 = &(*_1);
|
||||
_2 = core::str::<impl str>::as_bytes(move _3) -> bb1;
|
||||
_2 = core::str::<impl str>::as_bytes(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -30,7 +30,7 @@
|
|||
StorageLive(_2);
|
||||
_14 = const _;
|
||||
_2 = &(*_14);
|
||||
_1 = <&[i32; 2] as IntoIterator>::into_iter(move _2) -> bb1;
|
||||
_1 = <&[i32; 2] as IntoIterator>::into_iter(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -47,7 +47,7 @@
|
|||
StorageLive(_9);
|
||||
_9 = &mut _4;
|
||||
_8 = &mut (*_9);
|
||||
_7 = <std::slice::Iter<'_, i32> as Iterator>::next(move _8) -> bb3;
|
||||
_7 = <std::slice::Iter<'_, i32> as Iterator>::next(move _8) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
@ -63,7 +63,7 @@
|
|||
+ _12 = (*_15);
|
||||
StorageLive(_13);
|
||||
_13 = _12;
|
||||
_6 = std::mem::drop::<i32>(move _13) -> bb7;
|
||||
_6 = std::mem::drop::<i32>(move _13) -> [return: bb7, unwind continue];
|
||||
}
|
||||
|
||||
bb5: {
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
bb0: {
|
||||
StorageLive(_1);
|
||||
StorageLive(_2);
|
||||
_2 = f() -> bb1;
|
||||
_2 = f() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -18,7 +18,7 @@
|
|||
|
||||
bb2: {
|
||||
StorageDead(_2);
|
||||
drop(_1) -> bb3;
|
||||
drop(_1) -> [return: bb3, unwind continue];
|
||||
}
|
||||
|
||||
bb3: {
|
||||
|
|
|
@ -30,12 +30,12 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = foo() -> bb1;
|
||||
_1 = foo() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
StorageLive(_2);
|
||||
_2 = foo() -> bb2;
|
||||
_2 = foo() -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -18,16 +18,16 @@
|
|||
|
||||
bb0: {
|
||||
- StorageLive(_1);
|
||||
- _1 = val() -> bb1;
|
||||
- _1 = val() -> [return: bb1, unwind continue];
|
||||
+ nop;
|
||||
+ _0 = val() -> bb1;
|
||||
+ _0 = val() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
- StorageLive(_2);
|
||||
+ nop;
|
||||
StorageLive(_3);
|
||||
_3 = cond() -> bb2;
|
||||
_3 = cond() -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
@ -42,7 +42,7 @@
|
|||
|
||||
bb4: {
|
||||
StorageLive(_4);
|
||||
_4 = val() -> bb5;
|
||||
_4 = val() -> [return: bb5, unwind continue];
|
||||
}
|
||||
|
||||
bb5: {
|
||||
|
|
|
@ -11,10 +11,10 @@
|
|||
StorageLive(_2);
|
||||
- StorageLive(_3);
|
||||
- _3 = _1;
|
||||
- _2 = dummy(move _3) -> bb1;
|
||||
- _2 = dummy(move _3) -> [return: bb1, unwind continue];
|
||||
+ nop;
|
||||
+ nop;
|
||||
+ _2 = dummy(move _1) -> bb1;
|
||||
+ _2 = dummy(move _1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -12,8 +12,8 @@
|
|||
+ nop;
|
||||
StorageLive(_3);
|
||||
_3 = _1;
|
||||
- _2 = dummy(move _3) -> bb1;
|
||||
+ _1 = dummy(move _3) -> bb1;
|
||||
- _2 = dummy(move _3) -> [return: bb1, unwind continue];
|
||||
+ _1 = dummy(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -24,9 +24,9 @@
|
|||
|
||||
bb0: {
|
||||
- StorageLive(_1);
|
||||
- _1 = val() -> bb1;
|
||||
- _1 = val() -> [return: bb1, unwind continue];
|
||||
+ nop;
|
||||
+ _6 = val() -> bb1;
|
||||
+ _6 = val() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -51,7 +51,7 @@
|
|||
- _6 = _1;
|
||||
+ nop;
|
||||
+ nop;
|
||||
_5 = std::mem::drop::<i32>(move _6) -> bb2;
|
||||
_5 = std::mem::drop::<i32>(move _6) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -20,7 +20,7 @@ fn f(_1: usize) -> usize {
|
|||
nop;
|
||||
nop;
|
||||
nop;
|
||||
_0 = id::<usize>(move _1) -> bb1;
|
||||
_0 = id::<usize>(move _1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -19,7 +19,7 @@ fn f(_1: usize) -> usize {
|
|||
nop;
|
||||
nop;
|
||||
nop;
|
||||
_0 = id::<usize>(move _1) -> bb1;
|
||||
_0 = id::<usize>(move _1) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -25,8 +25,8 @@
|
|||
StorageLive(_6);
|
||||
_6 = &mut _2;
|
||||
_5 = &mut (*_6);
|
||||
- _3 = move _4(move _5) -> bb1;
|
||||
+ _3 = move _1(move _5) -> bb1;
|
||||
- _3 = move _4(move _5) -> [return: bb1, unwind continue];
|
||||
+ _3 = move _1(move _5) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -18,7 +18,7 @@
|
|||
bb0: {
|
||||
StorageLive(_1);
|
||||
StorageLive(_2);
|
||||
_2 = val() -> bb1;
|
||||
_2 = val() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -34,7 +34,7 @@
|
|||
- _5 = _1;
|
||||
- StorageLive(_6);
|
||||
- _6 = _2;
|
||||
- _4 = g::<T>(move _5, move _6) -> bb2;
|
||||
- _4 = g::<T>(move _5, move _6) -> [return: bb2, unwind continue];
|
||||
- }
|
||||
-
|
||||
- bb2: {
|
||||
|
@ -53,9 +53,9 @@
|
|||
+ nop;
|
||||
StorageLive(_9);
|
||||
- _9 = _2;
|
||||
- _7 = g::<T>(move _8, move _9) -> bb4;
|
||||
- _7 = g::<T>(move _8, move _9) -> [return: bb4, unwind continue];
|
||||
+ _9 = _1;
|
||||
+ _7 = g::<T>(move _1, move _9) -> bb2;
|
||||
+ _7 = g::<T>(move _1, move _9) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
- bb4: {
|
||||
|
|
|
@ -4,7 +4,7 @@ fn std::ops::Fn::call(_1: *const fn(), _2: ()) -> <fn() as FnOnce<()>>::Output {
|
|||
let mut _0: <fn() as std::ops::FnOnce<()>>::Output;
|
||||
|
||||
bb0: {
|
||||
_0 = move (*_1)() -> bb1;
|
||||
_0 = move (*_1)() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -38,7 +38,7 @@
|
|||
StorageLive(_4);
|
||||
StorageLive(_5);
|
||||
_5 = &(*_1);
|
||||
_4 = Formatter::<'_>::sign_plus(move _5) -> bb1;
|
||||
_4 = Formatter::<'_>::sign_plus(move _5) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -63,7 +63,7 @@
|
|||
StorageLive(_7);
|
||||
StorageLive(_8);
|
||||
_8 = &(*_1);
|
||||
_7 = Formatter::<'_>::precision(move _8) -> bb5;
|
||||
_7 = Formatter::<'_>::precision(move _8) -> [return: bb5, unwind continue];
|
||||
}
|
||||
|
||||
bb5: {
|
||||
|
@ -81,7 +81,7 @@
|
|||
_15 = _10 as u32 (IntToInt);
|
||||
_14 = Add(move _15, const 1_u32);
|
||||
StorageDead(_15);
|
||||
_0 = float_to_exponential_common_exact::<T>(_1, _2, move _13, move _14, _3) -> bb7;
|
||||
_0 = float_to_exponential_common_exact::<T>(_1, _2, move _13, move _14, _3) -> [return: bb7, unwind continue];
|
||||
}
|
||||
|
||||
bb7: {
|
||||
|
@ -93,7 +93,7 @@
|
|||
bb8: {
|
||||
StorageLive(_20);
|
||||
_20 = _6;
|
||||
_0 = float_to_exponential_common_shortest::<T>(_1, _2, move _20, _3) -> bb9;
|
||||
_0 = float_to_exponential_common_shortest::<T>(_1, _2, move _20, _3) -> [return: bb9, unwind continue];
|
||||
}
|
||||
|
||||
bb9: {
|
||||
|
|
|
@ -15,7 +15,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = foo() -> bb1;
|
||||
- _1 = foo() -> [return: bb1, unwind continue];
|
||||
+ StorageLive(_2);
|
||||
+ asm!("", options(MAY_UNWIND)) -> [return: bb2, unwind: bb3];
|
||||
}
|
||||
|
@ -28,7 +28,7 @@
|
|||
+ }
|
||||
+
|
||||
+ bb2: {
|
||||
+ drop(_2) -> bb1;
|
||||
+ drop(_2) -> [return: bb1, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb3 (cleanup): {
|
||||
|
|
|
@ -10,7 +10,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = bar::<T>() -> bb1;
|
||||
_1 = bar::<T>() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -16,7 +16,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = f::<fn() {main}>(main) -> bb1;
|
||||
- _1 = f::<fn() {main}>(main) -> [return: bb1, unwind continue];
|
||||
+ StorageLive(_2);
|
||||
+ _2 = main;
|
||||
+ StorageLive(_4);
|
||||
|
@ -46,7 +46,7 @@
|
|||
+ bb4: {
|
||||
+ StorageDead(_5);
|
||||
+ StorageDead(_3);
|
||||
+ drop(_2) -> bb1;
|
||||
+ drop(_2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -24,7 +24,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = f::<fn() {g}>(g) -> bb1;
|
||||
- _1 = f::<fn() {g}>(g) -> [return: bb1, unwind continue];
|
||||
+ StorageLive(_2);
|
||||
+ _2 = g;
|
||||
+ StorageLive(_4);
|
||||
|
@ -56,7 +56,7 @@
|
|||
+ StorageDead(_6);
|
||||
+ StorageDead(_5);
|
||||
+ StorageDead(_3);
|
||||
+ drop(_2) -> bb1;
|
||||
+ drop(_2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -22,17 +22,17 @@
|
|||
StorageLive(_2);
|
||||
StorageLive(_3);
|
||||
_3 = &(*_1);
|
||||
_2 = <Q as Query>::cache::<T>(move _3) -> bb1;
|
||||
_2 = <Q as Query>::cache::<T>(move _3) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
StorageDead(_3);
|
||||
StorageLive(_4);
|
||||
_4 = &(*_2);
|
||||
- _0 = try_execute_query::<<Q as Query>::C>(move _4) -> bb2;
|
||||
- _0 = try_execute_query::<<Q as Query>::C>(move _4) -> [return: bb2, unwind continue];
|
||||
+ StorageLive(_5);
|
||||
+ _5 = _4 as &dyn Cache<V = <Q as Query>::V> (Pointer(Unsize));
|
||||
+ _0 = <dyn Cache<V = <Q as Query>::V> as Cache>::store_nocache(_5) -> bb2;
|
||||
+ _0 = <dyn Cache<V = <Q as Query>::V> as Cache>::store_nocache(_5) -> [return: bb2, unwind continue];
|
||||
}
|
||||
|
||||
bb2: {
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
bb0: {
|
||||
StorageLive(_2);
|
||||
_2 = &(*_1);
|
||||
_0 = <dyn Cache<V = V> as Cache>::store_nocache(move _2) -> bb1;
|
||||
_0 = <dyn Cache<V = V> as Cache>::store_nocache(move _2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -16,8 +16,8 @@
|
|||
_3 = &(*_1);
|
||||
_2 = move _3 as &dyn Cache<V = <C as Cache>::V> (Pointer(Unsize));
|
||||
StorageDead(_3);
|
||||
- _0 = mk_cycle::<<C as Cache>::V>(move _2) -> bb1;
|
||||
+ _0 = <dyn Cache<V = <C as Cache>::V> as Cache>::store_nocache(_2) -> bb1;
|
||||
- _0 = mk_cycle::<<C as Cache>::V>(move _2) -> [return: bb1, unwind continue];
|
||||
+ _0 = <dyn Cache<V = <C as Cache>::V> as Cache>::store_nocache(_2) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -37,7 +37,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = <() as G>::call() -> bb1;
|
||||
- _1 = <() as G>::call() -> [return: bb1, unwind continue];
|
||||
+ StorageLive(_2);
|
||||
+ StorageLive(_3);
|
||||
+ StorageLive(_4);
|
||||
|
@ -56,7 +56,7 @@
|
|||
+ StorageLive(_17);
|
||||
+ StorageLive(_18);
|
||||
+ StorageLive(_19);
|
||||
+ _17 = <() as A>::call() -> bb12;
|
||||
+ _17 = <() as A>::call() -> [return: bb12, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
@ -72,63 +72,63 @@
|
|||
+ StorageDead(_7);
|
||||
+ StorageDead(_6);
|
||||
+ StorageDead(_5);
|
||||
+ _3 = <() as F>::call() -> bb3;
|
||||
+ _3 = <() as F>::call() -> [return: bb3, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb3: {
|
||||
+ _4 = <() as F>::call() -> bb1;
|
||||
+ _4 = <() as F>::call() -> [return: bb1, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb4: {
|
||||
+ StorageDead(_10);
|
||||
+ StorageDead(_9);
|
||||
+ StorageDead(_8);
|
||||
+ _6 = <() as E>::call() -> bb5;
|
||||
+ _6 = <() as E>::call() -> [return: bb5, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb5: {
|
||||
+ _7 = <() as E>::call() -> bb2;
|
||||
+ _7 = <() as E>::call() -> [return: bb2, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb6: {
|
||||
+ StorageDead(_13);
|
||||
+ StorageDead(_12);
|
||||
+ StorageDead(_11);
|
||||
+ _9 = <() as D>::call() -> bb7;
|
||||
+ _9 = <() as D>::call() -> [return: bb7, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb7: {
|
||||
+ _10 = <() as D>::call() -> bb4;
|
||||
+ _10 = <() as D>::call() -> [return: bb4, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb8: {
|
||||
+ StorageDead(_16);
|
||||
+ StorageDead(_15);
|
||||
+ StorageDead(_14);
|
||||
+ _12 = <() as C>::call() -> bb9;
|
||||
+ _12 = <() as C>::call() -> [return: bb9, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb9: {
|
||||
+ _13 = <() as C>::call() -> bb6;
|
||||
+ _13 = <() as C>::call() -> [return: bb6, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb10: {
|
||||
+ StorageDead(_19);
|
||||
+ StorageDead(_18);
|
||||
+ StorageDead(_17);
|
||||
+ _15 = <() as B>::call() -> bb11;
|
||||
+ _15 = <() as B>::call() -> [return: bb11, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb11: {
|
||||
+ _16 = <() as B>::call() -> bb8;
|
||||
+ _16 = <() as B>::call() -> [return: bb8, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb12: {
|
||||
+ _18 = <() as A>::call() -> bb13;
|
||||
+ _18 = <() as A>::call() -> [return: bb13, unwind continue];
|
||||
+ }
|
||||
+
|
||||
+ bb13: {
|
||||
+ _19 = <() as A>::call() -> bb10;
|
||||
+ _19 = <() as A>::call() -> [return: bb10, unwind continue];
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = no_sanitize() -> bb1;
|
||||
- _1 = no_sanitize() -> [return: bb1, unwind continue];
|
||||
- }
|
||||
-
|
||||
- bb1: {
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = target_feature() -> bb1;
|
||||
- _1 = target_feature() -> [return: bb1, unwind continue];
|
||||
- }
|
||||
-
|
||||
- bb1: {
|
||||
|
|
|
@ -10,7 +10,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = sum(const 4_u32, const 4_u32, const 30_u32, const 200_u32, const 1000_u32) -> bb1;
|
||||
_1 = sum(const 4_u32, const 4_u32, const 30_u32, const 200_u32, const 1000_u32) -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -7,7 +7,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = no_sanitize() -> bb1;
|
||||
_1 = no_sanitize() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -7,7 +7,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = target_feature() -> bb1;
|
||||
_1 = target_feature() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -13,7 +13,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
_1 = <C as Call>::call() -> bb1;
|
||||
_1 = <C as Call>::call() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -23,14 +23,14 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = call::<fn() {f}>(f) -> bb1;
|
||||
- _1 = call::<fn() {f}>(f) -> [return: bb1, unwind continue];
|
||||
+ StorageLive(_2);
|
||||
+ _2 = f;
|
||||
+ StorageLive(_3);
|
||||
+ StorageLive(_4);
|
||||
+ _4 = const ();
|
||||
+ StorageLive(_5);
|
||||
+ _5 = f() -> bb1;
|
||||
+ _5 = f() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -13,8 +13,8 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = <C as Call>::call() -> bb1;
|
||||
+ _1 = <B<C> as Call>::call() -> bb1;
|
||||
- _1 = <C as Call>::call() -> [return: bb1, unwind continue];
|
||||
+ _1 = <B<C> as Call>::call() -> [return: bb1, unwind continue];
|
||||
}
|
||||
|
||||
bb1: {
|
||||
|
|
|
@ -10,7 +10,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_2);
|
||||
- _2 = sleep();
|
||||
- _2 = sleep() -> unwind continue;
|
||||
+ goto -> bb1;
|
||||
+ }
|
||||
+
|
||||
|
|
|
@ -33,9 +33,9 @@
|
|||
|
||||
bb2: {
|
||||
StorageLive(_6);
|
||||
- _6 = panic();
|
||||
- _6 = panic() -> unwind continue;
|
||||
+ StorageLive(_7);
|
||||
+ _7 = begin_panic::<&str>(const "explicit panic");
|
||||
+ _7 = begin_panic::<&str>(const "explicit panic") -> unwind continue;
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -27,7 +27,7 @@
|
|||
|
||||
bb0: {
|
||||
StorageLive(_1);
|
||||
- _1 = call_twice::<!, fn() -> ! {sleep}>(sleep);
|
||||
- _1 = call_twice::<!, fn() -> ! {sleep}>(sleep) -> unwind continue;
|
||||
+ StorageLive(_2);
|
||||
+ _2 = sleep;
|
||||
+ StorageLive(_6);
|
||||
|
|
|
@ -35,7 +35,7 @@
|
|||
StorageLive(_2);
|
||||
StorageLive(_3);
|
||||
StorageLive(_4);
|
||||
- _4 = g() -> bb1;
|
||||
- _4 = g() -> [return: bb1, unwind continue];
|
||||
- }
|
||||
-
|
||||
- bb1: {
|
||||
|
|
|
@ -117,7 +117,7 @@
|
|||
bb0: {
|
||||
StorageLive(_1);
|
||||
StorageLive(_2);
|
||||
- _2 = Vec::<u32>::new() -> bb1;
|
||||
- _2 = Vec::<u32>::new() -> [return: bb1, unwind continue];
|
||||
+ StorageLive(_3);
|
||||
+ _3 = const _;
|
||||
+ _2 = Vec::<u32> { buf: move _3, len: const 0_usize };
|
||||
|
|
Some files were not shown because too many files have changed in this diff Show more
Loading…
Add table
Reference in a new issue