slp-11.c: Split into...
gcc/testsuite/ * gcc.dg/vect/slp-11.c: Split into... * gcc.dg/vect/slp-11a.c, gcc.dg/vect/slp-11b.c, gcc.dg/vect/slp-11c.c: ...these tests. * gcc.dg/vect/slp-12a.c: Split 4-stride loop into... * gcc.dg/vect/slp-12c.c: ...this new test. * gcc.dg/vect/slp-19.c: Split into... * gcc.dg/vect/slp-19a.c, gcc.dg/vect/slp-19b.c, gcc.dg/vect/slp-19c.c: ...these new tests. From-SVN: r173294
This commit is contained in:
Richard Sandiford
Richard Sandiford
parent
21a74828cc
commit
f82c640a50
@ -1,3 +1,14 @@
|
||||
2011-05-03 Richard Sandiford <richard.sandiford@linaro.org>
|
||||
|
||||
* gcc.dg/vect/slp-11.c: Split into...
|
||||
* gcc.dg/vect/slp-11a.c, gcc.dg/vect/slp-11b.c,
|
||||
gcc.dg/vect/slp-11c.c: ...these tests.
|
||||
* gcc.dg/vect/slp-12a.c: Split 4-stride loop into...
|
||||
* gcc.dg/vect/slp-12c.c: ...this new test.
|
||||
* gcc.dg/vect/slp-19.c: Split into...
|
||||
* gcc.dg/vect/slp-19a.c, gcc.dg/vect/slp-19b.c,
|
||||
gcc.dg/vect/slp-19c.c: ...these new tests.
|
||||
|
||||
2011-05-03 Richard Sandiford <richard.sandiford@linaro.org>
|
||||
|
||||
* lib/target-supports.exp
|
||||
|
||||
@ -3,7 +3,7 @@
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 8
|
||||
#define N 8
|
||||
|
||||
int
|
||||
main1 ()
|
||||
@ -11,7 +11,6 @@ main1 ()
|
||||
int i;
|
||||
unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
float out2[N*8];
|
||||
|
||||
/* Different operations - not SLPable. */
|
||||
for (i = 0; i < N; i++)
|
||||
@ -35,7 +34,7 @@ main1 ()
|
||||
b7 = a7 * 2;
|
||||
|
||||
out[i*8] = b0 - 2;
|
||||
out[i*8 + 1] = b1 - 3;
|
||||
out[i*8 + 1] = b1 - 3;
|
||||
out[i*8 + 2] = b2 - 2;
|
||||
out[i*8 + 3] = b3 - 1;
|
||||
out[i*8 + 4] = b4 - 8;
|
||||
@ -58,41 +57,6 @@ main1 ()
|
||||
abort ();
|
||||
}
|
||||
|
||||
/* Requires permutation - not SLPable. */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
out[i*4] = (in[i*4] + 2) * 3;
|
||||
out[i*4 + 1] = (in[i*4 + 2] + 2) * 7;
|
||||
out[i*4 + 2] = (in[i*4 + 1] + 7) * 3;
|
||||
out[i*4 + 3] = (in[i*4 + 3] + 3) * 4;
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
if (out[i*4] != (in[i*4] + 2) * 3
|
||||
|| out[i*4 + 1] != (in[i*4 + 2] + 2) * 7
|
||||
|| out[i*4 + 2] != (in[i*4 + 1] + 7) * 3
|
||||
|| out[i*4 + 3] != (in[i*4 + 3] + 3) * 4)
|
||||
abort ();
|
||||
}
|
||||
|
||||
/* Different operations - not SLPable. */
|
||||
for (i = 0; i < N*4; i++)
|
||||
{
|
||||
out2[i*2] = ((float) in[i*2] * 2 + 6) ;
|
||||
out2[i*2 + 1] = (float) (in[i*2 + 1] * 3 + 7);
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*4; i++)
|
||||
{
|
||||
if (out2[i*2] != ((float) in[i*2] * 2 + 6)
|
||||
|| out2[i*2 + 1] != (float) (in[i*2 + 1] * 3 + 7))
|
||||
abort ();
|
||||
}
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@ -105,9 +69,7 @@ int main (void)
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { target { { vect_uintfloat_cvt && vect_strided } && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" { target { { { ! vect_uintfloat_cvt } && vect_strided } && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" {target { ! { vect_int_mult && vect_strided } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided && vect_int_mult } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
49
gcc/testsuite/gcc.dg/vect/slp-11b.c
Normal file
49
gcc/testsuite/gcc.dg/vect/slp-11b.c
Normal file
@ -0,0 +1,49 @@
|
||||
/* { dg-require-effective-target vect_int } */
|
||||
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 8
|
||||
|
||||
int
|
||||
main1 ()
|
||||
{
|
||||
int i;
|
||||
unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
|
||||
/* Requires permutation - not SLPable. */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
out[i*4] = (in[i*4] + 2) * 3;
|
||||
out[i*4 + 1] = (in[i*4 + 2] + 2) * 7;
|
||||
out[i*4 + 2] = (in[i*4 + 1] + 7) * 3;
|
||||
out[i*4 + 3] = (in[i*4 + 3] + 3) * 4;
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
if (out[i*4] != (in[i*4] + 2) * 3
|
||||
|| out[i*4 + 1] != (in[i*4 + 2] + 2) * 7
|
||||
|| out[i*4 + 2] != (in[i*4 + 1] + 7) * 3
|
||||
|| out[i*4 + 3] != (in[i*4 + 3] + 3) * 4)
|
||||
abort ();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main (void)
|
||||
{
|
||||
check_vect ();
|
||||
|
||||
main1 ();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided && vect_int_mult } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
46
gcc/testsuite/gcc.dg/vect/slp-11c.c
Normal file
46
gcc/testsuite/gcc.dg/vect/slp-11c.c
Normal file
@ -0,0 +1,46 @@
|
||||
/* { dg-require-effective-target vect_int } */
|
||||
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 8
|
||||
|
||||
int
|
||||
main1 ()
|
||||
{
|
||||
int i;
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
float out[N*8];
|
||||
|
||||
/* Different operations - not SLPable. */
|
||||
for (i = 0; i < N*4; i++)
|
||||
{
|
||||
out[i*2] = ((float) in[i*2] * 2 + 6) ;
|
||||
out[i*2 + 1] = (float) (in[i*2 + 1] * 3 + 7);
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*4; i++)
|
||||
{
|
||||
if (out[i*2] != ((float) in[i*2] * 2 + 6)
|
||||
|| out[i*2 + 1] != (float) (in[i*2 + 1] * 3 + 7))
|
||||
abort ();
|
||||
}
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main (void)
|
||||
{
|
||||
check_vect ();
|
||||
|
||||
main1 ();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { { vect_uintfloat_cvt && vect_strided } && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { { vect_uintfloat_cvt && vect_strided } && vect_int_mult } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
@ -11,7 +11,7 @@ main1 ()
|
||||
int i;
|
||||
unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
unsigned int ia[N], ib[N*2];
|
||||
unsigned int ia[N];
|
||||
|
||||
for (i = 0; i < N; i++)
|
||||
{
|
||||
@ -61,27 +61,6 @@ main1 ()
|
||||
abort ();
|
||||
}
|
||||
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
out[i*4] = (in[i*4] + 2) * 3;
|
||||
out[i*4 + 1] = (in[i*4 + 1] + 2) * 7;
|
||||
out[i*4 + 2] = (in[i*4 + 2] + 7) * 3;
|
||||
out[i*4 + 3] = (in[i*4 + 3] + 7) * 7;
|
||||
|
||||
ib[i] = 7;
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
if (out[i*4] != (in[i*4] + 2) * 3
|
||||
|| out[i*4 + 1] != (in[i*4 + 1] + 2) * 7
|
||||
|| out[i*4 + 2] != (in[i*4 + 2] + 7) * 3
|
||||
|| out[i*4 + 3] != (in[i*4 + 3] + 7) * 7
|
||||
|| ib[i] != 7)
|
||||
abort ();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@ -94,11 +73,8 @@ int main (void)
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" {target { vect_strided && vect_int_mult} } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" {target { {! {vect_strided}} && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" {target { ! vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" {target { vect_strided && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" {target { {! {vect_strided}} && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" {target { ! vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_strided && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! { vect_strided && vect_int_mult } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { vect_strided && vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! { vect_strided && vect_int_mult } } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
|
||||
53
gcc/testsuite/gcc.dg/vect/slp-12c.c
Normal file
53
gcc/testsuite/gcc.dg/vect/slp-12c.c
Normal file
@ -0,0 +1,53 @@
|
||||
/* { dg-require-effective-target vect_int } */
|
||||
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 8
|
||||
|
||||
int
|
||||
main1 ()
|
||||
{
|
||||
int i;
|
||||
unsigned int out[N*8], a0, a1, a2, a3, a4, a5, a6, a7, b1, b0, b2, b3, b4, b5, b6, b7;
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
unsigned int ia[N*2];
|
||||
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
out[i*4] = (in[i*4] + 2) * 3;
|
||||
out[i*4 + 1] = (in[i*4 + 1] + 2) * 7;
|
||||
out[i*4 + 2] = (in[i*4 + 2] + 7) * 3;
|
||||
out[i*4 + 3] = (in[i*4 + 3] + 7) * 7;
|
||||
|
||||
ia[i] = 7;
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
if (out[i*4] != (in[i*4] + 2) * 3
|
||||
|| out[i*4 + 1] != (in[i*4 + 1] + 2) * 7
|
||||
|| out[i*4 + 2] != (in[i*4 + 2] + 7) * 3
|
||||
|| out[i*4 + 3] != (in[i*4 + 3] + 7) * 7
|
||||
|| ia[i] != 7)
|
||||
abort ();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main (void)
|
||||
{
|
||||
check_vect ();
|
||||
|
||||
main1 ();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_int_mult } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_int_mult } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! vect_int_mult } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
61
gcc/testsuite/gcc.dg/vect/slp-19a.c
Normal file
61
gcc/testsuite/gcc.dg/vect/slp-19a.c
Normal file
@ -0,0 +1,61 @@
|
||||
/* { dg-require-effective-target vect_int } */
|
||||
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 16
|
||||
|
||||
int
|
||||
main1 ()
|
||||
{
|
||||
unsigned int i;
|
||||
unsigned int out[N*8];
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
unsigned int ia[N*2];
|
||||
|
||||
for (i = 0; i < N; i++)
|
||||
{
|
||||
out[i*8] = in[i*8];
|
||||
out[i*8 + 1] = in[i*8 + 1];
|
||||
out[i*8 + 2] = in[i*8 + 2];
|
||||
out[i*8 + 3] = in[i*8 + 3];
|
||||
out[i*8 + 4] = in[i*8 + 4];
|
||||
out[i*8 + 5] = in[i*8 + 5];
|
||||
out[i*8 + 6] = in[i*8 + 6];
|
||||
out[i*8 + 7] = in[i*8 + 7];
|
||||
|
||||
ia[i] = in[i*8 + 2];
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N; i++)
|
||||
{
|
||||
if (out[i*8] != in[i*8]
|
||||
|| out[i*8 + 1] != in[i*8 + 1]
|
||||
|| out[i*8 + 2] != in[i*8 + 2]
|
||||
|| out[i*8 + 3] != in[i*8 + 3]
|
||||
|| out[i*8 + 4] != in[i*8 + 4]
|
||||
|| out[i*8 + 5] != in[i*8 + 5]
|
||||
|| out[i*8 + 6] != in[i*8 + 6]
|
||||
|| out[i*8 + 7] != in[i*8 + 7]
|
||||
|| ia[i] != in[i*8 + 2])
|
||||
abort ();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main (void)
|
||||
{
|
||||
check_vect ();
|
||||
|
||||
main1 ();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_strided } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_strided } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! vect_strided } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
58
gcc/testsuite/gcc.dg/vect/slp-19b.c
Normal file
58
gcc/testsuite/gcc.dg/vect/slp-19b.c
Normal file
@ -0,0 +1,58 @@
|
||||
/* { dg-require-effective-target vect_int } */
|
||||
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 16
|
||||
|
||||
int
|
||||
main1 ()
|
||||
{
|
||||
unsigned int i;
|
||||
unsigned int out[N*8];
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
unsigned int ia[N*2], a0, a1, a2, a3;
|
||||
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
a0 = in[i*4] + 1;
|
||||
a1 = in[i*4 + 1] + 2;
|
||||
a2 = in[i*4 + 2] + 3;
|
||||
a3 = in[i*4 + 3] + 4;
|
||||
|
||||
out[i*4] = a0;
|
||||
out[i*4 + 1] = a1;
|
||||
out[i*4 + 2] = a2;
|
||||
out[i*4 + 3] = a3;
|
||||
|
||||
ia[i] = a2;
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
if (out[i*4] != in[i*4] + 1
|
||||
|| out[i*4 + 1] != in[i*4 + 1] + 2
|
||||
|| out[i*4 + 2] != in[i*4 + 2] + 3
|
||||
|| out[i*4 + 3] != in[i*4 + 3] + 4
|
||||
|| ia[i] != in[i*4 + 2] + 3)
|
||||
abort ();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main (void)
|
||||
{
|
||||
check_vect ();
|
||||
|
||||
main1 ();
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_strided } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_strided } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! vect_strided } } } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
@ -3,7 +3,7 @@
|
||||
#include <stdarg.h>
|
||||
#include "tree-vect.h"
|
||||
|
||||
#define N 16
|
||||
#define N 16
|
||||
|
||||
int
|
||||
main1 ()
|
||||
@ -13,62 +13,7 @@ main1 ()
|
||||
unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
|
||||
unsigned int ia[N*2], a0, a1, a2, a3;
|
||||
|
||||
for (i = 0; i < N; i++)
|
||||
{
|
||||
out[i*8] = in[i*8];
|
||||
out[i*8 + 1] = in[i*8 + 1];
|
||||
out[i*8 + 2] = in[i*8 + 2];
|
||||
out[i*8 + 3] = in[i*8 + 3];
|
||||
out[i*8 + 4] = in[i*8 + 4];
|
||||
out[i*8 + 5] = in[i*8 + 5];
|
||||
out[i*8 + 6] = in[i*8 + 6];
|
||||
out[i*8 + 7] = in[i*8 + 7];
|
||||
|
||||
ia[i] = in[i*8 + 2];
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N; i++)
|
||||
{
|
||||
if (out[i*8] != in[i*8]
|
||||
|| out[i*8 + 1] != in[i*8 + 1]
|
||||
|| out[i*8 + 2] != in[i*8 + 2]
|
||||
|| out[i*8 + 3] != in[i*8 + 3]
|
||||
|| out[i*8 + 4] != in[i*8 + 4]
|
||||
|| out[i*8 + 5] != in[i*8 + 5]
|
||||
|| out[i*8 + 6] != in[i*8 + 6]
|
||||
|| out[i*8 + 7] != in[i*8 + 7]
|
||||
|| ia[i] != in[i*8 + 2])
|
||||
abort ();
|
||||
}
|
||||
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
a0 = in[i*4] + 1;
|
||||
a1 = in[i*4 + 1] + 2;
|
||||
a2 = in[i*4 + 2] + 3;
|
||||
a3 = in[i*4 + 3] + 4;
|
||||
|
||||
out[i*4] = a0;
|
||||
out[i*4 + 1] = a1;
|
||||
out[i*4 + 2] = a2;
|
||||
out[i*4 + 3] = a3;
|
||||
|
||||
ia[i] = a2;
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N*2; i++)
|
||||
{
|
||||
if (out[i*4] != in[i*4] + 1
|
||||
|| out[i*4 + 1] != in[i*4 + 1] + 2
|
||||
|| out[i*4 + 2] != in[i*4 + 2] + 3
|
||||
|| out[i*4 + 3] != in[i*4 + 3] + 4
|
||||
|| ia[i] != in[i*4 + 2] + 3)
|
||||
abort ();
|
||||
}
|
||||
|
||||
/* The last stmt requires interleaving of not power of 2 size - not
|
||||
/* The last stmt requires interleaving of not power of 2 size - not
|
||||
vectorizable. */
|
||||
for (i = 0; i < N/2; i++)
|
||||
{
|
||||
@ -116,10 +61,10 @@ main1 ()
|
||||
out[i*6 + 3] = in[i*6 + 3];
|
||||
out[i*6 + 4] = in[i*6 + 4];
|
||||
out[i*6 + 5] = in[i*6 + 5];
|
||||
|
||||
|
||||
ia[i] = i;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/* check results: */
|
||||
for (i = 0; i < N/2; i++)
|
||||
{
|
||||
@ -133,7 +78,6 @@ main1 ()
|
||||
abort ();
|
||||
}
|
||||
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@ -146,9 +90,6 @@ int main (void)
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { target vect_strided } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { ! { vect_strided } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" { target vect_strided } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { ! { vect_strided } } } } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
||||
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" } } */
|
||||
/* { dg-final { cleanup-tree-dump "vect" } } */
|
||||
|
||||
Loading…
Reference in New Issue
Block a user