* 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.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@169142 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index 1e67126..c4cc1e0 100644 (file)
--- 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 3e0db3d..11036b0 100644 (file)
--- 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 41fe3ae..124493b 100644 (file)
--- 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 573d8aa..b42934c 100644 (file)
--- 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" -