2018-01-16 Richard Biener <rguenther@suse.de>
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / slp-19b.c
blob237b36dd227186c8f0cb78b703351fdae6fef27c
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 16
8 int
9 main1 ()
11 unsigned int i;
12 unsigned int out[N*8];
13 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};
14 unsigned int ia[N*2], a0, a1, a2, a3;
16 for (i = 0; i < N*2; i++)
18 a0 = in[i*4] + 1;
19 a1 = in[i*4 + 1] + 2;
20 a2 = in[i*4 + 2] + 3;
21 a3 = in[i*4 + 3] + 4;
23 out[i*4] = a0;
24 out[i*4 + 1] = a1;
25 out[i*4 + 2] = a2;
26 out[i*4 + 3] = a3;
28 ia[i] = a2;
31 /* check results: */
32 for (i = 0; i < N*2; i++)
34 if (out[i*4] != in[i*4] + 1
35 || out[i*4 + 1] != in[i*4 + 1] + 2
36 || out[i*4 + 2] != in[i*4 + 2] + 3
37 || out[i*4 + 3] != in[i*4 + 3] + 4
38 || ia[i] != in[i*4 + 2] + 3)
39 abort ();
42 return 0;
45 int main (void)
47 check_vect ();
49 main1 ();
51 return 0;
54 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided4 } } } */
55 /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { target { ! vect_strided4 } } } } */
56 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_strided4 } } } */
57 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" { target { ! vect_strided4 } } } } */