blob: e6130bbe7bdf96f9fe7af125fcdc9c80f11d9fd9 (
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
|
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-pre-stats -fdump-tree-fre" } */
#include <stddef.h>
union tree_node;
typedef union tree_node *tree;
struct tree_common
{
tree chain;
};
struct tree_list
{
struct tree_common common;
tree value;
};
union tree_node
{
struct tree_common common;
struct tree_list list;
};
extern void abort (void) __attribute__((noreturn));
void __attribute__((noinline))
foo (void)
{
abort ();
}
/* There are some reloaded loads of *cell, and cell->common.chain on various
branches. */
void __attribute__((noinline))
remove_useless_vars (tree *unexpanded_var_list, int dump_file)
{
tree var, *cell;
int c = 0;
for (cell = unexpanded_var_list; *cell; )
{
var = (*cell)->list.value;
if (var)
{
if (dump_file)
foo ();
*cell = ((*cell)->common.chain);
continue;
}
cell = &((*cell)->common.chain);
}
}
extern void *malloc (__SIZE_TYPE__) __attribute__ ((malloc));
int
main (void)
{
int i;
tree unexpanded_var_list, last = (tree) 0;
for (i = 0; i < 2; i++)
{
unexpanded_var_list = malloc (sizeof (struct tree_list));
unexpanded_var_list->list.value = (tree) (ptrdiff_t) (i & 1);
unexpanded_var_list->common.chain = last;
last = unexpanded_var_list;
}
remove_useless_vars (&unexpanded_var_list, 0);
return 0;
}
/* { dg-final { scan-tree-dump-not "= unexpanded_var_list;" "fre" } } */
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre" } } */
/* { dg-final { scan-tree-dump-times "Insertions: 2" 1 "pre" } } */
/* { dg-final { cleanup-tree-dump "fre" } } */
/* { dg-final { cleanup-tree-dump "pre" } } */
|
