blob: feb776e8373dfd27d4c2590f9315b442d26f0c70 (
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
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-do compile } */
/* { dg-options "-O3 -fdump-tree-lsplit-details" } */
extern const int step;
int ga, gb;
__attribute__((pure)) __attribute__((noinline)) int inc (int i)
{
return i + step;
}
extern int do_something (void);
void test1 (int n)
{
int i;
for (i = 0; i < n; i = inc (i))
{
if (ga)
ga = do_something ();
}
}
void test2 (int n, int p)
{
int i;
int v;
for (i = 0; i < n ; i = inc (i))
{
if (ga)
{
v = inc (2);
gb += 1;
}
else
{
v = p * p;
gb *= 3;
}
if (v < 10)
ga = do_something ();
}
}
void test3 (int n, int p)
{
int i;
int c = p + 1;
int v;
for (i = 0; i < n ; i = inc (i))
{
if (c)
{
v = inc (c);
gb += 1;
}
else
{
v = p * p;
gb *= 3;
}
if (v < 10)
c = do_something ();
}
}
void test4 (int n, int p)
{
int i;
int v;
for (i = 0; i < n ; i = inc (i))
{
if (ga)
{
v = inc (2);
if (gb > 16)
v = inc (5);
}
else
{
v = p * p;
gb += 2;
}
if (v < 10)
ga = do_something ();
}
}
/* { dg-final { scan-tree-dump-times "loop split on semi-invariant condition at false branch" 3 "lsplit" } } */
|
