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
71
72
73
74
|
/* { dg-options "-O3 -fdump-tree-lversion-details" } */
/* { dg-require-effective-target size20plus } */
/* Versioning for step == 1 in these loops would allow loop interchange,
but otherwise isn't worthwhile. At the moment we decide not to version. */
void
f1 (double x[][100], int step, int n)
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
x[j * step][i] = 100;
}
void
f2 (double x[][100], int step, int n)
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
x[j][i * step] = 100;
}
void
f3 (double x[][100], int step, int limit)
{
for (int i = 0; i < 100; ++i)
for (int j = 0; j < limit; j += step)
x[j][i] = 100;
}
void
f4 (double x[][100], int step, int limit)
{
for (int i = 0; i < limit; i += step)
for (int j = 0; j < 100; ++j)
x[j][i] = 100;
}
double x[100][100];
void
g1 (int step, int n)
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
x[j * step][i] = 100;
}
void
g2 (int step, int n)
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
x[j][i * step] = 100;
}
void
g3 (int step, int limit)
{
for (int i = 0; i < 100; ++i)
for (int j = 0; j < limit; j += step)
x[j][i] = 100;
}
void
g4 (int step, int limit)
{
for (int i = 0; i < limit; i += step)
for (int j = 0; j < 100; ++j)
x[j][i] = 100;
}
/* { dg-final { scan-tree-dump-not {want to version} "lversion" } } */
/* { dg-final { scan-tree-dump-not {versioned} "lversion" } } */
|
