blob: 96d3fbf525be7a5d42614ef027dc80a5255eda60 (
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
45
46
47
48
49
|
/* { dg-require-effective-target vect_int_mult } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 16
__attribute__ ((noinline)) int main1 (int X)
{
int arr1[N+1];
int arr2[N+1];
int k = X;
int m, i=0;
/* Vectorization of induction with non-constant initial condition X.
Also we have here two uses of the induction-variable k as defined
by the loop-header phi (as opposed to the other uses of k that are
defined in the loop), in which case we exercise the fact that we
reuse the same vector def-use-cycle for both uses.
Peeling to align the store is also applied. This peeling also aligns
the load (as they have the same misalignment). */
do {
arr2[i+1] = 2*k;
k = k + 2;
arr1[i+1] = k;
k = k + 4;
i++;
} while (i < N);
/* check results: */
for (i = 0; i < N; i++)
{
if (arr1[i+1] != X+6*i+2
|| arr2[i+1] != 2*(X+6*i))
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
return main1 (3);
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
