|
111
|
1 /* { dg-require-effective-target vect_int } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 16
|
|
|
7
|
|
|
8 __attribute__ ((noinline))
|
|
|
9 int main1 ()
|
|
|
10 {
|
|
|
11 int i,j;
|
|
|
12 int ia[N];
|
|
|
13
|
|
|
14 /* Induction. */
|
|
|
15 for (j=0,i=N; j<N,i>0; i--,j++) {
|
|
|
16 ia[j] = i;
|
|
|
17 }
|
|
|
18
|
|
|
19 /* check results: */
|
|
|
20 for (j=0,i=N; j<N,i>0; i--,j++) {
|
|
|
21 if (ia[j] != i)
|
|
|
22 abort ();
|
|
|
23 }
|
|
|
24
|
|
|
25 return 0;
|
|
|
26 }
|
|
|
27
|
|
|
28 int main (void)
|
|
|
29 {
|
|
|
30 check_vect();
|
|
|
31
|
|
|
32 return main1 ();
|
|
|
33 }
|
|
|
34
|
|
|
35 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
|
