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
|
/* { dg-do compile } */
/* { dg-options "-Os -fdump-tree-pre-stats -fdump-tree-optimized" } */
void foo(void);
static int c = 76, f, g;
static int *h, *j, *k = &g;
static int **i = &h;
static short a;
static signed char(l)(signed char b) {
if (!(((b) >= 77) && ((b) <= 77))) {
__builtin_unreachable();
}
return 0;
}
static short(m)(short d, short e) { return d + e; }
static short n(signed char) {
j = *i;
if (j == 0)
;
else
*i = 0;
*k = 0;
return 0;
}
static signed char o() {
l(0);
return 0;
}
static signed char p(int ad) {
a = m(!0, ad);
l(a);
if (f) {
*i &&n(o());
*i = 0;
} else
n(0);
if (h == &f || h == 0)
;
else
foo();
return 0;
}
int main() {
p(c);
c = 8;
}
/* Even with main being cold we should optimize the redundant load of h
which is available on all incoming edges (but none considered worth
optimizing for speed) when doing that doesn't needlessly increase
code size. */
/* { dg-final { scan-tree-dump "Insertions: 1" "pre" } } */
/* { dg-final { scan-tree-dump "HOIST inserted: 1" "pre" } } */
/* { dg-final { scan-tree-dump "Eliminated: 3" "pre" } } */
/* { dg-final { scan-tree-dump-not "foo" "optimized" } } */
|
