return;
}
+ if !tcx.consider_optimizing(|| format!("ConstantPropagation {:?} {:?}", def_id, hir_id)) {
+ return;
+ }
+
// Check if it's even possible to satisfy the 'where' clauses
// for this item.
// This branch will never be taken for any normal function.
let should_cleanup = !opts_to_apply.is_empty();
for opt_to_apply in opts_to_apply {
+ if !tcx.consider_optimizing(|| format!("EarlyOtherwiseBranch {:?}", &opt_to_apply)) {
+ break;
+ }
+
trace!("SUCCESS: found optimization possibility to apply: {:?}", &opt_to_apply);
let statements_before =
impl<'tcx> MirPass<'tcx> for InstCombine {
fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
+ // Check for fuel here before gathering the optimization list. If we're out of fuel,
+ // we don't want to take the time to pass over the MIR only to find optimizations
+ // we won't run.
+ if !tcx.consider_optimizing(|| format!("InstCombine {:?} ", body.source.def_id())) {
+ return;
+ }
+
// First, find optimization opportunities. This is done in a pre-pass to keep the MIR
// read-only so that we can do global analyses on the MIR in the process (e.g.
// `Place::ty()`).
}
let param_env = tcx.param_env(body.source.def_id());
+ let def_id = body.source.def_id();
let (bbs, local_decls) = body.basic_blocks_and_local_decls_mut();
'outer: for bb_idx in bbs.indices() {
+ if !tcx.consider_optimizing(|| format!("MatchBranchSimplification {:?} ", def_id)) {
+ continue;
+ }
+
let (discr, val, switch_ty, first, second) = match bbs[bb_idx].terminator().kind {
TerminatorKind::SwitchInt {
discr: ref discr @ (Operand::Copy(_) | Operand::Move(_)),
return;
}
+ if !tcx.consider_optimizing(|| {
+ format!("MultipleReturnTerminators {:?} ", body.source.def_id())
+ }) {
+ return;
+ }
+
// find basic blocks with no statement and a return terminator
let mut bbs_simple_returns = BitSet::new_empty(body.basic_blocks().len());
let bbs = body.basic_blocks_mut();
return;
}
+ let def_id = body.source.def_id();
let returned_local = match local_eligible_for_nrvo(body) {
Some(l) => l,
None => {
- debug!("`{:?}` was ineligible for NRVO", body.source.def_id());
+ debug!("`{:?}` was ineligible for NRVO", def_id);
return;
}
};
+ if !tcx.consider_optimizing(|| format!("RenameReturnPlace {:?}", def_id)) {
+ return;
+ }
+
debug!(
"`{:?}` was eligible for NRVO, making {:?} the return place",
- body.source.def_id(),
- returned_local
+ def_id, returned_local
);
RenameToReturnPlace { tcx, to_rename: returned_local }.visit_body(body);
return;
}
+ if !tcx.consider_optimizing(|| format!("PromoteTemps {:?} ", body.source.def_id())) {
+ return;
+ }
+
let mut rpo = traversal::reverse_postorder(body);
let ccx = ConstCx::new(tcx, body);
let (temps, all_candidates) = collect_temps_and_candidates(&ccx, &mut rpo);
impl<'tcx> MirPass<'tcx> for RemoveUnneededDrops {
fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
+ if !tcx.consider_optimizing(|| format!("RemoveUnneededDrops {:?} ", body.source.def_id())) {
+ return;
+ }
+
trace!("Running RemoveUnneededDrops on {:?}", body.source);
let mut opt_finder = RemoveUnneededDropsOptimizationFinder {
tcx,
return;
}
+ if !tcx
+ .consider_optimizing(|| format!("UnreachablePropagation {:?} ", body.source.def_id()))
+ {
+ return;
+ }
+
let mut unreachable_blocks = FxHashSet::default();
let mut replacements = FxHashMap::default();