OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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

Browse Source 
* 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
This commit is contained in:
Ira Rosen 2011-01-23 08:20:22 +00:00 committed by Ira Rosen
parent b3237aa952
commit aeb4e803dc
4 changed files with 17 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
gcc/testsuite/ChangeLog
View File

@ -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> 2011-01-22 Jan Hubicka <jh@suse.cz>
PR lto/47333 PR lto/47333

9
gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-33.c
View File

@ -4,7 +4,7 @@
#include <stdarg.h> #include <stdarg.h>
#include "../../tree-vect.h" #include "../../tree-vect.h"
#define N 17 #define N 16
struct test { struct test {
char ca[N]; char ca[N];
}; };
@ -35,6 +35,9 @@ int main (void)
return main1 (); return main1 ();
} }
/* { dg-final { scan-tree-dump-times "vectorization not profitable" 0 "vect" } } */ /* Peeling to align the store is used. Overhead of peeling is too high. */
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */ /* { 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" } } */ /* { dg-final { cleanup-tree-dump "vect" } } */

2
gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76a.c
View File

@ -3,7 +3,7 @@
#include <stdarg.h> #include <stdarg.h>
#include "../../tree-vect.h" #include "../../tree-vect.h"
#define N 8 #define N 16
#define OFF 4 #define OFF 4
/* Check handling of accesses for which the "initial condition" - /* Check handling of accesses for which the "initial condition" -

2
gcc/testsuite/gcc.dg/vect/costmodel/spu/costmodel-vect-76c.c
View File

@ -3,7 +3,7 @@
#include <stdarg.h> #include <stdarg.h>
#include "../../tree-vect.h" #include "../../tree-vect.h"
#define N 8 #define N 32
#define OFF 4 #define OFF 4
/* Check handling of accesses for which the "initial condition" - /* Check handling of accesses for which the "initial condition" -