blob: fac303a679bda2469949f088dd32245952f83c65 (
plain)
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 16
__attribute__ ((noinline)) int main1 ()
{
int arr1[N];
int arr2[N];
int k = 0;
int m = 3, i = 0;
/* vectorization of induction.
Peeling to align the store is also applied. */
do {
k = k + 2;
arr1[i] = k;
m = k + 3;
arr2[i] = m;
i++;
} while (i < N);
/* check results: */
for (i = 0; i < N; i++)
{
if (arr1[i] != 2+2*i || arr2[i] != 5 + 2*i)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
