blob: 108b1bcaaea115ee2189afd557244a0be682f422 (
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
|
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-forwprop1 -fno-short-enums" } */
union tree_node;
typedef union tree_node *tree;
enum tree_code
{
MAX_TREE_CODES
};
extern unsigned char tree_contains_struct[MAX_TREE_CODES][64];
struct tree_base
{
__extension__ enum tree_code code:16;
unsigned public_flag:1;
};
enum tree_node_structure_enum
{
TS_DECL_WITH_VIS,
};
struct tree_decl_with_vis
{
unsigned comdat_flag:1;
};
union tree_node
{
struct tree_base base;
struct tree_decl_with_vis decl_with_vis;
};
struct varpool_node
{
tree decl;
struct varpool_node *next_needed, *prev_needed;
unsigned externally_visible:1;
};
extern struct varpool_node *varpool_nodes_queue;
struct pointer_set_t;
struct pointer_set_t *pointer_set_create (void);
__inline__ static unsigned char
varpool_externally_visible_p (struct varpool_node *vnode,
unsigned char aliased)
{
struct varpool_node *alias;
if (!(( { __typeof (vnode->decl) const __t = (vnode->decl); __t;})->decl_with_vis.comdat_flag)
&& !((vnode->decl)->base.public_flag))
return 0;
if (aliased)
return 1;
return 0;
}
unsigned int
function_and_variable_visibility (unsigned char whole_program)
{
struct cgraph_node *node;
struct varpool_node *vnode;
struct pointer_set_t *aliased_vnodes = pointer_set_create ();
for (vnode = varpool_nodes_queue; vnode; vnode = vnode->next_needed)
if (varpool_externally_visible_p
(vnode, pointer_set_contains (aliased_vnodes, vnode)))
vnode->externally_visible = 1;
}
/* { dg-final { scan-tree-dump-not "& 255" "forwprop1"} } */
/* { dg-final { cleanup-tree-dump "forwprop1" } } */
|
