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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 16
int result[N] = {8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38};
__attribute__ ((noinline)) int main1 (int X)
{
int arr[N];
int k = 3;
int m, i=0;
/* Vectorization of induction with non-constant step X. */
do {
m = k + 5;
arr[i] = m;
k = k + X;
i++;
} while (i < N);
/* check results: */
for (i = 0; i < N; i++)
{
if (arr[i] != result[i])
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 (2);
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
