|
111
|
1 /* { dg-require-effective-target vect_int } */
|
|
|
2
|
|
|
3 #include <stdarg.h>
|
|
|
4 #include "tree-vect.h"
|
|
|
5
|
|
|
6 #define N 40
|
|
|
7
|
|
|
8 int a[N];
|
|
|
9
|
|
|
10 __attribute__ ((noinline)) int
|
|
|
11 foo (int * __restrict__ b, int k){
|
|
|
12 int i,j;
|
|
|
13 int sum,x;
|
|
|
14
|
|
|
15 for (i = 0; i < N; i++) {
|
|
|
16 sum = b[i];
|
|
|
17 for (j = 0; j < N; j++) {
|
|
|
18 sum += j;
|
|
|
19 }
|
|
|
20 a[i] = sum;
|
|
|
21 }
|
|
|
22
|
|
|
23 return a[k];
|
|
|
24 }
|
|
|
25
|
|
|
26 int main (void)
|
|
|
27 {
|
|
|
28 int i,j;
|
|
|
29 int sum;
|
|
|
30 int b[N];
|
|
|
31 int a[N];
|
|
|
32
|
|
|
33 check_vect ();
|
|
|
34
|
|
|
35 for (i=0; i<N; i++)
|
|
|
36 b[i] = i + 2;
|
|
|
37
|
|
|
38 for (i=0; i<N; i++)
|
|
|
39 a[i] = foo (b,i);
|
|
|
40
|
|
|
41 /* check results: */
|
|
|
42 for (i=0; i<N; i++)
|
|
|
43 {
|
|
|
44 sum = b[i];
|
|
|
45 for (j = 0; j < N; j++){
|
|
|
46 sum += j;
|
|
|
47 }
|
|
|
48 if (a[i] != sum)
|
|
|
49 abort();
|
|
|
50 }
|
|
|
51
|
|
|
52 return 0;
|
|
|
53 }
|
|
|
54
|
|
|
55 /* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED." 1 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
|
