blob: c344d48e9198e6774be1dec3e6ce6bbb63fb77c4 (
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
|
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-dom2" } */
extern void abort (void);
union tree_node;
typedef union tree_node *tree;
struct tree_vec
{
int length;
tree a[1];
};
struct tree_type
{
tree binfo;
};
union tree_node
{
struct tree_type type;
struct tree_vec vec;
};
void
record_component_aliases (type)
tree type;
{
if (type->type.binfo->vec.length)
abort ();
for (; ((
{
const tree __z = type->type.binfo;
if (type->type.binfo->vec.length)
abort ();
type->type.binfo->vec.a[4];}
)->vec.length);)
{
if (4 >= type->type.binfo->vec.length)
abort ();
blah ();
}
}
/* The call to blah should have been eliminated. If the call is not
eliminated, then dominator optimizations failed and it'll be
impossible to delete other unnecessary code. */
/* { dg-final { scan-tree-dump-not "blah \\(\\)" "dom2" } } */
/* There should be two IF conditionals. */
/* { dg-final { scan-tree-dump-times "if " 2 "dom2"} } */
/* There should be a single load of type.binfo. */
/* { dg-final { scan-tree-dump-times "type\\.binfo" 1 "dom2"} } */
/* There should be two loads of vec.length. */
/* { dg-final { scan-tree-dump-times "vec.length" 2 "dom2"} } */
/* { dg-final { cleanup-tree-dump "dom2" } } */
|
