From: Ira Rosen <irar@il.ibm.com>
Date: Sun, 23 Jan 2011 08:20:22 +0000 (+0000)
Subject: costmodel-vect-33.c: Expect vectorization to be not profitable if...
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=aeb4e803dcbace03e94dca97764203c263e9aa38;p=gcc.git

costmodel-vect-33.c: Expect vectorization to be not profitable if...


        * gcc.dg/vect/costmodel/spu/costmodel-vect-33.c: Expect
        vectorization to be not profitable if peeling is used
        to realign the memory access.
        * gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c:
        Increase loop bound to avoid loop unrolling.
        * gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c:
        Likewise.

From-SVN: r169142
---

diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index 1e67126dee7..c4cc1e08927 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,12 @@
+2011-01-23  Ira Rosen  <irar@il.ibm.com>
+
+	* gcc.dg/vect/costmodel/spu/costmodel-vect-33.c: Expect
+	vectorization to be not profitable if peeling is used to
+	realign the memory access.
+	* gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c: Increase
+	loop bound to avoid loop unrolling.
+	* gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c: Likewise.
+
 2011-01-22  Jan Hubicka  <jh@suse.cz>
 
 	PR lto/47333
diff --git a/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-33.c b/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-33.c
index 3e0db3d84d7..11036b0bced 100644
--- a/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-33.c
+++ b/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-33.c
@@ -4,7 +4,7 @@
 #include <stdarg.h>
 #include "../../tree-vect.h"
 
-#define N 17
+#define N 16
 struct test {
   char ca[N];
 };
@@ -35,6 +35,9 @@ int main (void)
   return main1 ();
 } 
 
-/* { dg-final { scan-tree-dump-times "vectorization not profitable" 0 "vect" } } */
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
+/* Peeling to align the store is used. Overhead of peeling is too high.  */
+/* { dg-final { scan-tree-dump-times "vectorization not profitable" 1 "vect" { target vector_alignment_reachable } } } */
+
+/* Versioning to align the store is used. Overhead of versioning is not too high.  */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target {! vector_alignment_reachable} } } } */
 /* { dg-final { cleanup-tree-dump "vect" } } */
diff --git a/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c b/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c
index 41fe3aebf90..124493b0321 100644
--- a/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c
+++ b/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c
@@ -3,7 +3,7 @@
 #include <stdarg.h>
 #include "../../tree-vect.h"
 
-#define N 8
+#define N 16
 #define OFF 4
 
 /* Check handling of accesses for which the "initial condition" -
diff --git a/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c b/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c
index 573d8aacdd4..b42934c68f5 100644
--- a/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c
+++ b/gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c
@@ -3,7 +3,7 @@
 #include <stdarg.h>
 #include "../../tree-vect.h"
 
-#define N 8
+#define N 32
 #define OFF 4
 
 /* Check handling of accesses for which the "initial condition" -