]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Functions related to building classes and their related objects. |
d1e082c2 | 2 | Copyright (C) 1987-2013 Free Software Foundation, Inc. |
8d08fdba MS |
3 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
4 | ||
f5adbb8d | 5 | This file is part of GCC. |
8d08fdba | 6 | |
f5adbb8d | 7 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 8 | it under the terms of the GNU General Public License as published by |
e77f031d | 9 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
10 | any later version. |
11 | ||
f5adbb8d | 12 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
20 | |
21 | ||
e92cc029 | 22 | /* High-level class interface. */ |
8d08fdba MS |
23 | |
24 | #include "config.h" | |
8d052bc7 | 25 | #include "system.h" |
4977bab6 ZW |
26 | #include "coretypes.h" |
27 | #include "tm.h" | |
e7a587ef | 28 | #include "tree.h" |
8d08fdba MS |
29 | #include "cp-tree.h" |
30 | #include "flags.h" | |
54f92bfb | 31 | #include "toplev.h" |
1af6141b | 32 | #include "target.h" |
7b6d72fc | 33 | #include "convert.h" |
8634c649 | 34 | #include "cgraph.h" |
7ee2468b | 35 | #include "dumpfile.h" |
245763e3 | 36 | #include "splay-tree.h" |
f732fa7b | 37 | #include "pointer-set.h" |
703c8606 | 38 | #include "hash-table.h" |
8d08fdba | 39 | |
61a127b3 MM |
40 | /* The number of nested classes being processed. If we are not in the |
41 | scope of any class, this is zero. */ | |
42 | ||
8d08fdba MS |
43 | int current_class_depth; |
44 | ||
61a127b3 MM |
45 | /* In order to deal with nested classes, we keep a stack of classes. |
46 | The topmost entry is the innermost class, and is the entry at index | |
47 | CURRENT_CLASS_DEPTH */ | |
48 | ||
49 | typedef struct class_stack_node { | |
50 | /* The name of the class. */ | |
51 | tree name; | |
52 | ||
53 | /* The _TYPE node for the class. */ | |
54 | tree type; | |
55 | ||
56 | /* The access specifier pending for new declarations in the scope of | |
57 | this class. */ | |
58 | tree access; | |
8f032717 MM |
59 | |
60 | /* If were defining TYPE, the names used in this class. */ | |
61 | splay_tree names_used; | |
c888c93b MM |
62 | |
63 | /* Nonzero if this class is no longer open, because of a call to | |
64 | push_to_top_level. */ | |
65 | size_t hidden; | |
61a127b3 MM |
66 | }* class_stack_node_t; |
67 | ||
911a71a7 | 68 | typedef struct vtbl_init_data_s |
c35cce41 | 69 | { |
911a71a7 MM |
70 | /* The base for which we're building initializers. */ |
71 | tree binfo; | |
73ea87d7 | 72 | /* The type of the most-derived type. */ |
c35cce41 | 73 | tree derived; |
73ea87d7 NS |
74 | /* The binfo for the dynamic type. This will be TYPE_BINFO (derived), |
75 | unless ctor_vtbl_p is true. */ | |
76 | tree rtti_binfo; | |
9bab6c90 MM |
77 | /* The negative-index vtable initializers built up so far. These |
78 | are in order from least negative index to most negative index. */ | |
9771b263 | 79 | vec<constructor_elt, va_gc> *inits; |
c35cce41 | 80 | /* The binfo for the virtual base for which we're building |
911a71a7 | 81 | vcall offset initializers. */ |
c35cce41 | 82 | tree vbase; |
9bab6c90 MM |
83 | /* The functions in vbase for which we have already provided vcall |
84 | offsets. */ | |
9771b263 | 85 | vec<tree, va_gc> *fns; |
c35cce41 MM |
86 | /* The vtable index of the next vcall or vbase offset. */ |
87 | tree index; | |
88 | /* Nonzero if we are building the initializer for the primary | |
89 | vtable. */ | |
911a71a7 MM |
90 | int primary_vtbl_p; |
91 | /* Nonzero if we are building the initializer for a construction | |
92 | vtable. */ | |
93 | int ctor_vtbl_p; | |
548502d3 MM |
94 | /* True when adding vcall offset entries to the vtable. False when |
95 | merely computing the indices. */ | |
96 | bool generate_vcall_entries; | |
911a71a7 | 97 | } vtbl_init_data; |
c35cce41 | 98 | |
c20118a8 | 99 | /* The type of a function passed to walk_subobject_offsets. */ |
94edc4ab | 100 | typedef int (*subobject_offset_fn) (tree, tree, splay_tree); |
c20118a8 | 101 | |
4639c5c6 | 102 | /* The stack itself. This is a dynamically resized array. The |
61a127b3 MM |
103 | number of elements allocated is CURRENT_CLASS_STACK_SIZE. */ |
104 | static int current_class_stack_size; | |
105 | static class_stack_node_t current_class_stack; | |
106 | ||
c5a35c3c MM |
107 | /* The size of the largest empty class seen in this translation unit. */ |
108 | static GTY (()) tree sizeof_biggest_empty_class; | |
109 | ||
1f6e1acc AS |
110 | /* An array of all local classes present in this translation unit, in |
111 | declaration order. */ | |
9771b263 | 112 | vec<tree, va_gc> *local_classes; |
1f6e1acc | 113 | |
94edc4ab NN |
114 | static tree get_vfield_name (tree); |
115 | static void finish_struct_anon (tree); | |
116 | static tree get_vtable_name (tree); | |
117 | static tree get_basefndecls (tree, tree); | |
118 | static int build_primary_vtable (tree, tree); | |
dbbf88d1 | 119 | static int build_secondary_vtable (tree); |
94edc4ab NN |
120 | static void finish_vtbls (tree); |
121 | static void modify_vtable_entry (tree, tree, tree, tree, tree *); | |
94edc4ab NN |
122 | static void finish_struct_bits (tree); |
123 | static int alter_access (tree, tree, tree); | |
124 | static void handle_using_decl (tree, tree); | |
94edc4ab NN |
125 | static tree dfs_modify_vtables (tree, void *); |
126 | static tree modify_all_vtables (tree, tree); | |
fc6633e0 | 127 | static void determine_primary_bases (tree); |
94edc4ab NN |
128 | static void finish_struct_methods (tree); |
129 | static void maybe_warn_about_overly_private_class (tree); | |
94edc4ab NN |
130 | static int method_name_cmp (const void *, const void *); |
131 | static int resort_method_name_cmp (const void *, const void *); | |
85b5d65a | 132 | static void add_implicitly_declared_members (tree, tree*, int, int); |
94edc4ab | 133 | static tree fixed_type_or_null (tree, int *, int *); |
00bfffa4 | 134 | static tree build_simple_base_path (tree expr, tree binfo); |
94edc4ab | 135 | static tree build_vtbl_ref_1 (tree, tree); |
9d6a019c | 136 | static void build_vtbl_initializer (tree, tree, tree, tree, int *, |
9771b263 | 137 | vec<constructor_elt, va_gc> **); |
94edc4ab | 138 | static int count_fields (tree); |
d07605f5 | 139 | static int add_fields_to_record_type (tree, struct sorted_fields_type*, int); |
cba0366c | 140 | static void insert_into_classtype_sorted_fields (tree, tree, int); |
e7df0180 | 141 | static bool check_bitfield_decl (tree); |
10746f37 JM |
142 | static void check_field_decl (tree, tree, int *, int *, int *); |
143 | static void check_field_decls (tree, tree *, int *, int *); | |
58731fd1 MM |
144 | static tree *build_base_field (record_layout_info, tree, splay_tree, tree *); |
145 | static void build_base_fields (record_layout_info, splay_tree, tree *); | |
94edc4ab NN |
146 | static void check_methods (tree); |
147 | static void remove_zero_width_bit_fields (tree); | |
10746f37 | 148 | static void check_bases (tree, int *, int *); |
58731fd1 MM |
149 | static void check_bases_and_members (tree); |
150 | static tree create_vtable_ptr (tree, tree *); | |
17bbb839 | 151 | static void include_empty_classes (record_layout_info); |
e93ee644 | 152 | static void layout_class_type (tree, tree *); |
dbbf88d1 | 153 | static void propagate_binfo_offsets (tree, tree); |
17bbb839 | 154 | static void layout_virtual_bases (record_layout_info, splay_tree); |
94edc4ab NN |
155 | static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *); |
156 | static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *); | |
157 | static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *); | |
158 | static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *); | |
e6a66567 | 159 | static void add_vcall_offset (tree, tree, vtbl_init_data *); |
94edc4ab | 160 | static void layout_vtable_decl (tree, int); |
5d5a519f | 161 | static tree dfs_find_final_overrider_pre (tree, void *); |
dbbf88d1 | 162 | static tree dfs_find_final_overrider_post (tree, void *); |
94edc4ab NN |
163 | static tree find_final_overrider (tree, tree, tree); |
164 | static int make_new_vtable (tree, tree); | |
b5791fdc | 165 | static tree get_primary_binfo (tree); |
94edc4ab | 166 | static int maybe_indent_hierarchy (FILE *, int, int); |
dbbf88d1 | 167 | static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int); |
94edc4ab | 168 | static void dump_class_hierarchy (tree); |
bb885938 | 169 | static void dump_class_hierarchy_1 (FILE *, int, tree); |
94edc4ab NN |
170 | static void dump_array (FILE *, tree); |
171 | static void dump_vtable (tree, tree, tree); | |
172 | static void dump_vtt (tree, tree); | |
bb885938 | 173 | static void dump_thunk (FILE *, int, tree); |
94edc4ab | 174 | static tree build_vtable (tree, tree, tree); |
9771b263 | 175 | static void initialize_vtable (tree, vec<constructor_elt, va_gc> *); |
94edc4ab | 176 | static void layout_nonempty_base_or_field (record_layout_info, |
5d5a519f | 177 | tree, tree, splay_tree); |
94edc4ab | 178 | static tree end_of_class (tree, int); |
d9d9dbc0 | 179 | static bool layout_empty_base (record_layout_info, tree, tree, splay_tree); |
9d6a019c | 180 | static void accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
9771b263 | 181 | vec<constructor_elt, va_gc> **); |
9d6a019c | 182 | static void dfs_accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
9771b263 | 183 | vec<constructor_elt, va_gc> **); |
94edc4ab | 184 | static void build_rtti_vtbl_entries (tree, vtbl_init_data *); |
5d5a519f | 185 | static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *); |
94edc4ab NN |
186 | static void clone_constructors_and_destructors (tree); |
187 | static tree build_clone (tree, tree); | |
a2ddc397 | 188 | static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned); |
94edc4ab NN |
189 | static void build_ctor_vtbl_group (tree, tree); |
190 | static void build_vtt (tree); | |
191 | static tree binfo_ctor_vtable (tree); | |
9771b263 DN |
192 | static void build_vtt_inits (tree, tree, vec<constructor_elt, va_gc> **, |
193 | tree *); | |
94edc4ab | 194 | static tree dfs_build_secondary_vptr_vtt_inits (tree, void *); |
94edc4ab | 195 | static tree dfs_fixup_binfo_vtbls (tree, void *); |
94edc4ab NN |
196 | static int record_subobject_offset (tree, tree, splay_tree); |
197 | static int check_subobject_offset (tree, tree, splay_tree); | |
198 | static int walk_subobject_offsets (tree, subobject_offset_fn, | |
5d5a519f | 199 | tree, splay_tree, tree, int); |
c5a35c3c | 200 | static void record_subobject_offsets (tree, tree, splay_tree, bool); |
94edc4ab NN |
201 | static int layout_conflict_p (tree, tree, splay_tree, int); |
202 | static int splay_tree_compare_integer_csts (splay_tree_key k1, | |
5d5a519f | 203 | splay_tree_key k2); |
94edc4ab NN |
204 | static void warn_about_ambiguous_bases (tree); |
205 | static bool type_requires_array_cookie (tree); | |
956d9305 | 206 | static bool contains_empty_class_p (tree); |
9368208b | 207 | static bool base_derived_from (tree, tree); |
7ba539c6 | 208 | static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree); |
ba9a991f | 209 | static tree end_of_base (tree); |
548502d3 | 210 | static tree get_vcall_index (tree, tree); |
9965d119 | 211 | |
51c184be | 212 | /* Variables shared between class.c and call.c. */ |
8d08fdba MS |
213 | |
214 | int n_vtables = 0; | |
215 | int n_vtable_entries = 0; | |
216 | int n_vtable_searches = 0; | |
217 | int n_vtable_elems = 0; | |
218 | int n_convert_harshness = 0; | |
219 | int n_compute_conversion_costs = 0; | |
8d08fdba MS |
220 | int n_inner_fields_searched = 0; |
221 | ||
338d90b8 NS |
222 | /* Convert to or from a base subobject. EXPR is an expression of type |
223 | `A' or `A*', an expression of type `B' or `B*' is returned. To | |
224 | convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for | |
225 | the B base instance within A. To convert base A to derived B, CODE | |
226 | is MINUS_EXPR and BINFO is the binfo for the A instance within B. | |
227 | In this latter case, A must not be a morally virtual base of B. | |
228 | NONNULL is true if EXPR is known to be non-NULL (this is only | |
229 | needed when EXPR is of pointer type). CV qualifiers are preserved | |
230 | from EXPR. */ | |
ca36f057 MM |
231 | |
232 | tree | |
94edc4ab | 233 | build_base_path (enum tree_code code, |
0cbd7506 MS |
234 | tree expr, |
235 | tree binfo, | |
a271590a PC |
236 | int nonnull, |
237 | tsubst_flags_t complain) | |
1a588ad7 | 238 | { |
338d90b8 | 239 | tree v_binfo = NULL_TREE; |
6bc34b14 | 240 | tree d_binfo = NULL_TREE; |
338d90b8 NS |
241 | tree probe; |
242 | tree offset; | |
243 | tree target_type; | |
244 | tree null_test = NULL; | |
245 | tree ptr_target_type; | |
ca36f057 | 246 | int fixed_type_p; |
50e10fa8 | 247 | int want_pointer = TYPE_PTR_P (TREE_TYPE (expr)); |
00bfffa4 | 248 | bool has_empty = false; |
d7981fd9 | 249 | bool virtual_access; |
1a588ad7 | 250 | |
338d90b8 NS |
251 | if (expr == error_mark_node || binfo == error_mark_node || !binfo) |
252 | return error_mark_node; | |
6bc34b14 JM |
253 | |
254 | for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
255 | { | |
256 | d_binfo = probe; | |
00bfffa4 JM |
257 | if (is_empty_class (BINFO_TYPE (probe))) |
258 | has_empty = true; | |
809e3e7f | 259 | if (!v_binfo && BINFO_VIRTUAL_P (probe)) |
6bc34b14 JM |
260 | v_binfo = probe; |
261 | } | |
338d90b8 NS |
262 | |
263 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr)); | |
264 | if (want_pointer) | |
265 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe)); | |
00bfffa4 | 266 | |
5313d330 JM |
267 | if (code == PLUS_EXPR |
268 | && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)) | |
269 | { | |
270 | /* This can happen when adjust_result_of_qualified_name_lookup can't | |
271 | find a unique base binfo in a call to a member function. We | |
272 | couldn't give the diagnostic then since we might have been calling | |
273 | a static member function, so we do it now. */ | |
274 | if (complain & tf_error) | |
275 | { | |
276 | tree base = lookup_base (probe, BINFO_TYPE (d_binfo), | |
22854930 | 277 | ba_unique, NULL, complain); |
5313d330 JM |
278 | gcc_assert (base == error_mark_node); |
279 | } | |
280 | return error_mark_node; | |
281 | } | |
282 | ||
539ed333 NS |
283 | gcc_assert ((code == MINUS_EXPR |
284 | && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe)) | |
5313d330 | 285 | || code == PLUS_EXPR); |
c8094d83 | 286 | |
00bfffa4 JM |
287 | if (binfo == d_binfo) |
288 | /* Nothing to do. */ | |
289 | return expr; | |
290 | ||
338d90b8 NS |
291 | if (code == MINUS_EXPR && v_binfo) |
292 | { | |
a271590a PC |
293 | if (complain & tf_error) |
294 | error ("cannot convert from base %qT to derived type %qT via " | |
295 | "virtual base %qT", BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), | |
296 | BINFO_TYPE (v_binfo)); | |
338d90b8 NS |
297 | return error_mark_node; |
298 | } | |
1a588ad7 | 299 | |
f576dfc4 JM |
300 | if (!want_pointer) |
301 | /* This must happen before the call to save_expr. */ | |
a271590a | 302 | expr = cp_build_addr_expr (expr, complain); |
7fd7263d | 303 | else |
416f380b | 304 | expr = mark_rvalue_use (expr); |
f576dfc4 | 305 | |
00bfffa4 | 306 | offset = BINFO_OFFSET (binfo); |
ca36f057 | 307 | fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull); |
0e686aa6 | 308 | target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo); |
2bbf86a4 JM |
309 | /* TARGET_TYPE has been extracted from BINFO, and, is therefore always |
310 | cv-unqualified. Extract the cv-qualifiers from EXPR so that the | |
311 | expression returned matches the input. */ | |
312 | target_type = cp_build_qualified_type | |
313 | (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr)))); | |
314 | ptr_target_type = build_pointer_type (target_type); | |
00bfffa4 | 315 | |
d7981fd9 | 316 | /* Do we need to look in the vtable for the real offset? */ |
7a0b47e3 JM |
317 | virtual_access = (v_binfo && fixed_type_p <= 0); |
318 | ||
319 | /* Don't bother with the calculations inside sizeof; they'll ICE if the | |
a8e23778 JM |
320 | source type is incomplete and the pointer value doesn't matter. In a |
321 | template (even in fold_non_dependent_expr), we don't have vtables set | |
322 | up properly yet, and the value doesn't matter there either; we're just | |
323 | interested in the result of overload resolution. */ | |
324 | if (cp_unevaluated_operand != 0 | |
e0e1b357 | 325 | || in_template_function ()) |
dc555429 | 326 | { |
2bbf86a4 | 327 | expr = build_nop (ptr_target_type, expr); |
dc555429 | 328 | if (!want_pointer) |
dd865ef6 | 329 | expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL); |
dc555429 JM |
330 | return expr; |
331 | } | |
d7981fd9 | 332 | |
c65b0607 JM |
333 | /* If we're in an NSDMI, we don't have the full constructor context yet |
334 | that we need for converting to a virtual base, so just build a stub | |
335 | CONVERT_EXPR and expand it later in bot_replace. */ | |
336 | if (virtual_access && fixed_type_p < 0 | |
337 | && current_scope () != current_function_decl) | |
338 | { | |
339 | expr = build1 (CONVERT_EXPR, ptr_target_type, expr); | |
340 | CONVERT_EXPR_VBASE_PATH (expr) = true; | |
341 | if (!want_pointer) | |
342 | expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL); | |
343 | return expr; | |
344 | } | |
345 | ||
d7981fd9 | 346 | /* Do we need to check for a null pointer? */ |
0e686aa6 MM |
347 | if (want_pointer && !nonnull) |
348 | { | |
349 | /* If we know the conversion will not actually change the value | |
350 | of EXPR, then we can avoid testing the expression for NULL. | |
351 | We have to avoid generating a COMPONENT_REF for a base class | |
352 | field, because other parts of the compiler know that such | |
353 | expressions are always non-NULL. */ | |
354 | if (!virtual_access && integer_zerop (offset)) | |
2bbf86a4 | 355 | return build_nop (ptr_target_type, expr); |
0e686aa6 MM |
356 | null_test = error_mark_node; |
357 | } | |
00bfffa4 | 358 | |
d7981fd9 JM |
359 | /* Protect against multiple evaluation if necessary. */ |
360 | if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access)) | |
ca36f057 | 361 | expr = save_expr (expr); |
f2606a97 | 362 | |
d7981fd9 | 363 | /* Now that we've saved expr, build the real null test. */ |
00bfffa4 | 364 | if (null_test) |
471a58a9 | 365 | { |
4b978f96 | 366 | tree zero = cp_convert (TREE_TYPE (expr), nullptr_node, complain); |
db3927fb | 367 | null_test = fold_build2_loc (input_location, NE_EXPR, boolean_type_node, |
7866705a | 368 | expr, zero); |
471a58a9 | 369 | } |
00bfffa4 JM |
370 | |
371 | /* If this is a simple base reference, express it as a COMPONENT_REF. */ | |
d7981fd9 | 372 | if (code == PLUS_EXPR && !virtual_access |
00bfffa4 JM |
373 | /* We don't build base fields for empty bases, and they aren't very |
374 | interesting to the optimizers anyway. */ | |
375 | && !has_empty) | |
376 | { | |
a271590a | 377 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
00bfffa4 JM |
378 | expr = build_simple_base_path (expr, binfo); |
379 | if (want_pointer) | |
442c8e31 | 380 | expr = build_address (expr); |
00bfffa4 JM |
381 | target_type = TREE_TYPE (expr); |
382 | goto out; | |
383 | } | |
384 | ||
d7981fd9 | 385 | if (virtual_access) |
1a588ad7 | 386 | { |
338d90b8 | 387 | /* Going via virtual base V_BINFO. We need the static offset |
0cbd7506 MS |
388 | from V_BINFO to BINFO, and the dynamic offset from D_BINFO to |
389 | V_BINFO. That offset is an entry in D_BINFO's vtable. */ | |
1f5a253a NS |
390 | tree v_offset; |
391 | ||
392 | if (fixed_type_p < 0 && in_base_initializer) | |
393 | { | |
2acb1af9 NS |
394 | /* In a base member initializer, we cannot rely on the |
395 | vtable being set up. We have to indirect via the | |
396 | vtt_parm. */ | |
6de9cd9a DN |
397 | tree t; |
398 | ||
2acb1af9 | 399 | t = TREE_TYPE (TYPE_VFIELD (current_class_type)); |
6de9cd9a DN |
400 | t = build_pointer_type (t); |
401 | v_offset = convert (t, current_vtt_parm); | |
a271590a | 402 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
1f5a253a NS |
403 | } |
404 | else | |
dd865ef6 | 405 | v_offset = build_vfield_ref (cp_build_indirect_ref (expr, RO_NULL, |
a271590a | 406 | complain), |
1f5a253a | 407 | TREE_TYPE (TREE_TYPE (expr))); |
c8094d83 | 408 | |
5d49b6a7 | 409 | v_offset = fold_build_pointer_plus (v_offset, BINFO_VPTR_FIELD (v_binfo)); |
c8094d83 | 410 | v_offset = build1 (NOP_EXPR, |
338d90b8 NS |
411 | build_pointer_type (ptrdiff_type_node), |
412 | v_offset); | |
a271590a | 413 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
6de9cd9a | 414 | TREE_CONSTANT (v_offset) = 1; |
f63ab951 | 415 | |
7b6d72fc | 416 | offset = convert_to_integer (ptrdiff_type_node, |
db3927fb | 417 | size_diffop_loc (input_location, offset, |
7b6d72fc | 418 | BINFO_OFFSET (v_binfo))); |
8d08fdba | 419 | |
338d90b8 | 420 | if (!integer_zerop (offset)) |
f293ce4b | 421 | v_offset = build2 (code, ptrdiff_type_node, v_offset, offset); |
f2606a97 JM |
422 | |
423 | if (fixed_type_p < 0) | |
424 | /* Negative fixed_type_p means this is a constructor or destructor; | |
425 | virtual base layout is fixed in in-charge [cd]tors, but not in | |
426 | base [cd]tors. */ | |
f293ce4b RS |
427 | offset = build3 (COND_EXPR, ptrdiff_type_node, |
428 | build2 (EQ_EXPR, boolean_type_node, | |
429 | current_in_charge_parm, integer_zero_node), | |
430 | v_offset, | |
aa8f5c20 AP |
431 | convert_to_integer (ptrdiff_type_node, |
432 | BINFO_OFFSET (binfo))); | |
338d90b8 NS |
433 | else |
434 | offset = v_offset; | |
8d08fdba | 435 | } |
8d08fdba | 436 | |
338d90b8 NS |
437 | if (want_pointer) |
438 | target_type = ptr_target_type; | |
c8094d83 | 439 | |
338d90b8 | 440 | expr = build1 (NOP_EXPR, ptr_target_type, expr); |
fed3cef0 | 441 | |
338d90b8 | 442 | if (!integer_zerop (offset)) |
5be014d5 AP |
443 | { |
444 | offset = fold_convert (sizetype, offset); | |
445 | if (code == MINUS_EXPR) | |
db3927fb | 446 | offset = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, offset); |
5d49b6a7 | 447 | expr = fold_build_pointer_plus (expr, offset); |
5be014d5 | 448 | } |
8d08fdba | 449 | else |
338d90b8 | 450 | null_test = NULL; |
c8094d83 | 451 | |
338d90b8 | 452 | if (!want_pointer) |
a271590a | 453 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
8d08fdba | 454 | |
00bfffa4 | 455 | out: |
338d90b8 | 456 | if (null_test) |
db3927fb | 457 | expr = fold_build3_loc (input_location, COND_EXPR, target_type, null_test, expr, |
e8160c9a | 458 | build_zero_cst (target_type)); |
f2606a97 | 459 | |
338d90b8 | 460 | return expr; |
8d08fdba MS |
461 | } |
462 | ||
00bfffa4 JM |
463 | /* Subroutine of build_base_path; EXPR and BINFO are as in that function. |
464 | Perform a derived-to-base conversion by recursively building up a | |
465 | sequence of COMPONENT_REFs to the appropriate base fields. */ | |
466 | ||
467 | static tree | |
468 | build_simple_base_path (tree expr, tree binfo) | |
469 | { | |
470 | tree type = BINFO_TYPE (binfo); | |
fc6633e0 | 471 | tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo); |
00bfffa4 JM |
472 | tree field; |
473 | ||
00bfffa4 JM |
474 | if (d_binfo == NULL_TREE) |
475 | { | |
12a669d1 | 476 | tree temp; |
c8094d83 | 477 | |
8dc2b103 | 478 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type); |
c8094d83 | 479 | |
12a669d1 | 480 | /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' |
0cbd7506 | 481 | into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only |
3b426391 KH |
482 | an lvalue in the front end; only _DECLs and _REFs are lvalues |
483 | in the back end. */ | |
12a669d1 NS |
484 | temp = unary_complex_lvalue (ADDR_EXPR, expr); |
485 | if (temp) | |
dd865ef6 | 486 | expr = cp_build_indirect_ref (temp, RO_NULL, tf_warning_or_error); |
12a669d1 | 487 | |
00bfffa4 JM |
488 | return expr; |
489 | } | |
490 | ||
491 | /* Recurse. */ | |
492 | expr = build_simple_base_path (expr, d_binfo); | |
493 | ||
494 | for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo)); | |
910ad8de | 495 | field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
496 | /* Is this the base field created by build_base_field? */ |
497 | if (TREE_CODE (field) == FIELD_DECL | |
642124c6 | 498 | && DECL_FIELD_IS_BASE (field) |
a8c1d899 JM |
499 | && TREE_TYPE (field) == type |
500 | /* If we're looking for a field in the most-derived class, | |
501 | also check the field offset; we can have two base fields | |
502 | of the same type if one is an indirect virtual base and one | |
503 | is a direct non-virtual base. */ | |
504 | && (BINFO_INHERITANCE_CHAIN (d_binfo) | |
505 | || tree_int_cst_equal (byte_position (field), | |
506 | BINFO_OFFSET (binfo)))) | |
12a669d1 NS |
507 | { |
508 | /* We don't use build_class_member_access_expr here, as that | |
509 | has unnecessary checks, and more importantly results in | |
510 | recursive calls to dfs_walk_once. */ | |
511 | int type_quals = cp_type_quals (TREE_TYPE (expr)); | |
512 | ||
513 | expr = build3 (COMPONENT_REF, | |
514 | cp_build_qualified_type (type, type_quals), | |
515 | expr, field, NULL_TREE); | |
516 | expr = fold_if_not_in_template (expr); | |
c8094d83 | 517 | |
12a669d1 NS |
518 | /* Mark the expression const or volatile, as appropriate. |
519 | Even though we've dealt with the type above, we still have | |
520 | to mark the expression itself. */ | |
521 | if (type_quals & TYPE_QUAL_CONST) | |
522 | TREE_READONLY (expr) = 1; | |
523 | if (type_quals & TYPE_QUAL_VOLATILE) | |
524 | TREE_THIS_VOLATILE (expr) = 1; | |
c8094d83 | 525 | |
12a669d1 NS |
526 | return expr; |
527 | } | |
00bfffa4 JM |
528 | |
529 | /* Didn't find the base field?!? */ | |
8dc2b103 | 530 | gcc_unreachable (); |
00bfffa4 JM |
531 | } |
532 | ||
08e17d9d MM |
533 | /* Convert OBJECT to the base TYPE. OBJECT is an expression whose |
534 | type is a class type or a pointer to a class type. In the former | |
535 | case, TYPE is also a class type; in the latter it is another | |
536 | pointer type. If CHECK_ACCESS is true, an error message is emitted | |
537 | if TYPE is inaccessible. If OBJECT has pointer type, the value is | |
538 | assumed to be non-NULL. */ | |
50ad9642 MM |
539 | |
540 | tree | |
798ec807 JM |
541 | convert_to_base (tree object, tree type, bool check_access, bool nonnull, |
542 | tsubst_flags_t complain) | |
50ad9642 MM |
543 | { |
544 | tree binfo; | |
08e17d9d | 545 | tree object_type; |
50ad9642 | 546 | |
08e17d9d MM |
547 | if (TYPE_PTR_P (TREE_TYPE (object))) |
548 | { | |
549 | object_type = TREE_TYPE (TREE_TYPE (object)); | |
550 | type = TREE_TYPE (type); | |
551 | } | |
552 | else | |
553 | object_type = TREE_TYPE (object); | |
554 | ||
22854930 PC |
555 | binfo = lookup_base (object_type, type, check_access ? ba_check : ba_unique, |
556 | NULL, complain); | |
5bfc90de | 557 | if (!binfo || binfo == error_mark_node) |
50ad9642 MM |
558 | return error_mark_node; |
559 | ||
a271590a | 560 | return build_base_path (PLUS_EXPR, object, binfo, nonnull, complain); |
50ad9642 MM |
561 | } |
562 | ||
539ed333 NS |
563 | /* EXPR is an expression with unqualified class type. BASE is a base |
564 | binfo of that class type. Returns EXPR, converted to the BASE | |
22ed7e5f MM |
565 | type. This function assumes that EXPR is the most derived class; |
566 | therefore virtual bases can be found at their static offsets. */ | |
567 | ||
568 | tree | |
569 | convert_to_base_statically (tree expr, tree base) | |
570 | { | |
571 | tree expr_type; | |
572 | ||
573 | expr_type = TREE_TYPE (expr); | |
539ed333 | 574 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type)) |
22ed7e5f | 575 | { |
a8c1d899 JM |
576 | /* If this is a non-empty base, use a COMPONENT_REF. */ |
577 | if (!is_empty_class (BINFO_TYPE (base))) | |
578 | return build_simple_base_path (expr, base); | |
579 | ||
ffd34392 JH |
580 | /* We use fold_build2 and fold_convert below to simplify the trees |
581 | provided to the optimizers. It is not safe to call these functions | |
582 | when processing a template because they do not handle C++-specific | |
583 | trees. */ | |
584 | gcc_assert (!processing_template_decl); | |
93c0e0bb | 585 | expr = cp_build_addr_expr (expr, tf_warning_or_error); |
22ed7e5f | 586 | if (!integer_zerop (BINFO_OFFSET (base))) |
5d49b6a7 RG |
587 | expr = fold_build_pointer_plus_loc (input_location, |
588 | expr, BINFO_OFFSET (base)); | |
ffd34392 | 589 | expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr); |
db3927fb | 590 | expr = build_fold_indirect_ref_loc (input_location, expr); |
22ed7e5f MM |
591 | } |
592 | ||
593 | return expr; | |
594 | } | |
595 | ||
f8361147 | 596 | \f |
981c353e RH |
597 | tree |
598 | build_vfield_ref (tree datum, tree type) | |
599 | { | |
600 | tree vfield, vcontext; | |
601 | ||
602 | if (datum == error_mark_node) | |
603 | return error_mark_node; | |
604 | ||
981c353e RH |
605 | /* First, convert to the requested type. */ |
606 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type)) | |
08e17d9d | 607 | datum = convert_to_base (datum, type, /*check_access=*/false, |
798ec807 | 608 | /*nonnull=*/true, tf_warning_or_error); |
981c353e RH |
609 | |
610 | /* Second, the requested type may not be the owner of its own vptr. | |
611 | If not, convert to the base class that owns it. We cannot use | |
612 | convert_to_base here, because VCONTEXT may appear more than once | |
5995ebfb | 613 | in the inheritance hierarchy of TYPE, and thus direct conversion |
981c353e RH |
614 | between the types may be ambiguous. Following the path back up |
615 | one step at a time via primary bases avoids the problem. */ | |
616 | vfield = TYPE_VFIELD (type); | |
617 | vcontext = DECL_CONTEXT (vfield); | |
618 | while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type)) | |
619 | { | |
620 | datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type)); | |
621 | type = TREE_TYPE (datum); | |
622 | } | |
623 | ||
624 | return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE); | |
625 | } | |
626 | ||
8d08fdba | 627 | /* Given an object INSTANCE, return an expression which yields the |
67231816 RH |
628 | vtable element corresponding to INDEX. There are many special |
629 | cases for INSTANCE which we take care of here, mainly to avoid | |
630 | creating extra tree nodes when we don't have to. */ | |
e92cc029 | 631 | |
4a8d0c9c | 632 | static tree |
94edc4ab | 633 | build_vtbl_ref_1 (tree instance, tree idx) |
8d08fdba | 634 | { |
f63ab951 JM |
635 | tree aref; |
636 | tree vtbl = NULL_TREE; | |
8d08fdba | 637 | |
f63ab951 JM |
638 | /* Try to figure out what a reference refers to, and |
639 | access its virtual function table directly. */ | |
640 | ||
641 | int cdtorp = 0; | |
642 | tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp); | |
643 | ||
ee76b931 | 644 | tree basetype = non_reference (TREE_TYPE (instance)); |
8d08fdba | 645 | |
f63ab951 | 646 | if (fixed_type && !cdtorp) |
8d08fdba | 647 | { |
f63ab951 | 648 | tree binfo = lookup_base (fixed_type, basetype, |
22854930 PC |
649 | ba_unique, NULL, tf_none); |
650 | if (binfo && binfo != error_mark_node) | |
6de9cd9a | 651 | vtbl = unshare_expr (BINFO_VTABLE (binfo)); |
f63ab951 | 652 | } |
8d08fdba | 653 | |
f63ab951 | 654 | if (!vtbl) |
dbbf88d1 | 655 | vtbl = build_vfield_ref (instance, basetype); |
c8094d83 | 656 | |
3a11c665 | 657 | aref = build_array_ref (input_location, vtbl, idx); |
6de9cd9a | 658 | TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx); |
8d08fdba | 659 | |
c4372ef4 | 660 | return aref; |
8d08fdba MS |
661 | } |
662 | ||
4a8d0c9c | 663 | tree |
94edc4ab | 664 | build_vtbl_ref (tree instance, tree idx) |
4a8d0c9c RH |
665 | { |
666 | tree aref = build_vtbl_ref_1 (instance, idx); | |
667 | ||
4a8d0c9c RH |
668 | return aref; |
669 | } | |
670 | ||
0f59171d RH |
671 | /* Given a stable object pointer INSTANCE_PTR, return an expression which |
672 | yields a function pointer corresponding to vtable element INDEX. */ | |
67231816 RH |
673 | |
674 | tree | |
0f59171d | 675 | build_vfn_ref (tree instance_ptr, tree idx) |
67231816 | 676 | { |
0f59171d RH |
677 | tree aref; |
678 | ||
dd865ef6 | 679 | aref = build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr, RO_NULL, |
5ade1ed2 DG |
680 | tf_warning_or_error), |
681 | idx); | |
67231816 RH |
682 | |
683 | /* When using function descriptors, the address of the | |
684 | vtable entry is treated as a function pointer. */ | |
685 | if (TARGET_VTABLE_USES_DESCRIPTORS) | |
4a8d0c9c | 686 | aref = build1 (NOP_EXPR, TREE_TYPE (aref), |
93c0e0bb | 687 | cp_build_addr_expr (aref, tf_warning_or_error)); |
67231816 | 688 | |
0f59171d | 689 | /* Remember this as a method reference, for later devirtualization. */ |
f293ce4b | 690 | aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx); |
0f59171d | 691 | |
67231816 RH |
692 | return aref; |
693 | } | |
694 | ||
669ec2b4 JM |
695 | /* Return the name of the virtual function table (as an IDENTIFIER_NODE) |
696 | for the given TYPE. */ | |
697 | ||
698 | static tree | |
94edc4ab | 699 | get_vtable_name (tree type) |
669ec2b4 | 700 | { |
1f84ec23 | 701 | return mangle_vtbl_for_type (type); |
669ec2b4 JM |
702 | } |
703 | ||
4684cd27 MM |
704 | /* DECL is an entity associated with TYPE, like a virtual table or an |
705 | implicitly generated constructor. Determine whether or not DECL | |
706 | should have external or internal linkage at the object file | |
707 | level. This routine does not deal with COMDAT linkage and other | |
708 | similar complexities; it simply sets TREE_PUBLIC if it possible for | |
709 | entities in other translation units to contain copies of DECL, in | |
710 | the abstract. */ | |
711 | ||
712 | void | |
12308bc6 | 713 | set_linkage_according_to_type (tree /*type*/, tree decl) |
4684cd27 | 714 | { |
012d5d25 JM |
715 | TREE_PUBLIC (decl) = 1; |
716 | determine_visibility (decl); | |
4684cd27 MM |
717 | } |
718 | ||
459c43ad MM |
719 | /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE. |
720 | (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.) | |
721 | Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */ | |
b9f39201 MM |
722 | |
723 | static tree | |
94edc4ab | 724 | build_vtable (tree class_type, tree name, tree vtable_type) |
b9f39201 MM |
725 | { |
726 | tree decl; | |
727 | ||
728 | decl = build_lang_decl (VAR_DECL, name, vtable_type); | |
90ecce3e JM |
729 | /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME |
730 | now to avoid confusion in mangle_decl. */ | |
731 | SET_DECL_ASSEMBLER_NAME (decl, name); | |
b9f39201 MM |
732 | DECL_CONTEXT (decl) = class_type; |
733 | DECL_ARTIFICIAL (decl) = 1; | |
734 | TREE_STATIC (decl) = 1; | |
b9f39201 | 735 | TREE_READONLY (decl) = 1; |
b9f39201 | 736 | DECL_VIRTUAL_P (decl) = 1; |
a6f5e048 | 737 | DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN; |
d35543c0 | 738 | DECL_VTABLE_OR_VTT_P (decl) = 1; |
78d55cc8 JM |
739 | /* At one time the vtable info was grabbed 2 words at a time. This |
740 | fails on sparc unless you have 8-byte alignment. (tiemann) */ | |
741 | DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node), | |
742 | DECL_ALIGN (decl)); | |
4684cd27 MM |
743 | set_linkage_according_to_type (class_type, decl); |
744 | /* The vtable has not been defined -- yet. */ | |
745 | DECL_EXTERNAL (decl) = 1; | |
746 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
747 | ||
78e0d62b RH |
748 | /* Mark the VAR_DECL node representing the vtable itself as a |
749 | "gratuitous" one, thereby forcing dwarfout.c to ignore it. It | |
750 | is rather important that such things be ignored because any | |
751 | effort to actually generate DWARF for them will run into | |
752 | trouble when/if we encounter code like: | |
c8094d83 | 753 | |
78e0d62b RH |
754 | #pragma interface |
755 | struct S { virtual void member (); }; | |
c8094d83 | 756 | |
78e0d62b RH |
757 | because the artificial declaration of the vtable itself (as |
758 | manufactured by the g++ front end) will say that the vtable is | |
759 | a static member of `S' but only *after* the debug output for | |
760 | the definition of `S' has already been output. This causes | |
761 | grief because the DWARF entry for the definition of the vtable | |
762 | will try to refer back to an earlier *declaration* of the | |
763 | vtable as a static member of `S' and there won't be one. We | |
764 | might be able to arrange to have the "vtable static member" | |
765 | attached to the member list for `S' before the debug info for | |
766 | `S' get written (which would solve the problem) but that would | |
767 | require more intrusive changes to the g++ front end. */ | |
768 | DECL_IGNORED_P (decl) = 1; | |
78d55cc8 | 769 | |
b9f39201 MM |
770 | return decl; |
771 | } | |
772 | ||
1aa4ccd4 NS |
773 | /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic, |
774 | or even complete. If this does not exist, create it. If COMPLETE is | |
838dfd8a | 775 | nonzero, then complete the definition of it -- that will render it |
1aa4ccd4 NS |
776 | impossible to actually build the vtable, but is useful to get at those |
777 | which are known to exist in the runtime. */ | |
778 | ||
c8094d83 | 779 | tree |
94edc4ab | 780 | get_vtable_decl (tree type, int complete) |
1aa4ccd4 | 781 | { |
548502d3 MM |
782 | tree decl; |
783 | ||
784 | if (CLASSTYPE_VTABLES (type)) | |
785 | return CLASSTYPE_VTABLES (type); | |
c8094d83 | 786 | |
d1a74aa7 | 787 | decl = build_vtable (type, get_vtable_name (type), vtbl_type_node); |
548502d3 MM |
788 | CLASSTYPE_VTABLES (type) = decl; |
789 | ||
1aa4ccd4 | 790 | if (complete) |
217f4eb9 MM |
791 | { |
792 | DECL_EXTERNAL (decl) = 1; | |
3600f678 | 793 | cp_finish_decl (decl, NULL_TREE, false, NULL_TREE, 0); |
217f4eb9 | 794 | } |
1aa4ccd4 | 795 | |
1aa4ccd4 NS |
796 | return decl; |
797 | } | |
798 | ||
28531dd0 MM |
799 | /* Build the primary virtual function table for TYPE. If BINFO is |
800 | non-NULL, build the vtable starting with the initial approximation | |
801 | that it is the same as the one which is the head of the association | |
838dfd8a | 802 | list. Returns a nonzero value if a new vtable is actually |
28531dd0 | 803 | created. */ |
e92cc029 | 804 | |
28531dd0 | 805 | static int |
94edc4ab | 806 | build_primary_vtable (tree binfo, tree type) |
8d08fdba | 807 | { |
31f8e4f3 MM |
808 | tree decl; |
809 | tree virtuals; | |
8d08fdba | 810 | |
1aa4ccd4 | 811 | decl = get_vtable_decl (type, /*complete=*/0); |
c8094d83 | 812 | |
8d08fdba MS |
813 | if (binfo) |
814 | { | |
dbbf88d1 | 815 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
816 | /* We have already created a vtable for this base, so there's |
817 | no need to do it again. */ | |
28531dd0 | 818 | return 0; |
c8094d83 | 819 | |
d1f05f93 | 820 | virtuals = copy_list (BINFO_VIRTUALS (binfo)); |
c35cce41 MM |
821 | TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo)); |
822 | DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl)); | |
823 | DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl)); | |
8d08fdba MS |
824 | } |
825 | else | |
826 | { | |
50bc768d | 827 | gcc_assert (TREE_TYPE (decl) == vtbl_type_node); |
8d08fdba | 828 | virtuals = NULL_TREE; |
8d08fdba MS |
829 | } |
830 | ||
7aa6d18a SB |
831 | if (GATHER_STATISTICS) |
832 | { | |
833 | n_vtables += 1; | |
834 | n_vtable_elems += list_length (virtuals); | |
835 | } | |
8d08fdba | 836 | |
8d08fdba MS |
837 | /* Initialize the association list for this type, based |
838 | on our first approximation. */ | |
604a3205 NS |
839 | BINFO_VTABLE (TYPE_BINFO (type)) = decl; |
840 | BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals; | |
dbbf88d1 | 841 | SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type)); |
28531dd0 | 842 | return 1; |
8d08fdba MS |
843 | } |
844 | ||
3461fba7 | 845 | /* Give BINFO a new virtual function table which is initialized |
8d08fdba MS |
846 | with a skeleton-copy of its original initialization. The only |
847 | entry that changes is the `delta' entry, so we can really | |
848 | share a lot of structure. | |
849 | ||
3461fba7 | 850 | FOR_TYPE is the most derived type which caused this table to |
8d08fdba MS |
851 | be needed. |
852 | ||
838dfd8a | 853 | Returns nonzero if we haven't met BINFO before. |
2636fde4 JM |
854 | |
855 | The order in which vtables are built (by calling this function) for | |
856 | an object must remain the same, otherwise a binary incompatibility | |
857 | can result. */ | |
e92cc029 | 858 | |
28531dd0 | 859 | static int |
dbbf88d1 | 860 | build_secondary_vtable (tree binfo) |
8d08fdba | 861 | { |
dbbf88d1 | 862 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
863 | /* We already created a vtable for this base. There's no need to |
864 | do it again. */ | |
28531dd0 | 865 | return 0; |
0533d788 | 866 | |
8d7a5379 MM |
867 | /* Remember that we've created a vtable for this BINFO, so that we |
868 | don't try to do so again. */ | |
dbbf88d1 | 869 | SET_BINFO_NEW_VTABLE_MARKED (binfo); |
c8094d83 | 870 | |
8d7a5379 | 871 | /* Make fresh virtual list, so we can smash it later. */ |
d1f05f93 | 872 | BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo)); |
8d7a5379 | 873 | |
3461fba7 NS |
874 | /* Secondary vtables are laid out as part of the same structure as |
875 | the primary vtable. */ | |
876 | BINFO_VTABLE (binfo) = NULL_TREE; | |
28531dd0 | 877 | return 1; |
8d08fdba MS |
878 | } |
879 | ||
28531dd0 | 880 | /* Create a new vtable for BINFO which is the hierarchy dominated by |
838dfd8a | 881 | T. Return nonzero if we actually created a new vtable. */ |
28531dd0 MM |
882 | |
883 | static int | |
94edc4ab | 884 | make_new_vtable (tree t, tree binfo) |
28531dd0 MM |
885 | { |
886 | if (binfo == TYPE_BINFO (t)) | |
887 | /* In this case, it is *type*'s vtable we are modifying. We start | |
d0cd8b44 | 888 | with the approximation that its vtable is that of the |
28531dd0 | 889 | immediate base class. */ |
981c353e | 890 | return build_primary_vtable (binfo, t); |
28531dd0 MM |
891 | else |
892 | /* This is our very own copy of `basetype' to play with. Later, | |
893 | we will fill in all the virtual functions that override the | |
894 | virtual functions in these base classes which are not defined | |
895 | by the current type. */ | |
dbbf88d1 | 896 | return build_secondary_vtable (binfo); |
28531dd0 MM |
897 | } |
898 | ||
899 | /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO | |
900 | (which is in the hierarchy dominated by T) list FNDECL as its | |
4e7512c9 MM |
901 | BV_FN. DELTA is the required constant adjustment from the `this' |
902 | pointer where the vtable entry appears to the `this' required when | |
903 | the function is actually called. */ | |
8d08fdba MS |
904 | |
905 | static void | |
94edc4ab | 906 | modify_vtable_entry (tree t, |
0cbd7506 MS |
907 | tree binfo, |
908 | tree fndecl, | |
909 | tree delta, | |
910 | tree *virtuals) | |
8d08fdba | 911 | { |
28531dd0 | 912 | tree v; |
c0bbf652 | 913 | |
28531dd0 | 914 | v = *virtuals; |
c0bbf652 | 915 | |
5e19c053 | 916 | if (fndecl != BV_FN (v) |
4e7512c9 | 917 | || !tree_int_cst_equal (delta, BV_DELTA (v))) |
c0bbf652 | 918 | { |
28531dd0 MM |
919 | /* We need a new vtable for BINFO. */ |
920 | if (make_new_vtable (t, binfo)) | |
921 | { | |
922 | /* If we really did make a new vtable, we also made a copy | |
923 | of the BINFO_VIRTUALS list. Now, we have to find the | |
924 | corresponding entry in that list. */ | |
925 | *virtuals = BINFO_VIRTUALS (binfo); | |
5e19c053 | 926 | while (BV_FN (*virtuals) != BV_FN (v)) |
28531dd0 MM |
927 | *virtuals = TREE_CHAIN (*virtuals); |
928 | v = *virtuals; | |
929 | } | |
8d08fdba | 930 | |
5e19c053 | 931 | BV_DELTA (v) = delta; |
aabb4cd6 | 932 | BV_VCALL_INDEX (v) = NULL_TREE; |
5e19c053 | 933 | BV_FN (v) = fndecl; |
8d08fdba | 934 | } |
8d08fdba MS |
935 | } |
936 | ||
8d08fdba | 937 | \f |
b2a9b208 | 938 | /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is |
b77fe7b4 NS |
939 | the USING_DECL naming METHOD. Returns true if the method could be |
940 | added to the method vec. */ | |
e92cc029 | 941 | |
b77fe7b4 | 942 | bool |
b2a9b208 | 943 | add_method (tree type, tree method, tree using_decl) |
8d08fdba | 944 | { |
9ba5ff0f | 945 | unsigned slot; |
90ea9897 | 946 | tree overload; |
b54a07e8 NS |
947 | bool template_conv_p = false; |
948 | bool conv_p; | |
9771b263 | 949 | vec<tree, va_gc> *method_vec; |
aaaa46d2 | 950 | bool complete_p; |
9ba5ff0f NS |
951 | bool insert_p = false; |
952 | tree current_fns; | |
fc40d49c | 953 | tree fns; |
ac2b3222 AP |
954 | |
955 | if (method == error_mark_node) | |
b77fe7b4 | 956 | return false; |
aaaa46d2 MM |
957 | |
958 | complete_p = COMPLETE_TYPE_P (type); | |
b54a07e8 NS |
959 | conv_p = DECL_CONV_FN_P (method); |
960 | if (conv_p) | |
961 | template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL | |
962 | && DECL_TEMPLATE_CONV_FN_P (method)); | |
452a394b | 963 | |
452a394b | 964 | method_vec = CLASSTYPE_METHOD_VEC (type); |
aaaa46d2 MM |
965 | if (!method_vec) |
966 | { | |
967 | /* Make a new method vector. We start with 8 entries. We must | |
968 | allocate at least two (for constructors and destructors), and | |
969 | we're going to end up with an assignment operator at some | |
970 | point as well. */ | |
9771b263 | 971 | vec_alloc (method_vec, 8); |
aaaa46d2 | 972 | /* Create slots for constructors and destructors. */ |
9771b263 DN |
973 | method_vec->quick_push (NULL_TREE); |
974 | method_vec->quick_push (NULL_TREE); | |
aaaa46d2 MM |
975 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
976 | } | |
977 | ||
0fcedd9c | 978 | /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */ |
7137605e MM |
979 | grok_special_member_properties (method); |
980 | ||
452a394b MM |
981 | /* Constructors and destructors go in special slots. */ |
982 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method)) | |
983 | slot = CLASSTYPE_CONSTRUCTOR_SLOT; | |
984 | else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) | |
4b0d3cbe MM |
985 | { |
986 | slot = CLASSTYPE_DESTRUCTOR_SLOT; | |
c8094d83 | 987 | |
f5c28a15 | 988 | if (TYPE_FOR_JAVA (type)) |
9f4faeae MM |
989 | { |
990 | if (!DECL_ARTIFICIAL (method)) | |
991 | error ("Java class %qT cannot have a destructor", type); | |
992 | else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
993 | error ("Java class %qT cannot have an implicit non-trivial " | |
994 | "destructor", | |
995 | type); | |
996 | } | |
4b0d3cbe | 997 | } |
452a394b | 998 | else |
61a127b3 | 999 | { |
aaaa46d2 MM |
1000 | tree m; |
1001 | ||
9ba5ff0f | 1002 | insert_p = true; |
452a394b | 1003 | /* See if we already have an entry with this name. */ |
c8094d83 | 1004 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 1005 | vec_safe_iterate (method_vec, slot, &m); |
aaaa46d2 | 1006 | ++slot) |
5dd236e2 | 1007 | { |
5dd236e2 | 1008 | m = OVL_CURRENT (m); |
5dd236e2 NS |
1009 | if (template_conv_p) |
1010 | { | |
aaaa46d2 MM |
1011 | if (TREE_CODE (m) == TEMPLATE_DECL |
1012 | && DECL_TEMPLATE_CONV_FN_P (m)) | |
1013 | insert_p = false; | |
5dd236e2 NS |
1014 | break; |
1015 | } | |
aaaa46d2 | 1016 | if (conv_p && !DECL_CONV_FN_P (m)) |
5dd236e2 | 1017 | break; |
aaaa46d2 | 1018 | if (DECL_NAME (m) == DECL_NAME (method)) |
452a394b | 1019 | { |
aaaa46d2 MM |
1020 | insert_p = false; |
1021 | break; | |
8d08fdba | 1022 | } |
aaaa46d2 MM |
1023 | if (complete_p |
1024 | && !DECL_CONV_FN_P (m) | |
1025 | && DECL_NAME (m) > DECL_NAME (method)) | |
1026 | break; | |
61a127b3 | 1027 | } |
452a394b | 1028 | } |
9771b263 | 1029 | current_fns = insert_p ? NULL_TREE : (*method_vec)[slot]; |
c8094d83 | 1030 | |
fc40d49c LM |
1031 | /* Check to see if we've already got this method. */ |
1032 | for (fns = current_fns; fns; fns = OVL_NEXT (fns)) | |
452a394b | 1033 | { |
fc40d49c LM |
1034 | tree fn = OVL_CURRENT (fns); |
1035 | tree fn_type; | |
1036 | tree method_type; | |
1037 | tree parms1; | |
1038 | tree parms2; | |
1039 | ||
1040 | if (TREE_CODE (fn) != TREE_CODE (method)) | |
1041 | continue; | |
1042 | ||
1043 | /* [over.load] Member function declarations with the | |
1044 | same name and the same parameter types cannot be | |
1045 | overloaded if any of them is a static member | |
1046 | function declaration. | |
1047 | ||
2eed8e37 BK |
1048 | [over.load] Member function declarations with the same name and |
1049 | the same parameter-type-list as well as member function template | |
1050 | declarations with the same name, the same parameter-type-list, and | |
1051 | the same template parameter lists cannot be overloaded if any of | |
1052 | them, but not all, have a ref-qualifier. | |
1053 | ||
fc40d49c LM |
1054 | [namespace.udecl] When a using-declaration brings names |
1055 | from a base class into a derived class scope, member | |
1056 | functions in the derived class override and/or hide member | |
1057 | functions with the same name and parameter types in a base | |
1058 | class (rather than conflicting). */ | |
1059 | fn_type = TREE_TYPE (fn); | |
1060 | method_type = TREE_TYPE (method); | |
1061 | parms1 = TYPE_ARG_TYPES (fn_type); | |
1062 | parms2 = TYPE_ARG_TYPES (method_type); | |
1063 | ||
1064 | /* Compare the quals on the 'this' parm. Don't compare | |
1065 | the whole types, as used functions are treated as | |
1066 | coming from the using class in overload resolution. */ | |
1067 | if (! DECL_STATIC_FUNCTION_P (fn) | |
1068 | && ! DECL_STATIC_FUNCTION_P (method) | |
2eed8e37 BK |
1069 | /* Either both or neither need to be ref-qualified for |
1070 | differing quals to allow overloading. */ | |
1071 | && (FUNCTION_REF_QUALIFIED (fn_type) | |
1072 | == FUNCTION_REF_QUALIFIED (method_type)) | |
1073 | && (type_memfn_quals (fn_type) != type_memfn_quals (method_type) | |
1074 | || type_memfn_rqual (fn_type) != type_memfn_rqual (method_type))) | |
1075 | continue; | |
fc40d49c LM |
1076 | |
1077 | /* For templates, the return type and template parameters | |
1078 | must be identical. */ | |
1079 | if (TREE_CODE (fn) == TEMPLATE_DECL | |
1080 | && (!same_type_p (TREE_TYPE (fn_type), | |
1081 | TREE_TYPE (method_type)) | |
1082 | || !comp_template_parms (DECL_TEMPLATE_PARMS (fn), | |
1083 | DECL_TEMPLATE_PARMS (method)))) | |
1084 | continue; | |
1085 | ||
1086 | if (! DECL_STATIC_FUNCTION_P (fn)) | |
1087 | parms1 = TREE_CHAIN (parms1); | |
1088 | if (! DECL_STATIC_FUNCTION_P (method)) | |
1089 | parms2 = TREE_CHAIN (parms2); | |
1090 | ||
1091 | if (compparms (parms1, parms2) | |
1092 | && (!DECL_CONV_FN_P (fn) | |
1093 | || same_type_p (TREE_TYPE (fn_type), | |
1094 | TREE_TYPE (method_type)))) | |
452a394b | 1095 | { |
3649b9b7 ST |
1096 | /* For function versions, their parms and types match |
1097 | but they are not duplicates. Record function versions | |
1098 | as and when they are found. extern "C" functions are | |
1099 | not treated as versions. */ | |
1100 | if (TREE_CODE (fn) == FUNCTION_DECL | |
1101 | && TREE_CODE (method) == FUNCTION_DECL | |
1102 | && !DECL_EXTERN_C_P (fn) | |
1103 | && !DECL_EXTERN_C_P (method) | |
3649b9b7 ST |
1104 | && targetm.target_option.function_versions (fn, method)) |
1105 | { | |
1106 | /* Mark functions as versions if necessary. Modify the mangled | |
1107 | decl name if necessary. */ | |
1108 | if (!DECL_FUNCTION_VERSIONED (fn)) | |
1109 | { | |
1110 | DECL_FUNCTION_VERSIONED (fn) = 1; | |
1111 | if (DECL_ASSEMBLER_NAME_SET_P (fn)) | |
1112 | mangle_decl (fn); | |
1113 | } | |
1114 | if (!DECL_FUNCTION_VERSIONED (method)) | |
1115 | { | |
1116 | DECL_FUNCTION_VERSIONED (method) = 1; | |
1117 | if (DECL_ASSEMBLER_NAME_SET_P (method)) | |
1118 | mangle_decl (method); | |
1119 | } | |
1120 | record_function_versions (fn, method); | |
1121 | continue; | |
1122 | } | |
85b5d65a JM |
1123 | if (DECL_INHERITED_CTOR_BASE (method)) |
1124 | { | |
1125 | if (DECL_INHERITED_CTOR_BASE (fn)) | |
1126 | { | |
1127 | error_at (DECL_SOURCE_LOCATION (method), | |
1128 | "%q#D inherited from %qT", method, | |
1129 | DECL_INHERITED_CTOR_BASE (method)); | |
1130 | error_at (DECL_SOURCE_LOCATION (fn), | |
1131 | "conflicts with version inherited from %qT", | |
1132 | DECL_INHERITED_CTOR_BASE (fn)); | |
1133 | } | |
1134 | /* Otherwise defer to the other function. */ | |
1135 | return false; | |
1136 | } | |
fc40d49c | 1137 | if (using_decl) |
452a394b | 1138 | { |
fc40d49c LM |
1139 | if (DECL_CONTEXT (fn) == type) |
1140 | /* Defer to the local function. */ | |
1141 | return false; | |
452a394b | 1142 | } |
fc40d49c LM |
1143 | else |
1144 | { | |
1145 | error ("%q+#D cannot be overloaded", method); | |
1146 | error ("with %q+#D", fn); | |
1147 | } | |
1148 | ||
1149 | /* We don't call duplicate_decls here to merge the | |
1150 | declarations because that will confuse things if the | |
1151 | methods have inline definitions. In particular, we | |
1152 | will crash while processing the definitions. */ | |
1153 | return false; | |
03017874 | 1154 | } |
452a394b | 1155 | } |
03017874 | 1156 | |
3db45ab5 | 1157 | /* A class should never have more than one destructor. */ |
357d956e MM |
1158 | if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) |
1159 | return false; | |
1160 | ||
c8094d83 | 1161 | /* Add the new binding. */ |
57910f3a JM |
1162 | if (using_decl) |
1163 | { | |
1164 | overload = ovl_cons (method, current_fns); | |
1165 | OVL_USED (overload) = true; | |
1166 | } | |
1167 | else | |
1168 | overload = build_overload (method, current_fns); | |
c8094d83 | 1169 | |
357d956e MM |
1170 | if (conv_p) |
1171 | TYPE_HAS_CONVERSION (type) = 1; | |
1172 | else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p) | |
90ea9897 MM |
1173 | push_class_level_binding (DECL_NAME (method), overload); |
1174 | ||
9ba5ff0f NS |
1175 | if (insert_p) |
1176 | { | |
efb7e1e0 ILT |
1177 | bool reallocated; |
1178 | ||
9ba5ff0f NS |
1179 | /* We only expect to add few methods in the COMPLETE_P case, so |
1180 | just make room for one more method in that case. */ | |
efb7e1e0 | 1181 | if (complete_p) |
9771b263 | 1182 | reallocated = vec_safe_reserve_exact (method_vec, 1); |
efb7e1e0 | 1183 | else |
9771b263 | 1184 | reallocated = vec_safe_reserve (method_vec, 1); |
efb7e1e0 | 1185 | if (reallocated) |
9ba5ff0f | 1186 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
9771b263 DN |
1187 | if (slot == method_vec->length ()) |
1188 | method_vec->quick_push (overload); | |
9ba5ff0f | 1189 | else |
9771b263 | 1190 | method_vec->quick_insert (slot, overload); |
9ba5ff0f NS |
1191 | } |
1192 | else | |
03fd3f84 | 1193 | /* Replace the current slot. */ |
9771b263 | 1194 | (*method_vec)[slot] = overload; |
b77fe7b4 | 1195 | return true; |
8d08fdba MS |
1196 | } |
1197 | ||
1198 | /* Subroutines of finish_struct. */ | |
1199 | ||
aa52c1ff JM |
1200 | /* Change the access of FDECL to ACCESS in T. Return 1 if change was |
1201 | legit, otherwise return 0. */ | |
e92cc029 | 1202 | |
8d08fdba | 1203 | static int |
94edc4ab | 1204 | alter_access (tree t, tree fdecl, tree access) |
8d08fdba | 1205 | { |
721c3b42 MM |
1206 | tree elem; |
1207 | ||
1208 | if (!DECL_LANG_SPECIFIC (fdecl)) | |
1209 | retrofit_lang_decl (fdecl); | |
1210 | ||
50bc768d | 1211 | gcc_assert (!DECL_DISCRIMINATOR_P (fdecl)); |
8e4ce833 | 1212 | |
721c3b42 | 1213 | elem = purpose_member (t, DECL_ACCESS (fdecl)); |
38afd588 | 1214 | if (elem) |
8d08fdba | 1215 | { |
38afd588 | 1216 | if (TREE_VALUE (elem) != access) |
8d08fdba | 1217 | { |
38afd588 | 1218 | if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL) |
dee15844 JM |
1219 | error ("conflicting access specifications for method" |
1220 | " %q+D, ignored", TREE_TYPE (fdecl)); | |
38afd588 | 1221 | else |
1f070f2b | 1222 | error ("conflicting access specifications for field %qE, ignored", |
4460cef2 | 1223 | DECL_NAME (fdecl)); |
8d08fdba MS |
1224 | } |
1225 | else | |
430bb96b JL |
1226 | { |
1227 | /* They're changing the access to the same thing they changed | |
1228 | it to before. That's OK. */ | |
1229 | ; | |
1230 | } | |
db5ae43f | 1231 | } |
38afd588 | 1232 | else |
8d08fdba | 1233 | { |
0e69fdf0 PC |
1234 | perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl, |
1235 | tf_warning_or_error); | |
be99da77 | 1236 | DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl)); |
8d08fdba MS |
1237 | return 1; |
1238 | } | |
1239 | return 0; | |
1240 | } | |
1241 | ||
58010b57 | 1242 | /* Process the USING_DECL, which is a member of T. */ |
79ad62b2 | 1243 | |
e9659ab0 | 1244 | static void |
94edc4ab | 1245 | handle_using_decl (tree using_decl, tree t) |
79ad62b2 | 1246 | { |
98ed9dae | 1247 | tree decl = USING_DECL_DECLS (using_decl); |
79ad62b2 MM |
1248 | tree name = DECL_NAME (using_decl); |
1249 | tree access | |
1250 | = TREE_PRIVATE (using_decl) ? access_private_node | |
1251 | : TREE_PROTECTED (using_decl) ? access_protected_node | |
1252 | : access_public_node; | |
79ad62b2 | 1253 | tree flist = NULL_TREE; |
aa52c1ff | 1254 | tree old_value; |
79ad62b2 | 1255 | |
98ed9dae | 1256 | gcc_assert (!processing_template_decl && decl); |
c8094d83 | 1257 | |
db422ace PC |
1258 | old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false, |
1259 | tf_warning_or_error); | |
aa52c1ff | 1260 | if (old_value) |
79ad62b2 | 1261 | { |
aa52c1ff JM |
1262 | if (is_overloaded_fn (old_value)) |
1263 | old_value = OVL_CURRENT (old_value); | |
1264 | ||
1265 | if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t) | |
1266 | /* OK */; | |
1267 | else | |
1268 | old_value = NULL_TREE; | |
79ad62b2 | 1269 | } |
c8094d83 | 1270 | |
6e976965 | 1271 | cp_emit_debug_info_for_using (decl, USING_DECL_SCOPE (using_decl)); |
c8094d83 | 1272 | |
98ed9dae NS |
1273 | if (is_overloaded_fn (decl)) |
1274 | flist = decl; | |
aa52c1ff JM |
1275 | |
1276 | if (! old_value) | |
1277 | ; | |
1278 | else if (is_overloaded_fn (old_value)) | |
79ad62b2 | 1279 | { |
aa52c1ff JM |
1280 | if (flist) |
1281 | /* It's OK to use functions from a base when there are functions with | |
1282 | the same name already present in the current class. */; | |
1283 | else | |
79ad62b2 | 1284 | { |
dee15844 JM |
1285 | error ("%q+D invalid in %q#T", using_decl, t); |
1286 | error (" because of local method %q+#D with same name", | |
1287 | OVL_CURRENT (old_value)); | |
aa52c1ff | 1288 | return; |
79ad62b2 MM |
1289 | } |
1290 | } | |
186c0fbe | 1291 | else if (!DECL_ARTIFICIAL (old_value)) |
aa52c1ff | 1292 | { |
dee15844 JM |
1293 | error ("%q+D invalid in %q#T", using_decl, t); |
1294 | error (" because of local member %q+#D with same name", old_value); | |
aa52c1ff JM |
1295 | return; |
1296 | } | |
c8094d83 | 1297 | |
f4f206f4 | 1298 | /* Make type T see field decl FDECL with access ACCESS. */ |
aa52c1ff JM |
1299 | if (flist) |
1300 | for (; flist; flist = OVL_NEXT (flist)) | |
1301 | { | |
b2a9b208 | 1302 | add_method (t, OVL_CURRENT (flist), using_decl); |
aa52c1ff JM |
1303 | alter_access (t, OVL_CURRENT (flist), access); |
1304 | } | |
1305 | else | |
98ed9dae | 1306 | alter_access (t, decl, access); |
79ad62b2 | 1307 | } |
8d08fdba | 1308 | \f |
7dbb85a7 JM |
1309 | /* walk_tree callback for check_abi_tags: if the type at *TP involves any |
1310 | types with abi tags, add the corresponding identifiers to the VEC in | |
1311 | *DATA and set IDENTIFIER_MARKED. */ | |
1312 | ||
1313 | struct abi_tag_data | |
1314 | { | |
1315 | tree t; | |
1316 | tree subob; | |
1317 | }; | |
1318 | ||
1319 | static tree | |
1320 | find_abi_tags_r (tree *tp, int */*walk_subtrees*/, void *data) | |
1321 | { | |
73243d63 | 1322 | if (!OVERLOAD_TYPE_P (*tp)) |
7dbb85a7 JM |
1323 | return NULL_TREE; |
1324 | ||
1325 | if (tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp))) | |
1326 | { | |
1327 | struct abi_tag_data *p = static_cast<struct abi_tag_data*>(data); | |
1328 | for (tree list = TREE_VALUE (attributes); list; | |
1329 | list = TREE_CHAIN (list)) | |
1330 | { | |
1331 | tree tag = TREE_VALUE (list); | |
1332 | tree id = get_identifier (TREE_STRING_POINTER (tag)); | |
1333 | if (!IDENTIFIER_MARKED (id)) | |
1334 | { | |
1335 | if (TYPE_P (p->subob)) | |
1336 | { | |
1337 | warning (OPT_Wabi_tag, "%qT does not have the %E abi tag " | |
1338 | "that base %qT has", p->t, tag, p->subob); | |
1339 | inform (location_of (p->subob), "%qT declared here", | |
1340 | p->subob); | |
1341 | } | |
1342 | else | |
1343 | { | |
1344 | warning (OPT_Wabi_tag, "%qT does not have the %E abi tag " | |
1345 | "that %qT (used in the type of %qD) has", | |
1346 | p->t, tag, *tp, p->subob); | |
1347 | inform (location_of (p->subob), "%qD declared here", | |
1348 | p->subob); | |
1349 | inform (location_of (*tp), "%qT declared here", *tp); | |
1350 | } | |
1351 | } | |
1352 | } | |
1353 | } | |
1354 | return NULL_TREE; | |
1355 | } | |
1356 | ||
1357 | /* Check that class T has all the abi tags that subobject SUBOB has, or | |
1358 | warn if not. */ | |
1359 | ||
1360 | static void | |
1361 | check_abi_tags (tree t, tree subob) | |
1362 | { | |
1363 | tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t)); | |
1364 | if (attributes) | |
1365 | { | |
1366 | for (tree list = TREE_VALUE (attributes); list; | |
1367 | list = TREE_CHAIN (list)) | |
1368 | { | |
1369 | tree tag = TREE_VALUE (list); | |
1370 | tree id = get_identifier (TREE_STRING_POINTER (tag)); | |
1371 | IDENTIFIER_MARKED (id) = true; | |
1372 | } | |
1373 | } | |
1374 | ||
1375 | tree subtype = TYPE_P (subob) ? subob : TREE_TYPE (subob); | |
1376 | struct abi_tag_data data = { t, subob }; | |
1377 | ||
1378 | cp_walk_tree_without_duplicates (&subtype, find_abi_tags_r, &data); | |
1379 | ||
1380 | if (attributes) | |
1381 | { | |
1382 | for (tree list = TREE_VALUE (attributes); list; | |
1383 | list = TREE_CHAIN (list)) | |
1384 | { | |
1385 | tree tag = TREE_VALUE (list); | |
1386 | tree id = get_identifier (TREE_STRING_POINTER (tag)); | |
1387 | IDENTIFIER_MARKED (id) = false; | |
1388 | } | |
1389 | } | |
1390 | } | |
1391 | ||
e5e459bf AO |
1392 | /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P, |
1393 | and NO_CONST_ASN_REF_P. Also set flag bits in T based on | |
1394 | properties of the bases. */ | |
8d08fdba | 1395 | |
607cf131 | 1396 | static void |
94edc4ab | 1397 | check_bases (tree t, |
0cbd7506 | 1398 | int* cant_have_const_ctor_p, |
10746f37 | 1399 | int* no_const_asn_ref_p) |
8d08fdba | 1400 | { |
607cf131 | 1401 | int i; |
0a35513e AH |
1402 | bool seen_non_virtual_nearly_empty_base_p = 0; |
1403 | int seen_tm_mask = 0; | |
fa743e8c NS |
1404 | tree base_binfo; |
1405 | tree binfo; | |
c32097d8 | 1406 | tree field = NULL_TREE; |
8d08fdba | 1407 | |
c32097d8 | 1408 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) |
910ad8de | 1409 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
c32097d8 JM |
1410 | if (TREE_CODE (field) == FIELD_DECL) |
1411 | break; | |
1412 | ||
fa743e8c NS |
1413 | for (binfo = TYPE_BINFO (t), i = 0; |
1414 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
8d08fdba | 1415 | { |
fa743e8c | 1416 | tree basetype = TREE_TYPE (base_binfo); |
9a71c18b | 1417 | |
50bc768d | 1418 | gcc_assert (COMPLETE_TYPE_P (basetype)); |
c8094d83 | 1419 | |
486d481b VV |
1420 | if (CLASSTYPE_FINAL (basetype)) |
1421 | error ("cannot derive from %<final%> base %qT in derived type %qT", | |
1422 | basetype, t); | |
1423 | ||
3b49d762 GDR |
1424 | /* If any base class is non-literal, so is the derived class. */ |
1425 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
1426 | CLASSTYPE_LITERAL_P (t) = false; | |
1427 | ||
4c6b7393 | 1428 | /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P |
607cf131 MM |
1429 | here because the case of virtual functions but non-virtual |
1430 | dtor is handled in finish_struct_1. */ | |
74fa0285 GDR |
1431 | if (!TYPE_POLYMORPHIC_P (basetype)) |
1432 | warning (OPT_Weffc__, | |
3db45ab5 | 1433 | "base class %q#T has a non-virtual destructor", basetype); |
8d08fdba | 1434 | |
607cf131 MM |
1435 | /* If the base class doesn't have copy constructors or |
1436 | assignment operators that take const references, then the | |
1437 | derived class cannot have such a member automatically | |
1438 | generated. */ | |
d758e847 JM |
1439 | if (TYPE_HAS_COPY_CTOR (basetype) |
1440 | && ! TYPE_HAS_CONST_COPY_CTOR (basetype)) | |
607cf131 | 1441 | *cant_have_const_ctor_p = 1; |
066ec0a4 JM |
1442 | if (TYPE_HAS_COPY_ASSIGN (basetype) |
1443 | && !TYPE_HAS_CONST_COPY_ASSIGN (basetype)) | |
607cf131 | 1444 | *no_const_asn_ref_p = 1; |
8d08fdba | 1445 | |
809e3e7f | 1446 | if (BINFO_VIRTUAL_P (base_binfo)) |
00a17e31 | 1447 | /* A virtual base does not effect nearly emptiness. */ |
0fb3018c | 1448 | ; |
f9c528ea | 1449 | else if (CLASSTYPE_NEARLY_EMPTY_P (basetype)) |
0fb3018c NS |
1450 | { |
1451 | if (seen_non_virtual_nearly_empty_base_p) | |
1452 | /* And if there is more than one nearly empty base, then the | |
1453 | derived class is not nearly empty either. */ | |
1454 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
1455 | else | |
00a17e31 | 1456 | /* Remember we've seen one. */ |
0fb3018c NS |
1457 | seen_non_virtual_nearly_empty_base_p = 1; |
1458 | } | |
1459 | else if (!is_empty_class (basetype)) | |
1460 | /* If the base class is not empty or nearly empty, then this | |
1461 | class cannot be nearly empty. */ | |
1462 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
f9c528ea | 1463 | |
607cf131 MM |
1464 | /* A lot of properties from the bases also apply to the derived |
1465 | class. */ | |
8d08fdba | 1466 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype); |
c8094d83 | 1467 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 1468 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype); |
066ec0a4 | 1469 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
d758e847 JM |
1470 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype) |
1471 | || !TYPE_HAS_COPY_ASSIGN (basetype)); | |
1472 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype) | |
1473 | || !TYPE_HAS_COPY_CTOR (basetype)); | |
ac177431 JM |
1474 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |
1475 | |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype); | |
1476 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype); | |
4c6b7393 | 1477 | TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype); |
c8094d83 | 1478 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) |
5ec1192e | 1479 | |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype); |
ac177431 JM |
1480 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) |
1481 | || TYPE_HAS_COMPLEX_DFLT (basetype)); | |
c32097d8 JM |
1482 | |
1483 | /* A standard-layout class is a class that: | |
1484 | ... | |
1485 | * has no non-standard-layout base classes, */ | |
1486 | CLASSTYPE_NON_STD_LAYOUT (t) |= CLASSTYPE_NON_STD_LAYOUT (basetype); | |
1487 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) | |
1488 | { | |
1489 | tree basefield; | |
1490 | /* ...has no base classes of the same type as the first non-static | |
1491 | data member... */ | |
1492 | if (field && DECL_CONTEXT (field) == t | |
1493 | && (same_type_ignoring_top_level_qualifiers_p | |
1494 | (TREE_TYPE (field), basetype))) | |
1495 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1496 | else | |
1497 | /* ...either has no non-static data members in the most-derived | |
1498 | class and at most one base class with non-static data | |
1499 | members, or has no base classes with non-static data | |
1500 | members */ | |
1501 | for (basefield = TYPE_FIELDS (basetype); basefield; | |
910ad8de | 1502 | basefield = DECL_CHAIN (basefield)) |
c32097d8 JM |
1503 | if (TREE_CODE (basefield) == FIELD_DECL) |
1504 | { | |
1505 | if (field) | |
1506 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1507 | else | |
1508 | field = basefield; | |
1509 | break; | |
1510 | } | |
1511 | } | |
0a35513e AH |
1512 | |
1513 | /* Don't bother collecting tm attributes if transactional memory | |
1514 | support is not enabled. */ | |
1515 | if (flag_tm) | |
1516 | { | |
1517 | tree tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (basetype)); | |
1518 | if (tm_attr) | |
1519 | seen_tm_mask |= tm_attr_to_mask (tm_attr); | |
1520 | } | |
7dbb85a7 JM |
1521 | |
1522 | check_abi_tags (t, basetype); | |
0a35513e AH |
1523 | } |
1524 | ||
1525 | /* If one of the base classes had TM attributes, and the current class | |
1526 | doesn't define its own, then the current class inherits one. */ | |
1527 | if (seen_tm_mask && !find_tm_attribute (TYPE_ATTRIBUTES (t))) | |
1528 | { | |
1529 | tree tm_attr = tm_mask_to_attr (seen_tm_mask & -seen_tm_mask); | |
1530 | TYPE_ATTRIBUTES (t) = tree_cons (tm_attr, NULL, TYPE_ATTRIBUTES (t)); | |
607cf131 MM |
1531 | } |
1532 | } | |
1533 | ||
fc6633e0 NS |
1534 | /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for |
1535 | those that are primaries. Sets BINFO_LOST_PRIMARY_P for those | |
1536 | that have had a nearly-empty virtual primary base stolen by some | |
77880ae4 | 1537 | other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for |
fc6633e0 | 1538 | T. */ |
c35cce41 MM |
1539 | |
1540 | static void | |
fc6633e0 | 1541 | determine_primary_bases (tree t) |
c35cce41 | 1542 | { |
fc6633e0 NS |
1543 | unsigned i; |
1544 | tree primary = NULL_TREE; | |
1545 | tree type_binfo = TYPE_BINFO (t); | |
1546 | tree base_binfo; | |
1547 | ||
1548 | /* Determine the primary bases of our bases. */ | |
1549 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1550 | base_binfo = TREE_CHAIN (base_binfo)) | |
c35cce41 | 1551 | { |
fc6633e0 | 1552 | tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo)); |
c35cce41 | 1553 | |
fc6633e0 NS |
1554 | /* See if we're the non-virtual primary of our inheritance |
1555 | chain. */ | |
1556 | if (!BINFO_VIRTUAL_P (base_binfo)) | |
dbbf88d1 | 1557 | { |
fc6633e0 NS |
1558 | tree parent = BINFO_INHERITANCE_CHAIN (base_binfo); |
1559 | tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent)); | |
c8094d83 | 1560 | |
fc6633e0 | 1561 | if (parent_primary |
539ed333 NS |
1562 | && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), |
1563 | BINFO_TYPE (parent_primary))) | |
fc6633e0 NS |
1564 | /* We are the primary binfo. */ |
1565 | BINFO_PRIMARY_P (base_binfo) = 1; | |
1566 | } | |
1567 | /* Determine if we have a virtual primary base, and mark it so. | |
1568 | */ | |
1569 | if (primary && BINFO_VIRTUAL_P (primary)) | |
1570 | { | |
1571 | tree this_primary = copied_binfo (primary, base_binfo); | |
1572 | ||
1573 | if (BINFO_PRIMARY_P (this_primary)) | |
1574 | /* Someone already claimed this base. */ | |
1575 | BINFO_LOST_PRIMARY_P (base_binfo) = 1; | |
1576 | else | |
dbbf88d1 | 1577 | { |
fc6633e0 | 1578 | tree delta; |
c8094d83 | 1579 | |
fc6633e0 NS |
1580 | BINFO_PRIMARY_P (this_primary) = 1; |
1581 | BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo; | |
c8094d83 | 1582 | |
fc6633e0 | 1583 | /* A virtual binfo might have been copied from within |
0cbd7506 MS |
1584 | another hierarchy. As we're about to use it as a |
1585 | primary base, make sure the offsets match. */ | |
db3927fb AH |
1586 | delta = size_diffop_loc (input_location, |
1587 | convert (ssizetype, | |
fc6633e0 NS |
1588 | BINFO_OFFSET (base_binfo)), |
1589 | convert (ssizetype, | |
1590 | BINFO_OFFSET (this_primary))); | |
c8094d83 | 1591 | |
fc6633e0 | 1592 | propagate_binfo_offsets (this_primary, delta); |
dbbf88d1 NS |
1593 | } |
1594 | } | |
c35cce41 | 1595 | } |
8026246f | 1596 | |
fc6633e0 | 1597 | /* First look for a dynamic direct non-virtual base. */ |
fa743e8c | 1598 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++) |
607cf131 | 1599 | { |
607cf131 | 1600 | tree basetype = BINFO_TYPE (base_binfo); |
aff08c18 | 1601 | |
fc6633e0 | 1602 | if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo)) |
8d08fdba | 1603 | { |
fc6633e0 NS |
1604 | primary = base_binfo; |
1605 | goto found; | |
911a71a7 MM |
1606 | } |
1607 | } | |
8026246f | 1608 | |
3461fba7 | 1609 | /* A "nearly-empty" virtual base class can be the primary base |
fc6633e0 NS |
1610 | class, if no non-virtual polymorphic base can be found. Look for |
1611 | a nearly-empty virtual dynamic base that is not already a primary | |
77880ae4 | 1612 | base of something in the hierarchy. If there is no such base, |
fc6633e0 NS |
1613 | just pick the first nearly-empty virtual base. */ |
1614 | ||
1615 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1616 | base_binfo = TREE_CHAIN (base_binfo)) | |
1617 | if (BINFO_VIRTUAL_P (base_binfo) | |
1618 | && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo))) | |
1619 | { | |
1620 | if (!BINFO_PRIMARY_P (base_binfo)) | |
1621 | { | |
1622 | /* Found one that is not primary. */ | |
1623 | primary = base_binfo; | |
1624 | goto found; | |
1625 | } | |
1626 | else if (!primary) | |
1627 | /* Remember the first candidate. */ | |
1628 | primary = base_binfo; | |
1629 | } | |
c8094d83 | 1630 | |
fc6633e0 NS |
1631 | found: |
1632 | /* If we've got a primary base, use it. */ | |
1633 | if (primary) | |
7cafdb8b | 1634 | { |
fc6633e0 | 1635 | tree basetype = BINFO_TYPE (primary); |
c8094d83 | 1636 | |
fc6633e0 NS |
1637 | CLASSTYPE_PRIMARY_BINFO (t) = primary; |
1638 | if (BINFO_PRIMARY_P (primary)) | |
1639 | /* We are stealing a primary base. */ | |
1640 | BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1; | |
1641 | BINFO_PRIMARY_P (primary) = 1; | |
1642 | if (BINFO_VIRTUAL_P (primary)) | |
7cafdb8b | 1643 | { |
fc6633e0 | 1644 | tree delta; |
7cafdb8b | 1645 | |
fc6633e0 NS |
1646 | BINFO_INHERITANCE_CHAIN (primary) = type_binfo; |
1647 | /* A virtual binfo might have been copied from within | |
0cbd7506 MS |
1648 | another hierarchy. As we're about to use it as a primary |
1649 | base, make sure the offsets match. */ | |
db3927fb | 1650 | delta = size_diffop_loc (input_location, ssize_int (0), |
fc6633e0 | 1651 | convert (ssizetype, BINFO_OFFSET (primary))); |
c8094d83 | 1652 | |
fc6633e0 | 1653 | propagate_binfo_offsets (primary, delta); |
7cafdb8b | 1654 | } |
c8094d83 | 1655 | |
fc6633e0 | 1656 | primary = TYPE_BINFO (basetype); |
c8094d83 | 1657 | |
fc6633e0 NS |
1658 | TYPE_VFIELD (t) = TYPE_VFIELD (basetype); |
1659 | BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary); | |
1660 | BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary); | |
7cafdb8b | 1661 | } |
8d08fdba | 1662 | } |
e92cc029 | 1663 | |
d0940d56 DS |
1664 | /* Update the variant types of T. */ |
1665 | ||
1666 | void | |
1667 | fixup_type_variants (tree t) | |
8d08fdba | 1668 | { |
090ad434 | 1669 | tree variants; |
c8094d83 | 1670 | |
d0940d56 DS |
1671 | if (!t) |
1672 | return; | |
1673 | ||
090ad434 NS |
1674 | for (variants = TYPE_NEXT_VARIANT (t); |
1675 | variants; | |
1676 | variants = TYPE_NEXT_VARIANT (variants)) | |
8d08fdba MS |
1677 | { |
1678 | /* These fields are in the _TYPE part of the node, not in | |
1679 | the TYPE_LANG_SPECIFIC component, so they are not shared. */ | |
0fcedd9c | 1680 | TYPE_HAS_USER_CONSTRUCTOR (variants) = TYPE_HAS_USER_CONSTRUCTOR (t); |
8d08fdba | 1681 | TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t); |
c8094d83 | 1682 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants) |
834c6dff | 1683 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
8d08fdba | 1684 | |
4c6b7393 | 1685 | TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t); |
c8094d83 | 1686 | |
cad7e87b NS |
1687 | TYPE_BINFO (variants) = TYPE_BINFO (t); |
1688 | ||
8d08fdba | 1689 | /* Copy whatever these are holding today. */ |
eb34af89 RK |
1690 | TYPE_VFIELD (variants) = TYPE_VFIELD (t); |
1691 | TYPE_METHODS (variants) = TYPE_METHODS (t); | |
5566b478 | 1692 | TYPE_FIELDS (variants) = TYPE_FIELDS (t); |
8943989d JM |
1693 | } |
1694 | } | |
1695 | ||
1696 | /* Early variant fixups: we apply attributes at the beginning of the class | |
1697 | definition, and we need to fix up any variants that have already been | |
1698 | made via elaborated-type-specifier so that check_qualified_type works. */ | |
1699 | ||
1700 | void | |
1701 | fixup_attribute_variants (tree t) | |
1702 | { | |
1703 | tree variants; | |
5818c8e4 | 1704 | |
8943989d JM |
1705 | if (!t) |
1706 | return; | |
1707 | ||
1708 | for (variants = TYPE_NEXT_VARIANT (t); | |
1709 | variants; | |
1710 | variants = TYPE_NEXT_VARIANT (variants)) | |
1711 | { | |
1712 | /* These are the two fields that check_qualified_type looks at and | |
1713 | are affected by attributes. */ | |
5818c8e4 | 1714 | TYPE_ATTRIBUTES (variants) = TYPE_ATTRIBUTES (t); |
8943989d | 1715 | TYPE_ALIGN (variants) = TYPE_ALIGN (t); |
8d08fdba | 1716 | } |
d0940d56 | 1717 | } |
d0940d56 DS |
1718 | \f |
1719 | /* Set memoizing fields and bits of T (and its variants) for later | |
1720 | use. */ | |
1721 | ||
1722 | static void | |
1723 | finish_struct_bits (tree t) | |
1724 | { | |
1725 | /* Fix up variants (if any). */ | |
1726 | fixup_type_variants (t); | |
8d08fdba | 1727 | |
fa743e8c | 1728 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t)) |
16ae29f1 NS |
1729 | /* For a class w/o baseclasses, 'finish_struct' has set |
1730 | CLASSTYPE_PURE_VIRTUALS correctly (by definition). | |
132c7dd3 NS |
1731 | Similarly for a class whose base classes do not have vtables. |
1732 | When neither of these is true, we might have removed abstract | |
1733 | virtuals (by providing a definition), added some (by declaring | |
1734 | new ones), or redeclared ones from a base class. We need to | |
1735 | recalculate what's really an abstract virtual at this point (by | |
1736 | looking in the vtables). */ | |
1737 | get_pure_virtuals (t); | |
c8094d83 | 1738 | |
132c7dd3 NS |
1739 | /* If this type has a copy constructor or a destructor, force its |
1740 | mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be | |
1741 | nonzero. This will cause it to be passed by invisible reference | |
1742 | and prevent it from being returned in a register. */ | |
d758e847 JM |
1743 | if (type_has_nontrivial_copy_init (t) |
1744 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
8d08fdba | 1745 | { |
e8abc66f | 1746 | tree variants; |
d2e5ee5c | 1747 | DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode; |
e8abc66f | 1748 | for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants)) |
8d08fdba | 1749 | { |
179d2f74 | 1750 | SET_TYPE_MODE (variants, BLKmode); |
8d08fdba | 1751 | TREE_ADDRESSABLE (variants) = 1; |
8d08fdba MS |
1752 | } |
1753 | } | |
1754 | } | |
1755 | ||
b0e0b31f | 1756 | /* Issue warnings about T having private constructors, but no friends, |
c8094d83 | 1757 | and so forth. |
aed7b2a6 | 1758 | |
b0e0b31f MM |
1759 | HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or |
1760 | static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any | |
1761 | non-private static member functions. */ | |
1762 | ||
1763 | static void | |
94edc4ab | 1764 | maybe_warn_about_overly_private_class (tree t) |
aed7b2a6 | 1765 | { |
056a3b12 MM |
1766 | int has_member_fn = 0; |
1767 | int has_nonprivate_method = 0; | |
1768 | tree fn; | |
1769 | ||
1770 | if (!warn_ctor_dtor_privacy | |
b0e0b31f MM |
1771 | /* If the class has friends, those entities might create and |
1772 | access instances, so we should not warn. */ | |
056a3b12 MM |
1773 | || (CLASSTYPE_FRIEND_CLASSES (t) |
1774 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))) | |
b0e0b31f MM |
1775 | /* We will have warned when the template was declared; there's |
1776 | no need to warn on every instantiation. */ | |
056a3b12 | 1777 | || CLASSTYPE_TEMPLATE_INSTANTIATION (t)) |
c8094d83 | 1778 | /* There's no reason to even consider warning about this |
056a3b12 MM |
1779 | class. */ |
1780 | return; | |
c8094d83 | 1781 | |
056a3b12 MM |
1782 | /* We only issue one warning, if more than one applies, because |
1783 | otherwise, on code like: | |
1784 | ||
1785 | class A { | |
1786 | // Oops - forgot `public:' | |
1787 | A(); | |
1788 | A(const A&); | |
1789 | ~A(); | |
1790 | }; | |
1791 | ||
1792 | we warn several times about essentially the same problem. */ | |
1793 | ||
1794 | /* Check to see if all (non-constructor, non-destructor) member | |
1795 | functions are private. (Since there are no friends or | |
1796 | non-private statics, we can't ever call any of the private member | |
1797 | functions.) */ | |
910ad8de | 1798 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
056a3b12 MM |
1799 | /* We're not interested in compiler-generated methods; they don't |
1800 | provide any way to call private members. */ | |
c8094d83 | 1801 | if (!DECL_ARTIFICIAL (fn)) |
056a3b12 MM |
1802 | { |
1803 | if (!TREE_PRIVATE (fn)) | |
b0e0b31f | 1804 | { |
c8094d83 | 1805 | if (DECL_STATIC_FUNCTION_P (fn)) |
056a3b12 MM |
1806 | /* A non-private static member function is just like a |
1807 | friend; it can create and invoke private member | |
1808 | functions, and be accessed without a class | |
1809 | instance. */ | |
1810 | return; | |
c8094d83 | 1811 | |
056a3b12 | 1812 | has_nonprivate_method = 1; |
f576dfc4 | 1813 | /* Keep searching for a static member function. */ |
056a3b12 | 1814 | } |
ce0a5952 | 1815 | else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn)) |
056a3b12 | 1816 | has_member_fn = 1; |
c8094d83 | 1817 | } |
aed7b2a6 | 1818 | |
c8094d83 | 1819 | if (!has_nonprivate_method && has_member_fn) |
056a3b12 | 1820 | { |
ce0a5952 MM |
1821 | /* There are no non-private methods, and there's at least one |
1822 | private member function that isn't a constructor or | |
1823 | destructor. (If all the private members are | |
1824 | constructors/destructors we want to use the code below that | |
1825 | issues error messages specifically referring to | |
1826 | constructors/destructors.) */ | |
fa743e8c | 1827 | unsigned i; |
dbbf88d1 | 1828 | tree binfo = TYPE_BINFO (t); |
c8094d83 | 1829 | |
fa743e8c | 1830 | for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++) |
604a3205 | 1831 | if (BINFO_BASE_ACCESS (binfo, i) != access_private_node) |
056a3b12 MM |
1832 | { |
1833 | has_nonprivate_method = 1; | |
1834 | break; | |
1835 | } | |
c8094d83 | 1836 | if (!has_nonprivate_method) |
b0e0b31f | 1837 | { |
74fa0285 | 1838 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1839 | "all member functions in class %qT are private", t); |
056a3b12 | 1840 | return; |
b0e0b31f | 1841 | } |
056a3b12 | 1842 | } |
aed7b2a6 | 1843 | |
056a3b12 MM |
1844 | /* Even if some of the member functions are non-private, the class |
1845 | won't be useful for much if all the constructors or destructors | |
1846 | are private: such an object can never be created or destroyed. */ | |
9f4faeae MM |
1847 | fn = CLASSTYPE_DESTRUCTORS (t); |
1848 | if (fn && TREE_PRIVATE (fn)) | |
056a3b12 | 1849 | { |
74fa0285 | 1850 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1851 | "%q#T only defines a private destructor and has no friends", |
4b0d3cbe MM |
1852 | t); |
1853 | return; | |
056a3b12 | 1854 | } |
b0e0b31f | 1855 | |
0fcedd9c JM |
1856 | /* Warn about classes that have private constructors and no friends. */ |
1857 | if (TYPE_HAS_USER_CONSTRUCTOR (t) | |
550d1bf4 MM |
1858 | /* Implicitly generated constructors are always public. */ |
1859 | && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t) | |
1860 | || !CLASSTYPE_LAZY_COPY_CTOR (t))) | |
056a3b12 MM |
1861 | { |
1862 | int nonprivate_ctor = 0; | |
c8094d83 | 1863 | |
056a3b12 MM |
1864 | /* If a non-template class does not define a copy |
1865 | constructor, one is defined for it, enabling it to avoid | |
1866 | this warning. For a template class, this does not | |
1867 | happen, and so we would normally get a warning on: | |
b0e0b31f | 1868 | |
c8094d83 MS |
1869 | template <class T> class C { private: C(); }; |
1870 | ||
066ec0a4 | 1871 | To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All |
056a3b12 MM |
1872 | complete non-template or fully instantiated classes have this |
1873 | flag set. */ | |
066ec0a4 | 1874 | if (!TYPE_HAS_COPY_CTOR (t)) |
056a3b12 | 1875 | nonprivate_ctor = 1; |
c8094d83 MS |
1876 | else |
1877 | for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn)) | |
056a3b12 MM |
1878 | { |
1879 | tree ctor = OVL_CURRENT (fn); | |
1880 | /* Ideally, we wouldn't count copy constructors (or, in | |
1881 | fact, any constructor that takes an argument of the | |
1882 | class type as a parameter) because such things cannot | |
1883 | be used to construct an instance of the class unless | |
1884 | you already have one. But, for now at least, we're | |
1885 | more generous. */ | |
1886 | if (! TREE_PRIVATE (ctor)) | |
b0e0b31f | 1887 | { |
056a3b12 MM |
1888 | nonprivate_ctor = 1; |
1889 | break; | |
b0e0b31f | 1890 | } |
056a3b12 | 1891 | } |
aed7b2a6 | 1892 | |
056a3b12 MM |
1893 | if (nonprivate_ctor == 0) |
1894 | { | |
74fa0285 | 1895 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1896 | "%q#T only defines private constructors and has no friends", |
0cbd7506 | 1897 | t); |
056a3b12 | 1898 | return; |
b0e0b31f MM |
1899 | } |
1900 | } | |
aed7b2a6 MM |
1901 | } |
1902 | ||
17211ab5 GK |
1903 | static struct { |
1904 | gt_pointer_operator new_value; | |
1905 | void *cookie; | |
1906 | } resort_data; | |
1907 | ||
f90cdf34 MT |
1908 | /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */ |
1909 | ||
1910 | static int | |
94edc4ab | 1911 | method_name_cmp (const void* m1_p, const void* m2_p) |
f90cdf34 | 1912 | { |
67f5655f GDR |
1913 | const tree *const m1 = (const tree *) m1_p; |
1914 | const tree *const m2 = (const tree *) m2_p; | |
c8094d83 | 1915 | |
f90cdf34 MT |
1916 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
1917 | return 0; | |
1918 | if (*m1 == NULL_TREE) | |
1919 | return -1; | |
1920 | if (*m2 == NULL_TREE) | |
1921 | return 1; | |
1922 | if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2))) | |
1923 | return -1; | |
1924 | return 1; | |
1925 | } | |
b0e0b31f | 1926 | |
17211ab5 GK |
1927 | /* This routine compares two fields like method_name_cmp but using the |
1928 | pointer operator in resort_field_decl_data. */ | |
1929 | ||
1930 | static int | |
94edc4ab | 1931 | resort_method_name_cmp (const void* m1_p, const void* m2_p) |
17211ab5 | 1932 | { |
67f5655f GDR |
1933 | const tree *const m1 = (const tree *) m1_p; |
1934 | const tree *const m2 = (const tree *) m2_p; | |
17211ab5 GK |
1935 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
1936 | return 0; | |
1937 | if (*m1 == NULL_TREE) | |
1938 | return -1; | |
1939 | if (*m2 == NULL_TREE) | |
1940 | return 1; | |
1941 | { | |
1942 | tree d1 = DECL_NAME (OVL_CURRENT (*m1)); | |
1943 | tree d2 = DECL_NAME (OVL_CURRENT (*m2)); | |
1944 | resort_data.new_value (&d1, resort_data.cookie); | |
1945 | resort_data.new_value (&d2, resort_data.cookie); | |
1946 | if (d1 < d2) | |
1947 | return -1; | |
1948 | } | |
1949 | return 1; | |
1950 | } | |
1951 | ||
1952 | /* Resort TYPE_METHOD_VEC because pointers have been reordered. */ | |
1953 | ||
c8094d83 | 1954 | void |
94edc4ab | 1955 | resort_type_method_vec (void* obj, |
12308bc6 | 1956 | void* /*orig_obj*/, |
0cbd7506 MS |
1957 | gt_pointer_operator new_value, |
1958 | void* cookie) | |
17211ab5 | 1959 | { |
9771b263 DN |
1960 | vec<tree, va_gc> *method_vec = (vec<tree, va_gc> *) obj; |
1961 | int len = vec_safe_length (method_vec); | |
aaaa46d2 MM |
1962 | size_t slot; |
1963 | tree fn; | |
17211ab5 GK |
1964 | |
1965 | /* The type conversion ops have to live at the front of the vec, so we | |
1966 | can't sort them. */ | |
aaaa46d2 | 1967 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 1968 | vec_safe_iterate (method_vec, slot, &fn); |
aaaa46d2 MM |
1969 | ++slot) |
1970 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn))) | |
1971 | break; | |
1972 | ||
17211ab5 GK |
1973 | if (len - slot > 1) |
1974 | { | |
1975 | resort_data.new_value = new_value; | |
1976 | resort_data.cookie = cookie; | |
9771b263 | 1977 | qsort (method_vec->address () + slot, len - slot, sizeof (tree), |
17211ab5 GK |
1978 | resort_method_name_cmp); |
1979 | } | |
1980 | } | |
1981 | ||
c7222c02 | 1982 | /* Warn about duplicate methods in fn_fields. |
8d08fdba | 1983 | |
5b0cec3b MM |
1984 | Sort methods that are not special (i.e., constructors, destructors, |
1985 | and type conversion operators) so that we can find them faster in | |
1986 | search. */ | |
8d08fdba | 1987 | |
b0e0b31f | 1988 | static void |
94edc4ab | 1989 | finish_struct_methods (tree t) |
8d08fdba | 1990 | { |
b0e0b31f | 1991 | tree fn_fields; |
9771b263 | 1992 | vec<tree, va_gc> *method_vec; |
58010b57 MM |
1993 | int slot, len; |
1994 | ||
58010b57 | 1995 | method_vec = CLASSTYPE_METHOD_VEC (t); |
508a1c9c MM |
1996 | if (!method_vec) |
1997 | return; | |
1998 | ||
9771b263 | 1999 | len = method_vec->length (); |
8d08fdba | 2000 | |
c7222c02 | 2001 | /* Clear DECL_IN_AGGR_P for all functions. */ |
c8094d83 | 2002 | for (fn_fields = TYPE_METHODS (t); fn_fields; |
910ad8de | 2003 | fn_fields = DECL_CHAIN (fn_fields)) |
5b0cec3b | 2004 | DECL_IN_AGGR_P (fn_fields) = 0; |
8d08fdba | 2005 | |
b0e0b31f MM |
2006 | /* Issue warnings about private constructors and such. If there are |
2007 | no methods, then some public defaults are generated. */ | |
f90cdf34 MT |
2008 | maybe_warn_about_overly_private_class (t); |
2009 | ||
f90cdf34 MT |
2010 | /* The type conversion ops have to live at the front of the vec, so we |
2011 | can't sort them. */ | |
9ba5ff0f | 2012 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2013 | method_vec->iterate (slot, &fn_fields); |
aaaa46d2 MM |
2014 | ++slot) |
2015 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields))) | |
2016 | break; | |
f90cdf34 | 2017 | if (len - slot > 1) |
9771b263 | 2018 | qsort (method_vec->address () + slot, |
aaaa46d2 | 2019 | len-slot, sizeof (tree), method_name_cmp); |
8d08fdba MS |
2020 | } |
2021 | ||
90ecce3e | 2022 | /* Make BINFO's vtable have N entries, including RTTI entries, |
3b426391 | 2023 | vbase and vcall offsets, etc. Set its type and call the back end |
8d7a5379 | 2024 | to lay it out. */ |
1a588ad7 MM |
2025 | |
2026 | static void | |
94edc4ab | 2027 | layout_vtable_decl (tree binfo, int n) |
1a588ad7 | 2028 | { |
1a588ad7 | 2029 | tree atype; |
c35cce41 | 2030 | tree vtable; |
1a588ad7 | 2031 | |
dcedcddb | 2032 | atype = build_array_of_n_type (vtable_entry_type, n); |
1a588ad7 MM |
2033 | layout_type (atype); |
2034 | ||
2035 | /* We may have to grow the vtable. */ | |
c35cce41 MM |
2036 | vtable = get_vtbl_decl_for_binfo (binfo); |
2037 | if (!same_type_p (TREE_TYPE (vtable), atype)) | |
1a588ad7 | 2038 | { |
06ceef4e | 2039 | TREE_TYPE (vtable) = atype; |
c35cce41 | 2040 | DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE; |
06ceef4e | 2041 | layout_decl (vtable, 0); |
1a588ad7 MM |
2042 | } |
2043 | } | |
2044 | ||
9bab6c90 MM |
2045 | /* True iff FNDECL and BASE_FNDECL (both non-static member functions) |
2046 | have the same signature. */ | |
83f2ccf4 | 2047 | |
e0fff4b3 | 2048 | int |
58f9752a | 2049 | same_signature_p (const_tree fndecl, const_tree base_fndecl) |
83f2ccf4 | 2050 | { |
872f37f9 MM |
2051 | /* One destructor overrides another if they are the same kind of |
2052 | destructor. */ | |
2053 | if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl) | |
2054 | && special_function_p (base_fndecl) == special_function_p (fndecl)) | |
ca36f057 | 2055 | return 1; |
872f37f9 MM |
2056 | /* But a non-destructor never overrides a destructor, nor vice |
2057 | versa, nor do different kinds of destructors override | |
2058 | one-another. For example, a complete object destructor does not | |
2059 | override a deleting destructor. */ | |
0d9eb3ba | 2060 | if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl)) |
ca36f057 | 2061 | return 0; |
872f37f9 | 2062 | |
a6c0d772 MM |
2063 | if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl) |
2064 | || (DECL_CONV_FN_P (fndecl) | |
2065 | && DECL_CONV_FN_P (base_fndecl) | |
2066 | && same_type_p (DECL_CONV_FN_TYPE (fndecl), | |
2067 | DECL_CONV_FN_TYPE (base_fndecl)))) | |
83f2ccf4 | 2068 | { |
c4101929 JM |
2069 | tree fntype = TREE_TYPE (fndecl); |
2070 | tree base_fntype = TREE_TYPE (base_fndecl); | |
2071 | if (type_memfn_quals (fntype) == type_memfn_quals (base_fntype) | |
2072 | && type_memfn_rqual (fntype) == type_memfn_rqual (base_fntype) | |
2073 | && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl), | |
2074 | FUNCTION_FIRST_USER_PARMTYPE (base_fndecl))) | |
ca36f057 | 2075 | return 1; |
83f2ccf4 | 2076 | } |
ca36f057 | 2077 | return 0; |
83f2ccf4 MM |
2078 | } |
2079 | ||
9368208b MM |
2080 | /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a |
2081 | subobject. */ | |
c8094d83 | 2082 | |
9368208b MM |
2083 | static bool |
2084 | base_derived_from (tree derived, tree base) | |
2085 | { | |
dbbf88d1 NS |
2086 | tree probe; |
2087 | ||
2088 | for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
2089 | { | |
2090 | if (probe == derived) | |
2091 | return true; | |
809e3e7f | 2092 | else if (BINFO_VIRTUAL_P (probe)) |
dbbf88d1 NS |
2093 | /* If we meet a virtual base, we can't follow the inheritance |
2094 | any more. See if the complete type of DERIVED contains | |
2095 | such a virtual base. */ | |
58c42dc2 NS |
2096 | return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived)) |
2097 | != NULL_TREE); | |
dbbf88d1 NS |
2098 | } |
2099 | return false; | |
9368208b MM |
2100 | } |
2101 | ||
ca36f057 MM |
2102 | typedef struct find_final_overrider_data_s { |
2103 | /* The function for which we are trying to find a final overrider. */ | |
2104 | tree fn; | |
2105 | /* The base class in which the function was declared. */ | |
2106 | tree declaring_base; | |
9368208b | 2107 | /* The candidate overriders. */ |
78b45a24 | 2108 | tree candidates; |
5d5a519f | 2109 | /* Path to most derived. */ |
9771b263 | 2110 | vec<tree> path; |
ca36f057 | 2111 | } find_final_overrider_data; |
8d7a5379 | 2112 | |
f7a8132a MM |
2113 | /* Add the overrider along the current path to FFOD->CANDIDATES. |
2114 | Returns true if an overrider was found; false otherwise. */ | |
8d7a5379 | 2115 | |
f7a8132a | 2116 | static bool |
c8094d83 | 2117 | dfs_find_final_overrider_1 (tree binfo, |
5d5a519f NS |
2118 | find_final_overrider_data *ffod, |
2119 | unsigned depth) | |
7177d104 | 2120 | { |
741d8ca3 MM |
2121 | tree method; |
2122 | ||
f7a8132a MM |
2123 | /* If BINFO is not the most derived type, try a more derived class. |
2124 | A definition there will overrider a definition here. */ | |
5d5a519f | 2125 | if (depth) |
dbbf88d1 | 2126 | { |
5d5a519f NS |
2127 | depth--; |
2128 | if (dfs_find_final_overrider_1 | |
9771b263 | 2129 | (ffod->path[depth], ffod, depth)) |
f7a8132a MM |
2130 | return true; |
2131 | } | |
dbbf88d1 | 2132 | |
741d8ca3 | 2133 | method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn); |
f7a8132a MM |
2134 | if (method) |
2135 | { | |
2136 | tree *candidate = &ffod->candidates; | |
c8094d83 | 2137 | |
f7a8132a MM |
2138 | /* Remove any candidates overridden by this new function. */ |
2139 | while (*candidate) | |
8d7a5379 | 2140 | { |
f7a8132a MM |
2141 | /* If *CANDIDATE overrides METHOD, then METHOD |
2142 | cannot override anything else on the list. */ | |
2143 | if (base_derived_from (TREE_VALUE (*candidate), binfo)) | |
2144 | return true; | |
2145 | /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */ | |
2146 | if (base_derived_from (binfo, TREE_VALUE (*candidate))) | |
2147 | *candidate = TREE_CHAIN (*candidate); | |
dbbf88d1 | 2148 | else |
f7a8132a | 2149 | candidate = &TREE_CHAIN (*candidate); |
5e19c053 | 2150 | } |
c8094d83 | 2151 | |
f7a8132a MM |
2152 | /* Add the new function. */ |
2153 | ffod->candidates = tree_cons (method, binfo, ffod->candidates); | |
2154 | return true; | |
dbbf88d1 | 2155 | } |
5e19c053 | 2156 | |
f7a8132a MM |
2157 | return false; |
2158 | } | |
2159 | ||
2160 | /* Called from find_final_overrider via dfs_walk. */ | |
2161 | ||
2162 | static tree | |
5d5a519f | 2163 | dfs_find_final_overrider_pre (tree binfo, void *data) |
f7a8132a MM |
2164 | { |
2165 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; | |
2166 | ||
2167 | if (binfo == ffod->declaring_base) | |
9771b263 DN |
2168 | dfs_find_final_overrider_1 (binfo, ffod, ffod->path.length ()); |
2169 | ffod->path.safe_push (binfo); | |
f7a8132a | 2170 | |
dbbf88d1 NS |
2171 | return NULL_TREE; |
2172 | } | |
db3d8cde | 2173 | |
dbbf88d1 | 2174 | static tree |
12308bc6 | 2175 | dfs_find_final_overrider_post (tree /*binfo*/, void *data) |
dbbf88d1 | 2176 | { |
dbbf88d1 | 2177 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; |
9771b263 | 2178 | ffod->path.pop (); |
78b45a24 | 2179 | |
dd42e135 MM |
2180 | return NULL_TREE; |
2181 | } | |
2182 | ||
5e19c053 MM |
2183 | /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for |
2184 | FN and whose TREE_VALUE is the binfo for the base where the | |
95675950 MM |
2185 | overriding occurs. BINFO (in the hierarchy dominated by the binfo |
2186 | DERIVED) is the base object in which FN is declared. */ | |
e92cc029 | 2187 | |
a292b002 | 2188 | static tree |
94edc4ab | 2189 | find_final_overrider (tree derived, tree binfo, tree fn) |
a292b002 | 2190 | { |
5e19c053 | 2191 | find_final_overrider_data ffod; |
a292b002 | 2192 | |
0e339752 | 2193 | /* Getting this right is a little tricky. This is valid: |
a292b002 | 2194 | |
5e19c053 MM |
2195 | struct S { virtual void f (); }; |
2196 | struct T { virtual void f (); }; | |
2197 | struct U : public S, public T { }; | |
a292b002 | 2198 | |
c8094d83 | 2199 | even though calling `f' in `U' is ambiguous. But, |
a292b002 | 2200 | |
5e19c053 MM |
2201 | struct R { virtual void f(); }; |
2202 | struct S : virtual public R { virtual void f (); }; | |
2203 | struct T : virtual public R { virtual void f (); }; | |
2204 | struct U : public S, public T { }; | |
dd42e135 | 2205 | |
d0cd8b44 | 2206 | is not -- there's no way to decide whether to put `S::f' or |
c8094d83 MS |
2207 | `T::f' in the vtable for `R'. |
2208 | ||
5e19c053 MM |
2209 | The solution is to look at all paths to BINFO. If we find |
2210 | different overriders along any two, then there is a problem. */ | |
07fa4878 NS |
2211 | if (DECL_THUNK_P (fn)) |
2212 | fn = THUNK_TARGET (fn); | |
f7a8132a MM |
2213 | |
2214 | /* Determine the depth of the hierarchy. */ | |
5e19c053 MM |
2215 | ffod.fn = fn; |
2216 | ffod.declaring_base = binfo; | |
78b45a24 | 2217 | ffod.candidates = NULL_TREE; |
9771b263 | 2218 | ffod.path.create (30); |
5e19c053 | 2219 | |
5d5a519f NS |
2220 | dfs_walk_all (derived, dfs_find_final_overrider_pre, |
2221 | dfs_find_final_overrider_post, &ffod); | |
f7a8132a | 2222 | |
9771b263 | 2223 | ffod.path.release (); |
c8094d83 | 2224 | |
78b45a24 | 2225 | /* If there was no winner, issue an error message. */ |
9368208b | 2226 | if (!ffod.candidates || TREE_CHAIN (ffod.candidates)) |
16a1369e | 2227 | return error_mark_node; |
dd42e135 | 2228 | |
9368208b | 2229 | return ffod.candidates; |
a292b002 MS |
2230 | } |
2231 | ||
548502d3 MM |
2232 | /* Return the index of the vcall offset for FN when TYPE is used as a |
2233 | virtual base. */ | |
d0cd8b44 | 2234 | |
d0cd8b44 | 2235 | static tree |
548502d3 | 2236 | get_vcall_index (tree fn, tree type) |
d0cd8b44 | 2237 | { |
9771b263 | 2238 | vec<tree_pair_s, va_gc> *indices = CLASSTYPE_VCALL_INDICES (type); |
0871761b NS |
2239 | tree_pair_p p; |
2240 | unsigned ix; | |
d0cd8b44 | 2241 | |
9771b263 | 2242 | FOR_EACH_VEC_SAFE_ELT (indices, ix, p) |
0871761b NS |
2243 | if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose)) |
2244 | || same_signature_p (fn, p->purpose)) | |
2245 | return p->value; | |
548502d3 MM |
2246 | |
2247 | /* There should always be an appropriate index. */ | |
8dc2b103 | 2248 | gcc_unreachable (); |
d0cd8b44 | 2249 | } |
d0cd8b44 JM |
2250 | |
2251 | /* Update an entry in the vtable for BINFO, which is in the hierarchy | |
bf1cb49e JM |
2252 | dominated by T. FN is the old function; VIRTUALS points to the |
2253 | corresponding position in the new BINFO_VIRTUALS list. IX is the index | |
2254 | of that entry in the list. */ | |
4e7512c9 MM |
2255 | |
2256 | static void | |
a2ddc397 NS |
2257 | update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals, |
2258 | unsigned ix) | |
4e7512c9 MM |
2259 | { |
2260 | tree b; | |
2261 | tree overrider; | |
4e7512c9 | 2262 | tree delta; |
31f8e4f3 | 2263 | tree virtual_base; |
d0cd8b44 | 2264 | tree first_defn; |
3cfabe60 NS |
2265 | tree overrider_fn, overrider_target; |
2266 | tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn; | |
2267 | tree over_return, base_return; | |
f11ee281 | 2268 | bool lost = false; |
4e7512c9 | 2269 | |
d0cd8b44 JM |
2270 | /* Find the nearest primary base (possibly binfo itself) which defines |
2271 | this function; this is the class the caller will convert to when | |
2272 | calling FN through BINFO. */ | |
2273 | for (b = binfo; ; b = get_primary_binfo (b)) | |
4e7512c9 | 2274 | { |
50bc768d | 2275 | gcc_assert (b); |
3cfabe60 | 2276 | if (look_for_overrides_here (BINFO_TYPE (b), target_fn)) |
31f8e4f3 | 2277 | break; |
f11ee281 JM |
2278 | |
2279 | /* The nearest definition is from a lost primary. */ | |
2280 | if (BINFO_LOST_PRIMARY_P (b)) | |
2281 | lost = true; | |
4e7512c9 | 2282 | } |
d0cd8b44 | 2283 | first_defn = b; |
4e7512c9 | 2284 | |
31f8e4f3 | 2285 | /* Find the final overrider. */ |
3cfabe60 | 2286 | overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn); |
4e7512c9 | 2287 | if (overrider == error_mark_node) |
16a1369e JJ |
2288 | { |
2289 | error ("no unique final overrider for %qD in %qT", target_fn, t); | |
2290 | return; | |
2291 | } | |
3cfabe60 | 2292 | overrider_target = overrider_fn = TREE_PURPOSE (overrider); |
c8094d83 | 2293 | |
9bcb9aae | 2294 | /* Check for adjusting covariant return types. */ |
3cfabe60 NS |
2295 | over_return = TREE_TYPE (TREE_TYPE (overrider_target)); |
2296 | base_return = TREE_TYPE (TREE_TYPE (target_fn)); | |
c8094d83 | 2297 | |
3cfabe60 NS |
2298 | if (POINTER_TYPE_P (over_return) |
2299 | && TREE_CODE (over_return) == TREE_CODE (base_return) | |
2300 | && CLASS_TYPE_P (TREE_TYPE (over_return)) | |
b77fe7b4 NS |
2301 | && CLASS_TYPE_P (TREE_TYPE (base_return)) |
2302 | /* If the overrider is invalid, don't even try. */ | |
2303 | && !DECL_INVALID_OVERRIDER_P (overrider_target)) | |
3cfabe60 NS |
2304 | { |
2305 | /* If FN is a covariant thunk, we must figure out the adjustment | |
0cbd7506 MS |
2306 | to the final base FN was converting to. As OVERRIDER_TARGET might |
2307 | also be converting to the return type of FN, we have to | |
2308 | combine the two conversions here. */ | |
3cfabe60 | 2309 | tree fixed_offset, virtual_offset; |
12a669d1 NS |
2310 | |
2311 | over_return = TREE_TYPE (over_return); | |
2312 | base_return = TREE_TYPE (base_return); | |
c8094d83 | 2313 | |
3cfabe60 NS |
2314 | if (DECL_THUNK_P (fn)) |
2315 | { | |
50bc768d | 2316 | gcc_assert (DECL_RESULT_THUNK_P (fn)); |
3cfabe60 NS |
2317 | fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn)); |
2318 | virtual_offset = THUNK_VIRTUAL_OFFSET (fn); | |
3cfabe60 NS |
2319 | } |
2320 | else | |
2321 | fixed_offset = virtual_offset = NULL_TREE; | |
4977bab6 | 2322 | |
e00853fd NS |
2323 | if (virtual_offset) |
2324 | /* Find the equivalent binfo within the return type of the | |
2325 | overriding function. We will want the vbase offset from | |
2326 | there. */ | |
58c42dc2 | 2327 | virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset), |
12a669d1 NS |
2328 | over_return); |
2329 | else if (!same_type_ignoring_top_level_qualifiers_p | |
2330 | (over_return, base_return)) | |
3cfabe60 NS |
2331 | { |
2332 | /* There was no existing virtual thunk (which takes | |
12a669d1 NS |
2333 | precedence). So find the binfo of the base function's |
2334 | return type within the overriding function's return type. | |
2335 | We cannot call lookup base here, because we're inside a | |
2336 | dfs_walk, and will therefore clobber the BINFO_MARKED | |
2337 | flags. Fortunately we know the covariancy is valid (it | |
2338 | has already been checked), so we can just iterate along | |
2339 | the binfos, which have been chained in inheritance graph | |
2340 | order. Of course it is lame that we have to repeat the | |
2341 | search here anyway -- we should really be caching pieces | |
2342 | of the vtable and avoiding this repeated work. */ | |
2343 | tree thunk_binfo, base_binfo; | |
2344 | ||
2345 | /* Find the base binfo within the overriding function's | |
742f25b3 NS |
2346 | return type. We will always find a thunk_binfo, except |
2347 | when the covariancy is invalid (which we will have | |
2348 | already diagnosed). */ | |
12a669d1 NS |
2349 | for (base_binfo = TYPE_BINFO (base_return), |
2350 | thunk_binfo = TYPE_BINFO (over_return); | |
742f25b3 | 2351 | thunk_binfo; |
12a669d1 | 2352 | thunk_binfo = TREE_CHAIN (thunk_binfo)) |
742f25b3 NS |
2353 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo), |
2354 | BINFO_TYPE (base_binfo))) | |
2355 | break; | |
c8094d83 | 2356 | |
12a669d1 NS |
2357 | /* See if virtual inheritance is involved. */ |
2358 | for (virtual_offset = thunk_binfo; | |
2359 | virtual_offset; | |
2360 | virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset)) | |
2361 | if (BINFO_VIRTUAL_P (virtual_offset)) | |
2362 | break; | |
c8094d83 | 2363 | |
742f25b3 NS |
2364 | if (virtual_offset |
2365 | || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo))) | |
3cfabe60 | 2366 | { |
bb885938 | 2367 | tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo)); |
8d1f0f67 | 2368 | |
12a669d1 | 2369 | if (virtual_offset) |
3cfabe60 | 2370 | { |
12a669d1 NS |
2371 | /* We convert via virtual base. Adjust the fixed |
2372 | offset to be from there. */ | |
db3927fb AH |
2373 | offset = |
2374 | size_diffop (offset, | |
2375 | convert (ssizetype, | |
2376 | BINFO_OFFSET (virtual_offset))); | |
3cfabe60 NS |
2377 | } |
2378 | if (fixed_offset) | |
2379 | /* There was an existing fixed offset, this must be | |
2380 | from the base just converted to, and the base the | |
2381 | FN was thunking to. */ | |
2382 | fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset); | |
2383 | else | |
2384 | fixed_offset = offset; | |
2385 | } | |
2386 | } | |
c8094d83 | 2387 | |
3cfabe60 NS |
2388 | if (fixed_offset || virtual_offset) |
2389 | /* Replace the overriding function with a covariant thunk. We | |
2390 | will emit the overriding function in its own slot as | |
9bcb9aae | 2391 | well. */ |
3cfabe60 NS |
2392 | overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0, |
2393 | fixed_offset, virtual_offset); | |
2394 | } | |
2395 | else | |
49fedf5a SM |
2396 | gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) || |
2397 | !DECL_THUNK_P (fn)); | |
c8094d83 | 2398 | |
02dea3ff JM |
2399 | /* If we need a covariant thunk, then we may need to adjust first_defn. |
2400 | The ABI specifies that the thunks emitted with a function are | |
2401 | determined by which bases the function overrides, so we need to be | |
2402 | sure that we're using a thunk for some overridden base; even if we | |
2403 | know that the necessary this adjustment is zero, there may not be an | |
2404 | appropriate zero-this-adjusment thunk for us to use since thunks for | |
2405 | overriding virtual bases always use the vcall offset. | |
2406 | ||
2407 | Furthermore, just choosing any base that overrides this function isn't | |
2408 | quite right, as this slot won't be used for calls through a type that | |
2409 | puts a covariant thunk here. Calling the function through such a type | |
2410 | will use a different slot, and that slot is the one that determines | |
2411 | the thunk emitted for that base. | |
2412 | ||
2413 | So, keep looking until we find the base that we're really overriding | |
2414 | in this slot: the nearest primary base that doesn't use a covariant | |
2415 | thunk in this slot. */ | |
2416 | if (overrider_target != overrider_fn) | |
2417 | { | |
2418 | if (BINFO_TYPE (b) == DECL_CONTEXT (overrider_target)) | |
2419 | /* We already know that the overrider needs a covariant thunk. */ | |
2420 | b = get_primary_binfo (b); | |
2421 | for (; ; b = get_primary_binfo (b)) | |
2422 | { | |
2423 | tree main_binfo = TYPE_BINFO (BINFO_TYPE (b)); | |
2424 | tree bv = chain_index (ix, BINFO_VIRTUALS (main_binfo)); | |
02dea3ff JM |
2425 | if (!DECL_THUNK_P (TREE_VALUE (bv))) |
2426 | break; | |
2c1fb3ee JM |
2427 | if (BINFO_LOST_PRIMARY_P (b)) |
2428 | lost = true; | |
02dea3ff JM |
2429 | } |
2430 | first_defn = b; | |
2431 | } | |
2432 | ||
31f8e4f3 MM |
2433 | /* Assume that we will produce a thunk that convert all the way to |
2434 | the final overrider, and not to an intermediate virtual base. */ | |
9ccf6541 | 2435 | virtual_base = NULL_TREE; |
31f8e4f3 | 2436 | |
f11ee281 | 2437 | /* See if we can convert to an intermediate virtual base first, and then |
3461fba7 | 2438 | use the vcall offset located there to finish the conversion. */ |
f11ee281 | 2439 | for (; b; b = BINFO_INHERITANCE_CHAIN (b)) |
4e7512c9 | 2440 | { |
d0cd8b44 JM |
2441 | /* If we find the final overrider, then we can stop |
2442 | walking. */ | |
539ed333 NS |
2443 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (b), |
2444 | BINFO_TYPE (TREE_VALUE (overrider)))) | |
1f84ec23 | 2445 | break; |
31f8e4f3 | 2446 | |
d0cd8b44 JM |
2447 | /* If we find a virtual base, and we haven't yet found the |
2448 | overrider, then there is a virtual base between the | |
2449 | declaring base (first_defn) and the final overrider. */ | |
809e3e7f | 2450 | if (BINFO_VIRTUAL_P (b)) |
dbbf88d1 NS |
2451 | { |
2452 | virtual_base = b; | |
2453 | break; | |
2454 | } | |
4e7512c9 | 2455 | } |
4e7512c9 | 2456 | |
d0cd8b44 JM |
2457 | /* Compute the constant adjustment to the `this' pointer. The |
2458 | `this' pointer, when this function is called, will point at BINFO | |
2459 | (or one of its primary bases, which are at the same offset). */ | |
31f8e4f3 | 2460 | if (virtual_base) |
20dde49d NS |
2461 | /* The `this' pointer needs to be adjusted from the declaration to |
2462 | the nearest virtual base. */ | |
db3927fb AH |
2463 | delta = size_diffop_loc (input_location, |
2464 | convert (ssizetype, BINFO_OFFSET (virtual_base)), | |
bb885938 | 2465 | convert (ssizetype, BINFO_OFFSET (first_defn))); |
f11ee281 JM |
2466 | else if (lost) |
2467 | /* If the nearest definition is in a lost primary, we don't need an | |
2468 | entry in our vtable. Except possibly in a constructor vtable, | |
2469 | if we happen to get our primary back. In that case, the offset | |
2470 | will be zero, as it will be a primary base. */ | |
2471 | delta = size_zero_node; | |
4e7512c9 | 2472 | else |
548502d3 MM |
2473 | /* The `this' pointer needs to be adjusted from pointing to |
2474 | BINFO to pointing at the base where the final overrider | |
2475 | appears. */ | |
db3927fb AH |
2476 | delta = size_diffop_loc (input_location, |
2477 | convert (ssizetype, | |
bb885938 NS |
2478 | BINFO_OFFSET (TREE_VALUE (overrider))), |
2479 | convert (ssizetype, BINFO_OFFSET (binfo))); | |
4e7512c9 | 2480 | |
3cfabe60 | 2481 | modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals); |
31f8e4f3 MM |
2482 | |
2483 | if (virtual_base) | |
c8094d83 | 2484 | BV_VCALL_INDEX (*virtuals) |
3cfabe60 | 2485 | = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base)); |
d1f05f93 NS |
2486 | else |
2487 | BV_VCALL_INDEX (*virtuals) = NULL_TREE; | |
02dea3ff | 2488 | |
8434c305 | 2489 | BV_LOST_PRIMARY (*virtuals) = lost; |
4e7512c9 MM |
2490 | } |
2491 | ||
8026246f | 2492 | /* Called from modify_all_vtables via dfs_walk. */ |
e92cc029 | 2493 | |
8026246f | 2494 | static tree |
94edc4ab | 2495 | dfs_modify_vtables (tree binfo, void* data) |
8026246f | 2496 | { |
bcb1079e | 2497 | tree t = (tree) data; |
5b94d9dd NS |
2498 | tree virtuals; |
2499 | tree old_virtuals; | |
2500 | unsigned ix; | |
2501 | ||
2502 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2503 | /* A base without a vtable needs no modification, and its bases | |
2504 | are uninteresting. */ | |
2505 | return dfs_skip_bases; | |
c8094d83 | 2506 | |
5b94d9dd NS |
2507 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t) |
2508 | && !CLASSTYPE_HAS_PRIMARY_BASE_P (t)) | |
2509 | /* Don't do the primary vtable, if it's new. */ | |
2510 | return NULL_TREE; | |
2511 | ||
2512 | if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo)) | |
2513 | /* There's no need to modify the vtable for a non-virtual primary | |
2514 | base; we're not going to use that vtable anyhow. We do still | |
2515 | need to do this for virtual primary bases, as they could become | |
2516 | non-primary in a construction vtable. */ | |
2517 | return NULL_TREE; | |
2518 | ||
2519 | make_new_vtable (t, binfo); | |
c8094d83 | 2520 | |
5b94d9dd NS |
2521 | /* Now, go through each of the virtual functions in the virtual |
2522 | function table for BINFO. Find the final overrider, and update | |
2523 | the BINFO_VIRTUALS list appropriately. */ | |
2524 | for (ix = 0, virtuals = BINFO_VIRTUALS (binfo), | |
2525 | old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
2526 | virtuals; | |
2527 | ix++, virtuals = TREE_CHAIN (virtuals), | |
2528 | old_virtuals = TREE_CHAIN (old_virtuals)) | |
c8094d83 MS |
2529 | update_vtable_entry_for_fn (t, |
2530 | binfo, | |
5b94d9dd NS |
2531 | BV_FN (old_virtuals), |
2532 | &virtuals, ix); | |
8026246f | 2533 | |
8026246f MM |
2534 | return NULL_TREE; |
2535 | } | |
2536 | ||
a68ad5bd MM |
2537 | /* Update all of the primary and secondary vtables for T. Create new |
2538 | vtables as required, and initialize their RTTI information. Each | |
e6858a84 NS |
2539 | of the functions in VIRTUALS is declared in T and may override a |
2540 | virtual function from a base class; find and modify the appropriate | |
2541 | entries to point to the overriding functions. Returns a list, in | |
2542 | declaration order, of the virtual functions that are declared in T, | |
2543 | but do not appear in the primary base class vtable, and which | |
2544 | should therefore be appended to the end of the vtable for T. */ | |
a68ad5bd MM |
2545 | |
2546 | static tree | |
94edc4ab | 2547 | modify_all_vtables (tree t, tree virtuals) |
8026246f | 2548 | { |
3461fba7 NS |
2549 | tree binfo = TYPE_BINFO (t); |
2550 | tree *fnsp; | |
a68ad5bd | 2551 | |
9d13a069 JM |
2552 | /* Mangle the vtable name before entering dfs_walk (c++/51884). */ |
2553 | if (TYPE_CONTAINS_VPTR_P (t)) | |
2554 | get_vtable_decl (t, false); | |
2555 | ||
5e19c053 | 2556 | /* Update all of the vtables. */ |
5b94d9dd | 2557 | dfs_walk_once (binfo, dfs_modify_vtables, NULL, t); |
a68ad5bd | 2558 | |
e6858a84 NS |
2559 | /* Add virtual functions not already in our primary vtable. These |
2560 | will be both those introduced by this class, and those overridden | |
2561 | from secondary bases. It does not include virtuals merely | |
2562 | inherited from secondary bases. */ | |
2563 | for (fnsp = &virtuals; *fnsp; ) | |
a68ad5bd | 2564 | { |
3461fba7 | 2565 | tree fn = TREE_VALUE (*fnsp); |
a68ad5bd | 2566 | |
e6858a84 NS |
2567 | if (!value_member (fn, BINFO_VIRTUALS (binfo)) |
2568 | || DECL_VINDEX (fn) == error_mark_node) | |
a68ad5bd | 2569 | { |
3461fba7 NS |
2570 | /* We don't need to adjust the `this' pointer when |
2571 | calling this function. */ | |
2572 | BV_DELTA (*fnsp) = integer_zero_node; | |
2573 | BV_VCALL_INDEX (*fnsp) = NULL_TREE; | |
2574 | ||
e6858a84 | 2575 | /* This is a function not already in our vtable. Keep it. */ |
3461fba7 | 2576 | fnsp = &TREE_CHAIN (*fnsp); |
a68ad5bd | 2577 | } |
3461fba7 NS |
2578 | else |
2579 | /* We've already got an entry for this function. Skip it. */ | |
2580 | *fnsp = TREE_CHAIN (*fnsp); | |
a68ad5bd | 2581 | } |
e93ee644 | 2582 | |
e6858a84 | 2583 | return virtuals; |
7177d104 MS |
2584 | } |
2585 | ||
7d5b8b11 MM |
2586 | /* Get the base virtual function declarations in T that have the |
2587 | indicated NAME. */ | |
e92cc029 | 2588 | |
5ddc28a5 | 2589 | static tree |
94edc4ab | 2590 | get_basefndecls (tree name, tree t) |
9e9ff709 | 2591 | { |
7d5b8b11 | 2592 | tree methods; |
9e9ff709 | 2593 | tree base_fndecls = NULL_TREE; |
604a3205 | 2594 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
7d5b8b11 | 2595 | int i; |
9e9ff709 | 2596 | |
3d1df1fa MM |
2597 | /* Find virtual functions in T with the indicated NAME. */ |
2598 | i = lookup_fnfields_1 (t, name); | |
2599 | if (i != -1) | |
9771b263 | 2600 | for (methods = (*CLASSTYPE_METHOD_VEC (t))[i]; |
3d1df1fa MM |
2601 | methods; |
2602 | methods = OVL_NEXT (methods)) | |
2603 | { | |
2604 | tree method = OVL_CURRENT (methods); | |
2605 | ||
2606 | if (TREE_CODE (method) == FUNCTION_DECL | |
2607 | && DECL_VINDEX (method)) | |
2608 | base_fndecls = tree_cons (NULL_TREE, method, base_fndecls); | |
2609 | } | |
9e9ff709 MS |
2610 | |
2611 | if (base_fndecls) | |
2612 | return base_fndecls; | |
2613 | ||
2614 | for (i = 0; i < n_baseclasses; i++) | |
2615 | { | |
604a3205 | 2616 | tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i)); |
7d5b8b11 | 2617 | base_fndecls = chainon (get_basefndecls (name, basetype), |
9e9ff709 MS |
2618 | base_fndecls); |
2619 | } | |
2620 | ||
2621 | return base_fndecls; | |
2622 | } | |
2623 | ||
2ee887f2 MS |
2624 | /* If this declaration supersedes the declaration of |
2625 | a method declared virtual in the base class, then | |
2626 | mark this field as being virtual as well. */ | |
2627 | ||
9f4faeae | 2628 | void |
94edc4ab | 2629 | check_for_override (tree decl, tree ctype) |
2ee887f2 | 2630 | { |
7506ab1d | 2631 | bool overrides_found = false; |
cbb40945 NS |
2632 | if (TREE_CODE (decl) == TEMPLATE_DECL) |
2633 | /* In [temp.mem] we have: | |
2ee887f2 | 2634 | |
0cbd7506 MS |
2635 | A specialization of a member function template does not |
2636 | override a virtual function from a base class. */ | |
cbb40945 NS |
2637 | return; |
2638 | if ((DECL_DESTRUCTOR_P (decl) | |
a6c0d772 MM |
2639 | || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) |
2640 | || DECL_CONV_FN_P (decl)) | |
cbb40945 NS |
2641 | && look_for_overrides (ctype, decl) |
2642 | && !DECL_STATIC_FUNCTION_P (decl)) | |
e6858a84 NS |
2643 | /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor |
2644 | the error_mark_node so that we know it is an overriding | |
2645 | function. */ | |
7506ab1d VV |
2646 | { |
2647 | DECL_VINDEX (decl) = decl; | |
2648 | overrides_found = true; | |
2649 | } | |
e6858a84 | 2650 | |
cbb40945 | 2651 | if (DECL_VIRTUAL_P (decl)) |
2ee887f2 | 2652 | { |
e6858a84 | 2653 | if (!DECL_VINDEX (decl)) |
2ee887f2 MS |
2654 | DECL_VINDEX (decl) = error_mark_node; |
2655 | IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1; | |
5ade176d JM |
2656 | if (DECL_DESTRUCTOR_P (decl)) |
2657 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype) = true; | |
2ee887f2 | 2658 | } |
7506ab1d VV |
2659 | else if (DECL_FINAL_P (decl)) |
2660 | error ("%q+#D marked final, but is not virtual", decl); | |
2661 | if (DECL_OVERRIDE_P (decl) && !overrides_found) | |
2662 | error ("%q+#D marked override, but does not override", decl); | |
2ee887f2 MS |
2663 | } |
2664 | ||
fc378698 MS |
2665 | /* Warn about hidden virtual functions that are not overridden in t. |
2666 | We know that constructors and destructors don't apply. */ | |
e92cc029 | 2667 | |
b23e103b | 2668 | static void |
94edc4ab | 2669 | warn_hidden (tree t) |
9e9ff709 | 2670 | { |
9771b263 | 2671 | vec<tree, va_gc> *method_vec = CLASSTYPE_METHOD_VEC (t); |
aaaa46d2 MM |
2672 | tree fns; |
2673 | size_t i; | |
9e9ff709 MS |
2674 | |
2675 | /* We go through each separately named virtual function. */ | |
c8094d83 | 2676 | for (i = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2677 | vec_safe_iterate (method_vec, i, &fns); |
aaaa46d2 | 2678 | ++i) |
9e9ff709 | 2679 | { |
aaaa46d2 | 2680 | tree fn; |
7d5b8b11 MM |
2681 | tree name; |
2682 | tree fndecl; | |
2683 | tree base_fndecls; | |
fa743e8c NS |
2684 | tree base_binfo; |
2685 | tree binfo; | |
7d5b8b11 MM |
2686 | int j; |
2687 | ||
2688 | /* All functions in this slot in the CLASSTYPE_METHOD_VEC will | |
2689 | have the same name. Figure out what name that is. */ | |
aaaa46d2 | 2690 | name = DECL_NAME (OVL_CURRENT (fns)); |
7d5b8b11 MM |
2691 | /* There are no possibly hidden functions yet. */ |
2692 | base_fndecls = NULL_TREE; | |
2693 | /* Iterate through all of the base classes looking for possibly | |
2694 | hidden functions. */ | |
fa743e8c NS |
2695 | for (binfo = TYPE_BINFO (t), j = 0; |
2696 | BINFO_BASE_ITERATE (binfo, j, base_binfo); j++) | |
a4832853 | 2697 | { |
fa743e8c | 2698 | tree basetype = BINFO_TYPE (base_binfo); |
7d5b8b11 MM |
2699 | base_fndecls = chainon (get_basefndecls (name, basetype), |
2700 | base_fndecls); | |
a4832853 JM |
2701 | } |
2702 | ||
00a17e31 | 2703 | /* If there are no functions to hide, continue. */ |
7d5b8b11 | 2704 | if (!base_fndecls) |
9e9ff709 MS |
2705 | continue; |
2706 | ||
00a17e31 | 2707 | /* Remove any overridden functions. */ |
aaaa46d2 | 2708 | for (fn = fns; fn; fn = OVL_NEXT (fn)) |
9e9ff709 | 2709 | { |
aaaa46d2 | 2710 | fndecl = OVL_CURRENT (fn); |
7d5b8b11 MM |
2711 | if (DECL_VINDEX (fndecl)) |
2712 | { | |
2713 | tree *prev = &base_fndecls; | |
c8094d83 MS |
2714 | |
2715 | while (*prev) | |
7d5b8b11 MM |
2716 | /* If the method from the base class has the same |
2717 | signature as the method from the derived class, it | |
2718 | has been overridden. */ | |
2719 | if (same_signature_p (fndecl, TREE_VALUE (*prev))) | |
2720 | *prev = TREE_CHAIN (*prev); | |
2721 | else | |
2722 | prev = &TREE_CHAIN (*prev); | |
2723 | } | |
9e9ff709 MS |
2724 | } |
2725 | ||
9e9ff709 MS |
2726 | /* Now give a warning for all base functions without overriders, |
2727 | as they are hidden. */ | |
c8094d83 | 2728 | while (base_fndecls) |
7d5b8b11 MM |
2729 | { |
2730 | /* Here we know it is a hider, and no overrider exists. */ | |
286d12f9 MLI |
2731 | warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls)); |
2732 | warning (OPT_Woverloaded_virtual, " by %q+D", fns); | |
7d5b8b11 MM |
2733 | base_fndecls = TREE_CHAIN (base_fndecls); |
2734 | } | |
9e9ff709 MS |
2735 | } |
2736 | } | |
2737 | ||
2738 | /* Check for things that are invalid. There are probably plenty of other | |
2739 | things we should check for also. */ | |
e92cc029 | 2740 | |
9e9ff709 | 2741 | static void |
94edc4ab | 2742 | finish_struct_anon (tree t) |
9e9ff709 MS |
2743 | { |
2744 | tree field; | |
f90cdf34 | 2745 | |
910ad8de | 2746 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
9e9ff709 MS |
2747 | { |
2748 | if (TREE_STATIC (field)) | |
2749 | continue; | |
2750 | if (TREE_CODE (field) != FIELD_DECL) | |
2751 | continue; | |
2752 | ||
2753 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 2754 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
9e9ff709 | 2755 | { |
61fdc9d7 | 2756 | bool is_union = TREE_CODE (TREE_TYPE (field)) == UNION_TYPE; |
f90cdf34 | 2757 | tree elt = TYPE_FIELDS (TREE_TYPE (field)); |
910ad8de | 2758 | for (; elt; elt = DECL_CHAIN (elt)) |
9e9ff709 | 2759 | { |
b7076960 MM |
2760 | /* We're generally only interested in entities the user |
2761 | declared, but we also find nested classes by noticing | |
2762 | the TYPE_DECL that we create implicitly. You're | |
2763 | allowed to put one anonymous union inside another, | |
6f32162a JM |
2764 | though, so we explicitly tolerate that. We use |
2765 | TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that | |
2766 | we also allow unnamed types used for defining fields. */ | |
c8094d83 | 2767 | if (DECL_ARTIFICIAL (elt) |
b7076960 | 2768 | && (!DECL_IMPLICIT_TYPEDEF_P (elt) |
6f32162a | 2769 | || TYPE_ANONYMOUS_P (TREE_TYPE (elt)))) |
9e9ff709 MS |
2770 | continue; |
2771 | ||
f90cdf34 | 2772 | if (TREE_CODE (elt) != FIELD_DECL) |
8ebeee52 | 2773 | { |
61fdc9d7 | 2774 | if (is_union) |
cbe5f3b3 | 2775 | permerror (input_location, "%q+#D invalid; an anonymous union can " |
393eda6a | 2776 | "only have non-static data members", elt); |
61fdc9d7 | 2777 | else |
cbe5f3b3 | 2778 | permerror (input_location, "%q+#D invalid; an anonymous struct can " |
393eda6a | 2779 | "only have non-static data members", elt); |
8ebeee52 JM |
2780 | continue; |
2781 | } | |
2782 | ||
f90cdf34 | 2783 | if (TREE_PRIVATE (elt)) |
61fdc9d7 PC |
2784 | { |
2785 | if (is_union) | |
cbe5f3b3 | 2786 | permerror (input_location, "private member %q+#D in anonymous union", elt); |
61fdc9d7 | 2787 | else |
cbe5f3b3 | 2788 | permerror (input_location, "private member %q+#D in anonymous struct", elt); |
61fdc9d7 | 2789 | } |
f90cdf34 | 2790 | else if (TREE_PROTECTED (elt)) |
61fdc9d7 PC |
2791 | { |
2792 | if (is_union) | |
cbe5f3b3 | 2793 | permerror (input_location, "protected member %q+#D in anonymous union", elt); |
61fdc9d7 | 2794 | else |
cbe5f3b3 | 2795 | permerror (input_location, "protected member %q+#D in anonymous struct", elt); |
61fdc9d7 | 2796 | } |
fc378698 | 2797 | |
f90cdf34 MT |
2798 | TREE_PRIVATE (elt) = TREE_PRIVATE (field); |
2799 | TREE_PROTECTED (elt) = TREE_PROTECTED (field); | |
9e9ff709 MS |
2800 | } |
2801 | } | |
2802 | } | |
2803 | } | |
2804 | ||
7088fca9 KL |
2805 | /* Add T to CLASSTYPE_DECL_LIST of current_class_type which |
2806 | will be used later during class template instantiation. | |
2807 | When FRIEND_P is zero, T can be a static member data (VAR_DECL), | |
2808 | a non-static member data (FIELD_DECL), a member function | |
c8094d83 | 2809 | (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE), |
7088fca9 KL |
2810 | a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL) |
2811 | When FRIEND_P is nonzero, T is either a friend class | |
2812 | (RECORD_TYPE, TEMPLATE_DECL) or a friend function | |
2813 | (FUNCTION_DECL, TEMPLATE_DECL). */ | |
2814 | ||
2815 | void | |
94edc4ab | 2816 | maybe_add_class_template_decl_list (tree type, tree t, int friend_p) |
7088fca9 KL |
2817 | { |
2818 | /* Save some memory by not creating TREE_LIST if TYPE is not template. */ | |
2819 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
2820 | CLASSTYPE_DECL_LIST (type) | |
2821 | = tree_cons (friend_p ? NULL_TREE : type, | |
2822 | t, CLASSTYPE_DECL_LIST (type)); | |
2823 | } | |
2824 | ||
ca2409f9 DS |
2825 | /* This function is called from declare_virt_assop_and_dtor via |
2826 | dfs_walk_all. | |
2827 | ||
2828 | DATA is a type that direcly or indirectly inherits the base | |
2829 | represented by BINFO. If BINFO contains a virtual assignment [copy | |
2830 | assignment or move assigment] operator or a virtual constructor, | |
2831 | declare that function in DATA if it hasn't been already declared. */ | |
2832 | ||
2833 | static tree | |
2834 | dfs_declare_virt_assop_and_dtor (tree binfo, void *data) | |
2835 | { | |
2836 | tree bv, fn, t = (tree)data; | |
2837 | tree opname = ansi_assopname (NOP_EXPR); | |
2838 | ||
2839 | gcc_assert (t && CLASS_TYPE_P (t)); | |
2840 | gcc_assert (binfo && TREE_CODE (binfo) == TREE_BINFO); | |
2841 | ||
2842 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2843 | /* A base without a vtable needs no modification, and its bases | |
2844 | are uninteresting. */ | |
2845 | return dfs_skip_bases; | |
2846 | ||
2847 | if (BINFO_PRIMARY_P (binfo)) | |
2848 | /* If this is a primary base, then we have already looked at the | |
2849 | virtual functions of its vtable. */ | |
2850 | return NULL_TREE; | |
2851 | ||
2852 | for (bv = BINFO_VIRTUALS (binfo); bv; bv = TREE_CHAIN (bv)) | |
2853 | { | |
2854 | fn = BV_FN (bv); | |
2855 | ||
2856 | if (DECL_NAME (fn) == opname) | |
2857 | { | |
2858 | if (CLASSTYPE_LAZY_COPY_ASSIGN (t)) | |
2859 | lazily_declare_fn (sfk_copy_assignment, t); | |
2860 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
2861 | lazily_declare_fn (sfk_move_assignment, t); | |
2862 | } | |
2863 | else if (DECL_DESTRUCTOR_P (fn) | |
2864 | && CLASSTYPE_LAZY_DESTRUCTOR (t)) | |
2865 | lazily_declare_fn (sfk_destructor, t); | |
2866 | } | |
2867 | ||
2868 | return NULL_TREE; | |
2869 | } | |
2870 | ||
2871 | /* If the class type T has a direct or indirect base that contains a | |
2872 | virtual assignment operator or a virtual destructor, declare that | |
2873 | function in T if it hasn't been already declared. */ | |
2874 | ||
2875 | static void | |
2876 | declare_virt_assop_and_dtor (tree t) | |
2877 | { | |
2878 | if (!(TYPE_POLYMORPHIC_P (t) | |
2879 | && (CLASSTYPE_LAZY_COPY_ASSIGN (t) | |
2880 | || CLASSTYPE_LAZY_MOVE_ASSIGN (t) | |
2881 | || CLASSTYPE_LAZY_DESTRUCTOR (t)))) | |
2882 | return; | |
2883 | ||
2884 | dfs_walk_all (TYPE_BINFO (t), | |
2885 | dfs_declare_virt_assop_and_dtor, | |
2886 | NULL, t); | |
2887 | } | |
2888 | ||
85b5d65a JM |
2889 | /* Declare the inheriting constructor for class T inherited from base |
2890 | constructor CTOR with the parameter array PARMS of size NPARMS. */ | |
2891 | ||
2892 | static void | |
2893 | one_inheriting_sig (tree t, tree ctor, tree *parms, int nparms) | |
2894 | { | |
2895 | /* We don't declare an inheriting ctor that would be a default, | |
e252e96a JM |
2896 | copy or move ctor for derived or base. */ |
2897 | if (nparms == 0) | |
85b5d65a | 2898 | return; |
e252e96a JM |
2899 | if (nparms == 1 |
2900 | && TREE_CODE (parms[0]) == REFERENCE_TYPE) | |
2901 | { | |
2902 | tree parm = TYPE_MAIN_VARIANT (TREE_TYPE (parms[0])); | |
2903 | if (parm == t || parm == DECL_CONTEXT (ctor)) | |
2904 | return; | |
2905 | } | |
2906 | ||
85b5d65a | 2907 | tree parmlist = void_list_node; |
e252e96a | 2908 | for (int i = nparms - 1; i >= 0; i--) |
85b5d65a JM |
2909 | parmlist = tree_cons (NULL_TREE, parms[i], parmlist); |
2910 | tree fn = implicitly_declare_fn (sfk_inheriting_constructor, | |
2911 | t, false, ctor, parmlist); | |
2912 | if (add_method (t, fn, NULL_TREE)) | |
2913 | { | |
2914 | DECL_CHAIN (fn) = TYPE_METHODS (t); | |
2915 | TYPE_METHODS (t) = fn; | |
2916 | } | |
2917 | } | |
2918 | ||
2919 | /* Declare all the inheriting constructors for class T inherited from base | |
2920 | constructor CTOR. */ | |
2921 | ||
2922 | static void | |
2923 | one_inherited_ctor (tree ctor, tree t) | |
2924 | { | |
2925 | tree parms = FUNCTION_FIRST_USER_PARMTYPE (ctor); | |
2926 | ||
2927 | tree *new_parms = XALLOCAVEC (tree, list_length (parms)); | |
2928 | int i = 0; | |
2929 | for (; parms && parms != void_list_node; parms = TREE_CHAIN (parms)) | |
2930 | { | |
2931 | if (TREE_PURPOSE (parms)) | |
2932 | one_inheriting_sig (t, ctor, new_parms, i); | |
2933 | new_parms[i++] = TREE_VALUE (parms); | |
2934 | } | |
2935 | one_inheriting_sig (t, ctor, new_parms, i); | |
4514a96b JM |
2936 | if (parms == NULL_TREE) |
2937 | { | |
2938 | warning (OPT_Winherited_variadic_ctor, | |
2939 | "the ellipsis in %qD is not inherited", ctor); | |
2940 | inform (DECL_SOURCE_LOCATION (ctor), "%qD declared here", ctor); | |
2941 | } | |
85b5d65a JM |
2942 | } |
2943 | ||
61a127b3 | 2944 | /* Create default constructors, assignment operators, and so forth for |
e5e459bf AO |
2945 | the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR, |
2946 | and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, | |
2947 | the class cannot have a default constructor, copy constructor | |
2948 | taking a const reference argument, or an assignment operator taking | |
2949 | a const reference, respectively. */ | |
61a127b3 | 2950 | |
f72ab53b | 2951 | static void |
85b5d65a | 2952 | add_implicitly_declared_members (tree t, tree* access_decls, |
94edc4ab | 2953 | int cant_have_const_cctor, |
10746f37 | 2954 | int cant_have_const_assignment) |
61a127b3 | 2955 | { |
830dea94 JM |
2956 | bool move_ok = false; |
2957 | ||
2958 | if (cxx_dialect >= cxx0x && !CLASSTYPE_DESTRUCTORS (t) | |
2959 | && !TYPE_HAS_COPY_CTOR (t) && !TYPE_HAS_COPY_ASSIGN (t) | |
2960 | && !type_has_move_constructor (t) && !type_has_move_assign (t)) | |
2961 | move_ok = true; | |
2962 | ||
61a127b3 | 2963 | /* Destructor. */ |
9f4faeae | 2964 | if (!CLASSTYPE_DESTRUCTORS (t)) |
61a127b3 | 2965 | { |
9f4faeae MM |
2966 | /* In general, we create destructors lazily. */ |
2967 | CLASSTYPE_LAZY_DESTRUCTOR (t) = 1; | |
9f4faeae | 2968 | |
d1a115f8 JM |
2969 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
2970 | && TYPE_FOR_JAVA (t)) | |
2971 | /* But if this is a Java class, any non-trivial destructor is | |
2972 | invalid, even if compiler-generated. Therefore, if the | |
2973 | destructor is non-trivial we create it now. */ | |
2974 | lazily_declare_fn (sfk_destructor, t); | |
61a127b3 | 2975 | } |
61a127b3 | 2976 | |
0fcedd9c JM |
2977 | /* [class.ctor] |
2978 | ||
2979 | If there is no user-declared constructor for a class, a default | |
2980 | constructor is implicitly declared. */ | |
2981 | if (! TYPE_HAS_USER_CONSTRUCTOR (t)) | |
61a127b3 | 2982 | { |
508a1c9c | 2983 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1; |
0930cc0e JM |
2984 | CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1; |
2985 | if (cxx_dialect >= cxx0x) | |
2986 | TYPE_HAS_CONSTEXPR_CTOR (t) | |
fd3faf2b JM |
2987 | /* This might force the declaration. */ |
2988 | = type_has_constexpr_default_constructor (t); | |
61a127b3 MM |
2989 | } |
2990 | ||
0fcedd9c JM |
2991 | /* [class.ctor] |
2992 | ||
2993 | If a class definition does not explicitly declare a copy | |
2994 | constructor, one is declared implicitly. */ | |
a2e70335 | 2995 | if (! TYPE_HAS_COPY_CTOR (t) && ! TYPE_FOR_JAVA (t)) |
61a127b3 | 2996 | { |
066ec0a4 JM |
2997 | TYPE_HAS_COPY_CTOR (t) = 1; |
2998 | TYPE_HAS_CONST_COPY_CTOR (t) = !cant_have_const_cctor; | |
508a1c9c | 2999 | CLASSTYPE_LAZY_COPY_CTOR (t) = 1; |
830dea94 | 3000 | if (move_ok) |
d758e847 | 3001 | CLASSTYPE_LAZY_MOVE_CTOR (t) = 1; |
61a127b3 MM |
3002 | } |
3003 | ||
aaaa46d2 MM |
3004 | /* If there is no assignment operator, one will be created if and |
3005 | when it is needed. For now, just record whether or not the type | |
3006 | of the parameter to the assignment operator will be a const or | |
3007 | non-const reference. */ | |
a2e70335 | 3008 | if (!TYPE_HAS_COPY_ASSIGN (t) && !TYPE_FOR_JAVA (t)) |
fb232476 | 3009 | { |
066ec0a4 JM |
3010 | TYPE_HAS_COPY_ASSIGN (t) = 1; |
3011 | TYPE_HAS_CONST_COPY_ASSIGN (t) = !cant_have_const_assignment; | |
3012 | CLASSTYPE_LAZY_COPY_ASSIGN (t) = 1; | |
830dea94 | 3013 | if (move_ok) |
d758e847 | 3014 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 1; |
fb232476 | 3015 | } |
d1a115f8 JM |
3016 | |
3017 | /* We can't be lazy about declaring functions that might override | |
3018 | a virtual function from a base class. */ | |
ca2409f9 | 3019 | declare_virt_assop_and_dtor (t); |
85b5d65a JM |
3020 | |
3021 | while (*access_decls) | |
3022 | { | |
3023 | tree using_decl = TREE_VALUE (*access_decls); | |
3024 | tree decl = USING_DECL_DECLS (using_decl); | |
140bec21 | 3025 | if (DECL_NAME (using_decl) == ctor_identifier) |
85b5d65a JM |
3026 | { |
3027 | /* declare, then remove the decl */ | |
140bec21 | 3028 | tree ctor_list = decl; |
85b5d65a JM |
3029 | location_t loc = input_location; |
3030 | input_location = DECL_SOURCE_LOCATION (using_decl); | |
3031 | if (ctor_list) | |
3032 | for (; ctor_list; ctor_list = OVL_NEXT (ctor_list)) | |
3033 | one_inherited_ctor (OVL_CURRENT (ctor_list), t); | |
3034 | *access_decls = TREE_CHAIN (*access_decls); | |
3035 | input_location = loc; | |
3036 | } | |
3037 | else | |
3038 | access_decls = &TREE_CHAIN (*access_decls); | |
3039 | } | |
61a127b3 MM |
3040 | } |
3041 | ||
cba0366c FC |
3042 | /* Subroutine of insert_into_classtype_sorted_fields. Recursively |
3043 | count the number of fields in TYPE, including anonymous union | |
3044 | members. */ | |
f90cdf34 MT |
3045 | |
3046 | static int | |
94edc4ab | 3047 | count_fields (tree fields) |
f90cdf34 MT |
3048 | { |
3049 | tree x; | |
3050 | int n_fields = 0; | |
910ad8de | 3051 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
3052 | { |
3053 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
3054 | n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x))); | |
3055 | else | |
3056 | n_fields += 1; | |
3057 | } | |
3058 | return n_fields; | |
3059 | } | |
3060 | ||
cba0366c FC |
3061 | /* Subroutine of insert_into_classtype_sorted_fields. Recursively add |
3062 | all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE | |
3063 | elts, starting at offset IDX. */ | |
f90cdf34 MT |
3064 | |
3065 | static int | |
d07605f5 | 3066 | add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx) |
f90cdf34 MT |
3067 | { |
3068 | tree x; | |
910ad8de | 3069 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
3070 | { |
3071 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
d07605f5 | 3072 | idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx); |
f90cdf34 | 3073 | else |
d07605f5 | 3074 | field_vec->elts[idx++] = x; |
f90cdf34 MT |
3075 | } |
3076 | return idx; | |
3077 | } | |
3078 | ||
cba0366c FC |
3079 | /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts, |
3080 | starting at offset IDX. */ | |
3081 | ||
3082 | static int | |
3083 | add_enum_fields_to_record_type (tree enumtype, | |
3084 | struct sorted_fields_type *field_vec, | |
3085 | int idx) | |
3086 | { | |
3087 | tree values; | |
3088 | for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) | |
3089 | field_vec->elts[idx++] = TREE_VALUE (values); | |
3090 | return idx; | |
3091 | } | |
3092 | ||
1e30f9b4 MM |
3093 | /* FIELD is a bit-field. We are finishing the processing for its |
3094 | enclosing type. Issue any appropriate messages and set appropriate | |
e7df0180 | 3095 | flags. Returns false if an error has been diagnosed. */ |
1e30f9b4 | 3096 | |
e7df0180 | 3097 | static bool |
94edc4ab | 3098 | check_bitfield_decl (tree field) |
1e30f9b4 MM |
3099 | { |
3100 | tree type = TREE_TYPE (field); | |
606791f6 MM |
3101 | tree w; |
3102 | ||
3103 | /* Extract the declared width of the bitfield, which has been | |
3104 | temporarily stashed in DECL_INITIAL. */ | |
3105 | w = DECL_INITIAL (field); | |
3db45ab5 | 3106 | gcc_assert (w != NULL_TREE); |
606791f6 MM |
3107 | /* Remove the bit-field width indicator so that the rest of the |
3108 | compiler does not treat that value as an initializer. */ | |
3109 | DECL_INITIAL (field) = NULL_TREE; | |
1e30f9b4 | 3110 | |
cd8ed629 | 3111 | /* Detect invalid bit-field type. */ |
550a799d | 3112 | if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type)) |
1e30f9b4 | 3113 | { |
dee15844 | 3114 | error ("bit-field %q+#D with non-integral type", field); |
cd8ed629 | 3115 | w = error_mark_node; |
1e30f9b4 | 3116 | } |
606791f6 | 3117 | else |
1e30f9b4 | 3118 | { |
9e115cec | 3119 | location_t loc = input_location; |
1e30f9b4 MM |
3120 | /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */ |
3121 | STRIP_NOPS (w); | |
3122 | ||
3123 | /* detect invalid field size. */ | |
9e115cec | 3124 | input_location = DECL_SOURCE_LOCATION (field); |
fa2200cb | 3125 | w = cxx_constant_value (w); |
9e115cec | 3126 | input_location = loc; |
1e30f9b4 MM |
3127 | |
3128 | if (TREE_CODE (w) != INTEGER_CST) | |
3129 | { | |
dee15844 | 3130 | error ("bit-field %q+D width not an integer constant", field); |
cd8ed629 | 3131 | w = error_mark_node; |
1e30f9b4 | 3132 | } |
05bccae2 | 3133 | else if (tree_int_cst_sgn (w) < 0) |
1e30f9b4 | 3134 | { |
dee15844 | 3135 | error ("negative width in bit-field %q+D", field); |
cd8ed629 | 3136 | w = error_mark_node; |
1e30f9b4 | 3137 | } |
05bccae2 | 3138 | else if (integer_zerop (w) && DECL_NAME (field) != 0) |
1e30f9b4 | 3139 | { |
dee15844 | 3140 | error ("zero width for bit-field %q+D", field); |
cd8ed629 | 3141 | w = error_mark_node; |
1e30f9b4 | 3142 | } |
05bccae2 | 3143 | else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0 |
1e30f9b4 MM |
3144 | && TREE_CODE (type) != ENUMERAL_TYPE |
3145 | && TREE_CODE (type) != BOOLEAN_TYPE) | |
dee15844 | 3146 | warning (0, "width of %q+D exceeds its type", field); |
1e30f9b4 | 3147 | else if (TREE_CODE (type) == ENUMERAL_TYPE |
cbb4feb3 JM |
3148 | && (0 > (compare_tree_int |
3149 | (w, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type)))))) | |
dee15844 | 3150 | warning (0, "%q+D is too small to hold all values of %q#T", field, type); |
cd8ed629 | 3151 | } |
c8094d83 | 3152 | |
cd8ed629 MM |
3153 | if (w != error_mark_node) |
3154 | { | |
3155 | DECL_SIZE (field) = convert (bitsizetype, w); | |
3156 | DECL_BIT_FIELD (field) = 1; | |
e7df0180 | 3157 | return true; |
1e30f9b4 MM |
3158 | } |
3159 | else | |
cd8ed629 MM |
3160 | { |
3161 | /* Non-bit-fields are aligned for their type. */ | |
3162 | DECL_BIT_FIELD (field) = 0; | |
3163 | CLEAR_DECL_C_BIT_FIELD (field); | |
e7df0180 | 3164 | return false; |
cd8ed629 | 3165 | } |
1e30f9b4 MM |
3166 | } |
3167 | ||
3168 | /* FIELD is a non bit-field. We are finishing the processing for its | |
3169 | enclosing type T. Issue any appropriate messages and set appropriate | |
3170 | flags. */ | |
3171 | ||
3172 | static void | |
94edc4ab | 3173 | check_field_decl (tree field, |
0cbd7506 MS |
3174 | tree t, |
3175 | int* cant_have_const_ctor, | |
3176 | int* no_const_asn_ref, | |
10746f37 | 3177 | int* any_default_members) |
1e30f9b4 MM |
3178 | { |
3179 | tree type = strip_array_types (TREE_TYPE (field)); | |
3180 | ||
57ece258 | 3181 | /* In C++98 an anonymous union cannot contain any fields which would change |
1e30f9b4 | 3182 | the settings of CANT_HAVE_CONST_CTOR and friends. */ |
57ece258 | 3183 | if (ANON_UNION_TYPE_P (type) && cxx_dialect < cxx0x) |
1e30f9b4 | 3184 | ; |
066ec0a4 | 3185 | /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous |
1e30f9b4 MM |
3186 | structs. So, we recurse through their fields here. */ |
3187 | else if (ANON_AGGR_TYPE_P (type)) | |
3188 | { | |
3189 | tree fields; | |
3190 | ||
910ad8de | 3191 | for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields)) |
17aec3eb | 3192 | if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field)) |
1e30f9b4 | 3193 | check_field_decl (fields, t, cant_have_const_ctor, |
10746f37 | 3194 | no_const_asn_ref, any_default_members); |
1e30f9b4 MM |
3195 | } |
3196 | /* Check members with class type for constructors, destructors, | |
3197 | etc. */ | |
3198 | else if (CLASS_TYPE_P (type)) | |
3199 | { | |
3200 | /* Never let anything with uninheritable virtuals | |
3201 | make it through without complaint. */ | |
3202 | abstract_virtuals_error (field, type); | |
c8094d83 | 3203 | |
57ece258 | 3204 | if (TREE_CODE (t) == UNION_TYPE && cxx_dialect < cxx0x) |
1e30f9b4 | 3205 | { |
57ece258 JM |
3206 | static bool warned; |
3207 | int oldcount = errorcount; | |
1e30f9b4 | 3208 | if (TYPE_NEEDS_CONSTRUCTING (type)) |
dee15844 JM |
3209 | error ("member %q+#D with constructor not allowed in union", |
3210 | field); | |
834c6dff | 3211 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
dee15844 | 3212 | error ("member %q+#D with destructor not allowed in union", field); |
066ec0a4 | 3213 | if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type)) |
dee15844 JM |
3214 | error ("member %q+#D with copy assignment operator not allowed in union", |
3215 | field); | |
57ece258 JM |
3216 | if (!warned && errorcount > oldcount) |
3217 | { | |
3218 | inform (DECL_SOURCE_LOCATION (field), "unrestricted unions " | |
97e3ad20 | 3219 | "only available with -std=c++11 or -std=gnu++11"); |
57ece258 JM |
3220 | warned = true; |
3221 | } | |
1e30f9b4 MM |
3222 | } |
3223 | else | |
3224 | { | |
3225 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type); | |
c8094d83 | 3226 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 3227 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type); |
d758e847 JM |
3228 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
3229 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type) | |
3230 | || !TYPE_HAS_COPY_ASSIGN (type)); | |
3231 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type) | |
3232 | || !TYPE_HAS_COPY_CTOR (type)); | |
ac177431 JM |
3233 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type); |
3234 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type); | |
3235 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type) | |
3236 | || TYPE_HAS_COMPLEX_DFLT (type)); | |
1e30f9b4 MM |
3237 | } |
3238 | ||
d758e847 JM |
3239 | if (TYPE_HAS_COPY_CTOR (type) |
3240 | && !TYPE_HAS_CONST_COPY_CTOR (type)) | |
1e30f9b4 MM |
3241 | *cant_have_const_ctor = 1; |
3242 | ||
d758e847 JM |
3243 | if (TYPE_HAS_COPY_ASSIGN (type) |
3244 | && !TYPE_HAS_CONST_COPY_ASSIGN (type)) | |
1e30f9b4 | 3245 | *no_const_asn_ref = 1; |
1e30f9b4 | 3246 | } |
7dbb85a7 JM |
3247 | |
3248 | check_abi_tags (t, field); | |
3249 | ||
1e30f9b4 MM |
3250 | if (DECL_INITIAL (field) != NULL_TREE) |
3251 | { | |
3252 | /* `build_class_init_list' does not recognize | |
3253 | non-FIELD_DECLs. */ | |
0e5f8a59 | 3254 | if (TREE_CODE (t) == UNION_TYPE && *any_default_members != 0) |
1f070f2b | 3255 | error ("multiple fields in union %qT initialized", t); |
1e30f9b4 MM |
3256 | *any_default_members = 1; |
3257 | } | |
6bb88f3b | 3258 | } |
1e30f9b4 | 3259 | |
08b962b0 MM |
3260 | /* Check the data members (both static and non-static), class-scoped |
3261 | typedefs, etc., appearing in the declaration of T. Issue | |
3262 | appropriate diagnostics. Sets ACCESS_DECLS to a list (in | |
3263 | declaration order) of access declarations; each TREE_VALUE in this | |
3264 | list is a USING_DECL. | |
8d08fdba | 3265 | |
08b962b0 | 3266 | In addition, set the following flags: |
8d08fdba | 3267 | |
08b962b0 MM |
3268 | EMPTY_P |
3269 | The class is empty, i.e., contains no non-static data members. | |
8d08fdba | 3270 | |
08b962b0 MM |
3271 | CANT_HAVE_CONST_CTOR_P |
3272 | This class cannot have an implicitly generated copy constructor | |
3273 | taking a const reference. | |
8d08fdba | 3274 | |
08b962b0 MM |
3275 | CANT_HAVE_CONST_ASN_REF |
3276 | This class cannot have an implicitly generated assignment | |
3277 | operator taking a const reference. | |
8d08fdba | 3278 | |
08b962b0 MM |
3279 | All of these flags should be initialized before calling this |
3280 | function. | |
8d08fdba | 3281 | |
08b962b0 MM |
3282 | Returns a pointer to the end of the TYPE_FIELDs chain; additional |
3283 | fields can be added by adding to this chain. */ | |
8d08fdba | 3284 | |
607cf131 | 3285 | static void |
58731fd1 | 3286 | check_field_decls (tree t, tree *access_decls, |
58731fd1 | 3287 | int *cant_have_const_ctor_p, |
10746f37 | 3288 | int *no_const_asn_ref_p) |
08b962b0 MM |
3289 | { |
3290 | tree *field; | |
3291 | tree *next; | |
dd29d26b | 3292 | bool has_pointers; |
08b962b0 | 3293 | int any_default_members; |
22002050 | 3294 | int cant_pack = 0; |
c32097d8 | 3295 | int field_access = -1; |
08b962b0 MM |
3296 | |
3297 | /* Assume there are no access declarations. */ | |
3298 | *access_decls = NULL_TREE; | |
3299 | /* Assume this class has no pointer members. */ | |
dd29d26b | 3300 | has_pointers = false; |
08b962b0 MM |
3301 | /* Assume none of the members of this class have default |
3302 | initializations. */ | |
3303 | any_default_members = 0; | |
3304 | ||
3305 | for (field = &TYPE_FIELDS (t); *field; field = next) | |
8d08fdba | 3306 | { |
08b962b0 MM |
3307 | tree x = *field; |
3308 | tree type = TREE_TYPE (x); | |
c32097d8 | 3309 | int this_field_access; |
8d08fdba | 3310 | |
910ad8de | 3311 | next = &DECL_CHAIN (x); |
8d08fdba | 3312 | |
cffa8729 | 3313 | if (TREE_CODE (x) == USING_DECL) |
f30432d7 | 3314 | { |
08b962b0 MM |
3315 | /* Save the access declarations for our caller. */ |
3316 | *access_decls = tree_cons (NULL_TREE, x, *access_decls); | |
f30432d7 MS |
3317 | continue; |
3318 | } | |
8d08fdba | 3319 | |
050367a3 MM |
3320 | if (TREE_CODE (x) == TYPE_DECL |
3321 | || TREE_CODE (x) == TEMPLATE_DECL) | |
f30432d7 | 3322 | continue; |
8d08fdba | 3323 | |
f30432d7 | 3324 | /* If we've gotten this far, it's a data member, possibly static, |
e92cc029 | 3325 | or an enumerator. */ |
8d0d1915 JM |
3326 | if (TREE_CODE (x) != CONST_DECL) |
3327 | DECL_CONTEXT (x) = t; | |
8d08fdba | 3328 | |
58ec3cc5 MM |
3329 | /* When this goes into scope, it will be a non-local reference. */ |
3330 | DECL_NONLOCAL (x) = 1; | |
3331 | ||
3332 | if (TREE_CODE (t) == UNION_TYPE) | |
3333 | { | |
3334 | /* [class.union] | |
3335 | ||
3336 | If a union contains a static data member, or a member of | |
324f9dfb | 3337 | reference type, the program is ill-formed. */ |
5a6ccc94 | 3338 | if (VAR_P (x)) |
58ec3cc5 | 3339 | { |
dee15844 | 3340 | error ("%q+D may not be static because it is a member of a union", x); |
58ec3cc5 MM |
3341 | continue; |
3342 | } | |
3343 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
3344 | { | |
dee15844 JM |
3345 | error ("%q+D may not have reference type %qT because" |
3346 | " it is a member of a union", | |
3347 | x, type); | |
58ec3cc5 MM |
3348 | continue; |
3349 | } | |
3350 | } | |
3351 | ||
f30432d7 MS |
3352 | /* Perform error checking that did not get done in |
3353 | grokdeclarator. */ | |
52fb2769 | 3354 | if (TREE_CODE (type) == FUNCTION_TYPE) |
f30432d7 | 3355 | { |
dee15844 | 3356 | error ("field %q+D invalidly declared function type", x); |
52fb2769 NS |
3357 | type = build_pointer_type (type); |
3358 | TREE_TYPE (x) = type; | |
f30432d7 | 3359 | } |
52fb2769 | 3360 | else if (TREE_CODE (type) == METHOD_TYPE) |
f30432d7 | 3361 | { |
dee15844 | 3362 | error ("field %q+D invalidly declared method type", x); |
52fb2769 NS |
3363 | type = build_pointer_type (type); |
3364 | TREE_TYPE (x) = type; | |
f30432d7 | 3365 | } |
8d08fdba | 3366 | |
52fb2769 | 3367 | if (type == error_mark_node) |
f30432d7 | 3368 | continue; |
c8094d83 | 3369 | |
5a6ccc94 | 3370 | if (TREE_CODE (x) == CONST_DECL || VAR_P (x)) |
73a8adb6 | 3371 | continue; |
8d08fdba | 3372 | |
f30432d7 | 3373 | /* Now it can only be a FIELD_DECL. */ |
8d08fdba | 3374 | |
f30432d7 | 3375 | if (TREE_PRIVATE (x) || TREE_PROTECTED (x)) |
08b962b0 | 3376 | CLASSTYPE_NON_AGGREGATE (t) = 1; |
8d08fdba | 3377 | |
3b49d762 | 3378 | /* If at least one non-static data member is non-literal, the whole |
48d261d2 PC |
3379 | class becomes non-literal. Note: if the type is incomplete we |
3380 | will complain later on. */ | |
3381 | if (COMPLETE_TYPE_P (type) && !literal_type_p (type)) | |
3b49d762 GDR |
3382 | CLASSTYPE_LITERAL_P (t) = false; |
3383 | ||
c32097d8 JM |
3384 | /* A standard-layout class is a class that: |
3385 | ... | |
3386 | has the same access control (Clause 11) for all non-static data members, | |
3387 | ... */ | |
3388 | this_field_access = TREE_PROTECTED (x) ? 1 : TREE_PRIVATE (x) ? 2 : 0; | |
3389 | if (field_access == -1) | |
3390 | field_access = this_field_access; | |
3391 | else if (this_field_access != field_access) | |
3392 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
3393 | ||
0fcedd9c | 3394 | /* If this is of reference type, check if it needs an init. */ |
52fb2769 | 3395 | if (TREE_CODE (type) == REFERENCE_TYPE) |
0cbd7506 | 3396 | { |
c32097d8 JM |
3397 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3398 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
f30432d7 | 3399 | if (DECL_INITIAL (x) == NULL_TREE) |
6eb35968 | 3400 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); |
8d08fdba | 3401 | |
f30432d7 MS |
3402 | /* ARM $12.6.2: [A member initializer list] (or, for an |
3403 | aggregate, initialization by a brace-enclosed list) is the | |
3404 | only way to initialize nonstatic const and reference | |
3405 | members. */ | |
066ec0a4 | 3406 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3407 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3408 | } |
8d08fdba | 3409 | |
1e30f9b4 | 3410 | type = strip_array_types (type); |
dd29d26b | 3411 | |
1937f939 JM |
3412 | if (TYPE_PACKED (t)) |
3413 | { | |
c32097d8 | 3414 | if (!layout_pod_type_p (type) && !TYPE_PACKED (type)) |
4666cd04 JM |
3415 | { |
3416 | warning | |
3417 | (0, | |
3418 | "ignoring packed attribute because of unpacked non-POD field %q+#D", | |
3419 | x); | |
22002050 | 3420 | cant_pack = 1; |
4666cd04 | 3421 | } |
2cd36c22 AN |
3422 | else if (DECL_C_BIT_FIELD (x) |
3423 | || TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT) | |
1937f939 JM |
3424 | DECL_PACKED (x) = 1; |
3425 | } | |
3426 | ||
3427 | if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x))) | |
3428 | /* We don't treat zero-width bitfields as making a class | |
3429 | non-empty. */ | |
3430 | ; | |
3431 | else | |
3432 | { | |
3433 | /* The class is non-empty. */ | |
3434 | CLASSTYPE_EMPTY_P (t) = 0; | |
3435 | /* The class is not even nearly empty. */ | |
3436 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
3437 | /* If one of the data members contains an empty class, | |
3438 | so does T. */ | |
3439 | if (CLASS_TYPE_P (type) | |
3440 | && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3441 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
3442 | } | |
3443 | ||
dd29d26b GB |
3444 | /* This is used by -Weffc++ (see below). Warn only for pointers |
3445 | to members which might hold dynamic memory. So do not warn | |
3446 | for pointers to functions or pointers to members. */ | |
3447 | if (TYPE_PTR_P (type) | |
66b1156a | 3448 | && !TYPE_PTRFN_P (type)) |
dd29d26b | 3449 | has_pointers = true; |
824b9a4c | 3450 | |
58ec3cc5 MM |
3451 | if (CLASS_TYPE_P (type)) |
3452 | { | |
3453 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (type)) | |
3454 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); | |
3455 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)) | |
3456 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); | |
3457 | } | |
3458 | ||
52fb2769 | 3459 | if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type)) |
08b962b0 | 3460 | CLASSTYPE_HAS_MUTABLE (t) = 1; |
a7a7710d | 3461 | |
c32097d8 | 3462 | if (! layout_pod_type_p (type)) |
0cbd7506 MS |
3463 | /* DR 148 now allows pointers to members (which are POD themselves), |
3464 | to be allowed in POD structs. */ | |
c32097d8 JM |
3465 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3466 | ||
3467 | if (!std_layout_type_p (type)) | |
3468 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
52fb2769 | 3469 | |
94e6e4c4 AO |
3470 | if (! zero_init_p (type)) |
3471 | CLASSTYPE_NON_ZERO_INIT_P (t) = 1; | |
3472 | ||
640c2adf FC |
3473 | /* We set DECL_C_BIT_FIELD in grokbitfield. |
3474 | If the type and width are valid, we'll also set DECL_BIT_FIELD. */ | |
3475 | if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x)) | |
3476 | check_field_decl (x, t, | |
3477 | cant_have_const_ctor_p, | |
3478 | no_const_asn_ref_p, | |
10746f37 | 3479 | &any_default_members); |
640c2adf | 3480 | |
ec3ebf45 OG |
3481 | /* Now that we've removed bit-field widths from DECL_INITIAL, |
3482 | anything left in DECL_INITIAL is an NSDMI that makes the class | |
3483 | non-aggregate. */ | |
3484 | if (DECL_INITIAL (x)) | |
3485 | CLASSTYPE_NON_AGGREGATE (t) = true; | |
3486 | ||
f30432d7 | 3487 | /* If any field is const, the structure type is pseudo-const. */ |
52fb2769 | 3488 | if (CP_TYPE_CONST_P (type)) |
f30432d7 MS |
3489 | { |
3490 | C_TYPE_FIELDS_READONLY (t) = 1; | |
3491 | if (DECL_INITIAL (x) == NULL_TREE) | |
6eb35968 | 3492 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); |
f30432d7 MS |
3493 | |
3494 | /* ARM $12.6.2: [A member initializer list] (or, for an | |
3495 | aggregate, initialization by a brace-enclosed list) is the | |
3496 | only way to initialize nonstatic const and reference | |
3497 | members. */ | |
066ec0a4 | 3498 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3499 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3500 | } |
08b962b0 | 3501 | /* A field that is pseudo-const makes the structure likewise. */ |
5552b43c | 3502 | else if (CLASS_TYPE_P (type)) |
f30432d7 | 3503 | { |
08b962b0 | 3504 | C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type); |
6eb35968 DE |
3505 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, |
3506 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) | |
3507 | | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)); | |
f30432d7 | 3508 | } |
8d08fdba | 3509 | |
c10bffd0 JM |
3510 | /* Core issue 80: A nonstatic data member is required to have a |
3511 | different name from the class iff the class has a | |
b87d79e6 | 3512 | user-declared constructor. */ |
0fcedd9c JM |
3513 | if (constructor_name_p (DECL_NAME (x), t) |
3514 | && TYPE_HAS_USER_CONSTRUCTOR (t)) | |
cbe5f3b3 | 3515 | permerror (input_location, "field %q+#D with same name as class", x); |
8d08fdba MS |
3516 | } |
3517 | ||
dd29d26b GB |
3518 | /* Effective C++ rule 11: if a class has dynamic memory held by pointers, |
3519 | it should also define a copy constructor and an assignment operator to | |
3520 | implement the correct copy semantic (deep vs shallow, etc.). As it is | |
3521 | not feasible to check whether the constructors do allocate dynamic memory | |
3522 | and store it within members, we approximate the warning like this: | |
3523 | ||
3524 | -- Warn only if there are members which are pointers | |
3525 | -- Warn only if there is a non-trivial constructor (otherwise, | |
3526 | there cannot be memory allocated). | |
3527 | -- Warn only if there is a non-trivial destructor. We assume that the | |
3528 | user at least implemented the cleanup correctly, and a destructor | |
3529 | is needed to free dynamic memory. | |
c8094d83 | 3530 | |
77880ae4 | 3531 | This seems enough for practical purposes. */ |
22002050 JM |
3532 | if (warn_ecpp |
3533 | && has_pointers | |
0fcedd9c | 3534 | && TYPE_HAS_USER_CONSTRUCTOR (t) |
22002050 | 3535 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
066ec0a4 | 3536 | && !(TYPE_HAS_COPY_CTOR (t) && TYPE_HAS_COPY_ASSIGN (t))) |
824b9a4c | 3537 | { |
b323323f | 3538 | warning (OPT_Weffc__, "%q#T has pointer data members", t); |
c8094d83 | 3539 | |
066ec0a4 | 3540 | if (! TYPE_HAS_COPY_CTOR (t)) |
824b9a4c | 3541 | { |
74fa0285 | 3542 | warning (OPT_Weffc__, |
3db45ab5 | 3543 | " but does not override %<%T(const %T&)%>", t, t); |
066ec0a4 | 3544 | if (!TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3545 | warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t); |
824b9a4c | 3546 | } |
066ec0a4 | 3547 | else if (! TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3548 | warning (OPT_Weffc__, |
3db45ab5 | 3549 | " but does not override %<operator=(const %T&)%>", t); |
824b9a4c | 3550 | } |
08b962b0 | 3551 | |
0e5f8a59 JM |
3552 | /* Non-static data member initializers make the default constructor |
3553 | non-trivial. */ | |
3554 | if (any_default_members) | |
3555 | { | |
3556 | TYPE_NEEDS_CONSTRUCTING (t) = true; | |
3557 | TYPE_HAS_COMPLEX_DFLT (t) = true; | |
3558 | } | |
3559 | ||
22002050 JM |
3560 | /* If any of the fields couldn't be packed, unset TYPE_PACKED. */ |
3561 | if (cant_pack) | |
3562 | TYPE_PACKED (t) = 0; | |
607cf131 MM |
3563 | |
3564 | /* Check anonymous struct/anonymous union fields. */ | |
3565 | finish_struct_anon (t); | |
3566 | ||
08b962b0 MM |
3567 | /* We've built up the list of access declarations in reverse order. |
3568 | Fix that now. */ | |
3569 | *access_decls = nreverse (*access_decls); | |
08b962b0 MM |
3570 | } |
3571 | ||
c20118a8 MM |
3572 | /* If TYPE is an empty class type, records its OFFSET in the table of |
3573 | OFFSETS. */ | |
607cf131 | 3574 | |
c20118a8 | 3575 | static int |
94edc4ab | 3576 | record_subobject_offset (tree type, tree offset, splay_tree offsets) |
5c24fba6 | 3577 | { |
c20118a8 | 3578 | splay_tree_node n; |
5c24fba6 | 3579 | |
c20118a8 MM |
3580 | if (!is_empty_class (type)) |
3581 | return 0; | |
5c24fba6 | 3582 | |
c20118a8 MM |
3583 | /* Record the location of this empty object in OFFSETS. */ |
3584 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3585 | if (!n) | |
c8094d83 | 3586 | n = splay_tree_insert (offsets, |
c20118a8 MM |
3587 | (splay_tree_key) offset, |
3588 | (splay_tree_value) NULL_TREE); | |
c8094d83 | 3589 | n->value = ((splay_tree_value) |
c20118a8 MM |
3590 | tree_cons (NULL_TREE, |
3591 | type, | |
3592 | (tree) n->value)); | |
3593 | ||
3594 | return 0; | |
607cf131 MM |
3595 | } |
3596 | ||
838dfd8a | 3597 | /* Returns nonzero if TYPE is an empty class type and there is |
c20118a8 | 3598 | already an entry in OFFSETS for the same TYPE as the same OFFSET. */ |
9785e4b1 | 3599 | |
c20118a8 | 3600 | static int |
94edc4ab | 3601 | check_subobject_offset (tree type, tree offset, splay_tree offsets) |
9785e4b1 | 3602 | { |
c20118a8 MM |
3603 | splay_tree_node n; |
3604 | tree t; | |
3605 | ||
3606 | if (!is_empty_class (type)) | |
3607 | return 0; | |
3608 | ||
3609 | /* Record the location of this empty object in OFFSETS. */ | |
3610 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3611 | if (!n) | |
3612 | return 0; | |
3613 | ||
3614 | for (t = (tree) n->value; t; t = TREE_CHAIN (t)) | |
3615 | if (same_type_p (TREE_VALUE (t), type)) | |
3616 | return 1; | |
3617 | ||
3618 | return 0; | |
9785e4b1 MM |
3619 | } |
3620 | ||
c20118a8 MM |
3621 | /* Walk through all the subobjects of TYPE (located at OFFSET). Call |
3622 | F for every subobject, passing it the type, offset, and table of | |
2003cd37 MM |
3623 | OFFSETS. If VBASES_P is one, then virtual non-primary bases should |
3624 | be traversed. | |
5cdba4ff MM |
3625 | |
3626 | If MAX_OFFSET is non-NULL, then subobjects with an offset greater | |
3627 | than MAX_OFFSET will not be walked. | |
3628 | ||
838dfd8a | 3629 | If F returns a nonzero value, the traversal ceases, and that value |
5cdba4ff | 3630 | is returned. Otherwise, returns zero. */ |
d77249e7 | 3631 | |
c20118a8 | 3632 | static int |
c8094d83 | 3633 | walk_subobject_offsets (tree type, |
0cbd7506 MS |
3634 | subobject_offset_fn f, |
3635 | tree offset, | |
3636 | splay_tree offsets, | |
3637 | tree max_offset, | |
3638 | int vbases_p) | |
5c24fba6 | 3639 | { |
c20118a8 | 3640 | int r = 0; |
ff944b49 | 3641 | tree type_binfo = NULL_TREE; |
c20118a8 | 3642 | |
5cdba4ff MM |
3643 | /* If this OFFSET is bigger than the MAX_OFFSET, then we should |
3644 | stop. */ | |
3645 | if (max_offset && INT_CST_LT (max_offset, offset)) | |
3646 | return 0; | |
3647 | ||
dbe91deb NS |
3648 | if (type == error_mark_node) |
3649 | return 0; | |
3db45ab5 | 3650 | |
c8094d83 | 3651 | if (!TYPE_P (type)) |
ff944b49 MM |
3652 | { |
3653 | if (abi_version_at_least (2)) | |
3654 | type_binfo = type; | |
3655 | type = BINFO_TYPE (type); | |
3656 | } | |
3657 | ||
c20118a8 | 3658 | if (CLASS_TYPE_P (type)) |
5c24fba6 | 3659 | { |
c20118a8 | 3660 | tree field; |
17bbb839 | 3661 | tree binfo; |
c20118a8 MM |
3662 | int i; |
3663 | ||
5ec1192e MM |
3664 | /* Avoid recursing into objects that are not interesting. */ |
3665 | if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3666 | return 0; | |
3667 | ||
c20118a8 MM |
3668 | /* Record the location of TYPE. */ |
3669 | r = (*f) (type, offset, offsets); | |
3670 | if (r) | |
3671 | return r; | |
3672 | ||
3673 | /* Iterate through the direct base classes of TYPE. */ | |
ff944b49 MM |
3674 | if (!type_binfo) |
3675 | type_binfo = TYPE_BINFO (type); | |
fa743e8c | 3676 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++) |
c20118a8 | 3677 | { |
ff944b49 MM |
3678 | tree binfo_offset; |
3679 | ||
c8094d83 | 3680 | if (abi_version_at_least (2) |
809e3e7f | 3681 | && BINFO_VIRTUAL_P (binfo)) |
17bbb839 | 3682 | continue; |
5c24fba6 | 3683 | |
c8094d83 MS |
3684 | if (!vbases_p |
3685 | && BINFO_VIRTUAL_P (binfo) | |
9965d119 | 3686 | && !BINFO_PRIMARY_P (binfo)) |
c20118a8 MM |
3687 | continue; |
3688 | ||
ff944b49 MM |
3689 | if (!abi_version_at_least (2)) |
3690 | binfo_offset = size_binop (PLUS_EXPR, | |
3691 | offset, | |
3692 | BINFO_OFFSET (binfo)); | |
3693 | else | |
3694 | { | |
3695 | tree orig_binfo; | |
3696 | /* We cannot rely on BINFO_OFFSET being set for the base | |
3697 | class yet, but the offsets for direct non-virtual | |
3698 | bases can be calculated by going back to the TYPE. */ | |
604a3205 | 3699 | orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i); |
c8094d83 | 3700 | binfo_offset = size_binop (PLUS_EXPR, |
ff944b49 MM |
3701 | offset, |
3702 | BINFO_OFFSET (orig_binfo)); | |
3703 | } | |
3704 | ||
3705 | r = walk_subobject_offsets (binfo, | |
c20118a8 | 3706 | f, |
ff944b49 | 3707 | binfo_offset, |
c20118a8 | 3708 | offsets, |
5cdba4ff | 3709 | max_offset, |
c8094d83 | 3710 | (abi_version_at_least (2) |
17bbb839 | 3711 | ? /*vbases_p=*/0 : vbases_p)); |
c20118a8 MM |
3712 | if (r) |
3713 | return r; | |
3714 | } | |
3715 | ||
58c42dc2 | 3716 | if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type)) |
17bbb839 | 3717 | { |
58c42dc2 | 3718 | unsigned ix; |
9771b263 | 3719 | vec<tree, va_gc> *vbases; |
17bbb839 | 3720 | |
ff944b49 MM |
3721 | /* Iterate through the virtual base classes of TYPE. In G++ |
3722 | 3.2, we included virtual bases in the direct base class | |
3723 | loop above, which results in incorrect results; the | |
3724 | correct offsets for virtual bases are only known when | |
3725 | working with the most derived type. */ | |
3726 | if (vbases_p) | |
9ba5ff0f | 3727 | for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0; |
9771b263 | 3728 | vec_safe_iterate (vbases, ix, &binfo); ix++) |
ff944b49 | 3729 | { |
ff944b49 MM |
3730 | r = walk_subobject_offsets (binfo, |
3731 | f, | |
3732 | size_binop (PLUS_EXPR, | |
3733 | offset, | |
3734 | BINFO_OFFSET (binfo)), | |
3735 | offsets, | |
3736 | max_offset, | |
3737 | /*vbases_p=*/0); | |
3738 | if (r) | |
3739 | return r; | |
3740 | } | |
3741 | else | |
17bbb839 | 3742 | { |
ff944b49 MM |
3743 | /* We still have to walk the primary base, if it is |
3744 | virtual. (If it is non-virtual, then it was walked | |
3745 | above.) */ | |
58c42dc2 | 3746 | tree vbase = get_primary_binfo (type_binfo); |
c8094d83 | 3747 | |
809e3e7f | 3748 | if (vbase && BINFO_VIRTUAL_P (vbase) |
fc6633e0 NS |
3749 | && BINFO_PRIMARY_P (vbase) |
3750 | && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo) | |
ff944b49 | 3751 | { |
c8094d83 | 3752 | r = (walk_subobject_offsets |
dbbf88d1 NS |
3753 | (vbase, f, offset, |
3754 | offsets, max_offset, /*vbases_p=*/0)); | |
3755 | if (r) | |
3756 | return r; | |
ff944b49 | 3757 | } |
17bbb839 MM |
3758 | } |
3759 | } | |
3760 | ||
c20118a8 | 3761 | /* Iterate through the fields of TYPE. */ |
910ad8de | 3762 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
17bbb839 | 3763 | if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field)) |
c20118a8 | 3764 | { |
956d9305 MM |
3765 | tree field_offset; |
3766 | ||
3767 | if (abi_version_at_least (2)) | |
3768 | field_offset = byte_position (field); | |
3769 | else | |
3770 | /* In G++ 3.2, DECL_FIELD_OFFSET was used. */ | |
3771 | field_offset = DECL_FIELD_OFFSET (field); | |
3772 | ||
c20118a8 MM |
3773 | r = walk_subobject_offsets (TREE_TYPE (field), |
3774 | f, | |
3775 | size_binop (PLUS_EXPR, | |
3776 | offset, | |
956d9305 | 3777 | field_offset), |
c20118a8 | 3778 | offsets, |
5cdba4ff | 3779 | max_offset, |
c20118a8 MM |
3780 | /*vbases_p=*/1); |
3781 | if (r) | |
3782 | return r; | |
3783 | } | |
5c24fba6 | 3784 | } |
c20118a8 MM |
3785 | else if (TREE_CODE (type) == ARRAY_TYPE) |
3786 | { | |
5ec1192e | 3787 | tree element_type = strip_array_types (type); |
c20118a8 MM |
3788 | tree domain = TYPE_DOMAIN (type); |
3789 | tree index; | |
5c24fba6 | 3790 | |
5ec1192e MM |
3791 | /* Avoid recursing into objects that are not interesting. */ |
3792 | if (!CLASS_TYPE_P (element_type) | |
3793 | || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type)) | |
3794 | return 0; | |
3795 | ||
c20118a8 | 3796 | /* Step through each of the elements in the array. */ |
17bbb839 MM |
3797 | for (index = size_zero_node; |
3798 | /* G++ 3.2 had an off-by-one error here. */ | |
c8094d83 | 3799 | (abi_version_at_least (2) |
17bbb839 MM |
3800 | ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index) |
3801 | : INT_CST_LT (index, TYPE_MAX_VALUE (domain))); | |
c20118a8 MM |
3802 | index = size_binop (PLUS_EXPR, index, size_one_node)) |
3803 | { | |
3804 | r = walk_subobject_offsets (TREE_TYPE (type), | |
3805 | f, | |
3806 | offset, | |
3807 | offsets, | |
5cdba4ff | 3808 | max_offset, |
c20118a8 MM |
3809 | /*vbases_p=*/1); |
3810 | if (r) | |
3811 | return r; | |
c8094d83 | 3812 | offset = size_binop (PLUS_EXPR, offset, |
c20118a8 | 3813 | TYPE_SIZE_UNIT (TREE_TYPE (type))); |
5cdba4ff MM |
3814 | /* If this new OFFSET is bigger than the MAX_OFFSET, then |
3815 | there's no point in iterating through the remaining | |
3816 | elements of the array. */ | |
3817 | if (max_offset && INT_CST_LT (max_offset, offset)) | |
3818 | break; | |
c20118a8 MM |
3819 | } |
3820 | } | |
3821 | ||
3822 | return 0; | |
3823 | } | |
3824 | ||
c0572427 MM |
3825 | /* Record all of the empty subobjects of TYPE (either a type or a |
3826 | binfo). If IS_DATA_MEMBER is true, then a non-static data member | |
c5a35c3c MM |
3827 | is being placed at OFFSET; otherwise, it is a base class that is |
3828 | being placed at OFFSET. */ | |
c20118a8 MM |
3829 | |
3830 | static void | |
c8094d83 | 3831 | record_subobject_offsets (tree type, |
0cbd7506 MS |
3832 | tree offset, |
3833 | splay_tree offsets, | |
c5a35c3c | 3834 | bool is_data_member) |
c20118a8 | 3835 | { |
c5a35c3c | 3836 | tree max_offset; |
c0572427 MM |
3837 | /* If recording subobjects for a non-static data member or a |
3838 | non-empty base class , we do not need to record offsets beyond | |
3839 | the size of the biggest empty class. Additional data members | |
3840 | will go at the end of the class. Additional base classes will go | |
3841 | either at offset zero (if empty, in which case they cannot | |
3842 | overlap with offsets past the size of the biggest empty class) or | |
3843 | at the end of the class. | |
3844 | ||
3845 | However, if we are placing an empty base class, then we must record | |
c5a35c3c MM |
3846 | all offsets, as either the empty class is at offset zero (where |
3847 | other empty classes might later be placed) or at the end of the | |
3848 | class (where other objects might then be placed, so other empty | |
3849 | subobjects might later overlap). */ | |
3db45ab5 | 3850 | if (is_data_member |
c0572427 | 3851 | || !is_empty_class (BINFO_TYPE (type))) |
c5a35c3c MM |
3852 | max_offset = sizeof_biggest_empty_class; |
3853 | else | |
3854 | max_offset = NULL_TREE; | |
c20118a8 | 3855 | walk_subobject_offsets (type, record_subobject_offset, offset, |
c5a35c3c | 3856 | offsets, max_offset, is_data_member); |
5c24fba6 MM |
3857 | } |
3858 | ||
838dfd8a KH |
3859 | /* Returns nonzero if any of the empty subobjects of TYPE (located at |
3860 | OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero, | |
c20118a8 | 3861 | virtual bases of TYPE are examined. */ |
9785e4b1 MM |
3862 | |
3863 | static int | |
94edc4ab | 3864 | layout_conflict_p (tree type, |
0cbd7506 MS |
3865 | tree offset, |
3866 | splay_tree offsets, | |
3867 | int vbases_p) | |
9785e4b1 | 3868 | { |
5cdba4ff MM |
3869 | splay_tree_node max_node; |
3870 | ||
3871 | /* Get the node in OFFSETS that indicates the maximum offset where | |
3872 | an empty subobject is located. */ | |
3873 | max_node = splay_tree_max (offsets); | |
3874 | /* If there aren't any empty subobjects, then there's no point in | |
3875 | performing this check. */ | |
3876 | if (!max_node) | |
3877 | return 0; | |
3878 | ||
c20118a8 | 3879 | return walk_subobject_offsets (type, check_subobject_offset, offset, |
5cdba4ff MM |
3880 | offsets, (tree) (max_node->key), |
3881 | vbases_p); | |
9785e4b1 MM |
3882 | } |
3883 | ||
5c24fba6 MM |
3884 | /* DECL is a FIELD_DECL corresponding either to a base subobject of a |
3885 | non-static data member of the type indicated by RLI. BINFO is the | |
c20118a8 | 3886 | binfo corresponding to the base subobject, OFFSETS maps offsets to |
17bbb839 MM |
3887 | types already located at those offsets. This function determines |
3888 | the position of the DECL. */ | |
5c24fba6 MM |
3889 | |
3890 | static void | |
c8094d83 MS |
3891 | layout_nonempty_base_or_field (record_layout_info rli, |
3892 | tree decl, | |
3893 | tree binfo, | |
17bbb839 | 3894 | splay_tree offsets) |
5c24fba6 | 3895 | { |
c20118a8 | 3896 | tree offset = NULL_TREE; |
17bbb839 MM |
3897 | bool field_p; |
3898 | tree type; | |
c8094d83 | 3899 | |
17bbb839 MM |
3900 | if (binfo) |
3901 | { | |
3902 | /* For the purposes of determining layout conflicts, we want to | |
3903 | use the class type of BINFO; TREE_TYPE (DECL) will be the | |
3904 | CLASSTYPE_AS_BASE version, which does not contain entries for | |
3905 | zero-sized bases. */ | |
3906 | type = TREE_TYPE (binfo); | |
3907 | field_p = false; | |
3908 | } | |
3909 | else | |
3910 | { | |
3911 | type = TREE_TYPE (decl); | |
3912 | field_p = true; | |
3913 | } | |
c20118a8 | 3914 | |
5c24fba6 MM |
3915 | /* Try to place the field. It may take more than one try if we have |
3916 | a hard time placing the field without putting two objects of the | |
3917 | same type at the same address. */ | |
3918 | while (1) | |
3919 | { | |
defd0dea | 3920 | struct record_layout_info_s old_rli = *rli; |
5c24fba6 | 3921 | |
770ae6cc RK |
3922 | /* Place this field. */ |
3923 | place_field (rli, decl); | |
da3d4dfa | 3924 | offset = byte_position (decl); |
1e2e9f54 | 3925 | |
5c24fba6 MM |
3926 | /* We have to check to see whether or not there is already |
3927 | something of the same type at the offset we're about to use. | |
1e2e9f54 | 3928 | For example, consider: |
c8094d83 | 3929 | |
1e2e9f54 MM |
3930 | struct S {}; |
3931 | struct T : public S { int i; }; | |
3932 | struct U : public S, public T {}; | |
c8094d83 | 3933 | |
5c24fba6 MM |
3934 | Here, we put S at offset zero in U. Then, we can't put T at |
3935 | offset zero -- its S component would be at the same address | |
3936 | as the S we already allocated. So, we have to skip ahead. | |
3937 | Since all data members, including those whose type is an | |
838dfd8a | 3938 | empty class, have nonzero size, any overlap can happen only |
5c24fba6 MM |
3939 | with a direct or indirect base-class -- it can't happen with |
3940 | a data member. */ | |
1e2e9f54 MM |
3941 | /* In a union, overlap is permitted; all members are placed at |
3942 | offset zero. */ | |
3943 | if (TREE_CODE (rli->t) == UNION_TYPE) | |
3944 | break; | |
7ba539c6 MM |
3945 | /* G++ 3.2 did not check for overlaps when placing a non-empty |
3946 | virtual base. */ | |
809e3e7f | 3947 | if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo)) |
7ba539c6 | 3948 | break; |
c8094d83 | 3949 | if (layout_conflict_p (field_p ? type : binfo, offset, |
ff944b49 | 3950 | offsets, field_p)) |
5c24fba6 | 3951 | { |
5c24fba6 MM |
3952 | /* Strip off the size allocated to this field. That puts us |
3953 | at the first place we could have put the field with | |
3954 | proper alignment. */ | |
770ae6cc RK |
3955 | *rli = old_rli; |
3956 | ||
c20118a8 | 3957 | /* Bump up by the alignment required for the type. */ |
770ae6cc | 3958 | rli->bitpos |
c8094d83 MS |
3959 | = size_binop (PLUS_EXPR, rli->bitpos, |
3960 | bitsize_int (binfo | |
c20118a8 MM |
3961 | ? CLASSTYPE_ALIGN (type) |
3962 | : TYPE_ALIGN (type))); | |
770ae6cc | 3963 | normalize_rli (rli); |
5c24fba6 MM |
3964 | } |
3965 | else | |
3966 | /* There was no conflict. We're done laying out this field. */ | |
3967 | break; | |
3968 | } | |
c20118a8 | 3969 | |
623fe76a | 3970 | /* Now that we know where it will be placed, update its |
c20118a8 MM |
3971 | BINFO_OFFSET. */ |
3972 | if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo))) | |
90024bdc | 3973 | /* Indirect virtual bases may have a nonzero BINFO_OFFSET at |
17bbb839 MM |
3974 | this point because their BINFO_OFFSET is copied from another |
3975 | hierarchy. Therefore, we may not need to add the entire | |
3976 | OFFSET. */ | |
c8094d83 | 3977 | propagate_binfo_offsets (binfo, |
db3927fb AH |
3978 | size_diffop_loc (input_location, |
3979 | convert (ssizetype, offset), | |
c8094d83 | 3980 | convert (ssizetype, |
dbbf88d1 | 3981 | BINFO_OFFSET (binfo)))); |
5c24fba6 MM |
3982 | } |
3983 | ||
90024bdc | 3984 | /* Returns true if TYPE is empty and OFFSET is nonzero. */ |
7ba539c6 MM |
3985 | |
3986 | static int | |
3987 | empty_base_at_nonzero_offset_p (tree type, | |
3988 | tree offset, | |
12308bc6 | 3989 | splay_tree /*offsets*/) |
7ba539c6 MM |
3990 | { |
3991 | return is_empty_class (type) && !integer_zerop (offset); | |
3992 | } | |
3993 | ||
9785e4b1 | 3994 | /* Layout the empty base BINFO. EOC indicates the byte currently just |
ec386958 | 3995 | past the end of the class, and should be correctly aligned for a |
c20118a8 | 3996 | class of the type indicated by BINFO; OFFSETS gives the offsets of |
623fe76a | 3997 | the empty bases allocated so far. T is the most derived |
838dfd8a | 3998 | type. Return nonzero iff we added it at the end. */ |
9785e4b1 | 3999 | |
06d9f09f | 4000 | static bool |
d9d9dbc0 JM |
4001 | layout_empty_base (record_layout_info rli, tree binfo, |
4002 | tree eoc, splay_tree offsets) | |
9785e4b1 | 4003 | { |
ec386958 | 4004 | tree alignment; |
9785e4b1 | 4005 | tree basetype = BINFO_TYPE (binfo); |
06d9f09f | 4006 | bool atend = false; |
956d9305 | 4007 | |
9785e4b1 | 4008 | /* This routine should only be used for empty classes. */ |
50bc768d | 4009 | gcc_assert (is_empty_class (basetype)); |
1b50716d | 4010 | alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype)); |
9785e4b1 | 4011 | |
3075b327 NS |
4012 | if (!integer_zerop (BINFO_OFFSET (binfo))) |
4013 | { | |
4014 | if (abi_version_at_least (2)) | |
4015 | propagate_binfo_offsets | |
db3927fb AH |
4016 | (binfo, size_diffop_loc (input_location, |
4017 | size_zero_node, BINFO_OFFSET (binfo))); | |
74fa0285 GDR |
4018 | else |
4019 | warning (OPT_Wabi, | |
3db45ab5 | 4020 | "offset of empty base %qT may not be ABI-compliant and may" |
3075b327 NS |
4021 | "change in a future version of GCC", |
4022 | BINFO_TYPE (binfo)); | |
4023 | } | |
c8094d83 | 4024 | |
9785e4b1 MM |
4025 | /* This is an empty base class. We first try to put it at offset |
4026 | zero. */ | |
ff944b49 | 4027 | if (layout_conflict_p (binfo, |
c20118a8 | 4028 | BINFO_OFFSET (binfo), |
c8094d83 | 4029 | offsets, |
c20118a8 | 4030 | /*vbases_p=*/0)) |
9785e4b1 MM |
4031 | { |
4032 | /* That didn't work. Now, we move forward from the next | |
4033 | available spot in the class. */ | |
06d9f09f | 4034 | atend = true; |
dbbf88d1 | 4035 | propagate_binfo_offsets (binfo, convert (ssizetype, eoc)); |
c8094d83 | 4036 | while (1) |
9785e4b1 | 4037 | { |
ff944b49 | 4038 | if (!layout_conflict_p (binfo, |
c8094d83 | 4039 | BINFO_OFFSET (binfo), |
c20118a8 MM |
4040 | offsets, |
4041 | /*vbases_p=*/0)) | |
9785e4b1 MM |
4042 | /* We finally found a spot where there's no overlap. */ |
4043 | break; | |
4044 | ||
4045 | /* There's overlap here, too. Bump along to the next spot. */ | |
dbbf88d1 | 4046 | propagate_binfo_offsets (binfo, alignment); |
9785e4b1 MM |
4047 | } |
4048 | } | |
d9d9dbc0 JM |
4049 | |
4050 | if (CLASSTYPE_USER_ALIGN (basetype)) | |
4051 | { | |
4052 | rli->record_align = MAX (rli->record_align, CLASSTYPE_ALIGN (basetype)); | |
4053 | if (warn_packed) | |
4054 | rli->unpacked_align = MAX (rli->unpacked_align, CLASSTYPE_ALIGN (basetype)); | |
4055 | TYPE_USER_ALIGN (rli->t) = 1; | |
4056 | } | |
4057 | ||
06d9f09f | 4058 | return atend; |
9785e4b1 MM |
4059 | } |
4060 | ||
78dcd41a | 4061 | /* Layout the base given by BINFO in the class indicated by RLI. |
58731fd1 | 4062 | *BASE_ALIGN is a running maximum of the alignments of |
17bbb839 MM |
4063 | any base class. OFFSETS gives the location of empty base |
4064 | subobjects. T is the most derived type. Return nonzero if the new | |
4065 | object cannot be nearly-empty. A new FIELD_DECL is inserted at | |
c8094d83 | 4066 | *NEXT_FIELD, unless BINFO is for an empty base class. |
5c24fba6 | 4067 | |
17bbb839 MM |
4068 | Returns the location at which the next field should be inserted. */ |
4069 | ||
4070 | static tree * | |
58731fd1 | 4071 | build_base_field (record_layout_info rli, tree binfo, |
17bbb839 | 4072 | splay_tree offsets, tree *next_field) |
d77249e7 | 4073 | { |
17bbb839 | 4074 | tree t = rli->t; |
d77249e7 | 4075 | tree basetype = BINFO_TYPE (binfo); |
d77249e7 | 4076 | |
d0f062fb | 4077 | if (!COMPLETE_TYPE_P (basetype)) |
d77249e7 MM |
4078 | /* This error is now reported in xref_tag, thus giving better |
4079 | location information. */ | |
17bbb839 | 4080 | return next_field; |
c8094d83 | 4081 | |
17bbb839 MM |
4082 | /* Place the base class. */ |
4083 | if (!is_empty_class (basetype)) | |
5c24fba6 | 4084 | { |
17bbb839 MM |
4085 | tree decl; |
4086 | ||
5c24fba6 MM |
4087 | /* The containing class is non-empty because it has a non-empty |
4088 | base class. */ | |
58731fd1 | 4089 | CLASSTYPE_EMPTY_P (t) = 0; |
c8094d83 | 4090 | |
17bbb839 | 4091 | /* Create the FIELD_DECL. */ |
c2255bc4 AH |
4092 | decl = build_decl (input_location, |
4093 | FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype)); | |
17bbb839 | 4094 | DECL_ARTIFICIAL (decl) = 1; |
78e0d62b | 4095 | DECL_IGNORED_P (decl) = 1; |
17bbb839 | 4096 | DECL_FIELD_CONTEXT (decl) = t; |
1ad8aeeb DG |
4097 | if (CLASSTYPE_AS_BASE (basetype)) |
4098 | { | |
4099 | DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype); | |
4100 | DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype); | |
4101 | DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype); | |
4102 | DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype); | |
4103 | DECL_MODE (decl) = TYPE_MODE (basetype); | |
4104 | DECL_FIELD_IS_BASE (decl) = 1; | |
4105 | ||
4106 | /* Try to place the field. It may take more than one try if we | |
4107 | have a hard time placing the field without putting two | |
4108 | objects of the same type at the same address. */ | |
4109 | layout_nonempty_base_or_field (rli, decl, binfo, offsets); | |
4110 | /* Add the new FIELD_DECL to the list of fields for T. */ | |
910ad8de | 4111 | DECL_CHAIN (decl) = *next_field; |
1ad8aeeb | 4112 | *next_field = decl; |
910ad8de | 4113 | next_field = &DECL_CHAIN (decl); |
1ad8aeeb | 4114 | } |
5c24fba6 MM |
4115 | } |
4116 | else | |
ec386958 | 4117 | { |
17bbb839 | 4118 | tree eoc; |
7ba539c6 | 4119 | bool atend; |
ec386958 MM |
4120 | |
4121 | /* On some platforms (ARM), even empty classes will not be | |
4122 | byte-aligned. */ | |
db3927fb AH |
4123 | eoc = round_up_loc (input_location, |
4124 | rli_size_unit_so_far (rli), | |
17bbb839 | 4125 | CLASSTYPE_ALIGN_UNIT (basetype)); |
d9d9dbc0 | 4126 | atend = layout_empty_base (rli, binfo, eoc, offsets); |
7ba539c6 MM |
4127 | /* A nearly-empty class "has no proper base class that is empty, |
4128 | not morally virtual, and at an offset other than zero." */ | |
809e3e7f | 4129 | if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t)) |
7ba539c6 MM |
4130 | { |
4131 | if (atend) | |
4132 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
c5a35c3c | 4133 | /* The check above (used in G++ 3.2) is insufficient because |
7ba539c6 | 4134 | an empty class placed at offset zero might itself have an |
90024bdc | 4135 | empty base at a nonzero offset. */ |
c8094d83 | 4136 | else if (walk_subobject_offsets (basetype, |
7ba539c6 MM |
4137 | empty_base_at_nonzero_offset_p, |
4138 | size_zero_node, | |
4139 | /*offsets=*/NULL, | |
4140 | /*max_offset=*/NULL_TREE, | |
4141 | /*vbases_p=*/true)) | |
4142 | { | |
4143 | if (abi_version_at_least (2)) | |
4144 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
74fa0285 GDR |
4145 | else |
4146 | warning (OPT_Wabi, | |
3db45ab5 | 4147 | "class %qT will be considered nearly empty in a " |
7ba539c6 MM |
4148 | "future version of GCC", t); |
4149 | } | |
4150 | } | |
c8094d83 | 4151 | |
17bbb839 MM |
4152 | /* We do not create a FIELD_DECL for empty base classes because |
4153 | it might overlap some other field. We want to be able to | |
4154 | create CONSTRUCTORs for the class by iterating over the | |
4155 | FIELD_DECLs, and the back end does not handle overlapping | |
4156 | FIELD_DECLs. */ | |
58731fd1 MM |
4157 | |
4158 | /* An empty virtual base causes a class to be non-empty | |
4159 | -- but in that case we do not need to clear CLASSTYPE_EMPTY_P | |
4160 | here because that was already done when the virtual table | |
4161 | pointer was created. */ | |
ec386958 | 4162 | } |
5c24fba6 | 4163 | |
5c24fba6 | 4164 | /* Record the offsets of BINFO and its base subobjects. */ |
ff944b49 | 4165 | record_subobject_offsets (binfo, |
c20118a8 | 4166 | BINFO_OFFSET (binfo), |
c8094d83 | 4167 | offsets, |
c5a35c3c | 4168 | /*is_data_member=*/false); |
17bbb839 MM |
4169 | |
4170 | return next_field; | |
d77249e7 MM |
4171 | } |
4172 | ||
c20118a8 | 4173 | /* Layout all of the non-virtual base classes. Record empty |
17bbb839 MM |
4174 | subobjects in OFFSETS. T is the most derived type. Return nonzero |
4175 | if the type cannot be nearly empty. The fields created | |
4176 | corresponding to the base classes will be inserted at | |
4177 | *NEXT_FIELD. */ | |
607cf131 | 4178 | |
17bbb839 | 4179 | static void |
58731fd1 | 4180 | build_base_fields (record_layout_info rli, |
17bbb839 | 4181 | splay_tree offsets, tree *next_field) |
607cf131 MM |
4182 | { |
4183 | /* Chain to hold all the new FIELD_DECLs which stand in for base class | |
4184 | subobjects. */ | |
17bbb839 | 4185 | tree t = rli->t; |
604a3205 | 4186 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
5c24fba6 | 4187 | int i; |
607cf131 | 4188 | |
3461fba7 | 4189 | /* The primary base class is always allocated first. */ |
17bbb839 MM |
4190 | if (CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
4191 | next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t), | |
58731fd1 | 4192 | offsets, next_field); |
d77249e7 MM |
4193 | |
4194 | /* Now allocate the rest of the bases. */ | |
607cf131 MM |
4195 | for (i = 0; i < n_baseclasses; ++i) |
4196 | { | |
d77249e7 | 4197 | tree base_binfo; |
607cf131 | 4198 | |
604a3205 | 4199 | base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i); |
911a71a7 | 4200 | |
3461fba7 NS |
4201 | /* The primary base was already allocated above, so we don't |
4202 | need to allocate it again here. */ | |
17bbb839 | 4203 | if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t)) |
607cf131 MM |
4204 | continue; |
4205 | ||
dbbf88d1 NS |
4206 | /* Virtual bases are added at the end (a primary virtual base |
4207 | will have already been added). */ | |
809e3e7f | 4208 | if (BINFO_VIRTUAL_P (base_binfo)) |
607cf131 MM |
4209 | continue; |
4210 | ||
58731fd1 | 4211 | next_field = build_base_field (rli, base_binfo, |
17bbb839 | 4212 | offsets, next_field); |
607cf131 | 4213 | } |
607cf131 MM |
4214 | } |
4215 | ||
58010b57 MM |
4216 | /* Go through the TYPE_METHODS of T issuing any appropriate |
4217 | diagnostics, figuring out which methods override which other | |
3ef397c1 | 4218 | methods, and so forth. */ |
58010b57 MM |
4219 | |
4220 | static void | |
94edc4ab | 4221 | check_methods (tree t) |
58010b57 MM |
4222 | { |
4223 | tree x; | |
58010b57 | 4224 | |
910ad8de | 4225 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
58010b57 | 4226 | { |
58010b57 | 4227 | check_for_override (x, t); |
fee7654e | 4228 | if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x)) |
dee15844 | 4229 | error ("initializer specified for non-virtual method %q+D", x); |
58010b57 MM |
4230 | /* The name of the field is the original field name |
4231 | Save this in auxiliary field for later overloading. */ | |
4232 | if (DECL_VINDEX (x)) | |
4233 | { | |
3ef397c1 | 4234 | TYPE_POLYMORPHIC_P (t) = 1; |
fee7654e | 4235 | if (DECL_PURE_VIRTUAL_P (x)) |
9771b263 | 4236 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x); |
58010b57 | 4237 | } |
46408846 JM |
4238 | /* All user-provided destructors are non-trivial. |
4239 | Constructors and assignment ops are handled in | |
4240 | grok_special_member_properties. */ | |
20f2653e | 4241 | if (DECL_DESTRUCTOR_P (x) && user_provided_p (x)) |
9f4faeae | 4242 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1; |
58010b57 | 4243 | } |
58010b57 MM |
4244 | } |
4245 | ||
db9b2174 MM |
4246 | /* FN is a constructor or destructor. Clone the declaration to create |
4247 | a specialized in-charge or not-in-charge version, as indicated by | |
4248 | NAME. */ | |
4249 | ||
4250 | static tree | |
94edc4ab | 4251 | build_clone (tree fn, tree name) |
db9b2174 MM |
4252 | { |
4253 | tree parms; | |
4254 | tree clone; | |
4255 | ||
4256 | /* Copy the function. */ | |
4257 | clone = copy_decl (fn); | |
db9b2174 MM |
4258 | /* Reset the function name. */ |
4259 | DECL_NAME (clone) = name; | |
71cb9286 | 4260 | SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE); |
b97e8a14 JM |
4261 | /* Remember where this function came from. */ |
4262 | DECL_ABSTRACT_ORIGIN (clone) = fn; | |
4263 | /* Make it easy to find the CLONE given the FN. */ | |
910ad8de NF |
4264 | DECL_CHAIN (clone) = DECL_CHAIN (fn); |
4265 | DECL_CHAIN (fn) = clone; | |
b97e8a14 JM |
4266 | |
4267 | /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */ | |
4268 | if (TREE_CODE (clone) == TEMPLATE_DECL) | |
4269 | { | |
4270 | tree result = build_clone (DECL_TEMPLATE_RESULT (clone), name); | |
4271 | DECL_TEMPLATE_RESULT (clone) = result; | |
4272 | DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result)); | |
4273 | DECL_TI_TEMPLATE (result) = clone; | |
4274 | TREE_TYPE (clone) = TREE_TYPE (result); | |
4275 | return clone; | |
4276 | } | |
4277 | ||
4278 | DECL_CLONED_FUNCTION (clone) = fn; | |
db9b2174 MM |
4279 | /* There's no pending inline data for this function. */ |
4280 | DECL_PENDING_INLINE_INFO (clone) = NULL; | |
4281 | DECL_PENDING_INLINE_P (clone) = 0; | |
db9b2174 | 4282 | |
298d6f60 MM |
4283 | /* The base-class destructor is not virtual. */ |
4284 | if (name == base_dtor_identifier) | |
4285 | { | |
4286 | DECL_VIRTUAL_P (clone) = 0; | |
4287 | if (TREE_CODE (clone) != TEMPLATE_DECL) | |
4288 | DECL_VINDEX (clone) = NULL_TREE; | |
4289 | } | |
4290 | ||
4e7512c9 | 4291 | /* If there was an in-charge parameter, drop it from the function |
db9b2174 MM |
4292 | type. */ |
4293 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4294 | { | |
4295 | tree basetype; | |
4296 | tree parmtypes; | |
4297 | tree exceptions; | |
4298 | ||
4299 | exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); | |
4300 | basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); | |
4301 | parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4302 | /* Skip the `this' parameter. */ | |
4303 | parmtypes = TREE_CHAIN (parmtypes); | |
4304 | /* Skip the in-charge parameter. */ | |
4305 | parmtypes = TREE_CHAIN (parmtypes); | |
e0fff4b3 JM |
4306 | /* And the VTT parm, in a complete [cd]tor. */ |
4307 | if (DECL_HAS_VTT_PARM_P (fn) | |
4308 | && ! DECL_NEEDS_VTT_PARM_P (clone)) | |
4309 | parmtypes = TREE_CHAIN (parmtypes); | |
3ec6bad3 MM |
4310 | /* If this is subobject constructor or destructor, add the vtt |
4311 | parameter. */ | |
c8094d83 | 4312 | TREE_TYPE (clone) |
43dc123f MM |
4313 | = build_method_type_directly (basetype, |
4314 | TREE_TYPE (TREE_TYPE (clone)), | |
4315 | parmtypes); | |
db9b2174 MM |
4316 | if (exceptions) |
4317 | TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone), | |
4318 | exceptions); | |
c8094d83 | 4319 | TREE_TYPE (clone) |
e9525111 MM |
4320 | = cp_build_type_attribute_variant (TREE_TYPE (clone), |
4321 | TYPE_ATTRIBUTES (TREE_TYPE (fn))); | |
db9b2174 MM |
4322 | } |
4323 | ||
b97e8a14 JM |
4324 | /* Copy the function parameters. */ |
4325 | DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone)); | |
4326 | /* Remove the in-charge parameter. */ | |
4327 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4328 | { | |
910ad8de NF |
4329 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4330 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 JM |
4331 | DECL_HAS_IN_CHARGE_PARM_P (clone) = 0; |
4332 | } | |
4333 | /* And the VTT parm, in a complete [cd]tor. */ | |
4334 | if (DECL_HAS_VTT_PARM_P (fn)) | |
db9b2174 | 4335 | { |
b97e8a14 JM |
4336 | if (DECL_NEEDS_VTT_PARM_P (clone)) |
4337 | DECL_HAS_VTT_PARM_P (clone) = 1; | |
4338 | else | |
db9b2174 | 4339 | { |
910ad8de NF |
4340 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4341 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 | 4342 | DECL_HAS_VTT_PARM_P (clone) = 0; |
3ec6bad3 | 4343 | } |
b97e8a14 | 4344 | } |
3ec6bad3 | 4345 | |
910ad8de | 4346 | for (parms = DECL_ARGUMENTS (clone); parms; parms = DECL_CHAIN (parms)) |
b97e8a14 JM |
4347 | { |
4348 | DECL_CONTEXT (parms) = clone; | |
4349 | cxx_dup_lang_specific_decl (parms); | |
db9b2174 MM |
4350 | } |
4351 | ||
db9b2174 | 4352 | /* Create the RTL for this function. */ |
245763e3 | 4353 | SET_DECL_RTL (clone, NULL); |
0e6df31e | 4354 | rest_of_decl_compilation (clone, /*top_level=*/1, at_eof); |
c8094d83 | 4355 | |
b97e8a14 JM |
4356 | if (pch_file) |
4357 | note_decl_for_pch (clone); | |
db9b2174 | 4358 | |
b97e8a14 JM |
4359 | return clone; |
4360 | } | |
db9b2174 | 4361 | |
b97e8a14 JM |
4362 | /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do |
4363 | not invoke this function directly. | |
4364 | ||
4365 | For a non-thunk function, returns the address of the slot for storing | |
4366 | the function it is a clone of. Otherwise returns NULL_TREE. | |
4367 | ||
4368 | If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if | |
4369 | cloned_function is unset. This is to support the separate | |
4370 | DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter | |
4371 | on a template makes sense, but not the former. */ | |
4372 | ||
4373 | tree * | |
4374 | decl_cloned_function_p (const_tree decl, bool just_testing) | |
4375 | { | |
4376 | tree *ptr; | |
4377 | if (just_testing) | |
4378 | decl = STRIP_TEMPLATE (decl); | |
4379 | ||
4380 | if (TREE_CODE (decl) != FUNCTION_DECL | |
4381 | || !DECL_LANG_SPECIFIC (decl) | |
4382 | || DECL_LANG_SPECIFIC (decl)->u.fn.thunk_p) | |
4383 | { | |
4384 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
4385 | if (!just_testing) | |
4386 | lang_check_failed (__FILE__, __LINE__, __FUNCTION__); | |
4387 | else | |
4388 | #endif | |
4389 | return NULL; | |
db9b2174 MM |
4390 | } |
4391 | ||
b97e8a14 JM |
4392 | ptr = &DECL_LANG_SPECIFIC (decl)->u.fn.u5.cloned_function; |
4393 | if (just_testing && *ptr == NULL_TREE) | |
4394 | return NULL; | |
4395 | else | |
4396 | return ptr; | |
db9b2174 MM |
4397 | } |
4398 | ||
4399 | /* Produce declarations for all appropriate clones of FN. If | |
838dfd8a | 4400 | UPDATE_METHOD_VEC_P is nonzero, the clones are added to the |
db9b2174 MM |
4401 | CLASTYPE_METHOD_VEC as well. */ |
4402 | ||
4403 | void | |
94edc4ab | 4404 | clone_function_decl (tree fn, int update_method_vec_p) |
db9b2174 MM |
4405 | { |
4406 | tree clone; | |
4407 | ||
c00996a3 | 4408 | /* Avoid inappropriate cloning. */ |
910ad8de NF |
4409 | if (DECL_CHAIN (fn) |
4410 | && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn))) | |
c00996a3 JM |
4411 | return; |
4412 | ||
298d6f60 | 4413 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) |
db9b2174 | 4414 | { |
298d6f60 MM |
4415 | /* For each constructor, we need two variants: an in-charge version |
4416 | and a not-in-charge version. */ | |
db9b2174 MM |
4417 | clone = build_clone (fn, complete_ctor_identifier); |
4418 | if (update_method_vec_p) | |
b2a9b208 | 4419 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4420 | clone = build_clone (fn, base_ctor_identifier); |
4421 | if (update_method_vec_p) | |
b2a9b208 | 4422 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4423 | } |
4424 | else | |
298d6f60 | 4425 | { |
50bc768d | 4426 | gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)); |
298d6f60 | 4427 | |
3ec6bad3 | 4428 | /* For each destructor, we need three variants: an in-charge |
298d6f60 | 4429 | version, a not-in-charge version, and an in-charge deleting |
4e7512c9 MM |
4430 | version. We clone the deleting version first because that |
4431 | means it will go second on the TYPE_METHODS list -- and that | |
4432 | corresponds to the correct layout order in the virtual | |
c8094d83 | 4433 | function table. |
52682a1b | 4434 | |
0cbd7506 | 4435 | For a non-virtual destructor, we do not build a deleting |
52682a1b MM |
4436 | destructor. */ |
4437 | if (DECL_VIRTUAL_P (fn)) | |
4438 | { | |
4439 | clone = build_clone (fn, deleting_dtor_identifier); | |
4440 | if (update_method_vec_p) | |
b2a9b208 | 4441 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
52682a1b | 4442 | } |
4e7512c9 | 4443 | clone = build_clone (fn, complete_dtor_identifier); |
298d6f60 | 4444 | if (update_method_vec_p) |
b2a9b208 | 4445 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 MM |
4446 | clone = build_clone (fn, base_dtor_identifier); |
4447 | if (update_method_vec_p) | |
b2a9b208 | 4448 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 | 4449 | } |
5daf7c0a JM |
4450 | |
4451 | /* Note that this is an abstract function that is never emitted. */ | |
4452 | DECL_ABSTRACT (fn) = 1; | |
db9b2174 MM |
4453 | } |
4454 | ||
5f6eeeb3 NS |
4455 | /* DECL is an in charge constructor, which is being defined. This will |
4456 | have had an in class declaration, from whence clones were | |
4457 | declared. An out-of-class definition can specify additional default | |
4458 | arguments. As it is the clones that are involved in overload | |
4459 | resolution, we must propagate the information from the DECL to its | |
00a17e31 | 4460 | clones. */ |
5f6eeeb3 NS |
4461 | |
4462 | void | |
94edc4ab | 4463 | adjust_clone_args (tree decl) |
5f6eeeb3 NS |
4464 | { |
4465 | tree clone; | |
c8094d83 | 4466 | |
910ad8de NF |
4467 | for (clone = DECL_CHAIN (decl); clone && DECL_CLONED_FUNCTION_P (clone); |
4468 | clone = DECL_CHAIN (clone)) | |
5f6eeeb3 NS |
4469 | { |
4470 | tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4471 | tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
4472 | tree decl_parms, clone_parms; | |
4473 | ||
4474 | clone_parms = orig_clone_parms; | |
c8094d83 | 4475 | |
00a17e31 | 4476 | /* Skip the 'this' parameter. */ |
5f6eeeb3 NS |
4477 | orig_clone_parms = TREE_CHAIN (orig_clone_parms); |
4478 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4479 | ||
4480 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) | |
4481 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4482 | if (DECL_HAS_VTT_PARM_P (decl)) | |
4483 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
c8094d83 | 4484 | |
5f6eeeb3 NS |
4485 | clone_parms = orig_clone_parms; |
4486 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4487 | clone_parms = TREE_CHAIN (clone_parms); | |
c8094d83 | 4488 | |
5f6eeeb3 NS |
4489 | for (decl_parms = orig_decl_parms; decl_parms; |
4490 | decl_parms = TREE_CHAIN (decl_parms), | |
4491 | clone_parms = TREE_CHAIN (clone_parms)) | |
4492 | { | |
50bc768d NS |
4493 | gcc_assert (same_type_p (TREE_TYPE (decl_parms), |
4494 | TREE_TYPE (clone_parms))); | |
c8094d83 | 4495 | |
5f6eeeb3 NS |
4496 | if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms)) |
4497 | { | |
4498 | /* A default parameter has been added. Adjust the | |
00a17e31 | 4499 | clone's parameters. */ |
5f6eeeb3 | 4500 | tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); |
3c3905fc | 4501 | tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (clone)); |
5f6eeeb3 NS |
4502 | tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); |
4503 | tree type; | |
4504 | ||
4505 | clone_parms = orig_decl_parms; | |
4506 | ||
4507 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4508 | { | |
4509 | clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms), | |
4510 | TREE_VALUE (orig_clone_parms), | |
4511 | clone_parms); | |
4512 | TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms); | |
4513 | } | |
43dc123f MM |
4514 | type = build_method_type_directly (basetype, |
4515 | TREE_TYPE (TREE_TYPE (clone)), | |
4516 | clone_parms); | |
5f6eeeb3 NS |
4517 | if (exceptions) |
4518 | type = build_exception_variant (type, exceptions); | |
3c3905fc JM |
4519 | if (attrs) |
4520 | type = cp_build_type_attribute_variant (type, attrs); | |
5f6eeeb3 | 4521 | TREE_TYPE (clone) = type; |
c8094d83 | 4522 | |
5f6eeeb3 NS |
4523 | clone_parms = NULL_TREE; |
4524 | break; | |
4525 | } | |
4526 | } | |
50bc768d | 4527 | gcc_assert (!clone_parms); |
5f6eeeb3 NS |
4528 | } |
4529 | } | |
4530 | ||
db9b2174 MM |
4531 | /* For each of the constructors and destructors in T, create an |
4532 | in-charge and not-in-charge variant. */ | |
4533 | ||
4534 | static void | |
94edc4ab | 4535 | clone_constructors_and_destructors (tree t) |
db9b2174 MM |
4536 | { |
4537 | tree fns; | |
4538 | ||
db9b2174 MM |
4539 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail |
4540 | out now. */ | |
4541 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4542 | return; | |
4543 | ||
db9b2174 MM |
4544 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4545 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
298d6f60 MM |
4546 | for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4547 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
db9b2174 MM |
4548 | } |
4549 | ||
593a0835 PC |
4550 | /* Deduce noexcept for a destructor DTOR. */ |
4551 | ||
4552 | void | |
4553 | deduce_noexcept_on_destructor (tree dtor) | |
4554 | { | |
4555 | if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor))) | |
4556 | { | |
4557 | tree ctx = DECL_CONTEXT (dtor); | |
4558 | tree implicit_fn = implicitly_declare_fn (sfk_destructor, ctx, | |
85b5d65a JM |
4559 | /*const_p=*/false, |
4560 | NULL, NULL); | |
593a0835 PC |
4561 | tree eh_spec = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn)); |
4562 | TREE_TYPE (dtor) = build_exception_variant (TREE_TYPE (dtor), eh_spec); | |
4563 | } | |
4564 | } | |
4565 | ||
4566 | /* For each destructor in T, deduce noexcept: | |
4567 | ||
4568 | 12.4/3: A declaration of a destructor that does not have an | |
4569 | exception-specification is implicitly considered to have the | |
4570 | same exception-specification as an implicit declaration (15.4). */ | |
4571 | ||
4572 | static void | |
4573 | deduce_noexcept_on_destructors (tree t) | |
4574 | { | |
4575 | tree fns; | |
4576 | ||
4577 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail | |
4578 | out now. */ | |
4579 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4580 | return; | |
4581 | ||
4582 | for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4583 | deduce_noexcept_on_destructor (OVL_CURRENT (fns)); | |
4584 | } | |
4585 | ||
0a35513e AH |
4586 | /* Subroutine of set_one_vmethod_tm_attributes. Search base classes |
4587 | of TYPE for virtual functions which FNDECL overrides. Return a | |
4588 | mask of the tm attributes found therein. */ | |
4589 | ||
4590 | static int | |
4591 | look_for_tm_attr_overrides (tree type, tree fndecl) | |
4592 | { | |
4593 | tree binfo = TYPE_BINFO (type); | |
4594 | tree base_binfo; | |
4595 | int ix, found = 0; | |
4596 | ||
4597 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ++ix) | |
4598 | { | |
4599 | tree o, basetype = BINFO_TYPE (base_binfo); | |
4600 | ||
4601 | if (!TYPE_POLYMORPHIC_P (basetype)) | |
4602 | continue; | |
4603 | ||
4604 | o = look_for_overrides_here (basetype, fndecl); | |
4605 | if (o) | |
4606 | found |= tm_attr_to_mask (find_tm_attribute | |
4607 | (TYPE_ATTRIBUTES (TREE_TYPE (o)))); | |
4608 | else | |
4609 | found |= look_for_tm_attr_overrides (basetype, fndecl); | |
4610 | } | |
4611 | ||
4612 | return found; | |
4613 | } | |
4614 | ||
4615 | /* Subroutine of set_method_tm_attributes. Handle the checks and | |
4616 | inheritance for one virtual method FNDECL. */ | |
4617 | ||
4618 | static void | |
4619 | set_one_vmethod_tm_attributes (tree type, tree fndecl) | |
4620 | { | |
4621 | tree tm_attr; | |
4622 | int found, have; | |
4623 | ||
4624 | found = look_for_tm_attr_overrides (type, fndecl); | |
4625 | ||
4626 | /* If FNDECL doesn't actually override anything (i.e. T is the | |
4627 | class that first declares FNDECL virtual), then we're done. */ | |
4628 | if (found == 0) | |
4629 | return; | |
4630 | ||
4631 | tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl))); | |
4632 | have = tm_attr_to_mask (tm_attr); | |
4633 | ||
4634 | /* Intel STM Language Extension 3.0, Section 4.2 table 4: | |
4635 | tm_pure must match exactly, otherwise no weakening of | |
4636 | tm_safe > tm_callable > nothing. */ | |
4637 | /* ??? The tm_pure attribute didn't make the transition to the | |
4638 | multivendor language spec. */ | |
4639 | if (have == TM_ATTR_PURE) | |
4640 | { | |
4641 | if (found != TM_ATTR_PURE) | |
4642 | { | |
4643 | found &= -found; | |
4644 | goto err_override; | |
4645 | } | |
4646 | } | |
4647 | /* If the overridden function is tm_pure, then FNDECL must be. */ | |
4648 | else if (found == TM_ATTR_PURE && tm_attr) | |
4649 | goto err_override; | |
4650 | /* Look for base class combinations that cannot be satisfied. */ | |
4651 | else if (found != TM_ATTR_PURE && (found & TM_ATTR_PURE)) | |
4652 | { | |
4653 | found &= ~TM_ATTR_PURE; | |
4654 | found &= -found; | |
4655 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4656 | "method overrides both %<transaction_pure%> and %qE methods", | |
4657 | tm_mask_to_attr (found)); | |
4658 | } | |
4659 | /* If FNDECL did not declare an attribute, then inherit the most | |
4660 | restrictive one. */ | |
4661 | else if (tm_attr == NULL) | |
4662 | { | |
4663 | apply_tm_attr (fndecl, tm_mask_to_attr (found & -found)); | |
4664 | } | |
4665 | /* Otherwise validate that we're not weaker than a function | |
4666 | that is being overridden. */ | |
4667 | else | |
4668 | { | |
4669 | found &= -found; | |
4670 | if (found <= TM_ATTR_CALLABLE && have > found) | |
4671 | goto err_override; | |
4672 | } | |
4673 | return; | |
4674 | ||
4675 | err_override: | |
4676 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4677 | "method declared %qE overriding %qE method", | |
4678 | tm_attr, tm_mask_to_attr (found)); | |
4679 | } | |
4680 | ||
4681 | /* For each of the methods in T, propagate a class-level tm attribute. */ | |
4682 | ||
4683 | static void | |
4684 | set_method_tm_attributes (tree t) | |
4685 | { | |
4686 | tree class_tm_attr, fndecl; | |
4687 | ||
4688 | /* Don't bother collecting tm attributes if transactional memory | |
4689 | support is not enabled. */ | |
4690 | if (!flag_tm) | |
4691 | return; | |
4692 | ||
4693 | /* Process virtual methods first, as they inherit directly from the | |
4694 | base virtual function and also require validation of new attributes. */ | |
4695 | if (TYPE_CONTAINS_VPTR_P (t)) | |
4696 | { | |
4697 | tree vchain; | |
4698 | for (vchain = BINFO_VIRTUALS (TYPE_BINFO (t)); vchain; | |
4699 | vchain = TREE_CHAIN (vchain)) | |
00a42fb3 AH |
4700 | { |
4701 | fndecl = BV_FN (vchain); | |
4702 | if (DECL_THUNK_P (fndecl)) | |
4703 | fndecl = THUNK_TARGET (fndecl); | |
4704 | set_one_vmethod_tm_attributes (t, fndecl); | |
4705 | } | |
0a35513e AH |
4706 | } |
4707 | ||
4708 | /* If the class doesn't have an attribute, nothing more to do. */ | |
4709 | class_tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (t)); | |
4710 | if (class_tm_attr == NULL) | |
4711 | return; | |
4712 | ||
4713 | /* Any method that does not yet have a tm attribute inherits | |
4714 | the one from the class. */ | |
4715 | for (fndecl = TYPE_METHODS (t); fndecl; fndecl = TREE_CHAIN (fndecl)) | |
4716 | { | |
4717 | if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl)))) | |
4718 | apply_tm_attr (fndecl, class_tm_attr); | |
4719 | } | |
4720 | } | |
4721 | ||
8c95264b MLI |
4722 | /* Returns true iff class T has a user-defined constructor other than |
4723 | the default constructor. */ | |
4724 | ||
4725 | bool | |
4726 | type_has_user_nondefault_constructor (tree t) | |
4727 | { | |
4728 | tree fns; | |
4729 | ||
4730 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4731 | return false; | |
4732 | ||
4733 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4734 | { | |
4735 | tree fn = OVL_CURRENT (fns); | |
4736 | if (!DECL_ARTIFICIAL (fn) | |
c2b58ba2 JM |
4737 | && (TREE_CODE (fn) == TEMPLATE_DECL |
4738 | || (skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn)) | |
4739 | != NULL_TREE))) | |
8c95264b MLI |
4740 | return true; |
4741 | } | |
4742 | ||
4743 | return false; | |
4744 | } | |
4745 | ||
6ad86a5b FC |
4746 | /* Returns the defaulted constructor if T has one. Otherwise, returns |
4747 | NULL_TREE. */ | |
4748 | ||
4749 | tree | |
4750 | in_class_defaulted_default_constructor (tree t) | |
4751 | { | |
4752 | tree fns, args; | |
4753 | ||
4754 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4755 | return NULL_TREE; | |
4756 | ||
4757 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4758 | { | |
4759 | tree fn = OVL_CURRENT (fns); | |
4760 | ||
4761 | if (DECL_DEFAULTED_IN_CLASS_P (fn)) | |
4762 | { | |
4763 | args = FUNCTION_FIRST_USER_PARMTYPE (fn); | |
4764 | while (args && TREE_PURPOSE (args)) | |
4765 | args = TREE_CHAIN (args); | |
4766 | if (!args || args == void_list_node) | |
4767 | return fn; | |
4768 | } | |
4769 | } | |
4770 | ||
4771 | return NULL_TREE; | |
4772 | } | |
4773 | ||
b87d79e6 | 4774 | /* Returns true iff FN is a user-provided function, i.e. user-declared |
20f2653e JM |
4775 | and not defaulted at its first declaration; or explicit, private, |
4776 | protected, or non-const. */ | |
b87d79e6 | 4777 | |
20f2653e | 4778 | bool |
b87d79e6 JM |
4779 | user_provided_p (tree fn) |
4780 | { | |
4781 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
4782 | return true; | |
4783 | else | |
4784 | return (!DECL_ARTIFICIAL (fn) | |
20f2653e | 4785 | && !DECL_DEFAULTED_IN_CLASS_P (fn)); |
b87d79e6 JM |
4786 | } |
4787 | ||
4788 | /* Returns true iff class T has a user-provided constructor. */ | |
4789 | ||
4790 | bool | |
4791 | type_has_user_provided_constructor (tree t) | |
4792 | { | |
4793 | tree fns; | |
4794 | ||
fd97a96a JM |
4795 | if (!CLASS_TYPE_P (t)) |
4796 | return false; | |
4797 | ||
b87d79e6 JM |
4798 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) |
4799 | return false; | |
4800 | ||
4801 | /* This can happen in error cases; avoid crashing. */ | |
4802 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4803 | return false; | |
4804 | ||
4805 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4806 | if (user_provided_p (OVL_CURRENT (fns))) | |
4807 | return true; | |
4808 | ||
4809 | return false; | |
4810 | } | |
4811 | ||
4812 | /* Returns true iff class T has a user-provided default constructor. */ | |
4813 | ||
4814 | bool | |
4815 | type_has_user_provided_default_constructor (tree t) | |
4816 | { | |
71b8cb01 | 4817 | tree fns; |
b87d79e6 JM |
4818 | |
4819 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4820 | return false; | |
4821 | ||
4822 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4823 | { | |
4824 | tree fn = OVL_CURRENT (fns); | |
7ad8d488 | 4825 | if (TREE_CODE (fn) == FUNCTION_DECL |
71b8cb01 JM |
4826 | && user_provided_p (fn) |
4827 | && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn))) | |
4828 | return true; | |
b87d79e6 JM |
4829 | } |
4830 | ||
4831 | return false; | |
4832 | } | |
4833 | ||
32bfcf80 JM |
4834 | /* TYPE is being used as a virtual base, and has a non-trivial move |
4835 | assignment. Return true if this is due to there being a user-provided | |
4836 | move assignment in TYPE or one of its subobjects; if there isn't, then | |
4837 | multiple move assignment can't cause any harm. */ | |
4838 | ||
4839 | bool | |
4840 | vbase_has_user_provided_move_assign (tree type) | |
4841 | { | |
4842 | /* Does the type itself have a user-provided move assignment operator? */ | |
4843 | for (tree fns | |
4844 | = lookup_fnfields_slot_nolazy (type, ansi_assopname (NOP_EXPR)); | |
4845 | fns; fns = OVL_NEXT (fns)) | |
4846 | { | |
4847 | tree fn = OVL_CURRENT (fns); | |
4848 | if (move_fn_p (fn) && user_provided_p (fn)) | |
4849 | return true; | |
4850 | } | |
4851 | ||
4852 | /* Do any of its bases? */ | |
4853 | tree binfo = TYPE_BINFO (type); | |
4854 | tree base_binfo; | |
4855 | for (int i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
4856 | if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo))) | |
4857 | return true; | |
4858 | ||
4859 | /* Or non-static data members? */ | |
4860 | for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
4861 | { | |
4862 | if (TREE_CODE (field) == FIELD_DECL | |
4863 | && CLASS_TYPE_P (TREE_TYPE (field)) | |
4864 | && vbase_has_user_provided_move_assign (TREE_TYPE (field))) | |
4865 | return true; | |
4866 | } | |
4867 | ||
4868 | /* Seems not. */ | |
4869 | return false; | |
4870 | } | |
4871 | ||
6132bdd7 JM |
4872 | /* If default-initialization leaves part of TYPE uninitialized, returns |
4873 | a DECL for the field or TYPE itself (DR 253). */ | |
4874 | ||
4875 | tree | |
4876 | default_init_uninitialized_part (tree type) | |
4877 | { | |
4878 | tree t, r, binfo; | |
4879 | int i; | |
4880 | ||
4881 | type = strip_array_types (type); | |
4882 | if (!CLASS_TYPE_P (type)) | |
4883 | return type; | |
4884 | if (type_has_user_provided_default_constructor (type)) | |
4885 | return NULL_TREE; | |
4886 | for (binfo = TYPE_BINFO (type), i = 0; | |
4887 | BINFO_BASE_ITERATE (binfo, i, t); ++i) | |
4888 | { | |
4889 | r = default_init_uninitialized_part (BINFO_TYPE (t)); | |
4890 | if (r) | |
4891 | return r; | |
4892 | } | |
4893 | for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t)) | |
4894 | if (TREE_CODE (t) == FIELD_DECL | |
4895 | && !DECL_ARTIFICIAL (t) | |
4896 | && !DECL_INITIAL (t)) | |
4897 | { | |
4898 | r = default_init_uninitialized_part (TREE_TYPE (t)); | |
4899 | if (r) | |
4900 | return DECL_P (r) ? r : t; | |
4901 | } | |
4902 | ||
4903 | return NULL_TREE; | |
4904 | } | |
4905 | ||
fd3faf2b | 4906 | /* Returns true iff for class T, a trivial synthesized default constructor |
0930cc0e JM |
4907 | would be constexpr. */ |
4908 | ||
4909 | bool | |
fd3faf2b | 4910 | trivial_default_constructor_is_constexpr (tree t) |
0930cc0e | 4911 | { |
fd3faf2b | 4912 | /* A defaulted trivial default constructor is constexpr |
0930cc0e | 4913 | if there is nothing to initialize. */ |
fd3faf2b | 4914 | gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t)); |
0930cc0e JM |
4915 | return is_really_empty_class (t); |
4916 | } | |
4917 | ||
91ea6df3 GDR |
4918 | /* Returns true iff class T has a constexpr default constructor. */ |
4919 | ||
4920 | bool | |
4921 | type_has_constexpr_default_constructor (tree t) | |
4922 | { | |
4923 | tree fns; | |
4924 | ||
4925 | if (!CLASS_TYPE_P (t)) | |
69f36ba6 JM |
4926 | { |
4927 | /* The caller should have stripped an enclosing array. */ | |
4928 | gcc_assert (TREE_CODE (t) != ARRAY_TYPE); | |
4929 | return false; | |
4930 | } | |
0930cc0e | 4931 | if (CLASSTYPE_LAZY_DEFAULT_CTOR (t)) |
fd3faf2b JM |
4932 | { |
4933 | if (!TYPE_HAS_COMPLEX_DFLT (t)) | |
4934 | return trivial_default_constructor_is_constexpr (t); | |
4935 | /* Non-trivial, we need to check subobject constructors. */ | |
4936 | lazily_declare_fn (sfk_constructor, t); | |
4937 | } | |
f7d042e2 | 4938 | fns = locate_ctor (t); |
91ea6df3 GDR |
4939 | return (fns && DECL_DECLARED_CONSTEXPR_P (fns)); |
4940 | } | |
4941 | ||
46408846 JM |
4942 | /* Returns true iff class TYPE has a virtual destructor. */ |
4943 | ||
4944 | bool | |
4945 | type_has_virtual_destructor (tree type) | |
4946 | { | |
4947 | tree dtor; | |
4948 | ||
4949 | if (!CLASS_TYPE_P (type)) | |
4950 | return false; | |
4951 | ||
4952 | gcc_assert (COMPLETE_TYPE_P (type)); | |
4953 | dtor = CLASSTYPE_DESTRUCTORS (type); | |
4954 | return (dtor && DECL_VIRTUAL_P (dtor)); | |
4955 | } | |
4956 | ||
ac177431 JM |
4957 | /* Returns true iff class T has a move constructor. */ |
4958 | ||
4959 | bool | |
4960 | type_has_move_constructor (tree t) | |
4961 | { | |
4962 | tree fns; | |
4963 | ||
4964 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
4965 | { | |
4966 | gcc_assert (COMPLETE_TYPE_P (t)); | |
4967 | lazily_declare_fn (sfk_move_constructor, t); | |
4968 | } | |
4969 | ||
4970 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4971 | return false; | |
4972 | ||
4973 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4974 | if (move_fn_p (OVL_CURRENT (fns))) | |
4975 | return true; | |
4976 | ||
4977 | return false; | |
4978 | } | |
4979 | ||
4980 | /* Returns true iff class T has a move assignment operator. */ | |
4981 | ||
4982 | bool | |
4983 | type_has_move_assign (tree t) | |
4984 | { | |
4985 | tree fns; | |
4986 | ||
4987 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
4988 | { | |
4989 | gcc_assert (COMPLETE_TYPE_P (t)); | |
4990 | lazily_declare_fn (sfk_move_assignment, t); | |
4991 | } | |
4992 | ||
fa4ba4af | 4993 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
ac177431 JM |
4994 | fns; fns = OVL_NEXT (fns)) |
4995 | if (move_fn_p (OVL_CURRENT (fns))) | |
4996 | return true; | |
4997 | ||
4998 | return false; | |
4999 | } | |
5000 | ||
a2e70335 JM |
5001 | /* Returns true iff class T has a move constructor that was explicitly |
5002 | declared in the class body. Note that this is different from | |
5003 | "user-provided", which doesn't include functions that are defaulted in | |
5004 | the class. */ | |
5005 | ||
5006 | bool | |
5007 | type_has_user_declared_move_constructor (tree t) | |
5008 | { | |
5009 | tree fns; | |
5010 | ||
5011 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
5012 | return false; | |
5013 | ||
5014 | if (!CLASSTYPE_METHOD_VEC (t)) | |
5015 | return false; | |
5016 | ||
5017 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5018 | { | |
5019 | tree fn = OVL_CURRENT (fns); | |
5020 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
5021 | return true; | |
5022 | } | |
5023 | ||
5024 | return false; | |
5025 | } | |
5026 | ||
5027 | /* Returns true iff class T has a move assignment operator that was | |
5028 | explicitly declared in the class body. */ | |
5029 | ||
5030 | bool | |
5031 | type_has_user_declared_move_assign (tree t) | |
5032 | { | |
5033 | tree fns; | |
5034 | ||
5035 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
5036 | return false; | |
5037 | ||
fa4ba4af | 5038 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
a2e70335 JM |
5039 | fns; fns = OVL_NEXT (fns)) |
5040 | { | |
5041 | tree fn = OVL_CURRENT (fns); | |
5042 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
5043 | return true; | |
5044 | } | |
5045 | ||
5046 | return false; | |
5047 | } | |
5048 | ||
95552437 JM |
5049 | /* Nonzero if we need to build up a constructor call when initializing an |
5050 | object of this class, either because it has a user-provided constructor | |
5051 | or because it doesn't have a default constructor (so we need to give an | |
5052 | error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when | |
5053 | what you care about is whether or not an object can be produced by a | |
5054 | constructor (e.g. so we don't set TREE_READONLY on const variables of | |
5055 | such type); use this function when what you care about is whether or not | |
5056 | to try to call a constructor to create an object. The latter case is | |
5057 | the former plus some cases of constructors that cannot be called. */ | |
5058 | ||
5059 | bool | |
5060 | type_build_ctor_call (tree t) | |
5061 | { | |
5062 | tree inner; | |
5063 | if (TYPE_NEEDS_CONSTRUCTING (t)) | |
5064 | return true; | |
5065 | inner = strip_array_types (t); | |
5066 | return (CLASS_TYPE_P (inner) && !TYPE_HAS_DEFAULT_CONSTRUCTOR (inner) | |
5067 | && !ANON_AGGR_TYPE_P (inner)); | |
5068 | } | |
5069 | ||
58010b57 MM |
5070 | /* Remove all zero-width bit-fields from T. */ |
5071 | ||
5072 | static void | |
94edc4ab | 5073 | remove_zero_width_bit_fields (tree t) |
58010b57 MM |
5074 | { |
5075 | tree *fieldsp; | |
5076 | ||
c8094d83 | 5077 | fieldsp = &TYPE_FIELDS (t); |
58010b57 MM |
5078 | while (*fieldsp) |
5079 | { | |
5080 | if (TREE_CODE (*fieldsp) == FIELD_DECL | |
c8094d83 | 5081 | && DECL_C_BIT_FIELD (*fieldsp) |
84894f85 DS |
5082 | /* We should not be confused by the fact that grokbitfield |
5083 | temporarily sets the width of the bit field into | |
5084 | DECL_INITIAL (*fieldsp). | |
5085 | check_bitfield_decl eventually sets DECL_SIZE (*fieldsp) | |
5086 | to that width. */ | |
5087 | && integer_zerop (DECL_SIZE (*fieldsp))) | |
910ad8de | 5088 | *fieldsp = DECL_CHAIN (*fieldsp); |
58010b57 | 5089 | else |
910ad8de | 5090 | fieldsp = &DECL_CHAIN (*fieldsp); |
58010b57 MM |
5091 | } |
5092 | } | |
5093 | ||
dbc957f1 MM |
5094 | /* Returns TRUE iff we need a cookie when dynamically allocating an |
5095 | array whose elements have the indicated class TYPE. */ | |
5096 | ||
5097 | static bool | |
94edc4ab | 5098 | type_requires_array_cookie (tree type) |
dbc957f1 MM |
5099 | { |
5100 | tree fns; | |
18fee3ee | 5101 | bool has_two_argument_delete_p = false; |
dbc957f1 | 5102 | |
50bc768d | 5103 | gcc_assert (CLASS_TYPE_P (type)); |
dbc957f1 MM |
5104 | |
5105 | /* If there's a non-trivial destructor, we need a cookie. In order | |
5106 | to iterate through the array calling the destructor for each | |
5107 | element, we'll have to know how many elements there are. */ | |
5108 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
5109 | return true; | |
5110 | ||
5111 | /* If the usual deallocation function is a two-argument whose second | |
5112 | argument is of type `size_t', then we have to pass the size of | |
5113 | the array to the deallocation function, so we will need to store | |
5114 | a cookie. */ | |
c8094d83 | 5115 | fns = lookup_fnfields (TYPE_BINFO (type), |
dbc957f1 MM |
5116 | ansi_opname (VEC_DELETE_EXPR), |
5117 | /*protect=*/0); | |
5118 | /* If there are no `operator []' members, or the lookup is | |
5119 | ambiguous, then we don't need a cookie. */ | |
5120 | if (!fns || fns == error_mark_node) | |
5121 | return false; | |
5122 | /* Loop through all of the functions. */ | |
50ad9642 | 5123 | for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns)) |
dbc957f1 MM |
5124 | { |
5125 | tree fn; | |
5126 | tree second_parm; | |
5127 | ||
5128 | /* Select the current function. */ | |
5129 | fn = OVL_CURRENT (fns); | |
5130 | /* See if this function is a one-argument delete function. If | |
5131 | it is, then it will be the usual deallocation function. */ | |
5132 | second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))); | |
5133 | if (second_parm == void_list_node) | |
5134 | return false; | |
4b8cb94c SM |
5135 | /* Do not consider this function if its second argument is an |
5136 | ellipsis. */ | |
5137 | if (!second_parm) | |
5138 | continue; | |
dbc957f1 MM |
5139 | /* Otherwise, if we have a two-argument function and the second |
5140 | argument is `size_t', it will be the usual deallocation | |
5141 | function -- unless there is one-argument function, too. */ | |
5142 | if (TREE_CHAIN (second_parm) == void_list_node | |
c79154c4 | 5143 | && same_type_p (TREE_VALUE (second_parm), size_type_node)) |
dbc957f1 MM |
5144 | has_two_argument_delete_p = true; |
5145 | } | |
5146 | ||
5147 | return has_two_argument_delete_p; | |
5148 | } | |
5149 | ||
3b49d762 GDR |
5150 | /* Finish computing the `literal type' property of class type T. |
5151 | ||
5152 | At this point, we have already processed base classes and | |
5153 | non-static data members. We need to check whether the copy | |
5154 | constructor is trivial, the destructor is trivial, and there | |
5155 | is a trivial default constructor or at least one constexpr | |
5156 | constructor other than the copy constructor. */ | |
5157 | ||
5158 | static void | |
5159 | finalize_literal_type_property (tree t) | |
5160 | { | |
0515f4d2 JM |
5161 | tree fn; |
5162 | ||
3b49d762 | 5163 | if (cxx_dialect < cxx0x |
b198484e | 5164 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) |
3b49d762 GDR |
5165 | CLASSTYPE_LITERAL_P (t) = false; |
5166 | else if (CLASSTYPE_LITERAL_P (t) && !TYPE_HAS_TRIVIAL_DFLT (t) | |
b198484e | 5167 | && CLASSTYPE_NON_AGGREGATE (t) |
3b49d762 GDR |
5168 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) |
5169 | CLASSTYPE_LITERAL_P (t) = false; | |
0515f4d2 JM |
5170 | |
5171 | if (!CLASSTYPE_LITERAL_P (t)) | |
5172 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) | |
5173 | if (DECL_DECLARED_CONSTEXPR_P (fn) | |
5174 | && TREE_CODE (fn) != TEMPLATE_DECL | |
5175 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
5176 | && !DECL_CONSTRUCTOR_P (fn)) | |
5177 | { | |
5178 | DECL_DECLARED_CONSTEXPR_P (fn) = false; | |
b432106b | 5179 | if (!DECL_GENERATED_P (fn)) |
f732fa7b JM |
5180 | { |
5181 | error ("enclosing class of constexpr non-static member " | |
5182 | "function %q+#D is not a literal type", fn); | |
5183 | explain_non_literal_class (t); | |
5184 | } | |
0515f4d2 | 5185 | } |
3b49d762 GDR |
5186 | } |
5187 | ||
f732fa7b JM |
5188 | /* T is a non-literal type used in a context which requires a constant |
5189 | expression. Explain why it isn't literal. */ | |
5190 | ||
5191 | void | |
5192 | explain_non_literal_class (tree t) | |
5193 | { | |
5194 | static struct pointer_set_t *diagnosed; | |
5195 | ||
5196 | if (!CLASS_TYPE_P (t)) | |
5197 | return; | |
5198 | t = TYPE_MAIN_VARIANT (t); | |
5199 | ||
5200 | if (diagnosed == NULL) | |
5201 | diagnosed = pointer_set_create (); | |
5202 | if (pointer_set_insert (diagnosed, t) != 0) | |
5203 | /* Already explained. */ | |
5204 | return; | |
5205 | ||
5206 | inform (0, "%q+T is not literal because:", t); | |
5207 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
5208 | inform (0, " %q+T has a non-trivial destructor", t); | |
5209 | else if (CLASSTYPE_NON_AGGREGATE (t) | |
5210 | && !TYPE_HAS_TRIVIAL_DFLT (t) | |
5211 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) | |
fd3faf2b JM |
5212 | { |
5213 | inform (0, " %q+T is not an aggregate, does not have a trivial " | |
5214 | "default constructor, and has no constexpr constructor that " | |
5215 | "is not a copy or move constructor", t); | |
5216 | if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t) | |
5217 | && !type_has_user_provided_default_constructor (t)) | |
efff2fb4 PC |
5218 | { |
5219 | /* Note that we can't simply call locate_ctor because when the | |
5220 | constructor is deleted it just returns NULL_TREE. */ | |
5221 | tree fns; | |
5222 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5223 | { | |
5224 | tree fn = OVL_CURRENT (fns); | |
5225 | tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5226 | ||
5227 | parms = skip_artificial_parms_for (fn, parms); | |
5228 | ||
5229 | if (sufficient_parms_p (parms)) | |
5230 | { | |
5231 | if (DECL_DELETED_FN (fn)) | |
5232 | maybe_explain_implicit_delete (fn); | |
5233 | else | |
5234 | explain_invalid_constexpr_fn (fn); | |
5235 | break; | |
5236 | } | |
5237 | } | |
5238 | } | |
fd3faf2b | 5239 | } |
f732fa7b JM |
5240 | else |
5241 | { | |
5242 | tree binfo, base_binfo, field; int i; | |
5243 | for (binfo = TYPE_BINFO (t), i = 0; | |
5244 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
5245 | { | |
5246 | tree basetype = TREE_TYPE (base_binfo); | |
5247 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
5248 | { | |
5249 | inform (0, " base class %qT of %q+T is non-literal", | |
5250 | basetype, t); | |
5251 | explain_non_literal_class (basetype); | |
5252 | return; | |
5253 | } | |
5254 | } | |
5255 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
5256 | { | |
5257 | tree ftype; | |
5258 | if (TREE_CODE (field) != FIELD_DECL) | |
5259 | continue; | |
5260 | ftype = TREE_TYPE (field); | |
5261 | if (!literal_type_p (ftype)) | |
5262 | { | |
5263 | inform (0, " non-static data member %q+D has " | |
5264 | "non-literal type", field); | |
5265 | if (CLASS_TYPE_P (ftype)) | |
5266 | explain_non_literal_class (ftype); | |
5267 | } | |
5268 | } | |
5269 | } | |
5270 | } | |
5271 | ||
607cf131 MM |
5272 | /* Check the validity of the bases and members declared in T. Add any |
5273 | implicitly-generated functions (like copy-constructors and | |
5274 | assignment operators). Compute various flag bits (like | |
c32097d8 | 5275 | CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++ |
607cf131 MM |
5276 | level: i.e., independently of the ABI in use. */ |
5277 | ||
5278 | static void | |
58731fd1 | 5279 | check_bases_and_members (tree t) |
607cf131 | 5280 | { |
607cf131 MM |
5281 | /* Nonzero if the implicitly generated copy constructor should take |
5282 | a non-const reference argument. */ | |
5283 | int cant_have_const_ctor; | |
78dcd41a | 5284 | /* Nonzero if the implicitly generated assignment operator |
607cf131 MM |
5285 | should take a non-const reference argument. */ |
5286 | int no_const_asn_ref; | |
5287 | tree access_decls; | |
b87d79e6 JM |
5288 | bool saved_complex_asn_ref; |
5289 | bool saved_nontrivial_dtor; | |
20f2653e | 5290 | tree fn; |
607cf131 MM |
5291 | |
5292 | /* By default, we use const reference arguments and generate default | |
5293 | constructors. */ | |
607cf131 MM |
5294 | cant_have_const_ctor = 0; |
5295 | no_const_asn_ref = 0; | |
5296 | ||
00a17e31 | 5297 | /* Check all the base-classes. */ |
e5e459bf | 5298 | check_bases (t, &cant_have_const_ctor, |
10746f37 | 5299 | &no_const_asn_ref); |
607cf131 | 5300 | |
52d95c21 JM |
5301 | /* Deduce noexcept on destructors. This needs to happen after we've set |
5302 | triviality flags appropriately for our bases. */ | |
5303 | if (cxx_dialect >= cxx0x) | |
5304 | deduce_noexcept_on_destructors (t); | |
5305 | ||
9f4faeae MM |
5306 | /* Check all the method declarations. */ |
5307 | check_methods (t); | |
5308 | ||
b87d79e6 JM |
5309 | /* Save the initial values of these flags which only indicate whether |
5310 | or not the class has user-provided functions. As we analyze the | |
5311 | bases and members we can set these flags for other reasons. */ | |
066ec0a4 | 5312 | saved_complex_asn_ref = TYPE_HAS_COMPLEX_COPY_ASSIGN (t); |
b87d79e6 JM |
5313 | saved_nontrivial_dtor = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
5314 | ||
9f4faeae MM |
5315 | /* Check all the data member declarations. We cannot call |
5316 | check_field_decls until we have called check_bases check_methods, | |
5317 | as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
5318 | being set appropriately. */ | |
58731fd1 | 5319 | check_field_decls (t, &access_decls, |
607cf131 | 5320 | &cant_have_const_ctor, |
10746f37 | 5321 | &no_const_asn_ref); |
607cf131 | 5322 | |
bbd15aac MM |
5323 | /* A nearly-empty class has to be vptr-containing; a nearly empty |
5324 | class contains just a vptr. */ | |
5325 | if (!TYPE_CONTAINS_VPTR_P (t)) | |
f9c528ea MM |
5326 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; |
5327 | ||
607cf131 MM |
5328 | /* Do some bookkeeping that will guide the generation of implicitly |
5329 | declared member functions. */ | |
066ec0a4 | 5330 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 5331 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
0fcedd9c | 5332 | /* We need to call a constructor for this class if it has a |
b87d79e6 | 5333 | user-provided constructor, or if the default constructor is going |
0fcedd9c JM |
5334 | to initialize the vptr. (This is not an if-and-only-if; |
5335 | TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members | |
5336 | themselves need constructing.) */ | |
607cf131 | 5337 | TYPE_NEEDS_CONSTRUCTING (t) |
b87d79e6 | 5338 | |= (type_has_user_provided_constructor (t) || TYPE_CONTAINS_VPTR_P (t)); |
0fcedd9c JM |
5339 | /* [dcl.init.aggr] |
5340 | ||
b87d79e6 | 5341 | An aggregate is an array or a class with no user-provided |
0fcedd9c JM |
5342 | constructors ... and no virtual functions. |
5343 | ||
5344 | Again, other conditions for being an aggregate are checked | |
5345 | elsewhere. */ | |
5775a06a | 5346 | CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 5347 | |= (type_has_user_provided_constructor (t) || TYPE_POLYMORPHIC_P (t)); |
c32097d8 JM |
5348 | /* This is the C++98/03 definition of POD; it changed in C++0x, but we |
5349 | retain the old definition internally for ABI reasons. */ | |
5350 | CLASSTYPE_NON_LAYOUT_POD_P (t) | |
c8094d83 | 5351 | |= (CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 5352 | || saved_nontrivial_dtor || saved_complex_asn_ref); |
c32097d8 | 5353 | CLASSTYPE_NON_STD_LAYOUT (t) |= TYPE_CONTAINS_VPTR_P (t); |
066ec0a4 | 5354 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 5355 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
f782c65c | 5356 | TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_CONTAINS_VPTR_P (t); |
607cf131 | 5357 | |
0fcedd9c JM |
5358 | /* If the class has no user-declared constructor, but does have |
5359 | non-static const or reference data members that can never be | |
5360 | initialized, issue a warning. */ | |
c73d5dd9 | 5361 | if (warn_uninitialized |
0fcedd9c JM |
5362 | /* Classes with user-declared constructors are presumed to |
5363 | initialize these members. */ | |
5364 | && !TYPE_HAS_USER_CONSTRUCTOR (t) | |
5365 | /* Aggregates can be initialized with brace-enclosed | |
5366 | initializers. */ | |
5367 | && CLASSTYPE_NON_AGGREGATE (t)) | |
5368 | { | |
5369 | tree field; | |
5370 | ||
910ad8de | 5371 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
0fcedd9c JM |
5372 | { |
5373 | tree type; | |
5374 | ||
f315d618 JJ |
5375 | if (TREE_CODE (field) != FIELD_DECL |
5376 | || DECL_INITIAL (field) != NULL_TREE) | |
0fcedd9c JM |
5377 | continue; |
5378 | ||
5379 | type = TREE_TYPE (field); | |
5380 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
c73d5dd9 MLI |
5381 | warning (OPT_Wuninitialized, "non-static reference %q+#D " |
5382 | "in class without a constructor", field); | |
0fcedd9c JM |
5383 | else if (CP_TYPE_CONST_P (type) |
5384 | && (!CLASS_TYPE_P (type) | |
5385 | || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type))) | |
c73d5dd9 MLI |
5386 | warning (OPT_Wuninitialized, "non-static const member %q+#D " |
5387 | "in class without a constructor", field); | |
0fcedd9c JM |
5388 | } |
5389 | } | |
5390 | ||
03fd3f84 | 5391 | /* Synthesize any needed methods. */ |
85b5d65a | 5392 | add_implicitly_declared_members (t, &access_decls, |
607cf131 | 5393 | cant_have_const_ctor, |
10746f37 | 5394 | no_const_asn_ref); |
607cf131 | 5395 | |
20f2653e JM |
5396 | /* Check defaulted declarations here so we have cant_have_const_ctor |
5397 | and don't need to worry about clones. */ | |
910ad8de | 5398 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
85b5d65a | 5399 | if (!DECL_ARTIFICIAL (fn) && DECL_DEFAULTED_IN_CLASS_P (fn)) |
20f2653e JM |
5400 | { |
5401 | int copy = copy_fn_p (fn); | |
5402 | if (copy > 0) | |
5403 | { | |
5404 | bool imp_const_p | |
5405 | = (DECL_CONSTRUCTOR_P (fn) ? !cant_have_const_ctor | |
5406 | : !no_const_asn_ref); | |
5407 | bool fn_const_p = (copy == 2); | |
5408 | ||
5409 | if (fn_const_p && !imp_const_p) | |
5410 | /* If the function is defaulted outside the class, we just | |
5411 | give the synthesis error. */ | |
5412 | error ("%q+D declared to take const reference, but implicit " | |
5413 | "declaration would take non-const", fn); | |
20f2653e JM |
5414 | } |
5415 | defaulted_late_check (fn); | |
5416 | } | |
5417 | ||
d5f4eddd JM |
5418 | if (LAMBDA_TYPE_P (t)) |
5419 | { | |
5420 | /* "The closure type associated with a lambda-expression has a deleted | |
5421 | default constructor and a deleted copy assignment operator." */ | |
5422 | TYPE_NEEDS_CONSTRUCTING (t) = 1; | |
54ca9930 JM |
5423 | TYPE_HAS_COMPLEX_DFLT (t) = 1; |
5424 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; | |
5425 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 0; | |
d5f4eddd JM |
5426 | |
5427 | /* "This class type is not an aggregate." */ | |
5428 | CLASSTYPE_NON_AGGREGATE (t) = 1; | |
5429 | } | |
5430 | ||
3b49d762 GDR |
5431 | /* Compute the 'literal type' property before we |
5432 | do anything with non-static member functions. */ | |
5433 | finalize_literal_type_property (t); | |
5434 | ||
db9b2174 MM |
5435 | /* Create the in-charge and not-in-charge variants of constructors |
5436 | and destructors. */ | |
5437 | clone_constructors_and_destructors (t); | |
5438 | ||
aa52c1ff JM |
5439 | /* Process the using-declarations. */ |
5440 | for (; access_decls; access_decls = TREE_CHAIN (access_decls)) | |
5441 | handle_using_decl (TREE_VALUE (access_decls), t); | |
5442 | ||
607cf131 MM |
5443 | /* Build and sort the CLASSTYPE_METHOD_VEC. */ |
5444 | finish_struct_methods (t); | |
dbc957f1 MM |
5445 | |
5446 | /* Figure out whether or not we will need a cookie when dynamically | |
5447 | allocating an array of this type. */ | |
e2500fed | 5448 | TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie |
dbc957f1 | 5449 | = type_requires_array_cookie (t); |
607cf131 MM |
5450 | } |
5451 | ||
3ef397c1 | 5452 | /* If T needs a pointer to its virtual function table, set TYPE_VFIELD |
5c24fba6 MM |
5453 | accordingly. If a new vfield was created (because T doesn't have a |
5454 | primary base class), then the newly created field is returned. It | |
c35cce41 | 5455 | is not added to the TYPE_FIELDS list; it is the caller's |
e6858a84 NS |
5456 | responsibility to do that. Accumulate declared virtual functions |
5457 | on VIRTUALS_P. */ | |
3ef397c1 | 5458 | |
5c24fba6 | 5459 | static tree |
94edc4ab | 5460 | create_vtable_ptr (tree t, tree* virtuals_p) |
3ef397c1 MM |
5461 | { |
5462 | tree fn; | |
5463 | ||
e6858a84 | 5464 | /* Collect the virtual functions declared in T. */ |
910ad8de | 5465 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
e6858a84 NS |
5466 | if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn) |
5467 | && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST) | |
5468 | { | |
5469 | tree new_virtual = make_node (TREE_LIST); | |
c8094d83 | 5470 | |
e6858a84 NS |
5471 | BV_FN (new_virtual) = fn; |
5472 | BV_DELTA (new_virtual) = integer_zero_node; | |
d1f05f93 | 5473 | BV_VCALL_INDEX (new_virtual) = NULL_TREE; |
3ef397c1 | 5474 | |
e6858a84 NS |
5475 | TREE_CHAIN (new_virtual) = *virtuals_p; |
5476 | *virtuals_p = new_virtual; | |
5477 | } | |
c8094d83 | 5478 | |
da3d4dfa MM |
5479 | /* If we couldn't find an appropriate base class, create a new field |
5480 | here. Even if there weren't any new virtual functions, we might need a | |
bbd15aac MM |
5481 | new virtual function table if we're supposed to include vptrs in |
5482 | all classes that need them. */ | |
e6858a84 | 5483 | if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t))) |
3ef397c1 MM |
5484 | { |
5485 | /* We build this decl with vtbl_ptr_type_node, which is a | |
5486 | `vtable_entry_type*'. It might seem more precise to use | |
a692ad2e | 5487 | `vtable_entry_type (*)[N]' where N is the number of virtual |
3ef397c1 MM |
5488 | functions. However, that would require the vtable pointer in |
5489 | base classes to have a different type than the vtable pointer | |
5490 | in derived classes. We could make that happen, but that | |
5491 | still wouldn't solve all the problems. In particular, the | |
5492 | type-based alias analysis code would decide that assignments | |
5493 | to the base class vtable pointer can't alias assignments to | |
5494 | the derived class vtable pointer, since they have different | |
4639c5c6 | 5495 | types. Thus, in a derived class destructor, where the base |
3ef397c1 | 5496 | class constructor was inlined, we could generate bad code for |
c8094d83 | 5497 | setting up the vtable pointer. |
3ef397c1 | 5498 | |
0cbd7506 | 5499 | Therefore, we use one type for all vtable pointers. We still |
3ef397c1 MM |
5500 | use a type-correct type; it's just doesn't indicate the array |
5501 | bounds. That's better than using `void*' or some such; it's | |
5502 | cleaner, and it let's the alias analysis code know that these | |
5503 | stores cannot alias stores to void*! */ | |
0abe00c5 NS |
5504 | tree field; |
5505 | ||
c2255bc4 AH |
5506 | field = build_decl (input_location, |
5507 | FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node); | |
0abe00c5 NS |
5508 | DECL_VIRTUAL_P (field) = 1; |
5509 | DECL_ARTIFICIAL (field) = 1; | |
5510 | DECL_FIELD_CONTEXT (field) = t; | |
5511 | DECL_FCONTEXT (field) = t; | |
7c08df6c JM |
5512 | if (TYPE_PACKED (t)) |
5513 | DECL_PACKED (field) = 1; | |
c8094d83 | 5514 | |
0abe00c5 | 5515 | TYPE_VFIELD (t) = field; |
c8094d83 | 5516 | |
0abe00c5 | 5517 | /* This class is non-empty. */ |
58731fd1 | 5518 | CLASSTYPE_EMPTY_P (t) = 0; |
3ef397c1 | 5519 | |
0abe00c5 | 5520 | return field; |
3ef397c1 | 5521 | } |
5c24fba6 MM |
5522 | |
5523 | return NULL_TREE; | |
3ef397c1 MM |
5524 | } |
5525 | ||
9d4c0187 MM |
5526 | /* Add OFFSET to all base types of BINFO which is a base in the |
5527 | hierarchy dominated by T. | |
80fd5f48 | 5528 | |
911a71a7 | 5529 | OFFSET, which is a type offset, is number of bytes. */ |
80fd5f48 MM |
5530 | |
5531 | static void | |
dbbf88d1 | 5532 | propagate_binfo_offsets (tree binfo, tree offset) |
80fd5f48 | 5533 | { |
911a71a7 MM |
5534 | int i; |
5535 | tree primary_binfo; | |
fa743e8c | 5536 | tree base_binfo; |
80fd5f48 | 5537 | |
911a71a7 MM |
5538 | /* Update BINFO's offset. */ |
5539 | BINFO_OFFSET (binfo) | |
c8094d83 | 5540 | = convert (sizetype, |
911a71a7 MM |
5541 | size_binop (PLUS_EXPR, |
5542 | convert (ssizetype, BINFO_OFFSET (binfo)), | |
5543 | offset)); | |
80fd5f48 | 5544 | |
911a71a7 MM |
5545 | /* Find the primary base class. */ |
5546 | primary_binfo = get_primary_binfo (binfo); | |
5547 | ||
fc6633e0 | 5548 | if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo) |
090ad434 | 5549 | propagate_binfo_offsets (primary_binfo, offset); |
c8094d83 | 5550 | |
911a71a7 MM |
5551 | /* Scan all of the bases, pushing the BINFO_OFFSET adjust |
5552 | downwards. */ | |
fa743e8c | 5553 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
80fd5f48 | 5554 | { |
090ad434 NS |
5555 | /* Don't do the primary base twice. */ |
5556 | if (base_binfo == primary_binfo) | |
5557 | continue; | |
911a71a7 | 5558 | |
090ad434 | 5559 | if (BINFO_VIRTUAL_P (base_binfo)) |
911a71a7 MM |
5560 | continue; |
5561 | ||
dbbf88d1 | 5562 | propagate_binfo_offsets (base_binfo, offset); |
911a71a7 | 5563 | } |
9d4c0187 MM |
5564 | } |
5565 | ||
17bbb839 | 5566 | /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update |
c20118a8 MM |
5567 | TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of |
5568 | empty subobjects of T. */ | |
80fd5f48 | 5569 | |
d2c5305b | 5570 | static void |
17bbb839 | 5571 | layout_virtual_bases (record_layout_info rli, splay_tree offsets) |
80fd5f48 | 5572 | { |
dbbf88d1 | 5573 | tree vbase; |
17bbb839 | 5574 | tree t = rli->t; |
eca7f13c | 5575 | bool first_vbase = true; |
17bbb839 | 5576 | tree *next_field; |
9785e4b1 | 5577 | |
604a3205 | 5578 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0) |
9785e4b1 MM |
5579 | return; |
5580 | ||
17bbb839 MM |
5581 | if (!abi_version_at_least(2)) |
5582 | { | |
5583 | /* In G++ 3.2, we incorrectly rounded the size before laying out | |
5584 | the virtual bases. */ | |
5585 | finish_record_layout (rli, /*free_p=*/false); | |
9785e4b1 | 5586 | #ifdef STRUCTURE_SIZE_BOUNDARY |
17bbb839 MM |
5587 | /* Packed structures don't need to have minimum size. */ |
5588 | if (! TYPE_PACKED (t)) | |
fc555370 | 5589 | TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY); |
9785e4b1 | 5590 | #endif |
17bbb839 MM |
5591 | rli->offset = TYPE_SIZE_UNIT (t); |
5592 | rli->bitpos = bitsize_zero_node; | |
5593 | rli->record_align = TYPE_ALIGN (t); | |
5594 | } | |
80fd5f48 | 5595 | |
17bbb839 MM |
5596 | /* Find the last field. The artificial fields created for virtual |
5597 | bases will go after the last extant field to date. */ | |
5598 | next_field = &TYPE_FIELDS (t); | |
5599 | while (*next_field) | |
910ad8de | 5600 | next_field = &DECL_CHAIN (*next_field); |
80fd5f48 | 5601 | |
9d4c0187 | 5602 | /* Go through the virtual bases, allocating space for each virtual |
3461fba7 NS |
5603 | base that is not already a primary base class. These are |
5604 | allocated in inheritance graph order. */ | |
dbbf88d1 | 5605 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) |
c35cce41 | 5606 | { |
809e3e7f | 5607 | if (!BINFO_VIRTUAL_P (vbase)) |
1f84ec23 | 5608 | continue; |
eca7f13c | 5609 | |
9965d119 | 5610 | if (!BINFO_PRIMARY_P (vbase)) |
c35cce41 | 5611 | { |
17bbb839 MM |
5612 | tree basetype = TREE_TYPE (vbase); |
5613 | ||
c35cce41 MM |
5614 | /* This virtual base is not a primary base of any class in the |
5615 | hierarchy, so we have to add space for it. */ | |
58731fd1 | 5616 | next_field = build_base_field (rli, vbase, |
17bbb839 | 5617 | offsets, next_field); |
9785e4b1 | 5618 | |
eca7f13c MM |
5619 | /* If the first virtual base might have been placed at a |
5620 | lower address, had we started from CLASSTYPE_SIZE, rather | |
5621 | than TYPE_SIZE, issue a warning. There can be both false | |
5622 | positives and false negatives from this warning in rare | |
5623 | cases; to deal with all the possibilities would probably | |
5624 | require performing both layout algorithms and comparing | |
5625 | the results which is not particularly tractable. */ | |
5626 | if (warn_abi | |
5627 | && first_vbase | |
c8094d83 | 5628 | && (tree_int_cst_lt |
17bbb839 | 5629 | (size_binop (CEIL_DIV_EXPR, |
db3927fb AH |
5630 | round_up_loc (input_location, |
5631 | CLASSTYPE_SIZE (t), | |
17bbb839 MM |
5632 | CLASSTYPE_ALIGN (basetype)), |
5633 | bitsize_unit_node), | |
5634 | BINFO_OFFSET (vbase)))) | |
74fa0285 | 5635 | warning (OPT_Wabi, |
3db45ab5 | 5636 | "offset of virtual base %qT is not ABI-compliant and " |
0cbd7506 | 5637 | "may change in a future version of GCC", |
eca7f13c MM |
5638 | basetype); |
5639 | ||
eca7f13c | 5640 | first_vbase = false; |
c35cce41 MM |
5641 | } |
5642 | } | |
80fd5f48 MM |
5643 | } |
5644 | ||
ba9a991f MM |
5645 | /* Returns the offset of the byte just past the end of the base class |
5646 | BINFO. */ | |
5647 | ||
5648 | static tree | |
5649 | end_of_base (tree binfo) | |
5650 | { | |
5651 | tree size; | |
5652 | ||
1ad8aeeb DG |
5653 | if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo))) |
5654 | size = TYPE_SIZE_UNIT (char_type_node); | |
5655 | else if (is_empty_class (BINFO_TYPE (binfo))) | |
ba9a991f MM |
5656 | /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to |
5657 | allocate some space for it. It cannot have virtual bases, so | |
5658 | TYPE_SIZE_UNIT is fine. */ | |
5659 | size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5660 | else | |
5661 | size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5662 | ||
5663 | return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size); | |
5664 | } | |
5665 | ||
9785e4b1 MM |
5666 | /* Returns the offset of the byte just past the end of the base class |
5667 | with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then | |
5668 | only non-virtual bases are included. */ | |
80fd5f48 | 5669 | |
17bbb839 | 5670 | static tree |
94edc4ab | 5671 | end_of_class (tree t, int include_virtuals_p) |
80fd5f48 | 5672 | { |
17bbb839 | 5673 | tree result = size_zero_node; |
9771b263 | 5674 | vec<tree, va_gc> *vbases; |
ba9a991f | 5675 | tree binfo; |
9ba5ff0f | 5676 | tree base_binfo; |
ba9a991f | 5677 | tree offset; |
9785e4b1 | 5678 | int i; |
80fd5f48 | 5679 | |
fa743e8c NS |
5680 | for (binfo = TYPE_BINFO (t), i = 0; |
5681 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
9785e4b1 | 5682 | { |
9785e4b1 | 5683 | if (!include_virtuals_p |
fc6633e0 NS |
5684 | && BINFO_VIRTUAL_P (base_binfo) |
5685 | && (!BINFO_PRIMARY_P (base_binfo) | |
5686 | || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t))) | |
9785e4b1 | 5687 | continue; |
80fd5f48 | 5688 | |
fa743e8c | 5689 | offset = end_of_base (base_binfo); |
17bbb839 MM |
5690 | if (INT_CST_LT_UNSIGNED (result, offset)) |
5691 | result = offset; | |
9785e4b1 | 5692 | } |
80fd5f48 | 5693 | |
ba9a991f MM |
5694 | /* G++ 3.2 did not check indirect virtual bases. */ |
5695 | if (abi_version_at_least (2) && include_virtuals_p) | |
9ba5ff0f | 5696 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 5697 | vec_safe_iterate (vbases, i, &base_binfo); i++) |
ba9a991f | 5698 | { |
9ba5ff0f | 5699 | offset = end_of_base (base_binfo); |
ba9a991f MM |
5700 | if (INT_CST_LT_UNSIGNED (result, offset)) |
5701 | result = offset; | |
5702 | } | |
5703 | ||
9785e4b1 | 5704 | return result; |
80fd5f48 MM |
5705 | } |
5706 | ||
17bbb839 | 5707 | /* Warn about bases of T that are inaccessible because they are |
78b45a24 MM |
5708 | ambiguous. For example: |
5709 | ||
5710 | struct S {}; | |
5711 | struct T : public S {}; | |
5712 | struct U : public S, public T {}; | |
5713 | ||
5714 | Here, `(S*) new U' is not allowed because there are two `S' | |
5715 | subobjects of U. */ | |
5716 | ||
5717 | static void | |
94edc4ab | 5718 | warn_about_ambiguous_bases (tree t) |
78b45a24 MM |
5719 | { |
5720 | int i; | |
9771b263 | 5721 | vec<tree, va_gc> *vbases; |
17bbb839 | 5722 | tree basetype; |
58c42dc2 | 5723 | tree binfo; |
fa743e8c | 5724 | tree base_binfo; |
78b45a24 | 5725 | |
18e4be85 NS |
5726 | /* If there are no repeated bases, nothing can be ambiguous. */ |
5727 | if (!CLASSTYPE_REPEATED_BASE_P (t)) | |
5728 | return; | |
c8094d83 | 5729 | |
17bbb839 | 5730 | /* Check direct bases. */ |
fa743e8c NS |
5731 | for (binfo = TYPE_BINFO (t), i = 0; |
5732 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
78b45a24 | 5733 | { |
fa743e8c | 5734 | basetype = BINFO_TYPE (base_binfo); |
78b45a24 | 5735 | |
22854930 | 5736 | if (!uniquely_derived_from_p (basetype, t)) |
d4ee4d25 | 5737 | warning (0, "direct base %qT inaccessible in %qT due to ambiguity", |
17bbb839 | 5738 | basetype, t); |
78b45a24 | 5739 | } |
17bbb839 MM |
5740 | |
5741 | /* Check for ambiguous virtual bases. */ | |
5742 | if (extra_warnings) | |
9ba5ff0f | 5743 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 5744 | vec_safe_iterate (vbases, i, &binfo); i++) |
17bbb839 | 5745 | { |
58c42dc2 | 5746 | basetype = BINFO_TYPE (binfo); |
c8094d83 | 5747 | |
22854930 PC |
5748 | if (!uniquely_derived_from_p (basetype, t)) |
5749 | warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due " | |
5750 | "to ambiguity", basetype, t); | |
17bbb839 | 5751 | } |
78b45a24 MM |
5752 | } |
5753 | ||
c20118a8 MM |
5754 | /* Compare two INTEGER_CSTs K1 and K2. */ |
5755 | ||
5756 | static int | |
94edc4ab | 5757 | splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2) |
c20118a8 MM |
5758 | { |
5759 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
5760 | } | |
5761 | ||
17bbb839 MM |
5762 | /* Increase the size indicated in RLI to account for empty classes |
5763 | that are "off the end" of the class. */ | |
5764 | ||
5765 | static void | |
5766 | include_empty_classes (record_layout_info rli) | |
5767 | { | |
5768 | tree eoc; | |
e3ccdd50 | 5769 | tree rli_size; |
17bbb839 MM |
5770 | |
5771 | /* It might be the case that we grew the class to allocate a | |
5772 | zero-sized base class. That won't be reflected in RLI, yet, | |
5773 | because we are willing to overlay multiple bases at the same | |
5774 | offset. However, now we need to make sure that RLI is big enough | |
5775 | to reflect the entire class. */ | |
c8094d83 | 5776 | eoc = end_of_class (rli->t, |
17bbb839 | 5777 | CLASSTYPE_AS_BASE (rli->t) != NULL_TREE); |
e3ccdd50 MM |
5778 | rli_size = rli_size_unit_so_far (rli); |
5779 | if (TREE_CODE (rli_size) == INTEGER_CST | |
5780 | && INT_CST_LT_UNSIGNED (rli_size, eoc)) | |
17bbb839 | 5781 | { |
43fe31f6 MM |
5782 | if (!abi_version_at_least (2)) |
5783 | /* In version 1 of the ABI, the size of a class that ends with | |
5784 | a bitfield was not rounded up to a whole multiple of a | |
5785 | byte. Because rli_size_unit_so_far returns only the number | |
5786 | of fully allocated bytes, any extra bits were not included | |
5787 | in the size. */ | |
5788 | rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT); | |
5789 | else | |
5790 | /* The size should have been rounded to a whole byte. */ | |
50bc768d NS |
5791 | gcc_assert (tree_int_cst_equal |
5792 | (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT))); | |
c8094d83 MS |
5793 | rli->bitpos |
5794 | = size_binop (PLUS_EXPR, | |
e3ccdd50 MM |
5795 | rli->bitpos, |
5796 | size_binop (MULT_EXPR, | |
5797 | convert (bitsizetype, | |
5798 | size_binop (MINUS_EXPR, | |
5799 | eoc, rli_size)), | |
5800 | bitsize_int (BITS_PER_UNIT))); | |
5801 | normalize_rli (rli); | |
17bbb839 MM |
5802 | } |
5803 | } | |
5804 | ||
2ef16140 MM |
5805 | /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate |
5806 | BINFO_OFFSETs for all of the base-classes. Position the vtable | |
00a17e31 | 5807 | pointer. Accumulate declared virtual functions on VIRTUALS_P. */ |
607cf131 | 5808 | |
2ef16140 | 5809 | static void |
e93ee644 | 5810 | layout_class_type (tree t, tree *virtuals_p) |
2ef16140 | 5811 | { |
5c24fba6 MM |
5812 | tree non_static_data_members; |
5813 | tree field; | |
5814 | tree vptr; | |
5815 | record_layout_info rli; | |
c20118a8 MM |
5816 | /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of |
5817 | types that appear at that offset. */ | |
5818 | splay_tree empty_base_offsets; | |
eca7f13c MM |
5819 | /* True if the last field layed out was a bit-field. */ |
5820 | bool last_field_was_bitfield = false; | |
17bbb839 MM |
5821 | /* The location at which the next field should be inserted. */ |
5822 | tree *next_field; | |
5823 | /* T, as a base class. */ | |
5824 | tree base_t; | |
5c24fba6 MM |
5825 | |
5826 | /* Keep track of the first non-static data member. */ | |
5827 | non_static_data_members = TYPE_FIELDS (t); | |
5828 | ||
770ae6cc RK |
5829 | /* Start laying out the record. */ |
5830 | rli = start_record_layout (t); | |
534170eb | 5831 | |
fc6633e0 NS |
5832 | /* Mark all the primary bases in the hierarchy. */ |
5833 | determine_primary_bases (t); | |
8026246f | 5834 | |
5c24fba6 | 5835 | /* Create a pointer to our virtual function table. */ |
58731fd1 | 5836 | vptr = create_vtable_ptr (t, virtuals_p); |
5c24fba6 | 5837 | |
3461fba7 | 5838 | /* The vptr is always the first thing in the class. */ |
1f84ec23 | 5839 | if (vptr) |
5c24fba6 | 5840 | { |
910ad8de | 5841 | DECL_CHAIN (vptr) = TYPE_FIELDS (t); |
17bbb839 | 5842 | TYPE_FIELDS (t) = vptr; |
910ad8de | 5843 | next_field = &DECL_CHAIN (vptr); |
770ae6cc | 5844 | place_field (rli, vptr); |
5c24fba6 | 5845 | } |
17bbb839 MM |
5846 | else |
5847 | next_field = &TYPE_FIELDS (t); | |
5c24fba6 | 5848 | |
72a50ab0 | 5849 | /* Build FIELD_DECLs for all of the non-virtual base-types. */ |
c8094d83 | 5850 | empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts, |
c20118a8 | 5851 | NULL, NULL); |
58731fd1 | 5852 | build_base_fields (rli, empty_base_offsets, next_field); |
c8094d83 | 5853 | |
5c24fba6 | 5854 | /* Layout the non-static data members. */ |
910ad8de | 5855 | for (field = non_static_data_members; field; field = DECL_CHAIN (field)) |
5c24fba6 | 5856 | { |
01955e96 MM |
5857 | tree type; |
5858 | tree padding; | |
5c24fba6 MM |
5859 | |
5860 | /* We still pass things that aren't non-static data members to | |
3b426391 | 5861 | the back end, in case it wants to do something with them. */ |
5c24fba6 MM |
5862 | if (TREE_CODE (field) != FIELD_DECL) |
5863 | { | |
770ae6cc | 5864 | place_field (rli, field); |
0154eaa8 | 5865 | /* If the static data member has incomplete type, keep track |
c8094d83 | 5866 | of it so that it can be completed later. (The handling |
0154eaa8 MM |
5867 | of pending statics in finish_record_layout is |
5868 | insufficient; consider: | |
5869 | ||
5870 | struct S1; | |
5871 | struct S2 { static S1 s1; }; | |
c8094d83 | 5872 | |
0cbd7506 | 5873 | At this point, finish_record_layout will be called, but |
0154eaa8 | 5874 | S1 is still incomplete.) */ |
5a6ccc94 | 5875 | if (VAR_P (field)) |
532b37d9 MM |
5876 | { |
5877 | maybe_register_incomplete_var (field); | |
5878 | /* The visibility of static data members is determined | |
5879 | at their point of declaration, not their point of | |
5880 | definition. */ | |
5881 | determine_visibility (field); | |
5882 | } | |
5c24fba6 MM |
5883 | continue; |
5884 | } | |
5885 | ||
01955e96 | 5886 | type = TREE_TYPE (field); |
4e3bd7d5 VR |
5887 | if (type == error_mark_node) |
5888 | continue; | |
c8094d83 | 5889 | |
1e099144 | 5890 | padding = NULL_TREE; |
01955e96 MM |
5891 | |
5892 | /* If this field is a bit-field whose width is greater than its | |
3461fba7 NS |
5893 | type, then there are some special rules for allocating |
5894 | it. */ | |
01955e96 | 5895 | if (DECL_C_BIT_FIELD (field) |
1f84ec23 | 5896 | && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field))) |
01955e96 | 5897 | { |
09639a83 | 5898 | unsigned int itk; |
01955e96 | 5899 | tree integer_type; |
555456b1 | 5900 | bool was_unnamed_p = false; |
01955e96 MM |
5901 | /* We must allocate the bits as if suitably aligned for the |
5902 | longest integer type that fits in this many bits. type | |
5903 | of the field. Then, we are supposed to use the left over | |
5904 | bits as additional padding. */ | |
5905 | for (itk = itk_char; itk != itk_none; ++itk) | |
64c31785 | 5906 | if (integer_types[itk] != NULL_TREE |
1c314335 L |
5907 | && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE), |
5908 | TYPE_SIZE (integer_types[itk])) | |
5909 | || INT_CST_LT (DECL_SIZE (field), | |
5910 | TYPE_SIZE (integer_types[itk])))) | |
01955e96 MM |
5911 | break; |
5912 | ||
5913 | /* ITK now indicates a type that is too large for the | |
5914 | field. We have to back up by one to find the largest | |
5915 | type that fits. */ | |
64c31785 KT |
5916 | do |
5917 | { | |
5918 | --itk; | |
5919 | integer_type = integer_types[itk]; | |
5920 | } while (itk > 0 && integer_type == NULL_TREE); | |
2d3e278d | 5921 | |
1e099144 MM |
5922 | /* Figure out how much additional padding is required. GCC |
5923 | 3.2 always created a padding field, even if it had zero | |
5924 | width. */ | |
5925 | if (!abi_version_at_least (2) | |
5926 | || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field))) | |
2d3e278d | 5927 | { |
1e099144 MM |
5928 | if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE) |
5929 | /* In a union, the padding field must have the full width | |
5930 | of the bit-field; all fields start at offset zero. */ | |
5931 | padding = DECL_SIZE (field); | |
5932 | else | |
5933 | { | |
74fa0285 GDR |
5934 | if (TREE_CODE (t) == UNION_TYPE) |
5935 | warning (OPT_Wabi, "size assigned to %qT may not be " | |
1e099144 | 5936 | "ABI-compliant and may change in a future " |
c8094d83 | 5937 | "version of GCC", |
1e099144 MM |
5938 | t); |
5939 | padding = size_binop (MINUS_EXPR, DECL_SIZE (field), | |
5940 | TYPE_SIZE (integer_type)); | |
5941 | } | |
2d3e278d | 5942 | } |
c9372112 | 5943 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
63e5f567 MM |
5944 | /* An unnamed bitfield does not normally affect the |
5945 | alignment of the containing class on a target where | |
5946 | PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not | |
5947 | make any exceptions for unnamed bitfields when the | |
5948 | bitfields are longer than their types. Therefore, we | |
5949 | temporarily give the field a name. */ | |
5950 | if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field)) | |
5951 | { | |
5952 | was_unnamed_p = true; | |
5953 | DECL_NAME (field) = make_anon_name (); | |
5954 | } | |
c9372112 | 5955 | #endif |
01955e96 MM |
5956 | DECL_SIZE (field) = TYPE_SIZE (integer_type); |
5957 | DECL_ALIGN (field) = TYPE_ALIGN (integer_type); | |
11cf4d18 | 5958 | DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type); |
555456b1 MM |
5959 | layout_nonempty_base_or_field (rli, field, NULL_TREE, |
5960 | empty_base_offsets); | |
5961 | if (was_unnamed_p) | |
5962 | DECL_NAME (field) = NULL_TREE; | |
5963 | /* Now that layout has been performed, set the size of the | |
5964 | field to the size of its declared type; the rest of the | |
5965 | field is effectively invisible. */ | |
5966 | DECL_SIZE (field) = TYPE_SIZE (type); | |
29edb15c MM |
5967 | /* We must also reset the DECL_MODE of the field. */ |
5968 | if (abi_version_at_least (2)) | |
5969 | DECL_MODE (field) = TYPE_MODE (type); | |
5970 | else if (warn_abi | |
5971 | && DECL_MODE (field) != TYPE_MODE (type)) | |
5972 | /* Versions of G++ before G++ 3.4 did not reset the | |
5973 | DECL_MODE. */ | |
74fa0285 | 5974 | warning (OPT_Wabi, |
3db45ab5 | 5975 | "the offset of %qD may not be ABI-compliant and may " |
29edb15c | 5976 | "change in a future version of GCC", field); |
01955e96 | 5977 | } |
555456b1 MM |
5978 | else |
5979 | layout_nonempty_base_or_field (rli, field, NULL_TREE, | |
5980 | empty_base_offsets); | |
01955e96 | 5981 | |
2003cd37 MM |
5982 | /* Remember the location of any empty classes in FIELD. */ |
5983 | if (abi_version_at_least (2)) | |
c8094d83 | 5984 | record_subobject_offsets (TREE_TYPE (field), |
2003cd37 MM |
5985 | byte_position(field), |
5986 | empty_base_offsets, | |
c5a35c3c | 5987 | /*is_data_member=*/true); |
2003cd37 | 5988 | |
eca7f13c MM |
5989 | /* If a bit-field does not immediately follow another bit-field, |
5990 | and yet it starts in the middle of a byte, we have failed to | |
5991 | comply with the ABI. */ | |
5992 | if (warn_abi | |
c8094d83 | 5993 | && DECL_C_BIT_FIELD (field) |
660845bf ZL |
5994 | /* The TREE_NO_WARNING flag gets set by Objective-C when |
5995 | laying out an Objective-C class. The ObjC ABI differs | |
5996 | from the C++ ABI, and so we do not want a warning | |
5997 | here. */ | |
5998 | && !TREE_NO_WARNING (field) | |
eca7f13c MM |
5999 | && !last_field_was_bitfield |
6000 | && !integer_zerop (size_binop (TRUNC_MOD_EXPR, | |
6001 | DECL_FIELD_BIT_OFFSET (field), | |
6002 | bitsize_unit_node))) | |
74fa0285 | 6003 | warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may " |
dee15844 | 6004 | "change in a future version of GCC", field); |
eca7f13c | 6005 | |
956d9305 MM |
6006 | /* G++ used to use DECL_FIELD_OFFSET as if it were the byte |
6007 | offset of the field. */ | |
c8094d83 | 6008 | if (warn_abi |
254d1a5a | 6009 | && !abi_version_at_least (2) |
956d9305 MM |
6010 | && !tree_int_cst_equal (DECL_FIELD_OFFSET (field), |
6011 | byte_position (field)) | |
6012 | && contains_empty_class_p (TREE_TYPE (field))) | |
74fa0285 | 6013 | warning (OPT_Wabi, "%q+D contains empty classes which may cause base " |
dee15844 JM |
6014 | "classes to be placed at different locations in a " |
6015 | "future version of GCC", field); | |
956d9305 | 6016 | |
38a4afee MM |
6017 | /* The middle end uses the type of expressions to determine the |
6018 | possible range of expression values. In order to optimize | |
6019 | "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end | |
3db45ab5 | 6020 | must be made aware of the width of "i", via its type. |
38a4afee | 6021 | |
3db45ab5 | 6022 | Because C++ does not have integer types of arbitrary width, |
38a4afee MM |
6023 | we must (for the purposes of the front end) convert from the |
6024 | type assigned here to the declared type of the bitfield | |
6025 | whenever a bitfield expression is used as an rvalue. | |
6026 | Similarly, when assigning a value to a bitfield, the value | |
6027 | must be converted to the type given the bitfield here. */ | |
6028 | if (DECL_C_BIT_FIELD (field)) | |
6029 | { | |
38a4afee | 6030 | unsigned HOST_WIDE_INT width; |
24030e4c | 6031 | tree ftype = TREE_TYPE (field); |
38a4afee MM |
6032 | width = tree_low_cst (DECL_SIZE (field), /*unsignedp=*/1); |
6033 | if (width != TYPE_PRECISION (ftype)) | |
24030e4c JJ |
6034 | { |
6035 | TREE_TYPE (field) | |
6036 | = c_build_bitfield_integer_type (width, | |
6037 | TYPE_UNSIGNED (ftype)); | |
6038 | TREE_TYPE (field) | |
6039 | = cp_build_qualified_type (TREE_TYPE (field), | |
a3360e77 | 6040 | cp_type_quals (ftype)); |
24030e4c | 6041 | } |
38a4afee MM |
6042 | } |
6043 | ||
01955e96 MM |
6044 | /* If we needed additional padding after this field, add it |
6045 | now. */ | |
6046 | if (padding) | |
6047 | { | |
6048 | tree padding_field; | |
6049 | ||
c2255bc4 AH |
6050 | padding_field = build_decl (input_location, |
6051 | FIELD_DECL, | |
01955e96 | 6052 | NULL_TREE, |
c8094d83 | 6053 | char_type_node); |
01955e96 MM |
6054 | DECL_BIT_FIELD (padding_field) = 1; |
6055 | DECL_SIZE (padding_field) = padding; | |
1e099144 | 6056 | DECL_CONTEXT (padding_field) = t; |
ea258926 | 6057 | DECL_ARTIFICIAL (padding_field) = 1; |
78e0d62b | 6058 | DECL_IGNORED_P (padding_field) = 1; |
c20118a8 | 6059 | layout_nonempty_base_or_field (rli, padding_field, |
c8094d83 | 6060 | NULL_TREE, |
17bbb839 | 6061 | empty_base_offsets); |
01955e96 | 6062 | } |
eca7f13c MM |
6063 | |
6064 | last_field_was_bitfield = DECL_C_BIT_FIELD (field); | |
5c24fba6 MM |
6065 | } |
6066 | ||
17bbb839 | 6067 | if (abi_version_at_least (2) && !integer_zerop (rli->bitpos)) |
e3ccdd50 MM |
6068 | { |
6069 | /* Make sure that we are on a byte boundary so that the size of | |
6070 | the class without virtual bases will always be a round number | |
6071 | of bytes. */ | |
db3927fb | 6072 | rli->bitpos = round_up_loc (input_location, rli->bitpos, BITS_PER_UNIT); |
e3ccdd50 MM |
6073 | normalize_rli (rli); |
6074 | } | |
17bbb839 | 6075 | |
8a874cb4 MM |
6076 | /* G++ 3.2 does not allow virtual bases to be overlaid with tail |
6077 | padding. */ | |
6078 | if (!abi_version_at_least (2)) | |
6079 | include_empty_classes(rli); | |
58010b57 | 6080 | |
3ef397c1 MM |
6081 | /* Delete all zero-width bit-fields from the list of fields. Now |
6082 | that the type is laid out they are no longer important. */ | |
6083 | remove_zero_width_bit_fields (t); | |
6084 | ||
17bbb839 | 6085 | /* Create the version of T used for virtual bases. We do not use |
9e1e64ec | 6086 | make_class_type for this version; this is an artificial type. For |
17bbb839 | 6087 | a POD type, we just reuse T. */ |
c32097d8 | 6088 | if (CLASSTYPE_NON_LAYOUT_POD_P (t) || CLASSTYPE_EMPTY_P (t)) |
06ceef4e | 6089 | { |
17bbb839 | 6090 | base_t = make_node (TREE_CODE (t)); |
c8094d83 | 6091 | |
58731fd1 MM |
6092 | /* Set the size and alignment for the new type. In G++ 3.2, all |
6093 | empty classes were considered to have size zero when used as | |
6094 | base classes. */ | |
6095 | if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t)) | |
6096 | { | |
6097 | TYPE_SIZE (base_t) = bitsize_zero_node; | |
6098 | TYPE_SIZE_UNIT (base_t) = size_zero_node; | |
6099 | if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli))) | |
74fa0285 | 6100 | warning (OPT_Wabi, |
3db45ab5 | 6101 | "layout of classes derived from empty class %qT " |
58731fd1 MM |
6102 | "may change in a future version of GCC", |
6103 | t); | |
6104 | } | |
6105 | else | |
6106 | { | |
6b99d1c0 MM |
6107 | tree eoc; |
6108 | ||
6109 | /* If the ABI version is not at least two, and the last | |
6110 | field was a bit-field, RLI may not be on a byte | |
6111 | boundary. In particular, rli_size_unit_so_far might | |
6112 | indicate the last complete byte, while rli_size_so_far | |
6113 | indicates the total number of bits used. Therefore, | |
6114 | rli_size_so_far, rather than rli_size_unit_so_far, is | |
6115 | used to compute TYPE_SIZE_UNIT. */ | |
6116 | eoc = end_of_class (t, /*include_virtuals_p=*/0); | |
c8094d83 | 6117 | TYPE_SIZE_UNIT (base_t) |
8a874cb4 | 6118 | = size_binop (MAX_EXPR, |
6b99d1c0 MM |
6119 | convert (sizetype, |
6120 | size_binop (CEIL_DIV_EXPR, | |
6121 | rli_size_so_far (rli), | |
6122 | bitsize_int (BITS_PER_UNIT))), | |
6123 | eoc); | |
c8094d83 | 6124 | TYPE_SIZE (base_t) |
8a874cb4 MM |
6125 | = size_binop (MAX_EXPR, |
6126 | rli_size_so_far (rli), | |
6127 | size_binop (MULT_EXPR, | |
6b99d1c0 | 6128 | convert (bitsizetype, eoc), |
8a874cb4 | 6129 | bitsize_int (BITS_PER_UNIT))); |
58731fd1 | 6130 | } |
17bbb839 MM |
6131 | TYPE_ALIGN (base_t) = rli->record_align; |
6132 | TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t); | |
6133 | ||
6134 | /* Copy the fields from T. */ | |
6135 | next_field = &TYPE_FIELDS (base_t); | |
910ad8de | 6136 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
17bbb839 MM |
6137 | if (TREE_CODE (field) == FIELD_DECL) |
6138 | { | |
c2255bc4 AH |
6139 | *next_field = build_decl (input_location, |
6140 | FIELD_DECL, | |
c8094d83 | 6141 | DECL_NAME (field), |
17bbb839 MM |
6142 | TREE_TYPE (field)); |
6143 | DECL_CONTEXT (*next_field) = base_t; | |
6144 | DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field); | |
6145 | DECL_FIELD_BIT_OFFSET (*next_field) | |
6146 | = DECL_FIELD_BIT_OFFSET (field); | |
4f0a2b81 MM |
6147 | DECL_SIZE (*next_field) = DECL_SIZE (field); |
6148 | DECL_MODE (*next_field) = DECL_MODE (field); | |
910ad8de | 6149 | next_field = &DECL_CHAIN (*next_field); |
17bbb839 MM |
6150 | } |
6151 | ||
6152 | /* Record the base version of the type. */ | |
6153 | CLASSTYPE_AS_BASE (t) = base_t; | |
5a5cccaa | 6154 | TYPE_CONTEXT (base_t) = t; |
83b14b88 | 6155 | } |
1f84ec23 | 6156 | else |
17bbb839 | 6157 | CLASSTYPE_AS_BASE (t) = t; |
0b41abe6 | 6158 | |
5ec1192e MM |
6159 | /* Every empty class contains an empty class. */ |
6160 | if (CLASSTYPE_EMPTY_P (t)) | |
6161 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
6162 | ||
8d08fdba MS |
6163 | /* Set the TYPE_DECL for this type to contain the right |
6164 | value for DECL_OFFSET, so that we can use it as part | |
6165 | of a COMPONENT_REF for multiple inheritance. */ | |
d2e5ee5c | 6166 | layout_decl (TYPE_MAIN_DECL (t), 0); |
8d08fdba | 6167 | |
7177d104 MS |
6168 | /* Now fix up any virtual base class types that we left lying |
6169 | around. We must get these done before we try to lay out the | |
5c24fba6 MM |
6170 | virtual function table. As a side-effect, this will remove the |
6171 | base subobject fields. */ | |
17bbb839 MM |
6172 | layout_virtual_bases (rli, empty_base_offsets); |
6173 | ||
c8094d83 | 6174 | /* Make sure that empty classes are reflected in RLI at this |
17bbb839 MM |
6175 | point. */ |
6176 | include_empty_classes(rli); | |
6177 | ||
6178 | /* Make sure not to create any structures with zero size. */ | |
58731fd1 | 6179 | if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t)) |
c8094d83 | 6180 | place_field (rli, |
c2255bc4 AH |
6181 | build_decl (input_location, |
6182 | FIELD_DECL, NULL_TREE, char_type_node)); | |
17bbb839 | 6183 | |
a402c1b1 JM |
6184 | /* If this is a non-POD, declaring it packed makes a difference to how it |
6185 | can be used as a field; don't let finalize_record_size undo it. */ | |
6186 | if (TYPE_PACKED (t) && !layout_pod_type_p (t)) | |
6187 | rli->packed_maybe_necessary = true; | |
6188 | ||
3b426391 | 6189 | /* Let the back end lay out the type. */ |
17bbb839 | 6190 | finish_record_layout (rli, /*free_p=*/true); |
9785e4b1 | 6191 | |
17bbb839 MM |
6192 | /* Warn about bases that can't be talked about due to ambiguity. */ |
6193 | warn_about_ambiguous_bases (t); | |
78b45a24 | 6194 | |
00bfffa4 | 6195 | /* Now that we're done with layout, give the base fields the real types. */ |
910ad8de | 6196 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
6197 | if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field))) |
6198 | TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field)); | |
6199 | ||
9785e4b1 | 6200 | /* Clean up. */ |
c20118a8 | 6201 | splay_tree_delete (empty_base_offsets); |
c5a35c3c MM |
6202 | |
6203 | if (CLASSTYPE_EMPTY_P (t) | |
3db45ab5 | 6204 | && tree_int_cst_lt (sizeof_biggest_empty_class, |
c0572427 MM |
6205 | TYPE_SIZE_UNIT (t))) |
6206 | sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t); | |
2ef16140 | 6207 | } |
c35cce41 | 6208 | |
af287697 MM |
6209 | /* Determine the "key method" for the class type indicated by TYPE, |
6210 | and set CLASSTYPE_KEY_METHOD accordingly. */ | |
9aad8f83 | 6211 | |
af287697 MM |
6212 | void |
6213 | determine_key_method (tree type) | |
9aad8f83 MA |
6214 | { |
6215 | tree method; | |
6216 | ||
6217 | if (TYPE_FOR_JAVA (type) | |
6218 | || processing_template_decl | |
6219 | || CLASSTYPE_TEMPLATE_INSTANTIATION (type) | |
6220 | || CLASSTYPE_INTERFACE_KNOWN (type)) | |
af287697 | 6221 | return; |
9aad8f83 | 6222 | |
af287697 MM |
6223 | /* The key method is the first non-pure virtual function that is not |
6224 | inline at the point of class definition. On some targets the | |
6225 | key function may not be inline; those targets should not call | |
6226 | this function until the end of the translation unit. */ | |
9aad8f83 | 6227 | for (method = TYPE_METHODS (type); method != NULL_TREE; |
910ad8de | 6228 | method = DECL_CHAIN (method)) |
9aad8f83 MA |
6229 | if (DECL_VINDEX (method) != NULL_TREE |
6230 | && ! DECL_DECLARED_INLINE_P (method) | |
6231 | && ! DECL_PURE_VIRTUAL_P (method)) | |
af287697 MM |
6232 | { |
6233 | CLASSTYPE_KEY_METHOD (type) = method; | |
6234 | break; | |
6235 | } | |
9aad8f83 | 6236 | |
af287697 | 6237 | return; |
9aad8f83 MA |
6238 | } |
6239 | ||
385b73ab DN |
6240 | |
6241 | /* Allocate and return an instance of struct sorted_fields_type with | |
6242 | N fields. */ | |
6243 | ||
6244 | static struct sorted_fields_type * | |
6245 | sorted_fields_type_new (int n) | |
6246 | { | |
6247 | struct sorted_fields_type *sft; | |
6248 | sft = ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type) | |
6249 | + n * sizeof (tree)); | |
6250 | sft->len = n; | |
6251 | ||
6252 | return sft; | |
6253 | } | |
6254 | ||
6255 | ||
548502d3 MM |
6256 | /* Perform processing required when the definition of T (a class type) |
6257 | is complete. */ | |
2ef16140 MM |
6258 | |
6259 | void | |
94edc4ab | 6260 | finish_struct_1 (tree t) |
2ef16140 MM |
6261 | { |
6262 | tree x; | |
00a17e31 | 6263 | /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */ |
e6858a84 | 6264 | tree virtuals = NULL_TREE; |
2ef16140 | 6265 | |
d0f062fb | 6266 | if (COMPLETE_TYPE_P (t)) |
2ef16140 | 6267 | { |
9e1e64ec | 6268 | gcc_assert (MAYBE_CLASS_TYPE_P (t)); |
1f070f2b | 6269 | error ("redefinition of %q#T", t); |
2ef16140 MM |
6270 | popclass (); |
6271 | return; | |
6272 | } | |
6273 | ||
2ef16140 MM |
6274 | /* If this type was previously laid out as a forward reference, |
6275 | make sure we lay it out again. */ | |
2ef16140 | 6276 | TYPE_SIZE (t) = NULL_TREE; |
911a71a7 | 6277 | CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE; |
2ef16140 | 6278 | |
5ec1192e MM |
6279 | /* Make assumptions about the class; we'll reset the flags if |
6280 | necessary. */ | |
58731fd1 MM |
6281 | CLASSTYPE_EMPTY_P (t) = 1; |
6282 | CLASSTYPE_NEARLY_EMPTY_P (t) = 1; | |
5ec1192e | 6283 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0; |
3b49d762 | 6284 | CLASSTYPE_LITERAL_P (t) = true; |
58731fd1 | 6285 | |
2ef16140 | 6286 | /* Do end-of-class semantic processing: checking the validity of the |
03702748 | 6287 | bases and members and add implicitly generated methods. */ |
58731fd1 | 6288 | check_bases_and_members (t); |
2ef16140 | 6289 | |
f4f206f4 | 6290 | /* Find the key method. */ |
a63996f1 | 6291 | if (TYPE_CONTAINS_VPTR_P (t)) |
9aad8f83 | 6292 | { |
af287697 MM |
6293 | /* The Itanium C++ ABI permits the key method to be chosen when |
6294 | the class is defined -- even though the key method so | |
6295 | selected may later turn out to be an inline function. On | |
6296 | some systems (such as ARM Symbian OS) the key method cannot | |
6297 | be determined until the end of the translation unit. On such | |
6298 | systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which | |
6299 | will cause the class to be added to KEYED_CLASSES. Then, in | |
6300 | finish_file we will determine the key method. */ | |
6301 | if (targetm.cxx.key_method_may_be_inline ()) | |
6302 | determine_key_method (t); | |
9aad8f83 MA |
6303 | |
6304 | /* If a polymorphic class has no key method, we may emit the vtable | |
9bcb9aae | 6305 | in every translation unit where the class definition appears. */ |
9aad8f83 MA |
6306 | if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE) |
6307 | keyed_classes = tree_cons (NULL_TREE, t, keyed_classes); | |
6308 | } | |
6309 | ||
2ef16140 | 6310 | /* Layout the class itself. */ |
e93ee644 | 6311 | layout_class_type (t, &virtuals); |
a0c68737 NS |
6312 | if (CLASSTYPE_AS_BASE (t) != t) |
6313 | /* We use the base type for trivial assignments, and hence it | |
6314 | needs a mode. */ | |
6315 | compute_record_mode (CLASSTYPE_AS_BASE (t)); | |
8ebeee52 | 6316 | |
e93ee644 | 6317 | virtuals = modify_all_vtables (t, nreverse (virtuals)); |
db5ae43f | 6318 | |
5e19c053 | 6319 | /* If necessary, create the primary vtable for this class. */ |
e6858a84 | 6320 | if (virtuals || TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 6321 | { |
8d08fdba | 6322 | /* We must enter these virtuals into the table. */ |
3ef397c1 | 6323 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
da3d4dfa | 6324 | build_primary_vtable (NULL_TREE, t); |
dbbf88d1 | 6325 | else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t))) |
0533d788 MM |
6326 | /* Here we know enough to change the type of our virtual |
6327 | function table, but we will wait until later this function. */ | |
28531dd0 | 6328 | build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t); |
d3061adb JM |
6329 | |
6330 | /* If we're warning about ABI tags, check the types of the new | |
6331 | virtual functions. */ | |
6332 | if (warn_abi_tag) | |
6333 | for (tree v = virtuals; v; v = TREE_CHAIN (v)) | |
6334 | check_abi_tags (t, TREE_VALUE (v)); | |
8d08fdba MS |
6335 | } |
6336 | ||
bbd15aac | 6337 | if (TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 6338 | { |
e93ee644 MM |
6339 | int vindex; |
6340 | tree fn; | |
6341 | ||
604a3205 | 6342 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
50bc768d | 6343 | gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t)))); |
1eb4bea9 | 6344 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
50bc768d | 6345 | gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE); |
1eb4bea9 | 6346 | |
e6858a84 | 6347 | /* Add entries for virtual functions introduced by this class. */ |
604a3205 NS |
6348 | BINFO_VIRTUALS (TYPE_BINFO (t)) |
6349 | = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals); | |
e93ee644 MM |
6350 | |
6351 | /* Set DECL_VINDEX for all functions declared in this class. */ | |
c8094d83 MS |
6352 | for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t)); |
6353 | fn; | |
6354 | fn = TREE_CHAIN (fn), | |
e93ee644 MM |
6355 | vindex += (TARGET_VTABLE_USES_DESCRIPTORS |
6356 | ? TARGET_VTABLE_USES_DESCRIPTORS : 1)) | |
4977bab6 ZW |
6357 | { |
6358 | tree fndecl = BV_FN (fn); | |
6359 | ||
6360 | if (DECL_THUNK_P (fndecl)) | |
6361 | /* A thunk. We should never be calling this entry directly | |
6362 | from this vtable -- we'd use the entry for the non | |
6363 | thunk base function. */ | |
6364 | DECL_VINDEX (fndecl) = NULL_TREE; | |
6365 | else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST) | |
7d60be94 | 6366 | DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex); |
4977bab6 | 6367 | } |
8d08fdba MS |
6368 | } |
6369 | ||
d2c5305b | 6370 | finish_struct_bits (t); |
0a35513e | 6371 | set_method_tm_attributes (t); |
8d08fdba | 6372 | |
f30432d7 MS |
6373 | /* Complete the rtl for any static member objects of the type we're |
6374 | working on. */ | |
910ad8de | 6375 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) |
5a6ccc94 | 6376 | if (VAR_P (x) && TREE_STATIC (x) |
650fcd07 | 6377 | && TREE_TYPE (x) != error_mark_node |
c7f4981a | 6378 | && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t)) |
19e7881c | 6379 | DECL_MODE (x) = TYPE_MODE (t); |
8d08fdba | 6380 | |
f90cdf34 | 6381 | /* Done with FIELDS...now decide whether to sort these for |
58010b57 | 6382 | faster lookups later. |
f90cdf34 | 6383 | |
6c73ad72 | 6384 | We use a small number because most searches fail (succeeding |
f90cdf34 MT |
6385 | ultimately as the search bores through the inheritance |
6386 | hierarchy), and we want this failure to occur quickly. */ | |
6387 | ||
cba0366c | 6388 | insert_into_classtype_sorted_fields (TYPE_FIELDS (t), t, 8); |
f90cdf34 | 6389 | |
b9e75696 JM |
6390 | /* Complain if one of the field types requires lower visibility. */ |
6391 | constrain_class_visibility (t); | |
6392 | ||
8d7a5379 MM |
6393 | /* Make the rtl for any new vtables we have created, and unmark |
6394 | the base types we marked. */ | |
6395 | finish_vtbls (t); | |
c8094d83 | 6396 | |
23656158 MM |
6397 | /* Build the VTT for T. */ |
6398 | build_vtt (t); | |
8d7a5379 | 6399 | |
f03e8526 MM |
6400 | /* This warning does not make sense for Java classes, since they |
6401 | cannot have destructors. */ | |
6402 | if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t)) | |
9fd8f60d | 6403 | { |
9f4faeae MM |
6404 | tree dtor; |
6405 | ||
6406 | dtor = CLASSTYPE_DESTRUCTORS (t); | |
9f4faeae MM |
6407 | if (/* An implicitly declared destructor is always public. And, |
6408 | if it were virtual, we would have created it by now. */ | |
6409 | !dtor | |
6410 | || (!DECL_VINDEX (dtor) | |
43f14744 PS |
6411 | && (/* public non-virtual */ |
6412 | (!TREE_PRIVATE (dtor) && !TREE_PROTECTED (dtor)) | |
6413 | || (/* non-public non-virtual with friends */ | |
6414 | (TREE_PRIVATE (dtor) || TREE_PROTECTED (dtor)) | |
6415 | && (CLASSTYPE_FRIEND_CLASSES (t) | |
6416 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))))))) | |
6417 | warning (OPT_Wnon_virtual_dtor, | |
6418 | "%q#T has virtual functions and accessible" | |
6419 | " non-virtual destructor", t); | |
9fd8f60d | 6420 | } |
8d08fdba | 6421 | |
0154eaa8 | 6422 | complete_vars (t); |
8d08fdba | 6423 | |
9e9ff709 MS |
6424 | if (warn_overloaded_virtual) |
6425 | warn_hidden (t); | |
8d08fdba | 6426 | |
43d9ad1d DS |
6427 | /* Class layout, assignment of virtual table slots, etc., is now |
6428 | complete. Give the back end a chance to tweak the visibility of | |
6429 | the class or perform any other required target modifications. */ | |
6430 | targetm.cxx.adjust_class_at_definition (t); | |
6431 | ||
ae673f14 | 6432 | maybe_suppress_debug_info (t); |
8d08fdba | 6433 | |
b7442fb5 | 6434 | dump_class_hierarchy (t); |
c8094d83 | 6435 | |
d2e5ee5c | 6436 | /* Finish debugging output for this type. */ |
881c6935 | 6437 | rest_of_type_compilation (t, ! LOCAL_CLASS_P (t)); |
bfcbe068 | 6438 | |
e7b6bcf3 | 6439 | if (TYPE_TRANSPARENT_AGGR (t)) |
bfcbe068 | 6440 | { |
e7b6bcf3 JJ |
6441 | tree field = first_field (t); |
6442 | if (field == NULL_TREE || error_operand_p (field)) | |
6443 | { | |
42b40eff | 6444 | error ("type transparent %q#T does not have any fields", t); |
e7b6bcf3 JJ |
6445 | TYPE_TRANSPARENT_AGGR (t) = 0; |
6446 | } | |
6447 | else if (DECL_ARTIFICIAL (field)) | |
6448 | { | |
6449 | if (DECL_FIELD_IS_BASE (field)) | |
6450 | error ("type transparent class %qT has base classes", t); | |
6451 | else | |
6452 | { | |
6453 | gcc_checking_assert (DECL_VIRTUAL_P (field)); | |
6454 | error ("type transparent class %qT has virtual functions", t); | |
6455 | } | |
6456 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6457 | } | |
42b40eff PC |
6458 | else if (TYPE_MODE (t) != DECL_MODE (field)) |
6459 | { | |
6460 | error ("type transparent %q#T cannot be made transparent because " | |
6461 | "the type of the first field has a different ABI from the " | |
6462 | "class overall", t); | |
6463 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6464 | } | |
bfcbe068 | 6465 | } |
8d08fdba | 6466 | } |
f30432d7 | 6467 | |
cba0366c FC |
6468 | /* Insert FIELDS into T for the sorted case if the FIELDS count is |
6469 | equal to THRESHOLD or greater than THRESHOLD. */ | |
6470 | ||
6471 | static void | |
6472 | insert_into_classtype_sorted_fields (tree fields, tree t, int threshold) | |
6473 | { | |
6474 | int n_fields = count_fields (fields); | |
6475 | if (n_fields >= threshold) | |
6476 | { | |
6477 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); | |
6478 | add_fields_to_record_type (fields, field_vec, 0); | |
6479 | qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp); | |
6480 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; | |
6481 | } | |
6482 | } | |
6483 | ||
6484 | /* Insert lately defined enum ENUMTYPE into T for the sorted case. */ | |
6485 | ||
6486 | void | |
6487 | insert_late_enum_def_into_classtype_sorted_fields (tree enumtype, tree t) | |
6488 | { | |
6489 | struct sorted_fields_type *sorted_fields = CLASSTYPE_SORTED_FIELDS (t); | |
6490 | if (sorted_fields) | |
6491 | { | |
6492 | int i; | |
6493 | int n_fields | |
6494 | = list_length (TYPE_VALUES (enumtype)) + sorted_fields->len; | |
6495 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); | |
6496 | ||
6497 | for (i = 0; i < sorted_fields->len; ++i) | |
6498 | field_vec->elts[i] = sorted_fields->elts[i]; | |
6499 | ||
6500 | add_enum_fields_to_record_type (enumtype, field_vec, | |
6501 | sorted_fields->len); | |
6502 | qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp); | |
6503 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; | |
6504 | } | |
6505 | } | |
6506 | ||
61a127b3 MM |
6507 | /* When T was built up, the member declarations were added in reverse |
6508 | order. Rearrange them to declaration order. */ | |
6509 | ||
6510 | void | |
94edc4ab | 6511 | unreverse_member_declarations (tree t) |
61a127b3 MM |
6512 | { |
6513 | tree next; | |
6514 | tree prev; | |
6515 | tree x; | |
6516 | ||
7088fca9 KL |
6517 | /* The following lists are all in reverse order. Put them in |
6518 | declaration order now. */ | |
61a127b3 | 6519 | TYPE_METHODS (t) = nreverse (TYPE_METHODS (t)); |
7088fca9 | 6520 | CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t)); |
61a127b3 MM |
6521 | |
6522 | /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in | |
6523 | reverse order, so we can't just use nreverse. */ | |
6524 | prev = NULL_TREE; | |
c8094d83 MS |
6525 | for (x = TYPE_FIELDS (t); |
6526 | x && TREE_CODE (x) != TYPE_DECL; | |
61a127b3 MM |
6527 | x = next) |
6528 | { | |
910ad8de NF |
6529 | next = DECL_CHAIN (x); |
6530 | DECL_CHAIN (x) = prev; | |
61a127b3 MM |
6531 | prev = x; |
6532 | } | |
6533 | if (prev) | |
6534 | { | |
910ad8de | 6535 | DECL_CHAIN (TYPE_FIELDS (t)) = x; |
61a127b3 MM |
6536 | if (prev) |
6537 | TYPE_FIELDS (t) = prev; | |
6538 | } | |
6539 | } | |
6540 | ||
f30432d7 | 6541 | tree |
94edc4ab | 6542 | finish_struct (tree t, tree attributes) |
f30432d7 | 6543 | { |
82a98427 | 6544 | location_t saved_loc = input_location; |
1f0d71c5 | 6545 | |
61a127b3 MM |
6546 | /* Now that we've got all the field declarations, reverse everything |
6547 | as necessary. */ | |
6548 | unreverse_member_declarations (t); | |
f30432d7 | 6549 | |
91d231cb | 6550 | cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); |
6467930b | 6551 | |
1f0d71c5 NS |
6552 | /* Nadger the current location so that diagnostics point to the start of |
6553 | the struct, not the end. */ | |
f31686a3 | 6554 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t)); |
1f0d71c5 | 6555 | |
5566b478 | 6556 | if (processing_template_decl) |
f30432d7 | 6557 | { |
7fb213d8 GB |
6558 | tree x; |
6559 | ||
b0e0b31f | 6560 | finish_struct_methods (t); |
867580ce | 6561 | TYPE_SIZE (t) = bitsize_zero_node; |
ae54ec16 | 6562 | TYPE_SIZE_UNIT (t) = size_zero_node; |
7fb213d8 GB |
6563 | |
6564 | /* We need to emit an error message if this type was used as a parameter | |
6565 | and it is an abstract type, even if it is a template. We construct | |
6566 | a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into | |
6567 | account and we call complete_vars with this type, which will check | |
6568 | the PARM_DECLS. Note that while the type is being defined, | |
6569 | CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends | |
6570 | (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */ | |
585b44d3 | 6571 | CLASSTYPE_PURE_VIRTUALS (t) = NULL; |
910ad8de | 6572 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
7fb213d8 | 6573 | if (DECL_PURE_VIRTUAL_P (x)) |
9771b263 | 6574 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x); |
7fb213d8 | 6575 | complete_vars (t); |
e58d4228 JM |
6576 | /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if |
6577 | an enclosing scope is a template class, so that this function be | |
6578 | found by lookup_fnfields_1 when the using declaration is not | |
6579 | instantiated yet. */ | |
6580 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) | |
6581 | if (TREE_CODE (x) == USING_DECL) | |
6582 | { | |
6583 | tree fn = strip_using_decl (x); | |
6584 | if (is_overloaded_fn (fn)) | |
6585 | for (; fn; fn = OVL_NEXT (fn)) | |
6586 | add_method (t, OVL_CURRENT (fn), x); | |
6587 | } | |
040ca4b3 JM |
6588 | |
6589 | /* Remember current #pragma pack value. */ | |
6590 | TYPE_PRECISION (t) = maximum_field_alignment; | |
947296ca JM |
6591 | |
6592 | /* Fix up any variants we've already built. */ | |
6593 | for (x = TYPE_NEXT_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x)) | |
6594 | { | |
6595 | TYPE_SIZE (x) = TYPE_SIZE (t); | |
6596 | TYPE_SIZE_UNIT (x) = TYPE_SIZE_UNIT (t); | |
6597 | TYPE_FIELDS (x) = TYPE_FIELDS (t); | |
6598 | TYPE_METHODS (x) = TYPE_METHODS (t); | |
6599 | } | |
6f1b4c42 | 6600 | } |
f30432d7 | 6601 | else |
9f33663b | 6602 | finish_struct_1 (t); |
5566b478 | 6603 | |
82a98427 | 6604 | input_location = saved_loc; |
1f0d71c5 | 6605 | |
5566b478 | 6606 | TYPE_BEING_DEFINED (t) = 0; |
8f032717 | 6607 | |
5566b478 | 6608 | if (current_class_type) |
b74a0560 | 6609 | popclass (); |
5566b478 | 6610 | else |
357351e5 | 6611 | error ("trying to finish struct, but kicked out due to previous parse errors"); |
5566b478 | 6612 | |
637f68e8 JM |
6613 | if (processing_template_decl && at_function_scope_p () |
6614 | /* Lambdas are defined by the LAMBDA_EXPR. */ | |
6615 | && !LAMBDA_TYPE_P (t)) | |
5f261ba9 | 6616 | add_stmt (build_min (TAG_DEFN, t)); |
ae673f14 | 6617 | |
5566b478 | 6618 | return t; |
f30432d7 | 6619 | } |
8d08fdba | 6620 | \f |
abcc192b JJ |
6621 | /* Hash table to avoid endless recursion when handling references. */ |
6622 | static hash_table <pointer_hash <tree_node> > fixed_type_or_null_ref_ht; | |
6623 | ||
51ddb82e | 6624 | /* Return the dynamic type of INSTANCE, if known. |
8d08fdba MS |
6625 | Used to determine whether the virtual function table is needed |
6626 | or not. | |
6627 | ||
6628 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6629 | of our knowledge of its type. *NONNULL should be initialized |
6630 | before this function is called. */ | |
e92cc029 | 6631 | |
d8e178a0 | 6632 | static tree |
555551c2 | 6633 | fixed_type_or_null (tree instance, int *nonnull, int *cdtorp) |
8d08fdba | 6634 | { |
555551c2 MM |
6635 | #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp) |
6636 | ||
8d08fdba MS |
6637 | switch (TREE_CODE (instance)) |
6638 | { | |
6639 | case INDIRECT_REF: | |
608afcc5 | 6640 | if (POINTER_TYPE_P (TREE_TYPE (instance))) |
a0de9d20 JM |
6641 | return NULL_TREE; |
6642 | else | |
555551c2 | 6643 | return RECUR (TREE_OPERAND (instance, 0)); |
a0de9d20 | 6644 | |
8d08fdba MS |
6645 | case CALL_EXPR: |
6646 | /* This is a call to a constructor, hence it's never zero. */ | |
6647 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6648 | { | |
6649 | if (nonnull) | |
6650 | *nonnull = 1; | |
51ddb82e | 6651 | return TREE_TYPE (instance); |
8d08fdba | 6652 | } |
51ddb82e | 6653 | return NULL_TREE; |
8d08fdba MS |
6654 | |
6655 | case SAVE_EXPR: | |
6656 | /* This is a call to a constructor, hence it's never zero. */ | |
6657 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6658 | { | |
6659 | if (nonnull) | |
6660 | *nonnull = 1; | |
51ddb82e | 6661 | return TREE_TYPE (instance); |
8d08fdba | 6662 | } |
555551c2 | 6663 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba | 6664 | |
5be014d5 | 6665 | case POINTER_PLUS_EXPR: |
8d08fdba MS |
6666 | case PLUS_EXPR: |
6667 | case MINUS_EXPR: | |
394fd776 | 6668 | if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR) |
555551c2 | 6669 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6670 | if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST) |
6671 | /* Propagate nonnull. */ | |
555551c2 MM |
6672 | return RECUR (TREE_OPERAND (instance, 0)); |
6673 | ||
51ddb82e | 6674 | return NULL_TREE; |
8d08fdba | 6675 | |
63a906f0 | 6676 | CASE_CONVERT: |
555551c2 | 6677 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6678 | |
6679 | case ADDR_EXPR: | |
88f19756 | 6680 | instance = TREE_OPERAND (instance, 0); |
8d08fdba | 6681 | if (nonnull) |
88f19756 RH |
6682 | { |
6683 | /* Just because we see an ADDR_EXPR doesn't mean we're dealing | |
6684 | with a real object -- given &p->f, p can still be null. */ | |
6685 | tree t = get_base_address (instance); | |
6686 | /* ??? Probably should check DECL_WEAK here. */ | |
6687 | if (t && DECL_P (t)) | |
6688 | *nonnull = 1; | |
6689 | } | |
555551c2 | 6690 | return RECUR (instance); |
8d08fdba MS |
6691 | |
6692 | case COMPONENT_REF: | |
642124c6 RH |
6693 | /* If this component is really a base class reference, then the field |
6694 | itself isn't definitive. */ | |
6695 | if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1))) | |
555551c2 MM |
6696 | return RECUR (TREE_OPERAND (instance, 0)); |
6697 | return RECUR (TREE_OPERAND (instance, 1)); | |
8d08fdba | 6698 | |
8d08fdba MS |
6699 | case VAR_DECL: |
6700 | case FIELD_DECL: | |
6701 | if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE | |
9e1e64ec | 6702 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance)))) |
8d08fdba MS |
6703 | { |
6704 | if (nonnull) | |
6705 | *nonnull = 1; | |
51ddb82e | 6706 | return TREE_TYPE (TREE_TYPE (instance)); |
8d08fdba | 6707 | } |
e92cc029 | 6708 | /* fall through... */ |
8d08fdba MS |
6709 | case TARGET_EXPR: |
6710 | case PARM_DECL: | |
f63ab951 | 6711 | case RESULT_DECL: |
9e1e64ec | 6712 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance))) |
8d08fdba MS |
6713 | { |
6714 | if (nonnull) | |
6715 | *nonnull = 1; | |
51ddb82e | 6716 | return TREE_TYPE (instance); |
8d08fdba | 6717 | } |
394fd776 | 6718 | else if (instance == current_class_ptr) |
0cbd7506 MS |
6719 | { |
6720 | if (nonnull) | |
6721 | *nonnull = 1; | |
6722 | ||
f10eaa2d JM |
6723 | /* if we're in a ctor or dtor, we know our type. If |
6724 | current_class_ptr is set but we aren't in a function, we're in | |
6725 | an NSDMI (and therefore a constructor). */ | |
6726 | if (current_scope () != current_function_decl | |
6727 | || (DECL_LANG_SPECIFIC (current_function_decl) | |
6728 | && (DECL_CONSTRUCTOR_P (current_function_decl) | |
6729 | || DECL_DESTRUCTOR_P (current_function_decl)))) | |
0cbd7506 MS |
6730 | { |
6731 | if (cdtorp) | |
6732 | *cdtorp = 1; | |
6733 | return TREE_TYPE (TREE_TYPE (instance)); | |
6734 | } | |
6735 | } | |
394fd776 | 6736 | else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE) |
0cbd7506 | 6737 | { |
555551c2 | 6738 | /* We only need one hash table because it is always left empty. */ |
abcc192b JJ |
6739 | if (!fixed_type_or_null_ref_ht.is_created ()) |
6740 | fixed_type_or_null_ref_ht.create (37); | |
555551c2 | 6741 | |
0cbd7506 MS |
6742 | /* Reference variables should be references to objects. */ |
6743 | if (nonnull) | |
8d08fdba | 6744 | *nonnull = 1; |
c8094d83 | 6745 | |
555551c2 | 6746 | /* Enter the INSTANCE in a table to prevent recursion; a |
772f8889 MM |
6747 | variable's initializer may refer to the variable |
6748 | itself. */ | |
5a6ccc94 | 6749 | if (VAR_P (instance) |
772f8889 | 6750 | && DECL_INITIAL (instance) |
bae14a37 | 6751 | && !type_dependent_expression_p_push (DECL_INITIAL (instance)) |
abcc192b | 6752 | && !fixed_type_or_null_ref_ht.find (instance)) |
772f8889 MM |
6753 | { |
6754 | tree type; | |
703c8606 | 6755 | tree_node **slot; |
555551c2 | 6756 | |
abcc192b | 6757 | slot = fixed_type_or_null_ref_ht.find_slot (instance, INSERT); |
555551c2 MM |
6758 | *slot = instance; |
6759 | type = RECUR (DECL_INITIAL (instance)); | |
abcc192b | 6760 | fixed_type_or_null_ref_ht.remove_elt (instance); |
555551c2 | 6761 | |
772f8889 MM |
6762 | return type; |
6763 | } | |
8d08fdba | 6764 | } |
51ddb82e | 6765 | return NULL_TREE; |
8d08fdba MS |
6766 | |
6767 | default: | |
51ddb82e | 6768 | return NULL_TREE; |
8d08fdba | 6769 | } |
555551c2 | 6770 | #undef RECUR |
8d08fdba | 6771 | } |
51ddb82e | 6772 | |
838dfd8a | 6773 | /* Return nonzero if the dynamic type of INSTANCE is known, and |
338d90b8 NS |
6774 | equivalent to the static type. We also handle the case where |
6775 | INSTANCE is really a pointer. Return negative if this is a | |
6776 | ctor/dtor. There the dynamic type is known, but this might not be | |
6777 | the most derived base of the original object, and hence virtual | |
6778 | bases may not be layed out according to this type. | |
51ddb82e JM |
6779 | |
6780 | Used to determine whether the virtual function table is needed | |
6781 | or not. | |
6782 | ||
6783 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6784 | of our knowledge of its type. *NONNULL should be initialized |
6785 | before this function is called. */ | |
51ddb82e JM |
6786 | |
6787 | int | |
94edc4ab | 6788 | resolves_to_fixed_type_p (tree instance, int* nonnull) |
51ddb82e JM |
6789 | { |
6790 | tree t = TREE_TYPE (instance); | |
394fd776 | 6791 | int cdtorp = 0; |
4d3baecc JM |
6792 | tree fixed; |
6793 | ||
65f0c5b3 JM |
6794 | /* processing_template_decl can be false in a template if we're in |
6795 | fold_non_dependent_expr, but we still want to suppress this check. */ | |
e0e1b357 | 6796 | if (in_template_function ()) |
4d3baecc JM |
6797 | { |
6798 | /* In a template we only care about the type of the result. */ | |
6799 | if (nonnull) | |
6800 | *nonnull = true; | |
6801 | return true; | |
6802 | } | |
6803 | ||
6804 | fixed = fixed_type_or_null (instance, nonnull, &cdtorp); | |
51ddb82e JM |
6805 | if (fixed == NULL_TREE) |
6806 | return 0; | |
6807 | if (POINTER_TYPE_P (t)) | |
6808 | t = TREE_TYPE (t); | |
394fd776 NS |
6809 | if (!same_type_ignoring_top_level_qualifiers_p (t, fixed)) |
6810 | return 0; | |
6811 | return cdtorp ? -1 : 1; | |
51ddb82e JM |
6812 | } |
6813 | ||
8d08fdba MS |
6814 | \f |
6815 | void | |
94edc4ab | 6816 | init_class_processing (void) |
8d08fdba MS |
6817 | { |
6818 | current_class_depth = 0; | |
61a127b3 | 6819 | current_class_stack_size = 10; |
c8094d83 | 6820 | current_class_stack |
0ac1b889 | 6821 | = XNEWVEC (struct class_stack_node, current_class_stack_size); |
9771b263 | 6822 | vec_alloc (local_classes, 8); |
c5a35c3c | 6823 | sizeof_biggest_empty_class = size_zero_node; |
8d08fdba | 6824 | |
0e5921e8 ZW |
6825 | ridpointers[(int) RID_PUBLIC] = access_public_node; |
6826 | ridpointers[(int) RID_PRIVATE] = access_private_node; | |
6827 | ridpointers[(int) RID_PROTECTED] = access_protected_node; | |
8d08fdba MS |
6828 | } |
6829 | ||
39fb05d0 MM |
6830 | /* Restore the cached PREVIOUS_CLASS_LEVEL. */ |
6831 | ||
6832 | static void | |
6833 | restore_class_cache (void) | |
6834 | { | |
39fb05d0 | 6835 | tree type; |
39fb05d0 MM |
6836 | |
6837 | /* We are re-entering the same class we just left, so we don't | |
6838 | have to search the whole inheritance matrix to find all the | |
6839 | decls to bind again. Instead, we install the cached | |
6840 | class_shadowed list and walk through it binding names. */ | |
6841 | push_binding_level (previous_class_level); | |
6842 | class_binding_level = previous_class_level; | |
39fb05d0 | 6843 | /* Restore IDENTIFIER_TYPE_VALUE. */ |
c8094d83 MS |
6844 | for (type = class_binding_level->type_shadowed; |
6845 | type; | |
39fb05d0 MM |
6846 | type = TREE_CHAIN (type)) |
6847 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type)); | |
6848 | } | |
6849 | ||
a723baf1 MM |
6850 | /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as |
6851 | appropriate for TYPE. | |
8d08fdba | 6852 | |
8d08fdba MS |
6853 | So that we may avoid calls to lookup_name, we cache the _TYPE |
6854 | nodes of local TYPE_DECLs in the TREE_TYPE field of the name. | |
6855 | ||
6856 | For multiple inheritance, we perform a two-pass depth-first search | |
39fb05d0 | 6857 | of the type lattice. */ |
8d08fdba MS |
6858 | |
6859 | void | |
29370796 | 6860 | pushclass (tree type) |
8d08fdba | 6861 | { |
c888c93b MM |
6862 | class_stack_node_t csn; |
6863 | ||
0771d9d7 JM |
6864 | type = TYPE_MAIN_VARIANT (type); |
6865 | ||
61a127b3 | 6866 | /* Make sure there is enough room for the new entry on the stack. */ |
c8094d83 | 6867 | if (current_class_depth + 1 >= current_class_stack_size) |
8d08fdba | 6868 | { |
61a127b3 MM |
6869 | current_class_stack_size *= 2; |
6870 | current_class_stack | |
7767580e | 6871 | = XRESIZEVEC (struct class_stack_node, current_class_stack, |
3db45ab5 | 6872 | current_class_stack_size); |
8d08fdba MS |
6873 | } |
6874 | ||
61a127b3 | 6875 | /* Insert a new entry on the class stack. */ |
c888c93b MM |
6876 | csn = current_class_stack + current_class_depth; |
6877 | csn->name = current_class_name; | |
6878 | csn->type = current_class_type; | |
6879 | csn->access = current_access_specifier; | |
6880 | csn->names_used = 0; | |
6881 | csn->hidden = 0; | |
61a127b3 MM |
6882 | current_class_depth++; |
6883 | ||
6884 | /* Now set up the new type. */ | |
8d08fdba MS |
6885 | current_class_name = TYPE_NAME (type); |
6886 | if (TREE_CODE (current_class_name) == TYPE_DECL) | |
6887 | current_class_name = DECL_NAME (current_class_name); | |
6888 | current_class_type = type; | |
6889 | ||
61a127b3 MM |
6890 | /* By default, things in classes are private, while things in |
6891 | structures or unions are public. */ | |
c8094d83 MS |
6892 | current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type) |
6893 | ? access_private_node | |
61a127b3 MM |
6894 | : access_public_node); |
6895 | ||
89b578be MM |
6896 | if (previous_class_level |
6897 | && type != previous_class_level->this_entity | |
8d08fdba MS |
6898 | && current_class_depth == 1) |
6899 | { | |
6900 | /* Forcibly remove any old class remnants. */ | |
8f032717 | 6901 | invalidate_class_lookup_cache (); |
8d08fdba MS |
6902 | } |
6903 | ||
c8094d83 | 6904 | if (!previous_class_level |
89b578be MM |
6905 | || type != previous_class_level->this_entity |
6906 | || current_class_depth > 1) | |
90ea9897 | 6907 | pushlevel_class (); |
29370796 | 6908 | else |
39fb05d0 | 6909 | restore_class_cache (); |
8f032717 MM |
6910 | } |
6911 | ||
39fb05d0 MM |
6912 | /* When we exit a toplevel class scope, we save its binding level so |
6913 | that we can restore it quickly. Here, we've entered some other | |
6914 | class, so we must invalidate our cache. */ | |
8d08fdba | 6915 | |
8f032717 | 6916 | void |
94edc4ab | 6917 | invalidate_class_lookup_cache (void) |
8f032717 | 6918 | { |
89b578be | 6919 | previous_class_level = NULL; |
8d08fdba | 6920 | } |
c8094d83 | 6921 | |
8d08fdba | 6922 | /* Get out of the current class scope. If we were in a class scope |
b74a0560 | 6923 | previously, that is the one popped to. */ |
e92cc029 | 6924 | |
8d08fdba | 6925 | void |
94edc4ab | 6926 | popclass (void) |
8d08fdba | 6927 | { |
0771d9d7 | 6928 | poplevel_class (); |
8d08fdba MS |
6929 | |
6930 | current_class_depth--; | |
61a127b3 MM |
6931 | current_class_name = current_class_stack[current_class_depth].name; |
6932 | current_class_type = current_class_stack[current_class_depth].type; | |
6933 | current_access_specifier = current_class_stack[current_class_depth].access; | |
8f032717 MM |
6934 | if (current_class_stack[current_class_depth].names_used) |
6935 | splay_tree_delete (current_class_stack[current_class_depth].names_used); | |
8d08fdba MS |
6936 | } |
6937 | ||
c888c93b MM |
6938 | /* Mark the top of the class stack as hidden. */ |
6939 | ||
6940 | void | |
6941 | push_class_stack (void) | |
6942 | { | |
6943 | if (current_class_depth) | |
6944 | ++current_class_stack[current_class_depth - 1].hidden; | |
6945 | } | |
6946 | ||
6947 | /* Mark the top of the class stack as un-hidden. */ | |
6948 | ||
6949 | void | |
6950 | pop_class_stack (void) | |
6951 | { | |
6952 | if (current_class_depth) | |
6953 | --current_class_stack[current_class_depth - 1].hidden; | |
6954 | } | |
6955 | ||
fa6098f8 MM |
6956 | /* Returns 1 if the class type currently being defined is either T or |
6957 | a nested type of T. */ | |
b9082e8a | 6958 | |
fa6098f8 | 6959 | bool |
94edc4ab | 6960 | currently_open_class (tree t) |
b9082e8a JM |
6961 | { |
6962 | int i; | |
fa6098f8 | 6963 | |
1cb801bc JM |
6964 | if (!CLASS_TYPE_P (t)) |
6965 | return false; | |
6966 | ||
3e5e84be JM |
6967 | t = TYPE_MAIN_VARIANT (t); |
6968 | ||
fa6098f8 MM |
6969 | /* We start looking from 1 because entry 0 is from global scope, |
6970 | and has no type. */ | |
6971 | for (i = current_class_depth; i > 0; --i) | |
c888c93b | 6972 | { |
fa6098f8 MM |
6973 | tree c; |
6974 | if (i == current_class_depth) | |
6975 | c = current_class_type; | |
6976 | else | |
6977 | { | |
6978 | if (current_class_stack[i].hidden) | |
6979 | break; | |
6980 | c = current_class_stack[i].type; | |
6981 | } | |
6982 | if (!c) | |
6983 | continue; | |
6984 | if (same_type_p (c, t)) | |
6985 | return true; | |
c888c93b | 6986 | } |
fa6098f8 | 6987 | return false; |
b9082e8a JM |
6988 | } |
6989 | ||
70adf8a9 JM |
6990 | /* If either current_class_type or one of its enclosing classes are derived |
6991 | from T, return the appropriate type. Used to determine how we found | |
6992 | something via unqualified lookup. */ | |
6993 | ||
6994 | tree | |
94edc4ab | 6995 | currently_open_derived_class (tree t) |
70adf8a9 JM |
6996 | { |
6997 | int i; | |
6998 | ||
9bcb9aae | 6999 | /* The bases of a dependent type are unknown. */ |
1fb3244a MM |
7000 | if (dependent_type_p (t)) |
7001 | return NULL_TREE; | |
7002 | ||
c44e68a5 KL |
7003 | if (!current_class_type) |
7004 | return NULL_TREE; | |
7005 | ||
70adf8a9 JM |
7006 | if (DERIVED_FROM_P (t, current_class_type)) |
7007 | return current_class_type; | |
7008 | ||
7009 | for (i = current_class_depth - 1; i > 0; --i) | |
c888c93b MM |
7010 | { |
7011 | if (current_class_stack[i].hidden) | |
7012 | break; | |
7013 | if (DERIVED_FROM_P (t, current_class_stack[i].type)) | |
7014 | return current_class_stack[i].type; | |
7015 | } | |
70adf8a9 JM |
7016 | |
7017 | return NULL_TREE; | |
7018 | } | |
7019 | ||
a6846853 JM |
7020 | /* Returns the innermost class type which is not a lambda closure type. */ |
7021 | ||
7022 | tree | |
7023 | current_nonlambda_class_type (void) | |
7024 | { | |
7025 | int i; | |
7026 | ||
7027 | /* We start looking from 1 because entry 0 is from global scope, | |
7028 | and has no type. */ | |
7029 | for (i = current_class_depth; i > 0; --i) | |
7030 | { | |
7031 | tree c; | |
7032 | if (i == current_class_depth) | |
7033 | c = current_class_type; | |
7034 | else | |
7035 | { | |
7036 | if (current_class_stack[i].hidden) | |
7037 | break; | |
7038 | c = current_class_stack[i].type; | |
7039 | } | |
7040 | if (!c) | |
7041 | continue; | |
7042 | if (!LAMBDA_TYPE_P (c)) | |
7043 | return c; | |
7044 | } | |
7045 | return NULL_TREE; | |
7046 | } | |
7047 | ||
8d08fdba | 7048 | /* When entering a class scope, all enclosing class scopes' names with |
14d22dd6 MM |
7049 | static meaning (static variables, static functions, types and |
7050 | enumerators) have to be visible. This recursive function calls | |
7051 | pushclass for all enclosing class contexts until global or a local | |
7052 | scope is reached. TYPE is the enclosed class. */ | |
8d08fdba MS |
7053 | |
7054 | void | |
14d22dd6 | 7055 | push_nested_class (tree type) |
8d08fdba | 7056 | { |
b262d64c | 7057 | /* A namespace might be passed in error cases, like A::B:C. */ |
c8094d83 | 7058 | if (type == NULL_TREE |
56d0c6e3 | 7059 | || !CLASS_TYPE_P (type)) |
a28e3c7f | 7060 | return; |
c8094d83 | 7061 | |
56d0c6e3 | 7062 | push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type))); |
8d08fdba | 7063 | |
29370796 | 7064 | pushclass (type); |
8d08fdba MS |
7065 | } |
7066 | ||
a723baf1 | 7067 | /* Undoes a push_nested_class call. */ |
8d08fdba MS |
7068 | |
7069 | void | |
94edc4ab | 7070 | pop_nested_class (void) |
8d08fdba | 7071 | { |
d2e5ee5c | 7072 | tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type)); |
8d08fdba | 7073 | |
b74a0560 | 7074 | popclass (); |
6b400b21 | 7075 | if (context && CLASS_TYPE_P (context)) |
b74a0560 | 7076 | pop_nested_class (); |
8d08fdba MS |
7077 | } |
7078 | ||
46ccf50a JM |
7079 | /* Returns the number of extern "LANG" blocks we are nested within. */ |
7080 | ||
7081 | int | |
94edc4ab | 7082 | current_lang_depth (void) |
46ccf50a | 7083 | { |
9771b263 | 7084 | return vec_safe_length (current_lang_base); |
46ccf50a JM |
7085 | } |
7086 | ||
8d08fdba MS |
7087 | /* Set global variables CURRENT_LANG_NAME to appropriate value |
7088 | so that behavior of name-mangling machinery is correct. */ | |
7089 | ||
7090 | void | |
94edc4ab | 7091 | push_lang_context (tree name) |
8d08fdba | 7092 | { |
9771b263 | 7093 | vec_safe_push (current_lang_base, current_lang_name); |
8d08fdba | 7094 | |
e229f2cd | 7095 | if (name == lang_name_cplusplus) |
8d08fdba | 7096 | { |
8d08fdba MS |
7097 | current_lang_name = name; |
7098 | } | |
e229f2cd PB |
7099 | else if (name == lang_name_java) |
7100 | { | |
e229f2cd PB |
7101 | current_lang_name = name; |
7102 | /* DECL_IGNORED_P is initially set for these types, to avoid clutter. | |
7103 | (See record_builtin_java_type in decl.c.) However, that causes | |
7104 | incorrect debug entries if these types are actually used. | |
00a17e31 | 7105 | So we re-enable debug output after extern "Java". */ |
e3cd9945 APB |
7106 | DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0; |
7107 | DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0; | |
7108 | DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0; | |
7109 | DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0; | |
7110 | DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0; | |
7111 | DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0; | |
7112 | DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0; | |
7113 | DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0; | |
e229f2cd | 7114 | } |
8d08fdba MS |
7115 | else if (name == lang_name_c) |
7116 | { | |
8d08fdba MS |
7117 | current_lang_name = name; |
7118 | } | |
7119 | else | |
9e637a26 | 7120 | error ("language string %<\"%E\"%> not recognized", name); |
8d08fdba | 7121 | } |
c8094d83 | 7122 | |
8d08fdba | 7123 | /* Get out of the current language scope. */ |
e92cc029 | 7124 | |
8d08fdba | 7125 | void |
94edc4ab | 7126 | pop_lang_context (void) |
8d08fdba | 7127 | { |
9771b263 | 7128 | current_lang_name = current_lang_base->pop (); |
8d08fdba | 7129 | } |
8d08fdba MS |
7130 | \f |
7131 | /* Type instantiation routines. */ | |
7132 | ||
104bf76a MM |
7133 | /* Given an OVERLOAD and a TARGET_TYPE, return the function that |
7134 | matches the TARGET_TYPE. If there is no satisfactory match, return | |
eff3a276 MM |
7135 | error_mark_node, and issue an error & warning messages under |
7136 | control of FLAGS. Permit pointers to member function if FLAGS | |
7137 | permits. If TEMPLATE_ONLY, the name of the overloaded function was | |
7138 | a template-id, and EXPLICIT_TARGS are the explicitly provided | |
248e1b22 MM |
7139 | template arguments. |
7140 | ||
7141 | If OVERLOAD is for one or more member functions, then ACCESS_PATH | |
7142 | is the base path used to reference those member functions. If | |
5e7b9f60 JM |
7143 | the address is resolved to a member function, access checks will be |
7144 | performed and errors issued if appropriate. */ | |
104bf76a | 7145 | |
2c73f9f5 | 7146 | static tree |
c8094d83 | 7147 | resolve_address_of_overloaded_function (tree target_type, |
94edc4ab | 7148 | tree overload, |
92af500d NS |
7149 | tsubst_flags_t flags, |
7150 | bool template_only, | |
eff3a276 MM |
7151 | tree explicit_targs, |
7152 | tree access_path) | |
2c73f9f5 | 7153 | { |
104bf76a | 7154 | /* Here's what the standard says: |
c8094d83 | 7155 | |
104bf76a MM |
7156 | [over.over] |
7157 | ||
7158 | If the name is a function template, template argument deduction | |
7159 | is done, and if the argument deduction succeeds, the deduced | |
7160 | arguments are used to generate a single template function, which | |
7161 | is added to the set of overloaded functions considered. | |
7162 | ||
7163 | Non-member functions and static member functions match targets of | |
7164 | type "pointer-to-function" or "reference-to-function." Nonstatic | |
7165 | member functions match targets of type "pointer-to-member | |
7166 | function;" the function type of the pointer to member is used to | |
7167 | select the member function from the set of overloaded member | |
7168 | functions. If a nonstatic member function is selected, the | |
7169 | reference to the overloaded function name is required to have the | |
7170 | form of a pointer to member as described in 5.3.1. | |
7171 | ||
7172 | If more than one function is selected, any template functions in | |
7173 | the set are eliminated if the set also contains a non-template | |
7174 | function, and any given template function is eliminated if the | |
7175 | set contains a second template function that is more specialized | |
7176 | than the first according to the partial ordering rules 14.5.5.2. | |
7177 | After such eliminations, if any, there shall remain exactly one | |
7178 | selected function. */ | |
7179 | ||
7180 | int is_ptrmem = 0; | |
104bf76a MM |
7181 | /* We store the matches in a TREE_LIST rooted here. The functions |
7182 | are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy | |
7183 | interoperability with most_specialized_instantiation. */ | |
7184 | tree matches = NULL_TREE; | |
50714e79 | 7185 | tree fn; |
7bead48f | 7186 | tree target_fn_type; |
104bf76a | 7187 | |
d8f8dca1 MM |
7188 | /* By the time we get here, we should be seeing only real |
7189 | pointer-to-member types, not the internal POINTER_TYPE to | |
7190 | METHOD_TYPE representation. */ | |
50e10fa8 | 7191 | gcc_assert (!TYPE_PTR_P (target_type) |
50bc768d | 7192 | || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE); |
104bf76a | 7193 | |
50bc768d | 7194 | gcc_assert (is_overloaded_fn (overload)); |
c8094d83 | 7195 | |
104bf76a | 7196 | /* Check that the TARGET_TYPE is reasonable. */ |
6721db5d JM |
7197 | if (TYPE_PTRFN_P (target_type) |
7198 | || TYPE_REFFN_P (target_type)) | |
381ddaa6 | 7199 | /* This is OK. */; |
104bf76a MM |
7200 | else if (TYPE_PTRMEMFUNC_P (target_type)) |
7201 | /* This is OK, too. */ | |
7202 | is_ptrmem = 1; | |
7203 | else if (TREE_CODE (target_type) == FUNCTION_TYPE) | |
db80e34e JJ |
7204 | /* This is OK, too. This comes from a conversion to reference |
7205 | type. */ | |
7206 | target_type = build_reference_type (target_type); | |
c8094d83 | 7207 | else |
104bf76a | 7208 | { |
92af500d | 7209 | if (flags & tf_error) |
c4f73174 | 7210 | error ("cannot resolve overloaded function %qD based on" |
0cbd7506 MS |
7211 | " conversion to type %qT", |
7212 | DECL_NAME (OVL_FUNCTION (overload)), target_type); | |
104bf76a MM |
7213 | return error_mark_node; |
7214 | } | |
c8094d83 | 7215 | |
7bead48f JM |
7216 | /* Non-member functions and static member functions match targets of type |
7217 | "pointer-to-function" or "reference-to-function." Nonstatic member | |
7218 | functions match targets of type "pointer-to-member-function;" the | |
7219 | function type of the pointer to member is used to select the member | |
7220 | function from the set of overloaded member functions. | |
7221 | ||
7222 | So figure out the FUNCTION_TYPE that we want to match against. */ | |
7223 | target_fn_type = static_fn_type (target_type); | |
7224 | ||
104bf76a MM |
7225 | /* If we can find a non-template function that matches, we can just |
7226 | use it. There's no point in generating template instantiations | |
7227 | if we're just going to throw them out anyhow. But, of course, we | |
7228 | can only do this when we don't *need* a template function. */ | |
7229 | if (!template_only) | |
7230 | { | |
7231 | tree fns; | |
7232 | ||
a723baf1 | 7233 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 7234 | { |
a723baf1 | 7235 | tree fn = OVL_CURRENT (fns); |
2c73f9f5 | 7236 | |
104bf76a MM |
7237 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
7238 | /* We're not looking for templates just yet. */ | |
7239 | continue; | |
7240 | ||
7241 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7242 | != is_ptrmem) | |
7243 | /* We're looking for a non-static member, and this isn't | |
7244 | one, or vice versa. */ | |
7245 | continue; | |
34ff2673 | 7246 | |
d63d5d0c ILT |
7247 | /* Ignore functions which haven't been explicitly |
7248 | declared. */ | |
34ff2673 RS |
7249 | if (DECL_ANTICIPATED (fn)) |
7250 | continue; | |
7251 | ||
104bf76a | 7252 | /* See if there's a match. */ |
7bead48f | 7253 | if (same_type_p (target_fn_type, static_fn_type (fn))) |
e1b3e07d | 7254 | matches = tree_cons (fn, NULL_TREE, matches); |
104bf76a MM |
7255 | } |
7256 | } | |
7257 | ||
7258 | /* Now, if we've already got a match (or matches), there's no need | |
7259 | to proceed to the template functions. But, if we don't have a | |
7260 | match we need to look at them, too. */ | |
c8094d83 | 7261 | if (!matches) |
2c73f9f5 | 7262 | { |
104bf76a | 7263 | tree target_arg_types; |
8d3631f8 | 7264 | tree target_ret_type; |
104bf76a | 7265 | tree fns; |
c166b898 ILT |
7266 | tree *args; |
7267 | unsigned int nargs, ia; | |
7268 | tree arg; | |
104bf76a | 7269 | |
4393e105 | 7270 | target_arg_types = TYPE_ARG_TYPES (target_fn_type); |
8d3631f8 | 7271 | target_ret_type = TREE_TYPE (target_fn_type); |
e5214479 | 7272 | |
c166b898 ILT |
7273 | nargs = list_length (target_arg_types); |
7274 | args = XALLOCAVEC (tree, nargs); | |
7275 | for (arg = target_arg_types, ia = 0; | |
7276 | arg != NULL_TREE && arg != void_list_node; | |
7277 | arg = TREE_CHAIN (arg), ++ia) | |
7278 | args[ia] = TREE_VALUE (arg); | |
7279 | nargs = ia; | |
7280 | ||
a723baf1 | 7281 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 7282 | { |
a723baf1 | 7283 | tree fn = OVL_CURRENT (fns); |
104bf76a | 7284 | tree instantiation; |
104bf76a MM |
7285 | tree targs; |
7286 | ||
7287 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
7288 | /* We're only looking for templates. */ | |
7289 | continue; | |
7290 | ||
7291 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7292 | != is_ptrmem) | |
4393e105 | 7293 | /* We're not looking for a non-static member, and this is |
104bf76a MM |
7294 | one, or vice versa. */ |
7295 | continue; | |
7296 | ||
79d8a272 JM |
7297 | tree ret = target_ret_type; |
7298 | ||
7299 | /* If the template has a deduced return type, don't expose it to | |
7300 | template argument deduction. */ | |
7301 | if (undeduced_auto_decl (fn)) | |
7302 | ret = NULL_TREE; | |
7303 | ||
104bf76a | 7304 | /* Try to do argument deduction. */ |
f31c0a32 | 7305 | targs = make_tree_vec (DECL_NTPARMS (fn)); |
cd057e3a | 7306 | instantiation = fn_type_unification (fn, explicit_targs, targs, args, |
79d8a272 | 7307 | nargs, ret, |
cd057e3a | 7308 | DEDUCE_EXACT, LOOKUP_NORMAL, |
2b24855e | 7309 | false, false); |
104bf76a MM |
7310 | if (instantiation == error_mark_node) |
7311 | /* Instantiation failed. */ | |
7312 | continue; | |
7313 | ||
79d8a272 JM |
7314 | /* And now force instantiation to do return type deduction. */ |
7315 | if (undeduced_auto_decl (instantiation)) | |
7316 | { | |
7317 | ++function_depth; | |
7318 | instantiate_decl (instantiation, /*defer*/false, /*class*/false); | |
7319 | --function_depth; | |
7320 | ||
7321 | require_deduced_type (instantiation); | |
7322 | } | |
7323 | ||
104bf76a | 7324 | /* See if there's a match. */ |
7bead48f | 7325 | if (same_type_p (target_fn_type, static_fn_type (instantiation))) |
e1b3e07d | 7326 | matches = tree_cons (instantiation, fn, matches); |
79d8a272 JM |
7327 | |
7328 | ggc_free (targs); | |
104bf76a MM |
7329 | } |
7330 | ||
7331 | /* Now, remove all but the most specialized of the matches. */ | |
7332 | if (matches) | |
7333 | { | |
e5214479 | 7334 | tree match = most_specialized_instantiation (matches); |
104bf76a MM |
7335 | |
7336 | if (match != error_mark_node) | |
3db45ab5 MS |
7337 | matches = tree_cons (TREE_PURPOSE (match), |
7338 | NULL_TREE, | |
7ca383e6 | 7339 | NULL_TREE); |
104bf76a MM |
7340 | } |
7341 | } | |
7342 | ||
7343 | /* Now we should have exactly one function in MATCHES. */ | |
7344 | if (matches == NULL_TREE) | |
7345 | { | |
7346 | /* There were *no* matches. */ | |
92af500d | 7347 | if (flags & tf_error) |
104bf76a | 7348 | { |
0cbd7506 | 7349 | error ("no matches converting function %qD to type %q#T", |
95e20768 | 7350 | DECL_NAME (OVL_CURRENT (overload)), |
0cbd7506 | 7351 | target_type); |
6b9b6b15 | 7352 | |
c224bdc1 | 7353 | print_candidates (overload); |
104bf76a MM |
7354 | } |
7355 | return error_mark_node; | |
2c73f9f5 | 7356 | } |
104bf76a MM |
7357 | else if (TREE_CHAIN (matches)) |
7358 | { | |
e04c614e JM |
7359 | /* There were too many matches. First check if they're all |
7360 | the same function. */ | |
3649b9b7 | 7361 | tree match = NULL_TREE; |
104bf76a | 7362 | |
e04c614e | 7363 | fn = TREE_PURPOSE (matches); |
3649b9b7 | 7364 | |
beb42d20 ST |
7365 | /* For multi-versioned functions, more than one match is just fine and |
7366 | decls_match will return false as they are different. */ | |
7367 | for (match = TREE_CHAIN (matches); match; match = TREE_CHAIN (match)) | |
7368 | if (!decls_match (fn, TREE_PURPOSE (match)) | |
7369 | && !targetm.target_option.function_versions | |
7370 | (fn, TREE_PURPOSE (match))) | |
7371 | break; | |
e04c614e JM |
7372 | |
7373 | if (match) | |
104bf76a | 7374 | { |
e04c614e JM |
7375 | if (flags & tf_error) |
7376 | { | |
7377 | error ("converting overloaded function %qD to type %q#T is ambiguous", | |
7378 | DECL_NAME (OVL_FUNCTION (overload)), | |
7379 | target_type); | |
104bf76a | 7380 | |
e04c614e JM |
7381 | /* Since print_candidates expects the functions in the |
7382 | TREE_VALUE slot, we flip them here. */ | |
7383 | for (match = matches; match; match = TREE_CHAIN (match)) | |
7384 | TREE_VALUE (match) = TREE_PURPOSE (match); | |
104bf76a | 7385 | |
e04c614e JM |
7386 | print_candidates (matches); |
7387 | } | |
104bf76a | 7388 | |
e04c614e | 7389 | return error_mark_node; |
104bf76a | 7390 | } |
104bf76a MM |
7391 | } |
7392 | ||
50714e79 MM |
7393 | /* Good, exactly one match. Now, convert it to the correct type. */ |
7394 | fn = TREE_PURPOSE (matches); | |
7395 | ||
b1ce3eb2 | 7396 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
92af500d | 7397 | && !(flags & tf_ptrmem_ok) && !flag_ms_extensions) |
19420d00 | 7398 | { |
b1ce3eb2 | 7399 | static int explained; |
c8094d83 | 7400 | |
92af500d | 7401 | if (!(flags & tf_error)) |
0cbd7506 | 7402 | return error_mark_node; |
19420d00 | 7403 | |
cbe5f3b3 | 7404 | permerror (input_location, "assuming pointer to member %qD", fn); |
b1ce3eb2 | 7405 | if (!explained) |
0cbd7506 | 7406 | { |
1f5b3869 | 7407 | inform (input_location, "(a pointer to member can only be formed with %<&%E%>)", fn); |
0cbd7506 MS |
7408 | explained = 1; |
7409 | } | |
19420d00 | 7410 | } |
84583208 | 7411 | |
3649b9b7 ST |
7412 | /* If a pointer to a function that is multi-versioned is requested, the |
7413 | pointer to the dispatcher function is returned instead. This works | |
7414 | well because indirectly calling the function will dispatch the right | |
7415 | function version at run-time. */ | |
7416 | if (DECL_FUNCTION_VERSIONED (fn)) | |
7417 | { | |
beb42d20 ST |
7418 | fn = get_function_version_dispatcher (fn); |
7419 | if (fn == NULL) | |
7420 | return error_mark_node; | |
3649b9b7 ST |
7421 | /* Mark all the versions corresponding to the dispatcher as used. */ |
7422 | if (!(flags & tf_conv)) | |
7423 | mark_versions_used (fn); | |
7424 | } | |
7425 | ||
84583208 MM |
7426 | /* If we're doing overload resolution purely for the purpose of |
7427 | determining conversion sequences, we should not consider the | |
7428 | function used. If this conversion sequence is selected, the | |
7429 | function will be marked as used at this point. */ | |
7430 | if (!(flags & tf_conv)) | |
eff3a276 | 7431 | { |
4ad610c9 JM |
7432 | /* Make =delete work with SFINAE. */ |
7433 | if (DECL_DELETED_FN (fn) && !(flags & tf_error)) | |
7434 | return error_mark_node; | |
7435 | ||
eff3a276 | 7436 | mark_used (fn); |
248e1b22 MM |
7437 | } |
7438 | ||
7439 | /* We could not check access to member functions when this | |
7440 | expression was originally created since we did not know at that | |
7441 | time to which function the expression referred. */ | |
5e7b9f60 | 7442 | if (DECL_FUNCTION_MEMBER_P (fn)) |
248e1b22 MM |
7443 | { |
7444 | gcc_assert (access_path); | |
5e7b9f60 | 7445 | perform_or_defer_access_check (access_path, fn, fn, flags); |
eff3a276 | 7446 | } |
a6ecf8b6 | 7447 | |
50714e79 | 7448 | if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type)) |
93c0e0bb | 7449 | return cp_build_addr_expr (fn, flags); |
50714e79 MM |
7450 | else |
7451 | { | |
5ade1ed2 | 7452 | /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op |
50714e79 MM |
7453 | will mark the function as addressed, but here we must do it |
7454 | explicitly. */ | |
dffd7eb6 | 7455 | cxx_mark_addressable (fn); |
50714e79 MM |
7456 | |
7457 | return fn; | |
7458 | } | |
2c73f9f5 ML |
7459 | } |
7460 | ||
ec255269 MS |
7461 | /* This function will instantiate the type of the expression given in |
7462 | RHS to match the type of LHSTYPE. If errors exist, then return | |
92af500d | 7463 | error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then |
5e76004e NS |
7464 | we complain on errors. If we are not complaining, never modify rhs, |
7465 | as overload resolution wants to try many possible instantiations, in | |
7466 | the hope that at least one will work. | |
c8094d83 | 7467 | |
e6e174e5 JM |
7468 | For non-recursive calls, LHSTYPE should be a function, pointer to |
7469 | function, or a pointer to member function. */ | |
e92cc029 | 7470 | |
8d08fdba | 7471 | tree |
94edc4ab | 7472 | instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags) |
8d08fdba | 7473 | { |
92af500d | 7474 | tsubst_flags_t flags_in = flags; |
eff3a276 | 7475 | tree access_path = NULL_TREE; |
c8094d83 | 7476 | |
c2ea3a40 | 7477 | flags &= ~tf_ptrmem_ok; |
c8094d83 | 7478 | |
fbfc8363 | 7479 | if (lhstype == unknown_type_node) |
8d08fdba | 7480 | { |
92af500d | 7481 | if (flags & tf_error) |
8251199e | 7482 | error ("not enough type information"); |
8d08fdba MS |
7483 | return error_mark_node; |
7484 | } | |
7485 | ||
7486 | if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs))) | |
abff8e06 | 7487 | { |
6721db5d JM |
7488 | tree fntype = non_reference (lhstype); |
7489 | if (same_type_p (fntype, TREE_TYPE (rhs))) | |
abff8e06 | 7490 | return rhs; |
c8094d83 | 7491 | if (flag_ms_extensions |
6721db5d | 7492 | && TYPE_PTRMEMFUNC_P (fntype) |
a723baf1 MM |
7493 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs))) |
7494 | /* Microsoft allows `A::f' to be resolved to a | |
7495 | pointer-to-member. */ | |
7496 | ; | |
7497 | else | |
7498 | { | |
92af500d | 7499 | if (flags & tf_error) |
c3c1f2b7 | 7500 | error ("cannot convert %qE from type %qT to type %qT", |
6721db5d | 7501 | rhs, TREE_TYPE (rhs), fntype); |
a723baf1 MM |
7502 | return error_mark_node; |
7503 | } | |
abff8e06 | 7504 | } |
8d08fdba | 7505 | |
c5ce25ce | 7506 | if (BASELINK_P (rhs)) |
eff3a276 MM |
7507 | { |
7508 | access_path = BASELINK_ACCESS_BINFO (rhs); | |
7509 | rhs = BASELINK_FUNCTIONS (rhs); | |
7510 | } | |
50ad9642 | 7511 | |
5ae9ba3e MM |
7512 | /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot |
7513 | deduce any type information. */ | |
7514 | if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR) | |
7515 | { | |
7516 | if (flags & tf_error) | |
7517 | error ("not enough type information"); | |
7518 | return error_mark_node; | |
7519 | } | |
7520 | ||
eff3a276 MM |
7521 | /* There only a few kinds of expressions that may have a type |
7522 | dependent on overload resolution. */ | |
7523 | gcc_assert (TREE_CODE (rhs) == ADDR_EXPR | |
7524 | || TREE_CODE (rhs) == COMPONENT_REF | |
95e20768 NS |
7525 | || really_overloaded_fn (rhs) |
7526 | || (flag_ms_extensions && TREE_CODE (rhs) == FUNCTION_DECL)); | |
c73964b2 | 7527 | |
8d08fdba MS |
7528 | /* This should really only be used when attempting to distinguish |
7529 | what sort of a pointer to function we have. For now, any | |
7530 | arithmetic operation which is not supported on pointers | |
7531 | is rejected as an error. */ | |
7532 | ||
7533 | switch (TREE_CODE (rhs)) | |
7534 | { | |
8d08fdba | 7535 | case COMPONENT_REF: |
92af500d | 7536 | { |
5ae9ba3e | 7537 | tree member = TREE_OPERAND (rhs, 1); |
92af500d | 7538 | |
5ae9ba3e MM |
7539 | member = instantiate_type (lhstype, member, flags); |
7540 | if (member != error_mark_node | |
92af500d | 7541 | && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0))) |
04c06002 | 7542 | /* Do not lose object's side effects. */ |
5ae9ba3e MM |
7543 | return build2 (COMPOUND_EXPR, TREE_TYPE (member), |
7544 | TREE_OPERAND (rhs, 0), member); | |
7545 | return member; | |
92af500d | 7546 | } |
8d08fdba | 7547 | |
2a238a97 | 7548 | case OFFSET_REF: |
05e0b2f4 JM |
7549 | rhs = TREE_OPERAND (rhs, 1); |
7550 | if (BASELINK_P (rhs)) | |
eff3a276 | 7551 | return instantiate_type (lhstype, rhs, flags_in); |
05e0b2f4 | 7552 | |
2a238a97 MM |
7553 | /* This can happen if we are forming a pointer-to-member for a |
7554 | member template. */ | |
50bc768d | 7555 | gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR); |
05e0b2f4 | 7556 | |
2a238a97 | 7557 | /* Fall through. */ |
874503bc | 7558 | |
386b8a85 | 7559 | case TEMPLATE_ID_EXPR: |
2bdb0643 JM |
7560 | { |
7561 | tree fns = TREE_OPERAND (rhs, 0); | |
7562 | tree args = TREE_OPERAND (rhs, 1); | |
7563 | ||
19420d00 | 7564 | return |
92af500d NS |
7565 | resolve_address_of_overloaded_function (lhstype, fns, flags_in, |
7566 | /*template_only=*/true, | |
eff3a276 | 7567 | args, access_path); |
2bdb0643 | 7568 | } |
386b8a85 | 7569 | |
2c73f9f5 | 7570 | case OVERLOAD: |
a723baf1 | 7571 | case FUNCTION_DECL: |
c8094d83 | 7572 | return |
92af500d NS |
7573 | resolve_address_of_overloaded_function (lhstype, rhs, flags_in, |
7574 | /*template_only=*/false, | |
eff3a276 MM |
7575 | /*explicit_targs=*/NULL_TREE, |
7576 | access_path); | |
2c73f9f5 | 7577 | |
ca36f057 | 7578 | case ADDR_EXPR: |
19420d00 NS |
7579 | { |
7580 | if (PTRMEM_OK_P (rhs)) | |
0cbd7506 | 7581 | flags |= tf_ptrmem_ok; |
c8094d83 | 7582 | |
ca36f057 | 7583 | return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags); |
19420d00 | 7584 | } |
ca36f057 MM |
7585 | |
7586 | case ERROR_MARK: | |
7587 | return error_mark_node; | |
7588 | ||
7589 | default: | |
8dc2b103 | 7590 | gcc_unreachable (); |
ca36f057 | 7591 | } |
8dc2b103 | 7592 | return error_mark_node; |
ca36f057 MM |
7593 | } |
7594 | \f | |
7595 | /* Return the name of the virtual function pointer field | |
7596 | (as an IDENTIFIER_NODE) for the given TYPE. Note that | |
7597 | this may have to look back through base types to find the | |
7598 | ultimate field name. (For single inheritance, these could | |
7599 | all be the same name. Who knows for multiple inheritance). */ | |
7600 | ||
7601 | static tree | |
94edc4ab | 7602 | get_vfield_name (tree type) |
ca36f057 | 7603 | { |
37a247a0 | 7604 | tree binfo, base_binfo; |
ca36f057 MM |
7605 | char *buf; |
7606 | ||
37a247a0 | 7607 | for (binfo = TYPE_BINFO (type); |
fa743e8c | 7608 | BINFO_N_BASE_BINFOS (binfo); |
37a247a0 NS |
7609 | binfo = base_binfo) |
7610 | { | |
7611 | base_binfo = BINFO_BASE_BINFO (binfo, 0); | |
ca36f057 | 7612 | |
37a247a0 NS |
7613 | if (BINFO_VIRTUAL_P (base_binfo) |
7614 | || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo))) | |
7615 | break; | |
7616 | } | |
c8094d83 | 7617 | |
ca36f057 | 7618 | type = BINFO_TYPE (binfo); |
67f5655f | 7619 | buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT) |
3db45ab5 | 7620 | + TYPE_NAME_LENGTH (type) + 2); |
ea122333 JM |
7621 | sprintf (buf, VFIELD_NAME_FORMAT, |
7622 | IDENTIFIER_POINTER (constructor_name (type))); | |
ca36f057 MM |
7623 | return get_identifier (buf); |
7624 | } | |
7625 | ||
7626 | void | |
94edc4ab | 7627 | print_class_statistics (void) |
ca36f057 | 7628 | { |
7aa6d18a SB |
7629 | if (! GATHER_STATISTICS) |
7630 | return; | |
7631 | ||
ca36f057 MM |
7632 | fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness); |
7633 | fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs); | |
ca36f057 MM |
7634 | if (n_vtables) |
7635 | { | |
7636 | fprintf (stderr, "vtables = %d; vtable searches = %d\n", | |
7637 | n_vtables, n_vtable_searches); | |
7638 | fprintf (stderr, "vtable entries = %d; vtable elems = %d\n", | |
7639 | n_vtable_entries, n_vtable_elems); | |
7640 | } | |
ca36f057 MM |
7641 | } |
7642 | ||
7643 | /* Build a dummy reference to ourselves so Derived::Base (and A::A) works, | |
7644 | according to [class]: | |
0cbd7506 | 7645 | The class-name is also inserted |
ca36f057 MM |
7646 | into the scope of the class itself. For purposes of access checking, |
7647 | the inserted class name is treated as if it were a public member name. */ | |
7648 | ||
7649 | void | |
94edc4ab | 7650 | build_self_reference (void) |
ca36f057 MM |
7651 | { |
7652 | tree name = constructor_name (current_class_type); | |
7653 | tree value = build_lang_decl (TYPE_DECL, name, current_class_type); | |
7654 | tree saved_cas; | |
7655 | ||
7656 | DECL_NONLOCAL (value) = 1; | |
7657 | DECL_CONTEXT (value) = current_class_type; | |
7658 | DECL_ARTIFICIAL (value) = 1; | |
a3d87771 | 7659 | SET_DECL_SELF_REFERENCE_P (value); |
6f1abb06 | 7660 | set_underlying_type (value); |
ca36f057 MM |
7661 | |
7662 | if (processing_template_decl) | |
7663 | value = push_template_decl (value); | |
7664 | ||
7665 | saved_cas = current_access_specifier; | |
7666 | current_access_specifier = access_public_node; | |
7667 | finish_member_declaration (value); | |
7668 | current_access_specifier = saved_cas; | |
7669 | } | |
7670 | ||
7671 | /* Returns 1 if TYPE contains only padding bytes. */ | |
7672 | ||
7673 | int | |
94edc4ab | 7674 | is_empty_class (tree type) |
ca36f057 | 7675 | { |
ca36f057 MM |
7676 | if (type == error_mark_node) |
7677 | return 0; | |
7678 | ||
2588c9e9 | 7679 | if (! CLASS_TYPE_P (type)) |
ca36f057 MM |
7680 | return 0; |
7681 | ||
58731fd1 MM |
7682 | /* In G++ 3.2, whether or not a class was empty was determined by |
7683 | looking at its size. */ | |
7684 | if (abi_version_at_least (2)) | |
7685 | return CLASSTYPE_EMPTY_P (type); | |
7686 | else | |
7687 | return integer_zerop (CLASSTYPE_SIZE (type)); | |
ca36f057 MM |
7688 | } |
7689 | ||
956d9305 MM |
7690 | /* Returns true if TYPE contains an empty class. */ |
7691 | ||
7692 | static bool | |
7693 | contains_empty_class_p (tree type) | |
7694 | { | |
7695 | if (is_empty_class (type)) | |
7696 | return true; | |
7697 | if (CLASS_TYPE_P (type)) | |
7698 | { | |
7699 | tree field; | |
fa743e8c NS |
7700 | tree binfo; |
7701 | tree base_binfo; | |
956d9305 MM |
7702 | int i; |
7703 | ||
fa743e8c NS |
7704 | for (binfo = TYPE_BINFO (type), i = 0; |
7705 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7706 | if (contains_empty_class_p (BINFO_TYPE (base_binfo))) | |
956d9305 MM |
7707 | return true; |
7708 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
17bbb839 MM |
7709 | if (TREE_CODE (field) == FIELD_DECL |
7710 | && !DECL_ARTIFICIAL (field) | |
7711 | && is_empty_class (TREE_TYPE (field))) | |
956d9305 MM |
7712 | return true; |
7713 | } | |
7714 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7715 | return contains_empty_class_p (TREE_TYPE (type)); | |
7716 | return false; | |
7717 | } | |
7718 | ||
2588c9e9 | 7719 | /* Returns true if TYPE contains no actual data, just various |
0930cc0e | 7720 | possible combinations of empty classes and possibly a vptr. */ |
2588c9e9 JM |
7721 | |
7722 | bool | |
7723 | is_really_empty_class (tree type) | |
7724 | { | |
2588c9e9 JM |
7725 | if (CLASS_TYPE_P (type)) |
7726 | { | |
7727 | tree field; | |
7728 | tree binfo; | |
7729 | tree base_binfo; | |
7730 | int i; | |
7731 | ||
0930cc0e JM |
7732 | /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid |
7733 | out, but we'd like to be able to check this before then. */ | |
7734 | if (COMPLETE_TYPE_P (type) && is_empty_class (type)) | |
7735 | return true; | |
7736 | ||
2588c9e9 JM |
7737 | for (binfo = TYPE_BINFO (type), i = 0; |
7738 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7739 | if (!is_really_empty_class (BINFO_TYPE (base_binfo))) | |
7740 | return false; | |
910ad8de | 7741 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
2588c9e9 JM |
7742 | if (TREE_CODE (field) == FIELD_DECL |
7743 | && !DECL_ARTIFICIAL (field) | |
7744 | && !is_really_empty_class (TREE_TYPE (field))) | |
7745 | return false; | |
7746 | return true; | |
7747 | } | |
7748 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7749 | return is_really_empty_class (TREE_TYPE (type)); | |
7750 | return false; | |
7751 | } | |
7752 | ||
ca36f057 MM |
7753 | /* Note that NAME was looked up while the current class was being |
7754 | defined and that the result of that lookup was DECL. */ | |
7755 | ||
7756 | void | |
94edc4ab | 7757 | maybe_note_name_used_in_class (tree name, tree decl) |
ca36f057 MM |
7758 | { |
7759 | splay_tree names_used; | |
7760 | ||
7761 | /* If we're not defining a class, there's nothing to do. */ | |
39fb05d0 | 7762 | if (!(innermost_scope_kind() == sk_class |
d5f4eddd JM |
7763 | && TYPE_BEING_DEFINED (current_class_type) |
7764 | && !LAMBDA_TYPE_P (current_class_type))) | |
ca36f057 | 7765 | return; |
c8094d83 | 7766 | |
ca36f057 MM |
7767 | /* If there's already a binding for this NAME, then we don't have |
7768 | anything to worry about. */ | |
c8094d83 | 7769 | if (lookup_member (current_class_type, name, |
db422ace | 7770 | /*protect=*/0, /*want_type=*/false, tf_warning_or_error)) |
ca36f057 MM |
7771 | return; |
7772 | ||
7773 | if (!current_class_stack[current_class_depth - 1].names_used) | |
7774 | current_class_stack[current_class_depth - 1].names_used | |
7775 | = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
7776 | names_used = current_class_stack[current_class_depth - 1].names_used; | |
7777 | ||
7778 | splay_tree_insert (names_used, | |
c8094d83 | 7779 | (splay_tree_key) name, |
ca36f057 MM |
7780 | (splay_tree_value) decl); |
7781 | } | |
7782 | ||
7783 | /* Note that NAME was declared (as DECL) in the current class. Check | |
0e339752 | 7784 | to see that the declaration is valid. */ |
ca36f057 MM |
7785 | |
7786 | void | |
94edc4ab | 7787 | note_name_declared_in_class (tree name, tree decl) |
ca36f057 MM |
7788 | { |
7789 | splay_tree names_used; | |
7790 | splay_tree_node n; | |
7791 | ||
7792 | /* Look to see if we ever used this name. */ | |
c8094d83 | 7793 | names_used |
ca36f057 MM |
7794 | = current_class_stack[current_class_depth - 1].names_used; |
7795 | if (!names_used) | |
7796 | return; | |
8ce1235b KT |
7797 | /* The C language allows members to be declared with a type of the same |
7798 | name, and the C++ standard says this diagnostic is not required. So | |
7799 | allow it in extern "C" blocks unless predantic is specified. | |
7800 | Allow it in all cases if -ms-extensions is specified. */ | |
7801 | if ((!pedantic && current_lang_name == lang_name_c) | |
7802 | || flag_ms_extensions) | |
7803 | return; | |
ca36f057 MM |
7804 | n = splay_tree_lookup (names_used, (splay_tree_key) name); |
7805 | if (n) | |
7806 | { | |
7807 | /* [basic.scope.class] | |
c8094d83 | 7808 | |
ca36f057 MM |
7809 | A name N used in a class S shall refer to the same declaration |
7810 | in its context and when re-evaluated in the completed scope of | |
7811 | S. */ | |
cbe5f3b3 MLI |
7812 | permerror (input_location, "declaration of %q#D", decl); |
7813 | permerror (input_location, "changes meaning of %qD from %q+#D", | |
2ae2031e | 7814 | DECL_NAME (OVL_CURRENT (decl)), (tree) n->value); |
ca36f057 MM |
7815 | } |
7816 | } | |
7817 | ||
3461fba7 NS |
7818 | /* Returns the VAR_DECL for the complete vtable associated with BINFO. |
7819 | Secondary vtables are merged with primary vtables; this function | |
7820 | will return the VAR_DECL for the primary vtable. */ | |
ca36f057 | 7821 | |
c35cce41 | 7822 | tree |
94edc4ab | 7823 | get_vtbl_decl_for_binfo (tree binfo) |
c35cce41 MM |
7824 | { |
7825 | tree decl; | |
7826 | ||
7827 | decl = BINFO_VTABLE (binfo); | |
5be014d5 | 7828 | if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR) |
c35cce41 | 7829 | { |
50bc768d | 7830 | gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR); |
c35cce41 MM |
7831 | decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0); |
7832 | } | |
7833 | if (decl) | |
5a6ccc94 | 7834 | gcc_assert (VAR_P (decl)); |
c35cce41 MM |
7835 | return decl; |
7836 | } | |
7837 | ||
911a71a7 | 7838 | |
dbbf88d1 NS |
7839 | /* Returns the binfo for the primary base of BINFO. If the resulting |
7840 | BINFO is a virtual base, and it is inherited elsewhere in the | |
7841 | hierarchy, then the returned binfo might not be the primary base of | |
7842 | BINFO in the complete object. Check BINFO_PRIMARY_P or | |
7843 | BINFO_LOST_PRIMARY_P to be sure. */ | |
911a71a7 | 7844 | |
b5791fdc | 7845 | static tree |
94edc4ab | 7846 | get_primary_binfo (tree binfo) |
911a71a7 MM |
7847 | { |
7848 | tree primary_base; | |
c8094d83 | 7849 | |
911a71a7 MM |
7850 | primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo)); |
7851 | if (!primary_base) | |
7852 | return NULL_TREE; | |
7853 | ||
b5791fdc | 7854 | return copied_binfo (primary_base, binfo); |
911a71a7 MM |
7855 | } |
7856 | ||
838dfd8a | 7857 | /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */ |
b7442fb5 NS |
7858 | |
7859 | static int | |
94edc4ab | 7860 | maybe_indent_hierarchy (FILE * stream, int indent, int indented_p) |
b7442fb5 NS |
7861 | { |
7862 | if (!indented_p) | |
7863 | fprintf (stream, "%*s", indent, ""); | |
7864 | return 1; | |
7865 | } | |
7866 | ||
dbbf88d1 NS |
7867 | /* Dump the offsets of all the bases rooted at BINFO to STREAM. |
7868 | INDENT should be zero when called from the top level; it is | |
7869 | incremented recursively. IGO indicates the next expected BINFO in | |
9bcb9aae | 7870 | inheritance graph ordering. */ |
c35cce41 | 7871 | |
dbbf88d1 NS |
7872 | static tree |
7873 | dump_class_hierarchy_r (FILE *stream, | |
0cbd7506 MS |
7874 | int flags, |
7875 | tree binfo, | |
7876 | tree igo, | |
7877 | int indent) | |
ca36f057 | 7878 | { |
b7442fb5 | 7879 | int indented = 0; |
fa743e8c NS |
7880 | tree base_binfo; |
7881 | int i; | |
c8094d83 | 7882 | |
b7442fb5 | 7883 | indented = maybe_indent_hierarchy (stream, indent, 0); |
6c5bf58a | 7884 | fprintf (stream, "%s (0x" HOST_WIDE_INT_PRINT_HEX ") ", |
fc6633e0 | 7885 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER), |
6c5bf58a | 7886 | (HOST_WIDE_INT) (uintptr_t) binfo); |
dbbf88d1 NS |
7887 | if (binfo != igo) |
7888 | { | |
7889 | fprintf (stream, "alternative-path\n"); | |
7890 | return igo; | |
7891 | } | |
7892 | igo = TREE_CHAIN (binfo); | |
c8094d83 | 7893 | |
9965d119 | 7894 | fprintf (stream, HOST_WIDE_INT_PRINT_DEC, |
ca36f057 | 7895 | tree_low_cst (BINFO_OFFSET (binfo), 0)); |
9965d119 NS |
7896 | if (is_empty_class (BINFO_TYPE (binfo))) |
7897 | fprintf (stream, " empty"); | |
7898 | else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo))) | |
7899 | fprintf (stream, " nearly-empty"); | |
809e3e7f | 7900 | if (BINFO_VIRTUAL_P (binfo)) |
dbbf88d1 | 7901 | fprintf (stream, " virtual"); |
9965d119 | 7902 | fprintf (stream, "\n"); |
ca36f057 | 7903 | |
b7442fb5 | 7904 | indented = 0; |
fc6633e0 | 7905 | if (BINFO_PRIMARY_P (binfo)) |
b7442fb5 NS |
7906 | { |
7907 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
6c5bf58a | 7908 | fprintf (stream, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX ")", |
fc6633e0 | 7909 | type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)), |
b7442fb5 | 7910 | TFF_PLAIN_IDENTIFIER), |
6c5bf58a | 7911 | (HOST_WIDE_INT) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo)); |
b7442fb5 NS |
7912 | } |
7913 | if (BINFO_LOST_PRIMARY_P (binfo)) | |
7914 | { | |
7915 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7916 | fprintf (stream, " lost-primary"); | |
7917 | } | |
7918 | if (indented) | |
7919 | fprintf (stream, "\n"); | |
7920 | ||
7921 | if (!(flags & TDF_SLIM)) | |
7922 | { | |
7923 | int indented = 0; | |
c8094d83 | 7924 | |
b7442fb5 NS |
7925 | if (BINFO_SUBVTT_INDEX (binfo)) |
7926 | { | |
7927 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7928 | fprintf (stream, " subvttidx=%s", | |
7929 | expr_as_string (BINFO_SUBVTT_INDEX (binfo), | |
7930 | TFF_PLAIN_IDENTIFIER)); | |
7931 | } | |
7932 | if (BINFO_VPTR_INDEX (binfo)) | |
7933 | { | |
7934 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7935 | fprintf (stream, " vptridx=%s", | |
7936 | expr_as_string (BINFO_VPTR_INDEX (binfo), | |
7937 | TFF_PLAIN_IDENTIFIER)); | |
7938 | } | |
7939 | if (BINFO_VPTR_FIELD (binfo)) | |
7940 | { | |
7941 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7942 | fprintf (stream, " vbaseoffset=%s", | |
7943 | expr_as_string (BINFO_VPTR_FIELD (binfo), | |
7944 | TFF_PLAIN_IDENTIFIER)); | |
7945 | } | |
7946 | if (BINFO_VTABLE (binfo)) | |
7947 | { | |
7948 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7949 | fprintf (stream, " vptr=%s", | |
7950 | expr_as_string (BINFO_VTABLE (binfo), | |
7951 | TFF_PLAIN_IDENTIFIER)); | |
7952 | } | |
c8094d83 | 7953 | |
b7442fb5 NS |
7954 | if (indented) |
7955 | fprintf (stream, "\n"); | |
7956 | } | |
dbbf88d1 | 7957 | |
fa743e8c NS |
7958 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
7959 | igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2); | |
c8094d83 | 7960 | |
dbbf88d1 | 7961 | return igo; |
c35cce41 MM |
7962 | } |
7963 | ||
7964 | /* Dump the BINFO hierarchy for T. */ | |
7965 | ||
b7442fb5 | 7966 | static void |
bb885938 | 7967 | dump_class_hierarchy_1 (FILE *stream, int flags, tree t) |
c35cce41 | 7968 | { |
b7442fb5 NS |
7969 | fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
7970 | fprintf (stream, " size=%lu align=%lu\n", | |
7971 | (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT), | |
7972 | (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT)); | |
dbbf88d1 NS |
7973 | fprintf (stream, " base size=%lu base align=%lu\n", |
7974 | (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0) | |
7975 | / BITS_PER_UNIT), | |
7976 | (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t)) | |
7977 | / BITS_PER_UNIT)); | |
7978 | dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0); | |
b7442fb5 | 7979 | fprintf (stream, "\n"); |
bb885938 NS |
7980 | } |
7981 | ||
da1d7781 | 7982 | /* Debug interface to hierarchy dumping. */ |
bb885938 | 7983 | |
ac1f3b7e | 7984 | void |
bb885938 NS |
7985 | debug_class (tree t) |
7986 | { | |
7987 | dump_class_hierarchy_1 (stderr, TDF_SLIM, t); | |
7988 | } | |
7989 | ||
7990 | static void | |
7991 | dump_class_hierarchy (tree t) | |
7992 | { | |
7993 | int flags; | |
7994 | FILE *stream = dump_begin (TDI_class, &flags); | |
7995 | ||
7996 | if (stream) | |
7997 | { | |
7998 | dump_class_hierarchy_1 (stream, flags, t); | |
7999 | dump_end (TDI_class, stream); | |
8000 | } | |
b7442fb5 NS |
8001 | } |
8002 | ||
8003 | static void | |
94edc4ab | 8004 | dump_array (FILE * stream, tree decl) |
b7442fb5 | 8005 | { |
4038c495 GB |
8006 | tree value; |
8007 | unsigned HOST_WIDE_INT ix; | |
b7442fb5 NS |
8008 | HOST_WIDE_INT elt; |
8009 | tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl))); | |
8010 | ||
8011 | elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0) | |
8012 | / BITS_PER_UNIT); | |
8013 | fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER)); | |
8014 | fprintf (stream, " %s entries", | |
8015 | expr_as_string (size_binop (PLUS_EXPR, size, size_one_node), | |
8016 | TFF_PLAIN_IDENTIFIER)); | |
8017 | fprintf (stream, "\n"); | |
8018 | ||
4038c495 GB |
8019 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)), |
8020 | ix, value) | |
4fdc14ca | 8021 | fprintf (stream, "%-4ld %s\n", (long)(ix * elt), |
4038c495 | 8022 | expr_as_string (value, TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
8023 | } |
8024 | ||
8025 | static void | |
94edc4ab | 8026 | dump_vtable (tree t, tree binfo, tree vtable) |
b7442fb5 NS |
8027 | { |
8028 | int flags; | |
8029 | FILE *stream = dump_begin (TDI_class, &flags); | |
8030 | ||
8031 | if (!stream) | |
8032 | return; | |
8033 | ||
8034 | if (!(flags & TDF_SLIM)) | |
9965d119 | 8035 | { |
b7442fb5 | 8036 | int ctor_vtbl_p = TYPE_BINFO (t) != binfo; |
c8094d83 | 8037 | |
b7442fb5 NS |
8038 | fprintf (stream, "%s for %s", |
8039 | ctor_vtbl_p ? "Construction vtable" : "Vtable", | |
fc6633e0 | 8040 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
8041 | if (ctor_vtbl_p) |
8042 | { | |
809e3e7f | 8043 | if (!BINFO_VIRTUAL_P (binfo)) |
6c5bf58a KT |
8044 | fprintf (stream, " (0x" HOST_WIDE_INT_PRINT_HEX " instance)", |
8045 | (HOST_WIDE_INT) (uintptr_t) binfo); | |
b7442fb5 NS |
8046 | fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
8047 | } | |
8048 | fprintf (stream, "\n"); | |
8049 | dump_array (stream, vtable); | |
8050 | fprintf (stream, "\n"); | |
9965d119 | 8051 | } |
c8094d83 | 8052 | |
b7442fb5 NS |
8053 | dump_end (TDI_class, stream); |
8054 | } | |
8055 | ||
8056 | static void | |
94edc4ab | 8057 | dump_vtt (tree t, tree vtt) |
b7442fb5 NS |
8058 | { |
8059 | int flags; | |
8060 | FILE *stream = dump_begin (TDI_class, &flags); | |
8061 | ||
8062 | if (!stream) | |
8063 | return; | |
8064 | ||
8065 | if (!(flags & TDF_SLIM)) | |
8066 | { | |
8067 | fprintf (stream, "VTT for %s\n", | |
8068 | type_as_string (t, TFF_PLAIN_IDENTIFIER)); | |
8069 | dump_array (stream, vtt); | |
8070 | fprintf (stream, "\n"); | |
8071 | } | |
c8094d83 | 8072 | |
b7442fb5 | 8073 | dump_end (TDI_class, stream); |
ca36f057 MM |
8074 | } |
8075 | ||
bb885938 NS |
8076 | /* Dump a function or thunk and its thunkees. */ |
8077 | ||
8078 | static void | |
8079 | dump_thunk (FILE *stream, int indent, tree thunk) | |
8080 | { | |
8081 | static const char spaces[] = " "; | |
8082 | tree name = DECL_NAME (thunk); | |
8083 | tree thunks; | |
c8094d83 | 8084 | |
bb885938 NS |
8085 | fprintf (stream, "%.*s%p %s %s", indent, spaces, |
8086 | (void *)thunk, | |
8087 | !DECL_THUNK_P (thunk) ? "function" | |
8088 | : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk", | |
8089 | name ? IDENTIFIER_POINTER (name) : "<unset>"); | |
e00853fd | 8090 | if (DECL_THUNK_P (thunk)) |
bb885938 NS |
8091 | { |
8092 | HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk); | |
8093 | tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk); | |
8094 | ||
8095 | fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust); | |
8096 | if (!virtual_adjust) | |
8097 | /*NOP*/; | |
8098 | else if (DECL_THIS_THUNK_P (thunk)) | |
8099 | fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC, | |
8100 | tree_low_cst (virtual_adjust, 0)); | |
8101 | else | |
8102 | fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)", | |
8103 | tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0), | |
8104 | type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE)); | |
e00853fd NS |
8105 | if (THUNK_ALIAS (thunk)) |
8106 | fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk)); | |
bb885938 NS |
8107 | } |
8108 | fprintf (stream, "\n"); | |
8109 | for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks)) | |
8110 | dump_thunk (stream, indent + 2, thunks); | |
8111 | } | |
8112 | ||
8113 | /* Dump the thunks for FN. */ | |
8114 | ||
ac1f3b7e | 8115 | void |
bb885938 NS |
8116 | debug_thunks (tree fn) |
8117 | { | |
8118 | dump_thunk (stderr, 0, fn); | |
8119 | } | |
8120 | ||
ca36f057 MM |
8121 | /* Virtual function table initialization. */ |
8122 | ||
8123 | /* Create all the necessary vtables for T and its base classes. */ | |
8124 | ||
8125 | static void | |
94edc4ab | 8126 | finish_vtbls (tree t) |
ca36f057 | 8127 | { |
3461fba7 | 8128 | tree vbase; |
9771b263 | 8129 | vec<constructor_elt, va_gc> *v = NULL; |
9d6a019c | 8130 | tree vtable = BINFO_VTABLE (TYPE_BINFO (t)); |
ca36f057 | 8131 | |
3461fba7 NS |
8132 | /* We lay out the primary and secondary vtables in one contiguous |
8133 | vtable. The primary vtable is first, followed by the non-virtual | |
8134 | secondary vtables in inheritance graph order. */ | |
9d6a019c NF |
8135 | accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t), TYPE_BINFO (t), |
8136 | vtable, t, &v); | |
c8094d83 | 8137 | |
3461fba7 NS |
8138 | /* Then come the virtual bases, also in inheritance graph order. */ |
8139 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) | |
8140 | { | |
809e3e7f | 8141 | if (!BINFO_VIRTUAL_P (vbase)) |
3461fba7 | 8142 | continue; |
9d6a019c | 8143 | accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), vtable, t, &v); |
ff668506 JM |
8144 | } |
8145 | ||
604a3205 | 8146 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
9d6a019c | 8147 | initialize_vtable (TYPE_BINFO (t), v); |
ca36f057 MM |
8148 | } |
8149 | ||
8150 | /* Initialize the vtable for BINFO with the INITS. */ | |
8151 | ||
8152 | static void | |
9771b263 | 8153 | initialize_vtable (tree binfo, vec<constructor_elt, va_gc> *inits) |
ca36f057 | 8154 | { |
ca36f057 MM |
8155 | tree decl; |
8156 | ||
9771b263 | 8157 | layout_vtable_decl (binfo, vec_safe_length (inits)); |
c35cce41 | 8158 | decl = get_vtbl_decl_for_binfo (binfo); |
19c29b2f | 8159 | initialize_artificial_var (decl, inits); |
b7442fb5 | 8160 | dump_vtable (BINFO_TYPE (binfo), binfo, decl); |
23656158 MM |
8161 | } |
8162 | ||
9965d119 NS |
8163 | /* Build the VTT (virtual table table) for T. |
8164 | A class requires a VTT if it has virtual bases. | |
c8094d83 | 8165 | |
9965d119 NS |
8166 | This holds |
8167 | 1 - primary virtual pointer for complete object T | |
90ecce3e JM |
8168 | 2 - secondary VTTs for each direct non-virtual base of T which requires a |
8169 | VTT | |
9965d119 NS |
8170 | 3 - secondary virtual pointers for each direct or indirect base of T which |
8171 | has virtual bases or is reachable via a virtual path from T. | |
8172 | 4 - secondary VTTs for each direct or indirect virtual base of T. | |
c8094d83 | 8173 | |
9965d119 | 8174 | Secondary VTTs look like complete object VTTs without part 4. */ |
23656158 MM |
8175 | |
8176 | static void | |
94edc4ab | 8177 | build_vtt (tree t) |
23656158 | 8178 | { |
23656158 MM |
8179 | tree type; |
8180 | tree vtt; | |
3ec6bad3 | 8181 | tree index; |
9771b263 | 8182 | vec<constructor_elt, va_gc> *inits; |
23656158 | 8183 | |
23656158 | 8184 | /* Build up the initializers for the VTT. */ |
9d6a019c | 8185 | inits = NULL; |
3ec6bad3 | 8186 | index = size_zero_node; |
9965d119 | 8187 | build_vtt_inits (TYPE_BINFO (t), t, &inits, &index); |
23656158 MM |
8188 | |
8189 | /* If we didn't need a VTT, we're done. */ | |
8190 | if (!inits) | |
8191 | return; | |
8192 | ||
8193 | /* Figure out the type of the VTT. */ | |
dcedcddb | 8194 | type = build_array_of_n_type (const_ptr_type_node, |
9771b263 | 8195 | inits->length ()); |
c8094d83 | 8196 | |
23656158 | 8197 | /* Now, build the VTT object itself. */ |
3e355d92 | 8198 | vtt = build_vtable (t, mangle_vtt_for_type (t), type); |
19c29b2f | 8199 | initialize_artificial_var (vtt, inits); |
548502d3 | 8200 | /* Add the VTT to the vtables list. */ |
910ad8de NF |
8201 | DECL_CHAIN (vtt) = DECL_CHAIN (CLASSTYPE_VTABLES (t)); |
8202 | DECL_CHAIN (CLASSTYPE_VTABLES (t)) = vtt; | |
b7442fb5 NS |
8203 | |
8204 | dump_vtt (t, vtt); | |
23656158 MM |
8205 | } |
8206 | ||
13de7ec4 JM |
8207 | /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with |
8208 | PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo, | |
8209 | and CHAIN the vtable pointer for this binfo after construction is | |
00a17e31 | 8210 | complete. VALUE can also be another BINFO, in which case we recurse. */ |
13de7ec4 JM |
8211 | |
8212 | static tree | |
94edc4ab | 8213 | binfo_ctor_vtable (tree binfo) |
13de7ec4 JM |
8214 | { |
8215 | tree vt; | |
8216 | ||
8217 | while (1) | |
8218 | { | |
8219 | vt = BINFO_VTABLE (binfo); | |
8220 | if (TREE_CODE (vt) == TREE_LIST) | |
8221 | vt = TREE_VALUE (vt); | |
95b4aca6 | 8222 | if (TREE_CODE (vt) == TREE_BINFO) |
13de7ec4 JM |
8223 | binfo = vt; |
8224 | else | |
8225 | break; | |
8226 | } | |
8227 | ||
8228 | return vt; | |
8229 | } | |
8230 | ||
a3a0fc7f NS |
8231 | /* Data for secondary VTT initialization. */ |
8232 | typedef struct secondary_vptr_vtt_init_data_s | |
8233 | { | |
8234 | /* Is this the primary VTT? */ | |
8235 | bool top_level_p; | |
8236 | ||
8237 | /* Current index into the VTT. */ | |
8238 | tree index; | |
8239 | ||
9d6a019c | 8240 | /* Vector of initializers built up. */ |
9771b263 | 8241 | vec<constructor_elt, va_gc> *inits; |
a3a0fc7f NS |
8242 | |
8243 | /* The type being constructed by this secondary VTT. */ | |
8244 | tree type_being_constructed; | |
8245 | } secondary_vptr_vtt_init_data; | |
8246 | ||
23656158 | 8247 | /* Recursively build the VTT-initializer for BINFO (which is in the |
9965d119 NS |
8248 | hierarchy dominated by T). INITS points to the end of the initializer |
8249 | list to date. INDEX is the VTT index where the next element will be | |
8250 | replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e. | |
8251 | not a subvtt for some base of T). When that is so, we emit the sub-VTTs | |
8252 | for virtual bases of T. When it is not so, we build the constructor | |
8253 | vtables for the BINFO-in-T variant. */ | |
23656158 | 8254 | |
9d6a019c | 8255 | static void |
9771b263 DN |
8256 | build_vtt_inits (tree binfo, tree t, vec<constructor_elt, va_gc> **inits, |
8257 | tree *index) | |
23656158 MM |
8258 | { |
8259 | int i; | |
8260 | tree b; | |
8261 | tree init; | |
a3a0fc7f | 8262 | secondary_vptr_vtt_init_data data; |
539ed333 | 8263 | int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
23656158 MM |
8264 | |
8265 | /* We only need VTTs for subobjects with virtual bases. */ | |
5775a06a | 8266 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
9d6a019c | 8267 | return; |
23656158 MM |
8268 | |
8269 | /* We need to use a construction vtable if this is not the primary | |
8270 | VTT. */ | |
9965d119 | 8271 | if (!top_level_p) |
3ec6bad3 MM |
8272 | { |
8273 | build_ctor_vtbl_group (binfo, t); | |
8274 | ||
8275 | /* Record the offset in the VTT where this sub-VTT can be found. */ | |
8276 | BINFO_SUBVTT_INDEX (binfo) = *index; | |
8277 | } | |
23656158 MM |
8278 | |
8279 | /* Add the address of the primary vtable for the complete object. */ | |
13de7ec4 | 8280 | init = binfo_ctor_vtable (binfo); |
9d6a019c | 8281 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
9965d119 NS |
8282 | if (top_level_p) |
8283 | { | |
50bc768d | 8284 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
9965d119 NS |
8285 | BINFO_VPTR_INDEX (binfo) = *index; |
8286 | } | |
3ec6bad3 | 8287 | *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node)); |
c8094d83 | 8288 | |
23656158 | 8289 | /* Recursively add the secondary VTTs for non-virtual bases. */ |
fa743e8c NS |
8290 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i) |
8291 | if (!BINFO_VIRTUAL_P (b)) | |
9d6a019c | 8292 | build_vtt_inits (b, t, inits, index); |
c8094d83 | 8293 | |
23656158 | 8294 | /* Add secondary virtual pointers for all subobjects of BINFO with |
9965d119 NS |
8295 | either virtual bases or reachable along a virtual path, except |
8296 | subobjects that are non-virtual primary bases. */ | |
a3a0fc7f NS |
8297 | data.top_level_p = top_level_p; |
8298 | data.index = *index; | |
9d6a019c | 8299 | data.inits = *inits; |
a3a0fc7f | 8300 | data.type_being_constructed = BINFO_TYPE (binfo); |
c8094d83 | 8301 | |
5d5a519f | 8302 | dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data); |
9965d119 | 8303 | |
a3a0fc7f | 8304 | *index = data.index; |
23656158 | 8305 | |
9d6a019c NF |
8306 | /* data.inits might have grown as we added secondary virtual pointers. |
8307 | Make sure our caller knows about the new vector. */ | |
8308 | *inits = data.inits; | |
23656158 | 8309 | |
9965d119 | 8310 | if (top_level_p) |
a3a0fc7f NS |
8311 | /* Add the secondary VTTs for virtual bases in inheritance graph |
8312 | order. */ | |
9ccf6541 MM |
8313 | for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b)) |
8314 | { | |
809e3e7f | 8315 | if (!BINFO_VIRTUAL_P (b)) |
9ccf6541 | 8316 | continue; |
c8094d83 | 8317 | |
9d6a019c | 8318 | build_vtt_inits (b, t, inits, index); |
9ccf6541 | 8319 | } |
a3a0fc7f NS |
8320 | else |
8321 | /* Remove the ctor vtables we created. */ | |
5d5a519f | 8322 | dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo); |
23656158 MM |
8323 | } |
8324 | ||
8df83eae | 8325 | /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base |
a3a0fc7f | 8326 | in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */ |
23656158 MM |
8327 | |
8328 | static tree | |
a3a0fc7f | 8329 | dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_) |
23656158 | 8330 | { |
a3a0fc7f | 8331 | secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_; |
23656158 | 8332 | |
23656158 MM |
8333 | /* We don't care about bases that don't have vtables. */ |
8334 | if (!TYPE_VFIELD (BINFO_TYPE (binfo))) | |
5d5a519f | 8335 | return dfs_skip_bases; |
23656158 | 8336 | |
a3a0fc7f NS |
8337 | /* We're only interested in proper subobjects of the type being |
8338 | constructed. */ | |
539ed333 | 8339 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed)) |
23656158 MM |
8340 | return NULL_TREE; |
8341 | ||
a3a0fc7f NS |
8342 | /* We're only interested in bases with virtual bases or reachable |
8343 | via a virtual path from the type being constructed. */ | |
5d5a519f NS |
8344 | if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
8345 | || binfo_via_virtual (binfo, data->type_being_constructed))) | |
8346 | return dfs_skip_bases; | |
c8094d83 | 8347 | |
5d5a519f NS |
8348 | /* We're not interested in non-virtual primary bases. */ |
8349 | if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo)) | |
db3d8cde | 8350 | return NULL_TREE; |
c8094d83 | 8351 | |
3ec6bad3 | 8352 | /* Record the index where this secondary vptr can be found. */ |
a3a0fc7f | 8353 | if (data->top_level_p) |
9965d119 | 8354 | { |
50bc768d | 8355 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
a3a0fc7f | 8356 | BINFO_VPTR_INDEX (binfo) = data->index; |
3ec6bad3 | 8357 | |
a3a0fc7f NS |
8358 | if (BINFO_VIRTUAL_P (binfo)) |
8359 | { | |
0cbd7506 MS |
8360 | /* It's a primary virtual base, and this is not a |
8361 | construction vtable. Find the base this is primary of in | |
8362 | the inheritance graph, and use that base's vtable | |
8363 | now. */ | |
a3a0fc7f NS |
8364 | while (BINFO_PRIMARY_P (binfo)) |
8365 | binfo = BINFO_INHERITANCE_CHAIN (binfo); | |
8366 | } | |
9965d119 | 8367 | } |
c8094d83 | 8368 | |
a3a0fc7f | 8369 | /* Add the initializer for the secondary vptr itself. */ |
9d6a019c | 8370 | CONSTRUCTOR_APPEND_ELT (data->inits, NULL_TREE, binfo_ctor_vtable (binfo)); |
23656158 | 8371 | |
a3a0fc7f NS |
8372 | /* Advance the vtt index. */ |
8373 | data->index = size_binop (PLUS_EXPR, data->index, | |
8374 | TYPE_SIZE_UNIT (ptr_type_node)); | |
9965d119 | 8375 | |
a3a0fc7f | 8376 | return NULL_TREE; |
9965d119 NS |
8377 | } |
8378 | ||
a3a0fc7f NS |
8379 | /* Called from build_vtt_inits via dfs_walk. After building |
8380 | constructor vtables and generating the sub-vtt from them, we need | |
8381 | to restore the BINFO_VTABLES that were scribbled on. DATA is the | |
8382 | binfo of the base whose sub vtt was generated. */ | |
23656158 MM |
8383 | |
8384 | static tree | |
94edc4ab | 8385 | dfs_fixup_binfo_vtbls (tree binfo, void* data) |
23656158 | 8386 | { |
a3a0fc7f | 8387 | tree vtable = BINFO_VTABLE (binfo); |
23656158 | 8388 | |
5d5a519f NS |
8389 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8390 | /* If this class has no vtable, none of its bases do. */ | |
8391 | return dfs_skip_bases; | |
c8094d83 | 8392 | |
5d5a519f NS |
8393 | if (!vtable) |
8394 | /* This might be a primary base, so have no vtable in this | |
8395 | hierarchy. */ | |
8396 | return NULL_TREE; | |
c8094d83 | 8397 | |
23656158 MM |
8398 | /* If we scribbled the construction vtable vptr into BINFO, clear it |
8399 | out now. */ | |
5d5a519f | 8400 | if (TREE_CODE (vtable) == TREE_LIST |
a3a0fc7f NS |
8401 | && (TREE_PURPOSE (vtable) == (tree) data)) |
8402 | BINFO_VTABLE (binfo) = TREE_CHAIN (vtable); | |
23656158 MM |
8403 | |
8404 | return NULL_TREE; | |
8405 | } | |
8406 | ||
8407 | /* Build the construction vtable group for BINFO which is in the | |
8408 | hierarchy dominated by T. */ | |
8409 | ||
8410 | static void | |
94edc4ab | 8411 | build_ctor_vtbl_group (tree binfo, tree t) |
23656158 | 8412 | { |
23656158 MM |
8413 | tree type; |
8414 | tree vtbl; | |
23656158 | 8415 | tree id; |
9ccf6541 | 8416 | tree vbase; |
9771b263 | 8417 | vec<constructor_elt, va_gc> *v; |
23656158 | 8418 | |
7bdcf888 | 8419 | /* See if we've already created this construction vtable group. */ |
1f84ec23 | 8420 | id = mangle_ctor_vtbl_for_type (t, binfo); |
23656158 MM |
8421 | if (IDENTIFIER_GLOBAL_VALUE (id)) |
8422 | return; | |
8423 | ||
539ed333 | 8424 | gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)); |
23656158 MM |
8425 | /* Build a version of VTBL (with the wrong type) for use in |
8426 | constructing the addresses of secondary vtables in the | |
8427 | construction vtable group. */ | |
459c43ad | 8428 | vtbl = build_vtable (t, id, ptr_type_node); |
505970fc | 8429 | DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1; |
2ee8a2d5 JM |
8430 | /* Don't export construction vtables from shared libraries. Even on |
8431 | targets that don't support hidden visibility, this tells | |
8432 | can_refer_decl_in_current_unit_p not to assume that it's safe to | |
8433 | access from a different compilation unit (bz 54314). */ | |
8434 | DECL_VISIBILITY (vtbl) = VISIBILITY_HIDDEN; | |
8435 | DECL_VISIBILITY_SPECIFIED (vtbl) = true; | |
9d6a019c NF |
8436 | |
8437 | v = NULL; | |
23656158 | 8438 | accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)), |
9d6a019c | 8439 | binfo, vtbl, t, &v); |
9965d119 NS |
8440 | |
8441 | /* Add the vtables for each of our virtual bases using the vbase in T | |
8442 | binfo. */ | |
c8094d83 MS |
8443 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); |
8444 | vbase; | |
9ccf6541 MM |
8445 | vbase = TREE_CHAIN (vbase)) |
8446 | { | |
8447 | tree b; | |
8448 | ||
809e3e7f | 8449 | if (!BINFO_VIRTUAL_P (vbase)) |
9ccf6541 | 8450 | continue; |
dbbf88d1 | 8451 | b = copied_binfo (vbase, binfo); |
c8094d83 | 8452 | |
9d6a019c | 8453 | accumulate_vtbl_inits (b, vbase, binfo, vtbl, t, &v); |
9ccf6541 | 8454 | } |
23656158 MM |
8455 | |
8456 | /* Figure out the type of the construction vtable. */ | |
9771b263 | 8457 | type = build_array_of_n_type (vtable_entry_type, v->length ()); |
8208d7dc | 8458 | layout_type (type); |
23656158 | 8459 | TREE_TYPE (vtbl) = type; |
8208d7dc DJ |
8460 | DECL_SIZE (vtbl) = DECL_SIZE_UNIT (vtbl) = NULL_TREE; |
8461 | layout_decl (vtbl, 0); | |
23656158 MM |
8462 | |
8463 | /* Initialize the construction vtable. */ | |
548502d3 | 8464 | CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl); |
9d6a019c | 8465 | initialize_artificial_var (vtbl, v); |
b7442fb5 | 8466 | dump_vtable (t, binfo, vtbl); |
23656158 MM |
8467 | } |
8468 | ||
9965d119 NS |
8469 | /* Add the vtbl initializers for BINFO (and its bases other than |
8470 | non-virtual primaries) to the list of INITS. BINFO is in the | |
8471 | hierarchy dominated by T. RTTI_BINFO is the binfo within T of | |
8472 | the constructor the vtbl inits should be accumulated for. (If this | |
8473 | is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).) | |
8474 | ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO). | |
8475 | BINFO is the active base equivalent of ORIG_BINFO in the inheritance | |
8476 | graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE, | |
8477 | but are not necessarily the same in terms of layout. */ | |
ca36f057 MM |
8478 | |
8479 | static void | |
94edc4ab | 8480 | accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8481 | tree orig_binfo, |
8482 | tree rtti_binfo, | |
9d6a019c | 8483 | tree vtbl, |
0cbd7506 | 8484 | tree t, |
9771b263 | 8485 | vec<constructor_elt, va_gc> **inits) |
ca36f057 | 8486 | { |
23656158 | 8487 | int i; |
fa743e8c | 8488 | tree base_binfo; |
539ed333 | 8489 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
23656158 | 8490 | |
539ed333 | 8491 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo))); |
23656158 | 8492 | |
00a17e31 | 8493 | /* If it doesn't have a vptr, we don't do anything. */ |
623fe76a NS |
8494 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8495 | return; | |
c8094d83 | 8496 | |
23656158 MM |
8497 | /* If we're building a construction vtable, we're not interested in |
8498 | subobjects that don't require construction vtables. */ | |
c8094d83 | 8499 | if (ctor_vtbl_p |
5775a06a | 8500 | && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
9965d119 | 8501 | && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo))) |
23656158 MM |
8502 | return; |
8503 | ||
8504 | /* Build the initializers for the BINFO-in-T vtable. */ | |
9d6a019c | 8505 | dfs_accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, vtbl, t, inits); |
c8094d83 | 8506 | |
c35cce41 MM |
8507 | /* Walk the BINFO and its bases. We walk in preorder so that as we |
8508 | initialize each vtable we can figure out at what offset the | |
23656158 MM |
8509 | secondary vtable lies from the primary vtable. We can't use |
8510 | dfs_walk here because we need to iterate through bases of BINFO | |
8511 | and RTTI_BINFO simultaneously. */ | |
fa743e8c | 8512 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
23656158 | 8513 | { |
23656158 | 8514 | /* Skip virtual bases. */ |
809e3e7f | 8515 | if (BINFO_VIRTUAL_P (base_binfo)) |
23656158 MM |
8516 | continue; |
8517 | accumulate_vtbl_inits (base_binfo, | |
604a3205 | 8518 | BINFO_BASE_BINFO (orig_binfo, i), |
9d6a019c | 8519 | rtti_binfo, vtbl, t, |
23656158 MM |
8520 | inits); |
8521 | } | |
ca36f057 MM |
8522 | } |
8523 | ||
9d6a019c NF |
8524 | /* Called from accumulate_vtbl_inits. Adds the initializers for the |
8525 | BINFO vtable to L. */ | |
ca36f057 | 8526 | |
9d6a019c | 8527 | static void |
94edc4ab | 8528 | dfs_accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8529 | tree orig_binfo, |
8530 | tree rtti_binfo, | |
9d6a019c | 8531 | tree orig_vtbl, |
0cbd7506 | 8532 | tree t, |
9771b263 | 8533 | vec<constructor_elt, va_gc> **l) |
ca36f057 | 8534 | { |
9965d119 | 8535 | tree vtbl = NULL_TREE; |
539ed333 | 8536 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
9d6a019c | 8537 | int n_inits; |
9965d119 | 8538 | |
13de7ec4 | 8539 | if (ctor_vtbl_p |
809e3e7f | 8540 | && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo)) |
9965d119 | 8541 | { |
13de7ec4 JM |
8542 | /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a |
8543 | primary virtual base. If it is not the same primary in | |
8544 | the hierarchy of T, we'll need to generate a ctor vtable | |
8545 | for it, to place at its location in T. If it is the same | |
8546 | primary, we still need a VTT entry for the vtable, but it | |
8547 | should point to the ctor vtable for the base it is a | |
8548 | primary for within the sub-hierarchy of RTTI_BINFO. | |
c8094d83 | 8549 | |
13de7ec4 | 8550 | There are three possible cases: |
c8094d83 | 8551 | |
13de7ec4 JM |
8552 | 1) We are in the same place. |
8553 | 2) We are a primary base within a lost primary virtual base of | |
8554 | RTTI_BINFO. | |
049d2def | 8555 | 3) We are primary to something not a base of RTTI_BINFO. */ |
c8094d83 | 8556 | |
fc6633e0 | 8557 | tree b; |
13de7ec4 | 8558 | tree last = NULL_TREE; |
85a9a0a2 | 8559 | |
13de7ec4 JM |
8560 | /* First, look through the bases we are primary to for RTTI_BINFO |
8561 | or a virtual base. */ | |
fc6633e0 NS |
8562 | b = binfo; |
8563 | while (BINFO_PRIMARY_P (b)) | |
7bdcf888 | 8564 | { |
fc6633e0 | 8565 | b = BINFO_INHERITANCE_CHAIN (b); |
13de7ec4 | 8566 | last = b; |
809e3e7f | 8567 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) |
fc6633e0 | 8568 | goto found; |
7bdcf888 | 8569 | } |
13de7ec4 JM |
8570 | /* If we run out of primary links, keep looking down our |
8571 | inheritance chain; we might be an indirect primary. */ | |
fc6633e0 NS |
8572 | for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b)) |
8573 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) | |
8574 | break; | |
8575 | found: | |
c8094d83 | 8576 | |
13de7ec4 JM |
8577 | /* If we found RTTI_BINFO, this is case 1. If we found a virtual |
8578 | base B and it is a base of RTTI_BINFO, this is case 2. In | |
8579 | either case, we share our vtable with LAST, i.e. the | |
8580 | derived-most base within B of which we are a primary. */ | |
8581 | if (b == rtti_binfo | |
58c42dc2 | 8582 | || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo)))) |
049d2def JM |
8583 | /* Just set our BINFO_VTABLE to point to LAST, as we may not have |
8584 | set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in | |
8585 | binfo_ctor_vtable after everything's been set up. */ | |
8586 | vtbl = last; | |
13de7ec4 | 8587 | |
049d2def | 8588 | /* Otherwise, this is case 3 and we get our own. */ |
9965d119 | 8589 | } |
dbbf88d1 | 8590 | else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo)) |
9d6a019c NF |
8591 | return; |
8592 | ||
9771b263 | 8593 | n_inits = vec_safe_length (*l); |
7bdcf888 | 8594 | |
9965d119 | 8595 | if (!vtbl) |
ca36f057 | 8596 | { |
c35cce41 MM |
8597 | tree index; |
8598 | int non_fn_entries; | |
8599 | ||
9d6a019c NF |
8600 | /* Add the initializer for this vtable. */ |
8601 | build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo, | |
8602 | &non_fn_entries, l); | |
c35cce41 | 8603 | |
23656158 | 8604 | /* Figure out the position to which the VPTR should point. */ |
9d6a019c | 8605 | vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, orig_vtbl); |
23656158 MM |
8606 | index = size_binop (MULT_EXPR, |
8607 | TYPE_SIZE_UNIT (vtable_entry_type), | |
5d49b6a7 RG |
8608 | size_int (non_fn_entries + n_inits)); |
8609 | vtbl = fold_build_pointer_plus (vtbl, index); | |
9965d119 | 8610 | } |
23656158 | 8611 | |
7bdcf888 | 8612 | if (ctor_vtbl_p) |
9965d119 NS |
8613 | /* For a construction vtable, we can't overwrite BINFO_VTABLE. |
8614 | So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will | |
8615 | straighten this out. */ | |
8616 | BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo)); | |
809e3e7f | 8617 | else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo)) |
9d6a019c | 8618 | /* Throw away any unneeded intializers. */ |
9771b263 | 8619 | (*l)->truncate (n_inits); |
7bdcf888 NS |
8620 | else |
8621 | /* For an ordinary vtable, set BINFO_VTABLE. */ | |
8622 | BINFO_VTABLE (binfo) = vtbl; | |
ca36f057 MM |
8623 | } |
8624 | ||
1b746b0f AP |
8625 | static GTY(()) tree abort_fndecl_addr; |
8626 | ||
90ecce3e | 8627 | /* Construct the initializer for BINFO's virtual function table. BINFO |
aabb4cd6 | 8628 | is part of the hierarchy dominated by T. If we're building a |
23656158 | 8629 | construction vtable, the ORIG_BINFO is the binfo we should use to |
9965d119 NS |
8630 | find the actual function pointers to put in the vtable - but they |
8631 | can be overridden on the path to most-derived in the graph that | |
8632 | ORIG_BINFO belongs. Otherwise, | |
911a71a7 | 8633 | ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the |
23656158 MM |
8634 | BINFO that should be indicated by the RTTI information in the |
8635 | vtable; it will be a base class of T, rather than T itself, if we | |
8636 | are building a construction vtable. | |
aabb4cd6 MM |
8637 | |
8638 | The value returned is a TREE_LIST suitable for wrapping in a | |
8639 | CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If | |
8640 | NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the | |
c8094d83 | 8641 | number of non-function entries in the vtable. |
911a71a7 MM |
8642 | |
8643 | It might seem that this function should never be called with a | |
9965d119 | 8644 | BINFO for which BINFO_PRIMARY_P holds, the vtable for such a |
911a71a7 | 8645 | base is always subsumed by a derived class vtable. However, when |
9965d119 | 8646 | we are building construction vtables, we do build vtables for |
911a71a7 MM |
8647 | primary bases; we need these while the primary base is being |
8648 | constructed. */ | |
ca36f057 | 8649 | |
9d6a019c | 8650 | static void |
94edc4ab | 8651 | build_vtbl_initializer (tree binfo, |
0cbd7506 MS |
8652 | tree orig_binfo, |
8653 | tree t, | |
8654 | tree rtti_binfo, | |
9d6a019c | 8655 | int* non_fn_entries_p, |
9771b263 | 8656 | vec<constructor_elt, va_gc> **inits) |
ca36f057 | 8657 | { |
02dea3ff | 8658 | tree v; |
911a71a7 | 8659 | vtbl_init_data vid; |
9d6a019c | 8660 | unsigned ix, jx; |
58c42dc2 | 8661 | tree vbinfo; |
9771b263 | 8662 | vec<tree, va_gc> *vbases; |
9d6a019c | 8663 | constructor_elt *e; |
c8094d83 | 8664 | |
911a71a7 | 8665 | /* Initialize VID. */ |
961192e1 | 8666 | memset (&vid, 0, sizeof (vid)); |
911a71a7 MM |
8667 | vid.binfo = binfo; |
8668 | vid.derived = t; | |
73ea87d7 | 8669 | vid.rtti_binfo = rtti_binfo; |
539ed333 NS |
8670 | vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
8671 | vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); | |
548502d3 | 8672 | vid.generate_vcall_entries = true; |
c35cce41 | 8673 | /* The first vbase or vcall offset is at index -3 in the vtable. */ |
ce552f75 | 8674 | vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE); |
c35cce41 | 8675 | |
9bab6c90 | 8676 | /* Add entries to the vtable for RTTI. */ |
73ea87d7 | 8677 | build_rtti_vtbl_entries (binfo, &vid); |
9bab6c90 | 8678 | |
b485e15b MM |
8679 | /* Create an array for keeping track of the functions we've |
8680 | processed. When we see multiple functions with the same | |
8681 | signature, we share the vcall offsets. */ | |
9771b263 | 8682 | vec_alloc (vid.fns, 32); |
c35cce41 | 8683 | /* Add the vcall and vbase offset entries. */ |
911a71a7 | 8684 | build_vcall_and_vbase_vtbl_entries (binfo, &vid); |
c8094d83 | 8685 | |
79cda2d1 | 8686 | /* Clear BINFO_VTABLE_PATH_MARKED; it's set by |
c35cce41 | 8687 | build_vbase_offset_vtbl_entries. */ |
9ba5ff0f | 8688 | for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0; |
9771b263 | 8689 | vec_safe_iterate (vbases, ix, &vbinfo); ix++) |
58c42dc2 | 8690 | BINFO_VTABLE_PATH_MARKED (vbinfo) = 0; |
ca36f057 | 8691 | |
a6f5e048 RH |
8692 | /* If the target requires padding between data entries, add that now. */ |
8693 | if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1) | |
8694 | { | |
9771b263 | 8695 | int n_entries = vec_safe_length (vid.inits); |
9d6a019c | 8696 | |
9771b263 | 8697 | vec_safe_grow (vid.inits, TARGET_VTABLE_DATA_ENTRY_DISTANCE * n_entries); |
a6f5e048 | 8698 | |
9d6a019c NF |
8699 | /* Move data entries into their new positions and add padding |
8700 | after the new positions. Iterate backwards so we don't | |
8701 | overwrite entries that we would need to process later. */ | |
8702 | for (ix = n_entries - 1; | |
9771b263 | 8703 | vid.inits->iterate (ix, &e); |
9d6a019c | 8704 | ix--) |
a6f5e048 | 8705 | { |
9d6a019c | 8706 | int j; |
25d8a217 NF |
8707 | int new_position = (TARGET_VTABLE_DATA_ENTRY_DISTANCE * ix |
8708 | + (TARGET_VTABLE_DATA_ENTRY_DISTANCE - 1)); | |
9d6a019c | 8709 | |
9771b263 | 8710 | (*vid.inits)[new_position] = *e; |
a6f5e048 | 8711 | |
9d6a019c NF |
8712 | for (j = 1; j < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++j) |
8713 | { | |
9771b263 | 8714 | constructor_elt *f = &(*vid.inits)[new_position - j]; |
9d6a019c NF |
8715 | f->index = NULL_TREE; |
8716 | f->value = build1 (NOP_EXPR, vtable_entry_type, | |
8717 | null_pointer_node); | |
8718 | } | |
a6f5e048 RH |
8719 | } |
8720 | } | |
8721 | ||
c35cce41 | 8722 | if (non_fn_entries_p) |
9771b263 | 8723 | *non_fn_entries_p = vec_safe_length (vid.inits); |
9d6a019c NF |
8724 | |
8725 | /* The initializers for virtual functions were built up in reverse | |
8726 | order. Straighten them out and add them to the running list in one | |
8727 | step. */ | |
9771b263 DN |
8728 | jx = vec_safe_length (*inits); |
8729 | vec_safe_grow (*inits, jx + vid.inits->length ()); | |
9d6a019c | 8730 | |
9771b263 DN |
8731 | for (ix = vid.inits->length () - 1; |
8732 | vid.inits->iterate (ix, &e); | |
9d6a019c | 8733 | ix--, jx++) |
9771b263 | 8734 | (**inits)[jx] = *e; |
ca36f057 MM |
8735 | |
8736 | /* Go through all the ordinary virtual functions, building up | |
8737 | initializers. */ | |
23656158 | 8738 | for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v)) |
ca36f057 MM |
8739 | { |
8740 | tree delta; | |
8741 | tree vcall_index; | |
4977bab6 | 8742 | tree fn, fn_original; |
f11ee281 | 8743 | tree init = NULL_TREE; |
c8094d83 | 8744 | |
ca36f057 | 8745 | fn = BV_FN (v); |
07fa4878 NS |
8746 | fn_original = fn; |
8747 | if (DECL_THUNK_P (fn)) | |
4977bab6 | 8748 | { |
07fa4878 NS |
8749 | if (!DECL_NAME (fn)) |
8750 | finish_thunk (fn); | |
e00853fd | 8751 | if (THUNK_ALIAS (fn)) |
bb885938 NS |
8752 | { |
8753 | fn = THUNK_ALIAS (fn); | |
8754 | BV_FN (v) = fn; | |
8755 | } | |
07fa4878 | 8756 | fn_original = THUNK_TARGET (fn); |
4977bab6 | 8757 | } |
c8094d83 | 8758 | |
d0cd8b44 JM |
8759 | /* If the only definition of this function signature along our |
8760 | primary base chain is from a lost primary, this vtable slot will | |
8761 | never be used, so just zero it out. This is important to avoid | |
8762 | requiring extra thunks which cannot be generated with the function. | |
8763 | ||
f11ee281 JM |
8764 | We first check this in update_vtable_entry_for_fn, so we handle |
8765 | restored primary bases properly; we also need to do it here so we | |
39a13be5 | 8766 | zero out unused slots in ctor vtables, rather than filling them |
f11ee281 JM |
8767 | with erroneous values (though harmless, apart from relocation |
8768 | costs). */ | |
02dea3ff JM |
8769 | if (BV_LOST_PRIMARY (v)) |
8770 | init = size_zero_node; | |
d0cd8b44 | 8771 | |
f11ee281 JM |
8772 | if (! init) |
8773 | { | |
8774 | /* Pull the offset for `this', and the function to call, out of | |
8775 | the list. */ | |
8776 | delta = BV_DELTA (v); | |
548502d3 | 8777 | vcall_index = BV_VCALL_INDEX (v); |
f11ee281 | 8778 | |
50bc768d NS |
8779 | gcc_assert (TREE_CODE (delta) == INTEGER_CST); |
8780 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
f11ee281 JM |
8781 | |
8782 | /* You can't call an abstract virtual function; it's abstract. | |
8783 | So, we replace these functions with __pure_virtual. */ | |
4977bab6 | 8784 | if (DECL_PURE_VIRTUAL_P (fn_original)) |
4977bab6 | 8785 | { |
1b746b0f | 8786 | fn = abort_fndecl; |
21b6aca3 JJ |
8787 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8788 | { | |
8789 | if (abort_fndecl_addr == NULL) | |
8790 | abort_fndecl_addr | |
8791 | = fold_convert (vfunc_ptr_type_node, | |
8792 | build_fold_addr_expr (fn)); | |
8793 | init = abort_fndecl_addr; | |
8794 | } | |
1b746b0f | 8795 | } |
4ce7d589 JM |
8796 | /* Likewise for deleted virtuals. */ |
8797 | else if (DECL_DELETED_FN (fn_original)) | |
8798 | { | |
8799 | fn = get_identifier ("__cxa_deleted_virtual"); | |
8800 | if (!get_global_value_if_present (fn, &fn)) | |
8801 | fn = push_library_fn (fn, (build_function_type_list | |
8802 | (void_type_node, NULL_TREE)), | |
8803 | NULL_TREE); | |
8804 | if (!TARGET_VTABLE_USES_DESCRIPTORS) | |
8805 | init = fold_convert (vfunc_ptr_type_node, | |
8806 | build_fold_addr_expr (fn)); | |
8807 | } | |
1b746b0f AP |
8808 | else |
8809 | { | |
8810 | if (!integer_zerop (delta) || vcall_index) | |
8811 | { | |
8812 | fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index); | |
8813 | if (!DECL_NAME (fn)) | |
8814 | finish_thunk (fn); | |
8815 | } | |
8816 | /* Take the address of the function, considering it to be of an | |
8817 | appropriate generic type. */ | |
21b6aca3 JJ |
8818 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8819 | init = fold_convert (vfunc_ptr_type_node, | |
8820 | build_fold_addr_expr (fn)); | |
4977bab6 | 8821 | } |
f11ee281 | 8822 | } |
d0cd8b44 | 8823 | |
ca36f057 | 8824 | /* And add it to the chain of initializers. */ |
67231816 RH |
8825 | if (TARGET_VTABLE_USES_DESCRIPTORS) |
8826 | { | |
8827 | int i; | |
8828 | if (init == size_zero_node) | |
8829 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
9d6a019c | 8830 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
67231816 RH |
8831 | else |
8832 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
8833 | { | |
f293ce4b | 8834 | tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node, |
21b6aca3 | 8835 | fn, build_int_cst (NULL_TREE, i)); |
67231816 RH |
8836 | TREE_CONSTANT (fdesc) = 1; |
8837 | ||
9d6a019c | 8838 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, fdesc); |
67231816 RH |
8839 | } |
8840 | } | |
8841 | else | |
9d6a019c | 8842 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
ca36f057 | 8843 | } |
ca36f057 MM |
8844 | } |
8845 | ||
d0cd8b44 | 8846 | /* Adds to vid->inits the initializers for the vbase and vcall |
c35cce41 | 8847 | offsets in BINFO, which is in the hierarchy dominated by T. */ |
ca36f057 | 8848 | |
c35cce41 | 8849 | static void |
94edc4ab | 8850 | build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 8851 | { |
c35cce41 | 8852 | tree b; |
8d08fdba | 8853 | |
c35cce41 | 8854 | /* If this is a derived class, we must first create entries |
9bab6c90 | 8855 | corresponding to the primary base class. */ |
911a71a7 | 8856 | b = get_primary_binfo (binfo); |
c35cce41 | 8857 | if (b) |
911a71a7 | 8858 | build_vcall_and_vbase_vtbl_entries (b, vid); |
c35cce41 MM |
8859 | |
8860 | /* Add the vbase entries for this base. */ | |
911a71a7 | 8861 | build_vbase_offset_vtbl_entries (binfo, vid); |
c35cce41 | 8862 | /* Add the vcall entries for this base. */ |
911a71a7 | 8863 | build_vcall_offset_vtbl_entries (binfo, vid); |
ca36f057 | 8864 | } |
8d08fdba | 8865 | |
ca36f057 MM |
8866 | /* Returns the initializers for the vbase offset entries in the vtable |
8867 | for BINFO (which is part of the class hierarchy dominated by T), in | |
c35cce41 MM |
8868 | reverse order. VBASE_OFFSET_INDEX gives the vtable index |
8869 | where the next vbase offset will go. */ | |
8d08fdba | 8870 | |
c35cce41 | 8871 | static void |
94edc4ab | 8872 | build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 8873 | { |
c35cce41 MM |
8874 | tree vbase; |
8875 | tree t; | |
90b1ca2f | 8876 | tree non_primary_binfo; |
8d08fdba | 8877 | |
ca36f057 MM |
8878 | /* If there are no virtual baseclasses, then there is nothing to |
8879 | do. */ | |
5775a06a | 8880 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
c35cce41 | 8881 | return; |
ca36f057 | 8882 | |
911a71a7 | 8883 | t = vid->derived; |
c8094d83 | 8884 | |
90b1ca2f NS |
8885 | /* We might be a primary base class. Go up the inheritance hierarchy |
8886 | until we find the most derived class of which we are a primary base: | |
8887 | it is the offset of that which we need to use. */ | |
8888 | non_primary_binfo = binfo; | |
8889 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
8890 | { | |
8891 | tree b; | |
8892 | ||
8893 | /* If we have reached a virtual base, then it must be a primary | |
8894 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
8895 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
8896 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 8897 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
90b1ca2f NS |
8898 | { |
8899 | non_primary_binfo = vid->binfo; | |
8900 | break; | |
8901 | } | |
8902 | ||
8903 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); | |
8904 | if (get_primary_binfo (b) != non_primary_binfo) | |
8905 | break; | |
8906 | non_primary_binfo = b; | |
8907 | } | |
ca36f057 | 8908 | |
c35cce41 MM |
8909 | /* Go through the virtual bases, adding the offsets. */ |
8910 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); | |
8911 | vbase; | |
8912 | vbase = TREE_CHAIN (vbase)) | |
8913 | { | |
8914 | tree b; | |
8915 | tree delta; | |
c8094d83 | 8916 | |
809e3e7f | 8917 | if (!BINFO_VIRTUAL_P (vbase)) |
c35cce41 | 8918 | continue; |
ca36f057 | 8919 | |
c35cce41 MM |
8920 | /* Find the instance of this virtual base in the complete |
8921 | object. */ | |
dbbf88d1 | 8922 | b = copied_binfo (vbase, binfo); |
c35cce41 MM |
8923 | |
8924 | /* If we've already got an offset for this virtual base, we | |
8925 | don't need another one. */ | |
8926 | if (BINFO_VTABLE_PATH_MARKED (b)) | |
8927 | continue; | |
dbbf88d1 | 8928 | BINFO_VTABLE_PATH_MARKED (b) = 1; |
c35cce41 MM |
8929 | |
8930 | /* Figure out where we can find this vbase offset. */ | |
c8094d83 | 8931 | delta = size_binop (MULT_EXPR, |
911a71a7 | 8932 | vid->index, |
c35cce41 MM |
8933 | convert (ssizetype, |
8934 | TYPE_SIZE_UNIT (vtable_entry_type))); | |
911a71a7 | 8935 | if (vid->primary_vtbl_p) |
c35cce41 MM |
8936 | BINFO_VPTR_FIELD (b) = delta; |
8937 | ||
8938 | if (binfo != TYPE_BINFO (t)) | |
50bc768d NS |
8939 | /* The vbase offset had better be the same. */ |
8940 | gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase))); | |
c35cce41 MM |
8941 | |
8942 | /* The next vbase will come at a more negative offset. */ | |
a6f5e048 RH |
8943 | vid->index = size_binop (MINUS_EXPR, vid->index, |
8944 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
c35cce41 MM |
8945 | |
8946 | /* The initializer is the delta from BINFO to this virtual base. | |
4e7512c9 MM |
8947 | The vbase offsets go in reverse inheritance-graph order, and |
8948 | we are walking in inheritance graph order so these end up in | |
8949 | the right order. */ | |
db3927fb AH |
8950 | delta = size_diffop_loc (input_location, |
8951 | BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo)); | |
c8094d83 | 8952 | |
9d6a019c NF |
8953 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, |
8954 | fold_build1_loc (input_location, NOP_EXPR, | |
8955 | vtable_entry_type, delta)); | |
c35cce41 | 8956 | } |
8d08fdba | 8957 | } |
ca36f057 | 8958 | |
b485e15b | 8959 | /* Adds the initializers for the vcall offset entries in the vtable |
d0cd8b44 JM |
8960 | for BINFO (which is part of the class hierarchy dominated by VID->DERIVED) |
8961 | to VID->INITS. */ | |
b485e15b MM |
8962 | |
8963 | static void | |
94edc4ab | 8964 | build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b485e15b | 8965 | { |
548502d3 MM |
8966 | /* We only need these entries if this base is a virtual base. We |
8967 | compute the indices -- but do not add to the vtable -- when | |
8968 | building the main vtable for a class. */ | |
b9302915 MM |
8969 | if (binfo == TYPE_BINFO (vid->derived) |
8970 | || (BINFO_VIRTUAL_P (binfo) | |
8971 | /* If BINFO is RTTI_BINFO, then (since BINFO does not | |
8972 | correspond to VID->DERIVED), we are building a primary | |
8973 | construction virtual table. Since this is a primary | |
8974 | virtual table, we do not need the vcall offsets for | |
8975 | BINFO. */ | |
8976 | && binfo != vid->rtti_binfo)) | |
548502d3 MM |
8977 | { |
8978 | /* We need a vcall offset for each of the virtual functions in this | |
8979 | vtable. For example: | |
b485e15b | 8980 | |
548502d3 MM |
8981 | class A { virtual void f (); }; |
8982 | class B1 : virtual public A { virtual void f (); }; | |
8983 | class B2 : virtual public A { virtual void f (); }; | |
8984 | class C: public B1, public B2 { virtual void f (); }; | |
d0cd8b44 | 8985 | |
548502d3 MM |
8986 | A C object has a primary base of B1, which has a primary base of A. A |
8987 | C also has a secondary base of B2, which no longer has a primary base | |
8988 | of A. So the B2-in-C construction vtable needs a secondary vtable for | |
8989 | A, which will adjust the A* to a B2* to call f. We have no way of | |
8990 | knowing what (or even whether) this offset will be when we define B2, | |
8991 | so we store this "vcall offset" in the A sub-vtable and look it up in | |
8992 | a "virtual thunk" for B2::f. | |
b485e15b | 8993 | |
548502d3 MM |
8994 | We need entries for all the functions in our primary vtable and |
8995 | in our non-virtual bases' secondary vtables. */ | |
8996 | vid->vbase = binfo; | |
8997 | /* If we are just computing the vcall indices -- but do not need | |
8998 | the actual entries -- not that. */ | |
809e3e7f | 8999 | if (!BINFO_VIRTUAL_P (binfo)) |
548502d3 MM |
9000 | vid->generate_vcall_entries = false; |
9001 | /* Now, walk through the non-virtual bases, adding vcall offsets. */ | |
9002 | add_vcall_offset_vtbl_entries_r (binfo, vid); | |
9003 | } | |
b485e15b MM |
9004 | } |
9005 | ||
9006 | /* Build vcall offsets, starting with those for BINFO. */ | |
9007 | ||
9008 | static void | |
94edc4ab | 9009 | add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid) |
b485e15b MM |
9010 | { |
9011 | int i; | |
9012 | tree primary_binfo; | |
fa743e8c | 9013 | tree base_binfo; |
b485e15b MM |
9014 | |
9015 | /* Don't walk into virtual bases -- except, of course, for the | |
d0cd8b44 JM |
9016 | virtual base for which we are building vcall offsets. Any |
9017 | primary virtual base will have already had its offsets generated | |
9018 | through the recursion in build_vcall_and_vbase_vtbl_entries. */ | |
809e3e7f | 9019 | if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo) |
b485e15b | 9020 | return; |
c8094d83 | 9021 | |
b485e15b MM |
9022 | /* If BINFO has a primary base, process it first. */ |
9023 | primary_binfo = get_primary_binfo (binfo); | |
9024 | if (primary_binfo) | |
9025 | add_vcall_offset_vtbl_entries_r (primary_binfo, vid); | |
9026 | ||
9027 | /* Add BINFO itself to the list. */ | |
9028 | add_vcall_offset_vtbl_entries_1 (binfo, vid); | |
9029 | ||
9030 | /* Scan the non-primary bases of BINFO. */ | |
fa743e8c NS |
9031 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
9032 | if (base_binfo != primary_binfo) | |
9033 | add_vcall_offset_vtbl_entries_r (base_binfo, vid); | |
b485e15b MM |
9034 | } |
9035 | ||
9965d119 | 9036 | /* Called from build_vcall_offset_vtbl_entries_r. */ |
e92cc029 | 9037 | |
b485e15b | 9038 | static void |
94edc4ab | 9039 | add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid) |
8d08fdba | 9040 | { |
e6a66567 MM |
9041 | /* Make entries for the rest of the virtuals. */ |
9042 | if (abi_version_at_least (2)) | |
31f8e4f3 | 9043 | { |
e6a66567 | 9044 | tree orig_fn; |
911a71a7 | 9045 | |
e6a66567 MM |
9046 | /* The ABI requires that the methods be processed in declaration |
9047 | order. G++ 3.2 used the order in the vtable. */ | |
9048 | for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo)); | |
9049 | orig_fn; | |
910ad8de | 9050 | orig_fn = DECL_CHAIN (orig_fn)) |
e6a66567 | 9051 | if (DECL_VINDEX (orig_fn)) |
95675950 | 9052 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 MM |
9053 | } |
9054 | else | |
9055 | { | |
9056 | tree derived_virtuals; | |
9057 | tree base_virtuals; | |
9058 | tree orig_virtuals; | |
9059 | /* If BINFO is a primary base, the most derived class which has | |
9060 | BINFO as a primary base; otherwise, just BINFO. */ | |
9061 | tree non_primary_binfo; | |
9062 | ||
9063 | /* We might be a primary base class. Go up the inheritance hierarchy | |
9064 | until we find the most derived class of which we are a primary base: | |
9065 | it is the BINFO_VIRTUALS there that we need to consider. */ | |
9066 | non_primary_binfo = binfo; | |
9067 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
911a71a7 | 9068 | { |
e6a66567 MM |
9069 | tree b; |
9070 | ||
9071 | /* If we have reached a virtual base, then it must be vid->vbase, | |
9072 | because we ignore other virtual bases in | |
9073 | add_vcall_offset_vtbl_entries_r. In turn, it must be a primary | |
9074 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
9075 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
9076 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 9077 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
e6a66567 | 9078 | { |
8dc2b103 | 9079 | gcc_assert (non_primary_binfo == vid->vbase); |
e6a66567 MM |
9080 | non_primary_binfo = vid->binfo; |
9081 | break; | |
9082 | } | |
911a71a7 | 9083 | |
e6a66567 MM |
9084 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); |
9085 | if (get_primary_binfo (b) != non_primary_binfo) | |
9086 | break; | |
9087 | non_primary_binfo = b; | |
9088 | } | |
4e7512c9 | 9089 | |
e6a66567 MM |
9090 | if (vid->ctor_vtbl_p) |
9091 | /* For a ctor vtable we need the equivalent binfo within the hierarchy | |
9092 | where rtti_binfo is the most derived type. */ | |
dbbf88d1 NS |
9093 | non_primary_binfo |
9094 | = original_binfo (non_primary_binfo, vid->rtti_binfo); | |
c8094d83 | 9095 | |
e6a66567 MM |
9096 | for (base_virtuals = BINFO_VIRTUALS (binfo), |
9097 | derived_virtuals = BINFO_VIRTUALS (non_primary_binfo), | |
9098 | orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
9099 | base_virtuals; | |
9100 | base_virtuals = TREE_CHAIN (base_virtuals), | |
9101 | derived_virtuals = TREE_CHAIN (derived_virtuals), | |
9102 | orig_virtuals = TREE_CHAIN (orig_virtuals)) | |
9103 | { | |
9104 | tree orig_fn; | |
73ea87d7 | 9105 | |
e6a66567 MM |
9106 | /* Find the declaration that originally caused this function to |
9107 | be present in BINFO_TYPE (binfo). */ | |
9108 | orig_fn = BV_FN (orig_virtuals); | |
9bab6c90 | 9109 | |
e6a66567 MM |
9110 | /* When processing BINFO, we only want to generate vcall slots for |
9111 | function slots introduced in BINFO. So don't try to generate | |
9112 | one if the function isn't even defined in BINFO. */ | |
539ed333 | 9113 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn))) |
e6a66567 | 9114 | continue; |
b485e15b | 9115 | |
95675950 | 9116 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 MM |
9117 | } |
9118 | } | |
9119 | } | |
b485e15b | 9120 | |
95675950 | 9121 | /* Add a vcall offset entry for ORIG_FN to the vtable. */ |
b485e15b | 9122 | |
e6a66567 | 9123 | static void |
95675950 | 9124 | add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid) |
e6a66567 MM |
9125 | { |
9126 | size_t i; | |
9127 | tree vcall_offset; | |
1e625046 | 9128 | tree derived_entry; |
9bab6c90 | 9129 | |
e6a66567 MM |
9130 | /* If there is already an entry for a function with the same |
9131 | signature as FN, then we do not need a second vcall offset. | |
9132 | Check the list of functions already present in the derived | |
9133 | class vtable. */ | |
9771b263 | 9134 | FOR_EACH_VEC_SAFE_ELT (vid->fns, i, derived_entry) |
e6a66567 | 9135 | { |
e6a66567 MM |
9136 | if (same_signature_p (derived_entry, orig_fn) |
9137 | /* We only use one vcall offset for virtual destructors, | |
9138 | even though there are two virtual table entries. */ | |
9139 | || (DECL_DESTRUCTOR_P (derived_entry) | |
9140 | && DECL_DESTRUCTOR_P (orig_fn))) | |
9141 | return; | |
9142 | } | |
4e7512c9 | 9143 | |
e6a66567 MM |
9144 | /* If we are building these vcall offsets as part of building |
9145 | the vtable for the most derived class, remember the vcall | |
9146 | offset. */ | |
9147 | if (vid->binfo == TYPE_BINFO (vid->derived)) | |
0871761b | 9148 | { |
f32682ca | 9149 | tree_pair_s elt = {orig_fn, vid->index}; |
9771b263 | 9150 | vec_safe_push (CLASSTYPE_VCALL_INDICES (vid->derived), elt); |
0871761b | 9151 | } |
c8094d83 | 9152 | |
e6a66567 MM |
9153 | /* The next vcall offset will be found at a more negative |
9154 | offset. */ | |
9155 | vid->index = size_binop (MINUS_EXPR, vid->index, | |
9156 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
9157 | ||
9158 | /* Keep track of this function. */ | |
9771b263 | 9159 | vec_safe_push (vid->fns, orig_fn); |
e6a66567 MM |
9160 | |
9161 | if (vid->generate_vcall_entries) | |
9162 | { | |
9163 | tree base; | |
e6a66567 | 9164 | tree fn; |
548502d3 | 9165 | |
e6a66567 | 9166 | /* Find the overriding function. */ |
95675950 | 9167 | fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn); |
e6a66567 | 9168 | if (fn == error_mark_node) |
e8160c9a | 9169 | vcall_offset = build_zero_cst (vtable_entry_type); |
e6a66567 MM |
9170 | else |
9171 | { | |
95675950 MM |
9172 | base = TREE_VALUE (fn); |
9173 | ||
9174 | /* The vbase we're working on is a primary base of | |
9175 | vid->binfo. But it might be a lost primary, so its | |
9176 | BINFO_OFFSET might be wrong, so we just use the | |
9177 | BINFO_OFFSET from vid->binfo. */ | |
db3927fb AH |
9178 | vcall_offset = size_diffop_loc (input_location, |
9179 | BINFO_OFFSET (base), | |
95675950 | 9180 | BINFO_OFFSET (vid->binfo)); |
db3927fb AH |
9181 | vcall_offset = fold_build1_loc (input_location, |
9182 | NOP_EXPR, vtable_entry_type, | |
7866705a | 9183 | vcall_offset); |
548502d3 | 9184 | } |
34cd5ae7 | 9185 | /* Add the initializer to the vtable. */ |
9d6a019c | 9186 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, vcall_offset); |
c35cce41 | 9187 | } |
570221c2 | 9188 | } |
b54ccf71 | 9189 | |
34cd5ae7 | 9190 | /* Return vtbl initializers for the RTTI entries corresponding to the |
aabb4cd6 | 9191 | BINFO's vtable. The RTTI entries should indicate the object given |
73ea87d7 | 9192 | by VID->rtti_binfo. */ |
b54ccf71 | 9193 | |
9bab6c90 | 9194 | static void |
94edc4ab | 9195 | build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b54ccf71 | 9196 | { |
ca36f057 | 9197 | tree b; |
aabb4cd6 | 9198 | tree t; |
ca36f057 MM |
9199 | tree offset; |
9200 | tree decl; | |
9201 | tree init; | |
b54ccf71 | 9202 | |
73ea87d7 | 9203 | t = BINFO_TYPE (vid->rtti_binfo); |
b54ccf71 | 9204 | |
ca36f057 MM |
9205 | /* To find the complete object, we will first convert to our most |
9206 | primary base, and then add the offset in the vtbl to that value. */ | |
9207 | b = binfo; | |
9965d119 | 9208 | while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b)) |
0cbd7506 | 9209 | && !BINFO_LOST_PRIMARY_P (b)) |
b54ccf71 | 9210 | { |
c35cce41 MM |
9211 | tree primary_base; |
9212 | ||
911a71a7 | 9213 | primary_base = get_primary_binfo (b); |
fc6633e0 NS |
9214 | gcc_assert (BINFO_PRIMARY_P (primary_base) |
9215 | && BINFO_INHERITANCE_CHAIN (primary_base) == b); | |
c35cce41 | 9216 | b = primary_base; |
b54ccf71 | 9217 | } |
db3927fb AH |
9218 | offset = size_diffop_loc (input_location, |
9219 | BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b)); | |
8f032717 | 9220 | |
8fa33dfa MM |
9221 | /* The second entry is the address of the typeinfo object. */ |
9222 | if (flag_rtti) | |
7993382e | 9223 | decl = build_address (get_tinfo_decl (t)); |
ca36f057 | 9224 | else |
8fa33dfa | 9225 | decl = integer_zero_node; |
c8094d83 | 9226 | |
8fa33dfa MM |
9227 | /* Convert the declaration to a type that can be stored in the |
9228 | vtable. */ | |
7993382e | 9229 | init = build_nop (vfunc_ptr_type_node, decl); |
9d6a019c | 9230 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 9231 | |
78dcd41a VR |
9232 | /* Add the offset-to-top entry. It comes earlier in the vtable than |
9233 | the typeinfo entry. Convert the offset to look like a | |
c4372ef4 | 9234 | function pointer, so that we can put it in the vtable. */ |
7993382e | 9235 | init = build_nop (vfunc_ptr_type_node, offset); |
9d6a019c | 9236 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 9237 | } |
0f59171d | 9238 | |
22854930 PC |
9239 | /* TRUE iff TYPE is uniquely derived from PARENT. Ignores |
9240 | accessibility. */ | |
9241 | ||
9242 | bool | |
9243 | uniquely_derived_from_p (tree parent, tree type) | |
9244 | { | |
9245 | tree base = lookup_base (type, parent, ba_unique, NULL, tf_none); | |
9246 | return base && base != error_mark_node; | |
9247 | } | |
9248 | ||
9249 | /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */ | |
9250 | ||
9251 | bool | |
9252 | publicly_uniquely_derived_p (tree parent, tree type) | |
9253 | { | |
9254 | tree base = lookup_base (type, parent, ba_ignore_scope | ba_check, | |
9255 | NULL, tf_none); | |
9256 | return base && base != error_mark_node; | |
9257 | } | |
9258 | ||
1b746b0f | 9259 | #include "gt-cp-class.h" |