blob: 82e77d0542915391a3a52c33b22d82075ec9313c [file] [log] [blame]
/* This testcase is part of GDB, the GNU debugger.
Copyright 2003-2021 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/>. */
struct A
{
virtual ~A ();
int a1;
};
A::~A()
{
a1 = 800;
}
struct B : public A
{
virtual ~B ();
int b1;
int b2;
};
B::~B()
{
a1 = 900;
b1 = 901;
b2 = 902;
}
struct C : public B
{
A *c1;
A *c2;
};
/* Use a typedef for the baseclass, with a virtual method, to exercise
gnu-v3-abi.c:gnuv3_dynamic_class recursion. It's important that the
class itself have no name to make sure the typedef makes it through
to the recursive call. */
typedef class {
public:
/* This class has no members as gcc 4.9.x doesn't emit the debug info
for them. */
virtual int get () { return 42; }
} Dbase;
class D : public Dbase
{
public:
int d1;
};
// Stop the compiler from optimizing away data.
void refer (A *)
{
;
}
struct empty {};
// Stop the compiler from optimizing away data.
void refer (empty *)
{
;
}
int main (void)
{
A alpha, *aap, *abp, *acp;
B beta, *bbp;
C gamma;
D delta;
empty e;
A &aref (alpha);
alpha.a1 = 100;
beta.a1 = 200; beta.b1 = 201; beta.b2 = 202;
gamma.c1 = 0; gamma.c2 = (A *) ~0UL;
delta.d1 = 400;
aap = &alpha; refer (aap);
abp = &beta; refer (abp);
bbp = &beta; refer (bbp);
acp = &gamma; refer (acp);
refer (&e);
return 0; // marker return 0
} // marker close brace