diff options
| author | Camille GILLOT <gillot.camille@gmail.com> | 2023-01-19 16:57:32 +0000 |
|---|---|---|
| committer | Camille GILLOT <gillot.camille@gmail.com> | 2023-01-27 18:22:45 +0000 |
| commit | bec73b09fdc77d74972d25fefd111fbb9d20fba1 (patch) | |
| tree | 0de8d52b226a3e23504b5a6766acfb5693d3eb8e | |
| parent | 8f1dbe54ea5e05725273ae8ac6c1dda15153fa7c (diff) | |
| download | rust-bec73b09fdc77d74972d25fefd111fbb9d20fba1.tar.gz rust-bec73b09fdc77d74972d25fefd111fbb9d20fba1.zip | |
Pacify tidy.
| -rw-r--r-- | compiler/rustc_mir_transform/src/copy_prop.rs | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/compiler/rustc_mir_transform/src/copy_prop.rs b/compiler/rustc_mir_transform/src/copy_prop.rs index bce307d368c..8b024721718 100644 --- a/compiler/rustc_mir_transform/src/copy_prop.rs +++ b/compiler/rustc_mir_transform/src/copy_prop.rs @@ -67,7 +67,7 @@ enum LocationExtended { #[derive(Debug)] struct SsaLocals { dominators: Dominators<BasicBlock>, - /// Assignments to each local. This defines whether the local is SSA. + /// Assignments to each local. This defines whether the local is SSA. assignments: IndexVec<Local, Set1<LocationExtended>>, /// We visit the body in reverse postorder, to ensure each local is assigned before it is used. /// We remember the order in which we saw the assignments to compute the SSA values in a single @@ -157,7 +157,7 @@ impl<'tcx> Visitor<'tcx> for SsaLocals { /// _d => _a // transitively through _c /// /// This function also returns whether all the `move?` in the pattern are `move` and not copies. -/// A local which is in the bitset can be replaced by `move _a`. Otherwise, it must be +/// A local which is in the bitset can be replaced by `move _a`. Otherwise, it must be /// replaced by `copy _a`, as we cannot move multiple times from `_a`. /// /// If an operand copies `_c`, it must happen before the assignment `_d = _c`, otherwise it is UB. @@ -221,7 +221,7 @@ fn compute_copy_classes( fn meet_copy_equivalence(copies: &IndexVec<Local, Local>, property: &mut BitSet<Local>) { // Consolidate to have a local iff all its copies are. // - // `copies` defines equivalence classes between locals. The `local`s that recursively + // `copies` defines equivalence classes between locals. The `local`s that recursively // move/copy the same local all have the same `head`. for (local, &head) in copies.iter_enumerated() { // If any copy does not have `property`, then the head is not. |