Refactor UninhabitedEnumBranching to mark targets unreachable.

This commit is contained in:
Camille GILLOT 2023-07-22 16:59:13 +00:00
parent 0b13e636f5
commit 096196d5b0
6 changed files with 84 additions and 63 deletions

View File

@ -3,8 +3,7 @@
use crate::MirPass; use crate::MirPass;
use rustc_data_structures::fx::FxHashSet; use rustc_data_structures::fx::FxHashSet;
use rustc_middle::mir::{ use rustc_middle::mir::{
BasicBlockData, Body, Local, Operand, Rvalue, StatementKind, SwitchTargets, Terminator, BasicBlockData, Body, Local, Operand, Rvalue, StatementKind, Terminator, TerminatorKind,
TerminatorKind,
}; };
use rustc_middle::ty::layout::TyAndLayout; use rustc_middle::ty::layout::TyAndLayout;
use rustc_middle::ty::{Ty, TyCtxt}; use rustc_middle::ty::{Ty, TyCtxt};
@ -30,19 +29,22 @@ fn get_switched_on_type<'tcx>(
let terminator = block_data.terminator(); let terminator = block_data.terminator();
// Only bother checking blocks which terminate by switching on a local. // Only bother checking blocks which terminate by switching on a local.
if let Some(local) = get_discriminant_local(&terminator.kind) let local = get_discriminant_local(&terminator.kind)?;
&& let [.., stmt_before_term] = &block_data.statements[..]
&& let StatementKind::Assign(box (l, Rvalue::Discriminant(place))) = stmt_before_term.kind let stmt_before_term = block_data.statements.last()?;
if let StatementKind::Assign(box (l, Rvalue::Discriminant(place))) = stmt_before_term.kind
&& l.as_local() == Some(local) && l.as_local() == Some(local)
&& let ty = place.ty(body, tcx).ty
&& ty.is_enum()
{ {
Some(ty) let ty = place.ty(body, tcx).ty;
} else { if ty.is_enum() {
None return Some(ty);
} }
} }
None
}
fn variant_discriminants<'tcx>( fn variant_discriminants<'tcx>(
layout: &TyAndLayout<'tcx>, layout: &TyAndLayout<'tcx>,
ty: Ty<'tcx>, ty: Ty<'tcx>,
@ -67,28 +69,6 @@ fn variant_discriminants<'tcx>(
} }
} }
/// Ensures that the `otherwise` branch leads to an unreachable bb, returning `None` if so and a new
/// bb to use as the new target if not.
fn ensure_otherwise_unreachable<'tcx>(
body: &Body<'tcx>,
targets: &SwitchTargets,
) -> Option<BasicBlockData<'tcx>> {
let otherwise = targets.otherwise();
let bb = &body.basic_blocks[otherwise];
if bb.terminator().kind == TerminatorKind::Unreachable
&& bb.statements.iter().all(|s| matches!(&s.kind, StatementKind::StorageDead(_)))
{
return None;
}
let mut new_block = BasicBlockData::new(Some(Terminator {
source_info: bb.terminator().source_info,
kind: TerminatorKind::Unreachable,
}));
new_block.is_cleanup = bb.is_cleanup;
Some(new_block)
}
impl<'tcx> MirPass<'tcx> for UninhabitedEnumBranching { impl<'tcx> MirPass<'tcx> for UninhabitedEnumBranching {
fn is_enabled(&self, sess: &rustc_session::Session) -> bool { fn is_enabled(&self, sess: &rustc_session::Session) -> bool {
sess.mir_opt_level() > 0 sess.mir_opt_level() > 0
@ -97,13 +77,16 @@ fn is_enabled(&self, sess: &rustc_session::Session) -> bool {
fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) { fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
trace!("UninhabitedEnumBranching starting for {:?}", body.source); trace!("UninhabitedEnumBranching starting for {:?}", body.source);
for bb in body.basic_blocks.indices() { let mut removable_switchs = Vec::new();
for (bb, bb_data) in body.basic_blocks.iter_enumerated() {
trace!("processing block {:?}", bb); trace!("processing block {:?}", bb);
let Some(discriminant_ty) = get_switched_on_type(&body.basic_blocks[bb], tcx, body) if bb_data.is_cleanup {
else {
continue; continue;
}; }
let Some(discriminant_ty) = get_switched_on_type(&bb_data, tcx, body) else { continue };
let layout = tcx.layout_of( let layout = tcx.layout_of(
tcx.param_env_reveal_all_normalized(body.source.def_id()).and(discriminant_ty), tcx.param_env_reveal_all_normalized(body.source.def_id()).and(discriminant_ty),
@ -117,31 +100,38 @@ fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
trace!("allowed_variants = {:?}", allowed_variants); trace!("allowed_variants = {:?}", allowed_variants);
if let TerminatorKind::SwitchInt { targets, .. } = let terminator = bb_data.terminator();
&mut body.basic_blocks_mut()[bb].terminator_mut().kind let TerminatorKind::SwitchInt { targets, .. } = &terminator.kind else { bug!() };
{
let mut new_targets = SwitchTargets::new(
targets.iter().filter(|(val, _)| allowed_variants.contains(val)),
targets.otherwise(),
);
if new_targets.iter().count() == allowed_variants.len() { let mut reachable_count = 0;
if let Some(updated) = ensure_otherwise_unreachable(body, &new_targets) { for (index, (val, _)) in targets.iter().enumerate() {
let new_otherwise = body.basic_blocks_mut().push(updated); if allowed_variants.contains(&val) {
*new_targets.all_targets_mut().last_mut().unwrap() = new_otherwise; reachable_count += 1;
} else {
removable_switchs.push((bb, index));
} }
} }
if let TerminatorKind::SwitchInt { targets, .. } = if reachable_count == allowed_variants.len() {
&mut body.basic_blocks_mut()[bb].terminator_mut().kind removable_switchs.push((bb, targets.iter().count()));
{
*targets = new_targets;
} else {
unreachable!()
}
} else {
unreachable!()
} }
} }
if removable_switchs.is_empty() {
return;
}
let new_block = BasicBlockData::new(Some(Terminator {
source_info: body.basic_blocks[removable_switchs[0].0].terminator().source_info,
kind: TerminatorKind::Unreachable,
}));
let unreachable_block = body.basic_blocks.as_mut().push(new_block);
for (bb, index) in removable_switchs {
let bb = &mut body.basic_blocks.as_mut()[bb];
let terminator = bb.terminator_mut();
let TerminatorKind::SwitchInt { targets, .. } = &mut terminator.kind else { bug!() };
targets.all_targets_mut()[index] = unreachable_block;
}
} }
} }

View File

@ -12,14 +12,20 @@ fn main() -> () {
let mut _8: isize; let mut _8: isize;
let _9: &str; let _9: &str;
let mut _10: bool; let mut _10: bool;
let mut _11: bool;
let mut _12: bool;
bb0: { bb0: {
StorageLive(_1); StorageLive(_1);
StorageLive(_2); StorageLive(_2);
_2 = Test1::C; _2 = Test1::C;
_3 = discriminant(_2); _3 = discriminant(_2);
_10 = Eq(_3, const 2_isize); _10 = Ne(_3, const 0_isize);
assume(move _10); assume(move _10);
_11 = Ne(_3, const 1_isize);
assume(move _11);
_12 = Eq(_3, const 2_isize);
assume(move _12);
StorageLive(_5); StorageLive(_5);
_5 = const "C"; _5 = const "C";
_1 = &(*_5); _1 = &(*_5);

View File

@ -19,7 +19,7 @@
_2 = Test1::C; _2 = Test1::C;
_3 = discriminant(_2); _3 = discriminant(_2);
- switchInt(move _3) -> [0: bb3, 1: bb4, 2: bb1, otherwise: bb2]; - switchInt(move _3) -> [0: bb3, 1: bb4, 2: bb1, otherwise: bb2];
+ switchInt(move _3) -> [2: bb1, otherwise: bb2]; + switchInt(move _3) -> [0: bb9, 1: bb9, 2: bb1, otherwise: bb9];
} }
bb1: { bb1: {
@ -54,7 +54,8 @@
StorageLive(_7); StorageLive(_7);
_7 = Test2::D; _7 = Test2::D;
_8 = discriminant(_7); _8 = discriminant(_7);
switchInt(move _8) -> [4: bb7, 5: bb6, otherwise: bb2]; - switchInt(move _8) -> [4: bb7, 5: bb6, otherwise: bb2];
+ switchInt(move _8) -> [4: bb7, 5: bb6, otherwise: bb9];
} }
bb6: { bb6: {
@ -75,6 +76,10 @@
StorageDead(_6); StorageDead(_6);
_0 = const (); _0 = const ();
return; return;
+ }
+
+ bb9: {
+ unreachable;
} }
} }

View File

@ -15,6 +15,10 @@ fn main() -> () {
let _11: &str; let _11: &str;
let _12: &str; let _12: &str;
let _13: &str; let _13: &str;
let mut _14: bool;
let mut _15: bool;
let mut _16: bool;
let mut _17: bool;
scope 1 { scope 1 {
debug plop => _1; debug plop => _1;
} }
@ -29,6 +33,10 @@ fn main() -> () {
StorageLive(_4); StorageLive(_4);
_4 = &(_1.1: Test1); _4 = &(_1.1: Test1);
_5 = discriminant((*_4)); _5 = discriminant((*_4));
_16 = Ne(_5, const 0_isize);
assume(move _16);
_17 = Ne(_5, const 1_isize);
assume(move _17);
switchInt(move _5) -> [2: bb3, 3: bb1, otherwise: bb2]; switchInt(move _5) -> [2: bb3, 3: bb1, otherwise: bb2];
} }
@ -57,6 +65,10 @@ fn main() -> () {
StorageDead(_3); StorageDead(_3);
StorageLive(_9); StorageLive(_9);
_10 = discriminant((_1.1: Test1)); _10 = discriminant((_1.1: Test1));
_14 = Ne(_10, const 0_isize);
assume(move _14);
_15 = Ne(_10, const 1_isize);
assume(move _15);
switchInt(move _10) -> [2: bb6, 3: bb5, otherwise: bb2]; switchInt(move _10) -> [2: bb6, 3: bb5, otherwise: bb2];
} }

View File

@ -31,7 +31,7 @@
_4 = &(_1.1: Test1); _4 = &(_1.1: Test1);
_5 = discriminant((*_4)); _5 = discriminant((*_4));
- switchInt(move _5) -> [0: bb3, 1: bb4, 2: bb5, 3: bb1, otherwise: bb2]; - switchInt(move _5) -> [0: bb3, 1: bb4, 2: bb5, 3: bb1, otherwise: bb2];
+ switchInt(move _5) -> [2: bb5, 3: bb1, otherwise: bb2]; + switchInt(move _5) -> [0: bb12, 1: bb12, 2: bb5, 3: bb1, otherwise: bb12];
} }
bb1: { bb1: {
@ -73,7 +73,7 @@
StorageLive(_9); StorageLive(_9);
_10 = discriminant((_1.1: Test1)); _10 = discriminant((_1.1: Test1));
- switchInt(move _10) -> [0: bb8, 1: bb9, 2: bb10, 3: bb7, otherwise: bb2]; - switchInt(move _10) -> [0: bb8, 1: bb9, 2: bb10, 3: bb7, otherwise: bb2];
+ switchInt(move _10) -> [2: bb10, 3: bb7, otherwise: bb2]; + switchInt(move _10) -> [0: bb12, 1: bb12, 2: bb10, 3: bb7, otherwise: bb12];
} }
bb7: { bb7: {
@ -110,6 +110,10 @@
_0 = const (); _0 = const ();
StorageDead(_1); StorageDead(_1);
return; return;
+ }
+
+ bb12: {
+ unreachable;
} }
} }

View File

@ -9,7 +9,7 @@
bb0: { bb0: {
_2 = discriminant(_1); _2 = discriminant(_1);
- switchInt(move _2) -> [0: bb2, 1: bb3, otherwise: bb1]; - switchInt(move _2) -> [0: bb2, 1: bb3, otherwise: bb1];
+ switchInt(move _2) -> [1: bb3, otherwise: bb1]; + switchInt(move _2) -> [0: bb5, 1: bb3, otherwise: bb1];
} }
bb1: { bb1: {
@ -29,6 +29,10 @@
bb4: { bb4: {
return; return;
+ }
+
+ bb5: {
+ unreachable;
} }
} }