2015-11-10 14:38:36 -06:00
|
|
|
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
|
|
|
use rustc::middle::const_eval::ConstVal;
|
2015-11-19 09:37:34 -06:00
|
|
|
use rustc::mir::repr::*;
|
2015-11-10 14:38:36 -06:00
|
|
|
use transform::util;
|
2016-02-05 02:35:00 -06:00
|
|
|
use rustc::mir::transform::MirPass;
|
2015-11-10 14:38:36 -06:00
|
|
|
|
|
|
|
pub struct SimplifyCfg;
|
|
|
|
|
|
|
|
impl SimplifyCfg {
|
|
|
|
pub fn new() -> SimplifyCfg {
|
|
|
|
SimplifyCfg
|
|
|
|
}
|
|
|
|
|
|
|
|
fn remove_dead_blocks(&self, mir: &mut Mir) {
|
|
|
|
let mut seen = vec![false; mir.basic_blocks.len()];
|
|
|
|
|
|
|
|
// These blocks are always required.
|
|
|
|
seen[START_BLOCK.index()] = true;
|
|
|
|
seen[END_BLOCK.index()] = true;
|
|
|
|
|
|
|
|
let mut worklist = vec![START_BLOCK];
|
|
|
|
while let Some(bb) = worklist.pop() {
|
2016-01-29 11:06:23 -06:00
|
|
|
for succ in mir.basic_block_data(bb).terminator().successors().iter() {
|
2015-11-10 14:38:36 -06:00
|
|
|
if !seen[succ.index()] {
|
|
|
|
seen[succ.index()] = true;
|
|
|
|
worklist.push(*succ);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
util::retain_basic_blocks(mir, &seen);
|
|
|
|
}
|
|
|
|
|
|
|
|
fn remove_goto_chains(&self, mir: &mut Mir) -> bool {
|
|
|
|
|
|
|
|
// Find the target at the end of the jump chain, return None if there is a loop
|
|
|
|
fn final_target(mir: &Mir, mut target: BasicBlock) -> Option<BasicBlock> {
|
|
|
|
// Keep track of already seen blocks to detect loops
|
|
|
|
let mut seen: Vec<BasicBlock> = Vec::with_capacity(8);
|
|
|
|
|
|
|
|
while mir.basic_block_data(target).statements.is_empty() {
|
|
|
|
match mir.basic_block_data(target).terminator {
|
2015-12-18 16:44:32 -06:00
|
|
|
Some(Terminator::Goto { target: next }) => {
|
2015-11-10 14:38:36 -06:00
|
|
|
if seen.contains(&next) {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
seen.push(next);
|
|
|
|
target = next;
|
|
|
|
}
|
|
|
|
_ => break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Some(target)
|
|
|
|
}
|
|
|
|
|
|
|
|
let mut changed = false;
|
|
|
|
for bb in mir.all_basic_blocks() {
|
2015-12-18 16:44:32 -06:00
|
|
|
// Temporarily take ownership of the terminator we're modifying to keep borrowck happy
|
|
|
|
let mut terminator = mir.basic_block_data_mut(bb).terminator.take()
|
|
|
|
.expect("invalid terminator state");
|
2015-11-10 14:38:36 -06:00
|
|
|
|
|
|
|
for target in terminator.successors_mut() {
|
|
|
|
let new_target = match final_target(mir, *target) {
|
|
|
|
Some(new_target) => new_target,
|
|
|
|
None if mir.basic_block_data(bb).statements.is_empty() => bb,
|
|
|
|
None => continue
|
|
|
|
};
|
|
|
|
changed |= *target != new_target;
|
|
|
|
*target = new_target;
|
|
|
|
}
|
2015-12-18 16:44:32 -06:00
|
|
|
mir.basic_block_data_mut(bb).terminator = Some(terminator);
|
2015-11-10 14:38:36 -06:00
|
|
|
}
|
|
|
|
changed
|
|
|
|
}
|
|
|
|
|
|
|
|
fn simplify_branches(&self, mir: &mut Mir) -> bool {
|
|
|
|
let mut changed = false;
|
|
|
|
|
|
|
|
for bb in mir.all_basic_blocks() {
|
2015-12-18 16:44:32 -06:00
|
|
|
let basic_block = mir.basic_block_data_mut(bb);
|
|
|
|
let mut terminator = basic_block.terminator_mut();
|
2015-11-10 14:38:36 -06:00
|
|
|
|
2015-12-18 16:44:32 -06:00
|
|
|
*terminator = match *terminator {
|
2015-12-10 14:46:40 -06:00
|
|
|
Terminator::If { ref targets, .. } if targets.0 == targets.1 => {
|
2015-11-10 14:38:36 -06:00
|
|
|
changed = true;
|
2015-12-10 14:46:40 -06:00
|
|
|
Terminator::Goto { target: targets.0 }
|
2015-11-10 14:38:36 -06:00
|
|
|
}
|
|
|
|
Terminator::If { ref targets, cond: Operand::Constant(Constant {
|
|
|
|
literal: Literal::Value {
|
|
|
|
value: ConstVal::Bool(cond)
|
|
|
|
}, ..
|
|
|
|
}) } => {
|
|
|
|
changed = true;
|
2015-12-10 14:46:40 -06:00
|
|
|
if cond {
|
|
|
|
Terminator::Goto { target: targets.0 }
|
|
|
|
} else {
|
|
|
|
Terminator::Goto { target: targets.1 }
|
|
|
|
}
|
2015-11-10 14:38:36 -06:00
|
|
|
}
|
|
|
|
Terminator::SwitchInt { ref targets, .. } if targets.len() == 1 => {
|
|
|
|
Terminator::Goto { target: targets[0] }
|
|
|
|
}
|
2015-12-18 16:44:32 -06:00
|
|
|
_ => continue
|
2015-11-10 14:38:36 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
changed
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-05 02:35:00 -06:00
|
|
|
impl MirPass for SimplifyCfg {
|
|
|
|
fn run_on_mir<'tcx>(&mut self, mir: &mut Mir<'tcx>, _: &::rustc::middle::ty::ctxt<'tcx>) {
|
2015-11-10 14:38:36 -06:00
|
|
|
let mut changed = true;
|
|
|
|
while changed {
|
|
|
|
changed = self.simplify_branches(mir);
|
|
|
|
changed |= self.remove_goto_chains(mir);
|
|
|
|
self.remove_dead_blocks(mir);
|
|
|
|
}
|
|
|
|
// FIXME: Should probably be moved into some kind of pass manager
|
|
|
|
mir.basic_blocks.shrink_to_fit();
|
|
|
|
}
|
|
|
|
}
|