1 /* { dg-require-effective-target vect_int } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 8
7
8 short 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; i++)
17 {
18 out[i*8] = (short) in[i*8] + 1;
19 out[i*8 + 1] = (short) in[i*8 + 1] + 2;
20 out[i*8 + 2] = (short) in[i*8 + 2] + 3;
21 out[i*8 + 3] = (short) in[i*8 + 3] + 4;
22 out[i*8 + 4] = (short) in[i*8 + 4] + 5;
23 out[i*8 + 5] = (short) in[i*8 + 5] + 6;
24 out[i*8 + 6] = (short) in[i*8 + 6] + 7;
25 out[i*8 + 7] = (short) in[i*8 + 7] + 8;
26 }
27
28 /* check results: */
29 for (i = 0; i < N; i++)
30 {
31 if (out[i*8] != (short) in[i*8] + 1
32 || out[i*8 + 1] != (short) in[i*8 + 1] + 2
33 || out[i*8 + 2] != (short) in[i*8 + 2] + 3
34 || out[i*8 + 3] != (short) in[i*8 + 3] + 4
35 || out[i*8 + 4] != (short) in[i*8 + 4] + 5
36 || out[i*8 + 5] != (short) in[i*8 + 5] + 6
37 || out[i*8 + 6] != (short) in[i*8 + 6] + 7
38 || out[i*8 + 7] != (short) in[i*8 + 7] + 8)
39 abort ();
40 }
41
42 return 0;
43 }
44
main(void)45 int main (void)
46 {
47 check_vect ();
48
49 main1 ();
50
51 return 0;
52 }
53
54 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_pack_trunc } } } */
55 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_pack_trunc } } } */
56
57