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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
|
// gdb_index_test.cc -- a test case for the --gdb-index option.
// Copyright (C) 2012-2020 Free Software Foundation, Inc.
// Written by Cary Coutant <ccoutant@google.com>.
// This file is part of gold.
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
// MA 02110-1301, USA.
// This source file defines a number of symbols of different forms
// to exercise the DWARF scanner in gold.
namespace
{
int c1_count;
int c2_count;
};
namespace one
{
enum G
{
G_A,
G_B,
G_C
};
class c1
{
public:
static int count;
c1()
{ ++c1_count; }
~c1()
{
--c1_count;
}
enum E
{
E_A,
E_B,
E_C,
};
int
val()
{ return E_A; }
};
c1 c1v;
};
namespace two
{
const int ci = 3;
template <typename T>
class c2
{
public:
c2(T t)
: t_(t)
{
++c2_count;
}
~c2()
{ --c2_count; }
T
val()
{ return this->t_; }
T t_;
};
c2<int> c2v1(1);
c2<double> c2v2(2.0);
c2<int const*> c2v3(&ci);
};
enum F
{
F_A,
F_B,
F_C
};
template <class C>
bool
check(C* c)
{ return c->val() == 0; }
bool
check_enum(int i)
{ return i > 0; }
struct anonymous_union_container {
union {
struct astruct {
int a;
};
int b;
} u;
};
anonymous_union_container anonymous_union_var;
#ifdef __GNUC__
#define ALWAYS_INLINE __attribute__((always_inline))
#else
#define ALWAYS_INLINE
#endif
static inline ALWAYS_INLINE int
inline_func_1(int i)
{ return i * 17; }
int
main()
{
F f = F_A;
one::G g = one::G_A;
check_enum(f);
check_enum(g);
check(&one::c1v);
check(&two::c2v1);
check(&two::c2v2);
check(&two::c2v3);
anonymous_union_var.u.b = inline_func_1(3) - 51;
return anonymous_union_var.u.b;
}
|
