/* { 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_strided4 } } } */ | |
/* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_strided4 } } } } */ | |
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_strided4 } } } */ | |
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! vect_strided4 } } } } */ |