blob: f038f798e21228e5b496c9705f4d482bd1fcd380 [file] [log] [blame]
Howard Hinnant372e2f42012-01-31 23:52:20 +00001//===---------------------- catch_class_03.cpp ----------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is dual licensed under the MIT and the University of Illinois Open
6// Source Licenses. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10/*
11 This test checks that adjustedPtr is correct as there exist offsets in this
12 object for the various subobjects, all of which have a unique id_ to
13 check against.
14*/
15
Asiri Rathnayake57e446d2016-05-31 12:01:32 +000016// UNSUPPORTED: libcxxabi-no-exceptions
17
Howard Hinnant372e2f42012-01-31 23:52:20 +000018#include <exception>
19#include <stdlib.h>
20#include <assert.h>
21
22struct B
23{
24 static int count;
25 int id_;
26 explicit B(int id) : id_(id) {count++;}
27 B(const B& a) : id_(a.id_) {count++;}
28 ~B() {count--;}
29};
30
31int B::count = 0;
32
33struct C1
34 : B
35{
36 static int count;
37 int id_;
38 explicit C1(int id) : B(id-2), id_(id) {count++;}
39 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;}
40 ~C1() {count--;}
41};
42
43int C1::count = 0;
44
45struct C2
46 : B
47{
48 static int count;
49 int id_;
50 explicit C2(int id) : B(id-2), id_(id) {count++;}
51 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;}
52 ~C2() {count--;}
53};
54
55int C2::count = 0;
56
57struct A
58 : C1, C2
59{
60 static int count;
61 int id_;
62 explicit A(int id) : C1(id-1), C2(id-2), id_(id) {count++;}
63 A(const A& a) : C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;}
64 ~A() {count--;}
65};
66
67int A::count = 0;
68
69void f1()
70{
71 assert(A::count == 0);
72 assert(C1::count == 0);
73 assert(C2::count == 0);
74 assert(B::count == 0);
75 A a(5);
76 assert(A::count == 1);
77 assert(C1::count == 1);
78 assert(C2::count == 1);
79 assert(B::count == 2);
80
81 assert(a.id_ == 5);
82 assert(static_cast<C1&>(a).id_ == 4);
83 assert(static_cast<C2&>(a).id_ == 3);
84 assert(static_cast<B&>(static_cast<C1&>(a)).id_ == 2);
85 assert(static_cast<B&>(static_cast<C2&>(a)).id_ == 1);
86 throw a;
87 assert(false);
88}
89
90void f2()
91{
92 try
93 {
94 assert(A::count == 0);
95 assert(C1::count == 0);
96 assert(C2::count == 0);
97 assert(B::count == 0);
98 f1();
99 assert(false);
100 }
101 catch (const A& a) // can catch A
102 {
103 assert(a.id_ == 5);
104 assert(static_cast<const C1&>(a).id_ == 4);
105 assert(static_cast<const C2&>(a).id_ == 3);
106 assert(static_cast<const B&>(static_cast<const C1&>(a)).id_ == 2);
107 assert(static_cast<const B&>(static_cast<const C2&>(a)).id_ == 1);
108 throw;
109 }
110 catch (const C1&)
111 {
112 assert(false);
113 }
114 catch (const C2&)
115 {
116 assert(false);
117 }
118 catch (const B&)
119 {
120 assert(false);
121 }
122}
123
124void f3()
125{
126 try
127 {
128 assert(A::count == 0);
129 assert(C1::count == 0);
130 assert(C2::count == 0);
131 assert(B::count == 0);
132 f2();
133 assert(false);
134 }
135 catch (const B& a) // can not catch B (ambiguous base)
136 {
137 assert(false);
138 }
139 catch (const C1& c1) // can catch C1
140 {
141 assert(c1.id_ == 4);
142 assert(static_cast<const B&>(c1).id_ == 2);
143 throw;
144 }
145 catch (const C2&)
146 {
147 assert(false);
148 }
149}
150
151void f4()
152{
153 try
154 {
155 assert(A::count == 0);
156 assert(C1::count == 0);
157 assert(C2::count == 0);
158 assert(B::count == 0);
159 f3();
160 assert(false);
161 }
162 catch (const B& a) // can not catch B (ambiguous base)
163 {
164 assert(false);
165 }
166 catch (const C2& c2) // can catch C2
167 {
168 assert(c2.id_ == 3);
169 assert(static_cast<const B&>(c2).id_ == 1);
170 throw;
171 }
172 catch (const C1&)
173 {
174 assert(false);
175 }
176}
177
178int main()
179{
180 try
181 {
182 f4();
183 assert(false);
184 }
185 catch (...)
186 {
187 }
188 assert(A::count == 0);
189 assert(C1::count == 0);
190 assert(C2::count == 0);
191 assert(B::count == 0);
192}