1 /* { dg-require-effective-target vect_int } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 8
7
8 char 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};
9
10 __attribute__ ((noinline)) int
main1()11 main1 ()
12 {
13 int i;
14 int out[N*8];
15
16 for (i = 0; i < N*4; i++)
17 {
18 out[i*2] = (int) in[i*2] + 1;
19 out[i*2 + 1] = (int) in[i*2 + 1] + 2;
20 }
21
22 /* check results: */
23 for (i = 0; i < N*4; i++)
24 {
25 if (out[i*2] != (int) in[i*2] + 1
26 || out[i*2 + 1] != (int) in[i*2 + 1] + 2)
27 abort ();
28 }
29
30 return 0;
31 }
32
main(void)33 int main (void)
34 {
35 check_vect ();
36
37 main1 ();
38
39 return 0;
40 }
41
42 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_unpack } } } */
43 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_unpack } } } */
44
45