[polly] d785168 - [polly] Remove trailing whitespace from tests. NFC.
Michael Kruse via llvm-commits
llvm-commits at lists.llvm.org
Tue Feb 22 13:41:23 PST 2022
Author: Michael Kruse
Date: 2022-02-22T15:41:13-06:00
New Revision: d7851685a3991aea9b9a3bbce9699c046abf1a07
URL: https://github.com/llvm/llvm-project/commit/d7851685a3991aea9b9a3bbce9699c046abf1a07
DIFF: https://github.com/llvm/llvm-project/commit/d7851685a3991aea9b9a3bbce9699c046abf1a07.diff
LOG: [polly] Remove trailing whitespace from tests. NFC.
Added:
Modified:
polly/test/CodeGen/OpenMP/invariant_base_pointers_preloaded.ll
polly/test/CodeGen/invariant_load_address_space.ll
polly/test/CodeGen/invariant_load_escaping.ll
polly/test/CodeGen/stmt_split_no_dependence.ll
polly/test/DeLICM/pr41656.ll
polly/test/DeLICM/pr48783.ll
polly/test/DependenceInfo/nonaffine-condition-buildMemoryAccess.ll
polly/test/GPGPU/add-scalars-in-scop-to-kills.ll
polly/test/GPGPU/debug-metadata-leak.ll
polly/test/GPGPU/invalid-kernel-assert-verifymodule.ll
polly/test/GPGPU/invariant-load-hoisting-with-variable-lower-bound.ll
polly/test/GPGPU/privatization-simple.ll
polly/test/GPGPU/privatization.ll
polly/test/MaximalStaticExpansion/read_from_original.ll
polly/test/MaximalStaticExpansion/too_many_writes.ll
polly/test/MaximalStaticExpansion/working_deps_between_inners.ll
polly/test/MaximalStaticExpansion/working_deps_between_inners_phi.ll
polly/test/MaximalStaticExpansion/working_expansion.ll
polly/test/MaximalStaticExpansion/working_expansion_multiple_dependences_per_statement.ll
polly/test/MaximalStaticExpansion/working_expansion_multiple_instruction_per_statement.ll
polly/test/MaximalStaticExpansion/working_phi_two_scalars.ll
polly/test/ScheduleOptimizer/ManualOptimization/disable_nonforced.ll
polly/test/ScheduleOptimizer/prevectorization.ll
polly/test/ScopInfo/Alias-1.ll
polly/test/ScopInfo/NonAffine/non_affine_but_srem.ll
polly/test/ScopInfo/modulo_zext_1.ll
polly/test/ScopInfo/multidim_fortran_srem.ll
polly/test/ScopInfo/opaque-struct.ll
polly/test/ScopInfo/pointer-comparison-no-nsw.ll
polly/test/ScopInfo/reduction_disabled_multiplicative.ll
polly/test/ScopInfo/redundant_parameter_constraint.ll
polly/test/ScopInfo/scev-div-with-evaluatable-divisor.ll
polly/test/ScopInfo/switch-4.ll
polly/test/ScopInfo/two-loops-one-infinite.ll
polly/test/Simplify/dead_access_phi.ll
polly/test/Simplify/dead_access_value.ll
polly/test/Simplify/overwritten.ll
polly/test/Simplify/overwritten_3store.ll
polly/test/Simplify/overwritten_loadbetween.ll
Removed:
################################################################################
diff --git a/polly/test/CodeGen/OpenMP/invariant_base_pointers_preloaded.ll b/polly/test/CodeGen/OpenMP/invariant_base_pointers_preloaded.ll
index 6dcdf9e6e1469..483e302852e6a 100644
--- a/polly/test/CodeGen/OpenMP/invariant_base_pointers_preloaded.ll
+++ b/polly/test/CodeGen/OpenMP/invariant_base_pointers_preloaded.ll
@@ -8,7 +8,7 @@
; A[i] += A[0] + A[0];
; }
;
-; CHECK: %polly.subfn.storeaddr.polly.access.A.load = getelementptr inbounds
+; CHECK: %polly.subfn.storeaddr.polly.access.A.load = getelementptr inbounds
; CHECK: store float %polly.access.A.load, float* %polly.subfn.storeaddr.polly.access.A.load
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
diff --git a/polly/test/CodeGen/invariant_load_address_space.ll b/polly/test/CodeGen/invariant_load_address_space.ll
index 5ed73dc387cc2..62ff99bd7b809 100644
--- a/polly/test/CodeGen/invariant_load_address_space.ll
+++ b/polly/test/CodeGen/invariant_load_address_space.ll
@@ -2,7 +2,7 @@
;
; CHECK-LABEL: polly.preload.begin:
; CHECK-NEXT: %polly.access.B = getelementptr i32, i32 addrspace(1)* %B, i64 0
-; CHECK-NOT: addrspacecast
+; CHECK-NOT: addrspacecast
; CHECK-NEXT: %polly.access.B.load = load i32, i32 addrspace(1)* %polly.access.B
;
; CHECK-LABEL: polly.stmt.bb2:
diff --git a/polly/test/CodeGen/invariant_load_escaping.ll b/polly/test/CodeGen/invariant_load_escaping.ll
index 9c1fbfbc26de9..06d2003f6c19a 100644
--- a/polly/test/CodeGen/invariant_load_escaping.ll
+++ b/polly/test/CodeGen/invariant_load_escaping.ll
@@ -2,7 +2,7 @@
;
; int f(int *A, int *B) {
; // Possible aliasing between A and B but if not then *B would be
-; // invariant. We assume this and hoist *B but need to use a merged
+; // invariant. We assume this and hoist *B but need to use a merged
; // version in the return.
; int i = 0;
; int x = 0;
diff --git a/polly/test/CodeGen/stmt_split_no_dependence.ll b/polly/test/CodeGen/stmt_split_no_dependence.ll
index 12aeebc9bdd7a..0ad65b0b8587a 100644
--- a/polly/test/CodeGen/stmt_split_no_dependence.ll
+++ b/polly/test/CodeGen/stmt_split_no_dependence.ll
@@ -41,4 +41,4 @@ for.end: ; preds = %for.cond
ret void
}
-!0 = !{!"polly_split_after"}
+!0 = !{!"polly_split_after"}
diff --git a/polly/test/DeLICM/pr41656.ll b/polly/test/DeLICM/pr41656.ll
index 8ef6ca13c9441..a297dcf51c8ca 100644
--- a/polly/test/DeLICM/pr41656.ll
+++ b/polly/test/DeLICM/pr41656.ll
@@ -1,7 +1,7 @@
; RUN: opt %loadPolly -polly-scops -polly-delicm -analyze < %s | FileCheck %s
;
; llvm.org/PR41656
-;
+;
; This test case has an InvalidContext such that part of the predecessors
; of for.body.us.i lie within the invalid context. This causes a
; consistency check withing the invalid context of PR41656 to fail.
diff --git a/polly/test/DeLICM/pr48783.ll b/polly/test/DeLICM/pr48783.ll
index c490d9b55fbfb..d5faf82a374f1 100644
--- a/polly/test/DeLICM/pr48783.ll
+++ b/polly/test/DeLICM/pr48783.ll
@@ -61,7 +61,7 @@ for.cond2.for.end_crit_edge.us.i: ; preds = %for.body5.us.for.bo
fill_samples.exit: ; preds = %for.cond2.for.end_crit_edge.us.i, %for.body.us.i.us
ret void
}
-
+
declare dso_local i32 @av_get_channel_layout_nb_channels() local_unnamed_addr #0
; Function Attrs: nounwind readnone speculatable
diff --git a/polly/test/DependenceInfo/nonaffine-condition-buildMemoryAccess.ll b/polly/test/DependenceInfo/nonaffine-condition-buildMemoryAccess.ll
index a228ca4db5a69..c216c45256f58 100644
--- a/polly/test/DependenceInfo/nonaffine-condition-buildMemoryAccess.ll
+++ b/polly/test/DependenceInfo/nonaffine-condition-buildMemoryAccess.ll
@@ -1,4 +1,4 @@
-; RUN: opt %loadPolly -polly-codegen -polly-allow-nonaffine-loops -polly-allow-nonaffine -debug-only=polly-dependence < %s 2>&1 | FileCheck %s
+; RUN: opt %loadPolly -polly-codegen -polly-allow-nonaffine-loops -polly-allow-nonaffine -debug-only=polly-dependence < %s 2>&1 | FileCheck %s
; REQUIRES: asserts
; CHECK: MayWriteAccess := [Reduction Type: NONE] [Scalar: 0]
diff --git a/polly/test/GPGPU/add-scalars-in-scop-to-kills.ll b/polly/test/GPGPU/add-scalars-in-scop-to-kills.ll
index f3272dea19583..1649024c0e71c 100644
--- a/polly/test/GPGPU/add-scalars-in-scop-to-kills.ll
+++ b/polly/test/GPGPU/add-scalars-in-scop-to-kills.ll
@@ -22,15 +22,15 @@
; #pragma scop
; for(int i = 0; i < 1000; i++) {
; XLoopInit: x = 0;
-;
+;
; if (control1 > 2)
; C1Add: x += 10;
; if (control2 > 3)
; C2Add: x += A[i];
-;
+;
; BLoopAccumX: B[i] += x;
; }
-;
+;
; #pragma endscop
; }
; ModuleID = 'test.ll'
diff --git a/polly/test/GPGPU/debug-metadata-leak.ll b/polly/test/GPGPU/debug-metadata-leak.ll
index d0cb72ba31f4d..24a6f51d5fdd8 100644
--- a/polly/test/GPGPU/debug-metadata-leak.ll
+++ b/polly/test/GPGPU/debug-metadata-leak.ll
@@ -16,7 +16,7 @@
;
; https://reviews.llvm.org/D35630 removes this debug metadata before the
; instruction is copied to the GPUModule.
-;
+;
; vec_add_1.c:
; void vec_add_1(int N, int arr[N]) {
; int i=0;
diff --git a/polly/test/GPGPU/invalid-kernel-assert-verifymodule.ll b/polly/test/GPGPU/invalid-kernel-assert-verifymodule.ll
index 7bc14364b9ca5..222817577aaf2 100644
--- a/polly/test/GPGPU/invalid-kernel-assert-verifymodule.ll
+++ b/polly/test/GPGPU/invalid-kernel-assert-verifymodule.ll
@@ -13,7 +13,7 @@
; }
-; RUN: opt %loadPolly -polly-codegen-ppcg -S < %s
+; RUN: opt %loadPolly -polly-codegen-ppcg -S < %s
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
diff --git a/polly/test/GPGPU/invariant-load-hoisting-with-variable-lower-bound.ll b/polly/test/GPGPU/invariant-load-hoisting-with-variable-lower-bound.ll
index 547aa8bd26ec2..310d7fb062353 100644
--- a/polly/test/GPGPU/invariant-load-hoisting-with-variable-lower-bound.ll
+++ b/polly/test/GPGPU/invariant-load-hoisting-with-variable-lower-bound.ll
@@ -21,7 +21,7 @@
; This declaration would not have been generated unless a kernel launch exists.
; HOST-IR: declare void @polly_launchKernel(i8*, i32, i32, i32, i32, i32, i8*)
-;
+;
; void f(int *begin, int *arr) {
; for (int i = *begin; i < 100; i++) {
; arr[i] = 0;
diff --git a/polly/test/GPGPU/privatization-simple.ll b/polly/test/GPGPU/privatization-simple.ll
index 34f543786d6db..621e7b9791841 100644
--- a/polly/test/GPGPU/privatization-simple.ll
+++ b/polly/test/GPGPU/privatization-simple.ll
@@ -18,7 +18,7 @@
; x = 0;
; if(control) x = C[i];
; B[i] = x * A[i];
-;
+;
; }
; #pragma endscop
; }
diff --git a/polly/test/GPGPU/privatization.ll b/polly/test/GPGPU/privatization.ll
index 0b67b0bbc2583..7cbdc130cefaf 100644
--- a/polly/test/GPGPU/privatization.ll
+++ b/polly/test/GPGPU/privatization.ll
@@ -12,7 +12,7 @@
; the declare would not be generated unless a call to a kernel exists.
; HOST-IR: declare void @polly_launchKernel(i8*, i32, i32, i32, i32, i32, i8*)
-;
+;
;
; void checkPrivatization(int A[], int B[], int C[], int control) {
; int x;
diff --git a/polly/test/MaximalStaticExpansion/read_from_original.ll b/polly/test/MaximalStaticExpansion/read_from_original.ll
index c46b25c445daf..afec6dea42450 100644
--- a/polly/test/MaximalStaticExpansion/read_from_original.ll
+++ b/polly/test/MaximalStaticExpansion/read_from_original.ll
@@ -7,7 +7,7 @@
;
; #define Ni 2000
; #define Nj 3000
-;
+;
; double mse(double A[Ni], double B[Nj]) {
; int i;
; double tmp = 6;
@@ -15,7 +15,7 @@
; for (int j = 2; j<Nj; j++) {
; B[j-1] = j;
; }
-; A[i] = B[i];
+; A[i] = B[i];
; }
; return tmp;
; }
diff --git a/polly/test/MaximalStaticExpansion/too_many_writes.ll b/polly/test/MaximalStaticExpansion/too_many_writes.ll
index 1dac814425671..5a8c1f5ce50fe 100644
--- a/polly/test/MaximalStaticExpansion/too_many_writes.ll
+++ b/polly/test/MaximalStaticExpansion/too_many_writes.ll
@@ -7,16 +7,16 @@
;
; #define Ni 2000
; #define Nj 2000
-;
+;
; double mse(double A[Ni], double B[Nj]) {
; int i;
; double tmp = 6;
; for (i = 0; i < Ni; i++) {
-; B[i] = 2;
+; B[i] = 2;
; for (int j = 0; j<Nj; j++) {
; B[j] = j;
; }
-; A[i] = B[i];
+; A[i] = B[i];
; }
; return tmp;
; }
diff --git a/polly/test/MaximalStaticExpansion/working_deps_between_inners.ll b/polly/test/MaximalStaticExpansion/working_deps_between_inners.ll
index 7cf5f33c47478..d15654cdb1868 100644
--- a/polly/test/MaximalStaticExpansion/working_deps_between_inners.ll
+++ b/polly/test/MaximalStaticExpansion/working_deps_between_inners.ll
@@ -6,15 +6,15 @@
;
; #define Ni 2000
; #define Nj 3000
-;
+;
; void tmp3(double A[Ni], double B[Nj]) {
; int i,j;
; double tmp = 6;
; for (i = 0; i < Ni; i++) {
;
; for(int h = 0; h<Nj; h++)
-; B[h] = h;
-;
+; B[h] = h;
+;
; for(j = 0; j < Nj; j++) {
; for(int k=0; k<Nj; k++) {
; tmp = i+k+j;
diff --git a/polly/test/MaximalStaticExpansion/working_deps_between_inners_phi.ll b/polly/test/MaximalStaticExpansion/working_deps_between_inners_phi.ll
index 828c5a0f29f68..50b3574d3355e 100644
--- a/polly/test/MaximalStaticExpansion/working_deps_between_inners_phi.ll
+++ b/polly/test/MaximalStaticExpansion/working_deps_between_inners_phi.ll
@@ -8,15 +8,15 @@
;
; #define Ni 2000
; #define Nj 3000
-;
+;
; void tmp3(double A[Ni], double B[Nj]) {
; int i,j;
; double tmp = 6;
; for (i = 0; i < Ni; i++) {
-;
+;
; for(int h = 0; h<Nj; h++)
; B[h] = h;
-;
+;
; for(j = 0; j < Nj; j++) {
; for(int k=0; k<Nj; k++) {
; tmp = tmp+i+k+j;
diff --git a/polly/test/MaximalStaticExpansion/working_expansion.ll b/polly/test/MaximalStaticExpansion/working_expansion.ll
index 02e08b94e1e31..5d52e65d08c45 100644
--- a/polly/test/MaximalStaticExpansion/working_expansion.ll
+++ b/polly/test/MaximalStaticExpansion/working_expansion.ll
@@ -6,7 +6,7 @@
;
; #define Ni 2000
; #define Nj 3000
-;
+;
; double mse(double A[Ni], double B[Nj]) {
; int i;
; double tmp = 6;
@@ -14,7 +14,7 @@
; for (int j = 0; j<Nj; j++) {
; B[j] = j;
; }
-; A[i] = B[i];
+; A[i] = B[i];
; }
; return tmp;
; }
diff --git a/polly/test/MaximalStaticExpansion/working_expansion_multiple_dependences_per_statement.ll b/polly/test/MaximalStaticExpansion/working_expansion_multiple_dependences_per_statement.ll
index e4c9f6825596d..ea52dc7d520aa 100644
--- a/polly/test/MaximalStaticExpansion/working_expansion_multiple_dependences_per_statement.ll
+++ b/polly/test/MaximalStaticExpansion/working_expansion_multiple_dependences_per_statement.ll
@@ -12,10 +12,10 @@
; for (j = 0; j < Ni; j++) {
; for (int i = 0; i<Nj; i++)
; B[i] = i;
-;
+;
; for (int i = 0; i<Nj; i++)
; D[i] = i;
-;
+;
; A[j] = B[j];
; C[j] = D[j];
; }
diff --git a/polly/test/MaximalStaticExpansion/working_expansion_multiple_instruction_per_statement.ll b/polly/test/MaximalStaticExpansion/working_expansion_multiple_instruction_per_statement.ll
index 3872a40514e1b..befc9fc396c83 100644
--- a/polly/test/MaximalStaticExpansion/working_expansion_multiple_instruction_per_statement.ll
+++ b/polly/test/MaximalStaticExpansion/working_expansion_multiple_instruction_per_statement.ll
@@ -1,6 +1,6 @@
; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-mse -analyze < %s | FileCheck %s
;
-; Verify that the accesses are correctly expanded
+; Verify that the accesses are correctly expanded
;
; Original source code :
;
diff --git a/polly/test/MaximalStaticExpansion/working_phi_two_scalars.ll b/polly/test/MaximalStaticExpansion/working_phi_two_scalars.ll
index c4d8983b2824b..5aaf494bf6606 100644
--- a/polly/test/MaximalStaticExpansion/working_phi_two_scalars.ll
+++ b/polly/test/MaximalStaticExpansion/working_phi_two_scalars.ll
@@ -51,7 +51,7 @@
; CHECK-NOT: new: { Stmt_for_inc4[i0] -> MemRef_tmp_05__phi_Stmt_for_body_expanded[1 + i0] : i0 <= 9998 };
; CHECK: new: { Stmt_for_inc4[i0] -> MemRef_conv_lcssa__phi_Stmt_for_inc4_expanded[i0] };
; CHECK: new: { Stmt_for_inc4[i0] -> MemRef_add_lcssa__phi_Stmt_for_inc4_expanded[i0] };
-;
+;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"
diff --git a/polly/test/ScheduleOptimizer/ManualOptimization/disable_nonforced.ll b/polly/test/ScheduleOptimizer/ManualOptimization/disable_nonforced.ll
index c041dce0c9e05..ce8bc3a2f66a9 100644
--- a/polly/test/ScheduleOptimizer/ManualOptimization/disable_nonforced.ll
+++ b/polly/test/ScheduleOptimizer/ManualOptimization/disable_nonforced.ll
@@ -2,7 +2,7 @@
;
; Check that the disable_nonforced metadata is honored; optimization
; heuristics/rescheduling must not be applied.
-;
+;
define void @func(i32 %n, double* noalias nonnull %A) {
entry:
br label %for
diff --git a/polly/test/ScheduleOptimizer/prevectorization.ll b/polly/test/ScheduleOptimizer/prevectorization.ll
index 426972ddc878d..cf222b2543749 100644
--- a/polly/test/ScheduleOptimizer/prevectorization.ll
+++ b/polly/test/ScheduleOptimizer/prevectorization.ll
@@ -1,6 +1,6 @@
; RUN: opt -S %loadPolly -basic-aa -polly-opt-isl \
; RUN: -polly-pattern-matching-based-opts=false -polly-vectorizer=polly \
-; RUN: -polly-ast -analyze < %s | FileCheck %s
+; RUN: -polly-ast -analyze < %s | FileCheck %s
; RUN: opt -S %loadPolly -basic-aa -polly-opt-isl \
; RUN: -polly-pattern-matching-based-opts=false -polly-vectorizer=stripmine \
; RUN: -polly-ast -analyze < %s | FileCheck %s
diff --git a/polly/test/ScopInfo/Alias-1.ll b/polly/test/ScopInfo/Alias-1.ll
index e592990767192..e358148f3e21a 100644
--- a/polly/test/ScopInfo/Alias-1.ll
+++ b/polly/test/ScopInfo/Alias-1.ll
@@ -8,7 +8,7 @@ define void @f(i32* nocapture %a, i32* nocapture %b) nounwind {
bb.nph:
%0 = tail call i32 (...) @rnd() nounwind ; <i32> [#uses=1]
%1 = icmp eq i32 %0, 0 ; <i1> [#uses=1]
- %sel.b = getelementptr inbounds i32, i32* %b, i64 4
+ %sel.b = getelementptr inbounds i32, i32* %b, i64 4
%iftmp.0.0 = select i1 %1, i32* %sel.b, i32* %a ; <i32*> [#uses=2]
br label %bb3
diff --git a/polly/test/ScopInfo/NonAffine/non_affine_but_srem.ll b/polly/test/ScopInfo/NonAffine/non_affine_but_srem.ll
index 0c77832cfb491..efd2ba8f17afc 100644
--- a/polly/test/ScopInfo/NonAffine/non_affine_but_srem.ll
+++ b/polly/test/ScopInfo/NonAffine/non_affine_but_srem.ll
@@ -31,7 +31,7 @@
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [n] -> { Stmt_bb2[i0] -> [i0] };
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
-; CHECK-NEXT: [n] -> { Stmt_bb2[i0] -> MemRef_A[o0] : (-n + o0) mod 42 = 0 and -41 <= o0 <= 41 and ((n > 0 and o0 >= 0) or (n <= 0 and o0 <= 0)) };
+; CHECK-NEXT: [n] -> { Stmt_bb2[i0] -> MemRef_A[o0] : (-n + o0) mod 42 = 0 and -41 <= o0 <= 41 and ((n > 0 and o0 >= 0) or (n <= 0 and o0 <= 0)) };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [n] -> { Stmt_bb2[i0] -> MemRef_A[o0] : (-n + o0) mod 42 = 0 and -41 <= o0 <= 41 and ((n > 0 and o0 >= 0) or (n <= 0 and o0 <= 0)) };
; CHECK-NEXT: }
diff --git a/polly/test/ScopInfo/modulo_zext_1.ll b/polly/test/ScopInfo/modulo_zext_1.ll
index 9116d323e3624..17efa8fe67612 100644
--- a/polly/test/ScopInfo/modulo_zext_1.ll
+++ b/polly/test/ScopInfo/modulo_zext_1.ll
@@ -14,7 +14,7 @@
; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0]
; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[1] : (1 + i0) mod 2 = 0; Stmt_for_body[i0] -> MemRef_A[0] : (i0) mod 2 = 0 }
; CHECK-NEXT: MustWriteAccess := [Reduction Type: +] [Scalar: 0]
-; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[1] : (1 + i0) mod 2 = 0; Stmt_for_body[i0] -> MemRef_A[0] : (i0) mod 2 = 0 };
+; CHECK-NEXT: [N] -> { Stmt_for_body[i0] -> MemRef_A[1] : (1 + i0) mod 2 = 0; Stmt_for_body[i0] -> MemRef_A[0] : (i0) mod 2 = 0 };
; CHECK-NEXT: }
;
; void f(int *A, int N) {
diff --git a/polly/test/ScopInfo/multidim_fortran_srem.ll b/polly/test/ScopInfo/multidim_fortran_srem.ll
index c74e67e0ae002..5994c51b97198 100644
--- a/polly/test/ScopInfo/multidim_fortran_srem.ll
+++ b/polly/test/ScopInfo/multidim_fortran_srem.ll
@@ -23,7 +23,7 @@ target datalayout = "e-p:64:64:64-S128-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 1]
; CHECK-NEXT: [tmp180, tmp177, tmp183, tmp162, tmp157, tmp150, tmp146, tmp140, tmp] -> { Stmt_bb203[i0, i1, i2] -> MemRef_tmp194[] };
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
-; CHECK-NEXT: [tmp180, tmp177, tmp183, tmp162, tmp157, tmp150, tmp146, tmp140, tmp] -> { Stmt_bb203[i0, i1, i2] -> MemRef_tmp173[o0, 1 + i1, 1 + i2] : (1 - i0 + o0) mod 3 = 0 and 0 <= o0 <= 2 }
+; CHECK-NEXT: [tmp180, tmp177, tmp183, tmp162, tmp157, tmp150, tmp146, tmp140, tmp] -> { Stmt_bb203[i0, i1, i2] -> MemRef_tmp173[o0, 1 + i1, 1 + i2] : (1 - i0 + o0) mod 3 = 0 and 0 <= o0 <= 2 }
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [tmp180, tmp177, tmp183, tmp162, tmp157, tmp150, tmp146, tmp140, tmp] -> { Stmt_bb203[i0, i1, i2] -> MemRef_arg56[1 + i0, 1 + i1, 1 + i2] };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
diff --git a/polly/test/ScopInfo/opaque-struct.ll b/polly/test/ScopInfo/opaque-struct.ll
index 2d6a66f578515..3808bba4a6170 100644
--- a/polly/test/ScopInfo/opaque-struct.ll
+++ b/polly/test/ScopInfo/opaque-struct.ll
@@ -1,4 +1,4 @@
-; RUN: opt %loadPolly -polly-scops -disable-output < %s
+; RUN: opt %loadPolly -polly-scops -disable-output < %s
;
; Check that we do not crash with unsized (opaque) types.
;
diff --git a/polly/test/ScopInfo/pointer-comparison-no-nsw.ll b/polly/test/ScopInfo/pointer-comparison-no-nsw.ll
index 232e119604162..7468f1be18ab6 100644
--- a/polly/test/ScopInfo/pointer-comparison-no-nsw.ll
+++ b/polly/test/ScopInfo/pointer-comparison-no-nsw.ll
@@ -8,7 +8,7 @@
; }
;
; CHECK: Invalid Context:
-; CHECK-NEXT: [A, B] -> { : (4*floor((A - B)/4) < A - B) or ((-A + B) mod 4 = 0 and B >= 9223372036854775808 + A) or ((-A + B) mod 4 = 0 and B <= -4 + A) }
+; CHECK-NEXT: [A, B] -> { : (4*floor((A - B)/4) < A - B) or ((-A + B) mod 4 = 0 and B >= 9223372036854775808 + A) or ((-A + B) mod 4 = 0 and B <= -4 + A) }
;
; CHECK: Domain :=
; CHECK-NEXT: [A, B] -> { Stmt_while_body[i0] : (-A + B) mod 4 = 0 and i0 >= 0 and 4i0 <= -4 - A + B }
diff --git a/polly/test/ScopInfo/reduction_disabled_multiplicative.ll b/polly/test/ScopInfo/reduction_disabled_multiplicative.ll
index 2d02d72faa626..778b117d842d2 100644
--- a/polly/test/ScopInfo/reduction_disabled_multiplicative.ll
+++ b/polly/test/ScopInfo/reduction_disabled_multiplicative.ll
@@ -10,7 +10,7 @@
; CHECK: { Stmt_for_body[i0] -> MemRef_prod[0] };
;
; int sum, prod;
-;
+;
; void f() {
; int i;
; for (int i = 0; i < 100; i++) {
diff --git a/polly/test/ScopInfo/redundant_parameter_constraint.ll b/polly/test/ScopInfo/redundant_parameter_constraint.ll
index 4ab055f03e13d..e1c6801e84518 100644
--- a/polly/test/ScopInfo/redundant_parameter_constraint.ll
+++ b/polly/test/ScopInfo/redundant_parameter_constraint.ll
@@ -3,7 +3,7 @@
; The constraint that r2 has to be bigger than r1 is implicitly containted in
; the domain, hence we do not want to see it explicitly.
;
-; CHECK-NOT: r2 >= 1 + r1
+; CHECK-NOT: r2 >= 1 + r1
;
; void wraps(int *A, int p, short q, char r1, char r2) {
; for (char i = r1; i < r2; i++)
diff --git a/polly/test/ScopInfo/scev-div-with-evaluatable-divisor.ll b/polly/test/ScopInfo/scev-div-with-evaluatable-divisor.ll
index 83574fe2556c4..d581d1ea371c8 100644
--- a/polly/test/ScopInfo/scev-div-with-evaluatable-divisor.ll
+++ b/polly/test/ScopInfo/scev-div-with-evaluatable-divisor.ll
@@ -2,7 +2,7 @@
; Derived from test-suite/SingleSource/UnitTests/Vector/SSE/sse.stepfft.c
-; The values %mul.i44 is simplified to constant 4 by ScalarEvolution, but
+; The values %mul.i44 is simplified to constant 4 by ScalarEvolution, but
; SCEVAffinator used to check whether the sdiv's argument was constant.
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
diff --git a/polly/test/ScopInfo/switch-4.ll b/polly/test/ScopInfo/switch-4.ll
index 02a917a2c0308..79c2364634f7e 100644
--- a/polly/test/ScopInfo/switch-4.ll
+++ b/polly/test/ScopInfo/switch-4.ll
@@ -51,7 +51,7 @@
; CHECK-NEXT: [N] -> { Stmt_sw_bb_5[i0] -> MemRef_A[i0] };
; CHECK-NEXT: Stmt_sw_bb_9
; CHECK-NEXT: Domain :=
-; CHECK-NEXT: [N] -> { Stmt_sw_bb_9[i0] : (1 + i0) mod 4 = 0 and 3 <= i0 < N };
+; CHECK-NEXT: [N] -> { Stmt_sw_bb_9[i0] : (1 + i0) mod 4 = 0 and 3 <= i0 < N };
; CHECK-NEXT: Schedule :=
; CHECK-NEXT: [N] -> { Stmt_sw_bb_9[i0] -> [i0, 0] };
; CHECK-NEXT: ReadAccess := [Reduction Type: +] [Scalar: 0]
diff --git a/polly/test/ScopInfo/two-loops-one-infinite.ll b/polly/test/ScopInfo/two-loops-one-infinite.ll
index 974194f04cace..2eb032659f582 100644
--- a/polly/test/ScopInfo/two-loops-one-infinite.ll
+++ b/polly/test/ScopInfo/two-loops-one-infinite.ll
@@ -8,8 +8,8 @@ target datalayout = "e-m:e-p:32:32-i64:64-v128:64:128-a:0:32-n8:16:32-S64"
define void @foo(i32* noalias nocapture readonly %xxx, i32* noalias nocapture readonly %yyy, i8*** nocapture readonly %zzz, i32 %conv6) {
while.body.us.preheader:
- %a2 = load i8**, i8*** %zzz, align 4
- %sub = add nsw i32 %conv6, -1
+ %a2 = load i8**, i8*** %zzz, align 4
+ %sub = add nsw i32 %conv6, -1
br label %while.body.us
while.body.us: ; preds = %while.body.us.preheader, %if.then.us
diff --git a/polly/test/Simplify/dead_access_phi.ll b/polly/test/Simplify/dead_access_phi.ll
index 10fd3179ffdec..9b6726fed5d24 100644
--- a/polly/test/Simplify/dead_access_phi.ll
+++ b/polly/test/Simplify/dead_access_phi.ll
@@ -7,7 +7,7 @@
; for (int j = 0; j < n; j += 1) {
; body:
; double phi = 42;
-;
+;
; body_succ:
; A[0] = 42.0;
; }
@@ -23,7 +23,7 @@ for:
body:
br label %body_succ
-
+
body_succ:
%phi = phi double [42.0, %body]
store double 42.0, double* %A
diff --git a/polly/test/Simplify/dead_access_value.ll b/polly/test/Simplify/dead_access_value.ll
index b95c3843f5b1c..bd36009222b56 100644
--- a/polly/test/Simplify/dead_access_value.ll
+++ b/polly/test/Simplify/dead_access_value.ll
@@ -7,7 +7,7 @@
; for (int j = 0; j < n; j += 1) {
; body:
; double val = 12.5 + 12.5;
-;
+;
; body_succ:
; double unused = val + 21.0;
; A[0] = 42.0;
@@ -25,7 +25,7 @@ for:
body:
%val = fadd double 12.5, 12.5
br label %body_succ
-
+
body_succ:
%unused = fadd double %val, 21.0
store double 42.0, double* %A
diff --git a/polly/test/Simplify/overwritten.ll b/polly/test/Simplify/overwritten.ll
index 8e82d3348eeb1..b8a4b724229b9 100644
--- a/polly/test/Simplify/overwritten.ll
+++ b/polly/test/Simplify/overwritten.ll
@@ -1,5 +1,5 @@
-; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-simplify -analyze < %s | FileCheck -match-full-lines %s
-; RUN: opt %loadPolly -polly-stmt-granularity=bb "-passes=scop(print<polly-simplify>)" -disable-output -aa-pipeline=basic-aa < %s | FileCheck -match-full-lines %s
+; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-simplify -analyze < %s | FileCheck -match-full-lines %s
+; RUN: opt %loadPolly -polly-stmt-granularity=bb "-passes=scop(print<polly-simplify>)" -disable-output -aa-pipeline=basic-aa < %s | FileCheck -match-full-lines %s
;
; Remove a store that is overwritten by another store in the same statement.
;
diff --git a/polly/test/Simplify/overwritten_3store.ll b/polly/test/Simplify/overwritten_3store.ll
index c1a146be1c054..b5983fc253164 100644
--- a/polly/test/Simplify/overwritten_3store.ll
+++ b/polly/test/Simplify/overwritten_3store.ll
@@ -1,5 +1,5 @@
-; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-simplify -analyze < %s | FileCheck -match-full-lines %s
-; RUN: opt %loadPolly -polly-stmt-granularity=bb "-passes=scop(print<polly-simplify>)" -disable-output -aa-pipeline=basic-aa < %s | FileCheck -match-full-lines %s
+; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-simplify -analyze < %s | FileCheck -match-full-lines %s
+; RUN: opt %loadPolly -polly-stmt-granularity=bb "-passes=scop(print<polly-simplify>)" -disable-output -aa-pipeline=basic-aa < %s | FileCheck -match-full-lines %s
;
; Remove a store that is overwritten by another store in the same statement.
; Check that even multiple stores are removed.
diff --git a/polly/test/Simplify/overwritten_loadbetween.ll b/polly/test/Simplify/overwritten_loadbetween.ll
index eb74910e2e98f..8430e8778bb1e 100644
--- a/polly/test/Simplify/overwritten_loadbetween.ll
+++ b/polly/test/Simplify/overwritten_loadbetween.ll
@@ -1,5 +1,5 @@
-; RUN: opt %loadPolly -polly-simplify -analyze < %s | FileCheck -match-full-lines %s
-; RUN: opt %loadPolly "-passes=scop(print<polly-simplify>)" -disable-output -aa-pipeline=basic-aa < %s | FileCheck -match-full-lines %s
+; RUN: opt %loadPolly -polly-simplify -analyze < %s | FileCheck -match-full-lines %s
+; RUN: opt %loadPolly "-passes=scop(print<polly-simplify>)" -disable-output -aa-pipeline=basic-aa < %s | FileCheck -match-full-lines %s
;
; Do not remove overwrites when the value is read before.
;
More information about the llvm-commits
mailing list