]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Functions related to building classes and their related objects. |
23a5b65a | 2 | Copyright (C) 1987-2014 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" |
d8a2d370 DN |
29 | #include "stringpool.h" |
30 | #include "stor-layout.h" | |
31 | #include "attribs.h" | |
2fb9a547 AM |
32 | #include "pointer-set.h" |
33 | #include "hash-table.h" | |
8d08fdba MS |
34 | #include "cp-tree.h" |
35 | #include "flags.h" | |
54f92bfb | 36 | #include "toplev.h" |
1af6141b | 37 | #include "target.h" |
7b6d72fc | 38 | #include "convert.h" |
8634c649 | 39 | #include "cgraph.h" |
7ee2468b | 40 | #include "dumpfile.h" |
245763e3 | 41 | #include "splay-tree.h" |
45b0be94 | 42 | #include "gimplify.h" |
8d08fdba | 43 | |
61a127b3 MM |
44 | /* The number of nested classes being processed. If we are not in the |
45 | scope of any class, this is zero. */ | |
46 | ||
8d08fdba MS |
47 | int current_class_depth; |
48 | ||
61a127b3 MM |
49 | /* In order to deal with nested classes, we keep a stack of classes. |
50 | The topmost entry is the innermost class, and is the entry at index | |
51 | CURRENT_CLASS_DEPTH */ | |
52 | ||
53 | typedef struct class_stack_node { | |
54 | /* The name of the class. */ | |
55 | tree name; | |
56 | ||
57 | /* The _TYPE node for the class. */ | |
58 | tree type; | |
59 | ||
60 | /* The access specifier pending for new declarations in the scope of | |
61 | this class. */ | |
62 | tree access; | |
8f032717 MM |
63 | |
64 | /* If were defining TYPE, the names used in this class. */ | |
65 | splay_tree names_used; | |
c888c93b MM |
66 | |
67 | /* Nonzero if this class is no longer open, because of a call to | |
68 | push_to_top_level. */ | |
69 | size_t hidden; | |
61a127b3 MM |
70 | }* class_stack_node_t; |
71 | ||
911a71a7 | 72 | typedef struct vtbl_init_data_s |
c35cce41 | 73 | { |
911a71a7 MM |
74 | /* The base for which we're building initializers. */ |
75 | tree binfo; | |
73ea87d7 | 76 | /* The type of the most-derived type. */ |
c35cce41 | 77 | tree derived; |
73ea87d7 NS |
78 | /* The binfo for the dynamic type. This will be TYPE_BINFO (derived), |
79 | unless ctor_vtbl_p is true. */ | |
80 | tree rtti_binfo; | |
9bab6c90 MM |
81 | /* The negative-index vtable initializers built up so far. These |
82 | are in order from least negative index to most negative index. */ | |
9771b263 | 83 | vec<constructor_elt, va_gc> *inits; |
c35cce41 | 84 | /* The binfo for the virtual base for which we're building |
911a71a7 | 85 | vcall offset initializers. */ |
c35cce41 | 86 | tree vbase; |
9bab6c90 MM |
87 | /* The functions in vbase for which we have already provided vcall |
88 | offsets. */ | |
9771b263 | 89 | vec<tree, va_gc> *fns; |
c35cce41 MM |
90 | /* The vtable index of the next vcall or vbase offset. */ |
91 | tree index; | |
92 | /* Nonzero if we are building the initializer for the primary | |
93 | vtable. */ | |
911a71a7 MM |
94 | int primary_vtbl_p; |
95 | /* Nonzero if we are building the initializer for a construction | |
96 | vtable. */ | |
97 | int ctor_vtbl_p; | |
548502d3 MM |
98 | /* True when adding vcall offset entries to the vtable. False when |
99 | merely computing the indices. */ | |
100 | bool generate_vcall_entries; | |
911a71a7 | 101 | } vtbl_init_data; |
c35cce41 | 102 | |
c20118a8 | 103 | /* The type of a function passed to walk_subobject_offsets. */ |
94edc4ab | 104 | typedef int (*subobject_offset_fn) (tree, tree, splay_tree); |
c20118a8 | 105 | |
4639c5c6 | 106 | /* The stack itself. This is a dynamically resized array. The |
61a127b3 MM |
107 | number of elements allocated is CURRENT_CLASS_STACK_SIZE. */ |
108 | static int current_class_stack_size; | |
109 | static class_stack_node_t current_class_stack; | |
110 | ||
c5a35c3c MM |
111 | /* The size of the largest empty class seen in this translation unit. */ |
112 | static GTY (()) tree sizeof_biggest_empty_class; | |
113 | ||
1f6e1acc AS |
114 | /* An array of all local classes present in this translation unit, in |
115 | declaration order. */ | |
9771b263 | 116 | vec<tree, va_gc> *local_classes; |
1f6e1acc | 117 | |
94edc4ab NN |
118 | static tree get_vfield_name (tree); |
119 | static void finish_struct_anon (tree); | |
120 | static tree get_vtable_name (tree); | |
121 | static tree get_basefndecls (tree, tree); | |
122 | static int build_primary_vtable (tree, tree); | |
dbbf88d1 | 123 | static int build_secondary_vtable (tree); |
94edc4ab NN |
124 | static void finish_vtbls (tree); |
125 | static void modify_vtable_entry (tree, tree, tree, tree, tree *); | |
94edc4ab NN |
126 | static void finish_struct_bits (tree); |
127 | static int alter_access (tree, tree, tree); | |
128 | static void handle_using_decl (tree, tree); | |
94edc4ab NN |
129 | static tree dfs_modify_vtables (tree, void *); |
130 | static tree modify_all_vtables (tree, tree); | |
fc6633e0 | 131 | static void determine_primary_bases (tree); |
94edc4ab NN |
132 | static void finish_struct_methods (tree); |
133 | static void maybe_warn_about_overly_private_class (tree); | |
94edc4ab NN |
134 | static int method_name_cmp (const void *, const void *); |
135 | static int resort_method_name_cmp (const void *, const void *); | |
85b5d65a | 136 | static void add_implicitly_declared_members (tree, tree*, int, int); |
94edc4ab | 137 | static tree fixed_type_or_null (tree, int *, int *); |
00bfffa4 | 138 | static tree build_simple_base_path (tree expr, tree binfo); |
94edc4ab | 139 | static tree build_vtbl_ref_1 (tree, tree); |
9d6a019c | 140 | static void build_vtbl_initializer (tree, tree, tree, tree, int *, |
9771b263 | 141 | vec<constructor_elt, va_gc> **); |
94edc4ab | 142 | static int count_fields (tree); |
d07605f5 | 143 | static int add_fields_to_record_type (tree, struct sorted_fields_type*, int); |
cba0366c | 144 | static void insert_into_classtype_sorted_fields (tree, tree, int); |
e7df0180 | 145 | static bool check_bitfield_decl (tree); |
10746f37 JM |
146 | static void check_field_decl (tree, tree, int *, int *, int *); |
147 | static void check_field_decls (tree, tree *, int *, int *); | |
58731fd1 MM |
148 | static tree *build_base_field (record_layout_info, tree, splay_tree, tree *); |
149 | static void build_base_fields (record_layout_info, splay_tree, tree *); | |
94edc4ab NN |
150 | static void check_methods (tree); |
151 | static void remove_zero_width_bit_fields (tree); | |
10746f37 | 152 | static void check_bases (tree, int *, int *); |
58731fd1 MM |
153 | static void check_bases_and_members (tree); |
154 | static tree create_vtable_ptr (tree, tree *); | |
17bbb839 | 155 | static void include_empty_classes (record_layout_info); |
e93ee644 | 156 | static void layout_class_type (tree, tree *); |
dbbf88d1 | 157 | static void propagate_binfo_offsets (tree, tree); |
17bbb839 | 158 | static void layout_virtual_bases (record_layout_info, splay_tree); |
94edc4ab NN |
159 | static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *); |
160 | static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *); | |
161 | static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *); | |
162 | static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *); | |
e6a66567 | 163 | static void add_vcall_offset (tree, tree, vtbl_init_data *); |
94edc4ab | 164 | static void layout_vtable_decl (tree, int); |
5d5a519f | 165 | static tree dfs_find_final_overrider_pre (tree, void *); |
dbbf88d1 | 166 | static tree dfs_find_final_overrider_post (tree, void *); |
94edc4ab NN |
167 | static tree find_final_overrider (tree, tree, tree); |
168 | static int make_new_vtable (tree, tree); | |
b5791fdc | 169 | static tree get_primary_binfo (tree); |
94edc4ab | 170 | static int maybe_indent_hierarchy (FILE *, int, int); |
dbbf88d1 | 171 | static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int); |
94edc4ab | 172 | static void dump_class_hierarchy (tree); |
bb885938 | 173 | static void dump_class_hierarchy_1 (FILE *, int, tree); |
94edc4ab NN |
174 | static void dump_array (FILE *, tree); |
175 | static void dump_vtable (tree, tree, tree); | |
176 | static void dump_vtt (tree, tree); | |
bb885938 | 177 | static void dump_thunk (FILE *, int, tree); |
94edc4ab | 178 | static tree build_vtable (tree, tree, tree); |
9771b263 | 179 | static void initialize_vtable (tree, vec<constructor_elt, va_gc> *); |
94edc4ab | 180 | static void layout_nonempty_base_or_field (record_layout_info, |
5d5a519f | 181 | tree, tree, splay_tree); |
94edc4ab | 182 | static tree end_of_class (tree, int); |
d9d9dbc0 | 183 | static bool layout_empty_base (record_layout_info, tree, tree, splay_tree); |
9d6a019c | 184 | static void accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
9771b263 | 185 | vec<constructor_elt, va_gc> **); |
9d6a019c | 186 | static void dfs_accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
9771b263 | 187 | vec<constructor_elt, va_gc> **); |
94edc4ab | 188 | static void build_rtti_vtbl_entries (tree, vtbl_init_data *); |
5d5a519f | 189 | static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *); |
94edc4ab NN |
190 | static void clone_constructors_and_destructors (tree); |
191 | static tree build_clone (tree, tree); | |
a2ddc397 | 192 | static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned); |
94edc4ab NN |
193 | static void build_ctor_vtbl_group (tree, tree); |
194 | static void build_vtt (tree); | |
195 | static tree binfo_ctor_vtable (tree); | |
9771b263 DN |
196 | static void build_vtt_inits (tree, tree, vec<constructor_elt, va_gc> **, |
197 | tree *); | |
94edc4ab | 198 | static tree dfs_build_secondary_vptr_vtt_inits (tree, void *); |
94edc4ab | 199 | static tree dfs_fixup_binfo_vtbls (tree, void *); |
94edc4ab NN |
200 | static int record_subobject_offset (tree, tree, splay_tree); |
201 | static int check_subobject_offset (tree, tree, splay_tree); | |
202 | static int walk_subobject_offsets (tree, subobject_offset_fn, | |
5d5a519f | 203 | tree, splay_tree, tree, int); |
c5a35c3c | 204 | static void record_subobject_offsets (tree, tree, splay_tree, bool); |
94edc4ab NN |
205 | static int layout_conflict_p (tree, tree, splay_tree, int); |
206 | static int splay_tree_compare_integer_csts (splay_tree_key k1, | |
5d5a519f | 207 | splay_tree_key k2); |
94edc4ab NN |
208 | static void warn_about_ambiguous_bases (tree); |
209 | static bool type_requires_array_cookie (tree); | |
956d9305 | 210 | static bool contains_empty_class_p (tree); |
9368208b | 211 | static bool base_derived_from (tree, tree); |
7ba539c6 | 212 | static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree); |
ba9a991f | 213 | static tree end_of_base (tree); |
548502d3 | 214 | static tree get_vcall_index (tree, tree); |
9965d119 | 215 | |
51c184be | 216 | /* Variables shared between class.c and call.c. */ |
8d08fdba MS |
217 | |
218 | int n_vtables = 0; | |
219 | int n_vtable_entries = 0; | |
220 | int n_vtable_searches = 0; | |
221 | int n_vtable_elems = 0; | |
222 | int n_convert_harshness = 0; | |
223 | int n_compute_conversion_costs = 0; | |
8d08fdba MS |
224 | int n_inner_fields_searched = 0; |
225 | ||
338d90b8 NS |
226 | /* Convert to or from a base subobject. EXPR is an expression of type |
227 | `A' or `A*', an expression of type `B' or `B*' is returned. To | |
228 | convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for | |
229 | the B base instance within A. To convert base A to derived B, CODE | |
230 | is MINUS_EXPR and BINFO is the binfo for the A instance within B. | |
231 | In this latter case, A must not be a morally virtual base of B. | |
232 | NONNULL is true if EXPR is known to be non-NULL (this is only | |
233 | needed when EXPR is of pointer type). CV qualifiers are preserved | |
234 | from EXPR. */ | |
ca36f057 MM |
235 | |
236 | tree | |
94edc4ab | 237 | build_base_path (enum tree_code code, |
0cbd7506 MS |
238 | tree expr, |
239 | tree binfo, | |
a271590a PC |
240 | int nonnull, |
241 | tsubst_flags_t complain) | |
1a588ad7 | 242 | { |
338d90b8 | 243 | tree v_binfo = NULL_TREE; |
6bc34b14 | 244 | tree d_binfo = NULL_TREE; |
338d90b8 NS |
245 | tree probe; |
246 | tree offset; | |
247 | tree target_type; | |
248 | tree null_test = NULL; | |
249 | tree ptr_target_type; | |
ca36f057 | 250 | int fixed_type_p; |
50e10fa8 | 251 | int want_pointer = TYPE_PTR_P (TREE_TYPE (expr)); |
00bfffa4 | 252 | bool has_empty = false; |
d7981fd9 | 253 | bool virtual_access; |
1a588ad7 | 254 | |
338d90b8 NS |
255 | if (expr == error_mark_node || binfo == error_mark_node || !binfo) |
256 | return error_mark_node; | |
6bc34b14 JM |
257 | |
258 | for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
259 | { | |
260 | d_binfo = probe; | |
00bfffa4 JM |
261 | if (is_empty_class (BINFO_TYPE (probe))) |
262 | has_empty = true; | |
809e3e7f | 263 | if (!v_binfo && BINFO_VIRTUAL_P (probe)) |
6bc34b14 JM |
264 | v_binfo = probe; |
265 | } | |
338d90b8 NS |
266 | |
267 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr)); | |
268 | if (want_pointer) | |
269 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe)); | |
00bfffa4 | 270 | |
5313d330 JM |
271 | if (code == PLUS_EXPR |
272 | && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)) | |
273 | { | |
274 | /* This can happen when adjust_result_of_qualified_name_lookup can't | |
275 | find a unique base binfo in a call to a member function. We | |
276 | couldn't give the diagnostic then since we might have been calling | |
277 | a static member function, so we do it now. */ | |
278 | if (complain & tf_error) | |
279 | { | |
280 | tree base = lookup_base (probe, BINFO_TYPE (d_binfo), | |
22854930 | 281 | ba_unique, NULL, complain); |
5313d330 JM |
282 | gcc_assert (base == error_mark_node); |
283 | } | |
284 | return error_mark_node; | |
285 | } | |
286 | ||
539ed333 NS |
287 | gcc_assert ((code == MINUS_EXPR |
288 | && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe)) | |
5313d330 | 289 | || code == PLUS_EXPR); |
c8094d83 | 290 | |
00bfffa4 JM |
291 | if (binfo == d_binfo) |
292 | /* Nothing to do. */ | |
293 | return expr; | |
294 | ||
338d90b8 NS |
295 | if (code == MINUS_EXPR && v_binfo) |
296 | { | |
a271590a | 297 | if (complain & tf_error) |
128be7f9 PC |
298 | { |
299 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (v_binfo))) | |
300 | { | |
301 | if (want_pointer) | |
302 | error ("cannot convert from pointer to base class %qT to " | |
303 | "pointer to derived class %qT because the base is " | |
304 | "virtual", BINFO_TYPE (binfo), BINFO_TYPE (d_binfo)); | |
305 | else | |
306 | error ("cannot convert from base class %qT to derived " | |
307 | "class %qT because the base is virtual", | |
308 | BINFO_TYPE (binfo), BINFO_TYPE (d_binfo)); | |
309 | } | |
310 | else | |
311 | { | |
312 | if (want_pointer) | |
313 | error ("cannot convert from pointer to base class %qT to " | |
314 | "pointer to derived class %qT via virtual base %qT", | |
315 | BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), | |
316 | BINFO_TYPE (v_binfo)); | |
317 | else | |
318 | error ("cannot convert from base class %qT to derived " | |
319 | "class %qT via virtual base %qT", BINFO_TYPE (binfo), | |
320 | BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo)); | |
321 | } | |
322 | } | |
338d90b8 NS |
323 | return error_mark_node; |
324 | } | |
1a588ad7 | 325 | |
f576dfc4 JM |
326 | if (!want_pointer) |
327 | /* This must happen before the call to save_expr. */ | |
a271590a | 328 | expr = cp_build_addr_expr (expr, complain); |
7fd7263d | 329 | else |
416f380b | 330 | expr = mark_rvalue_use (expr); |
f576dfc4 | 331 | |
00bfffa4 | 332 | offset = BINFO_OFFSET (binfo); |
ca36f057 | 333 | fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull); |
0e686aa6 | 334 | target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo); |
2bbf86a4 JM |
335 | /* TARGET_TYPE has been extracted from BINFO, and, is therefore always |
336 | cv-unqualified. Extract the cv-qualifiers from EXPR so that the | |
337 | expression returned matches the input. */ | |
338 | target_type = cp_build_qualified_type | |
339 | (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr)))); | |
340 | ptr_target_type = build_pointer_type (target_type); | |
00bfffa4 | 341 | |
d7981fd9 | 342 | /* Do we need to look in the vtable for the real offset? */ |
7a0b47e3 JM |
343 | virtual_access = (v_binfo && fixed_type_p <= 0); |
344 | ||
345 | /* Don't bother with the calculations inside sizeof; they'll ICE if the | |
a8e23778 JM |
346 | source type is incomplete and the pointer value doesn't matter. In a |
347 | template (even in fold_non_dependent_expr), we don't have vtables set | |
348 | up properly yet, and the value doesn't matter there either; we're just | |
349 | interested in the result of overload resolution. */ | |
350 | if (cp_unevaluated_operand != 0 | |
e0e1b357 | 351 | || in_template_function ()) |
dc555429 | 352 | { |
2bbf86a4 | 353 | expr = build_nop (ptr_target_type, expr); |
dc555429 | 354 | if (!want_pointer) |
dd865ef6 | 355 | expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL); |
dc555429 JM |
356 | return expr; |
357 | } | |
d7981fd9 | 358 | |
c65b0607 JM |
359 | /* If we're in an NSDMI, we don't have the full constructor context yet |
360 | that we need for converting to a virtual base, so just build a stub | |
361 | CONVERT_EXPR and expand it later in bot_replace. */ | |
362 | if (virtual_access && fixed_type_p < 0 | |
363 | && current_scope () != current_function_decl) | |
364 | { | |
365 | expr = build1 (CONVERT_EXPR, ptr_target_type, expr); | |
366 | CONVERT_EXPR_VBASE_PATH (expr) = true; | |
367 | if (!want_pointer) | |
368 | expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL); | |
369 | return expr; | |
370 | } | |
371 | ||
d7981fd9 | 372 | /* Do we need to check for a null pointer? */ |
0e686aa6 MM |
373 | if (want_pointer && !nonnull) |
374 | { | |
375 | /* If we know the conversion will not actually change the value | |
376 | of EXPR, then we can avoid testing the expression for NULL. | |
377 | We have to avoid generating a COMPONENT_REF for a base class | |
378 | field, because other parts of the compiler know that such | |
379 | expressions are always non-NULL. */ | |
380 | if (!virtual_access && integer_zerop (offset)) | |
2bbf86a4 | 381 | return build_nop (ptr_target_type, expr); |
0e686aa6 MM |
382 | null_test = error_mark_node; |
383 | } | |
00bfffa4 | 384 | |
d7981fd9 JM |
385 | /* Protect against multiple evaluation if necessary. */ |
386 | if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access)) | |
ca36f057 | 387 | expr = save_expr (expr); |
f2606a97 | 388 | |
d7981fd9 | 389 | /* Now that we've saved expr, build the real null test. */ |
00bfffa4 | 390 | if (null_test) |
471a58a9 | 391 | { |
4b978f96 | 392 | tree zero = cp_convert (TREE_TYPE (expr), nullptr_node, complain); |
db3927fb | 393 | null_test = fold_build2_loc (input_location, NE_EXPR, boolean_type_node, |
7866705a | 394 | expr, zero); |
471a58a9 | 395 | } |
00bfffa4 JM |
396 | |
397 | /* If this is a simple base reference, express it as a COMPONENT_REF. */ | |
d7981fd9 | 398 | if (code == PLUS_EXPR && !virtual_access |
00bfffa4 JM |
399 | /* We don't build base fields for empty bases, and they aren't very |
400 | interesting to the optimizers anyway. */ | |
401 | && !has_empty) | |
402 | { | |
a271590a | 403 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
00bfffa4 JM |
404 | expr = build_simple_base_path (expr, binfo); |
405 | if (want_pointer) | |
442c8e31 | 406 | expr = build_address (expr); |
00bfffa4 JM |
407 | target_type = TREE_TYPE (expr); |
408 | goto out; | |
409 | } | |
410 | ||
d7981fd9 | 411 | if (virtual_access) |
1a588ad7 | 412 | { |
338d90b8 | 413 | /* Going via virtual base V_BINFO. We need the static offset |
0cbd7506 MS |
414 | from V_BINFO to BINFO, and the dynamic offset from D_BINFO to |
415 | V_BINFO. That offset is an entry in D_BINFO's vtable. */ | |
1f5a253a NS |
416 | tree v_offset; |
417 | ||
418 | if (fixed_type_p < 0 && in_base_initializer) | |
419 | { | |
2acb1af9 NS |
420 | /* In a base member initializer, we cannot rely on the |
421 | vtable being set up. We have to indirect via the | |
422 | vtt_parm. */ | |
6de9cd9a DN |
423 | tree t; |
424 | ||
2acb1af9 | 425 | t = TREE_TYPE (TYPE_VFIELD (current_class_type)); |
6de9cd9a DN |
426 | t = build_pointer_type (t); |
427 | v_offset = convert (t, current_vtt_parm); | |
a271590a | 428 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
1f5a253a NS |
429 | } |
430 | else | |
dd865ef6 | 431 | v_offset = build_vfield_ref (cp_build_indirect_ref (expr, RO_NULL, |
a271590a | 432 | complain), |
1f5a253a | 433 | TREE_TYPE (TREE_TYPE (expr))); |
c8094d83 | 434 | |
5d49b6a7 | 435 | v_offset = fold_build_pointer_plus (v_offset, BINFO_VPTR_FIELD (v_binfo)); |
c8094d83 | 436 | v_offset = build1 (NOP_EXPR, |
338d90b8 NS |
437 | build_pointer_type (ptrdiff_type_node), |
438 | v_offset); | |
a271590a | 439 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
6de9cd9a | 440 | TREE_CONSTANT (v_offset) = 1; |
f63ab951 | 441 | |
7b6d72fc | 442 | offset = convert_to_integer (ptrdiff_type_node, |
db3927fb | 443 | size_diffop_loc (input_location, offset, |
7b6d72fc | 444 | BINFO_OFFSET (v_binfo))); |
8d08fdba | 445 | |
338d90b8 | 446 | if (!integer_zerop (offset)) |
f293ce4b | 447 | v_offset = build2 (code, ptrdiff_type_node, v_offset, offset); |
f2606a97 JM |
448 | |
449 | if (fixed_type_p < 0) | |
450 | /* Negative fixed_type_p means this is a constructor or destructor; | |
451 | virtual base layout is fixed in in-charge [cd]tors, but not in | |
452 | base [cd]tors. */ | |
f293ce4b RS |
453 | offset = build3 (COND_EXPR, ptrdiff_type_node, |
454 | build2 (EQ_EXPR, boolean_type_node, | |
455 | current_in_charge_parm, integer_zero_node), | |
456 | v_offset, | |
aa8f5c20 AP |
457 | convert_to_integer (ptrdiff_type_node, |
458 | BINFO_OFFSET (binfo))); | |
338d90b8 NS |
459 | else |
460 | offset = v_offset; | |
8d08fdba | 461 | } |
8d08fdba | 462 | |
338d90b8 NS |
463 | if (want_pointer) |
464 | target_type = ptr_target_type; | |
c8094d83 | 465 | |
338d90b8 | 466 | expr = build1 (NOP_EXPR, ptr_target_type, expr); |
fed3cef0 | 467 | |
338d90b8 | 468 | if (!integer_zerop (offset)) |
5be014d5 AP |
469 | { |
470 | offset = fold_convert (sizetype, offset); | |
471 | if (code == MINUS_EXPR) | |
db3927fb | 472 | offset = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, offset); |
5d49b6a7 | 473 | expr = fold_build_pointer_plus (expr, offset); |
5be014d5 | 474 | } |
8d08fdba | 475 | else |
338d90b8 | 476 | null_test = NULL; |
c8094d83 | 477 | |
338d90b8 | 478 | if (!want_pointer) |
a271590a | 479 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
8d08fdba | 480 | |
00bfffa4 | 481 | out: |
338d90b8 | 482 | if (null_test) |
db3927fb | 483 | expr = fold_build3_loc (input_location, COND_EXPR, target_type, null_test, expr, |
e8160c9a | 484 | build_zero_cst (target_type)); |
f2606a97 | 485 | |
338d90b8 | 486 | return expr; |
8d08fdba MS |
487 | } |
488 | ||
00bfffa4 JM |
489 | /* Subroutine of build_base_path; EXPR and BINFO are as in that function. |
490 | Perform a derived-to-base conversion by recursively building up a | |
491 | sequence of COMPONENT_REFs to the appropriate base fields. */ | |
492 | ||
493 | static tree | |
494 | build_simple_base_path (tree expr, tree binfo) | |
495 | { | |
496 | tree type = BINFO_TYPE (binfo); | |
fc6633e0 | 497 | tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo); |
00bfffa4 JM |
498 | tree field; |
499 | ||
00bfffa4 JM |
500 | if (d_binfo == NULL_TREE) |
501 | { | |
12a669d1 | 502 | tree temp; |
c8094d83 | 503 | |
8dc2b103 | 504 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type); |
c8094d83 | 505 | |
12a669d1 | 506 | /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' |
0cbd7506 | 507 | into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only |
3b426391 KH |
508 | an lvalue in the front end; only _DECLs and _REFs are lvalues |
509 | in the back end. */ | |
12a669d1 NS |
510 | temp = unary_complex_lvalue (ADDR_EXPR, expr); |
511 | if (temp) | |
dd865ef6 | 512 | expr = cp_build_indirect_ref (temp, RO_NULL, tf_warning_or_error); |
12a669d1 | 513 | |
00bfffa4 JM |
514 | return expr; |
515 | } | |
516 | ||
517 | /* Recurse. */ | |
518 | expr = build_simple_base_path (expr, d_binfo); | |
519 | ||
520 | for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo)); | |
910ad8de | 521 | field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
522 | /* Is this the base field created by build_base_field? */ |
523 | if (TREE_CODE (field) == FIELD_DECL | |
642124c6 | 524 | && DECL_FIELD_IS_BASE (field) |
a8c1d899 JM |
525 | && TREE_TYPE (field) == type |
526 | /* If we're looking for a field in the most-derived class, | |
527 | also check the field offset; we can have two base fields | |
528 | of the same type if one is an indirect virtual base and one | |
529 | is a direct non-virtual base. */ | |
530 | && (BINFO_INHERITANCE_CHAIN (d_binfo) | |
531 | || tree_int_cst_equal (byte_position (field), | |
532 | BINFO_OFFSET (binfo)))) | |
12a669d1 NS |
533 | { |
534 | /* We don't use build_class_member_access_expr here, as that | |
535 | has unnecessary checks, and more importantly results in | |
536 | recursive calls to dfs_walk_once. */ | |
537 | int type_quals = cp_type_quals (TREE_TYPE (expr)); | |
538 | ||
539 | expr = build3 (COMPONENT_REF, | |
540 | cp_build_qualified_type (type, type_quals), | |
541 | expr, field, NULL_TREE); | |
542 | expr = fold_if_not_in_template (expr); | |
c8094d83 | 543 | |
12a669d1 NS |
544 | /* Mark the expression const or volatile, as appropriate. |
545 | Even though we've dealt with the type above, we still have | |
546 | to mark the expression itself. */ | |
547 | if (type_quals & TYPE_QUAL_CONST) | |
548 | TREE_READONLY (expr) = 1; | |
549 | if (type_quals & TYPE_QUAL_VOLATILE) | |
550 | TREE_THIS_VOLATILE (expr) = 1; | |
c8094d83 | 551 | |
12a669d1 NS |
552 | return expr; |
553 | } | |
00bfffa4 JM |
554 | |
555 | /* Didn't find the base field?!? */ | |
8dc2b103 | 556 | gcc_unreachable (); |
00bfffa4 JM |
557 | } |
558 | ||
08e17d9d MM |
559 | /* Convert OBJECT to the base TYPE. OBJECT is an expression whose |
560 | type is a class type or a pointer to a class type. In the former | |
561 | case, TYPE is also a class type; in the latter it is another | |
562 | pointer type. If CHECK_ACCESS is true, an error message is emitted | |
563 | if TYPE is inaccessible. If OBJECT has pointer type, the value is | |
564 | assumed to be non-NULL. */ | |
50ad9642 MM |
565 | |
566 | tree | |
798ec807 JM |
567 | convert_to_base (tree object, tree type, bool check_access, bool nonnull, |
568 | tsubst_flags_t complain) | |
50ad9642 MM |
569 | { |
570 | tree binfo; | |
08e17d9d | 571 | tree object_type; |
50ad9642 | 572 | |
08e17d9d MM |
573 | if (TYPE_PTR_P (TREE_TYPE (object))) |
574 | { | |
575 | object_type = TREE_TYPE (TREE_TYPE (object)); | |
576 | type = TREE_TYPE (type); | |
577 | } | |
578 | else | |
579 | object_type = TREE_TYPE (object); | |
580 | ||
22854930 PC |
581 | binfo = lookup_base (object_type, type, check_access ? ba_check : ba_unique, |
582 | NULL, complain); | |
5bfc90de | 583 | if (!binfo || binfo == error_mark_node) |
50ad9642 MM |
584 | return error_mark_node; |
585 | ||
a271590a | 586 | return build_base_path (PLUS_EXPR, object, binfo, nonnull, complain); |
50ad9642 MM |
587 | } |
588 | ||
539ed333 NS |
589 | /* EXPR is an expression with unqualified class type. BASE is a base |
590 | binfo of that class type. Returns EXPR, converted to the BASE | |
22ed7e5f MM |
591 | type. This function assumes that EXPR is the most derived class; |
592 | therefore virtual bases can be found at their static offsets. */ | |
593 | ||
594 | tree | |
595 | convert_to_base_statically (tree expr, tree base) | |
596 | { | |
597 | tree expr_type; | |
598 | ||
599 | expr_type = TREE_TYPE (expr); | |
539ed333 | 600 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type)) |
22ed7e5f | 601 | { |
a8c1d899 JM |
602 | /* If this is a non-empty base, use a COMPONENT_REF. */ |
603 | if (!is_empty_class (BINFO_TYPE (base))) | |
604 | return build_simple_base_path (expr, base); | |
605 | ||
ffd34392 JH |
606 | /* We use fold_build2 and fold_convert below to simplify the trees |
607 | provided to the optimizers. It is not safe to call these functions | |
608 | when processing a template because they do not handle C++-specific | |
609 | trees. */ | |
610 | gcc_assert (!processing_template_decl); | |
93c0e0bb | 611 | expr = cp_build_addr_expr (expr, tf_warning_or_error); |
22ed7e5f | 612 | if (!integer_zerop (BINFO_OFFSET (base))) |
5d49b6a7 RG |
613 | expr = fold_build_pointer_plus_loc (input_location, |
614 | expr, BINFO_OFFSET (base)); | |
ffd34392 | 615 | expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr); |
db3927fb | 616 | expr = build_fold_indirect_ref_loc (input_location, expr); |
22ed7e5f MM |
617 | } |
618 | ||
619 | return expr; | |
620 | } | |
621 | ||
f8361147 | 622 | \f |
981c353e RH |
623 | tree |
624 | build_vfield_ref (tree datum, tree type) | |
625 | { | |
626 | tree vfield, vcontext; | |
627 | ||
628 | if (datum == error_mark_node) | |
629 | return error_mark_node; | |
630 | ||
981c353e RH |
631 | /* First, convert to the requested type. */ |
632 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type)) | |
08e17d9d | 633 | datum = convert_to_base (datum, type, /*check_access=*/false, |
798ec807 | 634 | /*nonnull=*/true, tf_warning_or_error); |
981c353e RH |
635 | |
636 | /* Second, the requested type may not be the owner of its own vptr. | |
637 | If not, convert to the base class that owns it. We cannot use | |
638 | convert_to_base here, because VCONTEXT may appear more than once | |
5995ebfb | 639 | in the inheritance hierarchy of TYPE, and thus direct conversion |
981c353e RH |
640 | between the types may be ambiguous. Following the path back up |
641 | one step at a time via primary bases avoids the problem. */ | |
642 | vfield = TYPE_VFIELD (type); | |
643 | vcontext = DECL_CONTEXT (vfield); | |
644 | while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type)) | |
645 | { | |
646 | datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type)); | |
647 | type = TREE_TYPE (datum); | |
648 | } | |
649 | ||
650 | return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE); | |
651 | } | |
652 | ||
8d08fdba | 653 | /* Given an object INSTANCE, return an expression which yields the |
67231816 RH |
654 | vtable element corresponding to INDEX. There are many special |
655 | cases for INSTANCE which we take care of here, mainly to avoid | |
656 | creating extra tree nodes when we don't have to. */ | |
e92cc029 | 657 | |
4a8d0c9c | 658 | static tree |
94edc4ab | 659 | build_vtbl_ref_1 (tree instance, tree idx) |
8d08fdba | 660 | { |
f63ab951 JM |
661 | tree aref; |
662 | tree vtbl = NULL_TREE; | |
8d08fdba | 663 | |
f63ab951 JM |
664 | /* Try to figure out what a reference refers to, and |
665 | access its virtual function table directly. */ | |
666 | ||
667 | int cdtorp = 0; | |
668 | tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp); | |
669 | ||
ee76b931 | 670 | tree basetype = non_reference (TREE_TYPE (instance)); |
8d08fdba | 671 | |
f63ab951 | 672 | if (fixed_type && !cdtorp) |
8d08fdba | 673 | { |
f63ab951 | 674 | tree binfo = lookup_base (fixed_type, basetype, |
22854930 PC |
675 | ba_unique, NULL, tf_none); |
676 | if (binfo && binfo != error_mark_node) | |
6de9cd9a | 677 | vtbl = unshare_expr (BINFO_VTABLE (binfo)); |
f63ab951 | 678 | } |
8d08fdba | 679 | |
f63ab951 | 680 | if (!vtbl) |
dbbf88d1 | 681 | vtbl = build_vfield_ref (instance, basetype); |
c8094d83 | 682 | |
3a11c665 | 683 | aref = build_array_ref (input_location, vtbl, idx); |
6de9cd9a | 684 | TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx); |
8d08fdba | 685 | |
c4372ef4 | 686 | return aref; |
8d08fdba MS |
687 | } |
688 | ||
4a8d0c9c | 689 | tree |
94edc4ab | 690 | build_vtbl_ref (tree instance, tree idx) |
4a8d0c9c RH |
691 | { |
692 | tree aref = build_vtbl_ref_1 (instance, idx); | |
693 | ||
4a8d0c9c RH |
694 | return aref; |
695 | } | |
696 | ||
0f59171d RH |
697 | /* Given a stable object pointer INSTANCE_PTR, return an expression which |
698 | yields a function pointer corresponding to vtable element INDEX. */ | |
67231816 RH |
699 | |
700 | tree | |
0f59171d | 701 | build_vfn_ref (tree instance_ptr, tree idx) |
67231816 | 702 | { |
0f59171d RH |
703 | tree aref; |
704 | ||
dd865ef6 | 705 | aref = build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr, RO_NULL, |
5ade1ed2 DG |
706 | tf_warning_or_error), |
707 | idx); | |
67231816 RH |
708 | |
709 | /* When using function descriptors, the address of the | |
710 | vtable entry is treated as a function pointer. */ | |
711 | if (TARGET_VTABLE_USES_DESCRIPTORS) | |
4a8d0c9c | 712 | aref = build1 (NOP_EXPR, TREE_TYPE (aref), |
93c0e0bb | 713 | cp_build_addr_expr (aref, tf_warning_or_error)); |
67231816 | 714 | |
0f59171d | 715 | /* Remember this as a method reference, for later devirtualization. */ |
f293ce4b | 716 | aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx); |
0f59171d | 717 | |
67231816 RH |
718 | return aref; |
719 | } | |
720 | ||
669ec2b4 JM |
721 | /* Return the name of the virtual function table (as an IDENTIFIER_NODE) |
722 | for the given TYPE. */ | |
723 | ||
724 | static tree | |
94edc4ab | 725 | get_vtable_name (tree type) |
669ec2b4 | 726 | { |
1f84ec23 | 727 | return mangle_vtbl_for_type (type); |
669ec2b4 JM |
728 | } |
729 | ||
4684cd27 MM |
730 | /* DECL is an entity associated with TYPE, like a virtual table or an |
731 | implicitly generated constructor. Determine whether or not DECL | |
732 | should have external or internal linkage at the object file | |
733 | level. This routine does not deal with COMDAT linkage and other | |
734 | similar complexities; it simply sets TREE_PUBLIC if it possible for | |
735 | entities in other translation units to contain copies of DECL, in | |
736 | the abstract. */ | |
737 | ||
738 | void | |
12308bc6 | 739 | set_linkage_according_to_type (tree /*type*/, tree decl) |
4684cd27 | 740 | { |
012d5d25 JM |
741 | TREE_PUBLIC (decl) = 1; |
742 | determine_visibility (decl); | |
4684cd27 MM |
743 | } |
744 | ||
459c43ad MM |
745 | /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE. |
746 | (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.) | |
747 | Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */ | |
b9f39201 MM |
748 | |
749 | static tree | |
94edc4ab | 750 | build_vtable (tree class_type, tree name, tree vtable_type) |
b9f39201 MM |
751 | { |
752 | tree decl; | |
753 | ||
754 | decl = build_lang_decl (VAR_DECL, name, vtable_type); | |
90ecce3e JM |
755 | /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME |
756 | now to avoid confusion in mangle_decl. */ | |
757 | SET_DECL_ASSEMBLER_NAME (decl, name); | |
b9f39201 MM |
758 | DECL_CONTEXT (decl) = class_type; |
759 | DECL_ARTIFICIAL (decl) = 1; | |
760 | TREE_STATIC (decl) = 1; | |
b9f39201 | 761 | TREE_READONLY (decl) = 1; |
b9f39201 | 762 | DECL_VIRTUAL_P (decl) = 1; |
a6f5e048 | 763 | DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN; |
d35543c0 | 764 | DECL_VTABLE_OR_VTT_P (decl) = 1; |
78d55cc8 JM |
765 | /* At one time the vtable info was grabbed 2 words at a time. This |
766 | fails on sparc unless you have 8-byte alignment. (tiemann) */ | |
767 | DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node), | |
768 | DECL_ALIGN (decl)); | |
4684cd27 MM |
769 | set_linkage_according_to_type (class_type, decl); |
770 | /* The vtable has not been defined -- yet. */ | |
771 | DECL_EXTERNAL (decl) = 1; | |
772 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
773 | ||
78e0d62b RH |
774 | /* Mark the VAR_DECL node representing the vtable itself as a |
775 | "gratuitous" one, thereby forcing dwarfout.c to ignore it. It | |
776 | is rather important that such things be ignored because any | |
777 | effort to actually generate DWARF for them will run into | |
778 | trouble when/if we encounter code like: | |
c8094d83 | 779 | |
78e0d62b RH |
780 | #pragma interface |
781 | struct S { virtual void member (); }; | |
c8094d83 | 782 | |
78e0d62b RH |
783 | because the artificial declaration of the vtable itself (as |
784 | manufactured by the g++ front end) will say that the vtable is | |
785 | a static member of `S' but only *after* the debug output for | |
786 | the definition of `S' has already been output. This causes | |
787 | grief because the DWARF entry for the definition of the vtable | |
788 | will try to refer back to an earlier *declaration* of the | |
789 | vtable as a static member of `S' and there won't be one. We | |
790 | might be able to arrange to have the "vtable static member" | |
791 | attached to the member list for `S' before the debug info for | |
792 | `S' get written (which would solve the problem) but that would | |
793 | require more intrusive changes to the g++ front end. */ | |
794 | DECL_IGNORED_P (decl) = 1; | |
78d55cc8 | 795 | |
b9f39201 MM |
796 | return decl; |
797 | } | |
798 | ||
1aa4ccd4 NS |
799 | /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic, |
800 | or even complete. If this does not exist, create it. If COMPLETE is | |
838dfd8a | 801 | nonzero, then complete the definition of it -- that will render it |
1aa4ccd4 NS |
802 | impossible to actually build the vtable, but is useful to get at those |
803 | which are known to exist in the runtime. */ | |
804 | ||
c8094d83 | 805 | tree |
94edc4ab | 806 | get_vtable_decl (tree type, int complete) |
1aa4ccd4 | 807 | { |
548502d3 MM |
808 | tree decl; |
809 | ||
810 | if (CLASSTYPE_VTABLES (type)) | |
811 | return CLASSTYPE_VTABLES (type); | |
c8094d83 | 812 | |
d1a74aa7 | 813 | decl = build_vtable (type, get_vtable_name (type), vtbl_type_node); |
548502d3 MM |
814 | CLASSTYPE_VTABLES (type) = decl; |
815 | ||
1aa4ccd4 | 816 | if (complete) |
217f4eb9 MM |
817 | { |
818 | DECL_EXTERNAL (decl) = 1; | |
3600f678 | 819 | cp_finish_decl (decl, NULL_TREE, false, NULL_TREE, 0); |
217f4eb9 | 820 | } |
1aa4ccd4 | 821 | |
1aa4ccd4 NS |
822 | return decl; |
823 | } | |
824 | ||
28531dd0 MM |
825 | /* Build the primary virtual function table for TYPE. If BINFO is |
826 | non-NULL, build the vtable starting with the initial approximation | |
827 | that it is the same as the one which is the head of the association | |
838dfd8a | 828 | list. Returns a nonzero value if a new vtable is actually |
28531dd0 | 829 | created. */ |
e92cc029 | 830 | |
28531dd0 | 831 | static int |
94edc4ab | 832 | build_primary_vtable (tree binfo, tree type) |
8d08fdba | 833 | { |
31f8e4f3 MM |
834 | tree decl; |
835 | tree virtuals; | |
8d08fdba | 836 | |
1aa4ccd4 | 837 | decl = get_vtable_decl (type, /*complete=*/0); |
c8094d83 | 838 | |
8d08fdba MS |
839 | if (binfo) |
840 | { | |
dbbf88d1 | 841 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
842 | /* We have already created a vtable for this base, so there's |
843 | no need to do it again. */ | |
28531dd0 | 844 | return 0; |
c8094d83 | 845 | |
d1f05f93 | 846 | virtuals = copy_list (BINFO_VIRTUALS (binfo)); |
c35cce41 MM |
847 | TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo)); |
848 | DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl)); | |
849 | DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl)); | |
8d08fdba MS |
850 | } |
851 | else | |
852 | { | |
50bc768d | 853 | gcc_assert (TREE_TYPE (decl) == vtbl_type_node); |
8d08fdba | 854 | virtuals = NULL_TREE; |
8d08fdba MS |
855 | } |
856 | ||
7aa6d18a SB |
857 | if (GATHER_STATISTICS) |
858 | { | |
859 | n_vtables += 1; | |
860 | n_vtable_elems += list_length (virtuals); | |
861 | } | |
8d08fdba | 862 | |
8d08fdba MS |
863 | /* Initialize the association list for this type, based |
864 | on our first approximation. */ | |
604a3205 NS |
865 | BINFO_VTABLE (TYPE_BINFO (type)) = decl; |
866 | BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals; | |
dbbf88d1 | 867 | SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type)); |
28531dd0 | 868 | return 1; |
8d08fdba MS |
869 | } |
870 | ||
3461fba7 | 871 | /* Give BINFO a new virtual function table which is initialized |
8d08fdba MS |
872 | with a skeleton-copy of its original initialization. The only |
873 | entry that changes is the `delta' entry, so we can really | |
874 | share a lot of structure. | |
875 | ||
3461fba7 | 876 | FOR_TYPE is the most derived type which caused this table to |
8d08fdba MS |
877 | be needed. |
878 | ||
838dfd8a | 879 | Returns nonzero if we haven't met BINFO before. |
2636fde4 JM |
880 | |
881 | The order in which vtables are built (by calling this function) for | |
882 | an object must remain the same, otherwise a binary incompatibility | |
883 | can result. */ | |
e92cc029 | 884 | |
28531dd0 | 885 | static int |
dbbf88d1 | 886 | build_secondary_vtable (tree binfo) |
8d08fdba | 887 | { |
dbbf88d1 | 888 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
889 | /* We already created a vtable for this base. There's no need to |
890 | do it again. */ | |
28531dd0 | 891 | return 0; |
0533d788 | 892 | |
8d7a5379 MM |
893 | /* Remember that we've created a vtable for this BINFO, so that we |
894 | don't try to do so again. */ | |
dbbf88d1 | 895 | SET_BINFO_NEW_VTABLE_MARKED (binfo); |
c8094d83 | 896 | |
8d7a5379 | 897 | /* Make fresh virtual list, so we can smash it later. */ |
d1f05f93 | 898 | BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo)); |
8d7a5379 | 899 | |
3461fba7 NS |
900 | /* Secondary vtables are laid out as part of the same structure as |
901 | the primary vtable. */ | |
902 | BINFO_VTABLE (binfo) = NULL_TREE; | |
28531dd0 | 903 | return 1; |
8d08fdba MS |
904 | } |
905 | ||
28531dd0 | 906 | /* Create a new vtable for BINFO which is the hierarchy dominated by |
838dfd8a | 907 | T. Return nonzero if we actually created a new vtable. */ |
28531dd0 MM |
908 | |
909 | static int | |
94edc4ab | 910 | make_new_vtable (tree t, tree binfo) |
28531dd0 MM |
911 | { |
912 | if (binfo == TYPE_BINFO (t)) | |
913 | /* In this case, it is *type*'s vtable we are modifying. We start | |
d0cd8b44 | 914 | with the approximation that its vtable is that of the |
28531dd0 | 915 | immediate base class. */ |
981c353e | 916 | return build_primary_vtable (binfo, t); |
28531dd0 MM |
917 | else |
918 | /* This is our very own copy of `basetype' to play with. Later, | |
919 | we will fill in all the virtual functions that override the | |
920 | virtual functions in these base classes which are not defined | |
921 | by the current type. */ | |
dbbf88d1 | 922 | return build_secondary_vtable (binfo); |
28531dd0 MM |
923 | } |
924 | ||
925 | /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO | |
926 | (which is in the hierarchy dominated by T) list FNDECL as its | |
4e7512c9 MM |
927 | BV_FN. DELTA is the required constant adjustment from the `this' |
928 | pointer where the vtable entry appears to the `this' required when | |
929 | the function is actually called. */ | |
8d08fdba MS |
930 | |
931 | static void | |
94edc4ab | 932 | modify_vtable_entry (tree t, |
0cbd7506 MS |
933 | tree binfo, |
934 | tree fndecl, | |
935 | tree delta, | |
936 | tree *virtuals) | |
8d08fdba | 937 | { |
28531dd0 | 938 | tree v; |
c0bbf652 | 939 | |
28531dd0 | 940 | v = *virtuals; |
c0bbf652 | 941 | |
5e19c053 | 942 | if (fndecl != BV_FN (v) |
4e7512c9 | 943 | || !tree_int_cst_equal (delta, BV_DELTA (v))) |
c0bbf652 | 944 | { |
28531dd0 MM |
945 | /* We need a new vtable for BINFO. */ |
946 | if (make_new_vtable (t, binfo)) | |
947 | { | |
948 | /* If we really did make a new vtable, we also made a copy | |
949 | of the BINFO_VIRTUALS list. Now, we have to find the | |
950 | corresponding entry in that list. */ | |
951 | *virtuals = BINFO_VIRTUALS (binfo); | |
5e19c053 | 952 | while (BV_FN (*virtuals) != BV_FN (v)) |
28531dd0 MM |
953 | *virtuals = TREE_CHAIN (*virtuals); |
954 | v = *virtuals; | |
955 | } | |
8d08fdba | 956 | |
5e19c053 | 957 | BV_DELTA (v) = delta; |
aabb4cd6 | 958 | BV_VCALL_INDEX (v) = NULL_TREE; |
5e19c053 | 959 | BV_FN (v) = fndecl; |
8d08fdba | 960 | } |
8d08fdba MS |
961 | } |
962 | ||
8d08fdba | 963 | \f |
b2a9b208 | 964 | /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is |
b77fe7b4 NS |
965 | the USING_DECL naming METHOD. Returns true if the method could be |
966 | added to the method vec. */ | |
e92cc029 | 967 | |
b77fe7b4 | 968 | bool |
b2a9b208 | 969 | add_method (tree type, tree method, tree using_decl) |
8d08fdba | 970 | { |
9ba5ff0f | 971 | unsigned slot; |
90ea9897 | 972 | tree overload; |
b54a07e8 NS |
973 | bool template_conv_p = false; |
974 | bool conv_p; | |
9771b263 | 975 | vec<tree, va_gc> *method_vec; |
aaaa46d2 | 976 | bool complete_p; |
9ba5ff0f NS |
977 | bool insert_p = false; |
978 | tree current_fns; | |
fc40d49c | 979 | tree fns; |
ac2b3222 AP |
980 | |
981 | if (method == error_mark_node) | |
b77fe7b4 | 982 | return false; |
aaaa46d2 MM |
983 | |
984 | complete_p = COMPLETE_TYPE_P (type); | |
b54a07e8 NS |
985 | conv_p = DECL_CONV_FN_P (method); |
986 | if (conv_p) | |
987 | template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL | |
988 | && DECL_TEMPLATE_CONV_FN_P (method)); | |
452a394b | 989 | |
452a394b | 990 | method_vec = CLASSTYPE_METHOD_VEC (type); |
aaaa46d2 MM |
991 | if (!method_vec) |
992 | { | |
993 | /* Make a new method vector. We start with 8 entries. We must | |
994 | allocate at least two (for constructors and destructors), and | |
995 | we're going to end up with an assignment operator at some | |
996 | point as well. */ | |
9771b263 | 997 | vec_alloc (method_vec, 8); |
aaaa46d2 | 998 | /* Create slots for constructors and destructors. */ |
9771b263 DN |
999 | method_vec->quick_push (NULL_TREE); |
1000 | method_vec->quick_push (NULL_TREE); | |
aaaa46d2 MM |
1001 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
1002 | } | |
1003 | ||
0fcedd9c | 1004 | /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */ |
7137605e MM |
1005 | grok_special_member_properties (method); |
1006 | ||
452a394b MM |
1007 | /* Constructors and destructors go in special slots. */ |
1008 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method)) | |
1009 | slot = CLASSTYPE_CONSTRUCTOR_SLOT; | |
1010 | else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) | |
4b0d3cbe MM |
1011 | { |
1012 | slot = CLASSTYPE_DESTRUCTOR_SLOT; | |
c8094d83 | 1013 | |
f5c28a15 | 1014 | if (TYPE_FOR_JAVA (type)) |
9f4faeae MM |
1015 | { |
1016 | if (!DECL_ARTIFICIAL (method)) | |
1017 | error ("Java class %qT cannot have a destructor", type); | |
1018 | else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
1019 | error ("Java class %qT cannot have an implicit non-trivial " | |
1020 | "destructor", | |
1021 | type); | |
1022 | } | |
4b0d3cbe | 1023 | } |
452a394b | 1024 | else |
61a127b3 | 1025 | { |
aaaa46d2 MM |
1026 | tree m; |
1027 | ||
9ba5ff0f | 1028 | insert_p = true; |
452a394b | 1029 | /* See if we already have an entry with this name. */ |
c8094d83 | 1030 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 1031 | vec_safe_iterate (method_vec, slot, &m); |
aaaa46d2 | 1032 | ++slot) |
5dd236e2 | 1033 | { |
5dd236e2 | 1034 | m = OVL_CURRENT (m); |
5dd236e2 NS |
1035 | if (template_conv_p) |
1036 | { | |
aaaa46d2 MM |
1037 | if (TREE_CODE (m) == TEMPLATE_DECL |
1038 | && DECL_TEMPLATE_CONV_FN_P (m)) | |
1039 | insert_p = false; | |
5dd236e2 NS |
1040 | break; |
1041 | } | |
aaaa46d2 | 1042 | if (conv_p && !DECL_CONV_FN_P (m)) |
5dd236e2 | 1043 | break; |
aaaa46d2 | 1044 | if (DECL_NAME (m) == DECL_NAME (method)) |
452a394b | 1045 | { |
aaaa46d2 MM |
1046 | insert_p = false; |
1047 | break; | |
8d08fdba | 1048 | } |
aaaa46d2 MM |
1049 | if (complete_p |
1050 | && !DECL_CONV_FN_P (m) | |
1051 | && DECL_NAME (m) > DECL_NAME (method)) | |
1052 | break; | |
61a127b3 | 1053 | } |
452a394b | 1054 | } |
9771b263 | 1055 | current_fns = insert_p ? NULL_TREE : (*method_vec)[slot]; |
c8094d83 | 1056 | |
fc40d49c LM |
1057 | /* Check to see if we've already got this method. */ |
1058 | for (fns = current_fns; fns; fns = OVL_NEXT (fns)) | |
452a394b | 1059 | { |
fc40d49c LM |
1060 | tree fn = OVL_CURRENT (fns); |
1061 | tree fn_type; | |
1062 | tree method_type; | |
1063 | tree parms1; | |
1064 | tree parms2; | |
1065 | ||
1066 | if (TREE_CODE (fn) != TREE_CODE (method)) | |
1067 | continue; | |
1068 | ||
1069 | /* [over.load] Member function declarations with the | |
1070 | same name and the same parameter types cannot be | |
1071 | overloaded if any of them is a static member | |
1072 | function declaration. | |
1073 | ||
2eed8e37 BK |
1074 | [over.load] Member function declarations with the same name and |
1075 | the same parameter-type-list as well as member function template | |
1076 | declarations with the same name, the same parameter-type-list, and | |
1077 | the same template parameter lists cannot be overloaded if any of | |
1078 | them, but not all, have a ref-qualifier. | |
1079 | ||
fc40d49c LM |
1080 | [namespace.udecl] When a using-declaration brings names |
1081 | from a base class into a derived class scope, member | |
1082 | functions in the derived class override and/or hide member | |
1083 | functions with the same name and parameter types in a base | |
1084 | class (rather than conflicting). */ | |
1085 | fn_type = TREE_TYPE (fn); | |
1086 | method_type = TREE_TYPE (method); | |
1087 | parms1 = TYPE_ARG_TYPES (fn_type); | |
1088 | parms2 = TYPE_ARG_TYPES (method_type); | |
1089 | ||
1090 | /* Compare the quals on the 'this' parm. Don't compare | |
1091 | the whole types, as used functions are treated as | |
1092 | coming from the using class in overload resolution. */ | |
1093 | if (! DECL_STATIC_FUNCTION_P (fn) | |
1094 | && ! DECL_STATIC_FUNCTION_P (method) | |
2eed8e37 BK |
1095 | /* Either both or neither need to be ref-qualified for |
1096 | differing quals to allow overloading. */ | |
1097 | && (FUNCTION_REF_QUALIFIED (fn_type) | |
1098 | == FUNCTION_REF_QUALIFIED (method_type)) | |
1099 | && (type_memfn_quals (fn_type) != type_memfn_quals (method_type) | |
1100 | || type_memfn_rqual (fn_type) != type_memfn_rqual (method_type))) | |
1101 | continue; | |
fc40d49c LM |
1102 | |
1103 | /* For templates, the return type and template parameters | |
1104 | must be identical. */ | |
1105 | if (TREE_CODE (fn) == TEMPLATE_DECL | |
1106 | && (!same_type_p (TREE_TYPE (fn_type), | |
1107 | TREE_TYPE (method_type)) | |
1108 | || !comp_template_parms (DECL_TEMPLATE_PARMS (fn), | |
1109 | DECL_TEMPLATE_PARMS (method)))) | |
1110 | continue; | |
1111 | ||
1112 | if (! DECL_STATIC_FUNCTION_P (fn)) | |
1113 | parms1 = TREE_CHAIN (parms1); | |
1114 | if (! DECL_STATIC_FUNCTION_P (method)) | |
1115 | parms2 = TREE_CHAIN (parms2); | |
1116 | ||
1117 | if (compparms (parms1, parms2) | |
1118 | && (!DECL_CONV_FN_P (fn) | |
1119 | || same_type_p (TREE_TYPE (fn_type), | |
1120 | TREE_TYPE (method_type)))) | |
452a394b | 1121 | { |
3649b9b7 ST |
1122 | /* For function versions, their parms and types match |
1123 | but they are not duplicates. Record function versions | |
1124 | as and when they are found. extern "C" functions are | |
1125 | not treated as versions. */ | |
1126 | if (TREE_CODE (fn) == FUNCTION_DECL | |
1127 | && TREE_CODE (method) == FUNCTION_DECL | |
1128 | && !DECL_EXTERN_C_P (fn) | |
1129 | && !DECL_EXTERN_C_P (method) | |
3649b9b7 ST |
1130 | && targetm.target_option.function_versions (fn, method)) |
1131 | { | |
1132 | /* Mark functions as versions if necessary. Modify the mangled | |
1133 | decl name if necessary. */ | |
1134 | if (!DECL_FUNCTION_VERSIONED (fn)) | |
1135 | { | |
1136 | DECL_FUNCTION_VERSIONED (fn) = 1; | |
1137 | if (DECL_ASSEMBLER_NAME_SET_P (fn)) | |
1138 | mangle_decl (fn); | |
1139 | } | |
1140 | if (!DECL_FUNCTION_VERSIONED (method)) | |
1141 | { | |
1142 | DECL_FUNCTION_VERSIONED (method) = 1; | |
1143 | if (DECL_ASSEMBLER_NAME_SET_P (method)) | |
1144 | mangle_decl (method); | |
1145 | } | |
1146 | record_function_versions (fn, method); | |
1147 | continue; | |
1148 | } | |
85b5d65a JM |
1149 | if (DECL_INHERITED_CTOR_BASE (method)) |
1150 | { | |
1151 | if (DECL_INHERITED_CTOR_BASE (fn)) | |
1152 | { | |
1153 | error_at (DECL_SOURCE_LOCATION (method), | |
1154 | "%q#D inherited from %qT", method, | |
1155 | DECL_INHERITED_CTOR_BASE (method)); | |
1156 | error_at (DECL_SOURCE_LOCATION (fn), | |
1157 | "conflicts with version inherited from %qT", | |
1158 | DECL_INHERITED_CTOR_BASE (fn)); | |
1159 | } | |
1160 | /* Otherwise defer to the other function. */ | |
1161 | return false; | |
1162 | } | |
fc40d49c | 1163 | if (using_decl) |
452a394b | 1164 | { |
fc40d49c LM |
1165 | if (DECL_CONTEXT (fn) == type) |
1166 | /* Defer to the local function. */ | |
1167 | return false; | |
452a394b | 1168 | } |
fc40d49c LM |
1169 | else |
1170 | { | |
1171 | error ("%q+#D cannot be overloaded", method); | |
1172 | error ("with %q+#D", fn); | |
1173 | } | |
1174 | ||
1175 | /* We don't call duplicate_decls here to merge the | |
1176 | declarations because that will confuse things if the | |
1177 | methods have inline definitions. In particular, we | |
1178 | will crash while processing the definitions. */ | |
1179 | return false; | |
03017874 | 1180 | } |
452a394b | 1181 | } |
03017874 | 1182 | |
3db45ab5 | 1183 | /* A class should never have more than one destructor. */ |
357d956e MM |
1184 | if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) |
1185 | return false; | |
1186 | ||
c8094d83 | 1187 | /* Add the new binding. */ |
57910f3a JM |
1188 | if (using_decl) |
1189 | { | |
1190 | overload = ovl_cons (method, current_fns); | |
1191 | OVL_USED (overload) = true; | |
1192 | } | |
1193 | else | |
1194 | overload = build_overload (method, current_fns); | |
c8094d83 | 1195 | |
357d956e MM |
1196 | if (conv_p) |
1197 | TYPE_HAS_CONVERSION (type) = 1; | |
1198 | else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p) | |
90ea9897 MM |
1199 | push_class_level_binding (DECL_NAME (method), overload); |
1200 | ||
9ba5ff0f NS |
1201 | if (insert_p) |
1202 | { | |
efb7e1e0 ILT |
1203 | bool reallocated; |
1204 | ||
9ba5ff0f NS |
1205 | /* We only expect to add few methods in the COMPLETE_P case, so |
1206 | just make room for one more method in that case. */ | |
efb7e1e0 | 1207 | if (complete_p) |
9771b263 | 1208 | reallocated = vec_safe_reserve_exact (method_vec, 1); |
efb7e1e0 | 1209 | else |
9771b263 | 1210 | reallocated = vec_safe_reserve (method_vec, 1); |
efb7e1e0 | 1211 | if (reallocated) |
9ba5ff0f | 1212 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
9771b263 DN |
1213 | if (slot == method_vec->length ()) |
1214 | method_vec->quick_push (overload); | |
9ba5ff0f | 1215 | else |
9771b263 | 1216 | method_vec->quick_insert (slot, overload); |
9ba5ff0f NS |
1217 | } |
1218 | else | |
03fd3f84 | 1219 | /* Replace the current slot. */ |
9771b263 | 1220 | (*method_vec)[slot] = overload; |
b77fe7b4 | 1221 | return true; |
8d08fdba MS |
1222 | } |
1223 | ||
1224 | /* Subroutines of finish_struct. */ | |
1225 | ||
aa52c1ff JM |
1226 | /* Change the access of FDECL to ACCESS in T. Return 1 if change was |
1227 | legit, otherwise return 0. */ | |
e92cc029 | 1228 | |
8d08fdba | 1229 | static int |
94edc4ab | 1230 | alter_access (tree t, tree fdecl, tree access) |
8d08fdba | 1231 | { |
721c3b42 MM |
1232 | tree elem; |
1233 | ||
1234 | if (!DECL_LANG_SPECIFIC (fdecl)) | |
1235 | retrofit_lang_decl (fdecl); | |
1236 | ||
50bc768d | 1237 | gcc_assert (!DECL_DISCRIMINATOR_P (fdecl)); |
8e4ce833 | 1238 | |
721c3b42 | 1239 | elem = purpose_member (t, DECL_ACCESS (fdecl)); |
38afd588 | 1240 | if (elem) |
8d08fdba | 1241 | { |
38afd588 | 1242 | if (TREE_VALUE (elem) != access) |
8d08fdba | 1243 | { |
38afd588 | 1244 | if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL) |
dee15844 JM |
1245 | error ("conflicting access specifications for method" |
1246 | " %q+D, ignored", TREE_TYPE (fdecl)); | |
38afd588 | 1247 | else |
1f070f2b | 1248 | error ("conflicting access specifications for field %qE, ignored", |
4460cef2 | 1249 | DECL_NAME (fdecl)); |
8d08fdba MS |
1250 | } |
1251 | else | |
430bb96b JL |
1252 | { |
1253 | /* They're changing the access to the same thing they changed | |
1254 | it to before. That's OK. */ | |
1255 | ; | |
1256 | } | |
db5ae43f | 1257 | } |
38afd588 | 1258 | else |
8d08fdba | 1259 | { |
0e69fdf0 PC |
1260 | perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl, |
1261 | tf_warning_or_error); | |
be99da77 | 1262 | DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl)); |
8d08fdba MS |
1263 | return 1; |
1264 | } | |
1265 | return 0; | |
1266 | } | |
1267 | ||
58010b57 | 1268 | /* Process the USING_DECL, which is a member of T. */ |
79ad62b2 | 1269 | |
e9659ab0 | 1270 | static void |
94edc4ab | 1271 | handle_using_decl (tree using_decl, tree t) |
79ad62b2 | 1272 | { |
98ed9dae | 1273 | tree decl = USING_DECL_DECLS (using_decl); |
79ad62b2 MM |
1274 | tree name = DECL_NAME (using_decl); |
1275 | tree access | |
1276 | = TREE_PRIVATE (using_decl) ? access_private_node | |
1277 | : TREE_PROTECTED (using_decl) ? access_protected_node | |
1278 | : access_public_node; | |
79ad62b2 | 1279 | tree flist = NULL_TREE; |
aa52c1ff | 1280 | tree old_value; |
79ad62b2 | 1281 | |
98ed9dae | 1282 | gcc_assert (!processing_template_decl && decl); |
c8094d83 | 1283 | |
db422ace PC |
1284 | old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false, |
1285 | tf_warning_or_error); | |
aa52c1ff | 1286 | if (old_value) |
79ad62b2 | 1287 | { |
aa52c1ff JM |
1288 | if (is_overloaded_fn (old_value)) |
1289 | old_value = OVL_CURRENT (old_value); | |
1290 | ||
1291 | if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t) | |
1292 | /* OK */; | |
1293 | else | |
1294 | old_value = NULL_TREE; | |
79ad62b2 | 1295 | } |
c8094d83 | 1296 | |
6e976965 | 1297 | cp_emit_debug_info_for_using (decl, USING_DECL_SCOPE (using_decl)); |
c8094d83 | 1298 | |
98ed9dae NS |
1299 | if (is_overloaded_fn (decl)) |
1300 | flist = decl; | |
aa52c1ff JM |
1301 | |
1302 | if (! old_value) | |
1303 | ; | |
1304 | else if (is_overloaded_fn (old_value)) | |
79ad62b2 | 1305 | { |
aa52c1ff JM |
1306 | if (flist) |
1307 | /* It's OK to use functions from a base when there are functions with | |
1308 | the same name already present in the current class. */; | |
1309 | else | |
79ad62b2 | 1310 | { |
dee15844 JM |
1311 | error ("%q+D invalid in %q#T", using_decl, t); |
1312 | error (" because of local method %q+#D with same name", | |
1313 | OVL_CURRENT (old_value)); | |
aa52c1ff | 1314 | return; |
79ad62b2 MM |
1315 | } |
1316 | } | |
186c0fbe | 1317 | else if (!DECL_ARTIFICIAL (old_value)) |
aa52c1ff | 1318 | { |
dee15844 JM |
1319 | error ("%q+D invalid in %q#T", using_decl, t); |
1320 | error (" because of local member %q+#D with same name", old_value); | |
aa52c1ff JM |
1321 | return; |
1322 | } | |
c8094d83 | 1323 | |
f4f206f4 | 1324 | /* Make type T see field decl FDECL with access ACCESS. */ |
aa52c1ff JM |
1325 | if (flist) |
1326 | for (; flist; flist = OVL_NEXT (flist)) | |
1327 | { | |
b2a9b208 | 1328 | add_method (t, OVL_CURRENT (flist), using_decl); |
aa52c1ff JM |
1329 | alter_access (t, OVL_CURRENT (flist), access); |
1330 | } | |
1331 | else | |
98ed9dae | 1332 | alter_access (t, decl, access); |
79ad62b2 | 1333 | } |
8d08fdba | 1334 | \f |
7dbb85a7 JM |
1335 | /* walk_tree callback for check_abi_tags: if the type at *TP involves any |
1336 | types with abi tags, add the corresponding identifiers to the VEC in | |
1337 | *DATA and set IDENTIFIER_MARKED. */ | |
1338 | ||
1339 | struct abi_tag_data | |
1340 | { | |
1341 | tree t; | |
1342 | tree subob; | |
f585f02f JM |
1343 | // error_mark_node to get diagnostics; otherwise collect missing tags here |
1344 | tree tags; | |
7dbb85a7 JM |
1345 | }; |
1346 | ||
1347 | static tree | |
f585f02f | 1348 | find_abi_tags_r (tree *tp, int *walk_subtrees, void *data) |
7dbb85a7 | 1349 | { |
73243d63 | 1350 | if (!OVERLOAD_TYPE_P (*tp)) |
7dbb85a7 JM |
1351 | return NULL_TREE; |
1352 | ||
f585f02f JM |
1353 | /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE |
1354 | anyway, but let's make sure of it. */ | |
1355 | *walk_subtrees = false; | |
1356 | ||
7dbb85a7 JM |
1357 | if (tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp))) |
1358 | { | |
1359 | struct abi_tag_data *p = static_cast<struct abi_tag_data*>(data); | |
1360 | for (tree list = TREE_VALUE (attributes); list; | |
1361 | list = TREE_CHAIN (list)) | |
1362 | { | |
1363 | tree tag = TREE_VALUE (list); | |
1364 | tree id = get_identifier (TREE_STRING_POINTER (tag)); | |
1365 | if (!IDENTIFIER_MARKED (id)) | |
1366 | { | |
f585f02f JM |
1367 | if (p->tags != error_mark_node) |
1368 | { | |
1369 | /* We're collecting tags from template arguments. */ | |
1370 | tree str = build_string (IDENTIFIER_LENGTH (id), | |
1371 | IDENTIFIER_POINTER (id)); | |
1372 | p->tags = tree_cons (NULL_TREE, str, p->tags); | |
1373 | ABI_TAG_IMPLICIT (p->tags) = true; | |
1374 | ||
1375 | /* Don't inherit this tag multiple times. */ | |
1376 | IDENTIFIER_MARKED (id) = true; | |
1377 | } | |
1378 | ||
1379 | /* Otherwise we're diagnosing missing tags. */ | |
1380 | else if (TYPE_P (p->subob)) | |
7dbb85a7 JM |
1381 | { |
1382 | warning (OPT_Wabi_tag, "%qT does not have the %E abi tag " | |
1383 | "that base %qT has", p->t, tag, p->subob); | |
1384 | inform (location_of (p->subob), "%qT declared here", | |
1385 | p->subob); | |
1386 | } | |
1387 | else | |
1388 | { | |
1389 | warning (OPT_Wabi_tag, "%qT does not have the %E abi tag " | |
1390 | "that %qT (used in the type of %qD) has", | |
1391 | p->t, tag, *tp, p->subob); | |
1392 | inform (location_of (p->subob), "%qD declared here", | |
1393 | p->subob); | |
1394 | inform (location_of (*tp), "%qT declared here", *tp); | |
1395 | } | |
1396 | } | |
1397 | } | |
1398 | } | |
1399 | return NULL_TREE; | |
1400 | } | |
1401 | ||
3aaaa103 JM |
1402 | /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively |
1403 | complete) template arguments. */ | |
7dbb85a7 JM |
1404 | |
1405 | static void | |
3aaaa103 | 1406 | mark_type_abi_tags (tree t, bool val) |
7dbb85a7 JM |
1407 | { |
1408 | tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t)); | |
1409 | if (attributes) | |
1410 | { | |
1411 | for (tree list = TREE_VALUE (attributes); list; | |
1412 | list = TREE_CHAIN (list)) | |
1413 | { | |
1414 | tree tag = TREE_VALUE (list); | |
1415 | tree id = get_identifier (TREE_STRING_POINTER (tag)); | |
3aaaa103 JM |
1416 | IDENTIFIER_MARKED (id) = val; |
1417 | } | |
1418 | } | |
3aaaa103 JM |
1419 | } |
1420 | ||
1421 | /* Check that class T has all the abi tags that subobject SUBOB has, or | |
1422 | warn if not. */ | |
1423 | ||
1424 | static void | |
1425 | check_abi_tags (tree t, tree subob) | |
1426 | { | |
1427 | mark_type_abi_tags (t, true); | |
7dbb85a7 JM |
1428 | |
1429 | tree subtype = TYPE_P (subob) ? subob : TREE_TYPE (subob); | |
f585f02f | 1430 | struct abi_tag_data data = { t, subob, error_mark_node }; |
7dbb85a7 JM |
1431 | |
1432 | cp_walk_tree_without_duplicates (&subtype, find_abi_tags_r, &data); | |
1433 | ||
3aaaa103 | 1434 | mark_type_abi_tags (t, false); |
7dbb85a7 JM |
1435 | } |
1436 | ||
f585f02f JM |
1437 | void |
1438 | inherit_targ_abi_tags (tree t) | |
1439 | { | |
1440 | if (CLASSTYPE_TEMPLATE_INFO (t) == NULL_TREE) | |
1441 | return; | |
1442 | ||
1443 | mark_type_abi_tags (t, true); | |
1444 | ||
1445 | tree args = CLASSTYPE_TI_ARGS (t); | |
1446 | struct abi_tag_data data = { t, NULL_TREE, NULL_TREE }; | |
1447 | for (int i = 0; i < TMPL_ARGS_DEPTH (args); ++i) | |
1448 | { | |
1449 | tree level = TMPL_ARGS_LEVEL (args, i+1); | |
1450 | for (int j = 0; j < TREE_VEC_LENGTH (level); ++j) | |
1451 | { | |
1452 | tree arg = TREE_VEC_ELT (level, j); | |
1453 | data.subob = arg; | |
1454 | cp_walk_tree_without_duplicates (&arg, find_abi_tags_r, &data); | |
1455 | } | |
1456 | } | |
1457 | ||
1458 | // If we found some tags on our template arguments, add them to our | |
1459 | // abi_tag attribute. | |
1460 | if (data.tags) | |
1461 | { | |
1462 | tree attr = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t)); | |
1463 | if (attr) | |
1464 | TREE_VALUE (attr) = chainon (data.tags, TREE_VALUE (attr)); | |
1465 | else | |
1466 | TYPE_ATTRIBUTES (t) | |
1467 | = tree_cons (get_identifier ("abi_tag"), data.tags, | |
1468 | TYPE_ATTRIBUTES (t)); | |
1469 | } | |
1470 | ||
1471 | mark_type_abi_tags (t, false); | |
1472 | } | |
1473 | ||
e5e459bf AO |
1474 | /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P, |
1475 | and NO_CONST_ASN_REF_P. Also set flag bits in T based on | |
1476 | properties of the bases. */ | |
8d08fdba | 1477 | |
607cf131 | 1478 | static void |
94edc4ab | 1479 | check_bases (tree t, |
0cbd7506 | 1480 | int* cant_have_const_ctor_p, |
10746f37 | 1481 | int* no_const_asn_ref_p) |
8d08fdba | 1482 | { |
607cf131 | 1483 | int i; |
0a35513e AH |
1484 | bool seen_non_virtual_nearly_empty_base_p = 0; |
1485 | int seen_tm_mask = 0; | |
fa743e8c NS |
1486 | tree base_binfo; |
1487 | tree binfo; | |
c32097d8 | 1488 | tree field = NULL_TREE; |
8d08fdba | 1489 | |
c32097d8 | 1490 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) |
910ad8de | 1491 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
c32097d8 JM |
1492 | if (TREE_CODE (field) == FIELD_DECL) |
1493 | break; | |
1494 | ||
fa743e8c NS |
1495 | for (binfo = TYPE_BINFO (t), i = 0; |
1496 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
8d08fdba | 1497 | { |
fa743e8c | 1498 | tree basetype = TREE_TYPE (base_binfo); |
9a71c18b | 1499 | |
50bc768d | 1500 | gcc_assert (COMPLETE_TYPE_P (basetype)); |
c8094d83 | 1501 | |
486d481b VV |
1502 | if (CLASSTYPE_FINAL (basetype)) |
1503 | error ("cannot derive from %<final%> base %qT in derived type %qT", | |
1504 | basetype, t); | |
1505 | ||
3b49d762 GDR |
1506 | /* If any base class is non-literal, so is the derived class. */ |
1507 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
1508 | CLASSTYPE_LITERAL_P (t) = false; | |
1509 | ||
4c6b7393 | 1510 | /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P |
607cf131 MM |
1511 | here because the case of virtual functions but non-virtual |
1512 | dtor is handled in finish_struct_1. */ | |
74fa0285 GDR |
1513 | if (!TYPE_POLYMORPHIC_P (basetype)) |
1514 | warning (OPT_Weffc__, | |
3db45ab5 | 1515 | "base class %q#T has a non-virtual destructor", basetype); |
8d08fdba | 1516 | |
607cf131 MM |
1517 | /* If the base class doesn't have copy constructors or |
1518 | assignment operators that take const references, then the | |
1519 | derived class cannot have such a member automatically | |
1520 | generated. */ | |
d758e847 JM |
1521 | if (TYPE_HAS_COPY_CTOR (basetype) |
1522 | && ! TYPE_HAS_CONST_COPY_CTOR (basetype)) | |
607cf131 | 1523 | *cant_have_const_ctor_p = 1; |
066ec0a4 JM |
1524 | if (TYPE_HAS_COPY_ASSIGN (basetype) |
1525 | && !TYPE_HAS_CONST_COPY_ASSIGN (basetype)) | |
607cf131 | 1526 | *no_const_asn_ref_p = 1; |
8d08fdba | 1527 | |
809e3e7f | 1528 | if (BINFO_VIRTUAL_P (base_binfo)) |
00a17e31 | 1529 | /* A virtual base does not effect nearly emptiness. */ |
0fb3018c | 1530 | ; |
f9c528ea | 1531 | else if (CLASSTYPE_NEARLY_EMPTY_P (basetype)) |
0fb3018c NS |
1532 | { |
1533 | if (seen_non_virtual_nearly_empty_base_p) | |
1534 | /* And if there is more than one nearly empty base, then the | |
1535 | derived class is not nearly empty either. */ | |
1536 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
1537 | else | |
00a17e31 | 1538 | /* Remember we've seen one. */ |
0fb3018c NS |
1539 | seen_non_virtual_nearly_empty_base_p = 1; |
1540 | } | |
1541 | else if (!is_empty_class (basetype)) | |
1542 | /* If the base class is not empty or nearly empty, then this | |
1543 | class cannot be nearly empty. */ | |
1544 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
f9c528ea | 1545 | |
607cf131 MM |
1546 | /* A lot of properties from the bases also apply to the derived |
1547 | class. */ | |
8d08fdba | 1548 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype); |
c8094d83 | 1549 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 1550 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype); |
066ec0a4 | 1551 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
d758e847 JM |
1552 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype) |
1553 | || !TYPE_HAS_COPY_ASSIGN (basetype)); | |
1554 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype) | |
1555 | || !TYPE_HAS_COPY_CTOR (basetype)); | |
ac177431 JM |
1556 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |
1557 | |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype); | |
1558 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype); | |
4c6b7393 | 1559 | TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype); |
c8094d83 | 1560 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) |
5ec1192e | 1561 | |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype); |
ac177431 JM |
1562 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) |
1563 | || TYPE_HAS_COMPLEX_DFLT (basetype)); | |
0e02d8e3 PC |
1564 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT |
1565 | (t, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) | |
1566 | | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype)); | |
1567 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT | |
1568 | (t, CLASSTYPE_REF_FIELDS_NEED_INIT (t) | |
1569 | | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype)); | |
c32097d8 JM |
1570 | |
1571 | /* A standard-layout class is a class that: | |
1572 | ... | |
1573 | * has no non-standard-layout base classes, */ | |
1574 | CLASSTYPE_NON_STD_LAYOUT (t) |= CLASSTYPE_NON_STD_LAYOUT (basetype); | |
1575 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) | |
1576 | { | |
1577 | tree basefield; | |
1578 | /* ...has no base classes of the same type as the first non-static | |
1579 | data member... */ | |
1580 | if (field && DECL_CONTEXT (field) == t | |
1581 | && (same_type_ignoring_top_level_qualifiers_p | |
1582 | (TREE_TYPE (field), basetype))) | |
1583 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1584 | else | |
1585 | /* ...either has no non-static data members in the most-derived | |
1586 | class and at most one base class with non-static data | |
1587 | members, or has no base classes with non-static data | |
1588 | members */ | |
1589 | for (basefield = TYPE_FIELDS (basetype); basefield; | |
910ad8de | 1590 | basefield = DECL_CHAIN (basefield)) |
c32097d8 JM |
1591 | if (TREE_CODE (basefield) == FIELD_DECL) |
1592 | { | |
1593 | if (field) | |
1594 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1595 | else | |
1596 | field = basefield; | |
1597 | break; | |
1598 | } | |
1599 | } | |
0a35513e AH |
1600 | |
1601 | /* Don't bother collecting tm attributes if transactional memory | |
1602 | support is not enabled. */ | |
1603 | if (flag_tm) | |
1604 | { | |
1605 | tree tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (basetype)); | |
1606 | if (tm_attr) | |
1607 | seen_tm_mask |= tm_attr_to_mask (tm_attr); | |
1608 | } | |
7dbb85a7 JM |
1609 | |
1610 | check_abi_tags (t, basetype); | |
0a35513e AH |
1611 | } |
1612 | ||
1613 | /* If one of the base classes had TM attributes, and the current class | |
1614 | doesn't define its own, then the current class inherits one. */ | |
1615 | if (seen_tm_mask && !find_tm_attribute (TYPE_ATTRIBUTES (t))) | |
1616 | { | |
1617 | tree tm_attr = tm_mask_to_attr (seen_tm_mask & -seen_tm_mask); | |
1618 | TYPE_ATTRIBUTES (t) = tree_cons (tm_attr, NULL, TYPE_ATTRIBUTES (t)); | |
607cf131 MM |
1619 | } |
1620 | } | |
1621 | ||
fc6633e0 NS |
1622 | /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for |
1623 | those that are primaries. Sets BINFO_LOST_PRIMARY_P for those | |
1624 | that have had a nearly-empty virtual primary base stolen by some | |
77880ae4 | 1625 | other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for |
fc6633e0 | 1626 | T. */ |
c35cce41 MM |
1627 | |
1628 | static void | |
fc6633e0 | 1629 | determine_primary_bases (tree t) |
c35cce41 | 1630 | { |
fc6633e0 NS |
1631 | unsigned i; |
1632 | tree primary = NULL_TREE; | |
1633 | tree type_binfo = TYPE_BINFO (t); | |
1634 | tree base_binfo; | |
1635 | ||
1636 | /* Determine the primary bases of our bases. */ | |
1637 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1638 | base_binfo = TREE_CHAIN (base_binfo)) | |
c35cce41 | 1639 | { |
fc6633e0 | 1640 | tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo)); |
c35cce41 | 1641 | |
fc6633e0 NS |
1642 | /* See if we're the non-virtual primary of our inheritance |
1643 | chain. */ | |
1644 | if (!BINFO_VIRTUAL_P (base_binfo)) | |
dbbf88d1 | 1645 | { |
fc6633e0 NS |
1646 | tree parent = BINFO_INHERITANCE_CHAIN (base_binfo); |
1647 | tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent)); | |
c8094d83 | 1648 | |
fc6633e0 | 1649 | if (parent_primary |
539ed333 NS |
1650 | && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), |
1651 | BINFO_TYPE (parent_primary))) | |
fc6633e0 NS |
1652 | /* We are the primary binfo. */ |
1653 | BINFO_PRIMARY_P (base_binfo) = 1; | |
1654 | } | |
1655 | /* Determine if we have a virtual primary base, and mark it so. | |
1656 | */ | |
1657 | if (primary && BINFO_VIRTUAL_P (primary)) | |
1658 | { | |
1659 | tree this_primary = copied_binfo (primary, base_binfo); | |
1660 | ||
1661 | if (BINFO_PRIMARY_P (this_primary)) | |
1662 | /* Someone already claimed this base. */ | |
1663 | BINFO_LOST_PRIMARY_P (base_binfo) = 1; | |
1664 | else | |
dbbf88d1 | 1665 | { |
fc6633e0 | 1666 | tree delta; |
c8094d83 | 1667 | |
fc6633e0 NS |
1668 | BINFO_PRIMARY_P (this_primary) = 1; |
1669 | BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo; | |
c8094d83 | 1670 | |
fc6633e0 | 1671 | /* A virtual binfo might have been copied from within |
0cbd7506 MS |
1672 | another hierarchy. As we're about to use it as a |
1673 | primary base, make sure the offsets match. */ | |
db3927fb AH |
1674 | delta = size_diffop_loc (input_location, |
1675 | convert (ssizetype, | |
fc6633e0 NS |
1676 | BINFO_OFFSET (base_binfo)), |
1677 | convert (ssizetype, | |
1678 | BINFO_OFFSET (this_primary))); | |
c8094d83 | 1679 | |
fc6633e0 | 1680 | propagate_binfo_offsets (this_primary, delta); |
dbbf88d1 NS |
1681 | } |
1682 | } | |
c35cce41 | 1683 | } |
8026246f | 1684 | |
fc6633e0 | 1685 | /* First look for a dynamic direct non-virtual base. */ |
fa743e8c | 1686 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++) |
607cf131 | 1687 | { |
607cf131 | 1688 | tree basetype = BINFO_TYPE (base_binfo); |
aff08c18 | 1689 | |
fc6633e0 | 1690 | if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo)) |
8d08fdba | 1691 | { |
fc6633e0 NS |
1692 | primary = base_binfo; |
1693 | goto found; | |
911a71a7 MM |
1694 | } |
1695 | } | |
8026246f | 1696 | |
3461fba7 | 1697 | /* A "nearly-empty" virtual base class can be the primary base |
fc6633e0 NS |
1698 | class, if no non-virtual polymorphic base can be found. Look for |
1699 | a nearly-empty virtual dynamic base that is not already a primary | |
77880ae4 | 1700 | base of something in the hierarchy. If there is no such base, |
fc6633e0 NS |
1701 | just pick the first nearly-empty virtual base. */ |
1702 | ||
1703 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1704 | base_binfo = TREE_CHAIN (base_binfo)) | |
1705 | if (BINFO_VIRTUAL_P (base_binfo) | |
1706 | && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo))) | |
1707 | { | |
1708 | if (!BINFO_PRIMARY_P (base_binfo)) | |
1709 | { | |
1710 | /* Found one that is not primary. */ | |
1711 | primary = base_binfo; | |
1712 | goto found; | |
1713 | } | |
1714 | else if (!primary) | |
1715 | /* Remember the first candidate. */ | |
1716 | primary = base_binfo; | |
1717 | } | |
c8094d83 | 1718 | |
fc6633e0 NS |
1719 | found: |
1720 | /* If we've got a primary base, use it. */ | |
1721 | if (primary) | |
7cafdb8b | 1722 | { |
fc6633e0 | 1723 | tree basetype = BINFO_TYPE (primary); |
c8094d83 | 1724 | |
fc6633e0 NS |
1725 | CLASSTYPE_PRIMARY_BINFO (t) = primary; |
1726 | if (BINFO_PRIMARY_P (primary)) | |
1727 | /* We are stealing a primary base. */ | |
1728 | BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1; | |
1729 | BINFO_PRIMARY_P (primary) = 1; | |
1730 | if (BINFO_VIRTUAL_P (primary)) | |
7cafdb8b | 1731 | { |
fc6633e0 | 1732 | tree delta; |
7cafdb8b | 1733 | |
fc6633e0 NS |
1734 | BINFO_INHERITANCE_CHAIN (primary) = type_binfo; |
1735 | /* A virtual binfo might have been copied from within | |
0cbd7506 MS |
1736 | another hierarchy. As we're about to use it as a primary |
1737 | base, make sure the offsets match. */ | |
db3927fb | 1738 | delta = size_diffop_loc (input_location, ssize_int (0), |
fc6633e0 | 1739 | convert (ssizetype, BINFO_OFFSET (primary))); |
c8094d83 | 1740 | |
fc6633e0 | 1741 | propagate_binfo_offsets (primary, delta); |
7cafdb8b | 1742 | } |
c8094d83 | 1743 | |
fc6633e0 | 1744 | primary = TYPE_BINFO (basetype); |
c8094d83 | 1745 | |
fc6633e0 NS |
1746 | TYPE_VFIELD (t) = TYPE_VFIELD (basetype); |
1747 | BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary); | |
1748 | BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary); | |
7cafdb8b | 1749 | } |
8d08fdba | 1750 | } |
e92cc029 | 1751 | |
d0940d56 DS |
1752 | /* Update the variant types of T. */ |
1753 | ||
1754 | void | |
1755 | fixup_type_variants (tree t) | |
8d08fdba | 1756 | { |
090ad434 | 1757 | tree variants; |
c8094d83 | 1758 | |
d0940d56 DS |
1759 | if (!t) |
1760 | return; | |
1761 | ||
090ad434 NS |
1762 | for (variants = TYPE_NEXT_VARIANT (t); |
1763 | variants; | |
1764 | variants = TYPE_NEXT_VARIANT (variants)) | |
8d08fdba MS |
1765 | { |
1766 | /* These fields are in the _TYPE part of the node, not in | |
1767 | the TYPE_LANG_SPECIFIC component, so they are not shared. */ | |
0fcedd9c | 1768 | TYPE_HAS_USER_CONSTRUCTOR (variants) = TYPE_HAS_USER_CONSTRUCTOR (t); |
8d08fdba | 1769 | TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t); |
c8094d83 | 1770 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants) |
834c6dff | 1771 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
8d08fdba | 1772 | |
4c6b7393 | 1773 | TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t); |
c8094d83 | 1774 | |
cad7e87b NS |
1775 | TYPE_BINFO (variants) = TYPE_BINFO (t); |
1776 | ||
8d08fdba | 1777 | /* Copy whatever these are holding today. */ |
eb34af89 RK |
1778 | TYPE_VFIELD (variants) = TYPE_VFIELD (t); |
1779 | TYPE_METHODS (variants) = TYPE_METHODS (t); | |
5566b478 | 1780 | TYPE_FIELDS (variants) = TYPE_FIELDS (t); |
8943989d JM |
1781 | } |
1782 | } | |
1783 | ||
1784 | /* Early variant fixups: we apply attributes at the beginning of the class | |
1785 | definition, and we need to fix up any variants that have already been | |
1786 | made via elaborated-type-specifier so that check_qualified_type works. */ | |
1787 | ||
1788 | void | |
1789 | fixup_attribute_variants (tree t) | |
1790 | { | |
1791 | tree variants; | |
5818c8e4 | 1792 | |
8943989d JM |
1793 | if (!t) |
1794 | return; | |
1795 | ||
1796 | for (variants = TYPE_NEXT_VARIANT (t); | |
1797 | variants; | |
1798 | variants = TYPE_NEXT_VARIANT (variants)) | |
1799 | { | |
1800 | /* These are the two fields that check_qualified_type looks at and | |
1801 | are affected by attributes. */ | |
5818c8e4 | 1802 | TYPE_ATTRIBUTES (variants) = TYPE_ATTRIBUTES (t); |
8943989d | 1803 | TYPE_ALIGN (variants) = TYPE_ALIGN (t); |
8d08fdba | 1804 | } |
d0940d56 | 1805 | } |
d0940d56 DS |
1806 | \f |
1807 | /* Set memoizing fields and bits of T (and its variants) for later | |
1808 | use. */ | |
1809 | ||
1810 | static void | |
1811 | finish_struct_bits (tree t) | |
1812 | { | |
1813 | /* Fix up variants (if any). */ | |
1814 | fixup_type_variants (t); | |
8d08fdba | 1815 | |
fa743e8c | 1816 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t)) |
16ae29f1 NS |
1817 | /* For a class w/o baseclasses, 'finish_struct' has set |
1818 | CLASSTYPE_PURE_VIRTUALS correctly (by definition). | |
132c7dd3 NS |
1819 | Similarly for a class whose base classes do not have vtables. |
1820 | When neither of these is true, we might have removed abstract | |
1821 | virtuals (by providing a definition), added some (by declaring | |
1822 | new ones), or redeclared ones from a base class. We need to | |
1823 | recalculate what's really an abstract virtual at this point (by | |
1824 | looking in the vtables). */ | |
1825 | get_pure_virtuals (t); | |
c8094d83 | 1826 | |
132c7dd3 NS |
1827 | /* If this type has a copy constructor or a destructor, force its |
1828 | mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be | |
1829 | nonzero. This will cause it to be passed by invisible reference | |
1830 | and prevent it from being returned in a register. */ | |
d758e847 JM |
1831 | if (type_has_nontrivial_copy_init (t) |
1832 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
8d08fdba | 1833 | { |
e8abc66f | 1834 | tree variants; |
d2e5ee5c | 1835 | DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode; |
e8abc66f | 1836 | for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants)) |
8d08fdba | 1837 | { |
179d2f74 | 1838 | SET_TYPE_MODE (variants, BLKmode); |
8d08fdba | 1839 | TREE_ADDRESSABLE (variants) = 1; |
8d08fdba MS |
1840 | } |
1841 | } | |
1842 | } | |
1843 | ||
b0e0b31f | 1844 | /* Issue warnings about T having private constructors, but no friends, |
c8094d83 | 1845 | and so forth. |
aed7b2a6 | 1846 | |
b0e0b31f MM |
1847 | HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or |
1848 | static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any | |
1849 | non-private static member functions. */ | |
1850 | ||
1851 | static void | |
94edc4ab | 1852 | maybe_warn_about_overly_private_class (tree t) |
aed7b2a6 | 1853 | { |
056a3b12 MM |
1854 | int has_member_fn = 0; |
1855 | int has_nonprivate_method = 0; | |
1856 | tree fn; | |
1857 | ||
1858 | if (!warn_ctor_dtor_privacy | |
b0e0b31f MM |
1859 | /* If the class has friends, those entities might create and |
1860 | access instances, so we should not warn. */ | |
056a3b12 MM |
1861 | || (CLASSTYPE_FRIEND_CLASSES (t) |
1862 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))) | |
b0e0b31f MM |
1863 | /* We will have warned when the template was declared; there's |
1864 | no need to warn on every instantiation. */ | |
056a3b12 | 1865 | || CLASSTYPE_TEMPLATE_INSTANTIATION (t)) |
c8094d83 | 1866 | /* There's no reason to even consider warning about this |
056a3b12 MM |
1867 | class. */ |
1868 | return; | |
c8094d83 | 1869 | |
056a3b12 MM |
1870 | /* We only issue one warning, if more than one applies, because |
1871 | otherwise, on code like: | |
1872 | ||
1873 | class A { | |
1874 | // Oops - forgot `public:' | |
1875 | A(); | |
1876 | A(const A&); | |
1877 | ~A(); | |
1878 | }; | |
1879 | ||
1880 | we warn several times about essentially the same problem. */ | |
1881 | ||
1882 | /* Check to see if all (non-constructor, non-destructor) member | |
1883 | functions are private. (Since there are no friends or | |
1884 | non-private statics, we can't ever call any of the private member | |
1885 | functions.) */ | |
910ad8de | 1886 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
056a3b12 MM |
1887 | /* We're not interested in compiler-generated methods; they don't |
1888 | provide any way to call private members. */ | |
c8094d83 | 1889 | if (!DECL_ARTIFICIAL (fn)) |
056a3b12 MM |
1890 | { |
1891 | if (!TREE_PRIVATE (fn)) | |
b0e0b31f | 1892 | { |
c8094d83 | 1893 | if (DECL_STATIC_FUNCTION_P (fn)) |
056a3b12 MM |
1894 | /* A non-private static member function is just like a |
1895 | friend; it can create and invoke private member | |
1896 | functions, and be accessed without a class | |
1897 | instance. */ | |
1898 | return; | |
c8094d83 | 1899 | |
056a3b12 | 1900 | has_nonprivate_method = 1; |
f576dfc4 | 1901 | /* Keep searching for a static member function. */ |
056a3b12 | 1902 | } |
ce0a5952 | 1903 | else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn)) |
056a3b12 | 1904 | has_member_fn = 1; |
c8094d83 | 1905 | } |
aed7b2a6 | 1906 | |
c8094d83 | 1907 | if (!has_nonprivate_method && has_member_fn) |
056a3b12 | 1908 | { |
ce0a5952 MM |
1909 | /* There are no non-private methods, and there's at least one |
1910 | private member function that isn't a constructor or | |
1911 | destructor. (If all the private members are | |
1912 | constructors/destructors we want to use the code below that | |
1913 | issues error messages specifically referring to | |
1914 | constructors/destructors.) */ | |
fa743e8c | 1915 | unsigned i; |
dbbf88d1 | 1916 | tree binfo = TYPE_BINFO (t); |
c8094d83 | 1917 | |
fa743e8c | 1918 | for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++) |
604a3205 | 1919 | if (BINFO_BASE_ACCESS (binfo, i) != access_private_node) |
056a3b12 MM |
1920 | { |
1921 | has_nonprivate_method = 1; | |
1922 | break; | |
1923 | } | |
c8094d83 | 1924 | if (!has_nonprivate_method) |
b0e0b31f | 1925 | { |
74fa0285 | 1926 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1927 | "all member functions in class %qT are private", t); |
056a3b12 | 1928 | return; |
b0e0b31f | 1929 | } |
056a3b12 | 1930 | } |
aed7b2a6 | 1931 | |
056a3b12 MM |
1932 | /* Even if some of the member functions are non-private, the class |
1933 | won't be useful for much if all the constructors or destructors | |
1934 | are private: such an object can never be created or destroyed. */ | |
9f4faeae MM |
1935 | fn = CLASSTYPE_DESTRUCTORS (t); |
1936 | if (fn && TREE_PRIVATE (fn)) | |
056a3b12 | 1937 | { |
74fa0285 | 1938 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1939 | "%q#T only defines a private destructor and has no friends", |
4b0d3cbe MM |
1940 | t); |
1941 | return; | |
056a3b12 | 1942 | } |
b0e0b31f | 1943 | |
0fcedd9c JM |
1944 | /* Warn about classes that have private constructors and no friends. */ |
1945 | if (TYPE_HAS_USER_CONSTRUCTOR (t) | |
550d1bf4 MM |
1946 | /* Implicitly generated constructors are always public. */ |
1947 | && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t) | |
1948 | || !CLASSTYPE_LAZY_COPY_CTOR (t))) | |
056a3b12 MM |
1949 | { |
1950 | int nonprivate_ctor = 0; | |
c8094d83 | 1951 | |
056a3b12 MM |
1952 | /* If a non-template class does not define a copy |
1953 | constructor, one is defined for it, enabling it to avoid | |
1954 | this warning. For a template class, this does not | |
1955 | happen, and so we would normally get a warning on: | |
b0e0b31f | 1956 | |
c8094d83 MS |
1957 | template <class T> class C { private: C(); }; |
1958 | ||
066ec0a4 | 1959 | To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All |
056a3b12 MM |
1960 | complete non-template or fully instantiated classes have this |
1961 | flag set. */ | |
066ec0a4 | 1962 | if (!TYPE_HAS_COPY_CTOR (t)) |
056a3b12 | 1963 | nonprivate_ctor = 1; |
c8094d83 MS |
1964 | else |
1965 | for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn)) | |
056a3b12 MM |
1966 | { |
1967 | tree ctor = OVL_CURRENT (fn); | |
1968 | /* Ideally, we wouldn't count copy constructors (or, in | |
1969 | fact, any constructor that takes an argument of the | |
1970 | class type as a parameter) because such things cannot | |
1971 | be used to construct an instance of the class unless | |
1972 | you already have one. But, for now at least, we're | |
1973 | more generous. */ | |
1974 | if (! TREE_PRIVATE (ctor)) | |
b0e0b31f | 1975 | { |
056a3b12 MM |
1976 | nonprivate_ctor = 1; |
1977 | break; | |
b0e0b31f | 1978 | } |
056a3b12 | 1979 | } |
aed7b2a6 | 1980 | |
056a3b12 MM |
1981 | if (nonprivate_ctor == 0) |
1982 | { | |
74fa0285 | 1983 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1984 | "%q#T only defines private constructors and has no friends", |
0cbd7506 | 1985 | t); |
056a3b12 | 1986 | return; |
b0e0b31f MM |
1987 | } |
1988 | } | |
aed7b2a6 MM |
1989 | } |
1990 | ||
17211ab5 GK |
1991 | static struct { |
1992 | gt_pointer_operator new_value; | |
1993 | void *cookie; | |
1994 | } resort_data; | |
1995 | ||
f90cdf34 MT |
1996 | /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */ |
1997 | ||
1998 | static int | |
94edc4ab | 1999 | method_name_cmp (const void* m1_p, const void* m2_p) |
f90cdf34 | 2000 | { |
67f5655f GDR |
2001 | const tree *const m1 = (const tree *) m1_p; |
2002 | const tree *const m2 = (const tree *) m2_p; | |
c8094d83 | 2003 | |
f90cdf34 MT |
2004 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
2005 | return 0; | |
2006 | if (*m1 == NULL_TREE) | |
2007 | return -1; | |
2008 | if (*m2 == NULL_TREE) | |
2009 | return 1; | |
2010 | if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2))) | |
2011 | return -1; | |
2012 | return 1; | |
2013 | } | |
b0e0b31f | 2014 | |
17211ab5 GK |
2015 | /* This routine compares two fields like method_name_cmp but using the |
2016 | pointer operator in resort_field_decl_data. */ | |
2017 | ||
2018 | static int | |
94edc4ab | 2019 | resort_method_name_cmp (const void* m1_p, const void* m2_p) |
17211ab5 | 2020 | { |
67f5655f GDR |
2021 | const tree *const m1 = (const tree *) m1_p; |
2022 | const tree *const m2 = (const tree *) m2_p; | |
17211ab5 GK |
2023 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
2024 | return 0; | |
2025 | if (*m1 == NULL_TREE) | |
2026 | return -1; | |
2027 | if (*m2 == NULL_TREE) | |
2028 | return 1; | |
2029 | { | |
2030 | tree d1 = DECL_NAME (OVL_CURRENT (*m1)); | |
2031 | tree d2 = DECL_NAME (OVL_CURRENT (*m2)); | |
2032 | resort_data.new_value (&d1, resort_data.cookie); | |
2033 | resort_data.new_value (&d2, resort_data.cookie); | |
2034 | if (d1 < d2) | |
2035 | return -1; | |
2036 | } | |
2037 | return 1; | |
2038 | } | |
2039 | ||
2040 | /* Resort TYPE_METHOD_VEC because pointers have been reordered. */ | |
2041 | ||
c8094d83 | 2042 | void |
94edc4ab | 2043 | resort_type_method_vec (void* obj, |
12308bc6 | 2044 | void* /*orig_obj*/, |
0cbd7506 MS |
2045 | gt_pointer_operator new_value, |
2046 | void* cookie) | |
17211ab5 | 2047 | { |
9771b263 DN |
2048 | vec<tree, va_gc> *method_vec = (vec<tree, va_gc> *) obj; |
2049 | int len = vec_safe_length (method_vec); | |
aaaa46d2 MM |
2050 | size_t slot; |
2051 | tree fn; | |
17211ab5 GK |
2052 | |
2053 | /* The type conversion ops have to live at the front of the vec, so we | |
2054 | can't sort them. */ | |
aaaa46d2 | 2055 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2056 | vec_safe_iterate (method_vec, slot, &fn); |
aaaa46d2 MM |
2057 | ++slot) |
2058 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn))) | |
2059 | break; | |
2060 | ||
17211ab5 GK |
2061 | if (len - slot > 1) |
2062 | { | |
2063 | resort_data.new_value = new_value; | |
2064 | resort_data.cookie = cookie; | |
9771b263 | 2065 | qsort (method_vec->address () + slot, len - slot, sizeof (tree), |
17211ab5 GK |
2066 | resort_method_name_cmp); |
2067 | } | |
2068 | } | |
2069 | ||
c7222c02 | 2070 | /* Warn about duplicate methods in fn_fields. |
8d08fdba | 2071 | |
5b0cec3b MM |
2072 | Sort methods that are not special (i.e., constructors, destructors, |
2073 | and type conversion operators) so that we can find them faster in | |
2074 | search. */ | |
8d08fdba | 2075 | |
b0e0b31f | 2076 | static void |
94edc4ab | 2077 | finish_struct_methods (tree t) |
8d08fdba | 2078 | { |
b0e0b31f | 2079 | tree fn_fields; |
9771b263 | 2080 | vec<tree, va_gc> *method_vec; |
58010b57 MM |
2081 | int slot, len; |
2082 | ||
58010b57 | 2083 | method_vec = CLASSTYPE_METHOD_VEC (t); |
508a1c9c MM |
2084 | if (!method_vec) |
2085 | return; | |
2086 | ||
9771b263 | 2087 | len = method_vec->length (); |
8d08fdba | 2088 | |
c7222c02 | 2089 | /* Clear DECL_IN_AGGR_P for all functions. */ |
c8094d83 | 2090 | for (fn_fields = TYPE_METHODS (t); fn_fields; |
910ad8de | 2091 | fn_fields = DECL_CHAIN (fn_fields)) |
5b0cec3b | 2092 | DECL_IN_AGGR_P (fn_fields) = 0; |
8d08fdba | 2093 | |
b0e0b31f MM |
2094 | /* Issue warnings about private constructors and such. If there are |
2095 | no methods, then some public defaults are generated. */ | |
f90cdf34 MT |
2096 | maybe_warn_about_overly_private_class (t); |
2097 | ||
f90cdf34 MT |
2098 | /* The type conversion ops have to live at the front of the vec, so we |
2099 | can't sort them. */ | |
9ba5ff0f | 2100 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2101 | method_vec->iterate (slot, &fn_fields); |
aaaa46d2 MM |
2102 | ++slot) |
2103 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields))) | |
2104 | break; | |
f90cdf34 | 2105 | if (len - slot > 1) |
9771b263 | 2106 | qsort (method_vec->address () + slot, |
aaaa46d2 | 2107 | len-slot, sizeof (tree), method_name_cmp); |
8d08fdba MS |
2108 | } |
2109 | ||
90ecce3e | 2110 | /* Make BINFO's vtable have N entries, including RTTI entries, |
3b426391 | 2111 | vbase and vcall offsets, etc. Set its type and call the back end |
8d7a5379 | 2112 | to lay it out. */ |
1a588ad7 MM |
2113 | |
2114 | static void | |
94edc4ab | 2115 | layout_vtable_decl (tree binfo, int n) |
1a588ad7 | 2116 | { |
1a588ad7 | 2117 | tree atype; |
c35cce41 | 2118 | tree vtable; |
1a588ad7 | 2119 | |
dcedcddb | 2120 | atype = build_array_of_n_type (vtable_entry_type, n); |
1a588ad7 MM |
2121 | layout_type (atype); |
2122 | ||
2123 | /* We may have to grow the vtable. */ | |
c35cce41 MM |
2124 | vtable = get_vtbl_decl_for_binfo (binfo); |
2125 | if (!same_type_p (TREE_TYPE (vtable), atype)) | |
1a588ad7 | 2126 | { |
06ceef4e | 2127 | TREE_TYPE (vtable) = atype; |
c35cce41 | 2128 | DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE; |
06ceef4e | 2129 | layout_decl (vtable, 0); |
1a588ad7 MM |
2130 | } |
2131 | } | |
2132 | ||
9bab6c90 MM |
2133 | /* True iff FNDECL and BASE_FNDECL (both non-static member functions) |
2134 | have the same signature. */ | |
83f2ccf4 | 2135 | |
e0fff4b3 | 2136 | int |
58f9752a | 2137 | same_signature_p (const_tree fndecl, const_tree base_fndecl) |
83f2ccf4 | 2138 | { |
872f37f9 MM |
2139 | /* One destructor overrides another if they are the same kind of |
2140 | destructor. */ | |
2141 | if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl) | |
2142 | && special_function_p (base_fndecl) == special_function_p (fndecl)) | |
ca36f057 | 2143 | return 1; |
872f37f9 MM |
2144 | /* But a non-destructor never overrides a destructor, nor vice |
2145 | versa, nor do different kinds of destructors override | |
2146 | one-another. For example, a complete object destructor does not | |
2147 | override a deleting destructor. */ | |
0d9eb3ba | 2148 | if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl)) |
ca36f057 | 2149 | return 0; |
872f37f9 | 2150 | |
a6c0d772 MM |
2151 | if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl) |
2152 | || (DECL_CONV_FN_P (fndecl) | |
2153 | && DECL_CONV_FN_P (base_fndecl) | |
2154 | && same_type_p (DECL_CONV_FN_TYPE (fndecl), | |
2155 | DECL_CONV_FN_TYPE (base_fndecl)))) | |
83f2ccf4 | 2156 | { |
c4101929 JM |
2157 | tree fntype = TREE_TYPE (fndecl); |
2158 | tree base_fntype = TREE_TYPE (base_fndecl); | |
2159 | if (type_memfn_quals (fntype) == type_memfn_quals (base_fntype) | |
2160 | && type_memfn_rqual (fntype) == type_memfn_rqual (base_fntype) | |
2161 | && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl), | |
2162 | FUNCTION_FIRST_USER_PARMTYPE (base_fndecl))) | |
ca36f057 | 2163 | return 1; |
83f2ccf4 | 2164 | } |
ca36f057 | 2165 | return 0; |
83f2ccf4 MM |
2166 | } |
2167 | ||
9368208b MM |
2168 | /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a |
2169 | subobject. */ | |
c8094d83 | 2170 | |
9368208b MM |
2171 | static bool |
2172 | base_derived_from (tree derived, tree base) | |
2173 | { | |
dbbf88d1 NS |
2174 | tree probe; |
2175 | ||
2176 | for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
2177 | { | |
2178 | if (probe == derived) | |
2179 | return true; | |
809e3e7f | 2180 | else if (BINFO_VIRTUAL_P (probe)) |
dbbf88d1 NS |
2181 | /* If we meet a virtual base, we can't follow the inheritance |
2182 | any more. See if the complete type of DERIVED contains | |
2183 | such a virtual base. */ | |
58c42dc2 NS |
2184 | return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived)) |
2185 | != NULL_TREE); | |
dbbf88d1 NS |
2186 | } |
2187 | return false; | |
9368208b MM |
2188 | } |
2189 | ||
ca36f057 MM |
2190 | typedef struct find_final_overrider_data_s { |
2191 | /* The function for which we are trying to find a final overrider. */ | |
2192 | tree fn; | |
2193 | /* The base class in which the function was declared. */ | |
2194 | tree declaring_base; | |
9368208b | 2195 | /* The candidate overriders. */ |
78b45a24 | 2196 | tree candidates; |
5d5a519f | 2197 | /* Path to most derived. */ |
9771b263 | 2198 | vec<tree> path; |
ca36f057 | 2199 | } find_final_overrider_data; |
8d7a5379 | 2200 | |
f7a8132a MM |
2201 | /* Add the overrider along the current path to FFOD->CANDIDATES. |
2202 | Returns true if an overrider was found; false otherwise. */ | |
8d7a5379 | 2203 | |
f7a8132a | 2204 | static bool |
c8094d83 | 2205 | dfs_find_final_overrider_1 (tree binfo, |
5d5a519f NS |
2206 | find_final_overrider_data *ffod, |
2207 | unsigned depth) | |
7177d104 | 2208 | { |
741d8ca3 MM |
2209 | tree method; |
2210 | ||
f7a8132a MM |
2211 | /* If BINFO is not the most derived type, try a more derived class. |
2212 | A definition there will overrider a definition here. */ | |
5d5a519f | 2213 | if (depth) |
dbbf88d1 | 2214 | { |
5d5a519f NS |
2215 | depth--; |
2216 | if (dfs_find_final_overrider_1 | |
9771b263 | 2217 | (ffod->path[depth], ffod, depth)) |
f7a8132a MM |
2218 | return true; |
2219 | } | |
dbbf88d1 | 2220 | |
741d8ca3 | 2221 | method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn); |
f7a8132a MM |
2222 | if (method) |
2223 | { | |
2224 | tree *candidate = &ffod->candidates; | |
c8094d83 | 2225 | |
f7a8132a MM |
2226 | /* Remove any candidates overridden by this new function. */ |
2227 | while (*candidate) | |
8d7a5379 | 2228 | { |
f7a8132a MM |
2229 | /* If *CANDIDATE overrides METHOD, then METHOD |
2230 | cannot override anything else on the list. */ | |
2231 | if (base_derived_from (TREE_VALUE (*candidate), binfo)) | |
2232 | return true; | |
2233 | /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */ | |
2234 | if (base_derived_from (binfo, TREE_VALUE (*candidate))) | |
2235 | *candidate = TREE_CHAIN (*candidate); | |
dbbf88d1 | 2236 | else |
f7a8132a | 2237 | candidate = &TREE_CHAIN (*candidate); |
5e19c053 | 2238 | } |
c8094d83 | 2239 | |
f7a8132a MM |
2240 | /* Add the new function. */ |
2241 | ffod->candidates = tree_cons (method, binfo, ffod->candidates); | |
2242 | return true; | |
dbbf88d1 | 2243 | } |
5e19c053 | 2244 | |
f7a8132a MM |
2245 | return false; |
2246 | } | |
2247 | ||
2248 | /* Called from find_final_overrider via dfs_walk. */ | |
2249 | ||
2250 | static tree | |
5d5a519f | 2251 | dfs_find_final_overrider_pre (tree binfo, void *data) |
f7a8132a MM |
2252 | { |
2253 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; | |
2254 | ||
2255 | if (binfo == ffod->declaring_base) | |
9771b263 DN |
2256 | dfs_find_final_overrider_1 (binfo, ffod, ffod->path.length ()); |
2257 | ffod->path.safe_push (binfo); | |
f7a8132a | 2258 | |
dbbf88d1 NS |
2259 | return NULL_TREE; |
2260 | } | |
db3d8cde | 2261 | |
dbbf88d1 | 2262 | static tree |
12308bc6 | 2263 | dfs_find_final_overrider_post (tree /*binfo*/, void *data) |
dbbf88d1 | 2264 | { |
dbbf88d1 | 2265 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; |
9771b263 | 2266 | ffod->path.pop (); |
78b45a24 | 2267 | |
dd42e135 MM |
2268 | return NULL_TREE; |
2269 | } | |
2270 | ||
5e19c053 MM |
2271 | /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for |
2272 | FN and whose TREE_VALUE is the binfo for the base where the | |
95675950 MM |
2273 | overriding occurs. BINFO (in the hierarchy dominated by the binfo |
2274 | DERIVED) is the base object in which FN is declared. */ | |
e92cc029 | 2275 | |
a292b002 | 2276 | static tree |
94edc4ab | 2277 | find_final_overrider (tree derived, tree binfo, tree fn) |
a292b002 | 2278 | { |
5e19c053 | 2279 | find_final_overrider_data ffod; |
a292b002 | 2280 | |
0e339752 | 2281 | /* Getting this right is a little tricky. This is valid: |
a292b002 | 2282 | |
5e19c053 MM |
2283 | struct S { virtual void f (); }; |
2284 | struct T { virtual void f (); }; | |
2285 | struct U : public S, public T { }; | |
a292b002 | 2286 | |
c8094d83 | 2287 | even though calling `f' in `U' is ambiguous. But, |
a292b002 | 2288 | |
5e19c053 MM |
2289 | struct R { virtual void f(); }; |
2290 | struct S : virtual public R { virtual void f (); }; | |
2291 | struct T : virtual public R { virtual void f (); }; | |
2292 | struct U : public S, public T { }; | |
dd42e135 | 2293 | |
d0cd8b44 | 2294 | is not -- there's no way to decide whether to put `S::f' or |
c8094d83 MS |
2295 | `T::f' in the vtable for `R'. |
2296 | ||
5e19c053 MM |
2297 | The solution is to look at all paths to BINFO. If we find |
2298 | different overriders along any two, then there is a problem. */ | |
07fa4878 NS |
2299 | if (DECL_THUNK_P (fn)) |
2300 | fn = THUNK_TARGET (fn); | |
f7a8132a MM |
2301 | |
2302 | /* Determine the depth of the hierarchy. */ | |
5e19c053 MM |
2303 | ffod.fn = fn; |
2304 | ffod.declaring_base = binfo; | |
78b45a24 | 2305 | ffod.candidates = NULL_TREE; |
9771b263 | 2306 | ffod.path.create (30); |
5e19c053 | 2307 | |
5d5a519f NS |
2308 | dfs_walk_all (derived, dfs_find_final_overrider_pre, |
2309 | dfs_find_final_overrider_post, &ffod); | |
f7a8132a | 2310 | |
9771b263 | 2311 | ffod.path.release (); |
c8094d83 | 2312 | |
78b45a24 | 2313 | /* If there was no winner, issue an error message. */ |
9368208b | 2314 | if (!ffod.candidates || TREE_CHAIN (ffod.candidates)) |
16a1369e | 2315 | return error_mark_node; |
dd42e135 | 2316 | |
9368208b | 2317 | return ffod.candidates; |
a292b002 MS |
2318 | } |
2319 | ||
548502d3 MM |
2320 | /* Return the index of the vcall offset for FN when TYPE is used as a |
2321 | virtual base. */ | |
d0cd8b44 | 2322 | |
d0cd8b44 | 2323 | static tree |
548502d3 | 2324 | get_vcall_index (tree fn, tree type) |
d0cd8b44 | 2325 | { |
9771b263 | 2326 | vec<tree_pair_s, va_gc> *indices = CLASSTYPE_VCALL_INDICES (type); |
0871761b NS |
2327 | tree_pair_p p; |
2328 | unsigned ix; | |
d0cd8b44 | 2329 | |
9771b263 | 2330 | FOR_EACH_VEC_SAFE_ELT (indices, ix, p) |
0871761b NS |
2331 | if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose)) |
2332 | || same_signature_p (fn, p->purpose)) | |
2333 | return p->value; | |
548502d3 MM |
2334 | |
2335 | /* There should always be an appropriate index. */ | |
8dc2b103 | 2336 | gcc_unreachable (); |
d0cd8b44 | 2337 | } |
d0cd8b44 JM |
2338 | |
2339 | /* Update an entry in the vtable for BINFO, which is in the hierarchy | |
bf1cb49e JM |
2340 | dominated by T. FN is the old function; VIRTUALS points to the |
2341 | corresponding position in the new BINFO_VIRTUALS list. IX is the index | |
2342 | of that entry in the list. */ | |
4e7512c9 MM |
2343 | |
2344 | static void | |
a2ddc397 NS |
2345 | update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals, |
2346 | unsigned ix) | |
4e7512c9 MM |
2347 | { |
2348 | tree b; | |
2349 | tree overrider; | |
4e7512c9 | 2350 | tree delta; |
31f8e4f3 | 2351 | tree virtual_base; |
d0cd8b44 | 2352 | tree first_defn; |
3cfabe60 NS |
2353 | tree overrider_fn, overrider_target; |
2354 | tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn; | |
2355 | tree over_return, base_return; | |
f11ee281 | 2356 | bool lost = false; |
4e7512c9 | 2357 | |
d0cd8b44 JM |
2358 | /* Find the nearest primary base (possibly binfo itself) which defines |
2359 | this function; this is the class the caller will convert to when | |
2360 | calling FN through BINFO. */ | |
2361 | for (b = binfo; ; b = get_primary_binfo (b)) | |
4e7512c9 | 2362 | { |
50bc768d | 2363 | gcc_assert (b); |
3cfabe60 | 2364 | if (look_for_overrides_here (BINFO_TYPE (b), target_fn)) |
31f8e4f3 | 2365 | break; |
f11ee281 JM |
2366 | |
2367 | /* The nearest definition is from a lost primary. */ | |
2368 | if (BINFO_LOST_PRIMARY_P (b)) | |
2369 | lost = true; | |
4e7512c9 | 2370 | } |
d0cd8b44 | 2371 | first_defn = b; |
4e7512c9 | 2372 | |
31f8e4f3 | 2373 | /* Find the final overrider. */ |
3cfabe60 | 2374 | overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn); |
4e7512c9 | 2375 | if (overrider == error_mark_node) |
16a1369e JJ |
2376 | { |
2377 | error ("no unique final overrider for %qD in %qT", target_fn, t); | |
2378 | return; | |
2379 | } | |
3cfabe60 | 2380 | overrider_target = overrider_fn = TREE_PURPOSE (overrider); |
c8094d83 | 2381 | |
9bcb9aae | 2382 | /* Check for adjusting covariant return types. */ |
3cfabe60 NS |
2383 | over_return = TREE_TYPE (TREE_TYPE (overrider_target)); |
2384 | base_return = TREE_TYPE (TREE_TYPE (target_fn)); | |
c8094d83 | 2385 | |
3cfabe60 NS |
2386 | if (POINTER_TYPE_P (over_return) |
2387 | && TREE_CODE (over_return) == TREE_CODE (base_return) | |
2388 | && CLASS_TYPE_P (TREE_TYPE (over_return)) | |
b77fe7b4 NS |
2389 | && CLASS_TYPE_P (TREE_TYPE (base_return)) |
2390 | /* If the overrider is invalid, don't even try. */ | |
2391 | && !DECL_INVALID_OVERRIDER_P (overrider_target)) | |
3cfabe60 NS |
2392 | { |
2393 | /* If FN is a covariant thunk, we must figure out the adjustment | |
0cbd7506 MS |
2394 | to the final base FN was converting to. As OVERRIDER_TARGET might |
2395 | also be converting to the return type of FN, we have to | |
2396 | combine the two conversions here. */ | |
3cfabe60 | 2397 | tree fixed_offset, virtual_offset; |
12a669d1 NS |
2398 | |
2399 | over_return = TREE_TYPE (over_return); | |
2400 | base_return = TREE_TYPE (base_return); | |
c8094d83 | 2401 | |
3cfabe60 NS |
2402 | if (DECL_THUNK_P (fn)) |
2403 | { | |
50bc768d | 2404 | gcc_assert (DECL_RESULT_THUNK_P (fn)); |
3cfabe60 NS |
2405 | fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn)); |
2406 | virtual_offset = THUNK_VIRTUAL_OFFSET (fn); | |
3cfabe60 NS |
2407 | } |
2408 | else | |
2409 | fixed_offset = virtual_offset = NULL_TREE; | |
4977bab6 | 2410 | |
e00853fd NS |
2411 | if (virtual_offset) |
2412 | /* Find the equivalent binfo within the return type of the | |
2413 | overriding function. We will want the vbase offset from | |
2414 | there. */ | |
58c42dc2 | 2415 | virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset), |
12a669d1 NS |
2416 | over_return); |
2417 | else if (!same_type_ignoring_top_level_qualifiers_p | |
2418 | (over_return, base_return)) | |
3cfabe60 NS |
2419 | { |
2420 | /* There was no existing virtual thunk (which takes | |
12a669d1 NS |
2421 | precedence). So find the binfo of the base function's |
2422 | return type within the overriding function's return type. | |
2423 | We cannot call lookup base here, because we're inside a | |
2424 | dfs_walk, and will therefore clobber the BINFO_MARKED | |
2425 | flags. Fortunately we know the covariancy is valid (it | |
2426 | has already been checked), so we can just iterate along | |
2427 | the binfos, which have been chained in inheritance graph | |
2428 | order. Of course it is lame that we have to repeat the | |
2429 | search here anyway -- we should really be caching pieces | |
2430 | of the vtable and avoiding this repeated work. */ | |
2431 | tree thunk_binfo, base_binfo; | |
2432 | ||
2433 | /* Find the base binfo within the overriding function's | |
742f25b3 NS |
2434 | return type. We will always find a thunk_binfo, except |
2435 | when the covariancy is invalid (which we will have | |
2436 | already diagnosed). */ | |
12a669d1 NS |
2437 | for (base_binfo = TYPE_BINFO (base_return), |
2438 | thunk_binfo = TYPE_BINFO (over_return); | |
742f25b3 | 2439 | thunk_binfo; |
12a669d1 | 2440 | thunk_binfo = TREE_CHAIN (thunk_binfo)) |
742f25b3 NS |
2441 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo), |
2442 | BINFO_TYPE (base_binfo))) | |
2443 | break; | |
c8094d83 | 2444 | |
12a669d1 NS |
2445 | /* See if virtual inheritance is involved. */ |
2446 | for (virtual_offset = thunk_binfo; | |
2447 | virtual_offset; | |
2448 | virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset)) | |
2449 | if (BINFO_VIRTUAL_P (virtual_offset)) | |
2450 | break; | |
c8094d83 | 2451 | |
742f25b3 NS |
2452 | if (virtual_offset |
2453 | || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo))) | |
3cfabe60 | 2454 | { |
bb885938 | 2455 | tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo)); |
8d1f0f67 | 2456 | |
12a669d1 | 2457 | if (virtual_offset) |
3cfabe60 | 2458 | { |
12a669d1 NS |
2459 | /* We convert via virtual base. Adjust the fixed |
2460 | offset to be from there. */ | |
db3927fb AH |
2461 | offset = |
2462 | size_diffop (offset, | |
2463 | convert (ssizetype, | |
2464 | BINFO_OFFSET (virtual_offset))); | |
3cfabe60 NS |
2465 | } |
2466 | if (fixed_offset) | |
2467 | /* There was an existing fixed offset, this must be | |
2468 | from the base just converted to, and the base the | |
2469 | FN was thunking to. */ | |
2470 | fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset); | |
2471 | else | |
2472 | fixed_offset = offset; | |
2473 | } | |
2474 | } | |
c8094d83 | 2475 | |
3cfabe60 NS |
2476 | if (fixed_offset || virtual_offset) |
2477 | /* Replace the overriding function with a covariant thunk. We | |
2478 | will emit the overriding function in its own slot as | |
9bcb9aae | 2479 | well. */ |
3cfabe60 NS |
2480 | overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0, |
2481 | fixed_offset, virtual_offset); | |
2482 | } | |
2483 | else | |
49fedf5a SM |
2484 | gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) || |
2485 | !DECL_THUNK_P (fn)); | |
c8094d83 | 2486 | |
02dea3ff JM |
2487 | /* If we need a covariant thunk, then we may need to adjust first_defn. |
2488 | The ABI specifies that the thunks emitted with a function are | |
2489 | determined by which bases the function overrides, so we need to be | |
2490 | sure that we're using a thunk for some overridden base; even if we | |
2491 | know that the necessary this adjustment is zero, there may not be an | |
2492 | appropriate zero-this-adjusment thunk for us to use since thunks for | |
2493 | overriding virtual bases always use the vcall offset. | |
2494 | ||
2495 | Furthermore, just choosing any base that overrides this function isn't | |
2496 | quite right, as this slot won't be used for calls through a type that | |
2497 | puts a covariant thunk here. Calling the function through such a type | |
2498 | will use a different slot, and that slot is the one that determines | |
2499 | the thunk emitted for that base. | |
2500 | ||
2501 | So, keep looking until we find the base that we're really overriding | |
2502 | in this slot: the nearest primary base that doesn't use a covariant | |
2503 | thunk in this slot. */ | |
2504 | if (overrider_target != overrider_fn) | |
2505 | { | |
2506 | if (BINFO_TYPE (b) == DECL_CONTEXT (overrider_target)) | |
2507 | /* We already know that the overrider needs a covariant thunk. */ | |
2508 | b = get_primary_binfo (b); | |
2509 | for (; ; b = get_primary_binfo (b)) | |
2510 | { | |
2511 | tree main_binfo = TYPE_BINFO (BINFO_TYPE (b)); | |
2512 | tree bv = chain_index (ix, BINFO_VIRTUALS (main_binfo)); | |
02dea3ff JM |
2513 | if (!DECL_THUNK_P (TREE_VALUE (bv))) |
2514 | break; | |
2c1fb3ee JM |
2515 | if (BINFO_LOST_PRIMARY_P (b)) |
2516 | lost = true; | |
02dea3ff JM |
2517 | } |
2518 | first_defn = b; | |
2519 | } | |
2520 | ||
31f8e4f3 MM |
2521 | /* Assume that we will produce a thunk that convert all the way to |
2522 | the final overrider, and not to an intermediate virtual base. */ | |
9ccf6541 | 2523 | virtual_base = NULL_TREE; |
31f8e4f3 | 2524 | |
f11ee281 | 2525 | /* See if we can convert to an intermediate virtual base first, and then |
3461fba7 | 2526 | use the vcall offset located there to finish the conversion. */ |
f11ee281 | 2527 | for (; b; b = BINFO_INHERITANCE_CHAIN (b)) |
4e7512c9 | 2528 | { |
d0cd8b44 JM |
2529 | /* If we find the final overrider, then we can stop |
2530 | walking. */ | |
539ed333 NS |
2531 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (b), |
2532 | BINFO_TYPE (TREE_VALUE (overrider)))) | |
1f84ec23 | 2533 | break; |
31f8e4f3 | 2534 | |
d0cd8b44 JM |
2535 | /* If we find a virtual base, and we haven't yet found the |
2536 | overrider, then there is a virtual base between the | |
2537 | declaring base (first_defn) and the final overrider. */ | |
809e3e7f | 2538 | if (BINFO_VIRTUAL_P (b)) |
dbbf88d1 NS |
2539 | { |
2540 | virtual_base = b; | |
2541 | break; | |
2542 | } | |
4e7512c9 | 2543 | } |
4e7512c9 | 2544 | |
d0cd8b44 JM |
2545 | /* Compute the constant adjustment to the `this' pointer. The |
2546 | `this' pointer, when this function is called, will point at BINFO | |
2547 | (or one of its primary bases, which are at the same offset). */ | |
31f8e4f3 | 2548 | if (virtual_base) |
20dde49d NS |
2549 | /* The `this' pointer needs to be adjusted from the declaration to |
2550 | the nearest virtual base. */ | |
db3927fb AH |
2551 | delta = size_diffop_loc (input_location, |
2552 | convert (ssizetype, BINFO_OFFSET (virtual_base)), | |
bb885938 | 2553 | convert (ssizetype, BINFO_OFFSET (first_defn))); |
f11ee281 JM |
2554 | else if (lost) |
2555 | /* If the nearest definition is in a lost primary, we don't need an | |
2556 | entry in our vtable. Except possibly in a constructor vtable, | |
2557 | if we happen to get our primary back. In that case, the offset | |
2558 | will be zero, as it will be a primary base. */ | |
2559 | delta = size_zero_node; | |
4e7512c9 | 2560 | else |
548502d3 MM |
2561 | /* The `this' pointer needs to be adjusted from pointing to |
2562 | BINFO to pointing at the base where the final overrider | |
2563 | appears. */ | |
db3927fb AH |
2564 | delta = size_diffop_loc (input_location, |
2565 | convert (ssizetype, | |
bb885938 NS |
2566 | BINFO_OFFSET (TREE_VALUE (overrider))), |
2567 | convert (ssizetype, BINFO_OFFSET (binfo))); | |
4e7512c9 | 2568 | |
3cfabe60 | 2569 | modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals); |
31f8e4f3 MM |
2570 | |
2571 | if (virtual_base) | |
c8094d83 | 2572 | BV_VCALL_INDEX (*virtuals) |
3cfabe60 | 2573 | = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base)); |
d1f05f93 NS |
2574 | else |
2575 | BV_VCALL_INDEX (*virtuals) = NULL_TREE; | |
02dea3ff | 2576 | |
8434c305 | 2577 | BV_LOST_PRIMARY (*virtuals) = lost; |
4e7512c9 MM |
2578 | } |
2579 | ||
8026246f | 2580 | /* Called from modify_all_vtables via dfs_walk. */ |
e92cc029 | 2581 | |
8026246f | 2582 | static tree |
94edc4ab | 2583 | dfs_modify_vtables (tree binfo, void* data) |
8026246f | 2584 | { |
bcb1079e | 2585 | tree t = (tree) data; |
5b94d9dd NS |
2586 | tree virtuals; |
2587 | tree old_virtuals; | |
2588 | unsigned ix; | |
2589 | ||
2590 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2591 | /* A base without a vtable needs no modification, and its bases | |
2592 | are uninteresting. */ | |
2593 | return dfs_skip_bases; | |
c8094d83 | 2594 | |
5b94d9dd NS |
2595 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t) |
2596 | && !CLASSTYPE_HAS_PRIMARY_BASE_P (t)) | |
2597 | /* Don't do the primary vtable, if it's new. */ | |
2598 | return NULL_TREE; | |
2599 | ||
2600 | if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo)) | |
2601 | /* There's no need to modify the vtable for a non-virtual primary | |
2602 | base; we're not going to use that vtable anyhow. We do still | |
2603 | need to do this for virtual primary bases, as they could become | |
2604 | non-primary in a construction vtable. */ | |
2605 | return NULL_TREE; | |
2606 | ||
2607 | make_new_vtable (t, binfo); | |
c8094d83 | 2608 | |
5b94d9dd NS |
2609 | /* Now, go through each of the virtual functions in the virtual |
2610 | function table for BINFO. Find the final overrider, and update | |
2611 | the BINFO_VIRTUALS list appropriately. */ | |
2612 | for (ix = 0, virtuals = BINFO_VIRTUALS (binfo), | |
2613 | old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
2614 | virtuals; | |
2615 | ix++, virtuals = TREE_CHAIN (virtuals), | |
2616 | old_virtuals = TREE_CHAIN (old_virtuals)) | |
c8094d83 MS |
2617 | update_vtable_entry_for_fn (t, |
2618 | binfo, | |
5b94d9dd NS |
2619 | BV_FN (old_virtuals), |
2620 | &virtuals, ix); | |
8026246f | 2621 | |
8026246f MM |
2622 | return NULL_TREE; |
2623 | } | |
2624 | ||
a68ad5bd MM |
2625 | /* Update all of the primary and secondary vtables for T. Create new |
2626 | vtables as required, and initialize their RTTI information. Each | |
e6858a84 NS |
2627 | of the functions in VIRTUALS is declared in T and may override a |
2628 | virtual function from a base class; find and modify the appropriate | |
2629 | entries to point to the overriding functions. Returns a list, in | |
2630 | declaration order, of the virtual functions that are declared in T, | |
2631 | but do not appear in the primary base class vtable, and which | |
2632 | should therefore be appended to the end of the vtable for T. */ | |
a68ad5bd MM |
2633 | |
2634 | static tree | |
94edc4ab | 2635 | modify_all_vtables (tree t, tree virtuals) |
8026246f | 2636 | { |
3461fba7 NS |
2637 | tree binfo = TYPE_BINFO (t); |
2638 | tree *fnsp; | |
a68ad5bd | 2639 | |
9d13a069 JM |
2640 | /* Mangle the vtable name before entering dfs_walk (c++/51884). */ |
2641 | if (TYPE_CONTAINS_VPTR_P (t)) | |
2642 | get_vtable_decl (t, false); | |
2643 | ||
5e19c053 | 2644 | /* Update all of the vtables. */ |
5b94d9dd | 2645 | dfs_walk_once (binfo, dfs_modify_vtables, NULL, t); |
a68ad5bd | 2646 | |
e6858a84 NS |
2647 | /* Add virtual functions not already in our primary vtable. These |
2648 | will be both those introduced by this class, and those overridden | |
2649 | from secondary bases. It does not include virtuals merely | |
2650 | inherited from secondary bases. */ | |
2651 | for (fnsp = &virtuals; *fnsp; ) | |
a68ad5bd | 2652 | { |
3461fba7 | 2653 | tree fn = TREE_VALUE (*fnsp); |
a68ad5bd | 2654 | |
e6858a84 NS |
2655 | if (!value_member (fn, BINFO_VIRTUALS (binfo)) |
2656 | || DECL_VINDEX (fn) == error_mark_node) | |
a68ad5bd | 2657 | { |
3461fba7 NS |
2658 | /* We don't need to adjust the `this' pointer when |
2659 | calling this function. */ | |
2660 | BV_DELTA (*fnsp) = integer_zero_node; | |
2661 | BV_VCALL_INDEX (*fnsp) = NULL_TREE; | |
2662 | ||
e6858a84 | 2663 | /* This is a function not already in our vtable. Keep it. */ |
3461fba7 | 2664 | fnsp = &TREE_CHAIN (*fnsp); |
a68ad5bd | 2665 | } |
3461fba7 NS |
2666 | else |
2667 | /* We've already got an entry for this function. Skip it. */ | |
2668 | *fnsp = TREE_CHAIN (*fnsp); | |
a68ad5bd | 2669 | } |
e93ee644 | 2670 | |
e6858a84 | 2671 | return virtuals; |
7177d104 MS |
2672 | } |
2673 | ||
7d5b8b11 MM |
2674 | /* Get the base virtual function declarations in T that have the |
2675 | indicated NAME. */ | |
e92cc029 | 2676 | |
5ddc28a5 | 2677 | static tree |
94edc4ab | 2678 | get_basefndecls (tree name, tree t) |
9e9ff709 | 2679 | { |
7d5b8b11 | 2680 | tree methods; |
9e9ff709 | 2681 | tree base_fndecls = NULL_TREE; |
604a3205 | 2682 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
7d5b8b11 | 2683 | int i; |
9e9ff709 | 2684 | |
3d1df1fa MM |
2685 | /* Find virtual functions in T with the indicated NAME. */ |
2686 | i = lookup_fnfields_1 (t, name); | |
2687 | if (i != -1) | |
9771b263 | 2688 | for (methods = (*CLASSTYPE_METHOD_VEC (t))[i]; |
3d1df1fa MM |
2689 | methods; |
2690 | methods = OVL_NEXT (methods)) | |
2691 | { | |
2692 | tree method = OVL_CURRENT (methods); | |
2693 | ||
2694 | if (TREE_CODE (method) == FUNCTION_DECL | |
2695 | && DECL_VINDEX (method)) | |
2696 | base_fndecls = tree_cons (NULL_TREE, method, base_fndecls); | |
2697 | } | |
9e9ff709 MS |
2698 | |
2699 | if (base_fndecls) | |
2700 | return base_fndecls; | |
2701 | ||
2702 | for (i = 0; i < n_baseclasses; i++) | |
2703 | { | |
604a3205 | 2704 | tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i)); |
7d5b8b11 | 2705 | base_fndecls = chainon (get_basefndecls (name, basetype), |
9e9ff709 MS |
2706 | base_fndecls); |
2707 | } | |
2708 | ||
2709 | return base_fndecls; | |
2710 | } | |
2711 | ||
2ee887f2 MS |
2712 | /* If this declaration supersedes the declaration of |
2713 | a method declared virtual in the base class, then | |
2714 | mark this field as being virtual as well. */ | |
2715 | ||
9f4faeae | 2716 | void |
94edc4ab | 2717 | check_for_override (tree decl, tree ctype) |
2ee887f2 | 2718 | { |
7506ab1d | 2719 | bool overrides_found = false; |
cbb40945 NS |
2720 | if (TREE_CODE (decl) == TEMPLATE_DECL) |
2721 | /* In [temp.mem] we have: | |
2ee887f2 | 2722 | |
0cbd7506 MS |
2723 | A specialization of a member function template does not |
2724 | override a virtual function from a base class. */ | |
cbb40945 NS |
2725 | return; |
2726 | if ((DECL_DESTRUCTOR_P (decl) | |
a6c0d772 MM |
2727 | || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) |
2728 | || DECL_CONV_FN_P (decl)) | |
cbb40945 NS |
2729 | && look_for_overrides (ctype, decl) |
2730 | && !DECL_STATIC_FUNCTION_P (decl)) | |
e6858a84 NS |
2731 | /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor |
2732 | the error_mark_node so that we know it is an overriding | |
2733 | function. */ | |
7506ab1d VV |
2734 | { |
2735 | DECL_VINDEX (decl) = decl; | |
2736 | overrides_found = true; | |
2737 | } | |
e6858a84 | 2738 | |
cbb40945 | 2739 | if (DECL_VIRTUAL_P (decl)) |
2ee887f2 | 2740 | { |
e6858a84 | 2741 | if (!DECL_VINDEX (decl)) |
2ee887f2 MS |
2742 | DECL_VINDEX (decl) = error_mark_node; |
2743 | IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1; | |
5ade176d JM |
2744 | if (DECL_DESTRUCTOR_P (decl)) |
2745 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype) = true; | |
2ee887f2 | 2746 | } |
7506ab1d VV |
2747 | else if (DECL_FINAL_P (decl)) |
2748 | error ("%q+#D marked final, but is not virtual", decl); | |
2749 | if (DECL_OVERRIDE_P (decl) && !overrides_found) | |
2750 | error ("%q+#D marked override, but does not override", decl); | |
2ee887f2 MS |
2751 | } |
2752 | ||
fc378698 MS |
2753 | /* Warn about hidden virtual functions that are not overridden in t. |
2754 | We know that constructors and destructors don't apply. */ | |
e92cc029 | 2755 | |
b23e103b | 2756 | static void |
94edc4ab | 2757 | warn_hidden (tree t) |
9e9ff709 | 2758 | { |
9771b263 | 2759 | vec<tree, va_gc> *method_vec = CLASSTYPE_METHOD_VEC (t); |
aaaa46d2 MM |
2760 | tree fns; |
2761 | size_t i; | |
9e9ff709 MS |
2762 | |
2763 | /* We go through each separately named virtual function. */ | |
c8094d83 | 2764 | for (i = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2765 | vec_safe_iterate (method_vec, i, &fns); |
aaaa46d2 | 2766 | ++i) |
9e9ff709 | 2767 | { |
aaaa46d2 | 2768 | tree fn; |
7d5b8b11 MM |
2769 | tree name; |
2770 | tree fndecl; | |
2771 | tree base_fndecls; | |
fa743e8c NS |
2772 | tree base_binfo; |
2773 | tree binfo; | |
7d5b8b11 MM |
2774 | int j; |
2775 | ||
2776 | /* All functions in this slot in the CLASSTYPE_METHOD_VEC will | |
2777 | have the same name. Figure out what name that is. */ | |
aaaa46d2 | 2778 | name = DECL_NAME (OVL_CURRENT (fns)); |
7d5b8b11 MM |
2779 | /* There are no possibly hidden functions yet. */ |
2780 | base_fndecls = NULL_TREE; | |
2781 | /* Iterate through all of the base classes looking for possibly | |
2782 | hidden functions. */ | |
fa743e8c NS |
2783 | for (binfo = TYPE_BINFO (t), j = 0; |
2784 | BINFO_BASE_ITERATE (binfo, j, base_binfo); j++) | |
a4832853 | 2785 | { |
fa743e8c | 2786 | tree basetype = BINFO_TYPE (base_binfo); |
7d5b8b11 MM |
2787 | base_fndecls = chainon (get_basefndecls (name, basetype), |
2788 | base_fndecls); | |
a4832853 JM |
2789 | } |
2790 | ||
00a17e31 | 2791 | /* If there are no functions to hide, continue. */ |
7d5b8b11 | 2792 | if (!base_fndecls) |
9e9ff709 MS |
2793 | continue; |
2794 | ||
00a17e31 | 2795 | /* Remove any overridden functions. */ |
aaaa46d2 | 2796 | for (fn = fns; fn; fn = OVL_NEXT (fn)) |
9e9ff709 | 2797 | { |
aaaa46d2 | 2798 | fndecl = OVL_CURRENT (fn); |
7d5b8b11 MM |
2799 | if (DECL_VINDEX (fndecl)) |
2800 | { | |
2801 | tree *prev = &base_fndecls; | |
c8094d83 MS |
2802 | |
2803 | while (*prev) | |
7d5b8b11 MM |
2804 | /* If the method from the base class has the same |
2805 | signature as the method from the derived class, it | |
2806 | has been overridden. */ | |
2807 | if (same_signature_p (fndecl, TREE_VALUE (*prev))) | |
2808 | *prev = TREE_CHAIN (*prev); | |
2809 | else | |
2810 | prev = &TREE_CHAIN (*prev); | |
2811 | } | |
9e9ff709 MS |
2812 | } |
2813 | ||
9e9ff709 MS |
2814 | /* Now give a warning for all base functions without overriders, |
2815 | as they are hidden. */ | |
c8094d83 | 2816 | while (base_fndecls) |
7d5b8b11 MM |
2817 | { |
2818 | /* Here we know it is a hider, and no overrider exists. */ | |
286d12f9 MLI |
2819 | warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls)); |
2820 | warning (OPT_Woverloaded_virtual, " by %q+D", fns); | |
7d5b8b11 MM |
2821 | base_fndecls = TREE_CHAIN (base_fndecls); |
2822 | } | |
9e9ff709 MS |
2823 | } |
2824 | } | |
2825 | ||
096a4865 PC |
2826 | /* Recursive helper for finish_struct_anon. */ |
2827 | ||
2828 | static void | |
2829 | finish_struct_anon_r (tree field, bool complain) | |
2830 | { | |
2831 | bool is_union = TREE_CODE (TREE_TYPE (field)) == UNION_TYPE; | |
2832 | tree elt = TYPE_FIELDS (TREE_TYPE (field)); | |
2833 | for (; elt; elt = DECL_CHAIN (elt)) | |
2834 | { | |
2835 | /* We're generally only interested in entities the user | |
2836 | declared, but we also find nested classes by noticing | |
2837 | the TYPE_DECL that we create implicitly. You're | |
2838 | allowed to put one anonymous union inside another, | |
2839 | though, so we explicitly tolerate that. We use | |
2840 | TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that | |
2841 | we also allow unnamed types used for defining fields. */ | |
2842 | if (DECL_ARTIFICIAL (elt) | |
2843 | && (!DECL_IMPLICIT_TYPEDEF_P (elt) | |
2844 | || TYPE_ANONYMOUS_P (TREE_TYPE (elt)))) | |
2845 | continue; | |
2846 | ||
2847 | if (TREE_CODE (elt) != FIELD_DECL) | |
2848 | { | |
2849 | if (complain) | |
2850 | { | |
2851 | if (is_union) | |
2852 | permerror (input_location, | |
2853 | "%q+#D invalid; an anonymous union can " | |
2854 | "only have non-static data members", elt); | |
2855 | else | |
2856 | permerror (input_location, | |
2857 | "%q+#D invalid; an anonymous struct can " | |
2858 | "only have non-static data members", elt); | |
2859 | } | |
2860 | continue; | |
2861 | } | |
2862 | ||
2863 | if (complain) | |
2864 | { | |
2865 | if (TREE_PRIVATE (elt)) | |
2866 | { | |
2867 | if (is_union) | |
2868 | permerror (input_location, | |
2869 | "private member %q+#D in anonymous union", elt); | |
2870 | else | |
2871 | permerror (input_location, | |
2872 | "private member %q+#D in anonymous struct", elt); | |
2873 | } | |
2874 | else if (TREE_PROTECTED (elt)) | |
2875 | { | |
2876 | if (is_union) | |
2877 | permerror (input_location, | |
2878 | "protected member %q+#D in anonymous union", elt); | |
2879 | else | |
2880 | permerror (input_location, | |
2881 | "protected member %q+#D in anonymous struct", elt); | |
2882 | } | |
2883 | } | |
2884 | ||
2885 | TREE_PRIVATE (elt) = TREE_PRIVATE (field); | |
2886 | TREE_PROTECTED (elt) = TREE_PROTECTED (field); | |
2887 | ||
2888 | /* Recurse into the anonymous aggregates to handle correctly | |
2889 | access control (c++/24926): | |
2890 | ||
2891 | class A { | |
2892 | union { | |
2893 | union { | |
2894 | int i; | |
2895 | }; | |
2896 | }; | |
2897 | }; | |
2898 | ||
2899 | int j=A().i; */ | |
2900 | if (DECL_NAME (elt) == NULL_TREE | |
2901 | && ANON_AGGR_TYPE_P (TREE_TYPE (elt))) | |
2902 | finish_struct_anon_r (elt, /*complain=*/false); | |
2903 | } | |
2904 | } | |
2905 | ||
9e9ff709 MS |
2906 | /* Check for things that are invalid. There are probably plenty of other |
2907 | things we should check for also. */ | |
e92cc029 | 2908 | |
9e9ff709 | 2909 | static void |
94edc4ab | 2910 | finish_struct_anon (tree t) |
9e9ff709 | 2911 | { |
096a4865 | 2912 | for (tree field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
9e9ff709 MS |
2913 | { |
2914 | if (TREE_STATIC (field)) | |
2915 | continue; | |
2916 | if (TREE_CODE (field) != FIELD_DECL) | |
2917 | continue; | |
2918 | ||
2919 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 2920 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
096a4865 | 2921 | finish_struct_anon_r (field, /*complain=*/true); |
9e9ff709 MS |
2922 | } |
2923 | } | |
2924 | ||
7088fca9 KL |
2925 | /* Add T to CLASSTYPE_DECL_LIST of current_class_type which |
2926 | will be used later during class template instantiation. | |
2927 | When FRIEND_P is zero, T can be a static member data (VAR_DECL), | |
2928 | a non-static member data (FIELD_DECL), a member function | |
c8094d83 | 2929 | (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE), |
7088fca9 KL |
2930 | a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL) |
2931 | When FRIEND_P is nonzero, T is either a friend class | |
2932 | (RECORD_TYPE, TEMPLATE_DECL) or a friend function | |
2933 | (FUNCTION_DECL, TEMPLATE_DECL). */ | |
2934 | ||
2935 | void | |
94edc4ab | 2936 | maybe_add_class_template_decl_list (tree type, tree t, int friend_p) |
7088fca9 KL |
2937 | { |
2938 | /* Save some memory by not creating TREE_LIST if TYPE is not template. */ | |
2939 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
2940 | CLASSTYPE_DECL_LIST (type) | |
2941 | = tree_cons (friend_p ? NULL_TREE : type, | |
2942 | t, CLASSTYPE_DECL_LIST (type)); | |
2943 | } | |
2944 | ||
ca2409f9 DS |
2945 | /* This function is called from declare_virt_assop_and_dtor via |
2946 | dfs_walk_all. | |
2947 | ||
2948 | DATA is a type that direcly or indirectly inherits the base | |
2949 | represented by BINFO. If BINFO contains a virtual assignment [copy | |
2950 | assignment or move assigment] operator or a virtual constructor, | |
2951 | declare that function in DATA if it hasn't been already declared. */ | |
2952 | ||
2953 | static tree | |
2954 | dfs_declare_virt_assop_and_dtor (tree binfo, void *data) | |
2955 | { | |
2956 | tree bv, fn, t = (tree)data; | |
2957 | tree opname = ansi_assopname (NOP_EXPR); | |
2958 | ||
2959 | gcc_assert (t && CLASS_TYPE_P (t)); | |
2960 | gcc_assert (binfo && TREE_CODE (binfo) == TREE_BINFO); | |
2961 | ||
2962 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2963 | /* A base without a vtable needs no modification, and its bases | |
2964 | are uninteresting. */ | |
2965 | return dfs_skip_bases; | |
2966 | ||
2967 | if (BINFO_PRIMARY_P (binfo)) | |
2968 | /* If this is a primary base, then we have already looked at the | |
2969 | virtual functions of its vtable. */ | |
2970 | return NULL_TREE; | |
2971 | ||
2972 | for (bv = BINFO_VIRTUALS (binfo); bv; bv = TREE_CHAIN (bv)) | |
2973 | { | |
2974 | fn = BV_FN (bv); | |
2975 | ||
2976 | if (DECL_NAME (fn) == opname) | |
2977 | { | |
2978 | if (CLASSTYPE_LAZY_COPY_ASSIGN (t)) | |
2979 | lazily_declare_fn (sfk_copy_assignment, t); | |
2980 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
2981 | lazily_declare_fn (sfk_move_assignment, t); | |
2982 | } | |
2983 | else if (DECL_DESTRUCTOR_P (fn) | |
2984 | && CLASSTYPE_LAZY_DESTRUCTOR (t)) | |
2985 | lazily_declare_fn (sfk_destructor, t); | |
2986 | } | |
2987 | ||
2988 | return NULL_TREE; | |
2989 | } | |
2990 | ||
2991 | /* If the class type T has a direct or indirect base that contains a | |
2992 | virtual assignment operator or a virtual destructor, declare that | |
2993 | function in T if it hasn't been already declared. */ | |
2994 | ||
2995 | static void | |
2996 | declare_virt_assop_and_dtor (tree t) | |
2997 | { | |
2998 | if (!(TYPE_POLYMORPHIC_P (t) | |
2999 | && (CLASSTYPE_LAZY_COPY_ASSIGN (t) | |
3000 | || CLASSTYPE_LAZY_MOVE_ASSIGN (t) | |
3001 | || CLASSTYPE_LAZY_DESTRUCTOR (t)))) | |
3002 | return; | |
3003 | ||
3004 | dfs_walk_all (TYPE_BINFO (t), | |
3005 | dfs_declare_virt_assop_and_dtor, | |
3006 | NULL, t); | |
3007 | } | |
3008 | ||
85b5d65a JM |
3009 | /* Declare the inheriting constructor for class T inherited from base |
3010 | constructor CTOR with the parameter array PARMS of size NPARMS. */ | |
3011 | ||
3012 | static void | |
3013 | one_inheriting_sig (tree t, tree ctor, tree *parms, int nparms) | |
3014 | { | |
3015 | /* We don't declare an inheriting ctor that would be a default, | |
e252e96a JM |
3016 | copy or move ctor for derived or base. */ |
3017 | if (nparms == 0) | |
85b5d65a | 3018 | return; |
e252e96a JM |
3019 | if (nparms == 1 |
3020 | && TREE_CODE (parms[0]) == REFERENCE_TYPE) | |
3021 | { | |
3022 | tree parm = TYPE_MAIN_VARIANT (TREE_TYPE (parms[0])); | |
3023 | if (parm == t || parm == DECL_CONTEXT (ctor)) | |
3024 | return; | |
3025 | } | |
3026 | ||
85b5d65a | 3027 | tree parmlist = void_list_node; |
e252e96a | 3028 | for (int i = nparms - 1; i >= 0; i--) |
85b5d65a JM |
3029 | parmlist = tree_cons (NULL_TREE, parms[i], parmlist); |
3030 | tree fn = implicitly_declare_fn (sfk_inheriting_constructor, | |
3031 | t, false, ctor, parmlist); | |
3032 | if (add_method (t, fn, NULL_TREE)) | |
3033 | { | |
3034 | DECL_CHAIN (fn) = TYPE_METHODS (t); | |
3035 | TYPE_METHODS (t) = fn; | |
3036 | } | |
3037 | } | |
3038 | ||
3039 | /* Declare all the inheriting constructors for class T inherited from base | |
3040 | constructor CTOR. */ | |
3041 | ||
3042 | static void | |
3043 | one_inherited_ctor (tree ctor, tree t) | |
3044 | { | |
3045 | tree parms = FUNCTION_FIRST_USER_PARMTYPE (ctor); | |
3046 | ||
3047 | tree *new_parms = XALLOCAVEC (tree, list_length (parms)); | |
3048 | int i = 0; | |
3049 | for (; parms && parms != void_list_node; parms = TREE_CHAIN (parms)) | |
3050 | { | |
3051 | if (TREE_PURPOSE (parms)) | |
3052 | one_inheriting_sig (t, ctor, new_parms, i); | |
3053 | new_parms[i++] = TREE_VALUE (parms); | |
3054 | } | |
3055 | one_inheriting_sig (t, ctor, new_parms, i); | |
4514a96b JM |
3056 | if (parms == NULL_TREE) |
3057 | { | |
3058 | warning (OPT_Winherited_variadic_ctor, | |
3059 | "the ellipsis in %qD is not inherited", ctor); | |
3060 | inform (DECL_SOURCE_LOCATION (ctor), "%qD declared here", ctor); | |
3061 | } | |
85b5d65a JM |
3062 | } |
3063 | ||
61a127b3 | 3064 | /* Create default constructors, assignment operators, and so forth for |
e5e459bf AO |
3065 | the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR, |
3066 | and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, | |
3067 | the class cannot have a default constructor, copy constructor | |
3068 | taking a const reference argument, or an assignment operator taking | |
3069 | a const reference, respectively. */ | |
61a127b3 | 3070 | |
f72ab53b | 3071 | static void |
85b5d65a | 3072 | add_implicitly_declared_members (tree t, tree* access_decls, |
94edc4ab | 3073 | int cant_have_const_cctor, |
10746f37 | 3074 | int cant_have_const_assignment) |
61a127b3 | 3075 | { |
830dea94 JM |
3076 | bool move_ok = false; |
3077 | ||
604b2bfc | 3078 | if (cxx_dialect >= cxx11 && !CLASSTYPE_DESTRUCTORS (t) |
830dea94 JM |
3079 | && !TYPE_HAS_COPY_CTOR (t) && !TYPE_HAS_COPY_ASSIGN (t) |
3080 | && !type_has_move_constructor (t) && !type_has_move_assign (t)) | |
3081 | move_ok = true; | |
3082 | ||
61a127b3 | 3083 | /* Destructor. */ |
9f4faeae | 3084 | if (!CLASSTYPE_DESTRUCTORS (t)) |
61a127b3 | 3085 | { |
9f4faeae MM |
3086 | /* In general, we create destructors lazily. */ |
3087 | CLASSTYPE_LAZY_DESTRUCTOR (t) = 1; | |
9f4faeae | 3088 | |
d1a115f8 JM |
3089 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
3090 | && TYPE_FOR_JAVA (t)) | |
3091 | /* But if this is a Java class, any non-trivial destructor is | |
3092 | invalid, even if compiler-generated. Therefore, if the | |
3093 | destructor is non-trivial we create it now. */ | |
3094 | lazily_declare_fn (sfk_destructor, t); | |
61a127b3 | 3095 | } |
61a127b3 | 3096 | |
0fcedd9c JM |
3097 | /* [class.ctor] |
3098 | ||
3099 | If there is no user-declared constructor for a class, a default | |
3100 | constructor is implicitly declared. */ | |
3101 | if (! TYPE_HAS_USER_CONSTRUCTOR (t)) | |
61a127b3 | 3102 | { |
508a1c9c | 3103 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1; |
0930cc0e | 3104 | CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1; |
604b2bfc | 3105 | if (cxx_dialect >= cxx11) |
0930cc0e | 3106 | TYPE_HAS_CONSTEXPR_CTOR (t) |
fd3faf2b JM |
3107 | /* This might force the declaration. */ |
3108 | = type_has_constexpr_default_constructor (t); | |
61a127b3 MM |
3109 | } |
3110 | ||
0fcedd9c JM |
3111 | /* [class.ctor] |
3112 | ||
3113 | If a class definition does not explicitly declare a copy | |
3114 | constructor, one is declared implicitly. */ | |
a2e70335 | 3115 | if (! TYPE_HAS_COPY_CTOR (t) && ! TYPE_FOR_JAVA (t)) |
61a127b3 | 3116 | { |
066ec0a4 JM |
3117 | TYPE_HAS_COPY_CTOR (t) = 1; |
3118 | TYPE_HAS_CONST_COPY_CTOR (t) = !cant_have_const_cctor; | |
508a1c9c | 3119 | CLASSTYPE_LAZY_COPY_CTOR (t) = 1; |
830dea94 | 3120 | if (move_ok) |
d758e847 | 3121 | CLASSTYPE_LAZY_MOVE_CTOR (t) = 1; |
61a127b3 MM |
3122 | } |
3123 | ||
aaaa46d2 MM |
3124 | /* If there is no assignment operator, one will be created if and |
3125 | when it is needed. For now, just record whether or not the type | |
3126 | of the parameter to the assignment operator will be a const or | |
3127 | non-const reference. */ | |
a2e70335 | 3128 | if (!TYPE_HAS_COPY_ASSIGN (t) && !TYPE_FOR_JAVA (t)) |
fb232476 | 3129 | { |
066ec0a4 JM |
3130 | TYPE_HAS_COPY_ASSIGN (t) = 1; |
3131 | TYPE_HAS_CONST_COPY_ASSIGN (t) = !cant_have_const_assignment; | |
3132 | CLASSTYPE_LAZY_COPY_ASSIGN (t) = 1; | |
830dea94 | 3133 | if (move_ok) |
d758e847 | 3134 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 1; |
fb232476 | 3135 | } |
d1a115f8 JM |
3136 | |
3137 | /* We can't be lazy about declaring functions that might override | |
3138 | a virtual function from a base class. */ | |
ca2409f9 | 3139 | declare_virt_assop_and_dtor (t); |
85b5d65a JM |
3140 | |
3141 | while (*access_decls) | |
3142 | { | |
3143 | tree using_decl = TREE_VALUE (*access_decls); | |
3144 | tree decl = USING_DECL_DECLS (using_decl); | |
140bec21 | 3145 | if (DECL_NAME (using_decl) == ctor_identifier) |
85b5d65a JM |
3146 | { |
3147 | /* declare, then remove the decl */ | |
140bec21 | 3148 | tree ctor_list = decl; |
85b5d65a JM |
3149 | location_t loc = input_location; |
3150 | input_location = DECL_SOURCE_LOCATION (using_decl); | |
3151 | if (ctor_list) | |
3152 | for (; ctor_list; ctor_list = OVL_NEXT (ctor_list)) | |
3153 | one_inherited_ctor (OVL_CURRENT (ctor_list), t); | |
3154 | *access_decls = TREE_CHAIN (*access_decls); | |
3155 | input_location = loc; | |
3156 | } | |
3157 | else | |
3158 | access_decls = &TREE_CHAIN (*access_decls); | |
3159 | } | |
61a127b3 MM |
3160 | } |
3161 | ||
cba0366c FC |
3162 | /* Subroutine of insert_into_classtype_sorted_fields. Recursively |
3163 | count the number of fields in TYPE, including anonymous union | |
3164 | members. */ | |
f90cdf34 MT |
3165 | |
3166 | static int | |
94edc4ab | 3167 | count_fields (tree fields) |
f90cdf34 MT |
3168 | { |
3169 | tree x; | |
3170 | int n_fields = 0; | |
910ad8de | 3171 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
3172 | { |
3173 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
3174 | n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x))); | |
3175 | else | |
3176 | n_fields += 1; | |
3177 | } | |
3178 | return n_fields; | |
3179 | } | |
3180 | ||
cba0366c FC |
3181 | /* Subroutine of insert_into_classtype_sorted_fields. Recursively add |
3182 | all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE | |
3183 | elts, starting at offset IDX. */ | |
f90cdf34 MT |
3184 | |
3185 | static int | |
d07605f5 | 3186 | add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx) |
f90cdf34 MT |
3187 | { |
3188 | tree x; | |
910ad8de | 3189 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
3190 | { |
3191 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
d07605f5 | 3192 | idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx); |
f90cdf34 | 3193 | else |
d07605f5 | 3194 | field_vec->elts[idx++] = x; |
f90cdf34 MT |
3195 | } |
3196 | return idx; | |
3197 | } | |
3198 | ||
cba0366c FC |
3199 | /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts, |
3200 | starting at offset IDX. */ | |
3201 | ||
3202 | static int | |
3203 | add_enum_fields_to_record_type (tree enumtype, | |
3204 | struct sorted_fields_type *field_vec, | |
3205 | int idx) | |
3206 | { | |
3207 | tree values; | |
3208 | for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) | |
3209 | field_vec->elts[idx++] = TREE_VALUE (values); | |
3210 | return idx; | |
3211 | } | |
3212 | ||
1e30f9b4 MM |
3213 | /* FIELD is a bit-field. We are finishing the processing for its |
3214 | enclosing type. Issue any appropriate messages and set appropriate | |
e7df0180 | 3215 | flags. Returns false if an error has been diagnosed. */ |
1e30f9b4 | 3216 | |
e7df0180 | 3217 | static bool |
94edc4ab | 3218 | check_bitfield_decl (tree field) |
1e30f9b4 MM |
3219 | { |
3220 | tree type = TREE_TYPE (field); | |
606791f6 MM |
3221 | tree w; |
3222 | ||
3223 | /* Extract the declared width of the bitfield, which has been | |
3224 | temporarily stashed in DECL_INITIAL. */ | |
3225 | w = DECL_INITIAL (field); | |
3db45ab5 | 3226 | gcc_assert (w != NULL_TREE); |
606791f6 MM |
3227 | /* Remove the bit-field width indicator so that the rest of the |
3228 | compiler does not treat that value as an initializer. */ | |
3229 | DECL_INITIAL (field) = NULL_TREE; | |
1e30f9b4 | 3230 | |
cd8ed629 | 3231 | /* Detect invalid bit-field type. */ |
550a799d | 3232 | if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type)) |
1e30f9b4 | 3233 | { |
dee15844 | 3234 | error ("bit-field %q+#D with non-integral type", field); |
cd8ed629 | 3235 | w = error_mark_node; |
1e30f9b4 | 3236 | } |
606791f6 | 3237 | else |
1e30f9b4 | 3238 | { |
9e115cec | 3239 | location_t loc = input_location; |
1e30f9b4 MM |
3240 | /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */ |
3241 | STRIP_NOPS (w); | |
3242 | ||
3243 | /* detect invalid field size. */ | |
9e115cec | 3244 | input_location = DECL_SOURCE_LOCATION (field); |
fa2200cb | 3245 | w = cxx_constant_value (w); |
9e115cec | 3246 | input_location = loc; |
1e30f9b4 MM |
3247 | |
3248 | if (TREE_CODE (w) != INTEGER_CST) | |
3249 | { | |
dee15844 | 3250 | error ("bit-field %q+D width not an integer constant", field); |
cd8ed629 | 3251 | w = error_mark_node; |
1e30f9b4 | 3252 | } |
05bccae2 | 3253 | else if (tree_int_cst_sgn (w) < 0) |
1e30f9b4 | 3254 | { |
dee15844 | 3255 | error ("negative width in bit-field %q+D", field); |
cd8ed629 | 3256 | w = error_mark_node; |
1e30f9b4 | 3257 | } |
05bccae2 | 3258 | else if (integer_zerop (w) && DECL_NAME (field) != 0) |
1e30f9b4 | 3259 | { |
dee15844 | 3260 | error ("zero width for bit-field %q+D", field); |
cd8ed629 | 3261 | w = error_mark_node; |
1e30f9b4 | 3262 | } |
7f5d76fb PC |
3263 | else if ((TREE_CODE (type) != ENUMERAL_TYPE |
3264 | && TREE_CODE (type) != BOOLEAN_TYPE | |
3265 | && compare_tree_int (w, TYPE_PRECISION (type)) > 0) | |
3266 | || ((TREE_CODE (type) == ENUMERAL_TYPE | |
3267 | || TREE_CODE (type) == BOOLEAN_TYPE) | |
3268 | && tree_int_cst_lt (TYPE_SIZE (type), w))) | |
dee15844 | 3269 | warning (0, "width of %q+D exceeds its type", field); |
1e30f9b4 | 3270 | else if (TREE_CODE (type) == ENUMERAL_TYPE |
cbb4feb3 JM |
3271 | && (0 > (compare_tree_int |
3272 | (w, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type)))))) | |
dee15844 | 3273 | warning (0, "%q+D is too small to hold all values of %q#T", field, type); |
cd8ed629 | 3274 | } |
c8094d83 | 3275 | |
cd8ed629 MM |
3276 | if (w != error_mark_node) |
3277 | { | |
3278 | DECL_SIZE (field) = convert (bitsizetype, w); | |
3279 | DECL_BIT_FIELD (field) = 1; | |
e7df0180 | 3280 | return true; |
1e30f9b4 MM |
3281 | } |
3282 | else | |
cd8ed629 MM |
3283 | { |
3284 | /* Non-bit-fields are aligned for their type. */ | |
3285 | DECL_BIT_FIELD (field) = 0; | |
3286 | CLEAR_DECL_C_BIT_FIELD (field); | |
e7df0180 | 3287 | return false; |
cd8ed629 | 3288 | } |
1e30f9b4 MM |
3289 | } |
3290 | ||
3291 | /* FIELD is a non bit-field. We are finishing the processing for its | |
3292 | enclosing type T. Issue any appropriate messages and set appropriate | |
3293 | flags. */ | |
3294 | ||
3295 | static void | |
94edc4ab | 3296 | check_field_decl (tree field, |
0cbd7506 MS |
3297 | tree t, |
3298 | int* cant_have_const_ctor, | |
3299 | int* no_const_asn_ref, | |
10746f37 | 3300 | int* any_default_members) |
1e30f9b4 MM |
3301 | { |
3302 | tree type = strip_array_types (TREE_TYPE (field)); | |
3303 | ||
57ece258 | 3304 | /* In C++98 an anonymous union cannot contain any fields which would change |
1e30f9b4 | 3305 | the settings of CANT_HAVE_CONST_CTOR and friends. */ |
604b2bfc | 3306 | if (ANON_UNION_TYPE_P (type) && cxx_dialect < cxx11) |
1e30f9b4 | 3307 | ; |
066ec0a4 | 3308 | /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous |
1e30f9b4 MM |
3309 | structs. So, we recurse through their fields here. */ |
3310 | else if (ANON_AGGR_TYPE_P (type)) | |
3311 | { | |
3312 | tree fields; | |
3313 | ||
910ad8de | 3314 | for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields)) |
17aec3eb | 3315 | if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field)) |
1e30f9b4 | 3316 | check_field_decl (fields, t, cant_have_const_ctor, |
10746f37 | 3317 | no_const_asn_ref, any_default_members); |
1e30f9b4 MM |
3318 | } |
3319 | /* Check members with class type for constructors, destructors, | |
3320 | etc. */ | |
3321 | else if (CLASS_TYPE_P (type)) | |
3322 | { | |
3323 | /* Never let anything with uninheritable virtuals | |
3324 | make it through without complaint. */ | |
3325 | abstract_virtuals_error (field, type); | |
c8094d83 | 3326 | |
604b2bfc | 3327 | if (TREE_CODE (t) == UNION_TYPE && cxx_dialect < cxx11) |
1e30f9b4 | 3328 | { |
57ece258 JM |
3329 | static bool warned; |
3330 | int oldcount = errorcount; | |
1e30f9b4 | 3331 | if (TYPE_NEEDS_CONSTRUCTING (type)) |
dee15844 JM |
3332 | error ("member %q+#D with constructor not allowed in union", |
3333 | field); | |
834c6dff | 3334 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
dee15844 | 3335 | error ("member %q+#D with destructor not allowed in union", field); |
066ec0a4 | 3336 | if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type)) |
dee15844 JM |
3337 | error ("member %q+#D with copy assignment operator not allowed in union", |
3338 | field); | |
57ece258 JM |
3339 | if (!warned && errorcount > oldcount) |
3340 | { | |
3341 | inform (DECL_SOURCE_LOCATION (field), "unrestricted unions " | |
97e3ad20 | 3342 | "only available with -std=c++11 or -std=gnu++11"); |
57ece258 JM |
3343 | warned = true; |
3344 | } | |
1e30f9b4 MM |
3345 | } |
3346 | else | |
3347 | { | |
3348 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type); | |
c8094d83 | 3349 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 3350 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type); |
d758e847 JM |
3351 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
3352 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type) | |
3353 | || !TYPE_HAS_COPY_ASSIGN (type)); | |
3354 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type) | |
3355 | || !TYPE_HAS_COPY_CTOR (type)); | |
ac177431 JM |
3356 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type); |
3357 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type); | |
3358 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type) | |
3359 | || TYPE_HAS_COMPLEX_DFLT (type)); | |
1e30f9b4 MM |
3360 | } |
3361 | ||
d758e847 JM |
3362 | if (TYPE_HAS_COPY_CTOR (type) |
3363 | && !TYPE_HAS_CONST_COPY_CTOR (type)) | |
1e30f9b4 MM |
3364 | *cant_have_const_ctor = 1; |
3365 | ||
d758e847 JM |
3366 | if (TYPE_HAS_COPY_ASSIGN (type) |
3367 | && !TYPE_HAS_CONST_COPY_ASSIGN (type)) | |
1e30f9b4 | 3368 | *no_const_asn_ref = 1; |
1e30f9b4 | 3369 | } |
7dbb85a7 JM |
3370 | |
3371 | check_abi_tags (t, field); | |
3372 | ||
1e30f9b4 MM |
3373 | if (DECL_INITIAL (field) != NULL_TREE) |
3374 | { | |
3375 | /* `build_class_init_list' does not recognize | |
3376 | non-FIELD_DECLs. */ | |
0e5f8a59 | 3377 | if (TREE_CODE (t) == UNION_TYPE && *any_default_members != 0) |
1f070f2b | 3378 | error ("multiple fields in union %qT initialized", t); |
1e30f9b4 MM |
3379 | *any_default_members = 1; |
3380 | } | |
6bb88f3b | 3381 | } |
1e30f9b4 | 3382 | |
08b962b0 MM |
3383 | /* Check the data members (both static and non-static), class-scoped |
3384 | typedefs, etc., appearing in the declaration of T. Issue | |
3385 | appropriate diagnostics. Sets ACCESS_DECLS to a list (in | |
3386 | declaration order) of access declarations; each TREE_VALUE in this | |
3387 | list is a USING_DECL. | |
8d08fdba | 3388 | |
08b962b0 | 3389 | In addition, set the following flags: |
8d08fdba | 3390 | |
08b962b0 MM |
3391 | EMPTY_P |
3392 | The class is empty, i.e., contains no non-static data members. | |
8d08fdba | 3393 | |
08b962b0 MM |
3394 | CANT_HAVE_CONST_CTOR_P |
3395 | This class cannot have an implicitly generated copy constructor | |
3396 | taking a const reference. | |
8d08fdba | 3397 | |
08b962b0 MM |
3398 | CANT_HAVE_CONST_ASN_REF |
3399 | This class cannot have an implicitly generated assignment | |
3400 | operator taking a const reference. | |
8d08fdba | 3401 | |
08b962b0 MM |
3402 | All of these flags should be initialized before calling this |
3403 | function. | |
8d08fdba | 3404 | |
08b962b0 MM |
3405 | Returns a pointer to the end of the TYPE_FIELDs chain; additional |
3406 | fields can be added by adding to this chain. */ | |
8d08fdba | 3407 | |
607cf131 | 3408 | static void |
58731fd1 | 3409 | check_field_decls (tree t, tree *access_decls, |
58731fd1 | 3410 | int *cant_have_const_ctor_p, |
10746f37 | 3411 | int *no_const_asn_ref_p) |
08b962b0 MM |
3412 | { |
3413 | tree *field; | |
3414 | tree *next; | |
dd29d26b | 3415 | bool has_pointers; |
08b962b0 | 3416 | int any_default_members; |
22002050 | 3417 | int cant_pack = 0; |
c32097d8 | 3418 | int field_access = -1; |
08b962b0 MM |
3419 | |
3420 | /* Assume there are no access declarations. */ | |
3421 | *access_decls = NULL_TREE; | |
3422 | /* Assume this class has no pointer members. */ | |
dd29d26b | 3423 | has_pointers = false; |
08b962b0 MM |
3424 | /* Assume none of the members of this class have default |
3425 | initializations. */ | |
3426 | any_default_members = 0; | |
3427 | ||
3428 | for (field = &TYPE_FIELDS (t); *field; field = next) | |
8d08fdba | 3429 | { |
08b962b0 MM |
3430 | tree x = *field; |
3431 | tree type = TREE_TYPE (x); | |
c32097d8 | 3432 | int this_field_access; |
8d08fdba | 3433 | |
910ad8de | 3434 | next = &DECL_CHAIN (x); |
8d08fdba | 3435 | |
cffa8729 | 3436 | if (TREE_CODE (x) == USING_DECL) |
f30432d7 | 3437 | { |
08b962b0 MM |
3438 | /* Save the access declarations for our caller. */ |
3439 | *access_decls = tree_cons (NULL_TREE, x, *access_decls); | |
f30432d7 MS |
3440 | continue; |
3441 | } | |
8d08fdba | 3442 | |
050367a3 MM |
3443 | if (TREE_CODE (x) == TYPE_DECL |
3444 | || TREE_CODE (x) == TEMPLATE_DECL) | |
f30432d7 | 3445 | continue; |
8d08fdba | 3446 | |
f30432d7 | 3447 | /* If we've gotten this far, it's a data member, possibly static, |
e92cc029 | 3448 | or an enumerator. */ |
8d0d1915 JM |
3449 | if (TREE_CODE (x) != CONST_DECL) |
3450 | DECL_CONTEXT (x) = t; | |
8d08fdba | 3451 | |
58ec3cc5 MM |
3452 | /* When this goes into scope, it will be a non-local reference. */ |
3453 | DECL_NONLOCAL (x) = 1; | |
3454 | ||
3455 | if (TREE_CODE (t) == UNION_TYPE) | |
3456 | { | |
3457 | /* [class.union] | |
3458 | ||
3459 | If a union contains a static data member, or a member of | |
324f9dfb | 3460 | reference type, the program is ill-formed. */ |
5a6ccc94 | 3461 | if (VAR_P (x)) |
58ec3cc5 | 3462 | { |
dee15844 | 3463 | error ("%q+D may not be static because it is a member of a union", x); |
58ec3cc5 MM |
3464 | continue; |
3465 | } | |
3466 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
3467 | { | |
dee15844 JM |
3468 | error ("%q+D may not have reference type %qT because" |
3469 | " it is a member of a union", | |
3470 | x, type); | |
58ec3cc5 MM |
3471 | continue; |
3472 | } | |
3473 | } | |
3474 | ||
f30432d7 MS |
3475 | /* Perform error checking that did not get done in |
3476 | grokdeclarator. */ | |
52fb2769 | 3477 | if (TREE_CODE (type) == FUNCTION_TYPE) |
f30432d7 | 3478 | { |
dee15844 | 3479 | error ("field %q+D invalidly declared function type", x); |
52fb2769 NS |
3480 | type = build_pointer_type (type); |
3481 | TREE_TYPE (x) = type; | |
f30432d7 | 3482 | } |
52fb2769 | 3483 | else if (TREE_CODE (type) == METHOD_TYPE) |
f30432d7 | 3484 | { |
dee15844 | 3485 | error ("field %q+D invalidly declared method type", x); |
52fb2769 NS |
3486 | type = build_pointer_type (type); |
3487 | TREE_TYPE (x) = type; | |
f30432d7 | 3488 | } |
8d08fdba | 3489 | |
52fb2769 | 3490 | if (type == error_mark_node) |
f30432d7 | 3491 | continue; |
c8094d83 | 3492 | |
5a6ccc94 | 3493 | if (TREE_CODE (x) == CONST_DECL || VAR_P (x)) |
73a8adb6 | 3494 | continue; |
8d08fdba | 3495 | |
f30432d7 | 3496 | /* Now it can only be a FIELD_DECL. */ |
8d08fdba | 3497 | |
f30432d7 | 3498 | if (TREE_PRIVATE (x) || TREE_PROTECTED (x)) |
08b962b0 | 3499 | CLASSTYPE_NON_AGGREGATE (t) = 1; |
8d08fdba | 3500 | |
3b49d762 | 3501 | /* If at least one non-static data member is non-literal, the whole |
48d261d2 PC |
3502 | class becomes non-literal. Note: if the type is incomplete we |
3503 | will complain later on. */ | |
3504 | if (COMPLETE_TYPE_P (type) && !literal_type_p (type)) | |
3b49d762 GDR |
3505 | CLASSTYPE_LITERAL_P (t) = false; |
3506 | ||
c32097d8 JM |
3507 | /* A standard-layout class is a class that: |
3508 | ... | |
3509 | has the same access control (Clause 11) for all non-static data members, | |
3510 | ... */ | |
3511 | this_field_access = TREE_PROTECTED (x) ? 1 : TREE_PRIVATE (x) ? 2 : 0; | |
3512 | if (field_access == -1) | |
3513 | field_access = this_field_access; | |
3514 | else if (this_field_access != field_access) | |
3515 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
3516 | ||
0fcedd9c | 3517 | /* If this is of reference type, check if it needs an init. */ |
52fb2769 | 3518 | if (TREE_CODE (type) == REFERENCE_TYPE) |
0cbd7506 | 3519 | { |
c32097d8 JM |
3520 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3521 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
f30432d7 | 3522 | if (DECL_INITIAL (x) == NULL_TREE) |
6eb35968 | 3523 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); |
8d08fdba | 3524 | |
f30432d7 MS |
3525 | /* ARM $12.6.2: [A member initializer list] (or, for an |
3526 | aggregate, initialization by a brace-enclosed list) is the | |
3527 | only way to initialize nonstatic const and reference | |
3528 | members. */ | |
066ec0a4 | 3529 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3530 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3531 | } |
8d08fdba | 3532 | |
1e30f9b4 | 3533 | type = strip_array_types (type); |
dd29d26b | 3534 | |
1937f939 JM |
3535 | if (TYPE_PACKED (t)) |
3536 | { | |
c32097d8 | 3537 | if (!layout_pod_type_p (type) && !TYPE_PACKED (type)) |
4666cd04 JM |
3538 | { |
3539 | warning | |
3540 | (0, | |
3541 | "ignoring packed attribute because of unpacked non-POD field %q+#D", | |
3542 | x); | |
22002050 | 3543 | cant_pack = 1; |
4666cd04 | 3544 | } |
2cd36c22 AN |
3545 | else if (DECL_C_BIT_FIELD (x) |
3546 | || TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT) | |
1937f939 JM |
3547 | DECL_PACKED (x) = 1; |
3548 | } | |
3549 | ||
3550 | if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x))) | |
3551 | /* We don't treat zero-width bitfields as making a class | |
3552 | non-empty. */ | |
3553 | ; | |
3554 | else | |
3555 | { | |
3556 | /* The class is non-empty. */ | |
3557 | CLASSTYPE_EMPTY_P (t) = 0; | |
3558 | /* The class is not even nearly empty. */ | |
3559 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
3560 | /* If one of the data members contains an empty class, | |
3561 | so does T. */ | |
3562 | if (CLASS_TYPE_P (type) | |
3563 | && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3564 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
3565 | } | |
3566 | ||
dd29d26b GB |
3567 | /* This is used by -Weffc++ (see below). Warn only for pointers |
3568 | to members which might hold dynamic memory. So do not warn | |
3569 | for pointers to functions or pointers to members. */ | |
3570 | if (TYPE_PTR_P (type) | |
66b1156a | 3571 | && !TYPE_PTRFN_P (type)) |
dd29d26b | 3572 | has_pointers = true; |
824b9a4c | 3573 | |
58ec3cc5 MM |
3574 | if (CLASS_TYPE_P (type)) |
3575 | { | |
3576 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (type)) | |
3577 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); | |
3578 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)) | |
3579 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); | |
3580 | } | |
3581 | ||
52fb2769 | 3582 | if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type)) |
08b962b0 | 3583 | CLASSTYPE_HAS_MUTABLE (t) = 1; |
a7a7710d | 3584 | |
42306d73 PC |
3585 | if (DECL_MUTABLE_P (x)) |
3586 | { | |
3587 | if (CP_TYPE_CONST_P (type)) | |
3588 | { | |
3589 | error ("member %q+D cannot be declared both %<const%> " | |
3590 | "and %<mutable%>", x); | |
3591 | continue; | |
3592 | } | |
3593 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
3594 | { | |
3595 | error ("member %q+D cannot be declared as a %<mutable%> " | |
3596 | "reference", x); | |
3597 | continue; | |
3598 | } | |
3599 | } | |
3600 | ||
c32097d8 | 3601 | if (! layout_pod_type_p (type)) |
0cbd7506 MS |
3602 | /* DR 148 now allows pointers to members (which are POD themselves), |
3603 | to be allowed in POD structs. */ | |
c32097d8 JM |
3604 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3605 | ||
3606 | if (!std_layout_type_p (type)) | |
3607 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
52fb2769 | 3608 | |
94e6e4c4 AO |
3609 | if (! zero_init_p (type)) |
3610 | CLASSTYPE_NON_ZERO_INIT_P (t) = 1; | |
3611 | ||
640c2adf FC |
3612 | /* We set DECL_C_BIT_FIELD in grokbitfield. |
3613 | If the type and width are valid, we'll also set DECL_BIT_FIELD. */ | |
3614 | if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x)) | |
3615 | check_field_decl (x, t, | |
3616 | cant_have_const_ctor_p, | |
3617 | no_const_asn_ref_p, | |
10746f37 | 3618 | &any_default_members); |
640c2adf | 3619 | |
ec3ebf45 OG |
3620 | /* Now that we've removed bit-field widths from DECL_INITIAL, |
3621 | anything left in DECL_INITIAL is an NSDMI that makes the class | |
3622 | non-aggregate. */ | |
3623 | if (DECL_INITIAL (x)) | |
3624 | CLASSTYPE_NON_AGGREGATE (t) = true; | |
3625 | ||
f30432d7 | 3626 | /* If any field is const, the structure type is pseudo-const. */ |
52fb2769 | 3627 | if (CP_TYPE_CONST_P (type)) |
f30432d7 MS |
3628 | { |
3629 | C_TYPE_FIELDS_READONLY (t) = 1; | |
3630 | if (DECL_INITIAL (x) == NULL_TREE) | |
6eb35968 | 3631 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); |
f30432d7 MS |
3632 | |
3633 | /* ARM $12.6.2: [A member initializer list] (or, for an | |
3634 | aggregate, initialization by a brace-enclosed list) is the | |
3635 | only way to initialize nonstatic const and reference | |
3636 | members. */ | |
066ec0a4 | 3637 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3638 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3639 | } |
08b962b0 | 3640 | /* A field that is pseudo-const makes the structure likewise. */ |
5552b43c | 3641 | else if (CLASS_TYPE_P (type)) |
f30432d7 | 3642 | { |
08b962b0 | 3643 | C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type); |
6eb35968 DE |
3644 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, |
3645 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) | |
3646 | | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)); | |
f30432d7 | 3647 | } |
8d08fdba | 3648 | |
c10bffd0 JM |
3649 | /* Core issue 80: A nonstatic data member is required to have a |
3650 | different name from the class iff the class has a | |
b87d79e6 | 3651 | user-declared constructor. */ |
0fcedd9c JM |
3652 | if (constructor_name_p (DECL_NAME (x), t) |
3653 | && TYPE_HAS_USER_CONSTRUCTOR (t)) | |
cbe5f3b3 | 3654 | permerror (input_location, "field %q+#D with same name as class", x); |
8d08fdba MS |
3655 | } |
3656 | ||
dd29d26b GB |
3657 | /* Effective C++ rule 11: if a class has dynamic memory held by pointers, |
3658 | it should also define a copy constructor and an assignment operator to | |
3659 | implement the correct copy semantic (deep vs shallow, etc.). As it is | |
3660 | not feasible to check whether the constructors do allocate dynamic memory | |
3661 | and store it within members, we approximate the warning like this: | |
3662 | ||
3663 | -- Warn only if there are members which are pointers | |
3664 | -- Warn only if there is a non-trivial constructor (otherwise, | |
3665 | there cannot be memory allocated). | |
3666 | -- Warn only if there is a non-trivial destructor. We assume that the | |
3667 | user at least implemented the cleanup correctly, and a destructor | |
3668 | is needed to free dynamic memory. | |
c8094d83 | 3669 | |
77880ae4 | 3670 | This seems enough for practical purposes. */ |
22002050 JM |
3671 | if (warn_ecpp |
3672 | && has_pointers | |
0fcedd9c | 3673 | && TYPE_HAS_USER_CONSTRUCTOR (t) |
22002050 | 3674 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
066ec0a4 | 3675 | && !(TYPE_HAS_COPY_CTOR (t) && TYPE_HAS_COPY_ASSIGN (t))) |
824b9a4c | 3676 | { |
b323323f | 3677 | warning (OPT_Weffc__, "%q#T has pointer data members", t); |
c8094d83 | 3678 | |
066ec0a4 | 3679 | if (! TYPE_HAS_COPY_CTOR (t)) |
824b9a4c | 3680 | { |
74fa0285 | 3681 | warning (OPT_Weffc__, |
3db45ab5 | 3682 | " but does not override %<%T(const %T&)%>", t, t); |
066ec0a4 | 3683 | if (!TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3684 | warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t); |
824b9a4c | 3685 | } |
066ec0a4 | 3686 | else if (! TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3687 | warning (OPT_Weffc__, |
3db45ab5 | 3688 | " but does not override %<operator=(const %T&)%>", t); |
824b9a4c | 3689 | } |
08b962b0 | 3690 | |
0e5f8a59 JM |
3691 | /* Non-static data member initializers make the default constructor |
3692 | non-trivial. */ | |
3693 | if (any_default_members) | |
3694 | { | |
3695 | TYPE_NEEDS_CONSTRUCTING (t) = true; | |
3696 | TYPE_HAS_COMPLEX_DFLT (t) = true; | |
3697 | } | |
3698 | ||
22002050 JM |
3699 | /* If any of the fields couldn't be packed, unset TYPE_PACKED. */ |
3700 | if (cant_pack) | |
3701 | TYPE_PACKED (t) = 0; | |
607cf131 MM |
3702 | |
3703 | /* Check anonymous struct/anonymous union fields. */ | |
3704 | finish_struct_anon (t); | |
3705 | ||
08b962b0 MM |
3706 | /* We've built up the list of access declarations in reverse order. |
3707 | Fix that now. */ | |
3708 | *access_decls = nreverse (*access_decls); | |
08b962b0 MM |
3709 | } |
3710 | ||
c20118a8 MM |
3711 | /* If TYPE is an empty class type, records its OFFSET in the table of |
3712 | OFFSETS. */ | |
607cf131 | 3713 | |
c20118a8 | 3714 | static int |
94edc4ab | 3715 | record_subobject_offset (tree type, tree offset, splay_tree offsets) |
5c24fba6 | 3716 | { |
c20118a8 | 3717 | splay_tree_node n; |
5c24fba6 | 3718 | |
c20118a8 MM |
3719 | if (!is_empty_class (type)) |
3720 | return 0; | |
5c24fba6 | 3721 | |
c20118a8 MM |
3722 | /* Record the location of this empty object in OFFSETS. */ |
3723 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3724 | if (!n) | |
c8094d83 | 3725 | n = splay_tree_insert (offsets, |
c20118a8 MM |
3726 | (splay_tree_key) offset, |
3727 | (splay_tree_value) NULL_TREE); | |
c8094d83 | 3728 | n->value = ((splay_tree_value) |
c20118a8 MM |
3729 | tree_cons (NULL_TREE, |
3730 | type, | |
3731 | (tree) n->value)); | |
3732 | ||
3733 | return 0; | |
607cf131 MM |
3734 | } |
3735 | ||
838dfd8a | 3736 | /* Returns nonzero if TYPE is an empty class type and there is |
c20118a8 | 3737 | already an entry in OFFSETS for the same TYPE as the same OFFSET. */ |
9785e4b1 | 3738 | |
c20118a8 | 3739 | static int |
94edc4ab | 3740 | check_subobject_offset (tree type, tree offset, splay_tree offsets) |
9785e4b1 | 3741 | { |
c20118a8 MM |
3742 | splay_tree_node n; |
3743 | tree t; | |
3744 | ||
3745 | if (!is_empty_class (type)) | |
3746 | return 0; | |
3747 | ||
3748 | /* Record the location of this empty object in OFFSETS. */ | |
3749 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3750 | if (!n) | |
3751 | return 0; | |
3752 | ||
3753 | for (t = (tree) n->value; t; t = TREE_CHAIN (t)) | |
3754 | if (same_type_p (TREE_VALUE (t), type)) | |
3755 | return 1; | |
3756 | ||
3757 | return 0; | |
9785e4b1 MM |
3758 | } |
3759 | ||
c20118a8 MM |
3760 | /* Walk through all the subobjects of TYPE (located at OFFSET). Call |
3761 | F for every subobject, passing it the type, offset, and table of | |
2003cd37 MM |
3762 | OFFSETS. If VBASES_P is one, then virtual non-primary bases should |
3763 | be traversed. | |
5cdba4ff MM |
3764 | |
3765 | If MAX_OFFSET is non-NULL, then subobjects with an offset greater | |
3766 | than MAX_OFFSET will not be walked. | |
3767 | ||
838dfd8a | 3768 | If F returns a nonzero value, the traversal ceases, and that value |
5cdba4ff | 3769 | is returned. Otherwise, returns zero. */ |
d77249e7 | 3770 | |
c20118a8 | 3771 | static int |
c8094d83 | 3772 | walk_subobject_offsets (tree type, |
0cbd7506 MS |
3773 | subobject_offset_fn f, |
3774 | tree offset, | |
3775 | splay_tree offsets, | |
3776 | tree max_offset, | |
3777 | int vbases_p) | |
5c24fba6 | 3778 | { |
c20118a8 | 3779 | int r = 0; |
ff944b49 | 3780 | tree type_binfo = NULL_TREE; |
c20118a8 | 3781 | |
5cdba4ff MM |
3782 | /* If this OFFSET is bigger than the MAX_OFFSET, then we should |
3783 | stop. */ | |
3784 | if (max_offset && INT_CST_LT (max_offset, offset)) | |
3785 | return 0; | |
3786 | ||
dbe91deb NS |
3787 | if (type == error_mark_node) |
3788 | return 0; | |
3db45ab5 | 3789 | |
c8094d83 | 3790 | if (!TYPE_P (type)) |
ff944b49 MM |
3791 | { |
3792 | if (abi_version_at_least (2)) | |
3793 | type_binfo = type; | |
3794 | type = BINFO_TYPE (type); | |
3795 | } | |
3796 | ||
c20118a8 | 3797 | if (CLASS_TYPE_P (type)) |
5c24fba6 | 3798 | { |
c20118a8 | 3799 | tree field; |
17bbb839 | 3800 | tree binfo; |
c20118a8 MM |
3801 | int i; |
3802 | ||
5ec1192e MM |
3803 | /* Avoid recursing into objects that are not interesting. */ |
3804 | if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3805 | return 0; | |
3806 | ||
c20118a8 MM |
3807 | /* Record the location of TYPE. */ |
3808 | r = (*f) (type, offset, offsets); | |
3809 | if (r) | |
3810 | return r; | |
3811 | ||
3812 | /* Iterate through the direct base classes of TYPE. */ | |
ff944b49 MM |
3813 | if (!type_binfo) |
3814 | type_binfo = TYPE_BINFO (type); | |
fa743e8c | 3815 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++) |
c20118a8 | 3816 | { |
ff944b49 MM |
3817 | tree binfo_offset; |
3818 | ||
c8094d83 | 3819 | if (abi_version_at_least (2) |
809e3e7f | 3820 | && BINFO_VIRTUAL_P (binfo)) |
17bbb839 | 3821 | continue; |
5c24fba6 | 3822 | |
c8094d83 MS |
3823 | if (!vbases_p |
3824 | && BINFO_VIRTUAL_P (binfo) | |
9965d119 | 3825 | && !BINFO_PRIMARY_P (binfo)) |
c20118a8 MM |
3826 | continue; |
3827 | ||
ff944b49 MM |
3828 | if (!abi_version_at_least (2)) |
3829 | binfo_offset = size_binop (PLUS_EXPR, | |
3830 | offset, | |
3831 | BINFO_OFFSET (binfo)); | |
3832 | else | |
3833 | { | |
3834 | tree orig_binfo; | |
3835 | /* We cannot rely on BINFO_OFFSET being set for the base | |
3836 | class yet, but the offsets for direct non-virtual | |
3837 | bases can be calculated by going back to the TYPE. */ | |
604a3205 | 3838 | orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i); |
c8094d83 | 3839 | binfo_offset = size_binop (PLUS_EXPR, |
ff944b49 MM |
3840 | offset, |
3841 | BINFO_OFFSET (orig_binfo)); | |
3842 | } | |
3843 | ||
3844 | r = walk_subobject_offsets (binfo, | |
c20118a8 | 3845 | f, |
ff944b49 | 3846 | binfo_offset, |
c20118a8 | 3847 | offsets, |
5cdba4ff | 3848 | max_offset, |
c8094d83 | 3849 | (abi_version_at_least (2) |
17bbb839 | 3850 | ? /*vbases_p=*/0 : vbases_p)); |
c20118a8 MM |
3851 | if (r) |
3852 | return r; | |
3853 | } | |
3854 | ||
58c42dc2 | 3855 | if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type)) |
17bbb839 | 3856 | { |
58c42dc2 | 3857 | unsigned ix; |
9771b263 | 3858 | vec<tree, va_gc> *vbases; |
17bbb839 | 3859 | |
ff944b49 MM |
3860 | /* Iterate through the virtual base classes of TYPE. In G++ |
3861 | 3.2, we included virtual bases in the direct base class | |
3862 | loop above, which results in incorrect results; the | |
3863 | correct offsets for virtual bases are only known when | |
3864 | working with the most derived type. */ | |
3865 | if (vbases_p) | |
9ba5ff0f | 3866 | for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0; |
9771b263 | 3867 | vec_safe_iterate (vbases, ix, &binfo); ix++) |
ff944b49 | 3868 | { |
ff944b49 MM |
3869 | r = walk_subobject_offsets (binfo, |
3870 | f, | |
3871 | size_binop (PLUS_EXPR, | |
3872 | offset, | |
3873 | BINFO_OFFSET (binfo)), | |
3874 | offsets, | |
3875 | max_offset, | |
3876 | /*vbases_p=*/0); | |
3877 | if (r) | |
3878 | return r; | |
3879 | } | |
3880 | else | |
17bbb839 | 3881 | { |
ff944b49 MM |
3882 | /* We still have to walk the primary base, if it is |
3883 | virtual. (If it is non-virtual, then it was walked | |
3884 | above.) */ | |
58c42dc2 | 3885 | tree vbase = get_primary_binfo (type_binfo); |
c8094d83 | 3886 | |
809e3e7f | 3887 | if (vbase && BINFO_VIRTUAL_P (vbase) |
fc6633e0 NS |
3888 | && BINFO_PRIMARY_P (vbase) |
3889 | && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo) | |
ff944b49 | 3890 | { |
c8094d83 | 3891 | r = (walk_subobject_offsets |
dbbf88d1 NS |
3892 | (vbase, f, offset, |
3893 | offsets, max_offset, /*vbases_p=*/0)); | |
3894 | if (r) | |
3895 | return r; | |
ff944b49 | 3896 | } |
17bbb839 MM |
3897 | } |
3898 | } | |
3899 | ||
c20118a8 | 3900 | /* Iterate through the fields of TYPE. */ |
910ad8de | 3901 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
e765a228 JM |
3902 | if (TREE_CODE (field) == FIELD_DECL |
3903 | && TREE_TYPE (field) != error_mark_node | |
3904 | && !DECL_ARTIFICIAL (field)) | |
c20118a8 | 3905 | { |
956d9305 MM |
3906 | tree field_offset; |
3907 | ||
3908 | if (abi_version_at_least (2)) | |
3909 | field_offset = byte_position (field); | |
3910 | else | |
3911 | /* In G++ 3.2, DECL_FIELD_OFFSET was used. */ | |
3912 | field_offset = DECL_FIELD_OFFSET (field); | |
3913 | ||
c20118a8 MM |
3914 | r = walk_subobject_offsets (TREE_TYPE (field), |
3915 | f, | |
3916 | size_binop (PLUS_EXPR, | |
3917 | offset, | |
956d9305 | 3918 | field_offset), |
c20118a8 | 3919 | offsets, |
5cdba4ff | 3920 | max_offset, |
c20118a8 MM |
3921 | /*vbases_p=*/1); |
3922 | if (r) | |
3923 | return r; | |
3924 | } | |
5c24fba6 | 3925 | } |
c20118a8 MM |
3926 | else if (TREE_CODE (type) == ARRAY_TYPE) |
3927 | { | |
5ec1192e | 3928 | tree element_type = strip_array_types (type); |
c20118a8 MM |
3929 | tree domain = TYPE_DOMAIN (type); |
3930 | tree index; | |
5c24fba6 | 3931 | |
5ec1192e MM |
3932 | /* Avoid recursing into objects that are not interesting. */ |
3933 | if (!CLASS_TYPE_P (element_type) | |
3934 | || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type)) | |
3935 | return 0; | |
3936 | ||
c20118a8 | 3937 | /* Step through each of the elements in the array. */ |
17bbb839 MM |
3938 | for (index = size_zero_node; |
3939 | /* G++ 3.2 had an off-by-one error here. */ | |
c8094d83 | 3940 | (abi_version_at_least (2) |
17bbb839 MM |
3941 | ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index) |
3942 | : INT_CST_LT (index, TYPE_MAX_VALUE (domain))); | |
c20118a8 MM |
3943 | index = size_binop (PLUS_EXPR, index, size_one_node)) |
3944 | { | |
3945 | r = walk_subobject_offsets (TREE_TYPE (type), | |
3946 | f, | |
3947 | offset, | |
3948 | offsets, | |
5cdba4ff | 3949 | max_offset, |
c20118a8 MM |
3950 | /*vbases_p=*/1); |
3951 | if (r) | |
3952 | return r; | |
c8094d83 | 3953 | offset = size_binop (PLUS_EXPR, offset, |
c20118a8 | 3954 | TYPE_SIZE_UNIT (TREE_TYPE (type))); |
5cdba4ff MM |
3955 | /* If this new OFFSET is bigger than the MAX_OFFSET, then |
3956 | there's no point in iterating through the remaining | |
3957 | elements of the array. */ | |
3958 | if (max_offset && INT_CST_LT (max_offset, offset)) | |
3959 | break; | |
c20118a8 MM |
3960 | } |
3961 | } | |
3962 | ||
3963 | return 0; | |
3964 | } | |
3965 | ||
c0572427 MM |
3966 | /* Record all of the empty subobjects of TYPE (either a type or a |
3967 | binfo). If IS_DATA_MEMBER is true, then a non-static data member | |
c5a35c3c MM |
3968 | is being placed at OFFSET; otherwise, it is a base class that is |
3969 | being placed at OFFSET. */ | |
c20118a8 MM |
3970 | |
3971 | static void | |
c8094d83 | 3972 | record_subobject_offsets (tree type, |
0cbd7506 MS |
3973 | tree offset, |
3974 | splay_tree offsets, | |
c5a35c3c | 3975 | bool is_data_member) |
c20118a8 | 3976 | { |
c5a35c3c | 3977 | tree max_offset; |
c0572427 MM |
3978 | /* If recording subobjects for a non-static data member or a |
3979 | non-empty base class , we do not need to record offsets beyond | |
3980 | the size of the biggest empty class. Additional data members | |
3981 | will go at the end of the class. Additional base classes will go | |
3982 | either at offset zero (if empty, in which case they cannot | |
3983 | overlap with offsets past the size of the biggest empty class) or | |
3984 | at the end of the class. | |
3985 | ||
3986 | However, if we are placing an empty base class, then we must record | |
c5a35c3c MM |
3987 | all offsets, as either the empty class is at offset zero (where |
3988 | other empty classes might later be placed) or at the end of the | |
3989 | class (where other objects might then be placed, so other empty | |
3990 | subobjects might later overlap). */ | |
3db45ab5 | 3991 | if (is_data_member |
c0572427 | 3992 | || !is_empty_class (BINFO_TYPE (type))) |
c5a35c3c MM |
3993 | max_offset = sizeof_biggest_empty_class; |
3994 | else | |
3995 | max_offset = NULL_TREE; | |
c20118a8 | 3996 | walk_subobject_offsets (type, record_subobject_offset, offset, |
c5a35c3c | 3997 | offsets, max_offset, is_data_member); |
5c24fba6 MM |
3998 | } |
3999 | ||
838dfd8a KH |
4000 | /* Returns nonzero if any of the empty subobjects of TYPE (located at |
4001 | OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero, | |
c20118a8 | 4002 | virtual bases of TYPE are examined. */ |
9785e4b1 MM |
4003 | |
4004 | static int | |
94edc4ab | 4005 | layout_conflict_p (tree type, |
0cbd7506 MS |
4006 | tree offset, |
4007 | splay_tree offsets, | |
4008 | int vbases_p) | |
9785e4b1 | 4009 | { |
5cdba4ff MM |
4010 | splay_tree_node max_node; |
4011 | ||
4012 | /* Get the node in OFFSETS that indicates the maximum offset where | |
4013 | an empty subobject is located. */ | |
4014 | max_node = splay_tree_max (offsets); | |
4015 | /* If there aren't any empty subobjects, then there's no point in | |
4016 | performing this check. */ | |
4017 | if (!max_node) | |
4018 | return 0; | |
4019 | ||
c20118a8 | 4020 | return walk_subobject_offsets (type, check_subobject_offset, offset, |
5cdba4ff MM |
4021 | offsets, (tree) (max_node->key), |
4022 | vbases_p); | |
9785e4b1 MM |
4023 | } |
4024 | ||
5c24fba6 MM |
4025 | /* DECL is a FIELD_DECL corresponding either to a base subobject of a |
4026 | non-static data member of the type indicated by RLI. BINFO is the | |
c20118a8 | 4027 | binfo corresponding to the base subobject, OFFSETS maps offsets to |
17bbb839 MM |
4028 | types already located at those offsets. This function determines |
4029 | the position of the DECL. */ | |
5c24fba6 MM |
4030 | |
4031 | static void | |
c8094d83 MS |
4032 | layout_nonempty_base_or_field (record_layout_info rli, |
4033 | tree decl, | |
4034 | tree binfo, | |
17bbb839 | 4035 | splay_tree offsets) |
5c24fba6 | 4036 | { |
c20118a8 | 4037 | tree offset = NULL_TREE; |
17bbb839 MM |
4038 | bool field_p; |
4039 | tree type; | |
c8094d83 | 4040 | |
17bbb839 MM |
4041 | if (binfo) |
4042 | { | |
4043 | /* For the purposes of determining layout conflicts, we want to | |
4044 | use the class type of BINFO; TREE_TYPE (DECL) will be the | |
4045 | CLASSTYPE_AS_BASE version, which does not contain entries for | |
4046 | zero-sized bases. */ | |
4047 | type = TREE_TYPE (binfo); | |
4048 | field_p = false; | |
4049 | } | |
4050 | else | |
4051 | { | |
4052 | type = TREE_TYPE (decl); | |
4053 | field_p = true; | |
4054 | } | |
c20118a8 | 4055 | |
5c24fba6 MM |
4056 | /* Try to place the field. It may take more than one try if we have |
4057 | a hard time placing the field without putting two objects of the | |
4058 | same type at the same address. */ | |
4059 | while (1) | |
4060 | { | |
defd0dea | 4061 | struct record_layout_info_s old_rli = *rli; |
5c24fba6 | 4062 | |
770ae6cc RK |
4063 | /* Place this field. */ |
4064 | place_field (rli, decl); | |
da3d4dfa | 4065 | offset = byte_position (decl); |
1e2e9f54 | 4066 | |
5c24fba6 MM |
4067 | /* We have to check to see whether or not there is already |
4068 | something of the same type at the offset we're about to use. | |
1e2e9f54 | 4069 | For example, consider: |
c8094d83 | 4070 | |
1e2e9f54 MM |
4071 | struct S {}; |
4072 | struct T : public S { int i; }; | |
4073 | struct U : public S, public T {}; | |
c8094d83 | 4074 | |
5c24fba6 MM |
4075 | Here, we put S at offset zero in U. Then, we can't put T at |
4076 | offset zero -- its S component would be at the same address | |
4077 | as the S we already allocated. So, we have to skip ahead. | |
4078 | Since all data members, including those whose type is an | |
838dfd8a | 4079 | empty class, have nonzero size, any overlap can happen only |
5c24fba6 MM |
4080 | with a direct or indirect base-class -- it can't happen with |
4081 | a data member. */ | |
1e2e9f54 MM |
4082 | /* In a union, overlap is permitted; all members are placed at |
4083 | offset zero. */ | |
4084 | if (TREE_CODE (rli->t) == UNION_TYPE) | |
4085 | break; | |
7ba539c6 MM |
4086 | /* G++ 3.2 did not check for overlaps when placing a non-empty |
4087 | virtual base. */ | |
809e3e7f | 4088 | if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo)) |
7ba539c6 | 4089 | break; |
c8094d83 | 4090 | if (layout_conflict_p (field_p ? type : binfo, offset, |
ff944b49 | 4091 | offsets, field_p)) |
5c24fba6 | 4092 | { |
5c24fba6 MM |
4093 | /* Strip off the size allocated to this field. That puts us |
4094 | at the first place we could have put the field with | |
4095 | proper alignment. */ | |
770ae6cc RK |
4096 | *rli = old_rli; |
4097 | ||
c20118a8 | 4098 | /* Bump up by the alignment required for the type. */ |
770ae6cc | 4099 | rli->bitpos |
c8094d83 MS |
4100 | = size_binop (PLUS_EXPR, rli->bitpos, |
4101 | bitsize_int (binfo | |
c20118a8 MM |
4102 | ? CLASSTYPE_ALIGN (type) |
4103 | : TYPE_ALIGN (type))); | |
770ae6cc | 4104 | normalize_rli (rli); |
5c24fba6 MM |
4105 | } |
4106 | else | |
4107 | /* There was no conflict. We're done laying out this field. */ | |
4108 | break; | |
4109 | } | |
c20118a8 | 4110 | |
623fe76a | 4111 | /* Now that we know where it will be placed, update its |
c20118a8 MM |
4112 | BINFO_OFFSET. */ |
4113 | if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo))) | |
90024bdc | 4114 | /* Indirect virtual bases may have a nonzero BINFO_OFFSET at |
17bbb839 MM |
4115 | this point because their BINFO_OFFSET is copied from another |
4116 | hierarchy. Therefore, we may not need to add the entire | |
4117 | OFFSET. */ | |
c8094d83 | 4118 | propagate_binfo_offsets (binfo, |
db3927fb AH |
4119 | size_diffop_loc (input_location, |
4120 | convert (ssizetype, offset), | |
c8094d83 | 4121 | convert (ssizetype, |
dbbf88d1 | 4122 | BINFO_OFFSET (binfo)))); |
5c24fba6 MM |
4123 | } |
4124 | ||
90024bdc | 4125 | /* Returns true if TYPE is empty and OFFSET is nonzero. */ |
7ba539c6 MM |
4126 | |
4127 | static int | |
4128 | empty_base_at_nonzero_offset_p (tree type, | |
4129 | tree offset, | |
12308bc6 | 4130 | splay_tree /*offsets*/) |
7ba539c6 MM |
4131 | { |
4132 | return is_empty_class (type) && !integer_zerop (offset); | |
4133 | } | |
4134 | ||
9785e4b1 | 4135 | /* Layout the empty base BINFO. EOC indicates the byte currently just |
ec386958 | 4136 | past the end of the class, and should be correctly aligned for a |
c20118a8 | 4137 | class of the type indicated by BINFO; OFFSETS gives the offsets of |
623fe76a | 4138 | the empty bases allocated so far. T is the most derived |
838dfd8a | 4139 | type. Return nonzero iff we added it at the end. */ |
9785e4b1 | 4140 | |
06d9f09f | 4141 | static bool |
d9d9dbc0 JM |
4142 | layout_empty_base (record_layout_info rli, tree binfo, |
4143 | tree eoc, splay_tree offsets) | |
9785e4b1 | 4144 | { |
ec386958 | 4145 | tree alignment; |
9785e4b1 | 4146 | tree basetype = BINFO_TYPE (binfo); |
06d9f09f | 4147 | bool atend = false; |
956d9305 | 4148 | |
9785e4b1 | 4149 | /* This routine should only be used for empty classes. */ |
50bc768d | 4150 | gcc_assert (is_empty_class (basetype)); |
1b50716d | 4151 | alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype)); |
9785e4b1 | 4152 | |
3075b327 NS |
4153 | if (!integer_zerop (BINFO_OFFSET (binfo))) |
4154 | { | |
4155 | if (abi_version_at_least (2)) | |
4156 | propagate_binfo_offsets | |
db3927fb AH |
4157 | (binfo, size_diffop_loc (input_location, |
4158 | size_zero_node, BINFO_OFFSET (binfo))); | |
74fa0285 GDR |
4159 | else |
4160 | warning (OPT_Wabi, | |
3db45ab5 | 4161 | "offset of empty base %qT may not be ABI-compliant and may" |
3075b327 NS |
4162 | "change in a future version of GCC", |
4163 | BINFO_TYPE (binfo)); | |
4164 | } | |
c8094d83 | 4165 | |
9785e4b1 MM |
4166 | /* This is an empty base class. We first try to put it at offset |
4167 | zero. */ | |
ff944b49 | 4168 | if (layout_conflict_p (binfo, |
c20118a8 | 4169 | BINFO_OFFSET (binfo), |
c8094d83 | 4170 | offsets, |
c20118a8 | 4171 | /*vbases_p=*/0)) |
9785e4b1 MM |
4172 | { |
4173 | /* That didn't work. Now, we move forward from the next | |
4174 | available spot in the class. */ | |
06d9f09f | 4175 | atend = true; |
dbbf88d1 | 4176 | propagate_binfo_offsets (binfo, convert (ssizetype, eoc)); |
c8094d83 | 4177 | while (1) |
9785e4b1 | 4178 | { |
ff944b49 | 4179 | if (!layout_conflict_p (binfo, |
c8094d83 | 4180 | BINFO_OFFSET (binfo), |
c20118a8 MM |
4181 | offsets, |
4182 | /*vbases_p=*/0)) | |
9785e4b1 MM |
4183 | /* We finally found a spot where there's no overlap. */ |
4184 | break; | |
4185 | ||
4186 | /* There's overlap here, too. Bump along to the next spot. */ | |
dbbf88d1 | 4187 | propagate_binfo_offsets (binfo, alignment); |
9785e4b1 MM |
4188 | } |
4189 | } | |
d9d9dbc0 JM |
4190 | |
4191 | if (CLASSTYPE_USER_ALIGN (basetype)) | |
4192 | { | |
4193 | rli->record_align = MAX (rli->record_align, CLASSTYPE_ALIGN (basetype)); | |
4194 | if (warn_packed) | |
4195 | rli->unpacked_align = MAX (rli->unpacked_align, CLASSTYPE_ALIGN (basetype)); | |
4196 | TYPE_USER_ALIGN (rli->t) = 1; | |
4197 | } | |
4198 | ||
06d9f09f | 4199 | return atend; |
9785e4b1 MM |
4200 | } |
4201 | ||
78dcd41a | 4202 | /* Layout the base given by BINFO in the class indicated by RLI. |
58731fd1 | 4203 | *BASE_ALIGN is a running maximum of the alignments of |
17bbb839 MM |
4204 | any base class. OFFSETS gives the location of empty base |
4205 | subobjects. T is the most derived type. Return nonzero if the new | |
4206 | object cannot be nearly-empty. A new FIELD_DECL is inserted at | |
c8094d83 | 4207 | *NEXT_FIELD, unless BINFO is for an empty base class. |
5c24fba6 | 4208 | |
17bbb839 MM |
4209 | Returns the location at which the next field should be inserted. */ |
4210 | ||
4211 | static tree * | |
58731fd1 | 4212 | build_base_field (record_layout_info rli, tree binfo, |
17bbb839 | 4213 | splay_tree offsets, tree *next_field) |
d77249e7 | 4214 | { |
17bbb839 | 4215 | tree t = rli->t; |
d77249e7 | 4216 | tree basetype = BINFO_TYPE (binfo); |
d77249e7 | 4217 | |
d0f062fb | 4218 | if (!COMPLETE_TYPE_P (basetype)) |
d77249e7 MM |
4219 | /* This error is now reported in xref_tag, thus giving better |
4220 | location information. */ | |
17bbb839 | 4221 | return next_field; |
c8094d83 | 4222 | |
17bbb839 MM |
4223 | /* Place the base class. */ |
4224 | if (!is_empty_class (basetype)) | |
5c24fba6 | 4225 | { |
17bbb839 MM |
4226 | tree decl; |
4227 | ||
5c24fba6 MM |
4228 | /* The containing class is non-empty because it has a non-empty |
4229 | base class. */ | |
58731fd1 | 4230 | CLASSTYPE_EMPTY_P (t) = 0; |
c8094d83 | 4231 | |
17bbb839 | 4232 | /* Create the FIELD_DECL. */ |
c2255bc4 AH |
4233 | decl = build_decl (input_location, |
4234 | FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype)); | |
17bbb839 | 4235 | DECL_ARTIFICIAL (decl) = 1; |
78e0d62b | 4236 | DECL_IGNORED_P (decl) = 1; |
17bbb839 | 4237 | DECL_FIELD_CONTEXT (decl) = t; |
1ad8aeeb DG |
4238 | if (CLASSTYPE_AS_BASE (basetype)) |
4239 | { | |
4240 | DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype); | |
4241 | DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype); | |
4242 | DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype); | |
4243 | DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype); | |
4244 | DECL_MODE (decl) = TYPE_MODE (basetype); | |
4245 | DECL_FIELD_IS_BASE (decl) = 1; | |
4246 | ||
4247 | /* Try to place the field. It may take more than one try if we | |
4248 | have a hard time placing the field without putting two | |
4249 | objects of the same type at the same address. */ | |
4250 | layout_nonempty_base_or_field (rli, decl, binfo, offsets); | |
4251 | /* Add the new FIELD_DECL to the list of fields for T. */ | |
910ad8de | 4252 | DECL_CHAIN (decl) = *next_field; |
1ad8aeeb | 4253 | *next_field = decl; |
910ad8de | 4254 | next_field = &DECL_CHAIN (decl); |
1ad8aeeb | 4255 | } |
5c24fba6 MM |
4256 | } |
4257 | else | |
ec386958 | 4258 | { |
17bbb839 | 4259 | tree eoc; |
7ba539c6 | 4260 | bool atend; |
ec386958 MM |
4261 | |
4262 | /* On some platforms (ARM), even empty classes will not be | |
4263 | byte-aligned. */ | |
db3927fb AH |
4264 | eoc = round_up_loc (input_location, |
4265 | rli_size_unit_so_far (rli), | |
17bbb839 | 4266 | CLASSTYPE_ALIGN_UNIT (basetype)); |
d9d9dbc0 | 4267 | atend = layout_empty_base (rli, binfo, eoc, offsets); |
7ba539c6 MM |
4268 | /* A nearly-empty class "has no proper base class that is empty, |
4269 | not morally virtual, and at an offset other than zero." */ | |
809e3e7f | 4270 | if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t)) |
7ba539c6 MM |
4271 | { |
4272 | if (atend) | |
4273 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
c5a35c3c | 4274 | /* The check above (used in G++ 3.2) is insufficient because |
7ba539c6 | 4275 | an empty class placed at offset zero might itself have an |
90024bdc | 4276 | empty base at a nonzero offset. */ |
c8094d83 | 4277 | else if (walk_subobject_offsets (basetype, |
7ba539c6 MM |
4278 | empty_base_at_nonzero_offset_p, |
4279 | size_zero_node, | |
4280 | /*offsets=*/NULL, | |
4281 | /*max_offset=*/NULL_TREE, | |
4282 | /*vbases_p=*/true)) | |
4283 | { | |
4284 | if (abi_version_at_least (2)) | |
4285 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
74fa0285 GDR |
4286 | else |
4287 | warning (OPT_Wabi, | |
3db45ab5 | 4288 | "class %qT will be considered nearly empty in a " |
7ba539c6 MM |
4289 | "future version of GCC", t); |
4290 | } | |
4291 | } | |
c8094d83 | 4292 | |
17bbb839 MM |
4293 | /* We do not create a FIELD_DECL for empty base classes because |
4294 | it might overlap some other field. We want to be able to | |
4295 | create CONSTRUCTORs for the class by iterating over the | |
4296 | FIELD_DECLs, and the back end does not handle overlapping | |
4297 | FIELD_DECLs. */ | |
58731fd1 MM |
4298 | |
4299 | /* An empty virtual base causes a class to be non-empty | |
4300 | -- but in that case we do not need to clear CLASSTYPE_EMPTY_P | |
4301 | here because that was already done when the virtual table | |
4302 | pointer was created. */ | |
ec386958 | 4303 | } |
5c24fba6 | 4304 | |
5c24fba6 | 4305 | /* Record the offsets of BINFO and its base subobjects. */ |
ff944b49 | 4306 | record_subobject_offsets (binfo, |
c20118a8 | 4307 | BINFO_OFFSET (binfo), |
c8094d83 | 4308 | offsets, |
c5a35c3c | 4309 | /*is_data_member=*/false); |
17bbb839 MM |
4310 | |
4311 | return next_field; | |
d77249e7 MM |
4312 | } |
4313 | ||
c20118a8 | 4314 | /* Layout all of the non-virtual base classes. Record empty |
17bbb839 MM |
4315 | subobjects in OFFSETS. T is the most derived type. Return nonzero |
4316 | if the type cannot be nearly empty. The fields created | |
4317 | corresponding to the base classes will be inserted at | |
4318 | *NEXT_FIELD. */ | |
607cf131 | 4319 | |
17bbb839 | 4320 | static void |
58731fd1 | 4321 | build_base_fields (record_layout_info rli, |
17bbb839 | 4322 | splay_tree offsets, tree *next_field) |
607cf131 MM |
4323 | { |
4324 | /* Chain to hold all the new FIELD_DECLs which stand in for base class | |
4325 | subobjects. */ | |
17bbb839 | 4326 | tree t = rli->t; |
604a3205 | 4327 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
5c24fba6 | 4328 | int i; |
607cf131 | 4329 | |
3461fba7 | 4330 | /* The primary base class is always allocated first. */ |
17bbb839 MM |
4331 | if (CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
4332 | next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t), | |
58731fd1 | 4333 | offsets, next_field); |
d77249e7 MM |
4334 | |
4335 | /* Now allocate the rest of the bases. */ | |
607cf131 MM |
4336 | for (i = 0; i < n_baseclasses; ++i) |
4337 | { | |
d77249e7 | 4338 | tree base_binfo; |
607cf131 | 4339 | |
604a3205 | 4340 | base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i); |
911a71a7 | 4341 | |
3461fba7 NS |
4342 | /* The primary base was already allocated above, so we don't |
4343 | need to allocate it again here. */ | |
17bbb839 | 4344 | if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t)) |
607cf131 MM |
4345 | continue; |
4346 | ||
dbbf88d1 NS |
4347 | /* Virtual bases are added at the end (a primary virtual base |
4348 | will have already been added). */ | |
809e3e7f | 4349 | if (BINFO_VIRTUAL_P (base_binfo)) |
607cf131 MM |
4350 | continue; |
4351 | ||
58731fd1 | 4352 | next_field = build_base_field (rli, base_binfo, |
17bbb839 | 4353 | offsets, next_field); |
607cf131 | 4354 | } |
607cf131 MM |
4355 | } |
4356 | ||
58010b57 MM |
4357 | /* Go through the TYPE_METHODS of T issuing any appropriate |
4358 | diagnostics, figuring out which methods override which other | |
3ef397c1 | 4359 | methods, and so forth. */ |
58010b57 MM |
4360 | |
4361 | static void | |
94edc4ab | 4362 | check_methods (tree t) |
58010b57 MM |
4363 | { |
4364 | tree x; | |
58010b57 | 4365 | |
910ad8de | 4366 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
58010b57 | 4367 | { |
58010b57 | 4368 | check_for_override (x, t); |
fee7654e | 4369 | if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x)) |
dee15844 | 4370 | error ("initializer specified for non-virtual method %q+D", x); |
58010b57 MM |
4371 | /* The name of the field is the original field name |
4372 | Save this in auxiliary field for later overloading. */ | |
4373 | if (DECL_VINDEX (x)) | |
4374 | { | |
3ef397c1 | 4375 | TYPE_POLYMORPHIC_P (t) = 1; |
fee7654e | 4376 | if (DECL_PURE_VIRTUAL_P (x)) |
9771b263 | 4377 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x); |
58010b57 | 4378 | } |
46408846 JM |
4379 | /* All user-provided destructors are non-trivial. |
4380 | Constructors and assignment ops are handled in | |
4381 | grok_special_member_properties. */ | |
20f2653e | 4382 | if (DECL_DESTRUCTOR_P (x) && user_provided_p (x)) |
9f4faeae | 4383 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1; |
58010b57 | 4384 | } |
58010b57 MM |
4385 | } |
4386 | ||
db9b2174 MM |
4387 | /* FN is a constructor or destructor. Clone the declaration to create |
4388 | a specialized in-charge or not-in-charge version, as indicated by | |
4389 | NAME. */ | |
4390 | ||
4391 | static tree | |
94edc4ab | 4392 | build_clone (tree fn, tree name) |
db9b2174 MM |
4393 | { |
4394 | tree parms; | |
4395 | tree clone; | |
4396 | ||
4397 | /* Copy the function. */ | |
4398 | clone = copy_decl (fn); | |
db9b2174 MM |
4399 | /* Reset the function name. */ |
4400 | DECL_NAME (clone) = name; | |
71cb9286 | 4401 | SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE); |
b97e8a14 JM |
4402 | /* Remember where this function came from. */ |
4403 | DECL_ABSTRACT_ORIGIN (clone) = fn; | |
4404 | /* Make it easy to find the CLONE given the FN. */ | |
910ad8de NF |
4405 | DECL_CHAIN (clone) = DECL_CHAIN (fn); |
4406 | DECL_CHAIN (fn) = clone; | |
b97e8a14 JM |
4407 | |
4408 | /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */ | |
4409 | if (TREE_CODE (clone) == TEMPLATE_DECL) | |
4410 | { | |
4411 | tree result = build_clone (DECL_TEMPLATE_RESULT (clone), name); | |
4412 | DECL_TEMPLATE_RESULT (clone) = result; | |
4413 | DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result)); | |
4414 | DECL_TI_TEMPLATE (result) = clone; | |
4415 | TREE_TYPE (clone) = TREE_TYPE (result); | |
4416 | return clone; | |
4417 | } | |
4418 | ||
4419 | DECL_CLONED_FUNCTION (clone) = fn; | |
db9b2174 MM |
4420 | /* There's no pending inline data for this function. */ |
4421 | DECL_PENDING_INLINE_INFO (clone) = NULL; | |
4422 | DECL_PENDING_INLINE_P (clone) = 0; | |
db9b2174 | 4423 | |
298d6f60 MM |
4424 | /* The base-class destructor is not virtual. */ |
4425 | if (name == base_dtor_identifier) | |
4426 | { | |
4427 | DECL_VIRTUAL_P (clone) = 0; | |
4428 | if (TREE_CODE (clone) != TEMPLATE_DECL) | |
4429 | DECL_VINDEX (clone) = NULL_TREE; | |
4430 | } | |
4431 | ||
4e7512c9 | 4432 | /* If there was an in-charge parameter, drop it from the function |
db9b2174 MM |
4433 | type. */ |
4434 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4435 | { | |
4436 | tree basetype; | |
4437 | tree parmtypes; | |
4438 | tree exceptions; | |
4439 | ||
4440 | exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); | |
4441 | basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); | |
4442 | parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4443 | /* Skip the `this' parameter. */ | |
4444 | parmtypes = TREE_CHAIN (parmtypes); | |
4445 | /* Skip the in-charge parameter. */ | |
4446 | parmtypes = TREE_CHAIN (parmtypes); | |
e0fff4b3 JM |
4447 | /* And the VTT parm, in a complete [cd]tor. */ |
4448 | if (DECL_HAS_VTT_PARM_P (fn) | |
4449 | && ! DECL_NEEDS_VTT_PARM_P (clone)) | |
4450 | parmtypes = TREE_CHAIN (parmtypes); | |
3ec6bad3 MM |
4451 | /* If this is subobject constructor or destructor, add the vtt |
4452 | parameter. */ | |
c8094d83 | 4453 | TREE_TYPE (clone) |
43dc123f MM |
4454 | = build_method_type_directly (basetype, |
4455 | TREE_TYPE (TREE_TYPE (clone)), | |
4456 | parmtypes); | |
db9b2174 MM |
4457 | if (exceptions) |
4458 | TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone), | |
4459 | exceptions); | |
c8094d83 | 4460 | TREE_TYPE (clone) |
e9525111 MM |
4461 | = cp_build_type_attribute_variant (TREE_TYPE (clone), |
4462 | TYPE_ATTRIBUTES (TREE_TYPE (fn))); | |
db9b2174 MM |
4463 | } |
4464 | ||
b97e8a14 JM |
4465 | /* Copy the function parameters. */ |
4466 | DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone)); | |
4467 | /* Remove the in-charge parameter. */ | |
4468 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4469 | { | |
910ad8de NF |
4470 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4471 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 JM |
4472 | DECL_HAS_IN_CHARGE_PARM_P (clone) = 0; |
4473 | } | |
4474 | /* And the VTT parm, in a complete [cd]tor. */ | |
4475 | if (DECL_HAS_VTT_PARM_P (fn)) | |
db9b2174 | 4476 | { |
b97e8a14 JM |
4477 | if (DECL_NEEDS_VTT_PARM_P (clone)) |
4478 | DECL_HAS_VTT_PARM_P (clone) = 1; | |
4479 | else | |
db9b2174 | 4480 | { |
910ad8de NF |
4481 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4482 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 | 4483 | DECL_HAS_VTT_PARM_P (clone) = 0; |
3ec6bad3 | 4484 | } |
b97e8a14 | 4485 | } |
3ec6bad3 | 4486 | |
910ad8de | 4487 | for (parms = DECL_ARGUMENTS (clone); parms; parms = DECL_CHAIN (parms)) |
b97e8a14 JM |
4488 | { |
4489 | DECL_CONTEXT (parms) = clone; | |
4490 | cxx_dup_lang_specific_decl (parms); | |
db9b2174 MM |
4491 | } |
4492 | ||
db9b2174 | 4493 | /* Create the RTL for this function. */ |
245763e3 | 4494 | SET_DECL_RTL (clone, NULL); |
0e6df31e | 4495 | rest_of_decl_compilation (clone, /*top_level=*/1, at_eof); |
c8094d83 | 4496 | |
b97e8a14 JM |
4497 | if (pch_file) |
4498 | note_decl_for_pch (clone); | |
db9b2174 | 4499 | |
b97e8a14 JM |
4500 | return clone; |
4501 | } | |
db9b2174 | 4502 | |
b97e8a14 JM |
4503 | /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do |
4504 | not invoke this function directly. | |
4505 | ||
4506 | For a non-thunk function, returns the address of the slot for storing | |
4507 | the function it is a clone of. Otherwise returns NULL_TREE. | |
4508 | ||
4509 | If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if | |
4510 | cloned_function is unset. This is to support the separate | |
4511 | DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter | |
4512 | on a template makes sense, but not the former. */ | |
4513 | ||
4514 | tree * | |
4515 | decl_cloned_function_p (const_tree decl, bool just_testing) | |
4516 | { | |
4517 | tree *ptr; | |
4518 | if (just_testing) | |
4519 | decl = STRIP_TEMPLATE (decl); | |
4520 | ||
4521 | if (TREE_CODE (decl) != FUNCTION_DECL | |
4522 | || !DECL_LANG_SPECIFIC (decl) | |
4523 | || DECL_LANG_SPECIFIC (decl)->u.fn.thunk_p) | |
4524 | { | |
4525 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
4526 | if (!just_testing) | |
4527 | lang_check_failed (__FILE__, __LINE__, __FUNCTION__); | |
4528 | else | |
4529 | #endif | |
4530 | return NULL; | |
db9b2174 MM |
4531 | } |
4532 | ||
b97e8a14 JM |
4533 | ptr = &DECL_LANG_SPECIFIC (decl)->u.fn.u5.cloned_function; |
4534 | if (just_testing && *ptr == NULL_TREE) | |
4535 | return NULL; | |
4536 | else | |
4537 | return ptr; | |
db9b2174 MM |
4538 | } |
4539 | ||
4540 | /* Produce declarations for all appropriate clones of FN. If | |
838dfd8a | 4541 | UPDATE_METHOD_VEC_P is nonzero, the clones are added to the |
db9b2174 MM |
4542 | CLASTYPE_METHOD_VEC as well. */ |
4543 | ||
4544 | void | |
94edc4ab | 4545 | clone_function_decl (tree fn, int update_method_vec_p) |
db9b2174 MM |
4546 | { |
4547 | tree clone; | |
4548 | ||
c00996a3 | 4549 | /* Avoid inappropriate cloning. */ |
910ad8de NF |
4550 | if (DECL_CHAIN (fn) |
4551 | && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn))) | |
c00996a3 JM |
4552 | return; |
4553 | ||
298d6f60 | 4554 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) |
db9b2174 | 4555 | { |
298d6f60 MM |
4556 | /* For each constructor, we need two variants: an in-charge version |
4557 | and a not-in-charge version. */ | |
db9b2174 MM |
4558 | clone = build_clone (fn, complete_ctor_identifier); |
4559 | if (update_method_vec_p) | |
b2a9b208 | 4560 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4561 | clone = build_clone (fn, base_ctor_identifier); |
4562 | if (update_method_vec_p) | |
b2a9b208 | 4563 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4564 | } |
4565 | else | |
298d6f60 | 4566 | { |
50bc768d | 4567 | gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)); |
298d6f60 | 4568 | |
3ec6bad3 | 4569 | /* For each destructor, we need three variants: an in-charge |
298d6f60 | 4570 | version, a not-in-charge version, and an in-charge deleting |
4e7512c9 MM |
4571 | version. We clone the deleting version first because that |
4572 | means it will go second on the TYPE_METHODS list -- and that | |
4573 | corresponds to the correct layout order in the virtual | |
c8094d83 | 4574 | function table. |
52682a1b | 4575 | |
0cbd7506 | 4576 | For a non-virtual destructor, we do not build a deleting |
52682a1b MM |
4577 | destructor. */ |
4578 | if (DECL_VIRTUAL_P (fn)) | |
4579 | { | |
4580 | clone = build_clone (fn, deleting_dtor_identifier); | |
4581 | if (update_method_vec_p) | |
b2a9b208 | 4582 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
52682a1b | 4583 | } |
4e7512c9 | 4584 | clone = build_clone (fn, complete_dtor_identifier); |
298d6f60 | 4585 | if (update_method_vec_p) |
b2a9b208 | 4586 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 MM |
4587 | clone = build_clone (fn, base_dtor_identifier); |
4588 | if (update_method_vec_p) | |
b2a9b208 | 4589 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 | 4590 | } |
5daf7c0a JM |
4591 | |
4592 | /* Note that this is an abstract function that is never emitted. */ | |
4593 | DECL_ABSTRACT (fn) = 1; | |
db9b2174 MM |
4594 | } |
4595 | ||
5f6eeeb3 NS |
4596 | /* DECL is an in charge constructor, which is being defined. This will |
4597 | have had an in class declaration, from whence clones were | |
4598 | declared. An out-of-class definition can specify additional default | |
4599 | arguments. As it is the clones that are involved in overload | |
4600 | resolution, we must propagate the information from the DECL to its | |
00a17e31 | 4601 | clones. */ |
5f6eeeb3 NS |
4602 | |
4603 | void | |
94edc4ab | 4604 | adjust_clone_args (tree decl) |
5f6eeeb3 NS |
4605 | { |
4606 | tree clone; | |
c8094d83 | 4607 | |
910ad8de NF |
4608 | for (clone = DECL_CHAIN (decl); clone && DECL_CLONED_FUNCTION_P (clone); |
4609 | clone = DECL_CHAIN (clone)) | |
5f6eeeb3 NS |
4610 | { |
4611 | tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4612 | tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
4613 | tree decl_parms, clone_parms; | |
4614 | ||
4615 | clone_parms = orig_clone_parms; | |
c8094d83 | 4616 | |
00a17e31 | 4617 | /* Skip the 'this' parameter. */ |
5f6eeeb3 NS |
4618 | orig_clone_parms = TREE_CHAIN (orig_clone_parms); |
4619 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4620 | ||
4621 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) | |
4622 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4623 | if (DECL_HAS_VTT_PARM_P (decl)) | |
4624 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
c8094d83 | 4625 | |
5f6eeeb3 NS |
4626 | clone_parms = orig_clone_parms; |
4627 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4628 | clone_parms = TREE_CHAIN (clone_parms); | |
c8094d83 | 4629 | |
5f6eeeb3 NS |
4630 | for (decl_parms = orig_decl_parms; decl_parms; |
4631 | decl_parms = TREE_CHAIN (decl_parms), | |
4632 | clone_parms = TREE_CHAIN (clone_parms)) | |
4633 | { | |
50bc768d NS |
4634 | gcc_assert (same_type_p (TREE_TYPE (decl_parms), |
4635 | TREE_TYPE (clone_parms))); | |
c8094d83 | 4636 | |
5f6eeeb3 NS |
4637 | if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms)) |
4638 | { | |
4639 | /* A default parameter has been added. Adjust the | |
00a17e31 | 4640 | clone's parameters. */ |
5f6eeeb3 | 4641 | tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); |
3c3905fc | 4642 | tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (clone)); |
5f6eeeb3 NS |
4643 | tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); |
4644 | tree type; | |
4645 | ||
4646 | clone_parms = orig_decl_parms; | |
4647 | ||
4648 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4649 | { | |
4650 | clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms), | |
4651 | TREE_VALUE (orig_clone_parms), | |
4652 | clone_parms); | |
4653 | TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms); | |
4654 | } | |
43dc123f MM |
4655 | type = build_method_type_directly (basetype, |
4656 | TREE_TYPE (TREE_TYPE (clone)), | |
4657 | clone_parms); | |
5f6eeeb3 NS |
4658 | if (exceptions) |
4659 | type = build_exception_variant (type, exceptions); | |
3c3905fc JM |
4660 | if (attrs) |
4661 | type = cp_build_type_attribute_variant (type, attrs); | |
5f6eeeb3 | 4662 | TREE_TYPE (clone) = type; |
c8094d83 | 4663 | |
5f6eeeb3 NS |
4664 | clone_parms = NULL_TREE; |
4665 | break; | |
4666 | } | |
4667 | } | |
50bc768d | 4668 | gcc_assert (!clone_parms); |
5f6eeeb3 NS |
4669 | } |
4670 | } | |
4671 | ||
db9b2174 MM |
4672 | /* For each of the constructors and destructors in T, create an |
4673 | in-charge and not-in-charge variant. */ | |
4674 | ||
4675 | static void | |
94edc4ab | 4676 | clone_constructors_and_destructors (tree t) |
db9b2174 MM |
4677 | { |
4678 | tree fns; | |
4679 | ||
db9b2174 MM |
4680 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail |
4681 | out now. */ | |
4682 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4683 | return; | |
4684 | ||
db9b2174 MM |
4685 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4686 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
298d6f60 MM |
4687 | for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4688 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
db9b2174 MM |
4689 | } |
4690 | ||
593a0835 PC |
4691 | /* Deduce noexcept for a destructor DTOR. */ |
4692 | ||
4693 | void | |
4694 | deduce_noexcept_on_destructor (tree dtor) | |
4695 | { | |
4696 | if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor))) | |
4697 | { | |
4698 | tree ctx = DECL_CONTEXT (dtor); | |
4699 | tree implicit_fn = implicitly_declare_fn (sfk_destructor, ctx, | |
85b5d65a JM |
4700 | /*const_p=*/false, |
4701 | NULL, NULL); | |
593a0835 PC |
4702 | tree eh_spec = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn)); |
4703 | TREE_TYPE (dtor) = build_exception_variant (TREE_TYPE (dtor), eh_spec); | |
4704 | } | |
4705 | } | |
4706 | ||
4707 | /* For each destructor in T, deduce noexcept: | |
4708 | ||
4709 | 12.4/3: A declaration of a destructor that does not have an | |
4710 | exception-specification is implicitly considered to have the | |
4711 | same exception-specification as an implicit declaration (15.4). */ | |
4712 | ||
4713 | static void | |
4714 | deduce_noexcept_on_destructors (tree t) | |
4715 | { | |
593a0835 PC |
4716 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail |
4717 | out now. */ | |
4718 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4719 | return; | |
4720 | ||
a5e90b2a | 4721 | for (tree fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
593a0835 PC |
4722 | deduce_noexcept_on_destructor (OVL_CURRENT (fns)); |
4723 | } | |
4724 | ||
0a35513e AH |
4725 | /* Subroutine of set_one_vmethod_tm_attributes. Search base classes |
4726 | of TYPE for virtual functions which FNDECL overrides. Return a | |
4727 | mask of the tm attributes found therein. */ | |
4728 | ||
4729 | static int | |
4730 | look_for_tm_attr_overrides (tree type, tree fndecl) | |
4731 | { | |
4732 | tree binfo = TYPE_BINFO (type); | |
4733 | tree base_binfo; | |
4734 | int ix, found = 0; | |
4735 | ||
4736 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ++ix) | |
4737 | { | |
4738 | tree o, basetype = BINFO_TYPE (base_binfo); | |
4739 | ||
4740 | if (!TYPE_POLYMORPHIC_P (basetype)) | |
4741 | continue; | |
4742 | ||
4743 | o = look_for_overrides_here (basetype, fndecl); | |
4744 | if (o) | |
4745 | found |= tm_attr_to_mask (find_tm_attribute | |
4746 | (TYPE_ATTRIBUTES (TREE_TYPE (o)))); | |
4747 | else | |
4748 | found |= look_for_tm_attr_overrides (basetype, fndecl); | |
4749 | } | |
4750 | ||
4751 | return found; | |
4752 | } | |
4753 | ||
4754 | /* Subroutine of set_method_tm_attributes. Handle the checks and | |
4755 | inheritance for one virtual method FNDECL. */ | |
4756 | ||
4757 | static void | |
4758 | set_one_vmethod_tm_attributes (tree type, tree fndecl) | |
4759 | { | |
4760 | tree tm_attr; | |
4761 | int found, have; | |
4762 | ||
4763 | found = look_for_tm_attr_overrides (type, fndecl); | |
4764 | ||
4765 | /* If FNDECL doesn't actually override anything (i.e. T is the | |
4766 | class that first declares FNDECL virtual), then we're done. */ | |
4767 | if (found == 0) | |
4768 | return; | |
4769 | ||
4770 | tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl))); | |
4771 | have = tm_attr_to_mask (tm_attr); | |
4772 | ||
4773 | /* Intel STM Language Extension 3.0, Section 4.2 table 4: | |
4774 | tm_pure must match exactly, otherwise no weakening of | |
4775 | tm_safe > tm_callable > nothing. */ | |
4776 | /* ??? The tm_pure attribute didn't make the transition to the | |
4777 | multivendor language spec. */ | |
4778 | if (have == TM_ATTR_PURE) | |
4779 | { | |
4780 | if (found != TM_ATTR_PURE) | |
4781 | { | |
4782 | found &= -found; | |
4783 | goto err_override; | |
4784 | } | |
4785 | } | |
4786 | /* If the overridden function is tm_pure, then FNDECL must be. */ | |
4787 | else if (found == TM_ATTR_PURE && tm_attr) | |
4788 | goto err_override; | |
4789 | /* Look for base class combinations that cannot be satisfied. */ | |
4790 | else if (found != TM_ATTR_PURE && (found & TM_ATTR_PURE)) | |
4791 | { | |
4792 | found &= ~TM_ATTR_PURE; | |
4793 | found &= -found; | |
4794 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4795 | "method overrides both %<transaction_pure%> and %qE methods", | |
4796 | tm_mask_to_attr (found)); | |
4797 | } | |
4798 | /* If FNDECL did not declare an attribute, then inherit the most | |
4799 | restrictive one. */ | |
4800 | else if (tm_attr == NULL) | |
4801 | { | |
4802 | apply_tm_attr (fndecl, tm_mask_to_attr (found & -found)); | |
4803 | } | |
4804 | /* Otherwise validate that we're not weaker than a function | |
4805 | that is being overridden. */ | |
4806 | else | |
4807 | { | |
4808 | found &= -found; | |
4809 | if (found <= TM_ATTR_CALLABLE && have > found) | |
4810 | goto err_override; | |
4811 | } | |
4812 | return; | |
4813 | ||
4814 | err_override: | |
4815 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4816 | "method declared %qE overriding %qE method", | |
4817 | tm_attr, tm_mask_to_attr (found)); | |
4818 | } | |
4819 | ||
4820 | /* For each of the methods in T, propagate a class-level tm attribute. */ | |
4821 | ||
4822 | static void | |
4823 | set_method_tm_attributes (tree t) | |
4824 | { | |
4825 | tree class_tm_attr, fndecl; | |
4826 | ||
4827 | /* Don't bother collecting tm attributes if transactional memory | |
4828 | support is not enabled. */ | |
4829 | if (!flag_tm) | |
4830 | return; | |
4831 | ||
4832 | /* Process virtual methods first, as they inherit directly from the | |
4833 | base virtual function and also require validation of new attributes. */ | |
4834 | if (TYPE_CONTAINS_VPTR_P (t)) | |
4835 | { | |
4836 | tree vchain; | |
4837 | for (vchain = BINFO_VIRTUALS (TYPE_BINFO (t)); vchain; | |
4838 | vchain = TREE_CHAIN (vchain)) | |
00a42fb3 AH |
4839 | { |
4840 | fndecl = BV_FN (vchain); | |
4841 | if (DECL_THUNK_P (fndecl)) | |
4842 | fndecl = THUNK_TARGET (fndecl); | |
4843 | set_one_vmethod_tm_attributes (t, fndecl); | |
4844 | } | |
0a35513e AH |
4845 | } |
4846 | ||
4847 | /* If the class doesn't have an attribute, nothing more to do. */ | |
4848 | class_tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (t)); | |
4849 | if (class_tm_attr == NULL) | |
4850 | return; | |
4851 | ||
4852 | /* Any method that does not yet have a tm attribute inherits | |
4853 | the one from the class. */ | |
4854 | for (fndecl = TYPE_METHODS (t); fndecl; fndecl = TREE_CHAIN (fndecl)) | |
4855 | { | |
4856 | if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl)))) | |
4857 | apply_tm_attr (fndecl, class_tm_attr); | |
4858 | } | |
4859 | } | |
4860 | ||
8c95264b MLI |
4861 | /* Returns true iff class T has a user-defined constructor other than |
4862 | the default constructor. */ | |
4863 | ||
4864 | bool | |
4865 | type_has_user_nondefault_constructor (tree t) | |
4866 | { | |
4867 | tree fns; | |
4868 | ||
4869 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4870 | return false; | |
4871 | ||
4872 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4873 | { | |
4874 | tree fn = OVL_CURRENT (fns); | |
4875 | if (!DECL_ARTIFICIAL (fn) | |
c2b58ba2 JM |
4876 | && (TREE_CODE (fn) == TEMPLATE_DECL |
4877 | || (skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn)) | |
4878 | != NULL_TREE))) | |
8c95264b MLI |
4879 | return true; |
4880 | } | |
4881 | ||
4882 | return false; | |
4883 | } | |
4884 | ||
6ad86a5b FC |
4885 | /* Returns the defaulted constructor if T has one. Otherwise, returns |
4886 | NULL_TREE. */ | |
4887 | ||
4888 | tree | |
4889 | in_class_defaulted_default_constructor (tree t) | |
4890 | { | |
4891 | tree fns, args; | |
4892 | ||
4893 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4894 | return NULL_TREE; | |
4895 | ||
4896 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4897 | { | |
4898 | tree fn = OVL_CURRENT (fns); | |
4899 | ||
4900 | if (DECL_DEFAULTED_IN_CLASS_P (fn)) | |
4901 | { | |
4902 | args = FUNCTION_FIRST_USER_PARMTYPE (fn); | |
4903 | while (args && TREE_PURPOSE (args)) | |
4904 | args = TREE_CHAIN (args); | |
4905 | if (!args || args == void_list_node) | |
4906 | return fn; | |
4907 | } | |
4908 | } | |
4909 | ||
4910 | return NULL_TREE; | |
4911 | } | |
4912 | ||
b87d79e6 | 4913 | /* Returns true iff FN is a user-provided function, i.e. user-declared |
20f2653e JM |
4914 | and not defaulted at its first declaration; or explicit, private, |
4915 | protected, or non-const. */ | |
b87d79e6 | 4916 | |
20f2653e | 4917 | bool |
b87d79e6 JM |
4918 | user_provided_p (tree fn) |
4919 | { | |
4920 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
4921 | return true; | |
4922 | else | |
4923 | return (!DECL_ARTIFICIAL (fn) | |
eca7fc57 JM |
4924 | && !(DECL_INITIALIZED_IN_CLASS_P (fn) |
4925 | && (DECL_DEFAULTED_FN (fn) || DECL_DELETED_FN (fn)))); | |
b87d79e6 JM |
4926 | } |
4927 | ||
4928 | /* Returns true iff class T has a user-provided constructor. */ | |
4929 | ||
4930 | bool | |
4931 | type_has_user_provided_constructor (tree t) | |
4932 | { | |
4933 | tree fns; | |
4934 | ||
fd97a96a JM |
4935 | if (!CLASS_TYPE_P (t)) |
4936 | return false; | |
4937 | ||
b87d79e6 JM |
4938 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) |
4939 | return false; | |
4940 | ||
4941 | /* This can happen in error cases; avoid crashing. */ | |
4942 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4943 | return false; | |
4944 | ||
4945 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4946 | if (user_provided_p (OVL_CURRENT (fns))) | |
4947 | return true; | |
4948 | ||
4949 | return false; | |
4950 | } | |
4951 | ||
4952 | /* Returns true iff class T has a user-provided default constructor. */ | |
4953 | ||
4954 | bool | |
4955 | type_has_user_provided_default_constructor (tree t) | |
4956 | { | |
71b8cb01 | 4957 | tree fns; |
b87d79e6 JM |
4958 | |
4959 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4960 | return false; | |
4961 | ||
4962 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4963 | { | |
4964 | tree fn = OVL_CURRENT (fns); | |
7ad8d488 | 4965 | if (TREE_CODE (fn) == FUNCTION_DECL |
71b8cb01 JM |
4966 | && user_provided_p (fn) |
4967 | && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn))) | |
4968 | return true; | |
b87d79e6 JM |
4969 | } |
4970 | ||
4971 | return false; | |
4972 | } | |
4973 | ||
32bfcf80 JM |
4974 | /* TYPE is being used as a virtual base, and has a non-trivial move |
4975 | assignment. Return true if this is due to there being a user-provided | |
4976 | move assignment in TYPE or one of its subobjects; if there isn't, then | |
4977 | multiple move assignment can't cause any harm. */ | |
4978 | ||
4979 | bool | |
4980 | vbase_has_user_provided_move_assign (tree type) | |
4981 | { | |
4982 | /* Does the type itself have a user-provided move assignment operator? */ | |
4983 | for (tree fns | |
4984 | = lookup_fnfields_slot_nolazy (type, ansi_assopname (NOP_EXPR)); | |
4985 | fns; fns = OVL_NEXT (fns)) | |
4986 | { | |
4987 | tree fn = OVL_CURRENT (fns); | |
4988 | if (move_fn_p (fn) && user_provided_p (fn)) | |
4989 | return true; | |
4990 | } | |
4991 | ||
4992 | /* Do any of its bases? */ | |
4993 | tree binfo = TYPE_BINFO (type); | |
4994 | tree base_binfo; | |
4995 | for (int i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
4996 | if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo))) | |
4997 | return true; | |
4998 | ||
4999 | /* Or non-static data members? */ | |
5000 | for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
5001 | { | |
5002 | if (TREE_CODE (field) == FIELD_DECL | |
5003 | && CLASS_TYPE_P (TREE_TYPE (field)) | |
5004 | && vbase_has_user_provided_move_assign (TREE_TYPE (field))) | |
5005 | return true; | |
5006 | } | |
5007 | ||
5008 | /* Seems not. */ | |
5009 | return false; | |
5010 | } | |
5011 | ||
6132bdd7 JM |
5012 | /* If default-initialization leaves part of TYPE uninitialized, returns |
5013 | a DECL for the field or TYPE itself (DR 253). */ | |
5014 | ||
5015 | tree | |
5016 | default_init_uninitialized_part (tree type) | |
5017 | { | |
5018 | tree t, r, binfo; | |
5019 | int i; | |
5020 | ||
5021 | type = strip_array_types (type); | |
5022 | if (!CLASS_TYPE_P (type)) | |
5023 | return type; | |
5024 | if (type_has_user_provided_default_constructor (type)) | |
5025 | return NULL_TREE; | |
5026 | for (binfo = TYPE_BINFO (type), i = 0; | |
5027 | BINFO_BASE_ITERATE (binfo, i, t); ++i) | |
5028 | { | |
5029 | r = default_init_uninitialized_part (BINFO_TYPE (t)); | |
5030 | if (r) | |
5031 | return r; | |
5032 | } | |
5033 | for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t)) | |
5034 | if (TREE_CODE (t) == FIELD_DECL | |
5035 | && !DECL_ARTIFICIAL (t) | |
5036 | && !DECL_INITIAL (t)) | |
5037 | { | |
5038 | r = default_init_uninitialized_part (TREE_TYPE (t)); | |
5039 | if (r) | |
5040 | return DECL_P (r) ? r : t; | |
5041 | } | |
5042 | ||
5043 | return NULL_TREE; | |
5044 | } | |
5045 | ||
fd3faf2b | 5046 | /* Returns true iff for class T, a trivial synthesized default constructor |
0930cc0e JM |
5047 | would be constexpr. */ |
5048 | ||
5049 | bool | |
fd3faf2b | 5050 | trivial_default_constructor_is_constexpr (tree t) |
0930cc0e | 5051 | { |
fd3faf2b | 5052 | /* A defaulted trivial default constructor is constexpr |
0930cc0e | 5053 | if there is nothing to initialize. */ |
fd3faf2b | 5054 | gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t)); |
0930cc0e JM |
5055 | return is_really_empty_class (t); |
5056 | } | |
5057 | ||
91ea6df3 GDR |
5058 | /* Returns true iff class T has a constexpr default constructor. */ |
5059 | ||
5060 | bool | |
5061 | type_has_constexpr_default_constructor (tree t) | |
5062 | { | |
5063 | tree fns; | |
5064 | ||
5065 | if (!CLASS_TYPE_P (t)) | |
69f36ba6 JM |
5066 | { |
5067 | /* The caller should have stripped an enclosing array. */ | |
5068 | gcc_assert (TREE_CODE (t) != ARRAY_TYPE); | |
5069 | return false; | |
5070 | } | |
0930cc0e | 5071 | if (CLASSTYPE_LAZY_DEFAULT_CTOR (t)) |
fd3faf2b JM |
5072 | { |
5073 | if (!TYPE_HAS_COMPLEX_DFLT (t)) | |
5074 | return trivial_default_constructor_is_constexpr (t); | |
5075 | /* Non-trivial, we need to check subobject constructors. */ | |
5076 | lazily_declare_fn (sfk_constructor, t); | |
5077 | } | |
f7d042e2 | 5078 | fns = locate_ctor (t); |
91ea6df3 GDR |
5079 | return (fns && DECL_DECLARED_CONSTEXPR_P (fns)); |
5080 | } | |
5081 | ||
46408846 JM |
5082 | /* Returns true iff class TYPE has a virtual destructor. */ |
5083 | ||
5084 | bool | |
5085 | type_has_virtual_destructor (tree type) | |
5086 | { | |
5087 | tree dtor; | |
5088 | ||
5089 | if (!CLASS_TYPE_P (type)) | |
5090 | return false; | |
5091 | ||
5092 | gcc_assert (COMPLETE_TYPE_P (type)); | |
5093 | dtor = CLASSTYPE_DESTRUCTORS (type); | |
5094 | return (dtor && DECL_VIRTUAL_P (dtor)); | |
5095 | } | |
5096 | ||
ac177431 JM |
5097 | /* Returns true iff class T has a move constructor. */ |
5098 | ||
5099 | bool | |
5100 | type_has_move_constructor (tree t) | |
5101 | { | |
5102 | tree fns; | |
5103 | ||
5104 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
5105 | { | |
5106 | gcc_assert (COMPLETE_TYPE_P (t)); | |
5107 | lazily_declare_fn (sfk_move_constructor, t); | |
5108 | } | |
5109 | ||
5110 | if (!CLASSTYPE_METHOD_VEC (t)) | |
5111 | return false; | |
5112 | ||
5113 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5114 | if (move_fn_p (OVL_CURRENT (fns))) | |
5115 | return true; | |
5116 | ||
5117 | return false; | |
5118 | } | |
5119 | ||
5120 | /* Returns true iff class T has a move assignment operator. */ | |
5121 | ||
5122 | bool | |
5123 | type_has_move_assign (tree t) | |
5124 | { | |
5125 | tree fns; | |
5126 | ||
5127 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
5128 | { | |
5129 | gcc_assert (COMPLETE_TYPE_P (t)); | |
5130 | lazily_declare_fn (sfk_move_assignment, t); | |
5131 | } | |
5132 | ||
fa4ba4af | 5133 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
ac177431 JM |
5134 | fns; fns = OVL_NEXT (fns)) |
5135 | if (move_fn_p (OVL_CURRENT (fns))) | |
5136 | return true; | |
5137 | ||
5138 | return false; | |
5139 | } | |
5140 | ||
a2e70335 JM |
5141 | /* Returns true iff class T has a move constructor that was explicitly |
5142 | declared in the class body. Note that this is different from | |
5143 | "user-provided", which doesn't include functions that are defaulted in | |
5144 | the class. */ | |
5145 | ||
5146 | bool | |
5147 | type_has_user_declared_move_constructor (tree t) | |
5148 | { | |
5149 | tree fns; | |
5150 | ||
5151 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
5152 | return false; | |
5153 | ||
5154 | if (!CLASSTYPE_METHOD_VEC (t)) | |
5155 | return false; | |
5156 | ||
5157 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5158 | { | |
5159 | tree fn = OVL_CURRENT (fns); | |
5160 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
5161 | return true; | |
5162 | } | |
5163 | ||
5164 | return false; | |
5165 | } | |
5166 | ||
5167 | /* Returns true iff class T has a move assignment operator that was | |
5168 | explicitly declared in the class body. */ | |
5169 | ||
5170 | bool | |
5171 | type_has_user_declared_move_assign (tree t) | |
5172 | { | |
5173 | tree fns; | |
5174 | ||
5175 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
5176 | return false; | |
5177 | ||
fa4ba4af | 5178 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
a2e70335 JM |
5179 | fns; fns = OVL_NEXT (fns)) |
5180 | { | |
5181 | tree fn = OVL_CURRENT (fns); | |
5182 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
5183 | return true; | |
5184 | } | |
5185 | ||
5186 | return false; | |
5187 | } | |
5188 | ||
95552437 | 5189 | /* Nonzero if we need to build up a constructor call when initializing an |
eca7fc57 | 5190 | object of this class, either because it has a user-declared constructor |
95552437 JM |
5191 | or because it doesn't have a default constructor (so we need to give an |
5192 | error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when | |
5193 | what you care about is whether or not an object can be produced by a | |
5194 | constructor (e.g. so we don't set TREE_READONLY on const variables of | |
5195 | such type); use this function when what you care about is whether or not | |
5196 | to try to call a constructor to create an object. The latter case is | |
5197 | the former plus some cases of constructors that cannot be called. */ | |
5198 | ||
5199 | bool | |
5200 | type_build_ctor_call (tree t) | |
5201 | { | |
5202 | tree inner; | |
5203 | if (TYPE_NEEDS_CONSTRUCTING (t)) | |
5204 | return true; | |
5205 | inner = strip_array_types (t); | |
eca7fc57 JM |
5206 | if (!CLASS_TYPE_P (inner) || ANON_AGGR_TYPE_P (inner)) |
5207 | return false; | |
5208 | if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner)) | |
5209 | return true; | |
83f31d8d JM |
5210 | if (cxx_dialect < cxx11) |
5211 | return false; | |
eca7fc57 JM |
5212 | /* A user-declared constructor might be private, and a constructor might |
5213 | be trivial but deleted. */ | |
5214 | for (tree fns = lookup_fnfields_slot (inner, complete_ctor_identifier); | |
5215 | fns; fns = OVL_NEXT (fns)) | |
5216 | { | |
5217 | tree fn = OVL_CURRENT (fns); | |
5218 | if (!DECL_ARTIFICIAL (fn) | |
5219 | || DECL_DELETED_FN (fn)) | |
5220 | return true; | |
5221 | } | |
5222 | return false; | |
5223 | } | |
5224 | ||
5225 | /* Like type_build_ctor_call, but for destructors. */ | |
5226 | ||
5227 | bool | |
5228 | type_build_dtor_call (tree t) | |
5229 | { | |
5230 | tree inner; | |
5231 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
5232 | return true; | |
5233 | inner = strip_array_types (t); | |
5234 | if (!CLASS_TYPE_P (inner) || ANON_AGGR_TYPE_P (inner) | |
5235 | || !COMPLETE_TYPE_P (inner)) | |
5236 | return false; | |
83f31d8d JM |
5237 | if (cxx_dialect < cxx11) |
5238 | return false; | |
eca7fc57 JM |
5239 | /* A user-declared destructor might be private, and a destructor might |
5240 | be trivial but deleted. */ | |
5241 | for (tree fns = lookup_fnfields_slot (inner, complete_dtor_identifier); | |
5242 | fns; fns = OVL_NEXT (fns)) | |
5243 | { | |
5244 | tree fn = OVL_CURRENT (fns); | |
5245 | if (!DECL_ARTIFICIAL (fn) | |
5246 | || DECL_DELETED_FN (fn)) | |
5247 | return true; | |
5248 | } | |
5249 | return false; | |
95552437 JM |
5250 | } |
5251 | ||
58010b57 MM |
5252 | /* Remove all zero-width bit-fields from T. */ |
5253 | ||
5254 | static void | |
94edc4ab | 5255 | remove_zero_width_bit_fields (tree t) |
58010b57 MM |
5256 | { |
5257 | tree *fieldsp; | |
5258 | ||
c8094d83 | 5259 | fieldsp = &TYPE_FIELDS (t); |
58010b57 MM |
5260 | while (*fieldsp) |
5261 | { | |
5262 | if (TREE_CODE (*fieldsp) == FIELD_DECL | |
c8094d83 | 5263 | && DECL_C_BIT_FIELD (*fieldsp) |
84894f85 DS |
5264 | /* We should not be confused by the fact that grokbitfield |
5265 | temporarily sets the width of the bit field into | |
5266 | DECL_INITIAL (*fieldsp). | |
5267 | check_bitfield_decl eventually sets DECL_SIZE (*fieldsp) | |
5268 | to that width. */ | |
5269 | && integer_zerop (DECL_SIZE (*fieldsp))) | |
910ad8de | 5270 | *fieldsp = DECL_CHAIN (*fieldsp); |
58010b57 | 5271 | else |
910ad8de | 5272 | fieldsp = &DECL_CHAIN (*fieldsp); |
58010b57 MM |
5273 | } |
5274 | } | |
5275 | ||
dbc957f1 MM |
5276 | /* Returns TRUE iff we need a cookie when dynamically allocating an |
5277 | array whose elements have the indicated class TYPE. */ | |
5278 | ||
5279 | static bool | |
94edc4ab | 5280 | type_requires_array_cookie (tree type) |
dbc957f1 MM |
5281 | { |
5282 | tree fns; | |
18fee3ee | 5283 | bool has_two_argument_delete_p = false; |
dbc957f1 | 5284 | |
50bc768d | 5285 | gcc_assert (CLASS_TYPE_P (type)); |
dbc957f1 MM |
5286 | |
5287 | /* If there's a non-trivial destructor, we need a cookie. In order | |
5288 | to iterate through the array calling the destructor for each | |
5289 | element, we'll have to know how many elements there are. */ | |
5290 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
5291 | return true; | |
5292 | ||
5293 | /* If the usual deallocation function is a two-argument whose second | |
5294 | argument is of type `size_t', then we have to pass the size of | |
5295 | the array to the deallocation function, so we will need to store | |
5296 | a cookie. */ | |
c8094d83 | 5297 | fns = lookup_fnfields (TYPE_BINFO (type), |
dbc957f1 MM |
5298 | ansi_opname (VEC_DELETE_EXPR), |
5299 | /*protect=*/0); | |
5300 | /* If there are no `operator []' members, or the lookup is | |
5301 | ambiguous, then we don't need a cookie. */ | |
5302 | if (!fns || fns == error_mark_node) | |
5303 | return false; | |
5304 | /* Loop through all of the functions. */ | |
50ad9642 | 5305 | for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns)) |
dbc957f1 MM |
5306 | { |
5307 | tree fn; | |
5308 | tree second_parm; | |
5309 | ||
5310 | /* Select the current function. */ | |
5311 | fn = OVL_CURRENT (fns); | |
5312 | /* See if this function is a one-argument delete function. If | |
5313 | it is, then it will be the usual deallocation function. */ | |
5314 | second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))); | |
5315 | if (second_parm == void_list_node) | |
5316 | return false; | |
4b8cb94c SM |
5317 | /* Do not consider this function if its second argument is an |
5318 | ellipsis. */ | |
5319 | if (!second_parm) | |
5320 | continue; | |
dbc957f1 MM |
5321 | /* Otherwise, if we have a two-argument function and the second |
5322 | argument is `size_t', it will be the usual deallocation | |
5323 | function -- unless there is one-argument function, too. */ | |
5324 | if (TREE_CHAIN (second_parm) == void_list_node | |
c79154c4 | 5325 | && same_type_p (TREE_VALUE (second_parm), size_type_node)) |
dbc957f1 MM |
5326 | has_two_argument_delete_p = true; |
5327 | } | |
5328 | ||
5329 | return has_two_argument_delete_p; | |
5330 | } | |
5331 | ||
3b49d762 GDR |
5332 | /* Finish computing the `literal type' property of class type T. |
5333 | ||
5334 | At this point, we have already processed base classes and | |
5335 | non-static data members. We need to check whether the copy | |
5336 | constructor is trivial, the destructor is trivial, and there | |
5337 | is a trivial default constructor or at least one constexpr | |
5338 | constructor other than the copy constructor. */ | |
5339 | ||
5340 | static void | |
5341 | finalize_literal_type_property (tree t) | |
5342 | { | |
0515f4d2 JM |
5343 | tree fn; |
5344 | ||
604b2bfc | 5345 | if (cxx_dialect < cxx11 |
b198484e | 5346 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) |
3b49d762 GDR |
5347 | CLASSTYPE_LITERAL_P (t) = false; |
5348 | else if (CLASSTYPE_LITERAL_P (t) && !TYPE_HAS_TRIVIAL_DFLT (t) | |
b198484e | 5349 | && CLASSTYPE_NON_AGGREGATE (t) |
3b49d762 GDR |
5350 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) |
5351 | CLASSTYPE_LITERAL_P (t) = false; | |
0515f4d2 JM |
5352 | |
5353 | if (!CLASSTYPE_LITERAL_P (t)) | |
5354 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) | |
5355 | if (DECL_DECLARED_CONSTEXPR_P (fn) | |
5356 | && TREE_CODE (fn) != TEMPLATE_DECL | |
5357 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
5358 | && !DECL_CONSTRUCTOR_P (fn)) | |
5359 | { | |
5360 | DECL_DECLARED_CONSTEXPR_P (fn) = false; | |
b432106b | 5361 | if (!DECL_GENERATED_P (fn)) |
f732fa7b JM |
5362 | { |
5363 | error ("enclosing class of constexpr non-static member " | |
5364 | "function %q+#D is not a literal type", fn); | |
5365 | explain_non_literal_class (t); | |
5366 | } | |
0515f4d2 | 5367 | } |
3b49d762 GDR |
5368 | } |
5369 | ||
f732fa7b JM |
5370 | /* T is a non-literal type used in a context which requires a constant |
5371 | expression. Explain why it isn't literal. */ | |
5372 | ||
5373 | void | |
5374 | explain_non_literal_class (tree t) | |
5375 | { | |
5376 | static struct pointer_set_t *diagnosed; | |
5377 | ||
5378 | if (!CLASS_TYPE_P (t)) | |
5379 | return; | |
5380 | t = TYPE_MAIN_VARIANT (t); | |
5381 | ||
5382 | if (diagnosed == NULL) | |
5383 | diagnosed = pointer_set_create (); | |
5384 | if (pointer_set_insert (diagnosed, t) != 0) | |
5385 | /* Already explained. */ | |
5386 | return; | |
5387 | ||
5388 | inform (0, "%q+T is not literal because:", t); | |
5389 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
5390 | inform (0, " %q+T has a non-trivial destructor", t); | |
5391 | else if (CLASSTYPE_NON_AGGREGATE (t) | |
5392 | && !TYPE_HAS_TRIVIAL_DFLT (t) | |
5393 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) | |
fd3faf2b JM |
5394 | { |
5395 | inform (0, " %q+T is not an aggregate, does not have a trivial " | |
5396 | "default constructor, and has no constexpr constructor that " | |
5397 | "is not a copy or move constructor", t); | |
5398 | if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t) | |
5399 | && !type_has_user_provided_default_constructor (t)) | |
efff2fb4 PC |
5400 | { |
5401 | /* Note that we can't simply call locate_ctor because when the | |
5402 | constructor is deleted it just returns NULL_TREE. */ | |
5403 | tree fns; | |
5404 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5405 | { | |
5406 | tree fn = OVL_CURRENT (fns); | |
5407 | tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5408 | ||
5409 | parms = skip_artificial_parms_for (fn, parms); | |
5410 | ||
5411 | if (sufficient_parms_p (parms)) | |
5412 | { | |
5413 | if (DECL_DELETED_FN (fn)) | |
5414 | maybe_explain_implicit_delete (fn); | |
5415 | else | |
5416 | explain_invalid_constexpr_fn (fn); | |
5417 | break; | |
5418 | } | |
5419 | } | |
5420 | } | |
fd3faf2b | 5421 | } |
f732fa7b JM |
5422 | else |
5423 | { | |
5424 | tree binfo, base_binfo, field; int i; | |
5425 | for (binfo = TYPE_BINFO (t), i = 0; | |
5426 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
5427 | { | |
5428 | tree basetype = TREE_TYPE (base_binfo); | |
5429 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
5430 | { | |
5431 | inform (0, " base class %qT of %q+T is non-literal", | |
5432 | basetype, t); | |
5433 | explain_non_literal_class (basetype); | |
5434 | return; | |
5435 | } | |
5436 | } | |
5437 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
5438 | { | |
5439 | tree ftype; | |
5440 | if (TREE_CODE (field) != FIELD_DECL) | |
5441 | continue; | |
5442 | ftype = TREE_TYPE (field); | |
5443 | if (!literal_type_p (ftype)) | |
5444 | { | |
5445 | inform (0, " non-static data member %q+D has " | |
5446 | "non-literal type", field); | |
5447 | if (CLASS_TYPE_P (ftype)) | |
5448 | explain_non_literal_class (ftype); | |
5449 | } | |
5450 | } | |
5451 | } | |
5452 | } | |
5453 | ||
607cf131 MM |
5454 | /* Check the validity of the bases and members declared in T. Add any |
5455 | implicitly-generated functions (like copy-constructors and | |
5456 | assignment operators). Compute various flag bits (like | |
c32097d8 | 5457 | CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++ |
607cf131 MM |
5458 | level: i.e., independently of the ABI in use. */ |
5459 | ||
5460 | static void | |
58731fd1 | 5461 | check_bases_and_members (tree t) |
607cf131 | 5462 | { |
607cf131 MM |
5463 | /* Nonzero if the implicitly generated copy constructor should take |
5464 | a non-const reference argument. */ | |
5465 | int cant_have_const_ctor; | |
78dcd41a | 5466 | /* Nonzero if the implicitly generated assignment operator |
607cf131 MM |
5467 | should take a non-const reference argument. */ |
5468 | int no_const_asn_ref; | |
5469 | tree access_decls; | |
b87d79e6 JM |
5470 | bool saved_complex_asn_ref; |
5471 | bool saved_nontrivial_dtor; | |
20f2653e | 5472 | tree fn; |
607cf131 | 5473 | |
f585f02f JM |
5474 | /* Pick up any abi_tags from our template arguments before checking. */ |
5475 | inherit_targ_abi_tags (t); | |
5476 | ||
607cf131 MM |
5477 | /* By default, we use const reference arguments and generate default |
5478 | constructors. */ | |
607cf131 MM |
5479 | cant_have_const_ctor = 0; |
5480 | no_const_asn_ref = 0; | |
5481 | ||
00a17e31 | 5482 | /* Check all the base-classes. */ |
e5e459bf | 5483 | check_bases (t, &cant_have_const_ctor, |
10746f37 | 5484 | &no_const_asn_ref); |
607cf131 | 5485 | |
52d95c21 JM |
5486 | /* Deduce noexcept on destructors. This needs to happen after we've set |
5487 | triviality flags appropriately for our bases. */ | |
604b2bfc | 5488 | if (cxx_dialect >= cxx11) |
52d95c21 JM |
5489 | deduce_noexcept_on_destructors (t); |
5490 | ||
9f4faeae MM |
5491 | /* Check all the method declarations. */ |
5492 | check_methods (t); | |
5493 | ||
b87d79e6 JM |
5494 | /* Save the initial values of these flags which only indicate whether |
5495 | or not the class has user-provided functions. As we analyze the | |
5496 | bases and members we can set these flags for other reasons. */ | |
066ec0a4 | 5497 | saved_complex_asn_ref = TYPE_HAS_COMPLEX_COPY_ASSIGN (t); |
b87d79e6 JM |
5498 | saved_nontrivial_dtor = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
5499 | ||
9f4faeae MM |
5500 | /* Check all the data member declarations. We cannot call |
5501 | check_field_decls until we have called check_bases check_methods, | |
5502 | as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
5503 | being set appropriately. */ | |
58731fd1 | 5504 | check_field_decls (t, &access_decls, |
607cf131 | 5505 | &cant_have_const_ctor, |
10746f37 | 5506 | &no_const_asn_ref); |
607cf131 | 5507 | |
bbd15aac MM |
5508 | /* A nearly-empty class has to be vptr-containing; a nearly empty |
5509 | class contains just a vptr. */ | |
5510 | if (!TYPE_CONTAINS_VPTR_P (t)) | |
f9c528ea MM |
5511 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; |
5512 | ||
607cf131 MM |
5513 | /* Do some bookkeeping that will guide the generation of implicitly |
5514 | declared member functions. */ | |
066ec0a4 | 5515 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 5516 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
0fcedd9c | 5517 | /* We need to call a constructor for this class if it has a |
b87d79e6 | 5518 | user-provided constructor, or if the default constructor is going |
0fcedd9c JM |
5519 | to initialize the vptr. (This is not an if-and-only-if; |
5520 | TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members | |
5521 | themselves need constructing.) */ | |
607cf131 | 5522 | TYPE_NEEDS_CONSTRUCTING (t) |
b87d79e6 | 5523 | |= (type_has_user_provided_constructor (t) || TYPE_CONTAINS_VPTR_P (t)); |
0fcedd9c JM |
5524 | /* [dcl.init.aggr] |
5525 | ||
b87d79e6 | 5526 | An aggregate is an array or a class with no user-provided |
0fcedd9c JM |
5527 | constructors ... and no virtual functions. |
5528 | ||
5529 | Again, other conditions for being an aggregate are checked | |
5530 | elsewhere. */ | |
5775a06a | 5531 | CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 5532 | |= (type_has_user_provided_constructor (t) || TYPE_POLYMORPHIC_P (t)); |
c32097d8 JM |
5533 | /* This is the C++98/03 definition of POD; it changed in C++0x, but we |
5534 | retain the old definition internally for ABI reasons. */ | |
5535 | CLASSTYPE_NON_LAYOUT_POD_P (t) | |
c8094d83 | 5536 | |= (CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 5537 | || saved_nontrivial_dtor || saved_complex_asn_ref); |
c32097d8 | 5538 | CLASSTYPE_NON_STD_LAYOUT (t) |= TYPE_CONTAINS_VPTR_P (t); |
066ec0a4 | 5539 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 5540 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
f782c65c | 5541 | TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_CONTAINS_VPTR_P (t); |
607cf131 | 5542 | |
0fcedd9c JM |
5543 | /* If the class has no user-declared constructor, but does have |
5544 | non-static const or reference data members that can never be | |
5545 | initialized, issue a warning. */ | |
c73d5dd9 | 5546 | if (warn_uninitialized |
0fcedd9c JM |
5547 | /* Classes with user-declared constructors are presumed to |
5548 | initialize these members. */ | |
5549 | && !TYPE_HAS_USER_CONSTRUCTOR (t) | |
5550 | /* Aggregates can be initialized with brace-enclosed | |
5551 | initializers. */ | |
5552 | && CLASSTYPE_NON_AGGREGATE (t)) | |
5553 | { | |
5554 | tree field; | |
5555 | ||
910ad8de | 5556 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
0fcedd9c JM |
5557 | { |
5558 | tree type; | |
5559 | ||
f315d618 JJ |
5560 | if (TREE_CODE (field) != FIELD_DECL |
5561 | || DECL_INITIAL (field) != NULL_TREE) | |
0fcedd9c JM |
5562 | continue; |
5563 | ||
5564 | type = TREE_TYPE (field); | |
5565 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
c73d5dd9 MLI |
5566 | warning (OPT_Wuninitialized, "non-static reference %q+#D " |
5567 | "in class without a constructor", field); | |
0fcedd9c JM |
5568 | else if (CP_TYPE_CONST_P (type) |
5569 | && (!CLASS_TYPE_P (type) | |
5570 | || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type))) | |
c73d5dd9 MLI |
5571 | warning (OPT_Wuninitialized, "non-static const member %q+#D " |
5572 | "in class without a constructor", field); | |
0fcedd9c JM |
5573 | } |
5574 | } | |
5575 | ||
03fd3f84 | 5576 | /* Synthesize any needed methods. */ |
85b5d65a | 5577 | add_implicitly_declared_members (t, &access_decls, |
607cf131 | 5578 | cant_have_const_ctor, |
10746f37 | 5579 | no_const_asn_ref); |
607cf131 | 5580 | |
20f2653e JM |
5581 | /* Check defaulted declarations here so we have cant_have_const_ctor |
5582 | and don't need to worry about clones. */ | |
910ad8de | 5583 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
85b5d65a | 5584 | if (!DECL_ARTIFICIAL (fn) && DECL_DEFAULTED_IN_CLASS_P (fn)) |
20f2653e JM |
5585 | { |
5586 | int copy = copy_fn_p (fn); | |
5587 | if (copy > 0) | |
5588 | { | |
5589 | bool imp_const_p | |
5590 | = (DECL_CONSTRUCTOR_P (fn) ? !cant_have_const_ctor | |
5591 | : !no_const_asn_ref); | |
5592 | bool fn_const_p = (copy == 2); | |
5593 | ||
5594 | if (fn_const_p && !imp_const_p) | |
5595 | /* If the function is defaulted outside the class, we just | |
5596 | give the synthesis error. */ | |
5597 | error ("%q+D declared to take const reference, but implicit " | |
5598 | "declaration would take non-const", fn); | |
20f2653e JM |
5599 | } |
5600 | defaulted_late_check (fn); | |
5601 | } | |
5602 | ||
d5f4eddd JM |
5603 | if (LAMBDA_TYPE_P (t)) |
5604 | { | |
5605 | /* "The closure type associated with a lambda-expression has a deleted | |
5606 | default constructor and a deleted copy assignment operator." */ | |
5607 | TYPE_NEEDS_CONSTRUCTING (t) = 1; | |
54ca9930 JM |
5608 | TYPE_HAS_COMPLEX_DFLT (t) = 1; |
5609 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; | |
5610 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 0; | |
d5f4eddd JM |
5611 | |
5612 | /* "This class type is not an aggregate." */ | |
5613 | CLASSTYPE_NON_AGGREGATE (t) = 1; | |
5614 | } | |
5615 | ||
3b49d762 GDR |
5616 | /* Compute the 'literal type' property before we |
5617 | do anything with non-static member functions. */ | |
5618 | finalize_literal_type_property (t); | |
5619 | ||
db9b2174 MM |
5620 | /* Create the in-charge and not-in-charge variants of constructors |
5621 | and destructors. */ | |
5622 | clone_constructors_and_destructors (t); | |
5623 | ||
aa52c1ff JM |
5624 | /* Process the using-declarations. */ |
5625 | for (; access_decls; access_decls = TREE_CHAIN (access_decls)) | |
5626 | handle_using_decl (TREE_VALUE (access_decls), t); | |
5627 | ||
607cf131 MM |
5628 | /* Build and sort the CLASSTYPE_METHOD_VEC. */ |
5629 | finish_struct_methods (t); | |
dbc957f1 MM |
5630 | |
5631 | /* Figure out whether or not we will need a cookie when dynamically | |
5632 | allocating an array of this type. */ | |
e2500fed | 5633 | TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie |
dbc957f1 | 5634 | = type_requires_array_cookie (t); |
607cf131 MM |
5635 | } |
5636 | ||
3ef397c1 | 5637 | /* If T needs a pointer to its virtual function table, set TYPE_VFIELD |
5c24fba6 MM |
5638 | accordingly. If a new vfield was created (because T doesn't have a |
5639 | primary base class), then the newly created field is returned. It | |
c35cce41 | 5640 | is not added to the TYPE_FIELDS list; it is the caller's |
e6858a84 NS |
5641 | responsibility to do that. Accumulate declared virtual functions |
5642 | on VIRTUALS_P. */ | |
3ef397c1 | 5643 | |
5c24fba6 | 5644 | static tree |
94edc4ab | 5645 | create_vtable_ptr (tree t, tree* virtuals_p) |
3ef397c1 MM |
5646 | { |
5647 | tree fn; | |
5648 | ||
e6858a84 | 5649 | /* Collect the virtual functions declared in T. */ |
910ad8de | 5650 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
e6858a84 NS |
5651 | if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn) |
5652 | && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST) | |
5653 | { | |
5654 | tree new_virtual = make_node (TREE_LIST); | |
c8094d83 | 5655 | |
e6858a84 NS |
5656 | BV_FN (new_virtual) = fn; |
5657 | BV_DELTA (new_virtual) = integer_zero_node; | |
d1f05f93 | 5658 | BV_VCALL_INDEX (new_virtual) = NULL_TREE; |
3ef397c1 | 5659 | |
e6858a84 NS |
5660 | TREE_CHAIN (new_virtual) = *virtuals_p; |
5661 | *virtuals_p = new_virtual; | |
5662 | } | |
c8094d83 | 5663 | |
da3d4dfa MM |
5664 | /* If we couldn't find an appropriate base class, create a new field |
5665 | here. Even if there weren't any new virtual functions, we might need a | |
bbd15aac MM |
5666 | new virtual function table if we're supposed to include vptrs in |
5667 | all classes that need them. */ | |
e6858a84 | 5668 | if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t))) |
3ef397c1 MM |
5669 | { |
5670 | /* We build this decl with vtbl_ptr_type_node, which is a | |
5671 | `vtable_entry_type*'. It might seem more precise to use | |
a692ad2e | 5672 | `vtable_entry_type (*)[N]' where N is the number of virtual |
3ef397c1 MM |
5673 | functions. However, that would require the vtable pointer in |
5674 | base classes to have a different type than the vtable pointer | |
5675 | in derived classes. We could make that happen, but that | |
5676 | still wouldn't solve all the problems. In particular, the | |
5677 | type-based alias analysis code would decide that assignments | |
5678 | to the base class vtable pointer can't alias assignments to | |
5679 | the derived class vtable pointer, since they have different | |
4639c5c6 | 5680 | types. Thus, in a derived class destructor, where the base |
3ef397c1 | 5681 | class constructor was inlined, we could generate bad code for |
c8094d83 | 5682 | setting up the vtable pointer. |
3ef397c1 | 5683 | |
0cbd7506 | 5684 | Therefore, we use one type for all vtable pointers. We still |
3ef397c1 MM |
5685 | use a type-correct type; it's just doesn't indicate the array |
5686 | bounds. That's better than using `void*' or some such; it's | |
5687 | cleaner, and it let's the alias analysis code know that these | |
5688 | stores cannot alias stores to void*! */ | |
0abe00c5 NS |
5689 | tree field; |
5690 | ||
c2255bc4 AH |
5691 | field = build_decl (input_location, |
5692 | FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node); | |
0abe00c5 NS |
5693 | DECL_VIRTUAL_P (field) = 1; |
5694 | DECL_ARTIFICIAL (field) = 1; | |
5695 | DECL_FIELD_CONTEXT (field) = t; | |
5696 | DECL_FCONTEXT (field) = t; | |
7c08df6c JM |
5697 | if (TYPE_PACKED (t)) |
5698 | DECL_PACKED (field) = 1; | |
c8094d83 | 5699 | |
0abe00c5 | 5700 | TYPE_VFIELD (t) = field; |
c8094d83 | 5701 | |
0abe00c5 | 5702 | /* This class is non-empty. */ |
58731fd1 | 5703 | CLASSTYPE_EMPTY_P (t) = 0; |
3ef397c1 | 5704 | |
0abe00c5 | 5705 | return field; |
3ef397c1 | 5706 | } |
5c24fba6 MM |
5707 | |
5708 | return NULL_TREE; | |
3ef397c1 MM |
5709 | } |
5710 | ||
9d4c0187 MM |
5711 | /* Add OFFSET to all base types of BINFO which is a base in the |
5712 | hierarchy dominated by T. | |
80fd5f48 | 5713 | |
911a71a7 | 5714 | OFFSET, which is a type offset, is number of bytes. */ |
80fd5f48 MM |
5715 | |
5716 | static void | |
dbbf88d1 | 5717 | propagate_binfo_offsets (tree binfo, tree offset) |
80fd5f48 | 5718 | { |
911a71a7 MM |
5719 | int i; |
5720 | tree primary_binfo; | |
fa743e8c | 5721 | tree base_binfo; |
80fd5f48 | 5722 | |
911a71a7 MM |
5723 | /* Update BINFO's offset. */ |
5724 | BINFO_OFFSET (binfo) | |
c8094d83 | 5725 | = convert (sizetype, |
911a71a7 MM |
5726 | size_binop (PLUS_EXPR, |
5727 | convert (ssizetype, BINFO_OFFSET (binfo)), | |
5728 | offset)); | |
80fd5f48 | 5729 | |
911a71a7 MM |
5730 | /* Find the primary base class. */ |
5731 | primary_binfo = get_primary_binfo (binfo); | |
5732 | ||
fc6633e0 | 5733 | if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo) |
090ad434 | 5734 | propagate_binfo_offsets (primary_binfo, offset); |
c8094d83 | 5735 | |
911a71a7 MM |
5736 | /* Scan all of the bases, pushing the BINFO_OFFSET adjust |
5737 | downwards. */ | |
fa743e8c | 5738 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
80fd5f48 | 5739 | { |
090ad434 NS |
5740 | /* Don't do the primary base twice. */ |
5741 | if (base_binfo == primary_binfo) | |
5742 | continue; | |
911a71a7 | 5743 | |
090ad434 | 5744 | if (BINFO_VIRTUAL_P (base_binfo)) |
911a71a7 MM |
5745 | continue; |
5746 | ||
dbbf88d1 | 5747 | propagate_binfo_offsets (base_binfo, offset); |
911a71a7 | 5748 | } |
9d4c0187 MM |
5749 | } |
5750 | ||
17bbb839 | 5751 | /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update |
c20118a8 MM |
5752 | TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of |
5753 | empty subobjects of T. */ | |
80fd5f48 | 5754 | |
d2c5305b | 5755 | static void |
17bbb839 | 5756 | layout_virtual_bases (record_layout_info rli, splay_tree offsets) |
80fd5f48 | 5757 | { |
dbbf88d1 | 5758 | tree vbase; |
17bbb839 | 5759 | tree t = rli->t; |
eca7f13c | 5760 | bool first_vbase = true; |
17bbb839 | 5761 | tree *next_field; |
9785e4b1 | 5762 | |
604a3205 | 5763 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0) |
9785e4b1 MM |
5764 | return; |
5765 | ||
17bbb839 MM |
5766 | if (!abi_version_at_least(2)) |
5767 | { | |
5768 | /* In G++ 3.2, we incorrectly rounded the size before laying out | |
5769 | the virtual bases. */ | |
5770 | finish_record_layout (rli, /*free_p=*/false); | |
9785e4b1 | 5771 | #ifdef STRUCTURE_SIZE_BOUNDARY |
17bbb839 MM |
5772 | /* Packed structures don't need to have minimum size. */ |
5773 | if (! TYPE_PACKED (t)) | |
fc555370 | 5774 | TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY); |
9785e4b1 | 5775 | #endif |
17bbb839 MM |
5776 | rli->offset = TYPE_SIZE_UNIT (t); |
5777 | rli->bitpos = bitsize_zero_node; | |
5778 | rli->record_align = TYPE_ALIGN (t); | |
5779 | } | |
80fd5f48 | 5780 | |
17bbb839 MM |
5781 | /* Find the last field. The artificial fields created for virtual |
5782 | bases will go after the last extant field to date. */ | |
5783 | next_field = &TYPE_FIELDS (t); | |
5784 | while (*next_field) | |
910ad8de | 5785 | next_field = &DECL_CHAIN (*next_field); |
80fd5f48 | 5786 | |
9d4c0187 | 5787 | /* Go through the virtual bases, allocating space for each virtual |
3461fba7 NS |
5788 | base that is not already a primary base class. These are |
5789 | allocated in inheritance graph order. */ | |
dbbf88d1 | 5790 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) |
c35cce41 | 5791 | { |
809e3e7f | 5792 | if (!BINFO_VIRTUAL_P (vbase)) |
1f84ec23 | 5793 | continue; |
eca7f13c | 5794 | |
9965d119 | 5795 | if (!BINFO_PRIMARY_P (vbase)) |
c35cce41 | 5796 | { |
17bbb839 MM |
5797 | tree basetype = TREE_TYPE (vbase); |
5798 | ||
c35cce41 MM |
5799 | /* This virtual base is not a primary base of any class in the |
5800 | hierarchy, so we have to add space for it. */ | |
58731fd1 | 5801 | next_field = build_base_field (rli, vbase, |
17bbb839 | 5802 | offsets, next_field); |
9785e4b1 | 5803 | |
eca7f13c MM |
5804 | /* If the first virtual base might have been placed at a |
5805 | lower address, had we started from CLASSTYPE_SIZE, rather | |
5806 | than TYPE_SIZE, issue a warning. There can be both false | |
5807 | positives and false negatives from this warning in rare | |
5808 | cases; to deal with all the possibilities would probably | |
5809 | require performing both layout algorithms and comparing | |
5810 | the results which is not particularly tractable. */ | |
5811 | if (warn_abi | |
5812 | && first_vbase | |
c8094d83 | 5813 | && (tree_int_cst_lt |
17bbb839 | 5814 | (size_binop (CEIL_DIV_EXPR, |
db3927fb AH |
5815 | round_up_loc (input_location, |
5816 | CLASSTYPE_SIZE (t), | |
17bbb839 MM |
5817 | CLASSTYPE_ALIGN (basetype)), |
5818 | bitsize_unit_node), | |
5819 | BINFO_OFFSET (vbase)))) | |
74fa0285 | 5820 | warning (OPT_Wabi, |
3db45ab5 | 5821 | "offset of virtual base %qT is not ABI-compliant and " |
0cbd7506 | 5822 | "may change in a future version of GCC", |
eca7f13c MM |
5823 | basetype); |
5824 | ||
eca7f13c | 5825 | first_vbase = false; |
c35cce41 MM |
5826 | } |
5827 | } | |
80fd5f48 MM |
5828 | } |
5829 | ||
ba9a991f MM |
5830 | /* Returns the offset of the byte just past the end of the base class |
5831 | BINFO. */ | |
5832 | ||
5833 | static tree | |
5834 | end_of_base (tree binfo) | |
5835 | { | |
5836 | tree size; | |
5837 | ||
1ad8aeeb DG |
5838 | if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo))) |
5839 | size = TYPE_SIZE_UNIT (char_type_node); | |
5840 | else if (is_empty_class (BINFO_TYPE (binfo))) | |
ba9a991f MM |
5841 | /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to |
5842 | allocate some space for it. It cannot have virtual bases, so | |
5843 | TYPE_SIZE_UNIT is fine. */ | |
5844 | size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5845 | else | |
5846 | size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5847 | ||
5848 | return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size); | |
5849 | } | |
5850 | ||
9785e4b1 MM |
5851 | /* Returns the offset of the byte just past the end of the base class |
5852 | with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then | |
5853 | only non-virtual bases are included. */ | |
80fd5f48 | 5854 | |
17bbb839 | 5855 | static tree |
94edc4ab | 5856 | end_of_class (tree t, int include_virtuals_p) |
80fd5f48 | 5857 | { |
17bbb839 | 5858 | tree result = size_zero_node; |
9771b263 | 5859 | vec<tree, va_gc> *vbases; |
ba9a991f | 5860 | tree binfo; |
9ba5ff0f | 5861 | tree base_binfo; |
ba9a991f | 5862 | tree offset; |
9785e4b1 | 5863 | int i; |
80fd5f48 | 5864 | |
fa743e8c NS |
5865 | for (binfo = TYPE_BINFO (t), i = 0; |
5866 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
9785e4b1 | 5867 | { |
9785e4b1 | 5868 | if (!include_virtuals_p |
fc6633e0 NS |
5869 | && BINFO_VIRTUAL_P (base_binfo) |
5870 | && (!BINFO_PRIMARY_P (base_binfo) | |
5871 | || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t))) | |
9785e4b1 | 5872 | continue; |
80fd5f48 | 5873 | |
fa743e8c | 5874 | offset = end_of_base (base_binfo); |
17bbb839 MM |
5875 | if (INT_CST_LT_UNSIGNED (result, offset)) |
5876 | result = offset; | |
9785e4b1 | 5877 | } |
80fd5f48 | 5878 | |
ba9a991f MM |
5879 | /* G++ 3.2 did not check indirect virtual bases. */ |
5880 | if (abi_version_at_least (2) && include_virtuals_p) | |
9ba5ff0f | 5881 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 5882 | vec_safe_iterate (vbases, i, &base_binfo); i++) |
ba9a991f | 5883 | { |
9ba5ff0f | 5884 | offset = end_of_base (base_binfo); |
ba9a991f MM |
5885 | if (INT_CST_LT_UNSIGNED (result, offset)) |
5886 | result = offset; | |
5887 | } | |
5888 | ||
9785e4b1 | 5889 | return result; |
80fd5f48 MM |
5890 | } |
5891 | ||
17bbb839 | 5892 | /* Warn about bases of T that are inaccessible because they are |
78b45a24 MM |
5893 | ambiguous. For example: |
5894 | ||
5895 | struct S {}; | |
5896 | struct T : public S {}; | |
5897 | struct U : public S, public T {}; | |
5898 | ||
5899 | Here, `(S*) new U' is not allowed because there are two `S' | |
5900 | subobjects of U. */ | |
5901 | ||
5902 | static void | |
94edc4ab | 5903 | warn_about_ambiguous_bases (tree t) |
78b45a24 MM |
5904 | { |
5905 | int i; | |
9771b263 | 5906 | vec<tree, va_gc> *vbases; |
17bbb839 | 5907 | tree basetype; |
58c42dc2 | 5908 | tree binfo; |
fa743e8c | 5909 | tree base_binfo; |
78b45a24 | 5910 | |
18e4be85 NS |
5911 | /* If there are no repeated bases, nothing can be ambiguous. */ |
5912 | if (!CLASSTYPE_REPEATED_BASE_P (t)) | |
5913 | return; | |
c8094d83 | 5914 | |
17bbb839 | 5915 | /* Check direct bases. */ |
fa743e8c NS |
5916 | for (binfo = TYPE_BINFO (t), i = 0; |
5917 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
78b45a24 | 5918 | { |
fa743e8c | 5919 | basetype = BINFO_TYPE (base_binfo); |
78b45a24 | 5920 | |
22854930 | 5921 | if (!uniquely_derived_from_p (basetype, t)) |
d4ee4d25 | 5922 | warning (0, "direct base %qT inaccessible in %qT due to ambiguity", |
17bbb839 | 5923 | basetype, t); |
78b45a24 | 5924 | } |
17bbb839 MM |
5925 | |
5926 | /* Check for ambiguous virtual bases. */ | |
5927 | if (extra_warnings) | |
9ba5ff0f | 5928 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 5929 | vec_safe_iterate (vbases, i, &binfo); i++) |
17bbb839 | 5930 | { |
58c42dc2 | 5931 | basetype = BINFO_TYPE (binfo); |
c8094d83 | 5932 | |
22854930 PC |
5933 | if (!uniquely_derived_from_p (basetype, t)) |
5934 | warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due " | |
5935 | "to ambiguity", basetype, t); | |
17bbb839 | 5936 | } |
78b45a24 MM |
5937 | } |
5938 | ||
c20118a8 MM |
5939 | /* Compare two INTEGER_CSTs K1 and K2. */ |
5940 | ||
5941 | static int | |
94edc4ab | 5942 | splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2) |
c20118a8 MM |
5943 | { |
5944 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
5945 | } | |
5946 | ||
17bbb839 MM |
5947 | /* Increase the size indicated in RLI to account for empty classes |
5948 | that are "off the end" of the class. */ | |
5949 | ||
5950 | static void | |
5951 | include_empty_classes (record_layout_info rli) | |
5952 | { | |
5953 | tree eoc; | |
e3ccdd50 | 5954 | tree rli_size; |
17bbb839 MM |
5955 | |
5956 | /* It might be the case that we grew the class to allocate a | |
5957 | zero-sized base class. That won't be reflected in RLI, yet, | |
5958 | because we are willing to overlay multiple bases at the same | |
5959 | offset. However, now we need to make sure that RLI is big enough | |
5960 | to reflect the entire class. */ | |
c8094d83 | 5961 | eoc = end_of_class (rli->t, |
17bbb839 | 5962 | CLASSTYPE_AS_BASE (rli->t) != NULL_TREE); |
e3ccdd50 MM |
5963 | rli_size = rli_size_unit_so_far (rli); |
5964 | if (TREE_CODE (rli_size) == INTEGER_CST | |
5965 | && INT_CST_LT_UNSIGNED (rli_size, eoc)) | |
17bbb839 | 5966 | { |
43fe31f6 MM |
5967 | if (!abi_version_at_least (2)) |
5968 | /* In version 1 of the ABI, the size of a class that ends with | |
5969 | a bitfield was not rounded up to a whole multiple of a | |
5970 | byte. Because rli_size_unit_so_far returns only the number | |
5971 | of fully allocated bytes, any extra bits were not included | |
5972 | in the size. */ | |
5973 | rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT); | |
5974 | else | |
5975 | /* The size should have been rounded to a whole byte. */ | |
50bc768d NS |
5976 | gcc_assert (tree_int_cst_equal |
5977 | (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT))); | |
c8094d83 MS |
5978 | rli->bitpos |
5979 | = size_binop (PLUS_EXPR, | |
e3ccdd50 MM |
5980 | rli->bitpos, |
5981 | size_binop (MULT_EXPR, | |
5982 | convert (bitsizetype, | |
5983 | size_binop (MINUS_EXPR, | |
5984 | eoc, rli_size)), | |
5985 | bitsize_int (BITS_PER_UNIT))); | |
5986 | normalize_rli (rli); | |
17bbb839 MM |
5987 | } |
5988 | } | |
5989 | ||
2ef16140 MM |
5990 | /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate |
5991 | BINFO_OFFSETs for all of the base-classes. Position the vtable | |
00a17e31 | 5992 | pointer. Accumulate declared virtual functions on VIRTUALS_P. */ |
607cf131 | 5993 | |
2ef16140 | 5994 | static void |
e93ee644 | 5995 | layout_class_type (tree t, tree *virtuals_p) |
2ef16140 | 5996 | { |
5c24fba6 MM |
5997 | tree non_static_data_members; |
5998 | tree field; | |
5999 | tree vptr; | |
6000 | record_layout_info rli; | |
c20118a8 MM |
6001 | /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of |
6002 | types that appear at that offset. */ | |
6003 | splay_tree empty_base_offsets; | |
c65cb8d1 | 6004 | /* True if the last field laid out was a bit-field. */ |
eca7f13c | 6005 | bool last_field_was_bitfield = false; |
17bbb839 MM |
6006 | /* The location at which the next field should be inserted. */ |
6007 | tree *next_field; | |
6008 | /* T, as a base class. */ | |
6009 | tree base_t; | |
5c24fba6 MM |
6010 | |
6011 | /* Keep track of the first non-static data member. */ | |
6012 | non_static_data_members = TYPE_FIELDS (t); | |
6013 | ||
770ae6cc RK |
6014 | /* Start laying out the record. */ |
6015 | rli = start_record_layout (t); | |
534170eb | 6016 | |
fc6633e0 NS |
6017 | /* Mark all the primary bases in the hierarchy. */ |
6018 | determine_primary_bases (t); | |
8026246f | 6019 | |
5c24fba6 | 6020 | /* Create a pointer to our virtual function table. */ |
58731fd1 | 6021 | vptr = create_vtable_ptr (t, virtuals_p); |
5c24fba6 | 6022 | |
3461fba7 | 6023 | /* The vptr is always the first thing in the class. */ |
1f84ec23 | 6024 | if (vptr) |
5c24fba6 | 6025 | { |
910ad8de | 6026 | DECL_CHAIN (vptr) = TYPE_FIELDS (t); |
17bbb839 | 6027 | TYPE_FIELDS (t) = vptr; |
910ad8de | 6028 | next_field = &DECL_CHAIN (vptr); |
770ae6cc | 6029 | place_field (rli, vptr); |
5c24fba6 | 6030 | } |
17bbb839 MM |
6031 | else |
6032 | next_field = &TYPE_FIELDS (t); | |
5c24fba6 | 6033 | |
72a50ab0 | 6034 | /* Build FIELD_DECLs for all of the non-virtual base-types. */ |
c8094d83 | 6035 | empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts, |
c20118a8 | 6036 | NULL, NULL); |
58731fd1 | 6037 | build_base_fields (rli, empty_base_offsets, next_field); |
c8094d83 | 6038 | |
5c24fba6 | 6039 | /* Layout the non-static data members. */ |
910ad8de | 6040 | for (field = non_static_data_members; field; field = DECL_CHAIN (field)) |
5c24fba6 | 6041 | { |
01955e96 MM |
6042 | tree type; |
6043 | tree padding; | |
5c24fba6 MM |
6044 | |
6045 | /* We still pass things that aren't non-static data members to | |
3b426391 | 6046 | the back end, in case it wants to do something with them. */ |
5c24fba6 MM |
6047 | if (TREE_CODE (field) != FIELD_DECL) |
6048 | { | |
770ae6cc | 6049 | place_field (rli, field); |
0154eaa8 | 6050 | /* If the static data member has incomplete type, keep track |
c8094d83 | 6051 | of it so that it can be completed later. (The handling |
0154eaa8 MM |
6052 | of pending statics in finish_record_layout is |
6053 | insufficient; consider: | |
6054 | ||
6055 | struct S1; | |
6056 | struct S2 { static S1 s1; }; | |
c8094d83 | 6057 | |
0cbd7506 | 6058 | At this point, finish_record_layout will be called, but |
0154eaa8 | 6059 | S1 is still incomplete.) */ |
5a6ccc94 | 6060 | if (VAR_P (field)) |
532b37d9 MM |
6061 | { |
6062 | maybe_register_incomplete_var (field); | |
6063 | /* The visibility of static data members is determined | |
6064 | at their point of declaration, not their point of | |
6065 | definition. */ | |
6066 | determine_visibility (field); | |
6067 | } | |
5c24fba6 MM |
6068 | continue; |
6069 | } | |
6070 | ||
01955e96 | 6071 | type = TREE_TYPE (field); |
4e3bd7d5 VR |
6072 | if (type == error_mark_node) |
6073 | continue; | |
c8094d83 | 6074 | |
1e099144 | 6075 | padding = NULL_TREE; |
01955e96 MM |
6076 | |
6077 | /* If this field is a bit-field whose width is greater than its | |
3461fba7 NS |
6078 | type, then there are some special rules for allocating |
6079 | it. */ | |
01955e96 | 6080 | if (DECL_C_BIT_FIELD (field) |
1f84ec23 | 6081 | && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field))) |
01955e96 | 6082 | { |
09639a83 | 6083 | unsigned int itk; |
01955e96 | 6084 | tree integer_type; |
555456b1 | 6085 | bool was_unnamed_p = false; |
01955e96 MM |
6086 | /* We must allocate the bits as if suitably aligned for the |
6087 | longest integer type that fits in this many bits. type | |
6088 | of the field. Then, we are supposed to use the left over | |
6089 | bits as additional padding. */ | |
6090 | for (itk = itk_char; itk != itk_none; ++itk) | |
64c31785 | 6091 | if (integer_types[itk] != NULL_TREE |
1c314335 L |
6092 | && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE), |
6093 | TYPE_SIZE (integer_types[itk])) | |
6094 | || INT_CST_LT (DECL_SIZE (field), | |
6095 | TYPE_SIZE (integer_types[itk])))) | |
01955e96 MM |
6096 | break; |
6097 | ||
6098 | /* ITK now indicates a type that is too large for the | |
6099 | field. We have to back up by one to find the largest | |
6100 | type that fits. */ | |
64c31785 KT |
6101 | do |
6102 | { | |
6103 | --itk; | |
6104 | integer_type = integer_types[itk]; | |
6105 | } while (itk > 0 && integer_type == NULL_TREE); | |
2d3e278d | 6106 | |
1e099144 MM |
6107 | /* Figure out how much additional padding is required. GCC |
6108 | 3.2 always created a padding field, even if it had zero | |
6109 | width. */ | |
6110 | if (!abi_version_at_least (2) | |
6111 | || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field))) | |
2d3e278d | 6112 | { |
1e099144 MM |
6113 | if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE) |
6114 | /* In a union, the padding field must have the full width | |
6115 | of the bit-field; all fields start at offset zero. */ | |
6116 | padding = DECL_SIZE (field); | |
6117 | else | |
6118 | { | |
74fa0285 GDR |
6119 | if (TREE_CODE (t) == UNION_TYPE) |
6120 | warning (OPT_Wabi, "size assigned to %qT may not be " | |
1e099144 | 6121 | "ABI-compliant and may change in a future " |
c8094d83 | 6122 | "version of GCC", |
1e099144 MM |
6123 | t); |
6124 | padding = size_binop (MINUS_EXPR, DECL_SIZE (field), | |
6125 | TYPE_SIZE (integer_type)); | |
6126 | } | |
2d3e278d | 6127 | } |
c9372112 | 6128 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
63e5f567 MM |
6129 | /* An unnamed bitfield does not normally affect the |
6130 | alignment of the containing class on a target where | |
6131 | PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not | |
6132 | make any exceptions for unnamed bitfields when the | |
6133 | bitfields are longer than their types. Therefore, we | |
6134 | temporarily give the field a name. */ | |
6135 | if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field)) | |
6136 | { | |
6137 | was_unnamed_p = true; | |
6138 | DECL_NAME (field) = make_anon_name (); | |
6139 | } | |
c9372112 | 6140 | #endif |
01955e96 MM |
6141 | DECL_SIZE (field) = TYPE_SIZE (integer_type); |
6142 | DECL_ALIGN (field) = TYPE_ALIGN (integer_type); | |
11cf4d18 | 6143 | DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type); |
555456b1 MM |
6144 | layout_nonempty_base_or_field (rli, field, NULL_TREE, |
6145 | empty_base_offsets); | |
6146 | if (was_unnamed_p) | |
6147 | DECL_NAME (field) = NULL_TREE; | |
6148 | /* Now that layout has been performed, set the size of the | |
6149 | field to the size of its declared type; the rest of the | |
6150 | field is effectively invisible. */ | |
6151 | DECL_SIZE (field) = TYPE_SIZE (type); | |
29edb15c MM |
6152 | /* We must also reset the DECL_MODE of the field. */ |
6153 | if (abi_version_at_least (2)) | |
6154 | DECL_MODE (field) = TYPE_MODE (type); | |
6155 | else if (warn_abi | |
6156 | && DECL_MODE (field) != TYPE_MODE (type)) | |
6157 | /* Versions of G++ before G++ 3.4 did not reset the | |
6158 | DECL_MODE. */ | |
74fa0285 | 6159 | warning (OPT_Wabi, |
3db45ab5 | 6160 | "the offset of %qD may not be ABI-compliant and may " |
29edb15c | 6161 | "change in a future version of GCC", field); |
01955e96 | 6162 | } |
555456b1 MM |
6163 | else |
6164 | layout_nonempty_base_or_field (rli, field, NULL_TREE, | |
6165 | empty_base_offsets); | |
01955e96 | 6166 | |
2003cd37 MM |
6167 | /* Remember the location of any empty classes in FIELD. */ |
6168 | if (abi_version_at_least (2)) | |
c8094d83 | 6169 | record_subobject_offsets (TREE_TYPE (field), |
2003cd37 MM |
6170 | byte_position(field), |
6171 | empty_base_offsets, | |
c5a35c3c | 6172 | /*is_data_member=*/true); |
2003cd37 | 6173 | |
eca7f13c MM |
6174 | /* If a bit-field does not immediately follow another bit-field, |
6175 | and yet it starts in the middle of a byte, we have failed to | |
6176 | comply with the ABI. */ | |
6177 | if (warn_abi | |
c8094d83 | 6178 | && DECL_C_BIT_FIELD (field) |
660845bf ZL |
6179 | /* The TREE_NO_WARNING flag gets set by Objective-C when |
6180 | laying out an Objective-C class. The ObjC ABI differs | |
6181 | from the C++ ABI, and so we do not want a warning | |
6182 | here. */ | |
6183 | && !TREE_NO_WARNING (field) | |
eca7f13c MM |
6184 | && !last_field_was_bitfield |
6185 | && !integer_zerop (size_binop (TRUNC_MOD_EXPR, | |
6186 | DECL_FIELD_BIT_OFFSET (field), | |
6187 | bitsize_unit_node))) | |
74fa0285 | 6188 | warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may " |
dee15844 | 6189 | "change in a future version of GCC", field); |
eca7f13c | 6190 | |
956d9305 MM |
6191 | /* G++ used to use DECL_FIELD_OFFSET as if it were the byte |
6192 | offset of the field. */ | |
c8094d83 | 6193 | if (warn_abi |
254d1a5a | 6194 | && !abi_version_at_least (2) |
956d9305 MM |
6195 | && !tree_int_cst_equal (DECL_FIELD_OFFSET (field), |
6196 | byte_position (field)) | |
6197 | && contains_empty_class_p (TREE_TYPE (field))) | |
74fa0285 | 6198 | warning (OPT_Wabi, "%q+D contains empty classes which may cause base " |
dee15844 JM |
6199 | "classes to be placed at different locations in a " |
6200 | "future version of GCC", field); | |
956d9305 | 6201 | |
38a4afee MM |
6202 | /* The middle end uses the type of expressions to determine the |
6203 | possible range of expression values. In order to optimize | |
6204 | "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end | |
3db45ab5 | 6205 | must be made aware of the width of "i", via its type. |
38a4afee | 6206 | |
3db45ab5 | 6207 | Because C++ does not have integer types of arbitrary width, |
38a4afee MM |
6208 | we must (for the purposes of the front end) convert from the |
6209 | type assigned here to the declared type of the bitfield | |
6210 | whenever a bitfield expression is used as an rvalue. | |
6211 | Similarly, when assigning a value to a bitfield, the value | |
6212 | must be converted to the type given the bitfield here. */ | |
6213 | if (DECL_C_BIT_FIELD (field)) | |
6214 | { | |
38a4afee | 6215 | unsigned HOST_WIDE_INT width; |
24030e4c | 6216 | tree ftype = TREE_TYPE (field); |
ae7e9ddd | 6217 | width = tree_to_uhwi (DECL_SIZE (field)); |
38a4afee | 6218 | if (width != TYPE_PRECISION (ftype)) |
24030e4c JJ |
6219 | { |
6220 | TREE_TYPE (field) | |
6221 | = c_build_bitfield_integer_type (width, | |
6222 | TYPE_UNSIGNED (ftype)); | |
6223 | TREE_TYPE (field) | |
6224 | = cp_build_qualified_type (TREE_TYPE (field), | |
a3360e77 | 6225 | cp_type_quals (ftype)); |
24030e4c | 6226 | } |
38a4afee MM |
6227 | } |
6228 | ||
01955e96 MM |
6229 | /* If we needed additional padding after this field, add it |
6230 | now. */ | |
6231 | if (padding) | |
6232 | { | |
6233 | tree padding_field; | |
6234 | ||
c2255bc4 AH |
6235 | padding_field = build_decl (input_location, |
6236 | FIELD_DECL, | |
01955e96 | 6237 | NULL_TREE, |
c8094d83 | 6238 | char_type_node); |
01955e96 MM |
6239 | DECL_BIT_FIELD (padding_field) = 1; |
6240 | DECL_SIZE (padding_field) = padding; | |
1e099144 | 6241 | DECL_CONTEXT (padding_field) = t; |
ea258926 | 6242 | DECL_ARTIFICIAL (padding_field) = 1; |
78e0d62b | 6243 | DECL_IGNORED_P (padding_field) = 1; |
c20118a8 | 6244 | layout_nonempty_base_or_field (rli, padding_field, |
c8094d83 | 6245 | NULL_TREE, |
17bbb839 | 6246 | empty_base_offsets); |
01955e96 | 6247 | } |
eca7f13c MM |
6248 | |
6249 | last_field_was_bitfield = DECL_C_BIT_FIELD (field); | |
5c24fba6 MM |
6250 | } |
6251 | ||
17bbb839 | 6252 | if (abi_version_at_least (2) && !integer_zerop (rli->bitpos)) |
e3ccdd50 MM |
6253 | { |
6254 | /* Make sure that we are on a byte boundary so that the size of | |
6255 | the class without virtual bases will always be a round number | |
6256 | of bytes. */ | |
db3927fb | 6257 | rli->bitpos = round_up_loc (input_location, rli->bitpos, BITS_PER_UNIT); |
e3ccdd50 MM |
6258 | normalize_rli (rli); |
6259 | } | |
17bbb839 | 6260 | |
8a874cb4 MM |
6261 | /* G++ 3.2 does not allow virtual bases to be overlaid with tail |
6262 | padding. */ | |
6263 | if (!abi_version_at_least (2)) | |
6264 | include_empty_classes(rli); | |
58010b57 | 6265 | |
3ef397c1 MM |
6266 | /* Delete all zero-width bit-fields from the list of fields. Now |
6267 | that the type is laid out they are no longer important. */ | |
6268 | remove_zero_width_bit_fields (t); | |
6269 | ||
17bbb839 | 6270 | /* Create the version of T used for virtual bases. We do not use |
9e1e64ec | 6271 | make_class_type for this version; this is an artificial type. For |
17bbb839 | 6272 | a POD type, we just reuse T. */ |
c32097d8 | 6273 | if (CLASSTYPE_NON_LAYOUT_POD_P (t) || CLASSTYPE_EMPTY_P (t)) |
06ceef4e | 6274 | { |
17bbb839 | 6275 | base_t = make_node (TREE_CODE (t)); |
c8094d83 | 6276 | |
58731fd1 MM |
6277 | /* Set the size and alignment for the new type. In G++ 3.2, all |
6278 | empty classes were considered to have size zero when used as | |
6279 | base classes. */ | |
6280 | if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t)) | |
6281 | { | |
6282 | TYPE_SIZE (base_t) = bitsize_zero_node; | |
6283 | TYPE_SIZE_UNIT (base_t) = size_zero_node; | |
6284 | if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli))) | |
74fa0285 | 6285 | warning (OPT_Wabi, |
3db45ab5 | 6286 | "layout of classes derived from empty class %qT " |
58731fd1 MM |
6287 | "may change in a future version of GCC", |
6288 | t); | |
6289 | } | |
6290 | else | |
6291 | { | |
6b99d1c0 MM |
6292 | tree eoc; |
6293 | ||
6294 | /* If the ABI version is not at least two, and the last | |
6295 | field was a bit-field, RLI may not be on a byte | |
6296 | boundary. In particular, rli_size_unit_so_far might | |
6297 | indicate the last complete byte, while rli_size_so_far | |
6298 | indicates the total number of bits used. Therefore, | |
6299 | rli_size_so_far, rather than rli_size_unit_so_far, is | |
6300 | used to compute TYPE_SIZE_UNIT. */ | |
6301 | eoc = end_of_class (t, /*include_virtuals_p=*/0); | |
c8094d83 | 6302 | TYPE_SIZE_UNIT (base_t) |
8a874cb4 | 6303 | = size_binop (MAX_EXPR, |
6b99d1c0 MM |
6304 | convert (sizetype, |
6305 | size_binop (CEIL_DIV_EXPR, | |
6306 | rli_size_so_far (rli), | |
6307 | bitsize_int (BITS_PER_UNIT))), | |
6308 | eoc); | |
c8094d83 | 6309 | TYPE_SIZE (base_t) |
8a874cb4 MM |
6310 | = size_binop (MAX_EXPR, |
6311 | rli_size_so_far (rli), | |
6312 | size_binop (MULT_EXPR, | |
6b99d1c0 | 6313 | convert (bitsizetype, eoc), |
8a874cb4 | 6314 | bitsize_int (BITS_PER_UNIT))); |
58731fd1 | 6315 | } |
17bbb839 MM |
6316 | TYPE_ALIGN (base_t) = rli->record_align; |
6317 | TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t); | |
6318 | ||
6319 | /* Copy the fields from T. */ | |
6320 | next_field = &TYPE_FIELDS (base_t); | |
910ad8de | 6321 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
17bbb839 MM |
6322 | if (TREE_CODE (field) == FIELD_DECL) |
6323 | { | |
c2255bc4 AH |
6324 | *next_field = build_decl (input_location, |
6325 | FIELD_DECL, | |
c8094d83 | 6326 | DECL_NAME (field), |
17bbb839 MM |
6327 | TREE_TYPE (field)); |
6328 | DECL_CONTEXT (*next_field) = base_t; | |
6329 | DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field); | |
6330 | DECL_FIELD_BIT_OFFSET (*next_field) | |
6331 | = DECL_FIELD_BIT_OFFSET (field); | |
4f0a2b81 MM |
6332 | DECL_SIZE (*next_field) = DECL_SIZE (field); |
6333 | DECL_MODE (*next_field) = DECL_MODE (field); | |
910ad8de | 6334 | next_field = &DECL_CHAIN (*next_field); |
17bbb839 MM |
6335 | } |
6336 | ||
6337 | /* Record the base version of the type. */ | |
6338 | CLASSTYPE_AS_BASE (t) = base_t; | |
5a5cccaa | 6339 | TYPE_CONTEXT (base_t) = t; |
83b14b88 | 6340 | } |
1f84ec23 | 6341 | else |
17bbb839 | 6342 | CLASSTYPE_AS_BASE (t) = t; |
0b41abe6 | 6343 | |
5ec1192e MM |
6344 | /* Every empty class contains an empty class. */ |
6345 | if (CLASSTYPE_EMPTY_P (t)) | |
6346 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
6347 | ||
8d08fdba MS |
6348 | /* Set the TYPE_DECL for this type to contain the right |
6349 | value for DECL_OFFSET, so that we can use it as part | |
6350 | of a COMPONENT_REF for multiple inheritance. */ | |
d2e5ee5c | 6351 | layout_decl (TYPE_MAIN_DECL (t), 0); |
8d08fdba | 6352 | |
7177d104 MS |
6353 | /* Now fix up any virtual base class types that we left lying |
6354 | around. We must get these done before we try to lay out the | |
5c24fba6 MM |
6355 | virtual function table. As a side-effect, this will remove the |
6356 | base subobject fields. */ | |
17bbb839 MM |
6357 | layout_virtual_bases (rli, empty_base_offsets); |
6358 | ||
c8094d83 | 6359 | /* Make sure that empty classes are reflected in RLI at this |
17bbb839 MM |
6360 | point. */ |
6361 | include_empty_classes(rli); | |
6362 | ||
6363 | /* Make sure not to create any structures with zero size. */ | |
58731fd1 | 6364 | if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t)) |
c8094d83 | 6365 | place_field (rli, |
c2255bc4 AH |
6366 | build_decl (input_location, |
6367 | FIELD_DECL, NULL_TREE, char_type_node)); | |
17bbb839 | 6368 | |
a402c1b1 JM |
6369 | /* If this is a non-POD, declaring it packed makes a difference to how it |
6370 | can be used as a field; don't let finalize_record_size undo it. */ | |
6371 | if (TYPE_PACKED (t) && !layout_pod_type_p (t)) | |
6372 | rli->packed_maybe_necessary = true; | |
6373 | ||
3b426391 | 6374 | /* Let the back end lay out the type. */ |
17bbb839 | 6375 | finish_record_layout (rli, /*free_p=*/true); |
9785e4b1 | 6376 | |
26d40c3d JM |
6377 | if (TYPE_SIZE_UNIT (t) |
6378 | && TREE_CODE (TYPE_SIZE_UNIT (t)) == INTEGER_CST | |
6379 | && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t)) | |
6380 | && !valid_constant_size_p (TYPE_SIZE_UNIT (t))) | |
6381 | error ("type %qT is too large", t); | |
6382 | ||
17bbb839 MM |
6383 | /* Warn about bases that can't be talked about due to ambiguity. */ |
6384 | warn_about_ambiguous_bases (t); | |
78b45a24 | 6385 | |
00bfffa4 | 6386 | /* Now that we're done with layout, give the base fields the real types. */ |
910ad8de | 6387 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
6388 | if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field))) |
6389 | TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field)); | |
6390 | ||
9785e4b1 | 6391 | /* Clean up. */ |
c20118a8 | 6392 | splay_tree_delete (empty_base_offsets); |
c5a35c3c MM |
6393 | |
6394 | if (CLASSTYPE_EMPTY_P (t) | |
3db45ab5 | 6395 | && tree_int_cst_lt (sizeof_biggest_empty_class, |
c0572427 MM |
6396 | TYPE_SIZE_UNIT (t))) |
6397 | sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t); | |
2ef16140 | 6398 | } |
c35cce41 | 6399 | |
af287697 MM |
6400 | /* Determine the "key method" for the class type indicated by TYPE, |
6401 | and set CLASSTYPE_KEY_METHOD accordingly. */ | |
9aad8f83 | 6402 | |
af287697 MM |
6403 | void |
6404 | determine_key_method (tree type) | |
9aad8f83 MA |
6405 | { |
6406 | tree method; | |
6407 | ||
6408 | if (TYPE_FOR_JAVA (type) | |
6409 | || processing_template_decl | |
6410 | || CLASSTYPE_TEMPLATE_INSTANTIATION (type) | |
6411 | || CLASSTYPE_INTERFACE_KNOWN (type)) | |
af287697 | 6412 | return; |
9aad8f83 | 6413 | |
af287697 MM |
6414 | /* The key method is the first non-pure virtual function that is not |
6415 | inline at the point of class definition. On some targets the | |
6416 | key function may not be inline; those targets should not call | |
6417 | this function until the end of the translation unit. */ | |
9aad8f83 | 6418 | for (method = TYPE_METHODS (type); method != NULL_TREE; |
910ad8de | 6419 | method = DECL_CHAIN (method)) |
9aad8f83 MA |
6420 | if (DECL_VINDEX (method) != NULL_TREE |
6421 | && ! DECL_DECLARED_INLINE_P (method) | |
6422 | && ! DECL_PURE_VIRTUAL_P (method)) | |
af287697 MM |
6423 | { |
6424 | CLASSTYPE_KEY_METHOD (type) = method; | |
6425 | break; | |
6426 | } | |
9aad8f83 | 6427 | |
af287697 | 6428 | return; |
9aad8f83 MA |
6429 | } |
6430 | ||
385b73ab DN |
6431 | |
6432 | /* Allocate and return an instance of struct sorted_fields_type with | |
6433 | N fields. */ | |
6434 | ||
6435 | static struct sorted_fields_type * | |
6436 | sorted_fields_type_new (int n) | |
6437 | { | |
6438 | struct sorted_fields_type *sft; | |
6439 | sft = ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type) | |
6440 | + n * sizeof (tree)); | |
6441 | sft->len = n; | |
6442 | ||
6443 | return sft; | |
6444 | } | |
6445 | ||
6446 | ||
548502d3 MM |
6447 | /* Perform processing required when the definition of T (a class type) |
6448 | is complete. */ | |
2ef16140 MM |
6449 | |
6450 | void | |
94edc4ab | 6451 | finish_struct_1 (tree t) |
2ef16140 MM |
6452 | { |
6453 | tree x; | |
00a17e31 | 6454 | /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */ |
e6858a84 | 6455 | tree virtuals = NULL_TREE; |
2ef16140 | 6456 | |
d0f062fb | 6457 | if (COMPLETE_TYPE_P (t)) |
2ef16140 | 6458 | { |
9e1e64ec | 6459 | gcc_assert (MAYBE_CLASS_TYPE_P (t)); |
1f070f2b | 6460 | error ("redefinition of %q#T", t); |
2ef16140 MM |
6461 | popclass (); |
6462 | return; | |
6463 | } | |
6464 | ||
2ef16140 MM |
6465 | /* If this type was previously laid out as a forward reference, |
6466 | make sure we lay it out again. */ | |
2ef16140 | 6467 | TYPE_SIZE (t) = NULL_TREE; |
911a71a7 | 6468 | CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE; |
2ef16140 | 6469 | |
5ec1192e MM |
6470 | /* Make assumptions about the class; we'll reset the flags if |
6471 | necessary. */ | |
58731fd1 MM |
6472 | CLASSTYPE_EMPTY_P (t) = 1; |
6473 | CLASSTYPE_NEARLY_EMPTY_P (t) = 1; | |
5ec1192e | 6474 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0; |
3b49d762 | 6475 | CLASSTYPE_LITERAL_P (t) = true; |
58731fd1 | 6476 | |
2ef16140 | 6477 | /* Do end-of-class semantic processing: checking the validity of the |
03702748 | 6478 | bases and members and add implicitly generated methods. */ |
58731fd1 | 6479 | check_bases_and_members (t); |
2ef16140 | 6480 | |
f4f206f4 | 6481 | /* Find the key method. */ |
a63996f1 | 6482 | if (TYPE_CONTAINS_VPTR_P (t)) |
9aad8f83 | 6483 | { |
af287697 MM |
6484 | /* The Itanium C++ ABI permits the key method to be chosen when |
6485 | the class is defined -- even though the key method so | |
6486 | selected may later turn out to be an inline function. On | |
6487 | some systems (such as ARM Symbian OS) the key method cannot | |
6488 | be determined until the end of the translation unit. On such | |
6489 | systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which | |
6490 | will cause the class to be added to KEYED_CLASSES. Then, in | |
6491 | finish_file we will determine the key method. */ | |
6492 | if (targetm.cxx.key_method_may_be_inline ()) | |
6493 | determine_key_method (t); | |
9aad8f83 MA |
6494 | |
6495 | /* If a polymorphic class has no key method, we may emit the vtable | |
9bcb9aae | 6496 | in every translation unit where the class definition appears. */ |
9aad8f83 MA |
6497 | if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE) |
6498 | keyed_classes = tree_cons (NULL_TREE, t, keyed_classes); | |
6499 | } | |
6500 | ||
2ef16140 | 6501 | /* Layout the class itself. */ |
e93ee644 | 6502 | layout_class_type (t, &virtuals); |
a0c68737 NS |
6503 | if (CLASSTYPE_AS_BASE (t) != t) |
6504 | /* We use the base type for trivial assignments, and hence it | |
6505 | needs a mode. */ | |
6506 | compute_record_mode (CLASSTYPE_AS_BASE (t)); | |
8ebeee52 | 6507 | |
e93ee644 | 6508 | virtuals = modify_all_vtables (t, nreverse (virtuals)); |
db5ae43f | 6509 | |
5e19c053 | 6510 | /* If necessary, create the primary vtable for this class. */ |
e6858a84 | 6511 | if (virtuals || TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 6512 | { |
8d08fdba | 6513 | /* We must enter these virtuals into the table. */ |
3ef397c1 | 6514 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
da3d4dfa | 6515 | build_primary_vtable (NULL_TREE, t); |
dbbf88d1 | 6516 | else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t))) |
0533d788 MM |
6517 | /* Here we know enough to change the type of our virtual |
6518 | function table, but we will wait until later this function. */ | |
28531dd0 | 6519 | build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t); |
d3061adb JM |
6520 | |
6521 | /* If we're warning about ABI tags, check the types of the new | |
6522 | virtual functions. */ | |
6523 | if (warn_abi_tag) | |
6524 | for (tree v = virtuals; v; v = TREE_CHAIN (v)) | |
6525 | check_abi_tags (t, TREE_VALUE (v)); | |
8d08fdba MS |
6526 | } |
6527 | ||
bbd15aac | 6528 | if (TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 6529 | { |
e93ee644 MM |
6530 | int vindex; |
6531 | tree fn; | |
6532 | ||
604a3205 | 6533 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
50bc768d | 6534 | gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t)))); |
1eb4bea9 | 6535 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
50bc768d | 6536 | gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE); |
1eb4bea9 | 6537 | |
e6858a84 | 6538 | /* Add entries for virtual functions introduced by this class. */ |
604a3205 NS |
6539 | BINFO_VIRTUALS (TYPE_BINFO (t)) |
6540 | = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals); | |
e93ee644 MM |
6541 | |
6542 | /* Set DECL_VINDEX for all functions declared in this class. */ | |
c8094d83 MS |
6543 | for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t)); |
6544 | fn; | |
6545 | fn = TREE_CHAIN (fn), | |
e93ee644 MM |
6546 | vindex += (TARGET_VTABLE_USES_DESCRIPTORS |
6547 | ? TARGET_VTABLE_USES_DESCRIPTORS : 1)) | |
4977bab6 ZW |
6548 | { |
6549 | tree fndecl = BV_FN (fn); | |
6550 | ||
6551 | if (DECL_THUNK_P (fndecl)) | |
6552 | /* A thunk. We should never be calling this entry directly | |
6553 | from this vtable -- we'd use the entry for the non | |
6554 | thunk base function. */ | |
6555 | DECL_VINDEX (fndecl) = NULL_TREE; | |
6556 | else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST) | |
7d60be94 | 6557 | DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex); |
4977bab6 | 6558 | } |
8d08fdba MS |
6559 | } |
6560 | ||
d2c5305b | 6561 | finish_struct_bits (t); |
0a35513e | 6562 | set_method_tm_attributes (t); |
8d08fdba | 6563 | |
f30432d7 MS |
6564 | /* Complete the rtl for any static member objects of the type we're |
6565 | working on. */ | |
910ad8de | 6566 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) |
5a6ccc94 | 6567 | if (VAR_P (x) && TREE_STATIC (x) |
650fcd07 | 6568 | && TREE_TYPE (x) != error_mark_node |
c7f4981a | 6569 | && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t)) |
19e7881c | 6570 | DECL_MODE (x) = TYPE_MODE (t); |
8d08fdba | 6571 | |
f90cdf34 | 6572 | /* Done with FIELDS...now decide whether to sort these for |
58010b57 | 6573 | faster lookups later. |
f90cdf34 | 6574 | |
6c73ad72 | 6575 | We use a small number because most searches fail (succeeding |
f90cdf34 MT |
6576 | ultimately as the search bores through the inheritance |
6577 | hierarchy), and we want this failure to occur quickly. */ | |
6578 | ||
cba0366c | 6579 | insert_into_classtype_sorted_fields (TYPE_FIELDS (t), t, 8); |
f90cdf34 | 6580 | |
b9e75696 JM |
6581 | /* Complain if one of the field types requires lower visibility. */ |
6582 | constrain_class_visibility (t); | |
6583 | ||
8d7a5379 MM |
6584 | /* Make the rtl for any new vtables we have created, and unmark |
6585 | the base types we marked. */ | |
6586 | finish_vtbls (t); | |
c8094d83 | 6587 | |
23656158 MM |
6588 | /* Build the VTT for T. */ |
6589 | build_vtt (t); | |
8d7a5379 | 6590 | |
f03e8526 MM |
6591 | /* This warning does not make sense for Java classes, since they |
6592 | cannot have destructors. */ | |
6593 | if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t)) | |
9fd8f60d | 6594 | { |
9f4faeae MM |
6595 | tree dtor; |
6596 | ||
6597 | dtor = CLASSTYPE_DESTRUCTORS (t); | |
9f4faeae MM |
6598 | if (/* An implicitly declared destructor is always public. And, |
6599 | if it were virtual, we would have created it by now. */ | |
6600 | !dtor | |
6601 | || (!DECL_VINDEX (dtor) | |
43f14744 PS |
6602 | && (/* public non-virtual */ |
6603 | (!TREE_PRIVATE (dtor) && !TREE_PROTECTED (dtor)) | |
6604 | || (/* non-public non-virtual with friends */ | |
6605 | (TREE_PRIVATE (dtor) || TREE_PROTECTED (dtor)) | |
6606 | && (CLASSTYPE_FRIEND_CLASSES (t) | |
6607 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))))))) | |
6608 | warning (OPT_Wnon_virtual_dtor, | |
6609 | "%q#T has virtual functions and accessible" | |
6610 | " non-virtual destructor", t); | |
9fd8f60d | 6611 | } |
8d08fdba | 6612 | |
0154eaa8 | 6613 | complete_vars (t); |
8d08fdba | 6614 | |
9e9ff709 MS |
6615 | if (warn_overloaded_virtual) |
6616 | warn_hidden (t); | |
8d08fdba | 6617 | |
43d9ad1d DS |
6618 | /* Class layout, assignment of virtual table slots, etc., is now |
6619 | complete. Give the back end a chance to tweak the visibility of | |
6620 | the class or perform any other required target modifications. */ | |
6621 | targetm.cxx.adjust_class_at_definition (t); | |
6622 | ||
ae673f14 | 6623 | maybe_suppress_debug_info (t); |
8d08fdba | 6624 | |
2077db1b CT |
6625 | if (flag_vtable_verify) |
6626 | vtv_save_class_info (t); | |
6627 | ||
b7442fb5 | 6628 | dump_class_hierarchy (t); |
c8094d83 | 6629 | |
d2e5ee5c | 6630 | /* Finish debugging output for this type. */ |
881c6935 | 6631 | rest_of_type_compilation (t, ! LOCAL_CLASS_P (t)); |
bfcbe068 | 6632 | |
e7b6bcf3 | 6633 | if (TYPE_TRANSPARENT_AGGR (t)) |
bfcbe068 | 6634 | { |
e7b6bcf3 JJ |
6635 | tree field = first_field (t); |
6636 | if (field == NULL_TREE || error_operand_p (field)) | |
6637 | { | |
42b40eff | 6638 | error ("type transparent %q#T does not have any fields", t); |
e7b6bcf3 JJ |
6639 | TYPE_TRANSPARENT_AGGR (t) = 0; |
6640 | } | |
6641 | else if (DECL_ARTIFICIAL (field)) | |
6642 | { | |
6643 | if (DECL_FIELD_IS_BASE (field)) | |
6644 | error ("type transparent class %qT has base classes", t); | |
6645 | else | |
6646 | { | |
6647 | gcc_checking_assert (DECL_VIRTUAL_P (field)); | |
6648 | error ("type transparent class %qT has virtual functions", t); | |
6649 | } | |
6650 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6651 | } | |
42b40eff PC |
6652 | else if (TYPE_MODE (t) != DECL_MODE (field)) |
6653 | { | |
6654 | error ("type transparent %q#T cannot be made transparent because " | |
6655 | "the type of the first field has a different ABI from the " | |
6656 | "class overall", t); | |
6657 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6658 | } | |
bfcbe068 | 6659 | } |
8d08fdba | 6660 | } |
f30432d7 | 6661 | |
cba0366c FC |
6662 | /* Insert FIELDS into T for the sorted case if the FIELDS count is |
6663 | equal to THRESHOLD or greater than THRESHOLD. */ | |
6664 | ||
6665 | static void | |
6666 | insert_into_classtype_sorted_fields (tree fields, tree t, int threshold) | |
6667 | { | |
6668 | int n_fields = count_fields (fields); | |
6669 | if (n_fields >= threshold) | |
6670 | { | |
6671 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); | |
6672 | add_fields_to_record_type (fields, field_vec, 0); | |
6673 | qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp); | |
6674 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; | |
6675 | } | |
6676 | } | |
6677 | ||
6678 | /* Insert lately defined enum ENUMTYPE into T for the sorted case. */ | |
6679 | ||
6680 | void | |
6681 | insert_late_enum_def_into_classtype_sorted_fields (tree enumtype, tree t) | |
6682 | { | |
6683 | struct sorted_fields_type *sorted_fields = CLASSTYPE_SORTED_FIELDS (t); | |
6684 | if (sorted_fields) | |
6685 | { | |
6686 | int i; | |
6687 | int n_fields | |
6688 | = list_length (TYPE_VALUES (enumtype)) + sorted_fields->len; | |
6689 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); | |
6690 | ||
6691 | for (i = 0; i < sorted_fields->len; ++i) | |
6692 | field_vec->elts[i] = sorted_fields->elts[i]; | |
6693 | ||
6694 | add_enum_fields_to_record_type (enumtype, field_vec, | |
6695 | sorted_fields->len); | |
6696 | qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp); | |
6697 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; | |
6698 | } | |
6699 | } | |
6700 | ||
61a127b3 MM |
6701 | /* When T was built up, the member declarations were added in reverse |
6702 | order. Rearrange them to declaration order. */ | |
6703 | ||
6704 | void | |
94edc4ab | 6705 | unreverse_member_declarations (tree t) |
61a127b3 MM |
6706 | { |
6707 | tree next; | |
6708 | tree prev; | |
6709 | tree x; | |
6710 | ||
7088fca9 KL |
6711 | /* The following lists are all in reverse order. Put them in |
6712 | declaration order now. */ | |
61a127b3 | 6713 | TYPE_METHODS (t) = nreverse (TYPE_METHODS (t)); |
7088fca9 | 6714 | CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t)); |
61a127b3 MM |
6715 | |
6716 | /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in | |
6717 | reverse order, so we can't just use nreverse. */ | |
6718 | prev = NULL_TREE; | |
c8094d83 MS |
6719 | for (x = TYPE_FIELDS (t); |
6720 | x && TREE_CODE (x) != TYPE_DECL; | |
61a127b3 MM |
6721 | x = next) |
6722 | { | |
910ad8de NF |
6723 | next = DECL_CHAIN (x); |
6724 | DECL_CHAIN (x) = prev; | |
61a127b3 MM |
6725 | prev = x; |
6726 | } | |
6727 | if (prev) | |
6728 | { | |
910ad8de | 6729 | DECL_CHAIN (TYPE_FIELDS (t)) = x; |
61a127b3 MM |
6730 | if (prev) |
6731 | TYPE_FIELDS (t) = prev; | |
6732 | } | |
6733 | } | |
6734 | ||
f30432d7 | 6735 | tree |
94edc4ab | 6736 | finish_struct (tree t, tree attributes) |
f30432d7 | 6737 | { |
82a98427 | 6738 | location_t saved_loc = input_location; |
1f0d71c5 | 6739 | |
61a127b3 MM |
6740 | /* Now that we've got all the field declarations, reverse everything |
6741 | as necessary. */ | |
6742 | unreverse_member_declarations (t); | |
f30432d7 | 6743 | |
91d231cb | 6744 | cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); |
6467930b | 6745 | |
1f0d71c5 NS |
6746 | /* Nadger the current location so that diagnostics point to the start of |
6747 | the struct, not the end. */ | |
f31686a3 | 6748 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t)); |
1f0d71c5 | 6749 | |
5566b478 | 6750 | if (processing_template_decl) |
f30432d7 | 6751 | { |
7fb213d8 GB |
6752 | tree x; |
6753 | ||
b0e0b31f | 6754 | finish_struct_methods (t); |
867580ce | 6755 | TYPE_SIZE (t) = bitsize_zero_node; |
ae54ec16 | 6756 | TYPE_SIZE_UNIT (t) = size_zero_node; |
7fb213d8 GB |
6757 | |
6758 | /* We need to emit an error message if this type was used as a parameter | |
6759 | and it is an abstract type, even if it is a template. We construct | |
6760 | a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into | |
6761 | account and we call complete_vars with this type, which will check | |
6762 | the PARM_DECLS. Note that while the type is being defined, | |
6763 | CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends | |
6764 | (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */ | |
585b44d3 | 6765 | CLASSTYPE_PURE_VIRTUALS (t) = NULL; |
910ad8de | 6766 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
7fb213d8 | 6767 | if (DECL_PURE_VIRTUAL_P (x)) |
9771b263 | 6768 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x); |
7fb213d8 | 6769 | complete_vars (t); |
e58d4228 JM |
6770 | /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if |
6771 | an enclosing scope is a template class, so that this function be | |
6772 | found by lookup_fnfields_1 when the using declaration is not | |
6773 | instantiated yet. */ | |
6774 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) | |
6775 | if (TREE_CODE (x) == USING_DECL) | |
6776 | { | |
6777 | tree fn = strip_using_decl (x); | |
6778 | if (is_overloaded_fn (fn)) | |
6779 | for (; fn; fn = OVL_NEXT (fn)) | |
6780 | add_method (t, OVL_CURRENT (fn), x); | |
6781 | } | |
040ca4b3 JM |
6782 | |
6783 | /* Remember current #pragma pack value. */ | |
6784 | TYPE_PRECISION (t) = maximum_field_alignment; | |
947296ca JM |
6785 | |
6786 | /* Fix up any variants we've already built. */ | |
6787 | for (x = TYPE_NEXT_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x)) | |
6788 | { | |
6789 | TYPE_SIZE (x) = TYPE_SIZE (t); | |
6790 | TYPE_SIZE_UNIT (x) = TYPE_SIZE_UNIT (t); | |
6791 | TYPE_FIELDS (x) = TYPE_FIELDS (t); | |
6792 | TYPE_METHODS (x) = TYPE_METHODS (t); | |
6793 | } | |
6f1b4c42 | 6794 | } |
f30432d7 | 6795 | else |
9f33663b | 6796 | finish_struct_1 (t); |
5566b478 | 6797 | |
82a98427 | 6798 | input_location = saved_loc; |
1f0d71c5 | 6799 | |
5566b478 | 6800 | TYPE_BEING_DEFINED (t) = 0; |
8f032717 | 6801 | |
5566b478 | 6802 | if (current_class_type) |
b74a0560 | 6803 | popclass (); |
5566b478 | 6804 | else |
357351e5 | 6805 | error ("trying to finish struct, but kicked out due to previous parse errors"); |
5566b478 | 6806 | |
637f68e8 JM |
6807 | if (processing_template_decl && at_function_scope_p () |
6808 | /* Lambdas are defined by the LAMBDA_EXPR. */ | |
6809 | && !LAMBDA_TYPE_P (t)) | |
5f261ba9 | 6810 | add_stmt (build_min (TAG_DEFN, t)); |
ae673f14 | 6811 | |
5566b478 | 6812 | return t; |
f30432d7 | 6813 | } |
8d08fdba | 6814 | \f |
abcc192b JJ |
6815 | /* Hash table to avoid endless recursion when handling references. */ |
6816 | static hash_table <pointer_hash <tree_node> > fixed_type_or_null_ref_ht; | |
6817 | ||
51ddb82e | 6818 | /* Return the dynamic type of INSTANCE, if known. |
8d08fdba MS |
6819 | Used to determine whether the virtual function table is needed |
6820 | or not. | |
6821 | ||
6822 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6823 | of our knowledge of its type. *NONNULL should be initialized |
6824 | before this function is called. */ | |
e92cc029 | 6825 | |
d8e178a0 | 6826 | static tree |
555551c2 | 6827 | fixed_type_or_null (tree instance, int *nonnull, int *cdtorp) |
8d08fdba | 6828 | { |
555551c2 MM |
6829 | #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp) |
6830 | ||
8d08fdba MS |
6831 | switch (TREE_CODE (instance)) |
6832 | { | |
6833 | case INDIRECT_REF: | |
608afcc5 | 6834 | if (POINTER_TYPE_P (TREE_TYPE (instance))) |
a0de9d20 JM |
6835 | return NULL_TREE; |
6836 | else | |
555551c2 | 6837 | return RECUR (TREE_OPERAND (instance, 0)); |
a0de9d20 | 6838 | |
8d08fdba MS |
6839 | case CALL_EXPR: |
6840 | /* This is a call to a constructor, hence it's never zero. */ | |
6841 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6842 | { | |
6843 | if (nonnull) | |
6844 | *nonnull = 1; | |
51ddb82e | 6845 | return TREE_TYPE (instance); |
8d08fdba | 6846 | } |
51ddb82e | 6847 | return NULL_TREE; |
8d08fdba MS |
6848 | |
6849 | case SAVE_EXPR: | |
6850 | /* This is a call to a constructor, hence it's never zero. */ | |
6851 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6852 | { | |
6853 | if (nonnull) | |
6854 | *nonnull = 1; | |
51ddb82e | 6855 | return TREE_TYPE (instance); |
8d08fdba | 6856 | } |
555551c2 | 6857 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba | 6858 | |
5be014d5 | 6859 | case POINTER_PLUS_EXPR: |
8d08fdba MS |
6860 | case PLUS_EXPR: |
6861 | case MINUS_EXPR: | |
394fd776 | 6862 | if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR) |
555551c2 | 6863 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6864 | if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST) |
6865 | /* Propagate nonnull. */ | |
555551c2 MM |
6866 | return RECUR (TREE_OPERAND (instance, 0)); |
6867 | ||
51ddb82e | 6868 | return NULL_TREE; |
8d08fdba | 6869 | |
63a906f0 | 6870 | CASE_CONVERT: |
555551c2 | 6871 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6872 | |
6873 | case ADDR_EXPR: | |
88f19756 | 6874 | instance = TREE_OPERAND (instance, 0); |
8d08fdba | 6875 | if (nonnull) |
88f19756 RH |
6876 | { |
6877 | /* Just because we see an ADDR_EXPR doesn't mean we're dealing | |
6878 | with a real object -- given &p->f, p can still be null. */ | |
6879 | tree t = get_base_address (instance); | |
6880 | /* ??? Probably should check DECL_WEAK here. */ | |
6881 | if (t && DECL_P (t)) | |
6882 | *nonnull = 1; | |
6883 | } | |
555551c2 | 6884 | return RECUR (instance); |
8d08fdba MS |
6885 | |
6886 | case COMPONENT_REF: | |
642124c6 RH |
6887 | /* If this component is really a base class reference, then the field |
6888 | itself isn't definitive. */ | |
6889 | if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1))) | |
555551c2 MM |
6890 | return RECUR (TREE_OPERAND (instance, 0)); |
6891 | return RECUR (TREE_OPERAND (instance, 1)); | |
8d08fdba | 6892 | |
8d08fdba MS |
6893 | case VAR_DECL: |
6894 | case FIELD_DECL: | |
6895 | if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE | |
9e1e64ec | 6896 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance)))) |
8d08fdba MS |
6897 | { |
6898 | if (nonnull) | |
6899 | *nonnull = 1; | |
51ddb82e | 6900 | return TREE_TYPE (TREE_TYPE (instance)); |
8d08fdba | 6901 | } |
e92cc029 | 6902 | /* fall through... */ |
8d08fdba MS |
6903 | case TARGET_EXPR: |
6904 | case PARM_DECL: | |
f63ab951 | 6905 | case RESULT_DECL: |
9e1e64ec | 6906 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance))) |
8d08fdba MS |
6907 | { |
6908 | if (nonnull) | |
6909 | *nonnull = 1; | |
51ddb82e | 6910 | return TREE_TYPE (instance); |
8d08fdba | 6911 | } |
394fd776 | 6912 | else if (instance == current_class_ptr) |
0cbd7506 MS |
6913 | { |
6914 | if (nonnull) | |
6915 | *nonnull = 1; | |
6916 | ||
f10eaa2d JM |
6917 | /* if we're in a ctor or dtor, we know our type. If |
6918 | current_class_ptr is set but we aren't in a function, we're in | |
6919 | an NSDMI (and therefore a constructor). */ | |
6920 | if (current_scope () != current_function_decl | |
6921 | || (DECL_LANG_SPECIFIC (current_function_decl) | |
6922 | && (DECL_CONSTRUCTOR_P (current_function_decl) | |
6923 | || DECL_DESTRUCTOR_P (current_function_decl)))) | |
0cbd7506 MS |
6924 | { |
6925 | if (cdtorp) | |
6926 | *cdtorp = 1; | |
6927 | return TREE_TYPE (TREE_TYPE (instance)); | |
6928 | } | |
6929 | } | |
394fd776 | 6930 | else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE) |
0cbd7506 | 6931 | { |
555551c2 | 6932 | /* We only need one hash table because it is always left empty. */ |
abcc192b JJ |
6933 | if (!fixed_type_or_null_ref_ht.is_created ()) |
6934 | fixed_type_or_null_ref_ht.create (37); | |
555551c2 | 6935 | |
0cbd7506 MS |
6936 | /* Reference variables should be references to objects. */ |
6937 | if (nonnull) | |
8d08fdba | 6938 | *nonnull = 1; |
c8094d83 | 6939 | |
555551c2 | 6940 | /* Enter the INSTANCE in a table to prevent recursion; a |
772f8889 MM |
6941 | variable's initializer may refer to the variable |
6942 | itself. */ | |
5a6ccc94 | 6943 | if (VAR_P (instance) |
772f8889 | 6944 | && DECL_INITIAL (instance) |
bae14a37 | 6945 | && !type_dependent_expression_p_push (DECL_INITIAL (instance)) |
abcc192b | 6946 | && !fixed_type_or_null_ref_ht.find (instance)) |
772f8889 MM |
6947 | { |
6948 | tree type; | |
703c8606 | 6949 | tree_node **slot; |
555551c2 | 6950 | |
abcc192b | 6951 | slot = fixed_type_or_null_ref_ht.find_slot (instance, INSERT); |
555551c2 MM |
6952 | *slot = instance; |
6953 | type = RECUR (DECL_INITIAL (instance)); | |
abcc192b | 6954 | fixed_type_or_null_ref_ht.remove_elt (instance); |
555551c2 | 6955 | |
772f8889 MM |
6956 | return type; |
6957 | } | |
8d08fdba | 6958 | } |
51ddb82e | 6959 | return NULL_TREE; |
8d08fdba MS |
6960 | |
6961 | default: | |
51ddb82e | 6962 | return NULL_TREE; |
8d08fdba | 6963 | } |
555551c2 | 6964 | #undef RECUR |
8d08fdba | 6965 | } |
51ddb82e | 6966 | |
838dfd8a | 6967 | /* Return nonzero if the dynamic type of INSTANCE is known, and |
338d90b8 NS |
6968 | equivalent to the static type. We also handle the case where |
6969 | INSTANCE is really a pointer. Return negative if this is a | |
6970 | ctor/dtor. There the dynamic type is known, but this might not be | |
6971 | the most derived base of the original object, and hence virtual | |
c65cb8d1 | 6972 | bases may not be laid out according to this type. |
51ddb82e JM |
6973 | |
6974 | Used to determine whether the virtual function table is needed | |
6975 | or not. | |
6976 | ||
6977 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6978 | of our knowledge of its type. *NONNULL should be initialized |
6979 | before this function is called. */ | |
51ddb82e JM |
6980 | |
6981 | int | |
94edc4ab | 6982 | resolves_to_fixed_type_p (tree instance, int* nonnull) |
51ddb82e JM |
6983 | { |
6984 | tree t = TREE_TYPE (instance); | |
394fd776 | 6985 | int cdtorp = 0; |
4d3baecc JM |
6986 | tree fixed; |
6987 | ||
65f0c5b3 JM |
6988 | /* processing_template_decl can be false in a template if we're in |
6989 | fold_non_dependent_expr, but we still want to suppress this check. */ | |
e0e1b357 | 6990 | if (in_template_function ()) |
4d3baecc JM |
6991 | { |
6992 | /* In a template we only care about the type of the result. */ | |
6993 | if (nonnull) | |
6994 | *nonnull = true; | |
6995 | return true; | |
6996 | } | |
6997 | ||
6998 | fixed = fixed_type_or_null (instance, nonnull, &cdtorp); | |
51ddb82e JM |
6999 | if (fixed == NULL_TREE) |
7000 | return 0; | |
7001 | if (POINTER_TYPE_P (t)) | |
7002 | t = TREE_TYPE (t); | |
394fd776 NS |
7003 | if (!same_type_ignoring_top_level_qualifiers_p (t, fixed)) |
7004 | return 0; | |
7005 | return cdtorp ? -1 : 1; | |
51ddb82e JM |
7006 | } |
7007 | ||
8d08fdba MS |
7008 | \f |
7009 | void | |
94edc4ab | 7010 | init_class_processing (void) |
8d08fdba MS |
7011 | { |
7012 | current_class_depth = 0; | |
61a127b3 | 7013 | current_class_stack_size = 10; |
c8094d83 | 7014 | current_class_stack |
0ac1b889 | 7015 | = XNEWVEC (struct class_stack_node, current_class_stack_size); |
9771b263 | 7016 | vec_alloc (local_classes, 8); |
c5a35c3c | 7017 | sizeof_biggest_empty_class = size_zero_node; |
8d08fdba | 7018 | |
0e5921e8 ZW |
7019 | ridpointers[(int) RID_PUBLIC] = access_public_node; |
7020 | ridpointers[(int) RID_PRIVATE] = access_private_node; | |
7021 | ridpointers[(int) RID_PROTECTED] = access_protected_node; | |
8d08fdba MS |
7022 | } |
7023 | ||
39fb05d0 MM |
7024 | /* Restore the cached PREVIOUS_CLASS_LEVEL. */ |
7025 | ||
7026 | static void | |
7027 | restore_class_cache (void) | |
7028 | { | |
39fb05d0 | 7029 | tree type; |
39fb05d0 MM |
7030 | |
7031 | /* We are re-entering the same class we just left, so we don't | |
7032 | have to search the whole inheritance matrix to find all the | |
7033 | decls to bind again. Instead, we install the cached | |
7034 | class_shadowed list and walk through it binding names. */ | |
7035 | push_binding_level (previous_class_level); | |
7036 | class_binding_level = previous_class_level; | |
39fb05d0 | 7037 | /* Restore IDENTIFIER_TYPE_VALUE. */ |
c8094d83 MS |
7038 | for (type = class_binding_level->type_shadowed; |
7039 | type; | |
39fb05d0 MM |
7040 | type = TREE_CHAIN (type)) |
7041 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type)); | |
7042 | } | |
7043 | ||
a723baf1 MM |
7044 | /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as |
7045 | appropriate for TYPE. | |
8d08fdba | 7046 | |
8d08fdba MS |
7047 | So that we may avoid calls to lookup_name, we cache the _TYPE |
7048 | nodes of local TYPE_DECLs in the TREE_TYPE field of the name. | |
7049 | ||
7050 | For multiple inheritance, we perform a two-pass depth-first search | |
39fb05d0 | 7051 | of the type lattice. */ |
8d08fdba MS |
7052 | |
7053 | void | |
29370796 | 7054 | pushclass (tree type) |
8d08fdba | 7055 | { |
c888c93b MM |
7056 | class_stack_node_t csn; |
7057 | ||
0771d9d7 JM |
7058 | type = TYPE_MAIN_VARIANT (type); |
7059 | ||
61a127b3 | 7060 | /* Make sure there is enough room for the new entry on the stack. */ |
c8094d83 | 7061 | if (current_class_depth + 1 >= current_class_stack_size) |
8d08fdba | 7062 | { |
61a127b3 MM |
7063 | current_class_stack_size *= 2; |
7064 | current_class_stack | |
7767580e | 7065 | = XRESIZEVEC (struct class_stack_node, current_class_stack, |
3db45ab5 | 7066 | current_class_stack_size); |
8d08fdba MS |
7067 | } |
7068 | ||
61a127b3 | 7069 | /* Insert a new entry on the class stack. */ |
c888c93b MM |
7070 | csn = current_class_stack + current_class_depth; |
7071 | csn->name = current_class_name; | |
7072 | csn->type = current_class_type; | |
7073 | csn->access = current_access_specifier; | |
7074 | csn->names_used = 0; | |
7075 | csn->hidden = 0; | |
61a127b3 MM |
7076 | current_class_depth++; |
7077 | ||
7078 | /* Now set up the new type. */ | |
8d08fdba MS |
7079 | current_class_name = TYPE_NAME (type); |
7080 | if (TREE_CODE (current_class_name) == TYPE_DECL) | |
7081 | current_class_name = DECL_NAME (current_class_name); | |
7082 | current_class_type = type; | |
7083 | ||
61a127b3 MM |
7084 | /* By default, things in classes are private, while things in |
7085 | structures or unions are public. */ | |
c8094d83 MS |
7086 | current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type) |
7087 | ? access_private_node | |
61a127b3 MM |
7088 | : access_public_node); |
7089 | ||
89b578be MM |
7090 | if (previous_class_level |
7091 | && type != previous_class_level->this_entity | |
8d08fdba MS |
7092 | && current_class_depth == 1) |
7093 | { | |
7094 | /* Forcibly remove any old class remnants. */ | |
8f032717 | 7095 | invalidate_class_lookup_cache (); |
8d08fdba MS |
7096 | } |
7097 | ||
c8094d83 | 7098 | if (!previous_class_level |
89b578be MM |
7099 | || type != previous_class_level->this_entity |
7100 | || current_class_depth > 1) | |
90ea9897 | 7101 | pushlevel_class (); |
29370796 | 7102 | else |
39fb05d0 | 7103 | restore_class_cache (); |
8f032717 MM |
7104 | } |
7105 | ||
39fb05d0 MM |
7106 | /* When we exit a toplevel class scope, we save its binding level so |
7107 | that we can restore it quickly. Here, we've entered some other | |
7108 | class, so we must invalidate our cache. */ | |
8d08fdba | 7109 | |
8f032717 | 7110 | void |
94edc4ab | 7111 | invalidate_class_lookup_cache (void) |
8f032717 | 7112 | { |
89b578be | 7113 | previous_class_level = NULL; |
8d08fdba | 7114 | } |
c8094d83 | 7115 | |
8d08fdba | 7116 | /* Get out of the current class scope. If we were in a class scope |
b74a0560 | 7117 | previously, that is the one popped to. */ |
e92cc029 | 7118 | |
8d08fdba | 7119 | void |
94edc4ab | 7120 | popclass (void) |
8d08fdba | 7121 | { |
0771d9d7 | 7122 | poplevel_class (); |
8d08fdba MS |
7123 | |
7124 | current_class_depth--; | |
61a127b3 MM |
7125 | current_class_name = current_class_stack[current_class_depth].name; |
7126 | current_class_type = current_class_stack[current_class_depth].type; | |
7127 | current_access_specifier = current_class_stack[current_class_depth].access; | |
8f032717 MM |
7128 | if (current_class_stack[current_class_depth].names_used) |
7129 | splay_tree_delete (current_class_stack[current_class_depth].names_used); | |
8d08fdba MS |
7130 | } |
7131 | ||
c888c93b MM |
7132 | /* Mark the top of the class stack as hidden. */ |
7133 | ||
7134 | void | |
7135 | push_class_stack (void) | |
7136 | { | |
7137 | if (current_class_depth) | |
7138 | ++current_class_stack[current_class_depth - 1].hidden; | |
7139 | } | |
7140 | ||
7141 | /* Mark the top of the class stack as un-hidden. */ | |
7142 | ||
7143 | void | |
7144 | pop_class_stack (void) | |
7145 | { | |
7146 | if (current_class_depth) | |
7147 | --current_class_stack[current_class_depth - 1].hidden; | |
7148 | } | |
7149 | ||
fa6098f8 MM |
7150 | /* Returns 1 if the class type currently being defined is either T or |
7151 | a nested type of T. */ | |
b9082e8a | 7152 | |
fa6098f8 | 7153 | bool |
94edc4ab | 7154 | currently_open_class (tree t) |
b9082e8a JM |
7155 | { |
7156 | int i; | |
fa6098f8 | 7157 | |
1cb801bc JM |
7158 | if (!CLASS_TYPE_P (t)) |
7159 | return false; | |
7160 | ||
3e5e84be JM |
7161 | t = TYPE_MAIN_VARIANT (t); |
7162 | ||
fa6098f8 MM |
7163 | /* We start looking from 1 because entry 0 is from global scope, |
7164 | and has no type. */ | |
7165 | for (i = current_class_depth; i > 0; --i) | |
c888c93b | 7166 | { |
fa6098f8 MM |
7167 | tree c; |
7168 | if (i == current_class_depth) | |
7169 | c = current_class_type; | |
7170 | else | |
7171 | { | |
7172 | if (current_class_stack[i].hidden) | |
7173 | break; | |
7174 | c = current_class_stack[i].type; | |
7175 | } | |
7176 | if (!c) | |
7177 | continue; | |
7178 | if (same_type_p (c, t)) | |
7179 | return true; | |
c888c93b | 7180 | } |
fa6098f8 | 7181 | return false; |
b9082e8a JM |
7182 | } |
7183 | ||
70adf8a9 JM |
7184 | /* If either current_class_type or one of its enclosing classes are derived |
7185 | from T, return the appropriate type. Used to determine how we found | |
7186 | something via unqualified lookup. */ | |
7187 | ||
7188 | tree | |
94edc4ab | 7189 | currently_open_derived_class (tree t) |
70adf8a9 JM |
7190 | { |
7191 | int i; | |
7192 | ||
9bcb9aae | 7193 | /* The bases of a dependent type are unknown. */ |
1fb3244a MM |
7194 | if (dependent_type_p (t)) |
7195 | return NULL_TREE; | |
7196 | ||
c44e68a5 KL |
7197 | if (!current_class_type) |
7198 | return NULL_TREE; | |
7199 | ||
70adf8a9 JM |
7200 | if (DERIVED_FROM_P (t, current_class_type)) |
7201 | return current_class_type; | |
7202 | ||
7203 | for (i = current_class_depth - 1; i > 0; --i) | |
c888c93b MM |
7204 | { |
7205 | if (current_class_stack[i].hidden) | |
7206 | break; | |
7207 | if (DERIVED_FROM_P (t, current_class_stack[i].type)) | |
7208 | return current_class_stack[i].type; | |
7209 | } | |
70adf8a9 JM |
7210 | |
7211 | return NULL_TREE; | |
7212 | } | |
7213 | ||
a6846853 JM |
7214 | /* Returns the innermost class type which is not a lambda closure type. */ |
7215 | ||
7216 | tree | |
7217 | current_nonlambda_class_type (void) | |
7218 | { | |
7219 | int i; | |
7220 | ||
7221 | /* We start looking from 1 because entry 0 is from global scope, | |
7222 | and has no type. */ | |
7223 | for (i = current_class_depth; i > 0; --i) | |
7224 | { | |
7225 | tree c; | |
7226 | if (i == current_class_depth) | |
7227 | c = current_class_type; | |
7228 | else | |
7229 | { | |
7230 | if (current_class_stack[i].hidden) | |
7231 | break; | |
7232 | c = current_class_stack[i].type; | |
7233 | } | |
7234 | if (!c) | |
7235 | continue; | |
7236 | if (!LAMBDA_TYPE_P (c)) | |
7237 | return c; | |
7238 | } | |
7239 | return NULL_TREE; | |
7240 | } | |
7241 | ||
8d08fdba | 7242 | /* When entering a class scope, all enclosing class scopes' names with |
14d22dd6 MM |
7243 | static meaning (static variables, static functions, types and |
7244 | enumerators) have to be visible. This recursive function calls | |
7245 | pushclass for all enclosing class contexts until global or a local | |
7246 | scope is reached. TYPE is the enclosed class. */ | |
8d08fdba MS |
7247 | |
7248 | void | |
14d22dd6 | 7249 | push_nested_class (tree type) |
8d08fdba | 7250 | { |
b262d64c | 7251 | /* A namespace might be passed in error cases, like A::B:C. */ |
c8094d83 | 7252 | if (type == NULL_TREE |
56d0c6e3 | 7253 | || !CLASS_TYPE_P (type)) |
a28e3c7f | 7254 | return; |
c8094d83 | 7255 | |
56d0c6e3 | 7256 | push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type))); |
8d08fdba | 7257 | |
29370796 | 7258 | pushclass (type); |
8d08fdba MS |
7259 | } |
7260 | ||
a723baf1 | 7261 | /* Undoes a push_nested_class call. */ |
8d08fdba MS |
7262 | |
7263 | void | |
94edc4ab | 7264 | pop_nested_class (void) |
8d08fdba | 7265 | { |
d2e5ee5c | 7266 | tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type)); |
8d08fdba | 7267 | |
b74a0560 | 7268 | popclass (); |
6b400b21 | 7269 | if (context && CLASS_TYPE_P (context)) |
b74a0560 | 7270 | pop_nested_class (); |
8d08fdba MS |
7271 | } |
7272 | ||
46ccf50a JM |
7273 | /* Returns the number of extern "LANG" blocks we are nested within. */ |
7274 | ||
7275 | int | |
94edc4ab | 7276 | current_lang_depth (void) |
46ccf50a | 7277 | { |
9771b263 | 7278 | return vec_safe_length (current_lang_base); |
46ccf50a JM |
7279 | } |
7280 | ||
8d08fdba MS |
7281 | /* Set global variables CURRENT_LANG_NAME to appropriate value |
7282 | so that behavior of name-mangling machinery is correct. */ | |
7283 | ||
7284 | void | |
94edc4ab | 7285 | push_lang_context (tree name) |
8d08fdba | 7286 | { |
9771b263 | 7287 | vec_safe_push (current_lang_base, current_lang_name); |
8d08fdba | 7288 | |
e229f2cd | 7289 | if (name == lang_name_cplusplus) |
8d08fdba | 7290 | { |
8d08fdba MS |
7291 | current_lang_name = name; |
7292 | } | |
e229f2cd PB |
7293 | else if (name == lang_name_java) |
7294 | { | |
e229f2cd PB |
7295 | current_lang_name = name; |
7296 | /* DECL_IGNORED_P is initially set for these types, to avoid clutter. | |
7297 | (See record_builtin_java_type in decl.c.) However, that causes | |
7298 | incorrect debug entries if these types are actually used. | |
00a17e31 | 7299 | So we re-enable debug output after extern "Java". */ |
e3cd9945 APB |
7300 | DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0; |
7301 | DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0; | |
7302 | DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0; | |
7303 | DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0; | |
7304 | DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0; | |
7305 | DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0; | |
7306 | DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0; | |
7307 | DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0; | |
e229f2cd | 7308 | } |
8d08fdba MS |
7309 | else if (name == lang_name_c) |
7310 | { | |
8d08fdba MS |
7311 | current_lang_name = name; |
7312 | } | |
7313 | else | |
9e637a26 | 7314 | error ("language string %<\"%E\"%> not recognized", name); |
8d08fdba | 7315 | } |
c8094d83 | 7316 | |
8d08fdba | 7317 | /* Get out of the current language scope. */ |
e92cc029 | 7318 | |
8d08fdba | 7319 | void |
94edc4ab | 7320 | pop_lang_context (void) |
8d08fdba | 7321 | { |
9771b263 | 7322 | current_lang_name = current_lang_base->pop (); |
8d08fdba | 7323 | } |
8d08fdba MS |
7324 | \f |
7325 | /* Type instantiation routines. */ | |
7326 | ||
104bf76a MM |
7327 | /* Given an OVERLOAD and a TARGET_TYPE, return the function that |
7328 | matches the TARGET_TYPE. If there is no satisfactory match, return | |
eff3a276 MM |
7329 | error_mark_node, and issue an error & warning messages under |
7330 | control of FLAGS. Permit pointers to member function if FLAGS | |
7331 | permits. If TEMPLATE_ONLY, the name of the overloaded function was | |
7332 | a template-id, and EXPLICIT_TARGS are the explicitly provided | |
248e1b22 MM |
7333 | template arguments. |
7334 | ||
7335 | If OVERLOAD is for one or more member functions, then ACCESS_PATH | |
7336 | is the base path used to reference those member functions. If | |
5e7b9f60 JM |
7337 | the address is resolved to a member function, access checks will be |
7338 | performed and errors issued if appropriate. */ | |
104bf76a | 7339 | |
2c73f9f5 | 7340 | static tree |
c8094d83 | 7341 | resolve_address_of_overloaded_function (tree target_type, |
94edc4ab | 7342 | tree overload, |
92af500d NS |
7343 | tsubst_flags_t flags, |
7344 | bool template_only, | |
eff3a276 MM |
7345 | tree explicit_targs, |
7346 | tree access_path) | |
2c73f9f5 | 7347 | { |
104bf76a | 7348 | /* Here's what the standard says: |
c8094d83 | 7349 | |
104bf76a MM |
7350 | [over.over] |
7351 | ||
7352 | If the name is a function template, template argument deduction | |
7353 | is done, and if the argument deduction succeeds, the deduced | |
7354 | arguments are used to generate a single template function, which | |
7355 | is added to the set of overloaded functions considered. | |
7356 | ||
7357 | Non-member functions and static member functions match targets of | |
7358 | type "pointer-to-function" or "reference-to-function." Nonstatic | |
7359 | member functions match targets of type "pointer-to-member | |
7360 | function;" the function type of the pointer to member is used to | |
7361 | select the member function from the set of overloaded member | |
7362 | functions. If a nonstatic member function is selected, the | |
7363 | reference to the overloaded function name is required to have the | |
7364 | form of a pointer to member as described in 5.3.1. | |
7365 | ||
7366 | If more than one function is selected, any template functions in | |
7367 | the set are eliminated if the set also contains a non-template | |
7368 | function, and any given template function is eliminated if the | |
7369 | set contains a second template function that is more specialized | |
7370 | than the first according to the partial ordering rules 14.5.5.2. | |
7371 | After such eliminations, if any, there shall remain exactly one | |
7372 | selected function. */ | |
7373 | ||
7374 | int is_ptrmem = 0; | |
104bf76a MM |
7375 | /* We store the matches in a TREE_LIST rooted here. The functions |
7376 | are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy | |
7377 | interoperability with most_specialized_instantiation. */ | |
7378 | tree matches = NULL_TREE; | |
50714e79 | 7379 | tree fn; |
7bead48f | 7380 | tree target_fn_type; |
104bf76a | 7381 | |
d8f8dca1 MM |
7382 | /* By the time we get here, we should be seeing only real |
7383 | pointer-to-member types, not the internal POINTER_TYPE to | |
7384 | METHOD_TYPE representation. */ | |
50e10fa8 | 7385 | gcc_assert (!TYPE_PTR_P (target_type) |
50bc768d | 7386 | || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE); |
104bf76a | 7387 | |
50bc768d | 7388 | gcc_assert (is_overloaded_fn (overload)); |
c8094d83 | 7389 | |
104bf76a | 7390 | /* Check that the TARGET_TYPE is reasonable. */ |
6721db5d JM |
7391 | if (TYPE_PTRFN_P (target_type) |
7392 | || TYPE_REFFN_P (target_type)) | |
381ddaa6 | 7393 | /* This is OK. */; |
104bf76a MM |
7394 | else if (TYPE_PTRMEMFUNC_P (target_type)) |
7395 | /* This is OK, too. */ | |
7396 | is_ptrmem = 1; | |
7397 | else if (TREE_CODE (target_type) == FUNCTION_TYPE) | |
db80e34e JJ |
7398 | /* This is OK, too. This comes from a conversion to reference |
7399 | type. */ | |
7400 | target_type = build_reference_type (target_type); | |
c8094d83 | 7401 | else |
104bf76a | 7402 | { |
92af500d | 7403 | if (flags & tf_error) |
c4f73174 | 7404 | error ("cannot resolve overloaded function %qD based on" |
0cbd7506 MS |
7405 | " conversion to type %qT", |
7406 | DECL_NAME (OVL_FUNCTION (overload)), target_type); | |
104bf76a MM |
7407 | return error_mark_node; |
7408 | } | |
c8094d83 | 7409 | |
7bead48f JM |
7410 | /* Non-member functions and static member functions match targets of type |
7411 | "pointer-to-function" or "reference-to-function." Nonstatic member | |
7412 | functions match targets of type "pointer-to-member-function;" the | |
7413 | function type of the pointer to member is used to select the member | |
7414 | function from the set of overloaded member functions. | |
7415 | ||
7416 | So figure out the FUNCTION_TYPE that we want to match against. */ | |
7417 | target_fn_type = static_fn_type (target_type); | |
7418 | ||
104bf76a MM |
7419 | /* If we can find a non-template function that matches, we can just |
7420 | use it. There's no point in generating template instantiations | |
7421 | if we're just going to throw them out anyhow. But, of course, we | |
7422 | can only do this when we don't *need* a template function. */ | |
7423 | if (!template_only) | |
7424 | { | |
7425 | tree fns; | |
7426 | ||
a723baf1 | 7427 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 7428 | { |
a723baf1 | 7429 | tree fn = OVL_CURRENT (fns); |
2c73f9f5 | 7430 | |
104bf76a MM |
7431 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
7432 | /* We're not looking for templates just yet. */ | |
7433 | continue; | |
7434 | ||
7435 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7436 | != is_ptrmem) | |
7437 | /* We're looking for a non-static member, and this isn't | |
7438 | one, or vice versa. */ | |
7439 | continue; | |
34ff2673 | 7440 | |
d63d5d0c ILT |
7441 | /* Ignore functions which haven't been explicitly |
7442 | declared. */ | |
34ff2673 RS |
7443 | if (DECL_ANTICIPATED (fn)) |
7444 | continue; | |
7445 | ||
104bf76a | 7446 | /* See if there's a match. */ |
7bead48f | 7447 | if (same_type_p (target_fn_type, static_fn_type (fn))) |
e1b3e07d | 7448 | matches = tree_cons (fn, NULL_TREE, matches); |
104bf76a MM |
7449 | } |
7450 | } | |
7451 | ||
7452 | /* Now, if we've already got a match (or matches), there's no need | |
7453 | to proceed to the template functions. But, if we don't have a | |
7454 | match we need to look at them, too. */ | |
c8094d83 | 7455 | if (!matches) |
2c73f9f5 | 7456 | { |
104bf76a | 7457 | tree target_arg_types; |
8d3631f8 | 7458 | tree target_ret_type; |
104bf76a | 7459 | tree fns; |
c166b898 ILT |
7460 | tree *args; |
7461 | unsigned int nargs, ia; | |
7462 | tree arg; | |
104bf76a | 7463 | |
4393e105 | 7464 | target_arg_types = TYPE_ARG_TYPES (target_fn_type); |
8d3631f8 | 7465 | target_ret_type = TREE_TYPE (target_fn_type); |
e5214479 | 7466 | |
c166b898 ILT |
7467 | nargs = list_length (target_arg_types); |
7468 | args = XALLOCAVEC (tree, nargs); | |
7469 | for (arg = target_arg_types, ia = 0; | |
7470 | arg != NULL_TREE && arg != void_list_node; | |
7471 | arg = TREE_CHAIN (arg), ++ia) | |
7472 | args[ia] = TREE_VALUE (arg); | |
7473 | nargs = ia; | |
7474 | ||
a723baf1 | 7475 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 7476 | { |
a723baf1 | 7477 | tree fn = OVL_CURRENT (fns); |
104bf76a | 7478 | tree instantiation; |
104bf76a MM |
7479 | tree targs; |
7480 | ||
7481 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
7482 | /* We're only looking for templates. */ | |
7483 | continue; | |
7484 | ||
7485 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7486 | != is_ptrmem) | |
4393e105 | 7487 | /* We're not looking for a non-static member, and this is |
104bf76a MM |
7488 | one, or vice versa. */ |
7489 | continue; | |
7490 | ||
79d8a272 JM |
7491 | tree ret = target_ret_type; |
7492 | ||
7493 | /* If the template has a deduced return type, don't expose it to | |
7494 | template argument deduction. */ | |
7495 | if (undeduced_auto_decl (fn)) | |
7496 | ret = NULL_TREE; | |
7497 | ||
104bf76a | 7498 | /* Try to do argument deduction. */ |
f31c0a32 | 7499 | targs = make_tree_vec (DECL_NTPARMS (fn)); |
cd057e3a | 7500 | instantiation = fn_type_unification (fn, explicit_targs, targs, args, |
79d8a272 | 7501 | nargs, ret, |
cd057e3a | 7502 | DEDUCE_EXACT, LOOKUP_NORMAL, |
2b24855e | 7503 | false, false); |
104bf76a MM |
7504 | if (instantiation == error_mark_node) |
7505 | /* Instantiation failed. */ | |
7506 | continue; | |
7507 | ||
79d8a272 JM |
7508 | /* And now force instantiation to do return type deduction. */ |
7509 | if (undeduced_auto_decl (instantiation)) | |
7510 | { | |
7511 | ++function_depth; | |
7512 | instantiate_decl (instantiation, /*defer*/false, /*class*/false); | |
7513 | --function_depth; | |
7514 | ||
7515 | require_deduced_type (instantiation); | |
7516 | } | |
7517 | ||
104bf76a | 7518 | /* See if there's a match. */ |
7bead48f | 7519 | if (same_type_p (target_fn_type, static_fn_type (instantiation))) |
e1b3e07d | 7520 | matches = tree_cons (instantiation, fn, matches); |
104bf76a MM |
7521 | } |
7522 | ||
7523 | /* Now, remove all but the most specialized of the matches. */ | |
7524 | if (matches) | |
7525 | { | |
e5214479 | 7526 | tree match = most_specialized_instantiation (matches); |
104bf76a MM |
7527 | |
7528 | if (match != error_mark_node) | |
3db45ab5 MS |
7529 | matches = tree_cons (TREE_PURPOSE (match), |
7530 | NULL_TREE, | |
7ca383e6 | 7531 | NULL_TREE); |
104bf76a MM |
7532 | } |
7533 | } | |
7534 | ||
7535 | /* Now we should have exactly one function in MATCHES. */ | |
7536 | if (matches == NULL_TREE) | |
7537 | { | |
7538 | /* There were *no* matches. */ | |
92af500d | 7539 | if (flags & tf_error) |
104bf76a | 7540 | { |
0cbd7506 | 7541 | error ("no matches converting function %qD to type %q#T", |
95e20768 | 7542 | DECL_NAME (OVL_CURRENT (overload)), |
0cbd7506 | 7543 | target_type); |
6b9b6b15 | 7544 | |
c224bdc1 | 7545 | print_candidates (overload); |
104bf76a MM |
7546 | } |
7547 | return error_mark_node; | |
2c73f9f5 | 7548 | } |
104bf76a MM |
7549 | else if (TREE_CHAIN (matches)) |
7550 | { | |
e04c614e JM |
7551 | /* There were too many matches. First check if they're all |
7552 | the same function. */ | |
3649b9b7 | 7553 | tree match = NULL_TREE; |
104bf76a | 7554 | |
e04c614e | 7555 | fn = TREE_PURPOSE (matches); |
3649b9b7 | 7556 | |
beb42d20 ST |
7557 | /* For multi-versioned functions, more than one match is just fine and |
7558 | decls_match will return false as they are different. */ | |
7559 | for (match = TREE_CHAIN (matches); match; match = TREE_CHAIN (match)) | |
7560 | if (!decls_match (fn, TREE_PURPOSE (match)) | |
7561 | && !targetm.target_option.function_versions | |
7562 | (fn, TREE_PURPOSE (match))) | |
7563 | break; | |
e04c614e JM |
7564 | |
7565 | if (match) | |
104bf76a | 7566 | { |
e04c614e JM |
7567 | if (flags & tf_error) |
7568 | { | |
7569 | error ("converting overloaded function %qD to type %q#T is ambiguous", | |
7570 | DECL_NAME (OVL_FUNCTION (overload)), | |
7571 | target_type); | |
104bf76a | 7572 | |
e04c614e JM |
7573 | /* Since print_candidates expects the functions in the |
7574 | TREE_VALUE slot, we flip them here. */ | |
7575 | for (match = matches; match; match = TREE_CHAIN (match)) | |
7576 | TREE_VALUE (match) = TREE_PURPOSE (match); | |
104bf76a | 7577 | |
e04c614e JM |
7578 | print_candidates (matches); |
7579 | } | |
104bf76a | 7580 | |
e04c614e | 7581 | return error_mark_node; |
104bf76a | 7582 | } |
104bf76a MM |
7583 | } |
7584 | ||
50714e79 MM |
7585 | /* Good, exactly one match. Now, convert it to the correct type. */ |
7586 | fn = TREE_PURPOSE (matches); | |
7587 | ||
b1ce3eb2 | 7588 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
92af500d | 7589 | && !(flags & tf_ptrmem_ok) && !flag_ms_extensions) |
19420d00 | 7590 | { |
b1ce3eb2 | 7591 | static int explained; |
c8094d83 | 7592 | |
92af500d | 7593 | if (!(flags & tf_error)) |
0cbd7506 | 7594 | return error_mark_node; |
19420d00 | 7595 | |
cbe5f3b3 | 7596 | permerror (input_location, "assuming pointer to member %qD", fn); |
b1ce3eb2 | 7597 | if (!explained) |
0cbd7506 | 7598 | { |
1f5b3869 | 7599 | inform (input_location, "(a pointer to member can only be formed with %<&%E%>)", fn); |
0cbd7506 MS |
7600 | explained = 1; |
7601 | } | |
19420d00 | 7602 | } |
84583208 | 7603 | |
3649b9b7 ST |
7604 | /* If a pointer to a function that is multi-versioned is requested, the |
7605 | pointer to the dispatcher function is returned instead. This works | |
7606 | well because indirectly calling the function will dispatch the right | |
7607 | function version at run-time. */ | |
7608 | if (DECL_FUNCTION_VERSIONED (fn)) | |
7609 | { | |
beb42d20 ST |
7610 | fn = get_function_version_dispatcher (fn); |
7611 | if (fn == NULL) | |
7612 | return error_mark_node; | |
3649b9b7 ST |
7613 | /* Mark all the versions corresponding to the dispatcher as used. */ |
7614 | if (!(flags & tf_conv)) | |
7615 | mark_versions_used (fn); | |
7616 | } | |
7617 | ||
84583208 MM |
7618 | /* If we're doing overload resolution purely for the purpose of |
7619 | determining conversion sequences, we should not consider the | |
7620 | function used. If this conversion sequence is selected, the | |
7621 | function will be marked as used at this point. */ | |
7622 | if (!(flags & tf_conv)) | |
eff3a276 | 7623 | { |
4ad610c9 JM |
7624 | /* Make =delete work with SFINAE. */ |
7625 | if (DECL_DELETED_FN (fn) && !(flags & tf_error)) | |
7626 | return error_mark_node; | |
7627 | ||
eff3a276 | 7628 | mark_used (fn); |
248e1b22 MM |
7629 | } |
7630 | ||
7631 | /* We could not check access to member functions when this | |
7632 | expression was originally created since we did not know at that | |
7633 | time to which function the expression referred. */ | |
5e7b9f60 | 7634 | if (DECL_FUNCTION_MEMBER_P (fn)) |
248e1b22 MM |
7635 | { |
7636 | gcc_assert (access_path); | |
5e7b9f60 | 7637 | perform_or_defer_access_check (access_path, fn, fn, flags); |
eff3a276 | 7638 | } |
a6ecf8b6 | 7639 | |
50714e79 | 7640 | if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type)) |
93c0e0bb | 7641 | return cp_build_addr_expr (fn, flags); |
50714e79 MM |
7642 | else |
7643 | { | |
5ade1ed2 | 7644 | /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op |
50714e79 MM |
7645 | will mark the function as addressed, but here we must do it |
7646 | explicitly. */ | |
dffd7eb6 | 7647 | cxx_mark_addressable (fn); |
50714e79 MM |
7648 | |
7649 | return fn; | |
7650 | } | |
2c73f9f5 ML |
7651 | } |
7652 | ||
ec255269 MS |
7653 | /* This function will instantiate the type of the expression given in |
7654 | RHS to match the type of LHSTYPE. If errors exist, then return | |
92af500d | 7655 | error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then |
5e76004e NS |
7656 | we complain on errors. If we are not complaining, never modify rhs, |
7657 | as overload resolution wants to try many possible instantiations, in | |
7658 | the hope that at least one will work. | |
c8094d83 | 7659 | |
e6e174e5 JM |
7660 | For non-recursive calls, LHSTYPE should be a function, pointer to |
7661 | function, or a pointer to member function. */ | |
e92cc029 | 7662 | |
8d08fdba | 7663 | tree |
94edc4ab | 7664 | instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags) |
8d08fdba | 7665 | { |
92af500d | 7666 | tsubst_flags_t flags_in = flags; |
eff3a276 | 7667 | tree access_path = NULL_TREE; |
c8094d83 | 7668 | |
c2ea3a40 | 7669 | flags &= ~tf_ptrmem_ok; |
c8094d83 | 7670 | |
fbfc8363 | 7671 | if (lhstype == unknown_type_node) |
8d08fdba | 7672 | { |
92af500d | 7673 | if (flags & tf_error) |
8251199e | 7674 | error ("not enough type information"); |
8d08fdba MS |
7675 | return error_mark_node; |
7676 | } | |
7677 | ||
7678 | if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs))) | |
abff8e06 | 7679 | { |
6721db5d JM |
7680 | tree fntype = non_reference (lhstype); |
7681 | if (same_type_p (fntype, TREE_TYPE (rhs))) | |
abff8e06 | 7682 | return rhs; |
c8094d83 | 7683 | if (flag_ms_extensions |
6721db5d | 7684 | && TYPE_PTRMEMFUNC_P (fntype) |
a723baf1 MM |
7685 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs))) |
7686 | /* Microsoft allows `A::f' to be resolved to a | |
7687 | pointer-to-member. */ | |
7688 | ; | |
7689 | else | |
7690 | { | |
92af500d | 7691 | if (flags & tf_error) |
c3c1f2b7 | 7692 | error ("cannot convert %qE from type %qT to type %qT", |
6721db5d | 7693 | rhs, TREE_TYPE (rhs), fntype); |
a723baf1 MM |
7694 | return error_mark_node; |
7695 | } | |
abff8e06 | 7696 | } |
8d08fdba | 7697 | |
c5ce25ce | 7698 | if (BASELINK_P (rhs)) |
eff3a276 MM |
7699 | { |
7700 | access_path = BASELINK_ACCESS_BINFO (rhs); | |
7701 | rhs = BASELINK_FUNCTIONS (rhs); | |
7702 | } | |
50ad9642 | 7703 | |
5ae9ba3e MM |
7704 | /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot |
7705 | deduce any type information. */ | |
7706 | if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR) | |
7707 | { | |
7708 | if (flags & tf_error) | |
7709 | error ("not enough type information"); | |
7710 | return error_mark_node; | |
7711 | } | |
7712 | ||
eff3a276 MM |
7713 | /* There only a few kinds of expressions that may have a type |
7714 | dependent on overload resolution. */ | |
7715 | gcc_assert (TREE_CODE (rhs) == ADDR_EXPR | |
7716 | || TREE_CODE (rhs) == COMPONENT_REF | |
3f3fd87d | 7717 | || is_overloaded_fn (rhs) |
95e20768 | 7718 | || (flag_ms_extensions && TREE_CODE (rhs) == FUNCTION_DECL)); |
c73964b2 | 7719 | |
8d08fdba MS |
7720 | /* This should really only be used when attempting to distinguish |
7721 | what sort of a pointer to function we have. For now, any | |
7722 | arithmetic operation which is not supported on pointers | |
7723 | is rejected as an error. */ | |
7724 | ||
7725 | switch (TREE_CODE (rhs)) | |
7726 | { | |
8d08fdba | 7727 | case COMPONENT_REF: |
92af500d | 7728 | { |
5ae9ba3e | 7729 | tree member = TREE_OPERAND (rhs, 1); |
92af500d | 7730 | |
5ae9ba3e MM |
7731 | member = instantiate_type (lhstype, member, flags); |
7732 | if (member != error_mark_node | |
92af500d | 7733 | && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0))) |
04c06002 | 7734 | /* Do not lose object's side effects. */ |
5ae9ba3e MM |
7735 | return build2 (COMPOUND_EXPR, TREE_TYPE (member), |
7736 | TREE_OPERAND (rhs, 0), member); | |
7737 | return member; | |
92af500d | 7738 | } |
8d08fdba | 7739 | |
2a238a97 | 7740 | case OFFSET_REF: |
05e0b2f4 JM |
7741 | rhs = TREE_OPERAND (rhs, 1); |
7742 | if (BASELINK_P (rhs)) | |
eff3a276 | 7743 | return instantiate_type (lhstype, rhs, flags_in); |
05e0b2f4 | 7744 | |
2a238a97 MM |
7745 | /* This can happen if we are forming a pointer-to-member for a |
7746 | member template. */ | |
50bc768d | 7747 | gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR); |
05e0b2f4 | 7748 | |
2a238a97 | 7749 | /* Fall through. */ |
874503bc | 7750 | |
386b8a85 | 7751 | case TEMPLATE_ID_EXPR: |
2bdb0643 JM |
7752 | { |
7753 | tree fns = TREE_OPERAND (rhs, 0); | |
7754 | tree args = TREE_OPERAND (rhs, 1); | |
7755 | ||
19420d00 | 7756 | return |
92af500d NS |
7757 | resolve_address_of_overloaded_function (lhstype, fns, flags_in, |
7758 | /*template_only=*/true, | |
eff3a276 | 7759 | args, access_path); |
2bdb0643 | 7760 | } |
386b8a85 | 7761 | |
2c73f9f5 | 7762 | case OVERLOAD: |
a723baf1 | 7763 | case FUNCTION_DECL: |
c8094d83 | 7764 | return |
92af500d NS |
7765 | resolve_address_of_overloaded_function (lhstype, rhs, flags_in, |
7766 | /*template_only=*/false, | |
eff3a276 MM |
7767 | /*explicit_targs=*/NULL_TREE, |
7768 | access_path); | |
2c73f9f5 | 7769 | |
ca36f057 | 7770 | case ADDR_EXPR: |
19420d00 NS |
7771 | { |
7772 | if (PTRMEM_OK_P (rhs)) | |
0cbd7506 | 7773 | flags |= tf_ptrmem_ok; |
c8094d83 | 7774 | |
ca36f057 | 7775 | return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags); |
19420d00 | 7776 | } |
ca36f057 MM |
7777 | |
7778 | case ERROR_MARK: | |
7779 | return error_mark_node; | |
7780 | ||
7781 | default: | |
8dc2b103 | 7782 | gcc_unreachable (); |
ca36f057 | 7783 | } |
8dc2b103 | 7784 | return error_mark_node; |
ca36f057 MM |
7785 | } |
7786 | \f | |
7787 | /* Return the name of the virtual function pointer field | |
7788 | (as an IDENTIFIER_NODE) for the given TYPE. Note that | |
7789 | this may have to look back through base types to find the | |
7790 | ultimate field name. (For single inheritance, these could | |
7791 | all be the same name. Who knows for multiple inheritance). */ | |
7792 | ||
7793 | static tree | |
94edc4ab | 7794 | get_vfield_name (tree type) |
ca36f057 | 7795 | { |
37a247a0 | 7796 | tree binfo, base_binfo; |
ca36f057 MM |
7797 | char *buf; |
7798 | ||
37a247a0 | 7799 | for (binfo = TYPE_BINFO (type); |
fa743e8c | 7800 | BINFO_N_BASE_BINFOS (binfo); |
37a247a0 NS |
7801 | binfo = base_binfo) |
7802 | { | |
7803 | base_binfo = BINFO_BASE_BINFO (binfo, 0); | |
ca36f057 | 7804 | |
37a247a0 NS |
7805 | if (BINFO_VIRTUAL_P (base_binfo) |
7806 | || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo))) | |
7807 | break; | |
7808 | } | |
c8094d83 | 7809 | |
ca36f057 | 7810 | type = BINFO_TYPE (binfo); |
67f5655f | 7811 | buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT) |
3db45ab5 | 7812 | + TYPE_NAME_LENGTH (type) + 2); |
ea122333 JM |
7813 | sprintf (buf, VFIELD_NAME_FORMAT, |
7814 | IDENTIFIER_POINTER (constructor_name (type))); | |
ca36f057 MM |
7815 | return get_identifier (buf); |
7816 | } | |
7817 | ||
7818 | void | |
94edc4ab | 7819 | print_class_statistics (void) |
ca36f057 | 7820 | { |
7aa6d18a SB |
7821 | if (! GATHER_STATISTICS) |
7822 | return; | |
7823 | ||
ca36f057 MM |
7824 | fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness); |
7825 | fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs); | |
ca36f057 MM |
7826 | if (n_vtables) |
7827 | { | |
7828 | fprintf (stderr, "vtables = %d; vtable searches = %d\n", | |
7829 | n_vtables, n_vtable_searches); | |
7830 | fprintf (stderr, "vtable entries = %d; vtable elems = %d\n", | |
7831 | n_vtable_entries, n_vtable_elems); | |
7832 | } | |
ca36f057 MM |
7833 | } |
7834 | ||
7835 | /* Build a dummy reference to ourselves so Derived::Base (and A::A) works, | |
7836 | according to [class]: | |
0cbd7506 | 7837 | The class-name is also inserted |
ca36f057 MM |
7838 | into the scope of the class itself. For purposes of access checking, |
7839 | the inserted class name is treated as if it were a public member name. */ | |
7840 | ||
7841 | void | |
94edc4ab | 7842 | build_self_reference (void) |
ca36f057 MM |
7843 | { |
7844 | tree name = constructor_name (current_class_type); | |
7845 | tree value = build_lang_decl (TYPE_DECL, name, current_class_type); | |
7846 | tree saved_cas; | |
7847 | ||
7848 | DECL_NONLOCAL (value) = 1; | |
7849 | DECL_CONTEXT (value) = current_class_type; | |
7850 | DECL_ARTIFICIAL (value) = 1; | |
a3d87771 | 7851 | SET_DECL_SELF_REFERENCE_P (value); |
6f1abb06 | 7852 | set_underlying_type (value); |
ca36f057 MM |
7853 | |
7854 | if (processing_template_decl) | |
7855 | value = push_template_decl (value); | |
7856 | ||
7857 | saved_cas = current_access_specifier; | |
7858 | current_access_specifier = access_public_node; | |
7859 | finish_member_declaration (value); | |
7860 | current_access_specifier = saved_cas; | |
7861 | } | |
7862 | ||
7863 | /* Returns 1 if TYPE contains only padding bytes. */ | |
7864 | ||
7865 | int | |
94edc4ab | 7866 | is_empty_class (tree type) |
ca36f057 | 7867 | { |
ca36f057 MM |
7868 | if (type == error_mark_node) |
7869 | return 0; | |
7870 | ||
2588c9e9 | 7871 | if (! CLASS_TYPE_P (type)) |
ca36f057 MM |
7872 | return 0; |
7873 | ||
58731fd1 MM |
7874 | /* In G++ 3.2, whether or not a class was empty was determined by |
7875 | looking at its size. */ | |
7876 | if (abi_version_at_least (2)) | |
7877 | return CLASSTYPE_EMPTY_P (type); | |
7878 | else | |
7879 | return integer_zerop (CLASSTYPE_SIZE (type)); | |
ca36f057 MM |
7880 | } |
7881 | ||
956d9305 MM |
7882 | /* Returns true if TYPE contains an empty class. */ |
7883 | ||
7884 | static bool | |
7885 | contains_empty_class_p (tree type) | |
7886 | { | |
7887 | if (is_empty_class (type)) | |
7888 | return true; | |
7889 | if (CLASS_TYPE_P (type)) | |
7890 | { | |
7891 | tree field; | |
fa743e8c NS |
7892 | tree binfo; |
7893 | tree base_binfo; | |
956d9305 MM |
7894 | int i; |
7895 | ||
fa743e8c NS |
7896 | for (binfo = TYPE_BINFO (type), i = 0; |
7897 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7898 | if (contains_empty_class_p (BINFO_TYPE (base_binfo))) | |
956d9305 MM |
7899 | return true; |
7900 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
17bbb839 MM |
7901 | if (TREE_CODE (field) == FIELD_DECL |
7902 | && !DECL_ARTIFICIAL (field) | |
7903 | && is_empty_class (TREE_TYPE (field))) | |
956d9305 MM |
7904 | return true; |
7905 | } | |
7906 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7907 | return contains_empty_class_p (TREE_TYPE (type)); | |
7908 | return false; | |
7909 | } | |
7910 | ||
2588c9e9 | 7911 | /* Returns true if TYPE contains no actual data, just various |
0930cc0e | 7912 | possible combinations of empty classes and possibly a vptr. */ |
2588c9e9 JM |
7913 | |
7914 | bool | |
7915 | is_really_empty_class (tree type) | |
7916 | { | |
2588c9e9 JM |
7917 | if (CLASS_TYPE_P (type)) |
7918 | { | |
7919 | tree field; | |
7920 | tree binfo; | |
7921 | tree base_binfo; | |
7922 | int i; | |
7923 | ||
0930cc0e JM |
7924 | /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid |
7925 | out, but we'd like to be able to check this before then. */ | |
7926 | if (COMPLETE_TYPE_P (type) && is_empty_class (type)) | |
7927 | return true; | |
7928 | ||
2588c9e9 JM |
7929 | for (binfo = TYPE_BINFO (type), i = 0; |
7930 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7931 | if (!is_really_empty_class (BINFO_TYPE (base_binfo))) | |
7932 | return false; | |
910ad8de | 7933 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
2588c9e9 JM |
7934 | if (TREE_CODE (field) == FIELD_DECL |
7935 | && !DECL_ARTIFICIAL (field) | |
7936 | && !is_really_empty_class (TREE_TYPE (field))) | |
7937 | return false; | |
7938 | return true; | |
7939 | } | |
7940 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7941 | return is_really_empty_class (TREE_TYPE (type)); | |
7942 | return false; | |
7943 | } | |
7944 | ||
ca36f057 MM |
7945 | /* Note that NAME was looked up while the current class was being |
7946 | defined and that the result of that lookup was DECL. */ | |
7947 | ||
7948 | void | |
94edc4ab | 7949 | maybe_note_name_used_in_class (tree name, tree decl) |
ca36f057 MM |
7950 | { |
7951 | splay_tree names_used; | |
7952 | ||
7953 | /* If we're not defining a class, there's nothing to do. */ | |
39fb05d0 | 7954 | if (!(innermost_scope_kind() == sk_class |
d5f4eddd JM |
7955 | && TYPE_BEING_DEFINED (current_class_type) |
7956 | && !LAMBDA_TYPE_P (current_class_type))) | |
ca36f057 | 7957 | return; |
c8094d83 | 7958 | |
ca36f057 MM |
7959 | /* If there's already a binding for this NAME, then we don't have |
7960 | anything to worry about. */ | |
c8094d83 | 7961 | if (lookup_member (current_class_type, name, |
db422ace | 7962 | /*protect=*/0, /*want_type=*/false, tf_warning_or_error)) |
ca36f057 MM |
7963 | return; |
7964 | ||
7965 | if (!current_class_stack[current_class_depth - 1].names_used) | |
7966 | current_class_stack[current_class_depth - 1].names_used | |
7967 | = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
7968 | names_used = current_class_stack[current_class_depth - 1].names_used; | |
7969 | ||
7970 | splay_tree_insert (names_used, | |
c8094d83 | 7971 | (splay_tree_key) name, |
ca36f057 MM |
7972 | (splay_tree_value) decl); |
7973 | } | |
7974 | ||
7975 | /* Note that NAME was declared (as DECL) in the current class. Check | |
0e339752 | 7976 | to see that the declaration is valid. */ |
ca36f057 MM |
7977 | |
7978 | void | |
94edc4ab | 7979 | note_name_declared_in_class (tree name, tree decl) |
ca36f057 MM |
7980 | { |
7981 | splay_tree names_used; | |
7982 | splay_tree_node n; | |
7983 | ||
7984 | /* Look to see if we ever used this name. */ | |
c8094d83 | 7985 | names_used |
ca36f057 MM |
7986 | = current_class_stack[current_class_depth - 1].names_used; |
7987 | if (!names_used) | |
7988 | return; | |
8ce1235b KT |
7989 | /* The C language allows members to be declared with a type of the same |
7990 | name, and the C++ standard says this diagnostic is not required. So | |
7991 | allow it in extern "C" blocks unless predantic is specified. | |
7992 | Allow it in all cases if -ms-extensions is specified. */ | |
7993 | if ((!pedantic && current_lang_name == lang_name_c) | |
7994 | || flag_ms_extensions) | |
7995 | return; | |
ca36f057 MM |
7996 | n = splay_tree_lookup (names_used, (splay_tree_key) name); |
7997 | if (n) | |
7998 | { | |
7999 | /* [basic.scope.class] | |
c8094d83 | 8000 | |
ca36f057 MM |
8001 | A name N used in a class S shall refer to the same declaration |
8002 | in its context and when re-evaluated in the completed scope of | |
8003 | S. */ | |
cbe5f3b3 MLI |
8004 | permerror (input_location, "declaration of %q#D", decl); |
8005 | permerror (input_location, "changes meaning of %qD from %q+#D", | |
2ae2031e | 8006 | DECL_NAME (OVL_CURRENT (decl)), (tree) n->value); |
ca36f057 MM |
8007 | } |
8008 | } | |
8009 | ||
3461fba7 NS |
8010 | /* Returns the VAR_DECL for the complete vtable associated with BINFO. |
8011 | Secondary vtables are merged with primary vtables; this function | |
8012 | will return the VAR_DECL for the primary vtable. */ | |
ca36f057 | 8013 | |
c35cce41 | 8014 | tree |
94edc4ab | 8015 | get_vtbl_decl_for_binfo (tree binfo) |
c35cce41 MM |
8016 | { |
8017 | tree decl; | |
8018 | ||
8019 | decl = BINFO_VTABLE (binfo); | |
5be014d5 | 8020 | if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR) |
c35cce41 | 8021 | { |
50bc768d | 8022 | gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR); |
c35cce41 MM |
8023 | decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0); |
8024 | } | |
8025 | if (decl) | |
5a6ccc94 | 8026 | gcc_assert (VAR_P (decl)); |
c35cce41 MM |
8027 | return decl; |
8028 | } | |
8029 | ||
911a71a7 | 8030 | |
dbbf88d1 NS |
8031 | /* Returns the binfo for the primary base of BINFO. If the resulting |
8032 | BINFO is a virtual base, and it is inherited elsewhere in the | |
8033 | hierarchy, then the returned binfo might not be the primary base of | |
8034 | BINFO in the complete object. Check BINFO_PRIMARY_P or | |
8035 | BINFO_LOST_PRIMARY_P to be sure. */ | |
911a71a7 | 8036 | |
b5791fdc | 8037 | static tree |
94edc4ab | 8038 | get_primary_binfo (tree binfo) |
911a71a7 MM |
8039 | { |
8040 | tree primary_base; | |
c8094d83 | 8041 | |
911a71a7 MM |
8042 | primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo)); |
8043 | if (!primary_base) | |
8044 | return NULL_TREE; | |
8045 | ||
b5791fdc | 8046 | return copied_binfo (primary_base, binfo); |
911a71a7 MM |
8047 | } |
8048 | ||
838dfd8a | 8049 | /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */ |
b7442fb5 NS |
8050 | |
8051 | static int | |
94edc4ab | 8052 | maybe_indent_hierarchy (FILE * stream, int indent, int indented_p) |
b7442fb5 NS |
8053 | { |
8054 | if (!indented_p) | |
8055 | fprintf (stream, "%*s", indent, ""); | |
8056 | return 1; | |
8057 | } | |
8058 | ||
dbbf88d1 NS |
8059 | /* Dump the offsets of all the bases rooted at BINFO to STREAM. |
8060 | INDENT should be zero when called from the top level; it is | |
8061 | incremented recursively. IGO indicates the next expected BINFO in | |
9bcb9aae | 8062 | inheritance graph ordering. */ |
c35cce41 | 8063 | |
dbbf88d1 NS |
8064 | static tree |
8065 | dump_class_hierarchy_r (FILE *stream, | |
0cbd7506 MS |
8066 | int flags, |
8067 | tree binfo, | |
8068 | tree igo, | |
8069 | int indent) | |
ca36f057 | 8070 | { |
b7442fb5 | 8071 | int indented = 0; |
fa743e8c NS |
8072 | tree base_binfo; |
8073 | int i; | |
c8094d83 | 8074 | |
b7442fb5 | 8075 | indented = maybe_indent_hierarchy (stream, indent, 0); |
6c5bf58a | 8076 | fprintf (stream, "%s (0x" HOST_WIDE_INT_PRINT_HEX ") ", |
fc6633e0 | 8077 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER), |
6c5bf58a | 8078 | (HOST_WIDE_INT) (uintptr_t) binfo); |
dbbf88d1 NS |
8079 | if (binfo != igo) |
8080 | { | |
8081 | fprintf (stream, "alternative-path\n"); | |
8082 | return igo; | |
8083 | } | |
8084 | igo = TREE_CHAIN (binfo); | |
c8094d83 | 8085 | |
9965d119 | 8086 | fprintf (stream, HOST_WIDE_INT_PRINT_DEC, |
9439e9a1 | 8087 | tree_to_shwi (BINFO_OFFSET (binfo))); |
9965d119 NS |
8088 | if (is_empty_class (BINFO_TYPE (binfo))) |
8089 | fprintf (stream, " empty"); | |
8090 | else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo))) | |
8091 | fprintf (stream, " nearly-empty"); | |
809e3e7f | 8092 | if (BINFO_VIRTUAL_P (binfo)) |
dbbf88d1 | 8093 | fprintf (stream, " virtual"); |
9965d119 | 8094 | fprintf (stream, "\n"); |
ca36f057 | 8095 | |
b7442fb5 | 8096 | indented = 0; |
fc6633e0 | 8097 | if (BINFO_PRIMARY_P (binfo)) |
b7442fb5 NS |
8098 | { |
8099 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
6c5bf58a | 8100 | fprintf (stream, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX ")", |
fc6633e0 | 8101 | type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)), |
b7442fb5 | 8102 | TFF_PLAIN_IDENTIFIER), |
6c5bf58a | 8103 | (HOST_WIDE_INT) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo)); |
b7442fb5 NS |
8104 | } |
8105 | if (BINFO_LOST_PRIMARY_P (binfo)) | |
8106 | { | |
8107 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8108 | fprintf (stream, " lost-primary"); | |
8109 | } | |
8110 | if (indented) | |
8111 | fprintf (stream, "\n"); | |
8112 | ||
8113 | if (!(flags & TDF_SLIM)) | |
8114 | { | |
8115 | int indented = 0; | |
c8094d83 | 8116 | |
b7442fb5 NS |
8117 | if (BINFO_SUBVTT_INDEX (binfo)) |
8118 | { | |
8119 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8120 | fprintf (stream, " subvttidx=%s", | |
8121 | expr_as_string (BINFO_SUBVTT_INDEX (binfo), | |
8122 | TFF_PLAIN_IDENTIFIER)); | |
8123 | } | |
8124 | if (BINFO_VPTR_INDEX (binfo)) | |
8125 | { | |
8126 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8127 | fprintf (stream, " vptridx=%s", | |
8128 | expr_as_string (BINFO_VPTR_INDEX (binfo), | |
8129 | TFF_PLAIN_IDENTIFIER)); | |
8130 | } | |
8131 | if (BINFO_VPTR_FIELD (binfo)) | |
8132 | { | |
8133 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8134 | fprintf (stream, " vbaseoffset=%s", | |
8135 | expr_as_string (BINFO_VPTR_FIELD (binfo), | |
8136 | TFF_PLAIN_IDENTIFIER)); | |
8137 | } | |
8138 | if (BINFO_VTABLE (binfo)) | |
8139 | { | |
8140 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8141 | fprintf (stream, " vptr=%s", | |
8142 | expr_as_string (BINFO_VTABLE (binfo), | |
8143 | TFF_PLAIN_IDENTIFIER)); | |
8144 | } | |
c8094d83 | 8145 | |
b7442fb5 NS |
8146 | if (indented) |
8147 | fprintf (stream, "\n"); | |
8148 | } | |
dbbf88d1 | 8149 | |
fa743e8c NS |
8150 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
8151 | igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2); | |
c8094d83 | 8152 | |
dbbf88d1 | 8153 | return igo; |
c35cce41 MM |
8154 | } |
8155 | ||
8156 | /* Dump the BINFO hierarchy for T. */ | |
8157 | ||
b7442fb5 | 8158 | static void |
bb885938 | 8159 | dump_class_hierarchy_1 (FILE *stream, int flags, tree t) |
c35cce41 | 8160 | { |
b7442fb5 NS |
8161 | fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
8162 | fprintf (stream, " size=%lu align=%lu\n", | |
9439e9a1 | 8163 | (unsigned long)(tree_to_shwi (TYPE_SIZE (t)) / BITS_PER_UNIT), |
b7442fb5 | 8164 | (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT)); |
dbbf88d1 | 8165 | fprintf (stream, " base size=%lu base align=%lu\n", |
9439e9a1 | 8166 | (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t))) |
dbbf88d1 NS |
8167 | / BITS_PER_UNIT), |
8168 | (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t)) | |
8169 | / BITS_PER_UNIT)); | |
8170 | dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0); | |
b7442fb5 | 8171 | fprintf (stream, "\n"); |
bb885938 NS |
8172 | } |
8173 | ||
da1d7781 | 8174 | /* Debug interface to hierarchy dumping. */ |
bb885938 | 8175 | |
ac1f3b7e | 8176 | void |
bb885938 NS |
8177 | debug_class (tree t) |
8178 | { | |
8179 | dump_class_hierarchy_1 (stderr, TDF_SLIM, t); | |
8180 | } | |
8181 | ||
8182 | static void | |
8183 | dump_class_hierarchy (tree t) | |
8184 | { | |
8185 | int flags; | |
8186 | FILE *stream = dump_begin (TDI_class, &flags); | |
8187 | ||
8188 | if (stream) | |
8189 | { | |
8190 | dump_class_hierarchy_1 (stream, flags, t); | |
8191 | dump_end (TDI_class, stream); | |
8192 | } | |
b7442fb5 NS |
8193 | } |
8194 | ||
8195 | static void | |
94edc4ab | 8196 | dump_array (FILE * stream, tree decl) |
b7442fb5 | 8197 | { |
4038c495 GB |
8198 | tree value; |
8199 | unsigned HOST_WIDE_INT ix; | |
b7442fb5 NS |
8200 | HOST_WIDE_INT elt; |
8201 | tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl))); | |
8202 | ||
9439e9a1 | 8203 | elt = (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl)))) |
b7442fb5 NS |
8204 | / BITS_PER_UNIT); |
8205 | fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER)); | |
8206 | fprintf (stream, " %s entries", | |
8207 | expr_as_string (size_binop (PLUS_EXPR, size, size_one_node), | |
8208 | TFF_PLAIN_IDENTIFIER)); | |
8209 | fprintf (stream, "\n"); | |
8210 | ||
4038c495 GB |
8211 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)), |
8212 | ix, value) | |
4fdc14ca | 8213 | fprintf (stream, "%-4ld %s\n", (long)(ix * elt), |
4038c495 | 8214 | expr_as_string (value, TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
8215 | } |
8216 | ||
8217 | static void | |
94edc4ab | 8218 | dump_vtable (tree t, tree binfo, tree vtable) |
b7442fb5 NS |
8219 | { |
8220 | int flags; | |
8221 | FILE *stream = dump_begin (TDI_class, &flags); | |
8222 | ||
8223 | if (!stream) | |
8224 | return; | |
8225 | ||
8226 | if (!(flags & TDF_SLIM)) | |
9965d119 | 8227 | { |
b7442fb5 | 8228 | int ctor_vtbl_p = TYPE_BINFO (t) != binfo; |
c8094d83 | 8229 | |
b7442fb5 NS |
8230 | fprintf (stream, "%s for %s", |
8231 | ctor_vtbl_p ? "Construction vtable" : "Vtable", | |
fc6633e0 | 8232 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
8233 | if (ctor_vtbl_p) |
8234 | { | |
809e3e7f | 8235 | if (!BINFO_VIRTUAL_P (binfo)) |
6c5bf58a KT |
8236 | fprintf (stream, " (0x" HOST_WIDE_INT_PRINT_HEX " instance)", |
8237 | (HOST_WIDE_INT) (uintptr_t) binfo); | |
b7442fb5 NS |
8238 | fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
8239 | } | |
8240 | fprintf (stream, "\n"); | |
8241 | dump_array (stream, vtable); | |
8242 | fprintf (stream, "\n"); | |
9965d119 | 8243 | } |
c8094d83 | 8244 | |
b7442fb5 NS |
8245 | dump_end (TDI_class, stream); |
8246 | } | |
8247 | ||
8248 | static void | |
94edc4ab | 8249 | dump_vtt (tree t, tree vtt) |
b7442fb5 NS |
8250 | { |
8251 | int flags; | |
8252 | FILE *stream = dump_begin (TDI_class, &flags); | |
8253 | ||
8254 | if (!stream) | |
8255 | return; | |
8256 | ||
8257 | if (!(flags & TDF_SLIM)) | |
8258 | { | |
8259 | fprintf (stream, "VTT for %s\n", | |
8260 | type_as_string (t, TFF_PLAIN_IDENTIFIER)); | |
8261 | dump_array (stream, vtt); | |
8262 | fprintf (stream, "\n"); | |
8263 | } | |
c8094d83 | 8264 | |
b7442fb5 | 8265 | dump_end (TDI_class, stream); |
ca36f057 MM |
8266 | } |
8267 | ||
bb885938 NS |
8268 | /* Dump a function or thunk and its thunkees. */ |
8269 | ||
8270 | static void | |
8271 | dump_thunk (FILE *stream, int indent, tree thunk) | |
8272 | { | |
8273 | static const char spaces[] = " "; | |
8274 | tree name = DECL_NAME (thunk); | |
8275 | tree thunks; | |
c8094d83 | 8276 | |
bb885938 NS |
8277 | fprintf (stream, "%.*s%p %s %s", indent, spaces, |
8278 | (void *)thunk, | |
8279 | !DECL_THUNK_P (thunk) ? "function" | |
8280 | : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk", | |
8281 | name ? IDENTIFIER_POINTER (name) : "<unset>"); | |
e00853fd | 8282 | if (DECL_THUNK_P (thunk)) |
bb885938 NS |
8283 | { |
8284 | HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk); | |
8285 | tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk); | |
8286 | ||
8287 | fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust); | |
8288 | if (!virtual_adjust) | |
8289 | /*NOP*/; | |
8290 | else if (DECL_THIS_THUNK_P (thunk)) | |
8291 | fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC, | |
9439e9a1 | 8292 | tree_to_shwi (virtual_adjust)); |
bb885938 NS |
8293 | else |
8294 | fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)", | |
9439e9a1 | 8295 | tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust)), |
bb885938 | 8296 | type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE)); |
e00853fd NS |
8297 | if (THUNK_ALIAS (thunk)) |
8298 | fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk)); | |
bb885938 NS |
8299 | } |
8300 | fprintf (stream, "\n"); | |
8301 | for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks)) | |
8302 | dump_thunk (stream, indent + 2, thunks); | |
8303 | } | |
8304 | ||
8305 | /* Dump the thunks for FN. */ | |
8306 | ||
ac1f3b7e | 8307 | void |
bb885938 NS |
8308 | debug_thunks (tree fn) |
8309 | { | |
8310 | dump_thunk (stderr, 0, fn); | |
8311 | } | |
8312 | ||
ca36f057 MM |
8313 | /* Virtual function table initialization. */ |
8314 | ||
8315 | /* Create all the necessary vtables for T and its base classes. */ | |
8316 | ||
8317 | static void | |
94edc4ab | 8318 | finish_vtbls (tree t) |
ca36f057 | 8319 | { |
3461fba7 | 8320 | tree vbase; |
9771b263 | 8321 | vec<constructor_elt, va_gc> *v = NULL; |
9d6a019c | 8322 | tree vtable = BINFO_VTABLE (TYPE_BINFO (t)); |
ca36f057 | 8323 | |
3461fba7 NS |
8324 | /* We lay out the primary and secondary vtables in one contiguous |
8325 | vtable. The primary vtable is first, followed by the non-virtual | |
8326 | secondary vtables in inheritance graph order. */ | |
9d6a019c NF |
8327 | accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t), TYPE_BINFO (t), |
8328 | vtable, t, &v); | |
c8094d83 | 8329 | |
3461fba7 NS |
8330 | /* Then come the virtual bases, also in inheritance graph order. */ |
8331 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) | |
8332 | { | |
809e3e7f | 8333 | if (!BINFO_VIRTUAL_P (vbase)) |
3461fba7 | 8334 | continue; |
9d6a019c | 8335 | accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), vtable, t, &v); |
ff668506 JM |
8336 | } |
8337 | ||
604a3205 | 8338 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
9d6a019c | 8339 | initialize_vtable (TYPE_BINFO (t), v); |
ca36f057 MM |
8340 | } |
8341 | ||
8342 | /* Initialize the vtable for BINFO with the INITS. */ | |
8343 | ||
8344 | static void | |
9771b263 | 8345 | initialize_vtable (tree binfo, vec<constructor_elt, va_gc> *inits) |
ca36f057 | 8346 | { |
ca36f057 MM |
8347 | tree decl; |
8348 | ||
9771b263 | 8349 | layout_vtable_decl (binfo, vec_safe_length (inits)); |
c35cce41 | 8350 | decl = get_vtbl_decl_for_binfo (binfo); |
19c29b2f | 8351 | initialize_artificial_var (decl, inits); |
b7442fb5 | 8352 | dump_vtable (BINFO_TYPE (binfo), binfo, decl); |
23656158 MM |
8353 | } |
8354 | ||
9965d119 NS |
8355 | /* Build the VTT (virtual table table) for T. |
8356 | A class requires a VTT if it has virtual bases. | |
c8094d83 | 8357 | |
9965d119 NS |
8358 | This holds |
8359 | 1 - primary virtual pointer for complete object T | |
90ecce3e JM |
8360 | 2 - secondary VTTs for each direct non-virtual base of T which requires a |
8361 | VTT | |
9965d119 NS |
8362 | 3 - secondary virtual pointers for each direct or indirect base of T which |
8363 | has virtual bases or is reachable via a virtual path from T. | |
8364 | 4 - secondary VTTs for each direct or indirect virtual base of T. | |
c8094d83 | 8365 | |
9965d119 | 8366 | Secondary VTTs look like complete object VTTs without part 4. */ |
23656158 MM |
8367 | |
8368 | static void | |
94edc4ab | 8369 | build_vtt (tree t) |
23656158 | 8370 | { |
23656158 MM |
8371 | tree type; |
8372 | tree vtt; | |
3ec6bad3 | 8373 | tree index; |
9771b263 | 8374 | vec<constructor_elt, va_gc> *inits; |
23656158 | 8375 | |
23656158 | 8376 | /* Build up the initializers for the VTT. */ |
9d6a019c | 8377 | inits = NULL; |
3ec6bad3 | 8378 | index = size_zero_node; |
9965d119 | 8379 | build_vtt_inits (TYPE_BINFO (t), t, &inits, &index); |
23656158 MM |
8380 | |
8381 | /* If we didn't need a VTT, we're done. */ | |
8382 | if (!inits) | |
8383 | return; | |
8384 | ||
8385 | /* Figure out the type of the VTT. */ | |
dcedcddb | 8386 | type = build_array_of_n_type (const_ptr_type_node, |
9771b263 | 8387 | inits->length ()); |
c8094d83 | 8388 | |
23656158 | 8389 | /* Now, build the VTT object itself. */ |
3e355d92 | 8390 | vtt = build_vtable (t, mangle_vtt_for_type (t), type); |
19c29b2f | 8391 | initialize_artificial_var (vtt, inits); |
548502d3 | 8392 | /* Add the VTT to the vtables list. */ |
910ad8de NF |
8393 | DECL_CHAIN (vtt) = DECL_CHAIN (CLASSTYPE_VTABLES (t)); |
8394 | DECL_CHAIN (CLASSTYPE_VTABLES (t)) = vtt; | |
b7442fb5 NS |
8395 | |
8396 | dump_vtt (t, vtt); | |
23656158 MM |
8397 | } |
8398 | ||
13de7ec4 JM |
8399 | /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with |
8400 | PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo, | |
8401 | and CHAIN the vtable pointer for this binfo after construction is | |
00a17e31 | 8402 | complete. VALUE can also be another BINFO, in which case we recurse. */ |
13de7ec4 JM |
8403 | |
8404 | static tree | |
94edc4ab | 8405 | binfo_ctor_vtable (tree binfo) |
13de7ec4 JM |
8406 | { |
8407 | tree vt; | |
8408 | ||
8409 | while (1) | |
8410 | { | |
8411 | vt = BINFO_VTABLE (binfo); | |
8412 | if (TREE_CODE (vt) == TREE_LIST) | |
8413 | vt = TREE_VALUE (vt); | |
95b4aca6 | 8414 | if (TREE_CODE (vt) == TREE_BINFO) |
13de7ec4 JM |
8415 | binfo = vt; |
8416 | else | |
8417 | break; | |
8418 | } | |
8419 | ||
8420 | return vt; | |
8421 | } | |
8422 | ||
a3a0fc7f NS |
8423 | /* Data for secondary VTT initialization. */ |
8424 | typedef struct secondary_vptr_vtt_init_data_s | |
8425 | { | |
8426 | /* Is this the primary VTT? */ | |
8427 | bool top_level_p; | |
8428 | ||
8429 | /* Current index into the VTT. */ | |
8430 | tree index; | |
8431 | ||
9d6a019c | 8432 | /* Vector of initializers built up. */ |
9771b263 | 8433 | vec<constructor_elt, va_gc> *inits; |
a3a0fc7f NS |
8434 | |
8435 | /* The type being constructed by this secondary VTT. */ | |
8436 | tree type_being_constructed; | |
8437 | } secondary_vptr_vtt_init_data; | |
8438 | ||
23656158 | 8439 | /* Recursively build the VTT-initializer for BINFO (which is in the |
9965d119 NS |
8440 | hierarchy dominated by T). INITS points to the end of the initializer |
8441 | list to date. INDEX is the VTT index where the next element will be | |
8442 | replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e. | |
8443 | not a subvtt for some base of T). When that is so, we emit the sub-VTTs | |
8444 | for virtual bases of T. When it is not so, we build the constructor | |
8445 | vtables for the BINFO-in-T variant. */ | |
23656158 | 8446 | |
9d6a019c | 8447 | static void |
9771b263 DN |
8448 | build_vtt_inits (tree binfo, tree t, vec<constructor_elt, va_gc> **inits, |
8449 | tree *index) | |
23656158 MM |
8450 | { |
8451 | int i; | |
8452 | tree b; | |
8453 | tree init; | |
a3a0fc7f | 8454 | secondary_vptr_vtt_init_data data; |
539ed333 | 8455 | int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
23656158 MM |
8456 | |
8457 | /* We only need VTTs for subobjects with virtual bases. */ | |
5775a06a | 8458 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
9d6a019c | 8459 | return; |
23656158 MM |
8460 | |
8461 | /* We need to use a construction vtable if this is not the primary | |
8462 | VTT. */ | |
9965d119 | 8463 | if (!top_level_p) |
3ec6bad3 MM |
8464 | { |
8465 | build_ctor_vtbl_group (binfo, t); | |
8466 | ||
8467 | /* Record the offset in the VTT where this sub-VTT can be found. */ | |
8468 | BINFO_SUBVTT_INDEX (binfo) = *index; | |
8469 | } | |
23656158 MM |
8470 | |
8471 | /* Add the address of the primary vtable for the complete object. */ | |
13de7ec4 | 8472 | init = binfo_ctor_vtable (binfo); |
9d6a019c | 8473 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
9965d119 NS |
8474 | if (top_level_p) |
8475 | { | |
50bc768d | 8476 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
9965d119 NS |
8477 | BINFO_VPTR_INDEX (binfo) = *index; |
8478 | } | |
3ec6bad3 | 8479 | *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node)); |
c8094d83 | 8480 | |
23656158 | 8481 | /* Recursively add the secondary VTTs for non-virtual bases. */ |
fa743e8c NS |
8482 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i) |
8483 | if (!BINFO_VIRTUAL_P (b)) | |
9d6a019c | 8484 | build_vtt_inits (b, t, inits, index); |
c8094d83 | 8485 | |
23656158 | 8486 | /* Add secondary virtual pointers for all subobjects of BINFO with |
9965d119 NS |
8487 | either virtual bases or reachable along a virtual path, except |
8488 | subobjects that are non-virtual primary bases. */ | |
a3a0fc7f NS |
8489 | data.top_level_p = top_level_p; |
8490 | data.index = *index; | |
9d6a019c | 8491 | data.inits = *inits; |
a3a0fc7f | 8492 | data.type_being_constructed = BINFO_TYPE (binfo); |
c8094d83 | 8493 | |
5d5a519f | 8494 | dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data); |
9965d119 | 8495 | |
a3a0fc7f | 8496 | *index = data.index; |
23656158 | 8497 | |
9d6a019c NF |
8498 | /* data.inits might have grown as we added secondary virtual pointers. |
8499 | Make sure our caller knows about the new vector. */ | |
8500 | *inits = data.inits; | |
23656158 | 8501 | |
9965d119 | 8502 | if (top_level_p) |
a3a0fc7f NS |
8503 | /* Add the secondary VTTs for virtual bases in inheritance graph |
8504 | order. */ | |
9ccf6541 MM |
8505 | for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b)) |
8506 | { | |
809e3e7f | 8507 | if (!BINFO_VIRTUAL_P (b)) |
9ccf6541 | 8508 | continue; |
c8094d83 | 8509 | |
9d6a019c | 8510 | build_vtt_inits (b, t, inits, index); |
9ccf6541 | 8511 | } |
a3a0fc7f NS |
8512 | else |
8513 | /* Remove the ctor vtables we created. */ | |
5d5a519f | 8514 | dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo); |
23656158 MM |
8515 | } |
8516 | ||
8df83eae | 8517 | /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base |
a3a0fc7f | 8518 | in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */ |
23656158 MM |
8519 | |
8520 | static tree | |
a3a0fc7f | 8521 | dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_) |
23656158 | 8522 | { |
a3a0fc7f | 8523 | secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_; |
23656158 | 8524 | |
23656158 MM |
8525 | /* We don't care about bases that don't have vtables. */ |
8526 | if (!TYPE_VFIELD (BINFO_TYPE (binfo))) | |
5d5a519f | 8527 | return dfs_skip_bases; |
23656158 | 8528 | |
a3a0fc7f NS |
8529 | /* We're only interested in proper subobjects of the type being |
8530 | constructed. */ | |
539ed333 | 8531 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed)) |
23656158 MM |
8532 | return NULL_TREE; |
8533 | ||
a3a0fc7f NS |
8534 | /* We're only interested in bases with virtual bases or reachable |
8535 | via a virtual path from the type being constructed. */ | |
5d5a519f NS |
8536 | if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
8537 | || binfo_via_virtual (binfo, data->type_being_constructed))) | |
8538 | return dfs_skip_bases; | |
c8094d83 | 8539 | |
5d5a519f NS |
8540 | /* We're not interested in non-virtual primary bases. */ |
8541 | if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo)) | |
db3d8cde | 8542 | return NULL_TREE; |
c8094d83 | 8543 | |
3ec6bad3 | 8544 | /* Record the index where this secondary vptr can be found. */ |
a3a0fc7f | 8545 | if (data->top_level_p) |
9965d119 | 8546 | { |
50bc768d | 8547 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
a3a0fc7f | 8548 | BINFO_VPTR_INDEX (binfo) = data->index; |
3ec6bad3 | 8549 | |
a3a0fc7f NS |
8550 | if (BINFO_VIRTUAL_P (binfo)) |
8551 | { | |
0cbd7506 MS |
8552 | /* It's a primary virtual base, and this is not a |
8553 | construction vtable. Find the base this is primary of in | |
8554 | the inheritance graph, and use that base's vtable | |
8555 | now. */ | |
a3a0fc7f NS |
8556 | while (BINFO_PRIMARY_P (binfo)) |
8557 | binfo = BINFO_INHERITANCE_CHAIN (binfo); | |
8558 | } | |
9965d119 | 8559 | } |
c8094d83 | 8560 | |
a3a0fc7f | 8561 | /* Add the initializer for the secondary vptr itself. */ |
9d6a019c | 8562 | CONSTRUCTOR_APPEND_ELT (data->inits, NULL_TREE, binfo_ctor_vtable (binfo)); |
23656158 | 8563 | |
a3a0fc7f NS |
8564 | /* Advance the vtt index. */ |
8565 | data->index = size_binop (PLUS_EXPR, data->index, | |
8566 | TYPE_SIZE_UNIT (ptr_type_node)); | |
9965d119 | 8567 | |
a3a0fc7f | 8568 | return NULL_TREE; |
9965d119 NS |
8569 | } |
8570 | ||
a3a0fc7f NS |
8571 | /* Called from build_vtt_inits via dfs_walk. After building |
8572 | constructor vtables and generating the sub-vtt from them, we need | |
8573 | to restore the BINFO_VTABLES that were scribbled on. DATA is the | |
8574 | binfo of the base whose sub vtt was generated. */ | |
23656158 MM |
8575 | |
8576 | static tree | |
94edc4ab | 8577 | dfs_fixup_binfo_vtbls (tree binfo, void* data) |
23656158 | 8578 | { |
a3a0fc7f | 8579 | tree vtable = BINFO_VTABLE (binfo); |
23656158 | 8580 | |
5d5a519f NS |
8581 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8582 | /* If this class has no vtable, none of its bases do. */ | |
8583 | return dfs_skip_bases; | |
c8094d83 | 8584 | |
5d5a519f NS |
8585 | if (!vtable) |
8586 | /* This might be a primary base, so have no vtable in this | |
8587 | hierarchy. */ | |
8588 | return NULL_TREE; | |
c8094d83 | 8589 | |
23656158 MM |
8590 | /* If we scribbled the construction vtable vptr into BINFO, clear it |
8591 | out now. */ | |
5d5a519f | 8592 | if (TREE_CODE (vtable) == TREE_LIST |
a3a0fc7f NS |
8593 | && (TREE_PURPOSE (vtable) == (tree) data)) |
8594 | BINFO_VTABLE (binfo) = TREE_CHAIN (vtable); | |
23656158 MM |
8595 | |
8596 | return NULL_TREE; | |
8597 | } | |
8598 | ||
8599 | /* Build the construction vtable group for BINFO which is in the | |
8600 | hierarchy dominated by T. */ | |
8601 | ||
8602 | static void | |
94edc4ab | 8603 | build_ctor_vtbl_group (tree binfo, tree t) |
23656158 | 8604 | { |
23656158 MM |
8605 | tree type; |
8606 | tree vtbl; | |
23656158 | 8607 | tree id; |
9ccf6541 | 8608 | tree vbase; |
9771b263 | 8609 | vec<constructor_elt, va_gc> *v; |
23656158 | 8610 | |
7bdcf888 | 8611 | /* See if we've already created this construction vtable group. */ |
1f84ec23 | 8612 | id = mangle_ctor_vtbl_for_type (t, binfo); |
23656158 MM |
8613 | if (IDENTIFIER_GLOBAL_VALUE (id)) |
8614 | return; | |
8615 | ||
539ed333 | 8616 | gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)); |
23656158 MM |
8617 | /* Build a version of VTBL (with the wrong type) for use in |
8618 | constructing the addresses of secondary vtables in the | |
8619 | construction vtable group. */ | |
459c43ad | 8620 | vtbl = build_vtable (t, id, ptr_type_node); |
505970fc | 8621 | DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1; |
2ee8a2d5 JM |
8622 | /* Don't export construction vtables from shared libraries. Even on |
8623 | targets that don't support hidden visibility, this tells | |
8624 | can_refer_decl_in_current_unit_p not to assume that it's safe to | |
8625 | access from a different compilation unit (bz 54314). */ | |
8626 | DECL_VISIBILITY (vtbl) = VISIBILITY_HIDDEN; | |
8627 | DECL_VISIBILITY_SPECIFIED (vtbl) = true; | |
9d6a019c NF |
8628 | |
8629 | v = NULL; | |
23656158 | 8630 | accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)), |
9d6a019c | 8631 | binfo, vtbl, t, &v); |
9965d119 NS |
8632 | |
8633 | /* Add the vtables for each of our virtual bases using the vbase in T | |
8634 | binfo. */ | |
c8094d83 MS |
8635 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); |
8636 | vbase; | |
9ccf6541 MM |
8637 | vbase = TREE_CHAIN (vbase)) |
8638 | { | |
8639 | tree b; | |
8640 | ||
809e3e7f | 8641 | if (!BINFO_VIRTUAL_P (vbase)) |
9ccf6541 | 8642 | continue; |
dbbf88d1 | 8643 | b = copied_binfo (vbase, binfo); |
c8094d83 | 8644 | |
9d6a019c | 8645 | accumulate_vtbl_inits (b, vbase, binfo, vtbl, t, &v); |
9ccf6541 | 8646 | } |
23656158 MM |
8647 | |
8648 | /* Figure out the type of the construction vtable. */ | |
9771b263 | 8649 | type = build_array_of_n_type (vtable_entry_type, v->length ()); |
8208d7dc | 8650 | layout_type (type); |
23656158 | 8651 | TREE_TYPE (vtbl) = type; |
8208d7dc DJ |
8652 | DECL_SIZE (vtbl) = DECL_SIZE_UNIT (vtbl) = NULL_TREE; |
8653 | layout_decl (vtbl, 0); | |
23656158 MM |
8654 | |
8655 | /* Initialize the construction vtable. */ | |
548502d3 | 8656 | CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl); |
9d6a019c | 8657 | initialize_artificial_var (vtbl, v); |
b7442fb5 | 8658 | dump_vtable (t, binfo, vtbl); |
23656158 MM |
8659 | } |
8660 | ||
9965d119 NS |
8661 | /* Add the vtbl initializers for BINFO (and its bases other than |
8662 | non-virtual primaries) to the list of INITS. BINFO is in the | |
8663 | hierarchy dominated by T. RTTI_BINFO is the binfo within T of | |
8664 | the constructor the vtbl inits should be accumulated for. (If this | |
8665 | is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).) | |
8666 | ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO). | |
8667 | BINFO is the active base equivalent of ORIG_BINFO in the inheritance | |
8668 | graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE, | |
8669 | but are not necessarily the same in terms of layout. */ | |
ca36f057 MM |
8670 | |
8671 | static void | |
94edc4ab | 8672 | accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8673 | tree orig_binfo, |
8674 | tree rtti_binfo, | |
9d6a019c | 8675 | tree vtbl, |
0cbd7506 | 8676 | tree t, |
9771b263 | 8677 | vec<constructor_elt, va_gc> **inits) |
ca36f057 | 8678 | { |
23656158 | 8679 | int i; |
fa743e8c | 8680 | tree base_binfo; |
539ed333 | 8681 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
23656158 | 8682 | |
539ed333 | 8683 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo))); |
23656158 | 8684 | |
00a17e31 | 8685 | /* If it doesn't have a vptr, we don't do anything. */ |
623fe76a NS |
8686 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8687 | return; | |
c8094d83 | 8688 | |
23656158 MM |
8689 | /* If we're building a construction vtable, we're not interested in |
8690 | subobjects that don't require construction vtables. */ | |
c8094d83 | 8691 | if (ctor_vtbl_p |
5775a06a | 8692 | && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
9965d119 | 8693 | && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo))) |
23656158 MM |
8694 | return; |
8695 | ||
8696 | /* Build the initializers for the BINFO-in-T vtable. */ | |
9d6a019c | 8697 | dfs_accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, vtbl, t, inits); |
c8094d83 | 8698 | |
c35cce41 MM |
8699 | /* Walk the BINFO and its bases. We walk in preorder so that as we |
8700 | initialize each vtable we can figure out at what offset the | |
23656158 MM |
8701 | secondary vtable lies from the primary vtable. We can't use |
8702 | dfs_walk here because we need to iterate through bases of BINFO | |
8703 | and RTTI_BINFO simultaneously. */ | |
fa743e8c | 8704 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
23656158 | 8705 | { |
23656158 | 8706 | /* Skip virtual bases. */ |
809e3e7f | 8707 | if (BINFO_VIRTUAL_P (base_binfo)) |
23656158 MM |
8708 | continue; |
8709 | accumulate_vtbl_inits (base_binfo, | |
604a3205 | 8710 | BINFO_BASE_BINFO (orig_binfo, i), |
9d6a019c | 8711 | rtti_binfo, vtbl, t, |
23656158 MM |
8712 | inits); |
8713 | } | |
ca36f057 MM |
8714 | } |
8715 | ||
9d6a019c NF |
8716 | /* Called from accumulate_vtbl_inits. Adds the initializers for the |
8717 | BINFO vtable to L. */ | |
ca36f057 | 8718 | |
9d6a019c | 8719 | static void |
94edc4ab | 8720 | dfs_accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8721 | tree orig_binfo, |
8722 | tree rtti_binfo, | |
9d6a019c | 8723 | tree orig_vtbl, |
0cbd7506 | 8724 | tree t, |
9771b263 | 8725 | vec<constructor_elt, va_gc> **l) |
ca36f057 | 8726 | { |
9965d119 | 8727 | tree vtbl = NULL_TREE; |
539ed333 | 8728 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
9d6a019c | 8729 | int n_inits; |
9965d119 | 8730 | |
13de7ec4 | 8731 | if (ctor_vtbl_p |
809e3e7f | 8732 | && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo)) |
9965d119 | 8733 | { |
13de7ec4 JM |
8734 | /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a |
8735 | primary virtual base. If it is not the same primary in | |
8736 | the hierarchy of T, we'll need to generate a ctor vtable | |
8737 | for it, to place at its location in T. If it is the same | |
8738 | primary, we still need a VTT entry for the vtable, but it | |
8739 | should point to the ctor vtable for the base it is a | |
8740 | primary for within the sub-hierarchy of RTTI_BINFO. | |
c8094d83 | 8741 | |
13de7ec4 | 8742 | There are three possible cases: |
c8094d83 | 8743 | |
13de7ec4 JM |
8744 | 1) We are in the same place. |
8745 | 2) We are a primary base within a lost primary virtual base of | |
8746 | RTTI_BINFO. | |
049d2def | 8747 | 3) We are primary to something not a base of RTTI_BINFO. */ |
c8094d83 | 8748 | |
fc6633e0 | 8749 | tree b; |
13de7ec4 | 8750 | tree last = NULL_TREE; |
85a9a0a2 | 8751 | |
13de7ec4 JM |
8752 | /* First, look through the bases we are primary to for RTTI_BINFO |
8753 | or a virtual base. */ | |
fc6633e0 NS |
8754 | b = binfo; |
8755 | while (BINFO_PRIMARY_P (b)) | |
7bdcf888 | 8756 | { |
fc6633e0 | 8757 | b = BINFO_INHERITANCE_CHAIN (b); |
13de7ec4 | 8758 | last = b; |
809e3e7f | 8759 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) |
fc6633e0 | 8760 | goto found; |
7bdcf888 | 8761 | } |
13de7ec4 JM |
8762 | /* If we run out of primary links, keep looking down our |
8763 | inheritance chain; we might be an indirect primary. */ | |
fc6633e0 NS |
8764 | for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b)) |
8765 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) | |
8766 | break; | |
8767 | found: | |
c8094d83 | 8768 | |
13de7ec4 JM |
8769 | /* If we found RTTI_BINFO, this is case 1. If we found a virtual |
8770 | base B and it is a base of RTTI_BINFO, this is case 2. In | |
8771 | either case, we share our vtable with LAST, i.e. the | |
8772 | derived-most base within B of which we are a primary. */ | |
8773 | if (b == rtti_binfo | |
58c42dc2 | 8774 | || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo)))) |
049d2def JM |
8775 | /* Just set our BINFO_VTABLE to point to LAST, as we may not have |
8776 | set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in | |
8777 | binfo_ctor_vtable after everything's been set up. */ | |
8778 | vtbl = last; | |
13de7ec4 | 8779 | |
049d2def | 8780 | /* Otherwise, this is case 3 and we get our own. */ |
9965d119 | 8781 | } |
dbbf88d1 | 8782 | else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo)) |
9d6a019c NF |
8783 | return; |
8784 | ||
9771b263 | 8785 | n_inits = vec_safe_length (*l); |
7bdcf888 | 8786 | |
9965d119 | 8787 | if (!vtbl) |
ca36f057 | 8788 | { |
c35cce41 MM |
8789 | tree index; |
8790 | int non_fn_entries; | |
8791 | ||
9d6a019c NF |
8792 | /* Add the initializer for this vtable. */ |
8793 | build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo, | |
8794 | &non_fn_entries, l); | |
c35cce41 | 8795 | |
23656158 | 8796 | /* Figure out the position to which the VPTR should point. */ |
9d6a019c | 8797 | vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, orig_vtbl); |
23656158 MM |
8798 | index = size_binop (MULT_EXPR, |
8799 | TYPE_SIZE_UNIT (vtable_entry_type), | |
5d49b6a7 RG |
8800 | size_int (non_fn_entries + n_inits)); |
8801 | vtbl = fold_build_pointer_plus (vtbl, index); | |
9965d119 | 8802 | } |
23656158 | 8803 | |
7bdcf888 | 8804 | if (ctor_vtbl_p) |
9965d119 NS |
8805 | /* For a construction vtable, we can't overwrite BINFO_VTABLE. |
8806 | So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will | |
8807 | straighten this out. */ | |
8808 | BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo)); | |
809e3e7f | 8809 | else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo)) |
9d6a019c | 8810 | /* Throw away any unneeded intializers. */ |
9771b263 | 8811 | (*l)->truncate (n_inits); |
7bdcf888 NS |
8812 | else |
8813 | /* For an ordinary vtable, set BINFO_VTABLE. */ | |
8814 | BINFO_VTABLE (binfo) = vtbl; | |
ca36f057 MM |
8815 | } |
8816 | ||
1b746b0f AP |
8817 | static GTY(()) tree abort_fndecl_addr; |
8818 | ||
90ecce3e | 8819 | /* Construct the initializer for BINFO's virtual function table. BINFO |
aabb4cd6 | 8820 | is part of the hierarchy dominated by T. If we're building a |
23656158 | 8821 | construction vtable, the ORIG_BINFO is the binfo we should use to |
9965d119 NS |
8822 | find the actual function pointers to put in the vtable - but they |
8823 | can be overridden on the path to most-derived in the graph that | |
8824 | ORIG_BINFO belongs. Otherwise, | |
911a71a7 | 8825 | ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the |
23656158 MM |
8826 | BINFO that should be indicated by the RTTI information in the |
8827 | vtable; it will be a base class of T, rather than T itself, if we | |
8828 | are building a construction vtable. | |
aabb4cd6 MM |
8829 | |
8830 | The value returned is a TREE_LIST suitable for wrapping in a | |
8831 | CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If | |
8832 | NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the | |
c8094d83 | 8833 | number of non-function entries in the vtable. |
911a71a7 MM |
8834 | |
8835 | It might seem that this function should never be called with a | |
9965d119 | 8836 | BINFO for which BINFO_PRIMARY_P holds, the vtable for such a |
911a71a7 | 8837 | base is always subsumed by a derived class vtable. However, when |
9965d119 | 8838 | we are building construction vtables, we do build vtables for |
911a71a7 MM |
8839 | primary bases; we need these while the primary base is being |
8840 | constructed. */ | |
ca36f057 | 8841 | |
9d6a019c | 8842 | static void |
94edc4ab | 8843 | build_vtbl_initializer (tree binfo, |
0cbd7506 MS |
8844 | tree orig_binfo, |
8845 | tree t, | |
8846 | tree rtti_binfo, | |
9d6a019c | 8847 | int* non_fn_entries_p, |
9771b263 | 8848 | vec<constructor_elt, va_gc> **inits) |
ca36f057 | 8849 | { |
02dea3ff | 8850 | tree v; |
911a71a7 | 8851 | vtbl_init_data vid; |
9d6a019c | 8852 | unsigned ix, jx; |
58c42dc2 | 8853 | tree vbinfo; |
9771b263 | 8854 | vec<tree, va_gc> *vbases; |
9d6a019c | 8855 | constructor_elt *e; |
c8094d83 | 8856 | |
911a71a7 | 8857 | /* Initialize VID. */ |
961192e1 | 8858 | memset (&vid, 0, sizeof (vid)); |
911a71a7 MM |
8859 | vid.binfo = binfo; |
8860 | vid.derived = t; | |
73ea87d7 | 8861 | vid.rtti_binfo = rtti_binfo; |
539ed333 NS |
8862 | vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
8863 | vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); | |
548502d3 | 8864 | vid.generate_vcall_entries = true; |
c35cce41 | 8865 | /* The first vbase or vcall offset is at index -3 in the vtable. */ |
ce552f75 | 8866 | vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE); |
c35cce41 | 8867 | |
9bab6c90 | 8868 | /* Add entries to the vtable for RTTI. */ |
73ea87d7 | 8869 | build_rtti_vtbl_entries (binfo, &vid); |
9bab6c90 | 8870 | |
b485e15b MM |
8871 | /* Create an array for keeping track of the functions we've |
8872 | processed. When we see multiple functions with the same | |
8873 | signature, we share the vcall offsets. */ | |
9771b263 | 8874 | vec_alloc (vid.fns, 32); |
c35cce41 | 8875 | /* Add the vcall and vbase offset entries. */ |
911a71a7 | 8876 | build_vcall_and_vbase_vtbl_entries (binfo, &vid); |
c8094d83 | 8877 | |
79cda2d1 | 8878 | /* Clear BINFO_VTABLE_PATH_MARKED; it's set by |
c35cce41 | 8879 | build_vbase_offset_vtbl_entries. */ |
9ba5ff0f | 8880 | for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0; |
9771b263 | 8881 | vec_safe_iterate (vbases, ix, &vbinfo); ix++) |
58c42dc2 | 8882 | BINFO_VTABLE_PATH_MARKED (vbinfo) = 0; |
ca36f057 | 8883 | |
a6f5e048 RH |
8884 | /* If the target requires padding between data entries, add that now. */ |
8885 | if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1) | |
8886 | { | |
9771b263 | 8887 | int n_entries = vec_safe_length (vid.inits); |
9d6a019c | 8888 | |
9771b263 | 8889 | vec_safe_grow (vid.inits, TARGET_VTABLE_DATA_ENTRY_DISTANCE * n_entries); |
a6f5e048 | 8890 | |
9d6a019c NF |
8891 | /* Move data entries into their new positions and add padding |
8892 | after the new positions. Iterate backwards so we don't | |
8893 | overwrite entries that we would need to process later. */ | |
8894 | for (ix = n_entries - 1; | |
9771b263 | 8895 | vid.inits->iterate (ix, &e); |
9d6a019c | 8896 | ix--) |
a6f5e048 | 8897 | { |
9d6a019c | 8898 | int j; |
25d8a217 NF |
8899 | int new_position = (TARGET_VTABLE_DATA_ENTRY_DISTANCE * ix |
8900 | + (TARGET_VTABLE_DATA_ENTRY_DISTANCE - 1)); | |
9d6a019c | 8901 | |
9771b263 | 8902 | (*vid.inits)[new_position] = *e; |
a6f5e048 | 8903 | |
9d6a019c NF |
8904 | for (j = 1; j < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++j) |
8905 | { | |
9771b263 | 8906 | constructor_elt *f = &(*vid.inits)[new_position - j]; |
9d6a019c NF |
8907 | f->index = NULL_TREE; |
8908 | f->value = build1 (NOP_EXPR, vtable_entry_type, | |
8909 | null_pointer_node); | |
8910 | } | |
a6f5e048 RH |
8911 | } |
8912 | } | |
8913 | ||
c35cce41 | 8914 | if (non_fn_entries_p) |
9771b263 | 8915 | *non_fn_entries_p = vec_safe_length (vid.inits); |
9d6a019c NF |
8916 | |
8917 | /* The initializers for virtual functions were built up in reverse | |
8918 | order. Straighten them out and add them to the running list in one | |
8919 | step. */ | |
9771b263 DN |
8920 | jx = vec_safe_length (*inits); |
8921 | vec_safe_grow (*inits, jx + vid.inits->length ()); | |
9d6a019c | 8922 | |
9771b263 DN |
8923 | for (ix = vid.inits->length () - 1; |
8924 | vid.inits->iterate (ix, &e); | |
9d6a019c | 8925 | ix--, jx++) |
9771b263 | 8926 | (**inits)[jx] = *e; |
ca36f057 MM |
8927 | |
8928 | /* Go through all the ordinary virtual functions, building up | |
8929 | initializers. */ | |
23656158 | 8930 | for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v)) |
ca36f057 MM |
8931 | { |
8932 | tree delta; | |
8933 | tree vcall_index; | |
4977bab6 | 8934 | tree fn, fn_original; |
f11ee281 | 8935 | tree init = NULL_TREE; |
c8094d83 | 8936 | |
ca36f057 | 8937 | fn = BV_FN (v); |
07fa4878 NS |
8938 | fn_original = fn; |
8939 | if (DECL_THUNK_P (fn)) | |
4977bab6 | 8940 | { |
07fa4878 NS |
8941 | if (!DECL_NAME (fn)) |
8942 | finish_thunk (fn); | |
e00853fd | 8943 | if (THUNK_ALIAS (fn)) |
bb885938 NS |
8944 | { |
8945 | fn = THUNK_ALIAS (fn); | |
8946 | BV_FN (v) = fn; | |
8947 | } | |
07fa4878 | 8948 | fn_original = THUNK_TARGET (fn); |
4977bab6 | 8949 | } |
c8094d83 | 8950 | |
d0cd8b44 JM |
8951 | /* If the only definition of this function signature along our |
8952 | primary base chain is from a lost primary, this vtable slot will | |
8953 | never be used, so just zero it out. This is important to avoid | |
8954 | requiring extra thunks which cannot be generated with the function. | |
8955 | ||
f11ee281 JM |
8956 | We first check this in update_vtable_entry_for_fn, so we handle |
8957 | restored primary bases properly; we also need to do it here so we | |
39a13be5 | 8958 | zero out unused slots in ctor vtables, rather than filling them |
f11ee281 JM |
8959 | with erroneous values (though harmless, apart from relocation |
8960 | costs). */ | |
02dea3ff JM |
8961 | if (BV_LOST_PRIMARY (v)) |
8962 | init = size_zero_node; | |
d0cd8b44 | 8963 | |
f11ee281 JM |
8964 | if (! init) |
8965 | { | |
8966 | /* Pull the offset for `this', and the function to call, out of | |
8967 | the list. */ | |
8968 | delta = BV_DELTA (v); | |
548502d3 | 8969 | vcall_index = BV_VCALL_INDEX (v); |
f11ee281 | 8970 | |
50bc768d NS |
8971 | gcc_assert (TREE_CODE (delta) == INTEGER_CST); |
8972 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
f11ee281 JM |
8973 | |
8974 | /* You can't call an abstract virtual function; it's abstract. | |
8975 | So, we replace these functions with __pure_virtual. */ | |
4977bab6 | 8976 | if (DECL_PURE_VIRTUAL_P (fn_original)) |
4977bab6 | 8977 | { |
1b746b0f | 8978 | fn = abort_fndecl; |
21b6aca3 JJ |
8979 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8980 | { | |
8981 | if (abort_fndecl_addr == NULL) | |
8982 | abort_fndecl_addr | |
8983 | = fold_convert (vfunc_ptr_type_node, | |
8984 | build_fold_addr_expr (fn)); | |
8985 | init = abort_fndecl_addr; | |
8986 | } | |
1b746b0f | 8987 | } |
4ce7d589 JM |
8988 | /* Likewise for deleted virtuals. */ |
8989 | else if (DECL_DELETED_FN (fn_original)) | |
8990 | { | |
8991 | fn = get_identifier ("__cxa_deleted_virtual"); | |
8992 | if (!get_global_value_if_present (fn, &fn)) | |
8993 | fn = push_library_fn (fn, (build_function_type_list | |
8994 | (void_type_node, NULL_TREE)), | |
8595a07d | 8995 | NULL_TREE, ECF_NORETURN); |
4ce7d589 JM |
8996 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8997 | init = fold_convert (vfunc_ptr_type_node, | |
8998 | build_fold_addr_expr (fn)); | |
8999 | } | |
1b746b0f AP |
9000 | else |
9001 | { | |
9002 | if (!integer_zerop (delta) || vcall_index) | |
9003 | { | |
9004 | fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index); | |
9005 | if (!DECL_NAME (fn)) | |
9006 | finish_thunk (fn); | |
9007 | } | |
9008 | /* Take the address of the function, considering it to be of an | |
9009 | appropriate generic type. */ | |
21b6aca3 JJ |
9010 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
9011 | init = fold_convert (vfunc_ptr_type_node, | |
9012 | build_fold_addr_expr (fn)); | |
4977bab6 | 9013 | } |
f11ee281 | 9014 | } |
d0cd8b44 | 9015 | |
ca36f057 | 9016 | /* And add it to the chain of initializers. */ |
67231816 RH |
9017 | if (TARGET_VTABLE_USES_DESCRIPTORS) |
9018 | { | |
9019 | int i; | |
9020 | if (init == size_zero_node) | |
9021 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
9d6a019c | 9022 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
67231816 RH |
9023 | else |
9024 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
9025 | { | |
f293ce4b | 9026 | tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node, |
21b6aca3 | 9027 | fn, build_int_cst (NULL_TREE, i)); |
67231816 RH |
9028 | TREE_CONSTANT (fdesc) = 1; |
9029 | ||
9d6a019c | 9030 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, fdesc); |
67231816 RH |
9031 | } |
9032 | } | |
9033 | else | |
9d6a019c | 9034 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
ca36f057 | 9035 | } |
ca36f057 MM |
9036 | } |
9037 | ||
d0cd8b44 | 9038 | /* Adds to vid->inits the initializers for the vbase and vcall |
c35cce41 | 9039 | offsets in BINFO, which is in the hierarchy dominated by T. */ |
ca36f057 | 9040 | |
c35cce41 | 9041 | static void |
94edc4ab | 9042 | build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 9043 | { |
c35cce41 | 9044 | tree b; |
8d08fdba | 9045 | |
c35cce41 | 9046 | /* If this is a derived class, we must first create entries |
9bab6c90 | 9047 | corresponding to the primary base class. */ |
911a71a7 | 9048 | b = get_primary_binfo (binfo); |
c35cce41 | 9049 | if (b) |
911a71a7 | 9050 | build_vcall_and_vbase_vtbl_entries (b, vid); |
c35cce41 MM |
9051 | |
9052 | /* Add the vbase entries for this base. */ | |
911a71a7 | 9053 | build_vbase_offset_vtbl_entries (binfo, vid); |
c35cce41 | 9054 | /* Add the vcall entries for this base. */ |
911a71a7 | 9055 | build_vcall_offset_vtbl_entries (binfo, vid); |
ca36f057 | 9056 | } |
8d08fdba | 9057 | |
ca36f057 MM |
9058 | /* Returns the initializers for the vbase offset entries in the vtable |
9059 | for BINFO (which is part of the class hierarchy dominated by T), in | |
c35cce41 MM |
9060 | reverse order. VBASE_OFFSET_INDEX gives the vtable index |
9061 | where the next vbase offset will go. */ | |
8d08fdba | 9062 | |
c35cce41 | 9063 | static void |
94edc4ab | 9064 | build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 9065 | { |
c35cce41 MM |
9066 | tree vbase; |
9067 | tree t; | |
90b1ca2f | 9068 | tree non_primary_binfo; |
8d08fdba | 9069 | |
ca36f057 MM |
9070 | /* If there are no virtual baseclasses, then there is nothing to |
9071 | do. */ | |
5775a06a | 9072 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
c35cce41 | 9073 | return; |
ca36f057 | 9074 | |
911a71a7 | 9075 | t = vid->derived; |
c8094d83 | 9076 | |
90b1ca2f NS |
9077 | /* We might be a primary base class. Go up the inheritance hierarchy |
9078 | until we find the most derived class of which we are a primary base: | |
9079 | it is the offset of that which we need to use. */ | |
9080 | non_primary_binfo = binfo; | |
9081 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
9082 | { | |
9083 | tree b; | |
9084 | ||
9085 | /* If we have reached a virtual base, then it must be a primary | |
9086 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
9087 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
9088 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 9089 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
90b1ca2f NS |
9090 | { |
9091 | non_primary_binfo = vid->binfo; | |
9092 | break; | |
9093 | } | |
9094 | ||
9095 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); | |
9096 | if (get_primary_binfo (b) != non_primary_binfo) | |
9097 | break; | |
9098 | non_primary_binfo = b; | |
9099 | } | |
ca36f057 | 9100 | |
c35cce41 MM |
9101 | /* Go through the virtual bases, adding the offsets. */ |
9102 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); | |
9103 | vbase; | |
9104 | vbase = TREE_CHAIN (vbase)) | |
9105 | { | |
9106 | tree b; | |
9107 | tree delta; | |
c8094d83 | 9108 | |
809e3e7f | 9109 | if (!BINFO_VIRTUAL_P (vbase)) |
c35cce41 | 9110 | continue; |
ca36f057 | 9111 | |
c35cce41 MM |
9112 | /* Find the instance of this virtual base in the complete |
9113 | object. */ | |
dbbf88d1 | 9114 | b = copied_binfo (vbase, binfo); |
c35cce41 MM |
9115 | |
9116 | /* If we've already got an offset for this virtual base, we | |
9117 | don't need another one. */ | |
9118 | if (BINFO_VTABLE_PATH_MARKED (b)) | |
9119 | continue; | |
dbbf88d1 | 9120 | BINFO_VTABLE_PATH_MARKED (b) = 1; |
c35cce41 MM |
9121 | |
9122 | /* Figure out where we can find this vbase offset. */ | |
c8094d83 | 9123 | delta = size_binop (MULT_EXPR, |
911a71a7 | 9124 | vid->index, |
c35cce41 MM |
9125 | convert (ssizetype, |
9126 | TYPE_SIZE_UNIT (vtable_entry_type))); | |
911a71a7 | 9127 | if (vid->primary_vtbl_p) |
c35cce41 MM |
9128 | BINFO_VPTR_FIELD (b) = delta; |
9129 | ||
9130 | if (binfo != TYPE_BINFO (t)) | |
50bc768d NS |
9131 | /* The vbase offset had better be the same. */ |
9132 | gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase))); | |
c35cce41 MM |
9133 | |
9134 | /* The next vbase will come at a more negative offset. */ | |
a6f5e048 RH |
9135 | vid->index = size_binop (MINUS_EXPR, vid->index, |
9136 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
c35cce41 MM |
9137 | |
9138 | /* The initializer is the delta from BINFO to this virtual base. | |
4e7512c9 MM |
9139 | The vbase offsets go in reverse inheritance-graph order, and |
9140 | we are walking in inheritance graph order so these end up in | |
9141 | the right order. */ | |
db3927fb AH |
9142 | delta = size_diffop_loc (input_location, |
9143 | BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo)); | |
c8094d83 | 9144 | |
9d6a019c NF |
9145 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, |
9146 | fold_build1_loc (input_location, NOP_EXPR, | |
9147 | vtable_entry_type, delta)); | |
c35cce41 | 9148 | } |
8d08fdba | 9149 | } |
ca36f057 | 9150 | |
b485e15b | 9151 | /* Adds the initializers for the vcall offset entries in the vtable |
d0cd8b44 JM |
9152 | for BINFO (which is part of the class hierarchy dominated by VID->DERIVED) |
9153 | to VID->INITS. */ | |
b485e15b MM |
9154 | |
9155 | static void | |
94edc4ab | 9156 | build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b485e15b | 9157 | { |
548502d3 MM |
9158 | /* We only need these entries if this base is a virtual base. We |
9159 | compute the indices -- but do not add to the vtable -- when | |
9160 | building the main vtable for a class. */ | |
b9302915 MM |
9161 | if (binfo == TYPE_BINFO (vid->derived) |
9162 | || (BINFO_VIRTUAL_P (binfo) | |
9163 | /* If BINFO is RTTI_BINFO, then (since BINFO does not | |
9164 | correspond to VID->DERIVED), we are building a primary | |
9165 | construction virtual table. Since this is a primary | |
9166 | virtual table, we do not need the vcall offsets for | |
9167 | BINFO. */ | |
9168 | && binfo != vid->rtti_binfo)) | |
548502d3 MM |
9169 | { |
9170 | /* We need a vcall offset for each of the virtual functions in this | |
9171 | vtable. For example: | |
b485e15b | 9172 | |
548502d3 MM |
9173 | class A { virtual void f (); }; |
9174 | class B1 : virtual public A { virtual void f (); }; | |
9175 | class B2 : virtual public A { virtual void f (); }; | |
9176 | class C: public B1, public B2 { virtual void f (); }; | |
d0cd8b44 | 9177 | |
548502d3 MM |
9178 | A C object has a primary base of B1, which has a primary base of A. A |
9179 | C also has a secondary base of B2, which no longer has a primary base | |
9180 | of A. So the B2-in-C construction vtable needs a secondary vtable for | |
9181 | A, which will adjust the A* to a B2* to call f. We have no way of | |
9182 | knowing what (or even whether) this offset will be when we define B2, | |
9183 | so we store this "vcall offset" in the A sub-vtable and look it up in | |
9184 | a "virtual thunk" for B2::f. | |
b485e15b | 9185 | |
548502d3 MM |
9186 | We need entries for all the functions in our primary vtable and |
9187 | in our non-virtual bases' secondary vtables. */ | |
9188 | vid->vbase = binfo; | |
9189 | /* If we are just computing the vcall indices -- but do not need | |
9190 | the actual entries -- not that. */ | |
809e3e7f | 9191 | if (!BINFO_VIRTUAL_P (binfo)) |
548502d3 MM |
9192 | vid->generate_vcall_entries = false; |
9193 | /* Now, walk through the non-virtual bases, adding vcall offsets. */ | |
9194 | add_vcall_offset_vtbl_entries_r (binfo, vid); | |
9195 | } | |
b485e15b MM |
9196 | } |
9197 | ||
9198 | /* Build vcall offsets, starting with those for BINFO. */ | |
9199 | ||
9200 | static void | |
94edc4ab | 9201 | add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid) |
b485e15b MM |
9202 | { |
9203 | int i; | |
9204 | tree primary_binfo; | |
fa743e8c | 9205 | tree base_binfo; |
b485e15b MM |
9206 | |
9207 | /* Don't walk into virtual bases -- except, of course, for the | |
d0cd8b44 JM |
9208 | virtual base for which we are building vcall offsets. Any |
9209 | primary virtual base will have already had its offsets generated | |
9210 | through the recursion in build_vcall_and_vbase_vtbl_entries. */ | |
809e3e7f | 9211 | if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo) |
b485e15b | 9212 | return; |
c8094d83 | 9213 | |
b485e15b MM |
9214 | /* If BINFO has a primary base, process it first. */ |
9215 | primary_binfo = get_primary_binfo (binfo); | |
9216 | if (primary_binfo) | |
9217 | add_vcall_offset_vtbl_entries_r (primary_binfo, vid); | |
9218 | ||
9219 | /* Add BINFO itself to the list. */ | |
9220 | add_vcall_offset_vtbl_entries_1 (binfo, vid); | |
9221 | ||
9222 | /* Scan the non-primary bases of BINFO. */ | |
fa743e8c NS |
9223 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
9224 | if (base_binfo != primary_binfo) | |
9225 | add_vcall_offset_vtbl_entries_r (base_binfo, vid); | |
b485e15b MM |
9226 | } |
9227 | ||
9965d119 | 9228 | /* Called from build_vcall_offset_vtbl_entries_r. */ |
e92cc029 | 9229 | |
b485e15b | 9230 | static void |
94edc4ab | 9231 | add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid) |
8d08fdba | 9232 | { |
e6a66567 MM |
9233 | /* Make entries for the rest of the virtuals. */ |
9234 | if (abi_version_at_least (2)) | |
31f8e4f3 | 9235 | { |
e6a66567 | 9236 | tree orig_fn; |
911a71a7 | 9237 | |
e6a66567 MM |
9238 | /* The ABI requires that the methods be processed in declaration |
9239 | order. G++ 3.2 used the order in the vtable. */ | |
9240 | for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo)); | |
9241 | orig_fn; | |
910ad8de | 9242 | orig_fn = DECL_CHAIN (orig_fn)) |
e6a66567 | 9243 | if (DECL_VINDEX (orig_fn)) |
95675950 | 9244 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 MM |
9245 | } |
9246 | else | |
9247 | { | |
9248 | tree derived_virtuals; | |
9249 | tree base_virtuals; | |
9250 | tree orig_virtuals; | |
9251 | /* If BINFO is a primary base, the most derived class which has | |
9252 | BINFO as a primary base; otherwise, just BINFO. */ | |
9253 | tree non_primary_binfo; | |
9254 | ||
9255 | /* We might be a primary base class. Go up the inheritance hierarchy | |
9256 | until we find the most derived class of which we are a primary base: | |
9257 | it is the BINFO_VIRTUALS there that we need to consider. */ | |
9258 | non_primary_binfo = binfo; | |
9259 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
911a71a7 | 9260 | { |
e6a66567 MM |
9261 | tree b; |
9262 | ||
9263 | /* If we have reached a virtual base, then it must be vid->vbase, | |
9264 | because we ignore other virtual bases in | |
9265 | add_vcall_offset_vtbl_entries_r. In turn, it must be a primary | |
9266 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
9267 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
9268 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 9269 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
e6a66567 | 9270 | { |
8dc2b103 | 9271 | gcc_assert (non_primary_binfo == vid->vbase); |
e6a66567 MM |
9272 | non_primary_binfo = vid->binfo; |
9273 | break; | |
9274 | } | |
911a71a7 | 9275 | |
e6a66567 MM |
9276 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); |
9277 | if (get_primary_binfo (b) != non_primary_binfo) | |
9278 | break; | |
9279 | non_primary_binfo = b; | |
9280 | } | |
4e7512c9 | 9281 | |
e6a66567 MM |
9282 | if (vid->ctor_vtbl_p) |
9283 | /* For a ctor vtable we need the equivalent binfo within the hierarchy | |
9284 | where rtti_binfo is the most derived type. */ | |
dbbf88d1 NS |
9285 | non_primary_binfo |
9286 | = original_binfo (non_primary_binfo, vid->rtti_binfo); | |
c8094d83 | 9287 | |
e6a66567 MM |
9288 | for (base_virtuals = BINFO_VIRTUALS (binfo), |
9289 | derived_virtuals = BINFO_VIRTUALS (non_primary_binfo), | |
9290 | orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
9291 | base_virtuals; | |
9292 | base_virtuals = TREE_CHAIN (base_virtuals), | |
9293 | derived_virtuals = TREE_CHAIN (derived_virtuals), | |
9294 | orig_virtuals = TREE_CHAIN (orig_virtuals)) | |
9295 | { | |
9296 | tree orig_fn; | |
73ea87d7 | 9297 | |
e6a66567 MM |
9298 | /* Find the declaration that originally caused this function to |
9299 | be present in BINFO_TYPE (binfo). */ | |
9300 | orig_fn = BV_FN (orig_virtuals); | |
9bab6c90 | 9301 | |
e6a66567 MM |
9302 | /* When processing BINFO, we only want to generate vcall slots for |
9303 | function slots introduced in BINFO. So don't try to generate | |
9304 | one if the function isn't even defined in BINFO. */ | |
539ed333 | 9305 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn))) |
e6a66567 | 9306 | continue; |
b485e15b | 9307 | |
95675950 | 9308 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 MM |
9309 | } |
9310 | } | |
9311 | } | |
b485e15b | 9312 | |
95675950 | 9313 | /* Add a vcall offset entry for ORIG_FN to the vtable. */ |
b485e15b | 9314 | |
e6a66567 | 9315 | static void |
95675950 | 9316 | add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid) |
e6a66567 MM |
9317 | { |
9318 | size_t i; | |
9319 | tree vcall_offset; | |
1e625046 | 9320 | tree derived_entry; |
9bab6c90 | 9321 | |
e6a66567 MM |
9322 | /* If there is already an entry for a function with the same |
9323 | signature as FN, then we do not need a second vcall offset. | |
9324 | Check the list of functions already present in the derived | |
9325 | class vtable. */ | |
9771b263 | 9326 | FOR_EACH_VEC_SAFE_ELT (vid->fns, i, derived_entry) |
e6a66567 | 9327 | { |
e6a66567 MM |
9328 | if (same_signature_p (derived_entry, orig_fn) |
9329 | /* We only use one vcall offset for virtual destructors, | |
9330 | even though there are two virtual table entries. */ | |
9331 | || (DECL_DESTRUCTOR_P (derived_entry) | |
9332 | && DECL_DESTRUCTOR_P (orig_fn))) | |
9333 | return; | |
9334 | } | |
4e7512c9 | 9335 | |
e6a66567 MM |
9336 | /* If we are building these vcall offsets as part of building |
9337 | the vtable for the most derived class, remember the vcall | |
9338 | offset. */ | |
9339 | if (vid->binfo == TYPE_BINFO (vid->derived)) | |
0871761b | 9340 | { |
f32682ca | 9341 | tree_pair_s elt = {orig_fn, vid->index}; |
9771b263 | 9342 | vec_safe_push (CLASSTYPE_VCALL_INDICES (vid->derived), elt); |
0871761b | 9343 | } |
c8094d83 | 9344 | |
e6a66567 MM |
9345 | /* The next vcall offset will be found at a more negative |
9346 | offset. */ | |
9347 | vid->index = size_binop (MINUS_EXPR, vid->index, | |
9348 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
9349 | ||
9350 | /* Keep track of this function. */ | |
9771b263 | 9351 | vec_safe_push (vid->fns, orig_fn); |
e6a66567 MM |
9352 | |
9353 | if (vid->generate_vcall_entries) | |
9354 | { | |
9355 | tree base; | |
e6a66567 | 9356 | tree fn; |
548502d3 | 9357 | |
e6a66567 | 9358 | /* Find the overriding function. */ |
95675950 | 9359 | fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn); |
e6a66567 | 9360 | if (fn == error_mark_node) |
e8160c9a | 9361 | vcall_offset = build_zero_cst (vtable_entry_type); |
e6a66567 MM |
9362 | else |
9363 | { | |
95675950 MM |
9364 | base = TREE_VALUE (fn); |
9365 | ||
9366 | /* The vbase we're working on is a primary base of | |
9367 | vid->binfo. But it might be a lost primary, so its | |
9368 | BINFO_OFFSET might be wrong, so we just use the | |
9369 | BINFO_OFFSET from vid->binfo. */ | |
db3927fb AH |
9370 | vcall_offset = size_diffop_loc (input_location, |
9371 | BINFO_OFFSET (base), | |
95675950 | 9372 | BINFO_OFFSET (vid->binfo)); |
db3927fb AH |
9373 | vcall_offset = fold_build1_loc (input_location, |
9374 | NOP_EXPR, vtable_entry_type, | |
7866705a | 9375 | vcall_offset); |
548502d3 | 9376 | } |
34cd5ae7 | 9377 | /* Add the initializer to the vtable. */ |
9d6a019c | 9378 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, vcall_offset); |
c35cce41 | 9379 | } |
570221c2 | 9380 | } |
b54ccf71 | 9381 | |
34cd5ae7 | 9382 | /* Return vtbl initializers for the RTTI entries corresponding to the |
aabb4cd6 | 9383 | BINFO's vtable. The RTTI entries should indicate the object given |
73ea87d7 | 9384 | by VID->rtti_binfo. */ |
b54ccf71 | 9385 | |
9bab6c90 | 9386 | static void |
94edc4ab | 9387 | build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b54ccf71 | 9388 | { |
ca36f057 | 9389 | tree b; |
aabb4cd6 | 9390 | tree t; |
ca36f057 MM |
9391 | tree offset; |
9392 | tree decl; | |
9393 | tree init; | |
b54ccf71 | 9394 | |
73ea87d7 | 9395 | t = BINFO_TYPE (vid->rtti_binfo); |
b54ccf71 | 9396 | |
ca36f057 MM |
9397 | /* To find the complete object, we will first convert to our most |
9398 | primary base, and then add the offset in the vtbl to that value. */ | |
9399 | b = binfo; | |
9965d119 | 9400 | while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b)) |
0cbd7506 | 9401 | && !BINFO_LOST_PRIMARY_P (b)) |
b54ccf71 | 9402 | { |
c35cce41 MM |
9403 | tree primary_base; |
9404 | ||
911a71a7 | 9405 | primary_base = get_primary_binfo (b); |
fc6633e0 NS |
9406 | gcc_assert (BINFO_PRIMARY_P (primary_base) |
9407 | && BINFO_INHERITANCE_CHAIN (primary_base) == b); | |
c35cce41 | 9408 | b = primary_base; |
b54ccf71 | 9409 | } |
db3927fb AH |
9410 | offset = size_diffop_loc (input_location, |
9411 | BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b)); | |
8f032717 | 9412 | |
8fa33dfa MM |
9413 | /* The second entry is the address of the typeinfo object. */ |
9414 | if (flag_rtti) | |
7993382e | 9415 | decl = build_address (get_tinfo_decl (t)); |
ca36f057 | 9416 | else |
8fa33dfa | 9417 | decl = integer_zero_node; |
c8094d83 | 9418 | |
8fa33dfa MM |
9419 | /* Convert the declaration to a type that can be stored in the |
9420 | vtable. */ | |
7993382e | 9421 | init = build_nop (vfunc_ptr_type_node, decl); |
9d6a019c | 9422 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 9423 | |
78dcd41a VR |
9424 | /* Add the offset-to-top entry. It comes earlier in the vtable than |
9425 | the typeinfo entry. Convert the offset to look like a | |
c4372ef4 | 9426 | function pointer, so that we can put it in the vtable. */ |
7993382e | 9427 | init = build_nop (vfunc_ptr_type_node, offset); |
9d6a019c | 9428 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 9429 | } |
0f59171d | 9430 | |
22854930 PC |
9431 | /* TRUE iff TYPE is uniquely derived from PARENT. Ignores |
9432 | accessibility. */ | |
9433 | ||
9434 | bool | |
9435 | uniquely_derived_from_p (tree parent, tree type) | |
9436 | { | |
9437 | tree base = lookup_base (type, parent, ba_unique, NULL, tf_none); | |
9438 | return base && base != error_mark_node; | |
9439 | } | |
9440 | ||
9441 | /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */ | |
9442 | ||
9443 | bool | |
9444 | publicly_uniquely_derived_p (tree parent, tree type) | |
9445 | { | |
9446 | tree base = lookup_base (type, parent, ba_ignore_scope | ba_check, | |
9447 | NULL, tf_none); | |
9448 | return base && base != error_mark_node; | |
9449 | } | |
9450 | ||
3a6a88c8 JM |
9451 | /* CTX1 and CTX2 are declaration contexts. Return the innermost common |
9452 | class between them, if any. */ | |
9453 | ||
9454 | tree | |
9455 | common_enclosing_class (tree ctx1, tree ctx2) | |
9456 | { | |
9457 | if (!TYPE_P (ctx1) || !TYPE_P (ctx2)) | |
9458 | return NULL_TREE; | |
9459 | gcc_assert (ctx1 == TYPE_MAIN_VARIANT (ctx1) | |
9460 | && ctx2 == TYPE_MAIN_VARIANT (ctx2)); | |
9461 | if (ctx1 == ctx2) | |
9462 | return ctx1; | |
9463 | for (tree t = ctx1; TYPE_P (t); t = TYPE_CONTEXT (t)) | |
9464 | TYPE_MARKED_P (t) = true; | |
9465 | tree found = NULL_TREE; | |
9466 | for (tree t = ctx2; TYPE_P (t); t = TYPE_CONTEXT (t)) | |
9467 | if (TYPE_MARKED_P (t)) | |
9468 | { | |
9469 | found = t; | |
9470 | break; | |
9471 | } | |
9472 | for (tree t = ctx1; TYPE_P (t); t = TYPE_CONTEXT (t)) | |
9473 | TYPE_MARKED_P (t) = false; | |
9474 | return found; | |
9475 | } | |
9476 | ||
1b746b0f | 9477 | #include "gt-cp-class.h" |