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
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 2013-2016 Free Software Foundation, Inc.
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, see <http://www.gnu.org/licenses/>. */
#ifdef DEBUG
#include <stdio.h>
#endif
template <typename T>
class A
{
public:
T i;
T z;
A () : i (1), z (10) {}
};
template <typename T>
class B : public virtual A<T>
{
public:
T i;
T common;
B () : i (2), common (200) {}
};
typedef B<int> Bint;
class C : public virtual A<int>
{
public:
int i;
int c;
int common;
C () : i (3), c (30), common (300) {}
};
class BB : public A<int>
{
public:
int i;
BB () : i (20) {}
};
class CC : public A<int>
{
public:
int i;
CC () : i (30) {}
};
class Ambig : public BB, public CC
{
public:
int i;
Ambig () : i (1000) {}
};
class D : public Bint, public C
{
public:
int i;
int x;
Ambig am;
D () : i (4), x (40) {}
#ifdef DEBUG
#define SUM(X) \
do \
{ \
sum += (X); \
printf ("" #X " = %d\n", (X)); \
} \
while (0)
#else
#define SUM(X) sum += (X)
#endif
int
f (void)
{
int sum = 0;
SUM (i);
SUM (D::i);
SUM (D::B<int>::i);
SUM (B<int>::i);
SUM (D::C::i);
SUM (C::i);
SUM (D::B<int>::A<int>::i);
SUM (B<int>::A<int>::i);
SUM (A<int>::i);
SUM (D::C::A<int>::i);
SUM (C::A<int>::i);
SUM (D::x);
SUM (x);
SUM (D::C::c);
SUM (C::c);
SUM (c);
SUM (D::A<int>::i);
SUM (Bint::i);
//SUM (D::Bint::i);
//SUM (D::Bint::A<int>::i);
SUM (Bint::A<int>::i);
// ambiguous: SUM (common);
SUM (B<int>::common);
SUM (C::common);
SUM (am.i);
// ambiguous: SUM (am.A<int>::i);
return sum;
}
};
int
main (void)
{
Bint b;
D d;
return d.f () + b.i;
}
|
