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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/* { dg-do compile } */
/* { dg-require-effective-target vect_int } */
/* The GCC vectorizer generates loop versioning for the following loop
since there may exist aliasing between A and B. The predicate checks
if A may alias with B across all iterations. Then for the loop in
the true body, we can assert that *B is a loop invariant so that
we can hoist the load of *B before the loop body. */
void test1 (int* a, int* b)
{
int i;
for (i = 0; i < 100000; ++i)
a[i] = *b + 1;
}
/* A test case with nested loops. The load of b[j+1] in the inner
loop should be hoisted. */
void test2 (int* a, int* b)
{
int i, j;
for (j = 0; j < 100000; ++j)
for (i = 0; i < 100000; ++i)
a[i] = b[j+1] + 1;
}
/* A test case with ifcvt transformation. */
void test3 (int* a, int* b)
{
int i, t;
for (i = 0; i < 10000; ++i)
{
if (*b > 0)
t = *b * 2;
else
t = *b / 2;
a[i] = t;
}
}
/* A test case in which the store in the loop can be moved outside
in the versioned loop with alias checks. Note this loop won't
be vectorized. */
void test4 (int* a, int* b)
{
int i;
for (i = 0; i < 100000; ++i)
*a += b[i];
}
/* A test case in which the load and store in the loop to b
can be moved outside in the versioned loop with alias checks.
Note this loop won't be vectorized. */
void test5 (int* a, int* b)
{
int i;
for (i = 0; i < 100000; ++i)
{
*b += a[i];
a[i] = *b;
}
}
/* { dg-final { scan-tree-dump-times "hoist" 8 "vect" { xfail *-*-* } } } */
/* { dg-final { scan-tree-dump-times "hoist" 3 "vect" { xfail { vect_no_align && { ! vect_hw_misalign } } } } } */
|
