1 //! Propagates assignment destinations backwards in the CFG to eliminate redundant assignments.
5 //! MIR building can insert a lot of redundant copies, and Rust code in general often tends to move
6 //! values around a lot. The result is a lot of assignments of the form `dest = {move} src;` in MIR.
7 //! MIR building for constants in particular tends to create additional locals that are only used
8 //! inside a single block to shuffle a value around unnecessarily.
10 //! LLVM by itself is not good enough at eliminating these redundant copies (eg. see
11 //! <https://github.com/rust-lang/rust/issues/32966>), so this leaves some performance on the table
12 //! that we can regain by implementing an optimization for removing these assign statements in rustc
13 //! itself. When this optimization runs fast enough, it can also speed up the constant evaluation
14 //! and code generation phases of rustc due to the reduced number of statements and locals.
16 //! # The Optimization
18 //! Conceptually, this optimization is "destination propagation". It is similar to the Named Return
19 //! Value Optimization, or NRVO, known from the C++ world, except that it isn't limited to return
20 //! values or the return place `_0`. On a very high level, independent of the actual implementation
21 //! details, it does the following:
23 //! 1) Identify `dest = src;` statements that can be soundly eliminated.
24 //! 2) Replace all mentions of `src` with `dest` ("unifying" them and propagating the destination
26 //! 3) Delete the `dest = src;` statement (by making it a `nop`).
28 //! Step 1) is by far the hardest, so it is explained in more detail below.
32 //! Given an `Assign` statement `dest = src;`, where `dest` is a `Place` and `src` is an `Rvalue`,
33 //! there are a few requirements that must hold for the optimization to be sound:
35 //! * `dest` must not contain any *indirection* through a pointer. It must access part of the base
36 //! local. Otherwise it might point to arbitrary memory that is hard to track.
38 //! It must also not contain any indexing projections, since those take an arbitrary `Local` as
39 //! the index, and that local might only be initialized shortly before `dest` is used.
41 //! Subtle case: If `dest` is a, or projects through a union, then we have to make sure that there
42 //! remains an assignment to it, since that sets the "active field" of the union. But if `src` is
43 //! a ZST, it might not be initialized, so there might not be any use of it before the assignment,
44 //! and performing the optimization would simply delete the assignment, leaving `dest`
47 //! * `src` must be a bare `Local` without any indirections or field projections (FIXME: Is this a
48 //! fundamental restriction or just current impl state?). It can be copied or moved by the
51 //! * The `dest` and `src` locals must never be [*live*][liveness] at the same time. If they are, it
52 //! means that they both hold a (potentially different) value that is needed by a future use of
53 //! the locals. Unifying them would overwrite one of the values.
55 //! Note that computing liveness of locals that have had their address taken is more difficult:
56 //! Short of doing full escape analysis on the address/pointer/reference, the pass would need to
57 //! assume that any operation that can potentially involve opaque user code (such as function
58 //! calls, destructors, and inline assembly) may access any local that had its address taken
59 //! before that point.
61 //! Here, the first two conditions are simple structural requirements on the `Assign` statements
62 //! that can be trivially checked. The liveness requirement however is more difficult and costly to
67 //! A [previous attempt] at implementing an optimization like this turned out to be a significant
68 //! regression in compiler performance. Fixing the regressions introduced a lot of undesirable
69 //! complexity to the implementation.
71 //! A [subsequent approach] tried to avoid the costly computation by limiting itself to acyclic
72 //! CFGs, but still turned out to be far too costly to run due to suboptimal performance within
73 //! individual basic blocks, requiring a walk across the entire block for every assignment found
74 //! within the block. For the `tuple-stress` benchmark, which has 458745 statements in a single
75 //! block, this proved to be far too costly.
77 //! Since the first attempt at this, the compiler has improved dramatically, and new analysis
78 //! frameworks have been added that should make this approach viable without requiring a limited
79 //! approach that only works for some classes of CFGs:
80 //! - rustc now has a powerful dataflow analysis framework that can handle forwards and backwards
81 //! analyses efficiently.
82 //! - Layout optimizations for generators have been added to improve code generation for
83 //! async/await, which are very similar in spirit to what this optimization does. Both walk the
84 //! MIR and record conflicting uses of locals in a `BitMatrix`.
86 //! Also, rustc now has a simple NRVO pass (see `nrvo.rs`), which handles a subset of the cases that
87 //! this destination propagation pass handles, proving that similar optimizations can be performed
90 //! ## Pre/Post Optimization
92 //! It is recommended to run `SimplifyCfg` and then `SimplifyLocals` some time after this pass, as
93 //! it replaces the eliminated assign statements with `nop`s and leaves unused locals behind.
95 //! [liveness]: https://en.wikipedia.org/wiki/Live_variable_analysis
96 //! [previous attempt]: https://github.com/rust-lang/rust/pull/47954
97 //! [subsequent approach]: https://github.com/rust-lang/rust/pull/71003
100 use itertools::Itertools;
101 use rustc_data_structures::unify::{InPlaceUnificationTable, UnifyKey};
103 bit_set::{BitMatrix, BitSet},
106 use rustc_middle::mir::tcx::PlaceTy;
107 use rustc_middle::mir::visit::{MutVisitor, PlaceContext, Visitor};
108 use rustc_middle::mir::{dump_mir, PassWhere};
109 use rustc_middle::mir::{
110 traversal, Body, InlineAsmOperand, Local, LocalKind, Location, Operand, Place, PlaceElem,
111 Rvalue, Statement, StatementKind, Terminator, TerminatorKind,
113 use rustc_middle::ty::TyCtxt;
114 use rustc_mir_dataflow::impls::{MaybeInitializedLocals, MaybeLiveLocals};
115 use rustc_mir_dataflow::Analysis;
117 // Empirical measurements have resulted in some observations:
118 // - Running on a body with a single block and 500 locals takes barely any time
119 // - Running on a body with ~400 blocks and ~300 relevant locals takes "too long"
120 // ...so we just limit both to somewhat reasonable-ish looking values.
121 const MAX_LOCALS: usize = 500;
122 const MAX_BLOCKS: usize = 250;
124 pub struct DestinationPropagation;
126 impl<'tcx> MirPass<'tcx> for DestinationPropagation {
127 fn is_enabled(&self, sess: &rustc_session::Session) -> bool {
128 // FIXME(#79191, #82678): This is unsound.
130 // Only run at mir-opt-level=3 or higher for now (we don't fix up debuginfo and remove
131 // storage statements at the moment).
132 sess.opts.debugging_opts.unsound_mir_opts && sess.mir_opt_level() >= 3
135 fn run_pass(&self, tcx: TyCtxt<'tcx>, body: &mut Body<'tcx>) {
136 let def_id = body.source.def_id();
138 let candidates = find_candidates(tcx, body);
139 if candidates.is_empty() {
140 debug!("{:?}: no dest prop candidates, done", def_id);
144 // Collect all locals we care about. We only compute conflicts for these to save time.
145 let mut relevant_locals = BitSet::new_empty(body.local_decls.len());
146 for CandidateAssignment { dest, src, loc: _ } in &candidates {
147 relevant_locals.insert(dest.local);
148 relevant_locals.insert(*src);
151 // This pass unfortunately has `O(l² * s)` performance, where `l` is the number of locals
152 // and `s` is the number of statements and terminators in the function.
153 // To prevent blowing up compile times too much, we bail out when there are too many locals.
154 let relevant = relevant_locals.count();
156 "{:?}: {} locals ({} relevant), {} blocks",
158 body.local_decls.len(),
160 body.basic_blocks().len()
162 if relevant > MAX_LOCALS {
164 "too many candidate locals in {:?} ({}, max is {}), not optimizing",
165 def_id, relevant, MAX_LOCALS
169 if body.basic_blocks().len() > MAX_BLOCKS {
171 "too many blocks in {:?} ({}, max is {}), not optimizing",
173 body.basic_blocks().len(),
179 let mut conflicts = Conflicts::build(tcx, body, &relevant_locals);
181 let mut replacements = Replacements::new(body.local_decls.len());
182 for candidate @ CandidateAssignment { dest, src, loc } in candidates {
183 // Merge locals that don't conflict.
184 if !conflicts.can_unify(dest.local, src) {
185 debug!("at assignment {:?}, conflict {:?} vs. {:?}", loc, dest.local, src);
189 if replacements.for_src(candidate.src).is_some() {
190 debug!("src {:?} already has replacement", candidate.src);
194 if !tcx.consider_optimizing(|| {
195 format!("DestinationPropagation {:?} {:?}", def_id, candidate)
200 replacements.push(candidate);
201 conflicts.unify(candidate.src, candidate.dest.local);
204 replacements.flatten(tcx);
206 debug!("replacements {:?}", replacements.map);
208 Replacer { tcx, replacements, place_elem_cache: Vec::new() }.visit_body(body);
210 // FIXME fix debug info
214 #[derive(Debug, Eq, PartialEq, Copy, Clone)]
215 struct UnifyLocal(Local);
217 impl From<Local> for UnifyLocal {
218 fn from(l: Local) -> Self {
223 impl UnifyKey for UnifyLocal {
225 fn index(&self) -> u32 {
228 fn from_index(u: u32) -> Self {
229 Self(Local::from_u32(u))
231 fn tag() -> &'static str {
236 struct Replacements<'tcx> {
237 /// Maps locals to their replacement.
238 map: IndexVec<Local, Option<Place<'tcx>>>,
240 /// Whose locals' live ranges to kill.
244 impl<'tcx> Replacements<'tcx> {
245 fn new(locals: usize) -> Self {
246 Self { map: IndexVec::from_elem_n(None, locals), kill: BitSet::new_empty(locals) }
249 fn push(&mut self, candidate: CandidateAssignment<'tcx>) {
250 trace!("Replacements::push({:?})", candidate);
251 let entry = &mut self.map[candidate.src];
252 assert!(entry.is_none());
254 *entry = Some(candidate.dest);
255 self.kill.insert(candidate.src);
256 self.kill.insert(candidate.dest.local);
259 /// Applies the stored replacements to all replacements, until no replacements would result in
260 /// locals that need further replacements when applied.
261 fn flatten(&mut self, tcx: TyCtxt<'tcx>) {
262 // Note: This assumes that there are no cycles in the replacements, which is enforced via
263 // `self.unified_locals`. Otherwise this can cause an infinite loop.
265 for local in self.map.indices() {
266 if let Some(replacement) = self.map[local] {
267 // Substitute the base local of `replacement` until fixpoint.
268 let mut base = replacement.local;
269 let mut reversed_projection_slices = Vec::with_capacity(1);
270 while let Some(replacement_for_replacement) = self.map[base] {
271 base = replacement_for_replacement.local;
272 reversed_projection_slices.push(replacement_for_replacement.projection);
275 let projection: Vec<_> = reversed_projection_slices
278 .flat_map(|projs| projs.iter())
279 .chain(replacement.projection.iter())
281 let projection = tcx.intern_place_elems(&projection);
283 // Replace with the final `Place`.
284 self.map[local] = Some(Place { local: base, projection });
289 fn for_src(&self, src: Local) -> Option<Place<'tcx>> {
294 struct Replacer<'tcx> {
296 replacements: Replacements<'tcx>,
297 place_elem_cache: Vec<PlaceElem<'tcx>>,
300 impl<'tcx> MutVisitor<'tcx> for Replacer<'tcx> {
301 fn tcx(&self) -> TyCtxt<'tcx> {
305 fn visit_local(&mut self, local: &mut Local, context: PlaceContext, location: Location) {
306 if context.is_use() && self.replacements.for_src(*local).is_some() {
308 "use of local {:?} should have been replaced by visit_place; context={:?}, loc={:?}",
316 fn visit_place(&mut self, place: &mut Place<'tcx>, context: PlaceContext, location: Location) {
317 if let Some(replacement) = self.replacements.for_src(place.local) {
318 // Rebase `place`s projections onto `replacement`'s.
319 self.place_elem_cache.clear();
320 self.place_elem_cache.extend(replacement.projection.iter().chain(place.projection));
321 let projection = self.tcx.intern_place_elems(&self.place_elem_cache);
322 let new_place = Place { local: replacement.local, projection };
324 debug!("Replacer: {:?} -> {:?}", place, new_place);
328 self.super_place(place, context, location);
331 fn visit_statement(&mut self, statement: &mut Statement<'tcx>, location: Location) {
332 self.super_statement(statement, location);
334 match &statement.kind {
335 // FIXME: Don't delete storage statements, merge the live ranges instead
336 StatementKind::StorageDead(local) | StatementKind::StorageLive(local)
337 if self.replacements.kill.contains(*local) =>
342 StatementKind::Assign(box (dest, rvalue)) => {
344 Rvalue::Use(Operand::Copy(place) | Operand::Move(place)) => {
345 // These might've been turned into self-assignments by the replacement
346 // (this includes the original statement we wanted to eliminate).
348 debug!("{:?} turned into self-assignment, deleting", location);
349 statement.make_nop();
361 struct Conflicts<'a> {
362 relevant_locals: &'a BitSet<Local>,
364 /// The conflict matrix. It is always symmetric and the adjacency matrix of the corresponding
366 matrix: BitMatrix<Local, Local>,
368 /// Preallocated `BitSet` used by `unify`.
369 unify_cache: BitSet<Local>,
371 /// Tracks locals that have been merged together to prevent cycles and propagate conflicts.
372 unified_locals: InPlaceUnificationTable<UnifyLocal>,
375 impl<'a> Conflicts<'a> {
378 body: &'_ Body<'tcx>,
379 relevant_locals: &'a BitSet<Local>,
381 // We don't have to look out for locals that have their address taken, since
382 // `find_candidates` already takes care of that.
384 let conflicts = BitMatrix::from_row_n(
385 &BitSet::new_empty(body.local_decls.len()),
386 body.local_decls.len(),
389 let mut init = MaybeInitializedLocals
390 .into_engine(tcx, body)
391 .iterate_to_fixpoint()
392 .into_results_cursor(body);
394 MaybeLiveLocals.into_engine(tcx, body).iterate_to_fixpoint().into_results_cursor(body);
396 let mut reachable = None;
397 dump_mir(tcx, None, "DestinationPropagation-dataflow", &"", body, |pass_where, w| {
398 let reachable = reachable.get_or_insert_with(|| traversal::reachable_as_bitset(body));
401 PassWhere::BeforeLocation(loc) if reachable.contains(loc.block) => {
402 init.seek_before_primary_effect(loc);
403 live.seek_after_primary_effect(loc);
405 writeln!(w, " // init: {:?}", init.get())?;
406 writeln!(w, " // live: {:?}", live.get())?;
408 PassWhere::AfterTerminator(bb) if reachable.contains(bb) => {
409 let loc = body.terminator_loc(bb);
410 init.seek_after_primary_effect(loc);
411 live.seek_before_primary_effect(loc);
413 writeln!(w, " // init: {:?}", init.get())?;
414 writeln!(w, " // live: {:?}", live.get())?;
417 PassWhere::BeforeBlock(bb) if reachable.contains(bb) => {
418 init.seek_to_block_start(bb);
419 live.seek_to_block_start(bb);
421 writeln!(w, " // init: {:?}", init.get())?;
422 writeln!(w, " // live: {:?}", live.get())?;
425 PassWhere::BeforeCFG | PassWhere::AfterCFG | PassWhere::AfterLocation(_) => {}
427 PassWhere::BeforeLocation(_) | PassWhere::AfterTerminator(_) => {
428 writeln!(w, " // init: <unreachable>")?;
429 writeln!(w, " // live: <unreachable>")?;
432 PassWhere::BeforeBlock(_) => {
433 writeln!(w, " // init: <unreachable>")?;
434 writeln!(w, " // live: <unreachable>")?;
441 let mut this = Self {
444 unify_cache: BitSet::new_empty(body.local_decls.len()),
446 let mut table = InPlaceUnificationTable::new();
447 // Pre-fill table with all locals (this creates N nodes / "connected" components,
448 // "graph"-ically speaking).
449 for local in 0..body.local_decls.len() {
450 assert_eq!(table.new_key(()), UnifyLocal(Local::from_usize(local)));
456 let mut live_and_init_locals = Vec::new();
458 // Visit only reachable basic blocks. The exact order is not important.
459 for (block, data) in traversal::preorder(body) {
460 // We need to observe the dataflow state *before* all possible locations (statement or
461 // terminator) in each basic block, and then observe the state *after* the terminator
462 // effect is applied. As long as neither `init` nor `borrowed` has a "before" effect,
463 // we will observe all possible dataflow states.
465 // Since liveness is a backwards analysis, we need to walk the results backwards. To do
466 // that, we first collect in the `MaybeInitializedLocals` results in a forwards
469 live_and_init_locals.resize_with(data.statements.len() + 1, || {
470 BitSet::new_empty(body.local_decls.len())
473 // First, go forwards for `MaybeInitializedLocals` and apply intra-statement/terminator
475 for (i, statement) in data.statements.iter().enumerate() {
476 this.record_statement_conflicts(statement);
478 let loc = Location { block, statement_index: i };
479 init.seek_before_primary_effect(loc);
481 live_and_init_locals[i].clone_from(init.get());
484 this.record_terminator_conflicts(data.terminator());
485 let term_loc = Location { block, statement_index: data.statements.len() };
486 init.seek_before_primary_effect(term_loc);
487 live_and_init_locals[term_loc.statement_index].clone_from(init.get());
489 // Now, go backwards and union with the liveness results.
490 for statement_index in (0..=data.statements.len()).rev() {
491 let loc = Location { block, statement_index };
492 live.seek_after_primary_effect(loc);
494 live_and_init_locals[statement_index].intersect(live.get());
496 trace!("record conflicts at {:?}", loc);
498 this.record_dataflow_conflicts(&mut live_and_init_locals[statement_index]);
501 init.seek_to_block_end(block);
502 live.seek_to_block_end(block);
503 let mut conflicts = init.get().clone();
504 conflicts.intersect(live.get());
505 trace!("record conflicts at end of {:?}", block);
507 this.record_dataflow_conflicts(&mut conflicts);
513 fn record_dataflow_conflicts(&mut self, new_conflicts: &mut BitSet<Local>) {
514 // Remove all locals that are not candidates.
515 new_conflicts.intersect(self.relevant_locals);
517 for local in new_conflicts.iter() {
518 self.matrix.union_row_with(&new_conflicts, local);
522 fn record_local_conflict(&mut self, a: Local, b: Local, why: &str) {
523 trace!("conflict {:?} <-> {:?} due to {}", a, b, why);
524 self.matrix.insert(a, b);
525 self.matrix.insert(b, a);
528 /// Records locals that must not overlap during the evaluation of `stmt`. These locals conflict
529 /// and must not be merged.
530 fn record_statement_conflicts(&mut self, stmt: &Statement<'_>) {
532 // While the left and right sides of an assignment must not overlap, we do not mark
533 // conflicts here as that would make this optimization useless. When we optimize, we
534 // eliminate the resulting self-assignments automatically.
535 StatementKind::Assign(_) => {}
537 StatementKind::SetDiscriminant { .. }
538 | StatementKind::StorageLive(..)
539 | StatementKind::StorageDead(..)
540 | StatementKind::Retag(..)
541 | StatementKind::FakeRead(..)
542 | StatementKind::AscribeUserType(..)
543 | StatementKind::Coverage(..)
544 | StatementKind::CopyNonOverlapping(..)
545 | StatementKind::Nop => {}
549 fn record_terminator_conflicts(&mut self, term: &Terminator<'_>) {
551 TerminatorKind::DropAndReplace {
552 place: dropped_place,
557 if let Some(place) = value.place() {
558 if !place.is_indirect() && !dropped_place.is_indirect() {
559 self.record_local_conflict(
562 "DropAndReplace operand overlap",
567 TerminatorKind::Yield { value, resume: _, resume_arg, drop: _ } => {
568 if let Some(place) = value.place() {
569 if !place.is_indirect() && !resume_arg.is_indirect() {
570 self.record_local_conflict(
573 "Yield operand overlap",
578 TerminatorKind::Call {
581 destination: Some((dest_place, _)),
586 // No arguments may overlap with the destination.
587 for arg in args.iter().chain(Some(func)) {
588 if let Some(place) = arg.place() {
589 if !place.is_indirect() && !dest_place.is_indirect() {
590 self.record_local_conflict(
593 "call dest/arg overlap",
599 TerminatorKind::InlineAsm {
607 // The intended semantics here aren't documented, we just assume that nothing that
608 // could be written to by the assembly may overlap with any other operands.
611 InlineAsmOperand::Out { reg: _, late: _, place: Some(dest_place) }
612 | InlineAsmOperand::InOut {
616 out_place: Some(dest_place),
618 // For output place `place`, add all places accessed by the inline asm.
621 InlineAsmOperand::In { reg: _, value } => {
622 if let Some(p) = value.place() {
623 if !p.is_indirect() && !dest_place.is_indirect() {
624 self.record_local_conflict(
627 "asm! operand overlap",
632 InlineAsmOperand::Out {
637 if !place.is_indirect() && !dest_place.is_indirect() {
638 self.record_local_conflict(
641 "asm! operand overlap",
645 InlineAsmOperand::InOut {
651 if let Some(place) = in_value.place() {
652 if !place.is_indirect() && !dest_place.is_indirect() {
653 self.record_local_conflict(
656 "asm! operand overlap",
661 if let Some(place) = out_place {
662 if !place.is_indirect() && !dest_place.is_indirect() {
663 self.record_local_conflict(
666 "asm! operand overlap",
671 InlineAsmOperand::Out { reg: _, late: _, place: None }
672 | InlineAsmOperand::Const { value: _ }
673 | InlineAsmOperand::SymFn { value: _ }
674 | InlineAsmOperand::SymStatic { def_id: _ } => {}
678 InlineAsmOperand::InOut {
684 | InlineAsmOperand::In { reg: _, value: _ }
685 | InlineAsmOperand::Out { reg: _, late: _, place: None }
686 | InlineAsmOperand::Const { value: _ }
687 | InlineAsmOperand::SymFn { value: _ }
688 | InlineAsmOperand::SymStatic { def_id: _ } => {}
693 TerminatorKind::Goto { .. }
694 | TerminatorKind::Call { destination: None, .. }
695 | TerminatorKind::SwitchInt { .. }
696 | TerminatorKind::Resume
697 | TerminatorKind::Abort
698 | TerminatorKind::Return
699 | TerminatorKind::Unreachable
700 | TerminatorKind::Drop { .. }
701 | TerminatorKind::Assert { .. }
702 | TerminatorKind::GeneratorDrop
703 | TerminatorKind::FalseEdge { .. }
704 | TerminatorKind::FalseUnwind { .. } => {}
708 /// Checks whether `a` and `b` may be merged. Returns `false` if there's a conflict.
709 fn can_unify(&mut self, a: Local, b: Local) -> bool {
710 // After some locals have been unified, their conflicts are only tracked in the root key,
712 let a = self.unified_locals.find(a).0;
713 let b = self.unified_locals.find(b).0;
716 // Already merged (part of the same connected component).
720 if self.matrix.contains(a, b) {
721 // Conflict (derived via dataflow, intra-statement conflicts, or inherited from another
722 // local during unification).
729 /// Merges the conflicts of `a` and `b`, so that each one inherits all conflicts of the other.
731 /// `can_unify` must have returned `true` for the same locals, or this may panic or lead to
734 /// This is called when the pass makes the decision to unify `a` and `b` (or parts of `a` and
735 /// `b`) and is needed to ensure that future unification decisions take potentially newly
736 /// introduced conflicts into account.
738 /// For an example, assume we have locals `_0`, `_1`, `_2`, and `_3`. There are these conflicts:
744 /// We then decide to merge `_2` with `_3` since they don't conflict. Then we decide to merge
745 /// `_2` with `_0`, which also doesn't have a conflict in the above list. However `_2` is now
746 /// `_3`, which does conflict with `_0`.
747 fn unify(&mut self, a: Local, b: Local) {
748 trace!("unify({:?}, {:?})", a, b);
750 // Get the root local of the connected components. The root local stores the conflicts of
751 // all locals in the connected component (and *is stored* as the conflicting local of other
753 let a = self.unified_locals.find(a).0;
754 let b = self.unified_locals.find(b).0;
757 trace!("roots: a={:?}, b={:?}", a, b);
758 trace!("{:?} conflicts: {:?}", a, self.matrix.iter(a).format(", "));
759 trace!("{:?} conflicts: {:?}", b, self.matrix.iter(b).format(", "));
761 self.unified_locals.union(a, b);
763 let root = self.unified_locals.find(a).0;
764 assert!(root == a || root == b);
766 // Make all locals that conflict with `a` also conflict with `b`, and vice versa.
767 self.unify_cache.clear();
768 for conflicts_with_a in self.matrix.iter(a) {
769 self.unify_cache.insert(conflicts_with_a);
771 for conflicts_with_b in self.matrix.iter(b) {
772 self.unify_cache.insert(conflicts_with_b);
774 for conflicts_with_a_or_b in self.unify_cache.iter() {
775 // Set both `a` and `b` for this local's row.
776 self.matrix.insert(conflicts_with_a_or_b, a);
777 self.matrix.insert(conflicts_with_a_or_b, b);
780 // Write the locals `a` conflicts with to `b`'s row.
781 self.matrix.union_rows(a, b);
782 // Write the locals `b` conflicts with to `a`'s row.
783 self.matrix.union_rows(b, a);
787 /// A `dest = {move} src;` statement at `loc`.
789 /// We want to consider merging `dest` and `src` due to this assignment.
790 #[derive(Debug, Copy, Clone)]
791 struct CandidateAssignment<'tcx> {
792 /// Does not contain indirection or indexing (so the only local it contains is the place base).
798 /// Scans the MIR for assignments between locals that we might want to consider merging.
800 /// This will filter out assignments that do not match the right form (as described in the top-level
801 /// comment) and also throw out assignments that involve a local that has its address taken or is
802 /// otherwise ineligible (eg. locals used as array indices are ignored because we cannot propagate
803 /// arbitrary places into array indices).
804 fn find_candidates<'tcx>(tcx: TyCtxt<'tcx>, body: &Body<'tcx>) -> Vec<CandidateAssignment<'tcx>> {
805 let mut visitor = FindAssignments {
808 candidates: Vec::new(),
809 ever_borrowed_locals: ever_borrowed_locals(body),
810 locals_used_as_array_index: locals_used_as_array_index(body),
812 visitor.visit_body(body);
816 struct FindAssignments<'a, 'tcx> {
818 body: &'a Body<'tcx>,
819 candidates: Vec<CandidateAssignment<'tcx>>,
820 ever_borrowed_locals: BitSet<Local>,
821 locals_used_as_array_index: BitSet<Local>,
824 impl<'tcx> Visitor<'tcx> for FindAssignments<'_, 'tcx> {
825 fn visit_statement(&mut self, statement: &Statement<'tcx>, location: Location) {
826 if let StatementKind::Assign(box (
828 Rvalue::Use(Operand::Copy(src) | Operand::Move(src)),
831 // `dest` must not have pointer indirection.
832 if dest.is_indirect() {
836 // `src` must be a plain local.
837 if !src.projection.is_empty() {
841 // Since we want to replace `src` with `dest`, `src` must not be required.
842 if is_local_required(src.local, self.body) {
846 // Can't optimize if both locals ever have their address taken (can introduce
848 // FIXME: This can be smarter and take `StorageDead` into account (which
849 // invalidates borrows).
850 if self.ever_borrowed_locals.contains(dest.local)
851 || self.ever_borrowed_locals.contains(src.local)
856 assert_ne!(dest.local, src.local, "self-assignments are UB");
858 // We can't replace locals occurring in `PlaceElem::Index` for now.
859 if self.locals_used_as_array_index.contains(src.local) {
863 // Handle the "subtle case" described above by rejecting any `dest` that is or
864 // projects through a union.
865 let mut place_ty = PlaceTy::from_ty(self.body.local_decls[dest.local].ty);
866 if place_ty.ty.is_union() {
869 for elem in dest.projection {
870 if let PlaceElem::Index(_) = elem {
871 // `dest` contains an indexing projection.
875 place_ty = place_ty.projection_ty(self.tcx, elem);
876 if place_ty.ty.is_union() {
881 self.candidates.push(CandidateAssignment {
890 /// Some locals are part of the function's interface and can not be removed.
892 /// Note that these locals *can* still be merged with non-required locals by removing that other
894 fn is_local_required(local: Local, body: &Body<'_>) -> bool {
895 match body.local_kind(local) {
896 LocalKind::Arg | LocalKind::ReturnPointer => true,
897 LocalKind::Var | LocalKind::Temp => false,
901 /// Walks MIR to find all locals that have their address taken anywhere.
902 fn ever_borrowed_locals(body: &Body<'_>) -> BitSet<Local> {
903 let mut visitor = BorrowCollector { locals: BitSet::new_empty(body.local_decls.len()) };
904 visitor.visit_body(body);
908 struct BorrowCollector {
909 locals: BitSet<Local>,
912 impl<'tcx> Visitor<'tcx> for BorrowCollector {
913 fn visit_rvalue(&mut self, rvalue: &Rvalue<'tcx>, location: Location) {
914 self.super_rvalue(rvalue, location);
917 Rvalue::AddressOf(_, borrowed_place) | Rvalue::Ref(_, _, borrowed_place) => {
918 if !borrowed_place.is_indirect() {
919 self.locals.insert(borrowed_place.local);
924 | Rvalue::ShallowInitBox(..)
928 | Rvalue::BinaryOp(..)
929 | Rvalue::CheckedBinaryOp(..)
930 | Rvalue::NullaryOp(..)
931 | Rvalue::UnaryOp(..)
932 | Rvalue::Discriminant(..)
933 | Rvalue::Aggregate(..)
934 | Rvalue::ThreadLocalRef(..) => {}
938 fn visit_terminator(&mut self, terminator: &Terminator<'tcx>, location: Location) {
939 self.super_terminator(terminator, location);
941 match terminator.kind {
942 TerminatorKind::Drop { place: dropped_place, .. }
943 | TerminatorKind::DropAndReplace { place: dropped_place, .. } => {
944 self.locals.insert(dropped_place.local);
947 TerminatorKind::Abort
948 | TerminatorKind::Assert { .. }
949 | TerminatorKind::Call { .. }
950 | TerminatorKind::FalseEdge { .. }
951 | TerminatorKind::FalseUnwind { .. }
952 | TerminatorKind::GeneratorDrop
953 | TerminatorKind::Goto { .. }
954 | TerminatorKind::Resume
955 | TerminatorKind::Return
956 | TerminatorKind::SwitchInt { .. }
957 | TerminatorKind::Unreachable
958 | TerminatorKind::Yield { .. }
959 | TerminatorKind::InlineAsm { .. } => {}
964 /// `PlaceElem::Index` only stores a `Local`, so we can't replace that with a full `Place`.
966 /// Collect locals used as indices so we don't generate candidates that are impossible to apply
968 fn locals_used_as_array_index(body: &Body<'_>) -> BitSet<Local> {
969 let mut visitor = IndexCollector { locals: BitSet::new_empty(body.local_decls.len()) };
970 visitor.visit_body(body);
974 struct IndexCollector {
975 locals: BitSet<Local>,
978 impl<'tcx> Visitor<'tcx> for IndexCollector {
979 fn visit_projection_elem(
982 proj_base: &[PlaceElem<'tcx>],
983 elem: PlaceElem<'tcx>,
984 context: PlaceContext,
987 if let PlaceElem::Index(i) = elem {
988 self.locals.insert(i);
990 self.super_projection_elem(local, proj_base, elem, context, location);