ARM64: Fix LSE SIMD test.
One VecStore instruction is eliminated since
https://android-review.googlesource.com/1355117
but the test was not properly updated.
Also fix a few typos from that commit.
Test: testrunner.py --target --64 530-checker-lse-simd
Bug: 77906240
Change-Id: I6926ec67f9f503743452eabb53c057b5ebd19b8a
diff --git a/compiler/optimizing/load_store_elimination.cc b/compiler/optimizing/load_store_elimination.cc
index 7ea7feb..57839dc 100644
--- a/compiler/optimizing/load_store_elimination.cc
+++ b/compiler/optimizing/load_store_elimination.cc
@@ -121,7 +121,7 @@
* replacement search, there are additional dependencies to consider, see below.
*
* In the successful case (no unknown inputs found) we use the Floyd-Warshal
- * algorith to determine transitive closures for each found Phi placeholder,
+ * algorithm to determine transitive closures for each found Phi placeholder,
* and then match or materialize Phis from the smallest transitive closure,
* so that we can determine if such subset has a single other input. This has
* time complexity
@@ -170,7 +170,7 @@
*
* 3. Determine which stores to keep and which to eliminate.
*
- * During instruction processing in phase 1 an re-processing in phase 2, we are
+ * During instruction processing in phase 1 and re-processing in phase 2, we are
* keeping a record of the stores and Phi placeholders that become observable
* and now propagate the observable Phi placeholders to all actual stores that
* feed them. Having determined observable stores, we look for stores that just
@@ -184,7 +184,7 @@
* loop, just use that input. If this succeeds and the old value is identical to
* the value we're storing, such store shall be eliminated.
*
- * The work is similar to the phase 2, except that we're not re-rocessing loads
+ * The work is similar to the phase 2, except that we're not re-processing loads
* and stores anymore, so the time complexity of phase 3 is
* O(heap_locations^3 * blocks^3) .
*
@@ -1680,7 +1680,7 @@
}
if (phase == Phase::kStoreElimination) {
- // We're not creting Phis during the final store elimination phase.
+ // We're not creating Phis during the final store elimination phase.
return false;
}
@@ -1735,7 +1735,7 @@
// Use local allocator to reduce peak memory usage.
ScopedArenaAllocator allocator(allocator_.GetArenaStack());
- // We want to recognize when a subset of these loop Phis that do not needed other
+ // We want to recognize when a subset of these loop Phis that do not need other
// loop Phis, i.e. a transitive closure, has only one other instruction as an input,
// i.e. that instruction can be used instead of each Phi in the set. See for example
// Main.testLoop{5,6,7,8}() in the test 530-checker-lse. To do that, we shall
diff --git a/test/530-checker-lse-simd/src/Main.java b/test/530-checker-lse-simd/src/Main.java
index f764f73..fd3333b 100644
--- a/test/530-checker-lse-simd/src/Main.java
+++ b/test/530-checker-lse-simd/src/Main.java
@@ -231,7 +231,6 @@
/// CHECK-NEXT: ArrayLength
//
/// CHECK: VecLoad loop:{{B\d+}}
- /// CHECK-NEXT: VecStore
/// CHECK-NEXT: VecAdd
/// CHECK-NEXT: VecAdd
/// CHECK-NEXT: VecStore