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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
/* { dg-options "-O3 -fdump-tree-lversion-details" } */
/* { dg-require-effective-target size32plus } */
/* The simplest IV case. */
void
f1 (double *x, int stepx, int n)
{
for (int i = 0; i < n; ++i)
x[stepx * i] = 100;
}
void
f2 (double *x, int stepx, int limit)
{
for (int i = 0; i < limit; i += stepx)
x[i] = 100;
}
void
f3 (double *x, int stepx, int limit)
{
for (double *y = x; y < x + limit; y += stepx)
*y = 100;
}
void
f4 (double *x, int stepx, unsigned int n)
{
for (unsigned int i = 0; i < n; ++i)
x[stepx * i] = 100;
}
void
f5 (double *x, int stepx, unsigned int limit)
{
for (unsigned int i = 0; i < limit; i += stepx)
x[i] = 100;
}
void
f6 (double *x, int stepx, unsigned int limit)
{
for (double *y = x; y < x + limit; y += stepx)
*y = 100;
}
#if __SIZEOF_SIZE_T__ < 4
double x[1000];
#else
double x[10000];
#endif
void
g1 (int stepx, int n)
{
for (int i = 0; i < n; ++i)
x[stepx * i] = 100;
}
void
g2 (int stepx, int limit)
{
for (int i = 0; i < limit; i += stepx)
x[i] = 100;
}
void
g3 (int stepx, int limit)
{
for (double *y = x; y < x + limit; y += stepx)
*y = 100;
}
void
g4 (int stepx, unsigned int n)
{
for (unsigned int i = 0; i < n; ++i)
x[stepx * i] = 100;
}
void
g5 (int stepx, unsigned int limit)
{
for (unsigned int i = 0; i < limit; i += stepx)
x[i] = 100;
}
void
g6 (int stepx, unsigned int limit)
{
for (double *y = x; y < x + limit; y += stepx)
*y = 100;
}
/* { dg-final { scan-tree-dump-times {want to version containing loop} 12 "lversion" } } */
/* { dg-final { scan-tree-dump-times {versioned this loop} 12 "lversion" } } */
|
