65 lines
1.4 KiB
Diff
65 lines
1.4 KiB
Diff
- // MIR for `simple` before UnreachableEnumBranching
|
|
+ // MIR for `simple` after UnreachableEnumBranching
|
|
|
|
fn simple() -> () {
|
|
let mut _0: ();
|
|
let _1: &str;
|
|
let mut _2: Test1;
|
|
let mut _3: isize;
|
|
let _4: &str;
|
|
let _5: &str;
|
|
|
|
bb0: {
|
|
StorageLive(_1);
|
|
StorageLive(_2);
|
|
_2 = Test1::C;
|
|
_3 = discriminant(_2);
|
|
- switchInt(move _3) -> [0: bb4, 1: bb3, 2: bb2, otherwise: bb1];
|
|
+ switchInt(move _3) -> [0: bb1, 1: bb1, 2: bb2, otherwise: bb1];
|
|
}
|
|
|
|
bb1: {
|
|
unreachable;
|
|
}
|
|
|
|
bb2: {
|
|
StorageLive(_5);
|
|
_5 = const "C";
|
|
_1 = &(*_5);
|
|
StorageDead(_5);
|
|
goto -> bb5;
|
|
}
|
|
|
|
bb3: {
|
|
StorageLive(_4);
|
|
_4 = const "B(Empty)";
|
|
_1 = &(*_4);
|
|
StorageDead(_4);
|
|
goto -> bb5;
|
|
}
|
|
|
|
bb4: {
|
|
_1 = const "A(Empty)";
|
|
goto -> bb5;
|
|
}
|
|
|
|
bb5: {
|
|
StorageDead(_2);
|
|
StorageDead(_1);
|
|
_0 = const ();
|
|
return;
|
|
}
|
|
}
|
|
|
|
ALLOC0 (size: 1, align: 1) {
|
|
43 │ C
|
|
}
|
|
|
|
ALLOC1 (size: 8, align: 1) {
|
|
42 28 45 6d 70 74 79 29 │ B(Empty)
|
|
}
|
|
|
|
ALLOC2 (size: 8, align: 1) {
|
|
41 28 45 6d 70 74 79 29 │ A(Empty)
|
|
}
|
|
|