rust/tests/mir-opt/exponential_or.match_tuple.SimplifyCfg-initial.after.mir
Nadrieril 31bad13f82 Remove the make_target_blocks hack
It was introduced 4 years ago in a1d0266878 to improve LLVM
optimization time. Measurements today indicate it is no longer needed.
2023-12-19 11:37:39 +01:00

84 lines
1.8 KiB
Rust

// MIR for `match_tuple` after SimplifyCfg-initial
fn match_tuple(_1: (u32, bool, Option<i32>, u32)) -> u32 {
debug x => _1;
let mut _0: u32;
let mut _2: isize;
let mut _3: bool;
let mut _4: bool;
let mut _5: bool;
let mut _6: bool;
let _7: u32;
let _8: u32;
let mut _9: u32;
let mut _10: u32;
scope 1 {
debug y => _7;
debug z => _8;
}
bb0: {
PlaceMention(_1);
switchInt((_1.0: u32)) -> [1: bb2, 4: bb2, otherwise: bb1];
}
bb1: {
_0 = const 0_u32;
goto -> bb10;
}
bb2: {
_2 = discriminant((_1.2: std::option::Option<i32>));
switchInt(move _2) -> [0: bb4, 1: bb3, otherwise: bb1];
}
bb3: {
switchInt((((_1.2: std::option::Option<i32>) as Some).0: i32)) -> [1: bb4, 8: bb4, otherwise: bb1];
}
bb4: {
_5 = Le(const 6_u32, (_1.3: u32));
switchInt(move _5) -> [0: bb5, otherwise: bb7];
}
bb5: {
_3 = Le(const 13_u32, (_1.3: u32));
switchInt(move _3) -> [0: bb1, otherwise: bb6];
}
bb6: {
_4 = Le((_1.3: u32), const 16_u32);
switchInt(move _4) -> [0: bb1, otherwise: bb8];
}
bb7: {
_6 = Le((_1.3: u32), const 9_u32);
switchInt(move _6) -> [0: bb5, otherwise: bb8];
}
bb8: {
falseEdge -> [real: bb9, imaginary: bb1];
}
bb9: {
StorageLive(_7);
_7 = (_1.0: u32);
StorageLive(_8);
_8 = (_1.3: u32);
StorageLive(_9);
_9 = _7;
StorageLive(_10);
_10 = _8;
_0 = BitXor(move _9, move _10);
StorageDead(_10);
StorageDead(_9);
StorageDead(_8);
StorageDead(_7);
goto -> bb10;
}
bb10: {
return;
}
}