]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Functions related to building classes and their related objects. |
5624e564 | 2 | Copyright (C) 1987-2015 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 | 32 | #include "hash-table.h" |
8d08fdba MS |
33 | #include "cp-tree.h" |
34 | #include "flags.h" | |
54f92bfb | 35 | #include "toplev.h" |
1af6141b | 36 | #include "target.h" |
7b6d72fc | 37 | #include "convert.h" |
c582198b AM |
38 | #include "hash-map.h" |
39 | #include "is-a.h" | |
40 | #include "plugin-api.h" | |
41 | #include "vec.h" | |
42 | #include "hashtab.h" | |
43 | #include "hash-set.h" | |
44 | #include "machmode.h" | |
45 | #include "hard-reg-set.h" | |
46 | #include "input.h" | |
47 | #include "function.h" | |
48 | #include "ipa-ref.h" | |
8634c649 | 49 | #include "cgraph.h" |
7ee2468b | 50 | #include "dumpfile.h" |
245763e3 | 51 | #include "splay-tree.h" |
45b0be94 | 52 | #include "gimplify.h" |
807e902e | 53 | #include "wide-int.h" |
8d08fdba | 54 | |
61a127b3 MM |
55 | /* The number of nested classes being processed. If we are not in the |
56 | scope of any class, this is zero. */ | |
57 | ||
8d08fdba MS |
58 | int current_class_depth; |
59 | ||
61a127b3 MM |
60 | /* In order to deal with nested classes, we keep a stack of classes. |
61 | The topmost entry is the innermost class, and is the entry at index | |
62 | CURRENT_CLASS_DEPTH */ | |
63 | ||
64 | typedef struct class_stack_node { | |
65 | /* The name of the class. */ | |
66 | tree name; | |
67 | ||
68 | /* The _TYPE node for the class. */ | |
69 | tree type; | |
70 | ||
71 | /* The access specifier pending for new declarations in the scope of | |
72 | this class. */ | |
73 | tree access; | |
8f032717 MM |
74 | |
75 | /* If were defining TYPE, the names used in this class. */ | |
76 | splay_tree names_used; | |
c888c93b MM |
77 | |
78 | /* Nonzero if this class is no longer open, because of a call to | |
79 | push_to_top_level. */ | |
80 | size_t hidden; | |
61a127b3 MM |
81 | }* class_stack_node_t; |
82 | ||
911a71a7 | 83 | typedef struct vtbl_init_data_s |
c35cce41 | 84 | { |
911a71a7 MM |
85 | /* The base for which we're building initializers. */ |
86 | tree binfo; | |
73ea87d7 | 87 | /* The type of the most-derived type. */ |
c35cce41 | 88 | tree derived; |
73ea87d7 NS |
89 | /* The binfo for the dynamic type. This will be TYPE_BINFO (derived), |
90 | unless ctor_vtbl_p is true. */ | |
91 | tree rtti_binfo; | |
9bab6c90 MM |
92 | /* The negative-index vtable initializers built up so far. These |
93 | are in order from least negative index to most negative index. */ | |
9771b263 | 94 | vec<constructor_elt, va_gc> *inits; |
c35cce41 | 95 | /* The binfo for the virtual base for which we're building |
911a71a7 | 96 | vcall offset initializers. */ |
c35cce41 | 97 | tree vbase; |
9bab6c90 MM |
98 | /* The functions in vbase for which we have already provided vcall |
99 | offsets. */ | |
9771b263 | 100 | vec<tree, va_gc> *fns; |
c35cce41 MM |
101 | /* The vtable index of the next vcall or vbase offset. */ |
102 | tree index; | |
103 | /* Nonzero if we are building the initializer for the primary | |
104 | vtable. */ | |
911a71a7 MM |
105 | int primary_vtbl_p; |
106 | /* Nonzero if we are building the initializer for a construction | |
107 | vtable. */ | |
108 | int ctor_vtbl_p; | |
548502d3 MM |
109 | /* True when adding vcall offset entries to the vtable. False when |
110 | merely computing the indices. */ | |
111 | bool generate_vcall_entries; | |
911a71a7 | 112 | } vtbl_init_data; |
c35cce41 | 113 | |
c20118a8 | 114 | /* The type of a function passed to walk_subobject_offsets. */ |
94edc4ab | 115 | typedef int (*subobject_offset_fn) (tree, tree, splay_tree); |
c20118a8 | 116 | |
4639c5c6 | 117 | /* The stack itself. This is a dynamically resized array. The |
61a127b3 MM |
118 | number of elements allocated is CURRENT_CLASS_STACK_SIZE. */ |
119 | static int current_class_stack_size; | |
120 | static class_stack_node_t current_class_stack; | |
121 | ||
c5a35c3c MM |
122 | /* The size of the largest empty class seen in this translation unit. */ |
123 | static GTY (()) tree sizeof_biggest_empty_class; | |
124 | ||
1f6e1acc AS |
125 | /* An array of all local classes present in this translation unit, in |
126 | declaration order. */ | |
9771b263 | 127 | vec<tree, va_gc> *local_classes; |
1f6e1acc | 128 | |
94edc4ab NN |
129 | static tree get_vfield_name (tree); |
130 | static void finish_struct_anon (tree); | |
131 | static tree get_vtable_name (tree); | |
132 | static tree get_basefndecls (tree, tree); | |
133 | static int build_primary_vtable (tree, tree); | |
dbbf88d1 | 134 | static int build_secondary_vtable (tree); |
94edc4ab NN |
135 | static void finish_vtbls (tree); |
136 | static void modify_vtable_entry (tree, tree, tree, tree, tree *); | |
94edc4ab NN |
137 | static void finish_struct_bits (tree); |
138 | static int alter_access (tree, tree, tree); | |
139 | static void handle_using_decl (tree, tree); | |
94edc4ab NN |
140 | static tree dfs_modify_vtables (tree, void *); |
141 | static tree modify_all_vtables (tree, tree); | |
fc6633e0 | 142 | static void determine_primary_bases (tree); |
94edc4ab NN |
143 | static void finish_struct_methods (tree); |
144 | static void maybe_warn_about_overly_private_class (tree); | |
94edc4ab NN |
145 | static int method_name_cmp (const void *, const void *); |
146 | static int resort_method_name_cmp (const void *, const void *); | |
85b5d65a | 147 | static void add_implicitly_declared_members (tree, tree*, int, int); |
94edc4ab | 148 | static tree fixed_type_or_null (tree, int *, int *); |
00bfffa4 | 149 | static tree build_simple_base_path (tree expr, tree binfo); |
94edc4ab | 150 | static tree build_vtbl_ref_1 (tree, tree); |
9d6a019c | 151 | static void build_vtbl_initializer (tree, tree, tree, tree, int *, |
9771b263 | 152 | vec<constructor_elt, va_gc> **); |
94edc4ab | 153 | static int count_fields (tree); |
d07605f5 | 154 | static int add_fields_to_record_type (tree, struct sorted_fields_type*, int); |
cba0366c | 155 | static void insert_into_classtype_sorted_fields (tree, tree, int); |
e7df0180 | 156 | static bool check_bitfield_decl (tree); |
10746f37 JM |
157 | static void check_field_decl (tree, tree, int *, int *, int *); |
158 | static void check_field_decls (tree, tree *, int *, int *); | |
58731fd1 MM |
159 | static tree *build_base_field (record_layout_info, tree, splay_tree, tree *); |
160 | static void build_base_fields (record_layout_info, splay_tree, tree *); | |
94edc4ab NN |
161 | static void check_methods (tree); |
162 | static void remove_zero_width_bit_fields (tree); | |
880a467b | 163 | static bool accessible_nvdtor_p (tree); |
10746f37 | 164 | static void check_bases (tree, int *, int *); |
58731fd1 MM |
165 | static void check_bases_and_members (tree); |
166 | static tree create_vtable_ptr (tree, tree *); | |
17bbb839 | 167 | static void include_empty_classes (record_layout_info); |
e93ee644 | 168 | static void layout_class_type (tree, tree *); |
dbbf88d1 | 169 | static void propagate_binfo_offsets (tree, tree); |
17bbb839 | 170 | static void layout_virtual_bases (record_layout_info, splay_tree); |
94edc4ab NN |
171 | static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *); |
172 | static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *); | |
173 | static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *); | |
174 | static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *); | |
e6a66567 | 175 | static void add_vcall_offset (tree, tree, vtbl_init_data *); |
94edc4ab | 176 | static void layout_vtable_decl (tree, int); |
5d5a519f | 177 | static tree dfs_find_final_overrider_pre (tree, void *); |
dbbf88d1 | 178 | static tree dfs_find_final_overrider_post (tree, void *); |
94edc4ab NN |
179 | static tree find_final_overrider (tree, tree, tree); |
180 | static int make_new_vtable (tree, tree); | |
b5791fdc | 181 | static tree get_primary_binfo (tree); |
94edc4ab | 182 | static int maybe_indent_hierarchy (FILE *, int, int); |
dbbf88d1 | 183 | static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int); |
94edc4ab | 184 | static void dump_class_hierarchy (tree); |
bb885938 | 185 | static void dump_class_hierarchy_1 (FILE *, int, tree); |
94edc4ab NN |
186 | static void dump_array (FILE *, tree); |
187 | static void dump_vtable (tree, tree, tree); | |
188 | static void dump_vtt (tree, tree); | |
bb885938 | 189 | static void dump_thunk (FILE *, int, tree); |
94edc4ab | 190 | static tree build_vtable (tree, tree, tree); |
9771b263 | 191 | static void initialize_vtable (tree, vec<constructor_elt, va_gc> *); |
94edc4ab | 192 | static void layout_nonempty_base_or_field (record_layout_info, |
5d5a519f | 193 | tree, tree, splay_tree); |
94edc4ab | 194 | static tree end_of_class (tree, int); |
d9d9dbc0 | 195 | static bool layout_empty_base (record_layout_info, tree, tree, splay_tree); |
9d6a019c | 196 | static void accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
9771b263 | 197 | vec<constructor_elt, va_gc> **); |
9d6a019c | 198 | static void dfs_accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
9771b263 | 199 | vec<constructor_elt, va_gc> **); |
94edc4ab | 200 | static void build_rtti_vtbl_entries (tree, vtbl_init_data *); |
5d5a519f | 201 | static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *); |
94edc4ab NN |
202 | static void clone_constructors_and_destructors (tree); |
203 | static tree build_clone (tree, tree); | |
a2ddc397 | 204 | static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned); |
94edc4ab NN |
205 | static void build_ctor_vtbl_group (tree, tree); |
206 | static void build_vtt (tree); | |
207 | static tree binfo_ctor_vtable (tree); | |
9771b263 DN |
208 | static void build_vtt_inits (tree, tree, vec<constructor_elt, va_gc> **, |
209 | tree *); | |
94edc4ab | 210 | static tree dfs_build_secondary_vptr_vtt_inits (tree, void *); |
94edc4ab | 211 | static tree dfs_fixup_binfo_vtbls (tree, void *); |
94edc4ab NN |
212 | static int record_subobject_offset (tree, tree, splay_tree); |
213 | static int check_subobject_offset (tree, tree, splay_tree); | |
214 | static int walk_subobject_offsets (tree, subobject_offset_fn, | |
5d5a519f | 215 | tree, splay_tree, tree, int); |
c5a35c3c | 216 | static void record_subobject_offsets (tree, tree, splay_tree, bool); |
94edc4ab NN |
217 | static int layout_conflict_p (tree, tree, splay_tree, int); |
218 | static int splay_tree_compare_integer_csts (splay_tree_key k1, | |
5d5a519f | 219 | splay_tree_key k2); |
94edc4ab NN |
220 | static void warn_about_ambiguous_bases (tree); |
221 | static bool type_requires_array_cookie (tree); | |
9368208b | 222 | static bool base_derived_from (tree, tree); |
7ba539c6 | 223 | static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree); |
ba9a991f | 224 | static tree end_of_base (tree); |
548502d3 | 225 | static tree get_vcall_index (tree, tree); |
9965d119 | 226 | |
51c184be | 227 | /* Variables shared between class.c and call.c. */ |
8d08fdba MS |
228 | |
229 | int n_vtables = 0; | |
230 | int n_vtable_entries = 0; | |
231 | int n_vtable_searches = 0; | |
232 | int n_vtable_elems = 0; | |
233 | int n_convert_harshness = 0; | |
234 | int n_compute_conversion_costs = 0; | |
8d08fdba MS |
235 | int n_inner_fields_searched = 0; |
236 | ||
338d90b8 NS |
237 | /* Convert to or from a base subobject. EXPR is an expression of type |
238 | `A' or `A*', an expression of type `B' or `B*' is returned. To | |
239 | convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for | |
240 | the B base instance within A. To convert base A to derived B, CODE | |
241 | is MINUS_EXPR and BINFO is the binfo for the A instance within B. | |
242 | In this latter case, A must not be a morally virtual base of B. | |
243 | NONNULL is true if EXPR is known to be non-NULL (this is only | |
244 | needed when EXPR is of pointer type). CV qualifiers are preserved | |
245 | from EXPR. */ | |
ca36f057 MM |
246 | |
247 | tree | |
94edc4ab | 248 | build_base_path (enum tree_code code, |
0cbd7506 MS |
249 | tree expr, |
250 | tree binfo, | |
a271590a PC |
251 | int nonnull, |
252 | tsubst_flags_t complain) | |
1a588ad7 | 253 | { |
338d90b8 | 254 | tree v_binfo = NULL_TREE; |
6bc34b14 | 255 | tree d_binfo = NULL_TREE; |
338d90b8 NS |
256 | tree probe; |
257 | tree offset; | |
258 | tree target_type; | |
259 | tree null_test = NULL; | |
260 | tree ptr_target_type; | |
ca36f057 | 261 | int fixed_type_p; |
50e10fa8 | 262 | int want_pointer = TYPE_PTR_P (TREE_TYPE (expr)); |
00bfffa4 | 263 | bool has_empty = false; |
d7981fd9 | 264 | bool virtual_access; |
d1522e8f | 265 | bool rvalue = false; |
1a588ad7 | 266 | |
338d90b8 NS |
267 | if (expr == error_mark_node || binfo == error_mark_node || !binfo) |
268 | return error_mark_node; | |
6bc34b14 JM |
269 | |
270 | for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
271 | { | |
272 | d_binfo = probe; | |
00bfffa4 JM |
273 | if (is_empty_class (BINFO_TYPE (probe))) |
274 | has_empty = true; | |
809e3e7f | 275 | if (!v_binfo && BINFO_VIRTUAL_P (probe)) |
6bc34b14 JM |
276 | v_binfo = probe; |
277 | } | |
338d90b8 NS |
278 | |
279 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr)); | |
280 | if (want_pointer) | |
281 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe)); | |
00bfffa4 | 282 | |
5313d330 JM |
283 | if (code == PLUS_EXPR |
284 | && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe)) | |
285 | { | |
286 | /* This can happen when adjust_result_of_qualified_name_lookup can't | |
287 | find a unique base binfo in a call to a member function. We | |
288 | couldn't give the diagnostic then since we might have been calling | |
289 | a static member function, so we do it now. */ | |
290 | if (complain & tf_error) | |
291 | { | |
292 | tree base = lookup_base (probe, BINFO_TYPE (d_binfo), | |
22854930 | 293 | ba_unique, NULL, complain); |
5313d330 JM |
294 | gcc_assert (base == error_mark_node); |
295 | } | |
296 | return error_mark_node; | |
297 | } | |
298 | ||
539ed333 NS |
299 | gcc_assert ((code == MINUS_EXPR |
300 | && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe)) | |
5313d330 | 301 | || code == PLUS_EXPR); |
c8094d83 | 302 | |
00bfffa4 JM |
303 | if (binfo == d_binfo) |
304 | /* Nothing to do. */ | |
305 | return expr; | |
306 | ||
338d90b8 NS |
307 | if (code == MINUS_EXPR && v_binfo) |
308 | { | |
a271590a | 309 | if (complain & tf_error) |
128be7f9 PC |
310 | { |
311 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (v_binfo))) | |
312 | { | |
313 | if (want_pointer) | |
314 | error ("cannot convert from pointer to base class %qT to " | |
315 | "pointer to derived class %qT because the base is " | |
316 | "virtual", BINFO_TYPE (binfo), BINFO_TYPE (d_binfo)); | |
317 | else | |
318 | error ("cannot convert from base class %qT to derived " | |
319 | "class %qT because the base is virtual", | |
320 | BINFO_TYPE (binfo), BINFO_TYPE (d_binfo)); | |
321 | } | |
322 | else | |
323 | { | |
324 | if (want_pointer) | |
325 | error ("cannot convert from pointer to base class %qT to " | |
326 | "pointer to derived class %qT via virtual base %qT", | |
327 | BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), | |
328 | BINFO_TYPE (v_binfo)); | |
329 | else | |
330 | error ("cannot convert from base class %qT to derived " | |
331 | "class %qT via virtual base %qT", BINFO_TYPE (binfo), | |
332 | BINFO_TYPE (d_binfo), BINFO_TYPE (v_binfo)); | |
333 | } | |
334 | } | |
338d90b8 NS |
335 | return error_mark_node; |
336 | } | |
1a588ad7 | 337 | |
f576dfc4 | 338 | if (!want_pointer) |
d1522e8f JM |
339 | { |
340 | rvalue = !real_lvalue_p (expr); | |
341 | /* This must happen before the call to save_expr. */ | |
342 | expr = cp_build_addr_expr (expr, complain); | |
343 | } | |
7fd7263d | 344 | else |
416f380b | 345 | expr = mark_rvalue_use (expr); |
f576dfc4 | 346 | |
00bfffa4 | 347 | offset = BINFO_OFFSET (binfo); |
ca36f057 | 348 | fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull); |
0e686aa6 | 349 | target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo); |
2bbf86a4 JM |
350 | /* TARGET_TYPE has been extracted from BINFO, and, is therefore always |
351 | cv-unqualified. Extract the cv-qualifiers from EXPR so that the | |
352 | expression returned matches the input. */ | |
353 | target_type = cp_build_qualified_type | |
354 | (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr)))); | |
355 | ptr_target_type = build_pointer_type (target_type); | |
00bfffa4 | 356 | |
d7981fd9 | 357 | /* Do we need to look in the vtable for the real offset? */ |
7a0b47e3 JM |
358 | virtual_access = (v_binfo && fixed_type_p <= 0); |
359 | ||
360 | /* Don't bother with the calculations inside sizeof; they'll ICE if the | |
a8e23778 | 361 | source type is incomplete and the pointer value doesn't matter. In a |
234bef96 PC |
362 | template (even in instantiate_non_dependent_expr), we don't have vtables |
363 | set up properly yet, and the value doesn't matter there either; we're | |
364 | just interested in the result of overload resolution. */ | |
a8e23778 | 365 | if (cp_unevaluated_operand != 0 |
e0e1b357 | 366 | || in_template_function ()) |
dc555429 | 367 | { |
2bbf86a4 | 368 | expr = build_nop (ptr_target_type, expr); |
d1522e8f | 369 | goto indout; |
dc555429 | 370 | } |
d7981fd9 | 371 | |
c65b0607 JM |
372 | /* If we're in an NSDMI, we don't have the full constructor context yet |
373 | that we need for converting to a virtual base, so just build a stub | |
374 | CONVERT_EXPR and expand it later in bot_replace. */ | |
375 | if (virtual_access && fixed_type_p < 0 | |
376 | && current_scope () != current_function_decl) | |
377 | { | |
378 | expr = build1 (CONVERT_EXPR, ptr_target_type, expr); | |
379 | CONVERT_EXPR_VBASE_PATH (expr) = true; | |
d1522e8f | 380 | goto indout; |
c65b0607 JM |
381 | } |
382 | ||
d7981fd9 | 383 | /* Do we need to check for a null pointer? */ |
0e686aa6 MM |
384 | if (want_pointer && !nonnull) |
385 | { | |
386 | /* If we know the conversion will not actually change the value | |
387 | of EXPR, then we can avoid testing the expression for NULL. | |
388 | We have to avoid generating a COMPONENT_REF for a base class | |
389 | field, because other parts of the compiler know that such | |
390 | expressions are always non-NULL. */ | |
391 | if (!virtual_access && integer_zerop (offset)) | |
2bbf86a4 | 392 | return build_nop (ptr_target_type, expr); |
0e686aa6 MM |
393 | null_test = error_mark_node; |
394 | } | |
00bfffa4 | 395 | |
d7981fd9 JM |
396 | /* Protect against multiple evaluation if necessary. */ |
397 | if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access)) | |
ca36f057 | 398 | expr = save_expr (expr); |
f2606a97 | 399 | |
d7981fd9 | 400 | /* Now that we've saved expr, build the real null test. */ |
00bfffa4 | 401 | if (null_test) |
471a58a9 | 402 | { |
4b978f96 | 403 | tree zero = cp_convert (TREE_TYPE (expr), nullptr_node, complain); |
db3927fb | 404 | null_test = fold_build2_loc (input_location, NE_EXPR, boolean_type_node, |
7866705a | 405 | expr, zero); |
471a58a9 | 406 | } |
00bfffa4 JM |
407 | |
408 | /* If this is a simple base reference, express it as a COMPONENT_REF. */ | |
d7981fd9 | 409 | if (code == PLUS_EXPR && !virtual_access |
00bfffa4 JM |
410 | /* We don't build base fields for empty bases, and they aren't very |
411 | interesting to the optimizers anyway. */ | |
412 | && !has_empty) | |
413 | { | |
a271590a | 414 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
00bfffa4 | 415 | expr = build_simple_base_path (expr, binfo); |
d1522e8f JM |
416 | if (rvalue) |
417 | expr = move (expr); | |
00bfffa4 | 418 | if (want_pointer) |
442c8e31 | 419 | expr = build_address (expr); |
00bfffa4 JM |
420 | target_type = TREE_TYPE (expr); |
421 | goto out; | |
422 | } | |
423 | ||
d7981fd9 | 424 | if (virtual_access) |
1a588ad7 | 425 | { |
338d90b8 | 426 | /* Going via virtual base V_BINFO. We need the static offset |
0cbd7506 MS |
427 | from V_BINFO to BINFO, and the dynamic offset from D_BINFO to |
428 | V_BINFO. That offset is an entry in D_BINFO's vtable. */ | |
1f5a253a NS |
429 | tree v_offset; |
430 | ||
431 | if (fixed_type_p < 0 && in_base_initializer) | |
432 | { | |
2acb1af9 NS |
433 | /* In a base member initializer, we cannot rely on the |
434 | vtable being set up. We have to indirect via the | |
435 | vtt_parm. */ | |
6de9cd9a DN |
436 | tree t; |
437 | ||
2acb1af9 | 438 | t = TREE_TYPE (TYPE_VFIELD (current_class_type)); |
6de9cd9a DN |
439 | t = build_pointer_type (t); |
440 | v_offset = convert (t, current_vtt_parm); | |
a271590a | 441 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
1f5a253a NS |
442 | } |
443 | else | |
dd865ef6 | 444 | v_offset = build_vfield_ref (cp_build_indirect_ref (expr, RO_NULL, |
a271590a | 445 | complain), |
1f5a253a | 446 | TREE_TYPE (TREE_TYPE (expr))); |
f1f82a37 PC |
447 | |
448 | if (v_offset == error_mark_node) | |
449 | return error_mark_node; | |
c8094d83 | 450 | |
5d49b6a7 | 451 | v_offset = fold_build_pointer_plus (v_offset, BINFO_VPTR_FIELD (v_binfo)); |
c8094d83 | 452 | v_offset = build1 (NOP_EXPR, |
338d90b8 NS |
453 | build_pointer_type (ptrdiff_type_node), |
454 | v_offset); | |
a271590a | 455 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
6de9cd9a | 456 | TREE_CONSTANT (v_offset) = 1; |
f63ab951 | 457 | |
7b6d72fc | 458 | offset = convert_to_integer (ptrdiff_type_node, |
db3927fb | 459 | size_diffop_loc (input_location, offset, |
7b6d72fc | 460 | BINFO_OFFSET (v_binfo))); |
8d08fdba | 461 | |
338d90b8 | 462 | if (!integer_zerop (offset)) |
f293ce4b | 463 | v_offset = build2 (code, ptrdiff_type_node, v_offset, offset); |
f2606a97 JM |
464 | |
465 | if (fixed_type_p < 0) | |
466 | /* Negative fixed_type_p means this is a constructor or destructor; | |
467 | virtual base layout is fixed in in-charge [cd]tors, but not in | |
468 | base [cd]tors. */ | |
f293ce4b RS |
469 | offset = build3 (COND_EXPR, ptrdiff_type_node, |
470 | build2 (EQ_EXPR, boolean_type_node, | |
471 | current_in_charge_parm, integer_zero_node), | |
472 | v_offset, | |
aa8f5c20 AP |
473 | convert_to_integer (ptrdiff_type_node, |
474 | BINFO_OFFSET (binfo))); | |
338d90b8 NS |
475 | else |
476 | offset = v_offset; | |
8d08fdba | 477 | } |
8d08fdba | 478 | |
338d90b8 NS |
479 | if (want_pointer) |
480 | target_type = ptr_target_type; | |
c8094d83 | 481 | |
338d90b8 | 482 | expr = build1 (NOP_EXPR, ptr_target_type, expr); |
fed3cef0 | 483 | |
338d90b8 | 484 | if (!integer_zerop (offset)) |
5be014d5 AP |
485 | { |
486 | offset = fold_convert (sizetype, offset); | |
487 | if (code == MINUS_EXPR) | |
db3927fb | 488 | offset = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, offset); |
5d49b6a7 | 489 | expr = fold_build_pointer_plus (expr, offset); |
5be014d5 | 490 | } |
8d08fdba | 491 | else |
338d90b8 | 492 | null_test = NULL; |
c8094d83 | 493 | |
d1522e8f | 494 | indout: |
338d90b8 | 495 | if (!want_pointer) |
d1522e8f JM |
496 | { |
497 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); | |
498 | if (rvalue) | |
499 | expr = move (expr); | |
500 | } | |
8d08fdba | 501 | |
00bfffa4 | 502 | out: |
338d90b8 | 503 | if (null_test) |
db3927fb | 504 | expr = fold_build3_loc (input_location, COND_EXPR, target_type, null_test, expr, |
e8160c9a | 505 | build_zero_cst (target_type)); |
f2606a97 | 506 | |
338d90b8 | 507 | return expr; |
8d08fdba MS |
508 | } |
509 | ||
00bfffa4 JM |
510 | /* Subroutine of build_base_path; EXPR and BINFO are as in that function. |
511 | Perform a derived-to-base conversion by recursively building up a | |
512 | sequence of COMPONENT_REFs to the appropriate base fields. */ | |
513 | ||
514 | static tree | |
515 | build_simple_base_path (tree expr, tree binfo) | |
516 | { | |
517 | tree type = BINFO_TYPE (binfo); | |
fc6633e0 | 518 | tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo); |
00bfffa4 JM |
519 | tree field; |
520 | ||
00bfffa4 JM |
521 | if (d_binfo == NULL_TREE) |
522 | { | |
12a669d1 | 523 | tree temp; |
c8094d83 | 524 | |
8dc2b103 | 525 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type); |
c8094d83 | 526 | |
12a669d1 | 527 | /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' |
0cbd7506 | 528 | into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only |
3b426391 KH |
529 | an lvalue in the front end; only _DECLs and _REFs are lvalues |
530 | in the back end. */ | |
12a669d1 NS |
531 | temp = unary_complex_lvalue (ADDR_EXPR, expr); |
532 | if (temp) | |
dd865ef6 | 533 | expr = cp_build_indirect_ref (temp, RO_NULL, tf_warning_or_error); |
12a669d1 | 534 | |
00bfffa4 JM |
535 | return expr; |
536 | } | |
537 | ||
538 | /* Recurse. */ | |
539 | expr = build_simple_base_path (expr, d_binfo); | |
540 | ||
541 | for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo)); | |
910ad8de | 542 | field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
543 | /* Is this the base field created by build_base_field? */ |
544 | if (TREE_CODE (field) == FIELD_DECL | |
642124c6 | 545 | && DECL_FIELD_IS_BASE (field) |
a8c1d899 JM |
546 | && TREE_TYPE (field) == type |
547 | /* If we're looking for a field in the most-derived class, | |
548 | also check the field offset; we can have two base fields | |
549 | of the same type if one is an indirect virtual base and one | |
550 | is a direct non-virtual base. */ | |
551 | && (BINFO_INHERITANCE_CHAIN (d_binfo) | |
552 | || tree_int_cst_equal (byte_position (field), | |
553 | BINFO_OFFSET (binfo)))) | |
12a669d1 NS |
554 | { |
555 | /* We don't use build_class_member_access_expr here, as that | |
556 | has unnecessary checks, and more importantly results in | |
557 | recursive calls to dfs_walk_once. */ | |
558 | int type_quals = cp_type_quals (TREE_TYPE (expr)); | |
559 | ||
560 | expr = build3 (COMPONENT_REF, | |
561 | cp_build_qualified_type (type, type_quals), | |
562 | expr, field, NULL_TREE); | |
563 | expr = fold_if_not_in_template (expr); | |
c8094d83 | 564 | |
12a669d1 NS |
565 | /* Mark the expression const or volatile, as appropriate. |
566 | Even though we've dealt with the type above, we still have | |
567 | to mark the expression itself. */ | |
568 | if (type_quals & TYPE_QUAL_CONST) | |
569 | TREE_READONLY (expr) = 1; | |
570 | if (type_quals & TYPE_QUAL_VOLATILE) | |
571 | TREE_THIS_VOLATILE (expr) = 1; | |
c8094d83 | 572 | |
12a669d1 NS |
573 | return expr; |
574 | } | |
00bfffa4 JM |
575 | |
576 | /* Didn't find the base field?!? */ | |
8dc2b103 | 577 | gcc_unreachable (); |
00bfffa4 JM |
578 | } |
579 | ||
08e17d9d MM |
580 | /* Convert OBJECT to the base TYPE. OBJECT is an expression whose |
581 | type is a class type or a pointer to a class type. In the former | |
582 | case, TYPE is also a class type; in the latter it is another | |
583 | pointer type. If CHECK_ACCESS is true, an error message is emitted | |
584 | if TYPE is inaccessible. If OBJECT has pointer type, the value is | |
585 | assumed to be non-NULL. */ | |
50ad9642 MM |
586 | |
587 | tree | |
798ec807 JM |
588 | convert_to_base (tree object, tree type, bool check_access, bool nonnull, |
589 | tsubst_flags_t complain) | |
50ad9642 MM |
590 | { |
591 | tree binfo; | |
08e17d9d | 592 | tree object_type; |
50ad9642 | 593 | |
08e17d9d MM |
594 | if (TYPE_PTR_P (TREE_TYPE (object))) |
595 | { | |
596 | object_type = TREE_TYPE (TREE_TYPE (object)); | |
597 | type = TREE_TYPE (type); | |
598 | } | |
599 | else | |
600 | object_type = TREE_TYPE (object); | |
601 | ||
22854930 PC |
602 | binfo = lookup_base (object_type, type, check_access ? ba_check : ba_unique, |
603 | NULL, complain); | |
5bfc90de | 604 | if (!binfo || binfo == error_mark_node) |
50ad9642 MM |
605 | return error_mark_node; |
606 | ||
a271590a | 607 | return build_base_path (PLUS_EXPR, object, binfo, nonnull, complain); |
50ad9642 MM |
608 | } |
609 | ||
539ed333 NS |
610 | /* EXPR is an expression with unqualified class type. BASE is a base |
611 | binfo of that class type. Returns EXPR, converted to the BASE | |
22ed7e5f MM |
612 | type. This function assumes that EXPR is the most derived class; |
613 | therefore virtual bases can be found at their static offsets. */ | |
614 | ||
615 | tree | |
616 | convert_to_base_statically (tree expr, tree base) | |
617 | { | |
618 | tree expr_type; | |
619 | ||
620 | expr_type = TREE_TYPE (expr); | |
539ed333 | 621 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type)) |
22ed7e5f | 622 | { |
a8c1d899 JM |
623 | /* If this is a non-empty base, use a COMPONENT_REF. */ |
624 | if (!is_empty_class (BINFO_TYPE (base))) | |
625 | return build_simple_base_path (expr, base); | |
626 | ||
ffd34392 JH |
627 | /* We use fold_build2 and fold_convert below to simplify the trees |
628 | provided to the optimizers. It is not safe to call these functions | |
629 | when processing a template because they do not handle C++-specific | |
630 | trees. */ | |
631 | gcc_assert (!processing_template_decl); | |
93c0e0bb | 632 | expr = cp_build_addr_expr (expr, tf_warning_or_error); |
22ed7e5f | 633 | if (!integer_zerop (BINFO_OFFSET (base))) |
5d49b6a7 RG |
634 | expr = fold_build_pointer_plus_loc (input_location, |
635 | expr, BINFO_OFFSET (base)); | |
ffd34392 | 636 | expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr); |
db3927fb | 637 | expr = build_fold_indirect_ref_loc (input_location, expr); |
22ed7e5f MM |
638 | } |
639 | ||
640 | return expr; | |
641 | } | |
642 | ||
f8361147 | 643 | \f |
981c353e RH |
644 | tree |
645 | build_vfield_ref (tree datum, tree type) | |
646 | { | |
647 | tree vfield, vcontext; | |
648 | ||
f1f82a37 PC |
649 | if (datum == error_mark_node |
650 | /* Can happen in case of duplicate base types (c++/59082). */ | |
651 | || !TYPE_VFIELD (type)) | |
981c353e RH |
652 | return error_mark_node; |
653 | ||
981c353e RH |
654 | /* First, convert to the requested type. */ |
655 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type)) | |
08e17d9d | 656 | datum = convert_to_base (datum, type, /*check_access=*/false, |
798ec807 | 657 | /*nonnull=*/true, tf_warning_or_error); |
981c353e RH |
658 | |
659 | /* Second, the requested type may not be the owner of its own vptr. | |
660 | If not, convert to the base class that owns it. We cannot use | |
661 | convert_to_base here, because VCONTEXT may appear more than once | |
5995ebfb | 662 | in the inheritance hierarchy of TYPE, and thus direct conversion |
981c353e RH |
663 | between the types may be ambiguous. Following the path back up |
664 | one step at a time via primary bases avoids the problem. */ | |
665 | vfield = TYPE_VFIELD (type); | |
666 | vcontext = DECL_CONTEXT (vfield); | |
667 | while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type)) | |
668 | { | |
669 | datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type)); | |
670 | type = TREE_TYPE (datum); | |
671 | } | |
672 | ||
673 | return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE); | |
674 | } | |
675 | ||
8d08fdba | 676 | /* Given an object INSTANCE, return an expression which yields the |
67231816 RH |
677 | vtable element corresponding to INDEX. There are many special |
678 | cases for INSTANCE which we take care of here, mainly to avoid | |
679 | creating extra tree nodes when we don't have to. */ | |
e92cc029 | 680 | |
4a8d0c9c | 681 | static tree |
94edc4ab | 682 | build_vtbl_ref_1 (tree instance, tree idx) |
8d08fdba | 683 | { |
f63ab951 JM |
684 | tree aref; |
685 | tree vtbl = NULL_TREE; | |
8d08fdba | 686 | |
f63ab951 JM |
687 | /* Try to figure out what a reference refers to, and |
688 | access its virtual function table directly. */ | |
689 | ||
690 | int cdtorp = 0; | |
691 | tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp); | |
692 | ||
ee76b931 | 693 | tree basetype = non_reference (TREE_TYPE (instance)); |
8d08fdba | 694 | |
f63ab951 | 695 | if (fixed_type && !cdtorp) |
8d08fdba | 696 | { |
f63ab951 | 697 | tree binfo = lookup_base (fixed_type, basetype, |
22854930 PC |
698 | ba_unique, NULL, tf_none); |
699 | if (binfo && binfo != error_mark_node) | |
6de9cd9a | 700 | vtbl = unshare_expr (BINFO_VTABLE (binfo)); |
f63ab951 | 701 | } |
8d08fdba | 702 | |
f63ab951 | 703 | if (!vtbl) |
dbbf88d1 | 704 | vtbl = build_vfield_ref (instance, basetype); |
c8094d83 | 705 | |
3a11c665 | 706 | aref = build_array_ref (input_location, vtbl, idx); |
6de9cd9a | 707 | TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx); |
8d08fdba | 708 | |
c4372ef4 | 709 | return aref; |
8d08fdba MS |
710 | } |
711 | ||
4a8d0c9c | 712 | tree |
94edc4ab | 713 | build_vtbl_ref (tree instance, tree idx) |
4a8d0c9c RH |
714 | { |
715 | tree aref = build_vtbl_ref_1 (instance, idx); | |
716 | ||
4a8d0c9c RH |
717 | return aref; |
718 | } | |
719 | ||
0f59171d RH |
720 | /* Given a stable object pointer INSTANCE_PTR, return an expression which |
721 | yields a function pointer corresponding to vtable element INDEX. */ | |
67231816 RH |
722 | |
723 | tree | |
0f59171d | 724 | build_vfn_ref (tree instance_ptr, tree idx) |
67231816 | 725 | { |
0f59171d RH |
726 | tree aref; |
727 | ||
dd865ef6 | 728 | aref = build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr, RO_NULL, |
5ade1ed2 DG |
729 | tf_warning_or_error), |
730 | idx); | |
67231816 RH |
731 | |
732 | /* When using function descriptors, the address of the | |
733 | vtable entry is treated as a function pointer. */ | |
734 | if (TARGET_VTABLE_USES_DESCRIPTORS) | |
4a8d0c9c | 735 | aref = build1 (NOP_EXPR, TREE_TYPE (aref), |
93c0e0bb | 736 | cp_build_addr_expr (aref, tf_warning_or_error)); |
67231816 | 737 | |
0f59171d | 738 | /* Remember this as a method reference, for later devirtualization. */ |
f293ce4b | 739 | aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx); |
0f59171d | 740 | |
67231816 RH |
741 | return aref; |
742 | } | |
743 | ||
669ec2b4 JM |
744 | /* Return the name of the virtual function table (as an IDENTIFIER_NODE) |
745 | for the given TYPE. */ | |
746 | ||
747 | static tree | |
94edc4ab | 748 | get_vtable_name (tree type) |
669ec2b4 | 749 | { |
1f84ec23 | 750 | return mangle_vtbl_for_type (type); |
669ec2b4 JM |
751 | } |
752 | ||
4684cd27 MM |
753 | /* DECL is an entity associated with TYPE, like a virtual table or an |
754 | implicitly generated constructor. Determine whether or not DECL | |
755 | should have external or internal linkage at the object file | |
756 | level. This routine does not deal with COMDAT linkage and other | |
757 | similar complexities; it simply sets TREE_PUBLIC if it possible for | |
758 | entities in other translation units to contain copies of DECL, in | |
759 | the abstract. */ | |
760 | ||
761 | void | |
12308bc6 | 762 | set_linkage_according_to_type (tree /*type*/, tree decl) |
4684cd27 | 763 | { |
012d5d25 JM |
764 | TREE_PUBLIC (decl) = 1; |
765 | determine_visibility (decl); | |
4684cd27 MM |
766 | } |
767 | ||
459c43ad MM |
768 | /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE. |
769 | (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.) | |
770 | Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */ | |
b9f39201 MM |
771 | |
772 | static tree | |
94edc4ab | 773 | build_vtable (tree class_type, tree name, tree vtable_type) |
b9f39201 MM |
774 | { |
775 | tree decl; | |
776 | ||
777 | decl = build_lang_decl (VAR_DECL, name, vtable_type); | |
90ecce3e JM |
778 | /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME |
779 | now to avoid confusion in mangle_decl. */ | |
780 | SET_DECL_ASSEMBLER_NAME (decl, name); | |
b9f39201 MM |
781 | DECL_CONTEXT (decl) = class_type; |
782 | DECL_ARTIFICIAL (decl) = 1; | |
783 | TREE_STATIC (decl) = 1; | |
b9f39201 | 784 | TREE_READONLY (decl) = 1; |
b9f39201 | 785 | DECL_VIRTUAL_P (decl) = 1; |
a6f5e048 | 786 | DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN; |
8ce8d98e | 787 | DECL_USER_ALIGN (decl) = true; |
d35543c0 | 788 | DECL_VTABLE_OR_VTT_P (decl) = 1; |
4684cd27 MM |
789 | set_linkage_according_to_type (class_type, decl); |
790 | /* The vtable has not been defined -- yet. */ | |
791 | DECL_EXTERNAL (decl) = 1; | |
792 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
793 | ||
78e0d62b RH |
794 | /* Mark the VAR_DECL node representing the vtable itself as a |
795 | "gratuitous" one, thereby forcing dwarfout.c to ignore it. It | |
796 | is rather important that such things be ignored because any | |
797 | effort to actually generate DWARF for them will run into | |
798 | trouble when/if we encounter code like: | |
c8094d83 | 799 | |
78e0d62b RH |
800 | #pragma interface |
801 | struct S { virtual void member (); }; | |
c8094d83 | 802 | |
78e0d62b RH |
803 | because the artificial declaration of the vtable itself (as |
804 | manufactured by the g++ front end) will say that the vtable is | |
805 | a static member of `S' but only *after* the debug output for | |
806 | the definition of `S' has already been output. This causes | |
807 | grief because the DWARF entry for the definition of the vtable | |
808 | will try to refer back to an earlier *declaration* of the | |
809 | vtable as a static member of `S' and there won't be one. We | |
810 | might be able to arrange to have the "vtable static member" | |
811 | attached to the member list for `S' before the debug info for | |
812 | `S' get written (which would solve the problem) but that would | |
813 | require more intrusive changes to the g++ front end. */ | |
814 | DECL_IGNORED_P (decl) = 1; | |
78d55cc8 | 815 | |
b9f39201 MM |
816 | return decl; |
817 | } | |
818 | ||
1aa4ccd4 NS |
819 | /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic, |
820 | or even complete. If this does not exist, create it. If COMPLETE is | |
838dfd8a | 821 | nonzero, then complete the definition of it -- that will render it |
1aa4ccd4 NS |
822 | impossible to actually build the vtable, but is useful to get at those |
823 | which are known to exist in the runtime. */ | |
824 | ||
c8094d83 | 825 | tree |
94edc4ab | 826 | get_vtable_decl (tree type, int complete) |
1aa4ccd4 | 827 | { |
548502d3 MM |
828 | tree decl; |
829 | ||
830 | if (CLASSTYPE_VTABLES (type)) | |
831 | return CLASSTYPE_VTABLES (type); | |
c8094d83 | 832 | |
d1a74aa7 | 833 | decl = build_vtable (type, get_vtable_name (type), vtbl_type_node); |
548502d3 MM |
834 | CLASSTYPE_VTABLES (type) = decl; |
835 | ||
1aa4ccd4 | 836 | if (complete) |
217f4eb9 MM |
837 | { |
838 | DECL_EXTERNAL (decl) = 1; | |
3600f678 | 839 | cp_finish_decl (decl, NULL_TREE, false, NULL_TREE, 0); |
217f4eb9 | 840 | } |
1aa4ccd4 | 841 | |
1aa4ccd4 NS |
842 | return decl; |
843 | } | |
844 | ||
28531dd0 MM |
845 | /* Build the primary virtual function table for TYPE. If BINFO is |
846 | non-NULL, build the vtable starting with the initial approximation | |
847 | that it is the same as the one which is the head of the association | |
838dfd8a | 848 | list. Returns a nonzero value if a new vtable is actually |
28531dd0 | 849 | created. */ |
e92cc029 | 850 | |
28531dd0 | 851 | static int |
94edc4ab | 852 | build_primary_vtable (tree binfo, tree type) |
8d08fdba | 853 | { |
31f8e4f3 MM |
854 | tree decl; |
855 | tree virtuals; | |
8d08fdba | 856 | |
1aa4ccd4 | 857 | decl = get_vtable_decl (type, /*complete=*/0); |
c8094d83 | 858 | |
8d08fdba MS |
859 | if (binfo) |
860 | { | |
dbbf88d1 | 861 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
862 | /* We have already created a vtable for this base, so there's |
863 | no need to do it again. */ | |
28531dd0 | 864 | return 0; |
c8094d83 | 865 | |
d1f05f93 | 866 | virtuals = copy_list (BINFO_VIRTUALS (binfo)); |
c35cce41 MM |
867 | TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo)); |
868 | DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl)); | |
869 | DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl)); | |
8d08fdba MS |
870 | } |
871 | else | |
872 | { | |
50bc768d | 873 | gcc_assert (TREE_TYPE (decl) == vtbl_type_node); |
8d08fdba | 874 | virtuals = NULL_TREE; |
8d08fdba MS |
875 | } |
876 | ||
7aa6d18a SB |
877 | if (GATHER_STATISTICS) |
878 | { | |
879 | n_vtables += 1; | |
880 | n_vtable_elems += list_length (virtuals); | |
881 | } | |
8d08fdba | 882 | |
8d08fdba MS |
883 | /* Initialize the association list for this type, based |
884 | on our first approximation. */ | |
604a3205 NS |
885 | BINFO_VTABLE (TYPE_BINFO (type)) = decl; |
886 | BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals; | |
dbbf88d1 | 887 | SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type)); |
28531dd0 | 888 | return 1; |
8d08fdba MS |
889 | } |
890 | ||
3461fba7 | 891 | /* Give BINFO a new virtual function table which is initialized |
8d08fdba MS |
892 | with a skeleton-copy of its original initialization. The only |
893 | entry that changes is the `delta' entry, so we can really | |
894 | share a lot of structure. | |
895 | ||
3461fba7 | 896 | FOR_TYPE is the most derived type which caused this table to |
8d08fdba MS |
897 | be needed. |
898 | ||
838dfd8a | 899 | Returns nonzero if we haven't met BINFO before. |
2636fde4 JM |
900 | |
901 | The order in which vtables are built (by calling this function) for | |
902 | an object must remain the same, otherwise a binary incompatibility | |
903 | can result. */ | |
e92cc029 | 904 | |
28531dd0 | 905 | static int |
dbbf88d1 | 906 | build_secondary_vtable (tree binfo) |
8d08fdba | 907 | { |
dbbf88d1 | 908 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
909 | /* We already created a vtable for this base. There's no need to |
910 | do it again. */ | |
28531dd0 | 911 | return 0; |
0533d788 | 912 | |
8d7a5379 MM |
913 | /* Remember that we've created a vtable for this BINFO, so that we |
914 | don't try to do so again. */ | |
dbbf88d1 | 915 | SET_BINFO_NEW_VTABLE_MARKED (binfo); |
c8094d83 | 916 | |
8d7a5379 | 917 | /* Make fresh virtual list, so we can smash it later. */ |
d1f05f93 | 918 | BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo)); |
8d7a5379 | 919 | |
3461fba7 NS |
920 | /* Secondary vtables are laid out as part of the same structure as |
921 | the primary vtable. */ | |
922 | BINFO_VTABLE (binfo) = NULL_TREE; | |
28531dd0 | 923 | return 1; |
8d08fdba MS |
924 | } |
925 | ||
28531dd0 | 926 | /* Create a new vtable for BINFO which is the hierarchy dominated by |
838dfd8a | 927 | T. Return nonzero if we actually created a new vtable. */ |
28531dd0 MM |
928 | |
929 | static int | |
94edc4ab | 930 | make_new_vtable (tree t, tree binfo) |
28531dd0 MM |
931 | { |
932 | if (binfo == TYPE_BINFO (t)) | |
933 | /* In this case, it is *type*'s vtable we are modifying. We start | |
d0cd8b44 | 934 | with the approximation that its vtable is that of the |
28531dd0 | 935 | immediate base class. */ |
981c353e | 936 | return build_primary_vtable (binfo, t); |
28531dd0 MM |
937 | else |
938 | /* This is our very own copy of `basetype' to play with. Later, | |
939 | we will fill in all the virtual functions that override the | |
940 | virtual functions in these base classes which are not defined | |
941 | by the current type. */ | |
dbbf88d1 | 942 | return build_secondary_vtable (binfo); |
28531dd0 MM |
943 | } |
944 | ||
945 | /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO | |
946 | (which is in the hierarchy dominated by T) list FNDECL as its | |
4e7512c9 MM |
947 | BV_FN. DELTA is the required constant adjustment from the `this' |
948 | pointer where the vtable entry appears to the `this' required when | |
949 | the function is actually called. */ | |
8d08fdba MS |
950 | |
951 | static void | |
94edc4ab | 952 | modify_vtable_entry (tree t, |
0cbd7506 MS |
953 | tree binfo, |
954 | tree fndecl, | |
955 | tree delta, | |
956 | tree *virtuals) | |
8d08fdba | 957 | { |
28531dd0 | 958 | tree v; |
c0bbf652 | 959 | |
28531dd0 | 960 | v = *virtuals; |
c0bbf652 | 961 | |
5e19c053 | 962 | if (fndecl != BV_FN (v) |
4e7512c9 | 963 | || !tree_int_cst_equal (delta, BV_DELTA (v))) |
c0bbf652 | 964 | { |
28531dd0 MM |
965 | /* We need a new vtable for BINFO. */ |
966 | if (make_new_vtable (t, binfo)) | |
967 | { | |
968 | /* If we really did make a new vtable, we also made a copy | |
969 | of the BINFO_VIRTUALS list. Now, we have to find the | |
970 | corresponding entry in that list. */ | |
971 | *virtuals = BINFO_VIRTUALS (binfo); | |
5e19c053 | 972 | while (BV_FN (*virtuals) != BV_FN (v)) |
28531dd0 MM |
973 | *virtuals = TREE_CHAIN (*virtuals); |
974 | v = *virtuals; | |
975 | } | |
8d08fdba | 976 | |
5e19c053 | 977 | BV_DELTA (v) = delta; |
aabb4cd6 | 978 | BV_VCALL_INDEX (v) = NULL_TREE; |
5e19c053 | 979 | BV_FN (v) = fndecl; |
8d08fdba | 980 | } |
8d08fdba MS |
981 | } |
982 | ||
8d08fdba | 983 | \f |
b2a9b208 | 984 | /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is |
b77fe7b4 NS |
985 | the USING_DECL naming METHOD. Returns true if the method could be |
986 | added to the method vec. */ | |
e92cc029 | 987 | |
b77fe7b4 | 988 | bool |
b2a9b208 | 989 | add_method (tree type, tree method, tree using_decl) |
8d08fdba | 990 | { |
9ba5ff0f | 991 | unsigned slot; |
90ea9897 | 992 | tree overload; |
b54a07e8 NS |
993 | bool template_conv_p = false; |
994 | bool conv_p; | |
9771b263 | 995 | vec<tree, va_gc> *method_vec; |
aaaa46d2 | 996 | bool complete_p; |
9ba5ff0f NS |
997 | bool insert_p = false; |
998 | tree current_fns; | |
fc40d49c | 999 | tree fns; |
ac2b3222 AP |
1000 | |
1001 | if (method == error_mark_node) | |
b77fe7b4 | 1002 | return false; |
aaaa46d2 MM |
1003 | |
1004 | complete_p = COMPLETE_TYPE_P (type); | |
b54a07e8 NS |
1005 | conv_p = DECL_CONV_FN_P (method); |
1006 | if (conv_p) | |
1007 | template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL | |
1008 | && DECL_TEMPLATE_CONV_FN_P (method)); | |
452a394b | 1009 | |
452a394b | 1010 | method_vec = CLASSTYPE_METHOD_VEC (type); |
aaaa46d2 MM |
1011 | if (!method_vec) |
1012 | { | |
1013 | /* Make a new method vector. We start with 8 entries. We must | |
1014 | allocate at least two (for constructors and destructors), and | |
1015 | we're going to end up with an assignment operator at some | |
1016 | point as well. */ | |
9771b263 | 1017 | vec_alloc (method_vec, 8); |
aaaa46d2 | 1018 | /* Create slots for constructors and destructors. */ |
9771b263 DN |
1019 | method_vec->quick_push (NULL_TREE); |
1020 | method_vec->quick_push (NULL_TREE); | |
aaaa46d2 MM |
1021 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
1022 | } | |
1023 | ||
0fcedd9c | 1024 | /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */ |
7137605e MM |
1025 | grok_special_member_properties (method); |
1026 | ||
452a394b MM |
1027 | /* Constructors and destructors go in special slots. */ |
1028 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method)) | |
1029 | slot = CLASSTYPE_CONSTRUCTOR_SLOT; | |
1030 | else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) | |
4b0d3cbe MM |
1031 | { |
1032 | slot = CLASSTYPE_DESTRUCTOR_SLOT; | |
c8094d83 | 1033 | |
f5c28a15 | 1034 | if (TYPE_FOR_JAVA (type)) |
9f4faeae MM |
1035 | { |
1036 | if (!DECL_ARTIFICIAL (method)) | |
1037 | error ("Java class %qT cannot have a destructor", type); | |
1038 | else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
1039 | error ("Java class %qT cannot have an implicit non-trivial " | |
1040 | "destructor", | |
1041 | type); | |
1042 | } | |
4b0d3cbe | 1043 | } |
452a394b | 1044 | else |
61a127b3 | 1045 | { |
aaaa46d2 MM |
1046 | tree m; |
1047 | ||
9ba5ff0f | 1048 | insert_p = true; |
452a394b | 1049 | /* See if we already have an entry with this name. */ |
c8094d83 | 1050 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 1051 | vec_safe_iterate (method_vec, slot, &m); |
aaaa46d2 | 1052 | ++slot) |
5dd236e2 | 1053 | { |
5dd236e2 | 1054 | m = OVL_CURRENT (m); |
5dd236e2 NS |
1055 | if (template_conv_p) |
1056 | { | |
aaaa46d2 MM |
1057 | if (TREE_CODE (m) == TEMPLATE_DECL |
1058 | && DECL_TEMPLATE_CONV_FN_P (m)) | |
1059 | insert_p = false; | |
5dd236e2 NS |
1060 | break; |
1061 | } | |
aaaa46d2 | 1062 | if (conv_p && !DECL_CONV_FN_P (m)) |
5dd236e2 | 1063 | break; |
aaaa46d2 | 1064 | if (DECL_NAME (m) == DECL_NAME (method)) |
452a394b | 1065 | { |
aaaa46d2 MM |
1066 | insert_p = false; |
1067 | break; | |
8d08fdba | 1068 | } |
aaaa46d2 MM |
1069 | if (complete_p |
1070 | && !DECL_CONV_FN_P (m) | |
1071 | && DECL_NAME (m) > DECL_NAME (method)) | |
1072 | break; | |
61a127b3 | 1073 | } |
452a394b | 1074 | } |
9771b263 | 1075 | current_fns = insert_p ? NULL_TREE : (*method_vec)[slot]; |
c8094d83 | 1076 | |
fc40d49c LM |
1077 | /* Check to see if we've already got this method. */ |
1078 | for (fns = current_fns; fns; fns = OVL_NEXT (fns)) | |
452a394b | 1079 | { |
fc40d49c LM |
1080 | tree fn = OVL_CURRENT (fns); |
1081 | tree fn_type; | |
1082 | tree method_type; | |
1083 | tree parms1; | |
1084 | tree parms2; | |
1085 | ||
1086 | if (TREE_CODE (fn) != TREE_CODE (method)) | |
1087 | continue; | |
1088 | ||
1089 | /* [over.load] Member function declarations with the | |
1090 | same name and the same parameter types cannot be | |
1091 | overloaded if any of them is a static member | |
1092 | function declaration. | |
1093 | ||
2eed8e37 BK |
1094 | [over.load] Member function declarations with the same name and |
1095 | the same parameter-type-list as well as member function template | |
1096 | declarations with the same name, the same parameter-type-list, and | |
1097 | the same template parameter lists cannot be overloaded if any of | |
1098 | them, but not all, have a ref-qualifier. | |
1099 | ||
fc40d49c LM |
1100 | [namespace.udecl] When a using-declaration brings names |
1101 | from a base class into a derived class scope, member | |
1102 | functions in the derived class override and/or hide member | |
1103 | functions with the same name and parameter types in a base | |
1104 | class (rather than conflicting). */ | |
1105 | fn_type = TREE_TYPE (fn); | |
1106 | method_type = TREE_TYPE (method); | |
1107 | parms1 = TYPE_ARG_TYPES (fn_type); | |
1108 | parms2 = TYPE_ARG_TYPES (method_type); | |
1109 | ||
1110 | /* Compare the quals on the 'this' parm. Don't compare | |
1111 | the whole types, as used functions are treated as | |
1112 | coming from the using class in overload resolution. */ | |
1113 | if (! DECL_STATIC_FUNCTION_P (fn) | |
1114 | && ! DECL_STATIC_FUNCTION_P (method) | |
2eed8e37 BK |
1115 | /* Either both or neither need to be ref-qualified for |
1116 | differing quals to allow overloading. */ | |
1117 | && (FUNCTION_REF_QUALIFIED (fn_type) | |
1118 | == FUNCTION_REF_QUALIFIED (method_type)) | |
1119 | && (type_memfn_quals (fn_type) != type_memfn_quals (method_type) | |
1120 | || type_memfn_rqual (fn_type) != type_memfn_rqual (method_type))) | |
1121 | continue; | |
fc40d49c LM |
1122 | |
1123 | /* For templates, the return type and template parameters | |
1124 | must be identical. */ | |
1125 | if (TREE_CODE (fn) == TEMPLATE_DECL | |
1126 | && (!same_type_p (TREE_TYPE (fn_type), | |
1127 | TREE_TYPE (method_type)) | |
1128 | || !comp_template_parms (DECL_TEMPLATE_PARMS (fn), | |
1129 | DECL_TEMPLATE_PARMS (method)))) | |
1130 | continue; | |
1131 | ||
1132 | if (! DECL_STATIC_FUNCTION_P (fn)) | |
1133 | parms1 = TREE_CHAIN (parms1); | |
1134 | if (! DECL_STATIC_FUNCTION_P (method)) | |
1135 | parms2 = TREE_CHAIN (parms2); | |
1136 | ||
1137 | if (compparms (parms1, parms2) | |
1138 | && (!DECL_CONV_FN_P (fn) | |
1139 | || same_type_p (TREE_TYPE (fn_type), | |
1140 | TREE_TYPE (method_type)))) | |
452a394b | 1141 | { |
3649b9b7 ST |
1142 | /* For function versions, their parms and types match |
1143 | but they are not duplicates. Record function versions | |
1144 | as and when they are found. extern "C" functions are | |
1145 | not treated as versions. */ | |
1146 | if (TREE_CODE (fn) == FUNCTION_DECL | |
1147 | && TREE_CODE (method) == FUNCTION_DECL | |
1148 | && !DECL_EXTERN_C_P (fn) | |
1149 | && !DECL_EXTERN_C_P (method) | |
3649b9b7 ST |
1150 | && targetm.target_option.function_versions (fn, method)) |
1151 | { | |
1152 | /* Mark functions as versions if necessary. Modify the mangled | |
1153 | decl name if necessary. */ | |
1154 | if (!DECL_FUNCTION_VERSIONED (fn)) | |
1155 | { | |
1156 | DECL_FUNCTION_VERSIONED (fn) = 1; | |
1157 | if (DECL_ASSEMBLER_NAME_SET_P (fn)) | |
1158 | mangle_decl (fn); | |
1159 | } | |
1160 | if (!DECL_FUNCTION_VERSIONED (method)) | |
1161 | { | |
1162 | DECL_FUNCTION_VERSIONED (method) = 1; | |
1163 | if (DECL_ASSEMBLER_NAME_SET_P (method)) | |
1164 | mangle_decl (method); | |
1165 | } | |
d52f5295 | 1166 | cgraph_node::record_function_versions (fn, method); |
3649b9b7 ST |
1167 | continue; |
1168 | } | |
85b5d65a JM |
1169 | if (DECL_INHERITED_CTOR_BASE (method)) |
1170 | { | |
1171 | if (DECL_INHERITED_CTOR_BASE (fn)) | |
1172 | { | |
1173 | error_at (DECL_SOURCE_LOCATION (method), | |
1174 | "%q#D inherited from %qT", method, | |
1175 | DECL_INHERITED_CTOR_BASE (method)); | |
1176 | error_at (DECL_SOURCE_LOCATION (fn), | |
1177 | "conflicts with version inherited from %qT", | |
1178 | DECL_INHERITED_CTOR_BASE (fn)); | |
1179 | } | |
1180 | /* Otherwise defer to the other function. */ | |
1181 | return false; | |
1182 | } | |
fc40d49c | 1183 | if (using_decl) |
452a394b | 1184 | { |
fc40d49c LM |
1185 | if (DECL_CONTEXT (fn) == type) |
1186 | /* Defer to the local function. */ | |
1187 | return false; | |
452a394b | 1188 | } |
fc40d49c LM |
1189 | else |
1190 | { | |
1191 | error ("%q+#D cannot be overloaded", method); | |
1192 | error ("with %q+#D", fn); | |
1193 | } | |
1194 | ||
1195 | /* We don't call duplicate_decls here to merge the | |
1196 | declarations because that will confuse things if the | |
1197 | methods have inline definitions. In particular, we | |
1198 | will crash while processing the definitions. */ | |
1199 | return false; | |
03017874 | 1200 | } |
452a394b | 1201 | } |
03017874 | 1202 | |
3db45ab5 | 1203 | /* A class should never have more than one destructor. */ |
357d956e MM |
1204 | if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) |
1205 | return false; | |
1206 | ||
c8094d83 | 1207 | /* Add the new binding. */ |
57910f3a JM |
1208 | if (using_decl) |
1209 | { | |
1210 | overload = ovl_cons (method, current_fns); | |
1211 | OVL_USED (overload) = true; | |
1212 | } | |
1213 | else | |
1214 | overload = build_overload (method, current_fns); | |
c8094d83 | 1215 | |
357d956e MM |
1216 | if (conv_p) |
1217 | TYPE_HAS_CONVERSION (type) = 1; | |
1218 | else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p) | |
90ea9897 MM |
1219 | push_class_level_binding (DECL_NAME (method), overload); |
1220 | ||
9ba5ff0f NS |
1221 | if (insert_p) |
1222 | { | |
efb7e1e0 ILT |
1223 | bool reallocated; |
1224 | ||
9ba5ff0f NS |
1225 | /* We only expect to add few methods in the COMPLETE_P case, so |
1226 | just make room for one more method in that case. */ | |
efb7e1e0 | 1227 | if (complete_p) |
9771b263 | 1228 | reallocated = vec_safe_reserve_exact (method_vec, 1); |
efb7e1e0 | 1229 | else |
9771b263 | 1230 | reallocated = vec_safe_reserve (method_vec, 1); |
efb7e1e0 | 1231 | if (reallocated) |
9ba5ff0f | 1232 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
9771b263 DN |
1233 | if (slot == method_vec->length ()) |
1234 | method_vec->quick_push (overload); | |
9ba5ff0f | 1235 | else |
9771b263 | 1236 | method_vec->quick_insert (slot, overload); |
9ba5ff0f NS |
1237 | } |
1238 | else | |
03fd3f84 | 1239 | /* Replace the current slot. */ |
9771b263 | 1240 | (*method_vec)[slot] = overload; |
b77fe7b4 | 1241 | return true; |
8d08fdba MS |
1242 | } |
1243 | ||
1244 | /* Subroutines of finish_struct. */ | |
1245 | ||
aa52c1ff JM |
1246 | /* Change the access of FDECL to ACCESS in T. Return 1 if change was |
1247 | legit, otherwise return 0. */ | |
e92cc029 | 1248 | |
8d08fdba | 1249 | static int |
94edc4ab | 1250 | alter_access (tree t, tree fdecl, tree access) |
8d08fdba | 1251 | { |
721c3b42 MM |
1252 | tree elem; |
1253 | ||
1254 | if (!DECL_LANG_SPECIFIC (fdecl)) | |
1255 | retrofit_lang_decl (fdecl); | |
1256 | ||
50bc768d | 1257 | gcc_assert (!DECL_DISCRIMINATOR_P (fdecl)); |
8e4ce833 | 1258 | |
721c3b42 | 1259 | elem = purpose_member (t, DECL_ACCESS (fdecl)); |
38afd588 | 1260 | if (elem) |
8d08fdba | 1261 | { |
38afd588 | 1262 | if (TREE_VALUE (elem) != access) |
8d08fdba | 1263 | { |
38afd588 | 1264 | if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL) |
dee15844 JM |
1265 | error ("conflicting access specifications for method" |
1266 | " %q+D, ignored", TREE_TYPE (fdecl)); | |
38afd588 | 1267 | else |
1f070f2b | 1268 | error ("conflicting access specifications for field %qE, ignored", |
4460cef2 | 1269 | DECL_NAME (fdecl)); |
8d08fdba MS |
1270 | } |
1271 | else | |
430bb96b JL |
1272 | { |
1273 | /* They're changing the access to the same thing they changed | |
1274 | it to before. That's OK. */ | |
1275 | ; | |
1276 | } | |
db5ae43f | 1277 | } |
38afd588 | 1278 | else |
8d08fdba | 1279 | { |
0e69fdf0 PC |
1280 | perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl, |
1281 | tf_warning_or_error); | |
be99da77 | 1282 | DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl)); |
8d08fdba MS |
1283 | return 1; |
1284 | } | |
1285 | return 0; | |
1286 | } | |
1287 | ||
58010b57 | 1288 | /* Process the USING_DECL, which is a member of T. */ |
79ad62b2 | 1289 | |
e9659ab0 | 1290 | static void |
94edc4ab | 1291 | handle_using_decl (tree using_decl, tree t) |
79ad62b2 | 1292 | { |
98ed9dae | 1293 | tree decl = USING_DECL_DECLS (using_decl); |
79ad62b2 MM |
1294 | tree name = DECL_NAME (using_decl); |
1295 | tree access | |
1296 | = TREE_PRIVATE (using_decl) ? access_private_node | |
1297 | : TREE_PROTECTED (using_decl) ? access_protected_node | |
1298 | : access_public_node; | |
79ad62b2 | 1299 | tree flist = NULL_TREE; |
aa52c1ff | 1300 | tree old_value; |
79ad62b2 | 1301 | |
98ed9dae | 1302 | gcc_assert (!processing_template_decl && decl); |
c8094d83 | 1303 | |
db422ace PC |
1304 | old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false, |
1305 | tf_warning_or_error); | |
aa52c1ff | 1306 | if (old_value) |
79ad62b2 | 1307 | { |
aa52c1ff JM |
1308 | if (is_overloaded_fn (old_value)) |
1309 | old_value = OVL_CURRENT (old_value); | |
1310 | ||
1311 | if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t) | |
1312 | /* OK */; | |
1313 | else | |
1314 | old_value = NULL_TREE; | |
79ad62b2 | 1315 | } |
c8094d83 | 1316 | |
1bae5891 | 1317 | cp_emit_debug_info_for_using (decl, t); |
c8094d83 | 1318 | |
98ed9dae NS |
1319 | if (is_overloaded_fn (decl)) |
1320 | flist = decl; | |
aa52c1ff JM |
1321 | |
1322 | if (! old_value) | |
1323 | ; | |
1324 | else if (is_overloaded_fn (old_value)) | |
79ad62b2 | 1325 | { |
aa52c1ff JM |
1326 | if (flist) |
1327 | /* It's OK to use functions from a base when there are functions with | |
1328 | the same name already present in the current class. */; | |
1329 | else | |
79ad62b2 | 1330 | { |
dee15844 JM |
1331 | error ("%q+D invalid in %q#T", using_decl, t); |
1332 | error (" because of local method %q+#D with same name", | |
1333 | OVL_CURRENT (old_value)); | |
aa52c1ff | 1334 | return; |
79ad62b2 MM |
1335 | } |
1336 | } | |
186c0fbe | 1337 | else if (!DECL_ARTIFICIAL (old_value)) |
aa52c1ff | 1338 | { |
dee15844 JM |
1339 | error ("%q+D invalid in %q#T", using_decl, t); |
1340 | error (" because of local member %q+#D with same name", old_value); | |
aa52c1ff JM |
1341 | return; |
1342 | } | |
c8094d83 | 1343 | |
f4f206f4 | 1344 | /* Make type T see field decl FDECL with access ACCESS. */ |
aa52c1ff JM |
1345 | if (flist) |
1346 | for (; flist; flist = OVL_NEXT (flist)) | |
1347 | { | |
b2a9b208 | 1348 | add_method (t, OVL_CURRENT (flist), using_decl); |
aa52c1ff JM |
1349 | alter_access (t, OVL_CURRENT (flist), access); |
1350 | } | |
1351 | else | |
98ed9dae | 1352 | alter_access (t, decl, access); |
79ad62b2 | 1353 | } |
8d08fdba | 1354 | \f |
e3501bab | 1355 | /* Data structure for find_abi_tags_r, below. */ |
7dbb85a7 JM |
1356 | |
1357 | struct abi_tag_data | |
1358 | { | |
e3501bab JM |
1359 | tree t; // The type that we're checking for missing tags. |
1360 | tree subob; // The subobject of T that we're getting tags from. | |
1361 | tree tags; // error_mark_node for diagnostics, or a list of missing tags. | |
7dbb85a7 JM |
1362 | }; |
1363 | ||
e3501bab JM |
1364 | /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP |
1365 | in the context of P. TAG can be either an identifier (the DECL_NAME of | |
1366 | a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */ | |
1367 | ||
1368 | static void | |
1369 | check_tag (tree tag, tree *tp, abi_tag_data *p) | |
1370 | { | |
1371 | tree id; | |
1372 | ||
1373 | if (TREE_CODE (tag) == STRING_CST) | |
1374 | id = get_identifier (TREE_STRING_POINTER (tag)); | |
1375 | else | |
1376 | { | |
1377 | id = tag; | |
1378 | tag = NULL_TREE; | |
1379 | } | |
1380 | ||
1381 | if (!IDENTIFIER_MARKED (id)) | |
1382 | { | |
1383 | if (!tag) | |
1384 | tag = build_string (IDENTIFIER_LENGTH (id) + 1, | |
1385 | IDENTIFIER_POINTER (id)); | |
1386 | if (p->tags != error_mark_node) | |
1387 | { | |
1388 | /* We're collecting tags from template arguments. */ | |
1389 | p->tags = tree_cons (NULL_TREE, tag, p->tags); | |
1390 | ABI_TAG_IMPLICIT (p->tags) = true; | |
1391 | ||
1392 | /* Don't inherit this tag multiple times. */ | |
1393 | IDENTIFIER_MARKED (id) = true; | |
1394 | } | |
1395 | ||
1396 | /* Otherwise we're diagnosing missing tags. */ | |
1397 | else if (TYPE_P (p->subob)) | |
1398 | { | |
1399 | if (warning (OPT_Wabi_tag, "%qT does not have the %E abi tag " | |
1400 | "that base %qT has", p->t, tag, p->subob)) | |
1401 | inform (location_of (p->subob), "%qT declared here", | |
1402 | p->subob); | |
1403 | } | |
1404 | else | |
1405 | { | |
1406 | if (warning (OPT_Wabi_tag, "%qT does not have the %E abi tag " | |
1407 | "that %qT (used in the type of %qD) has", | |
1408 | p->t, tag, *tp, p->subob)) | |
1409 | { | |
1410 | inform (location_of (p->subob), "%qD declared here", | |
1411 | p->subob); | |
1412 | inform (location_of (*tp), "%qT declared here", *tp); | |
1413 | } | |
1414 | } | |
1415 | } | |
1416 | } | |
1417 | ||
1418 | /* walk_tree callback for check_abi_tags: if the type at *TP involves any | |
1419 | types with abi tags, add the corresponding identifiers to the VEC in | |
1420 | *DATA and set IDENTIFIER_MARKED. */ | |
1421 | ||
7dbb85a7 | 1422 | static tree |
f585f02f | 1423 | find_abi_tags_r (tree *tp, int *walk_subtrees, void *data) |
7dbb85a7 | 1424 | { |
73243d63 | 1425 | if (!OVERLOAD_TYPE_P (*tp)) |
7dbb85a7 JM |
1426 | return NULL_TREE; |
1427 | ||
f585f02f JM |
1428 | /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE |
1429 | anyway, but let's make sure of it. */ | |
1430 | *walk_subtrees = false; | |
1431 | ||
e3501bab JM |
1432 | abi_tag_data *p = static_cast<struct abi_tag_data*>(data); |
1433 | ||
1434 | for (tree ns = decl_namespace_context (*tp); | |
1435 | ns != global_namespace; | |
1436 | ns = CP_DECL_CONTEXT (ns)) | |
1437 | if (NAMESPACE_ABI_TAG (ns)) | |
1438 | check_tag (DECL_NAME (ns), tp, p); | |
1439 | ||
7dbb85a7 JM |
1440 | if (tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp))) |
1441 | { | |
7dbb85a7 JM |
1442 | for (tree list = TREE_VALUE (attributes); list; |
1443 | list = TREE_CHAIN (list)) | |
1444 | { | |
1445 | tree tag = TREE_VALUE (list); | |
e3501bab | 1446 | check_tag (tag, tp, p); |
7dbb85a7 JM |
1447 | } |
1448 | } | |
1449 | return NULL_TREE; | |
1450 | } | |
1451 | ||
3aaaa103 JM |
1452 | /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively |
1453 | complete) template arguments. */ | |
7dbb85a7 JM |
1454 | |
1455 | static void | |
3aaaa103 | 1456 | mark_type_abi_tags (tree t, bool val) |
7dbb85a7 | 1457 | { |
e3501bab JM |
1458 | for (tree ns = decl_namespace_context (t); |
1459 | ns != global_namespace; | |
1460 | ns = CP_DECL_CONTEXT (ns)) | |
1461 | if (NAMESPACE_ABI_TAG (ns)) | |
1462 | IDENTIFIER_MARKED (DECL_NAME (ns)) = val; | |
1463 | ||
7dbb85a7 JM |
1464 | tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t)); |
1465 | if (attributes) | |
1466 | { | |
1467 | for (tree list = TREE_VALUE (attributes); list; | |
1468 | list = TREE_CHAIN (list)) | |
1469 | { | |
1470 | tree tag = TREE_VALUE (list); | |
1471 | tree id = get_identifier (TREE_STRING_POINTER (tag)); | |
3aaaa103 JM |
1472 | IDENTIFIER_MARKED (id) = val; |
1473 | } | |
1474 | } | |
3aaaa103 JM |
1475 | } |
1476 | ||
1477 | /* Check that class T has all the abi tags that subobject SUBOB has, or | |
1478 | warn if not. */ | |
1479 | ||
1480 | static void | |
1481 | check_abi_tags (tree t, tree subob) | |
1482 | { | |
1483 | mark_type_abi_tags (t, true); | |
7dbb85a7 JM |
1484 | |
1485 | tree subtype = TYPE_P (subob) ? subob : TREE_TYPE (subob); | |
f585f02f | 1486 | struct abi_tag_data data = { t, subob, error_mark_node }; |
7dbb85a7 JM |
1487 | |
1488 | cp_walk_tree_without_duplicates (&subtype, find_abi_tags_r, &data); | |
1489 | ||
3aaaa103 | 1490 | mark_type_abi_tags (t, false); |
7dbb85a7 JM |
1491 | } |
1492 | ||
f585f02f JM |
1493 | void |
1494 | inherit_targ_abi_tags (tree t) | |
1495 | { | |
e9305042 JM |
1496 | if (!CLASS_TYPE_P (t) |
1497 | || CLASSTYPE_TEMPLATE_INFO (t) == NULL_TREE) | |
f585f02f JM |
1498 | return; |
1499 | ||
1500 | mark_type_abi_tags (t, true); | |
1501 | ||
1502 | tree args = CLASSTYPE_TI_ARGS (t); | |
1503 | struct abi_tag_data data = { t, NULL_TREE, NULL_TREE }; | |
1504 | for (int i = 0; i < TMPL_ARGS_DEPTH (args); ++i) | |
1505 | { | |
1506 | tree level = TMPL_ARGS_LEVEL (args, i+1); | |
1507 | for (int j = 0; j < TREE_VEC_LENGTH (level); ++j) | |
1508 | { | |
1509 | tree arg = TREE_VEC_ELT (level, j); | |
1510 | data.subob = arg; | |
1511 | cp_walk_tree_without_duplicates (&arg, find_abi_tags_r, &data); | |
1512 | } | |
1513 | } | |
1514 | ||
1515 | // If we found some tags on our template arguments, add them to our | |
1516 | // abi_tag attribute. | |
1517 | if (data.tags) | |
1518 | { | |
1519 | tree attr = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t)); | |
1520 | if (attr) | |
1521 | TREE_VALUE (attr) = chainon (data.tags, TREE_VALUE (attr)); | |
1522 | else | |
1523 | TYPE_ATTRIBUTES (t) | |
1524 | = tree_cons (get_identifier ("abi_tag"), data.tags, | |
1525 | TYPE_ATTRIBUTES (t)); | |
1526 | } | |
1527 | ||
1528 | mark_type_abi_tags (t, false); | |
1529 | } | |
1530 | ||
880a467b NS |
1531 | /* Return true, iff class T has a non-virtual destructor that is |
1532 | accessible from outside the class heirarchy (i.e. is public, or | |
1533 | there's a suitable friend. */ | |
1534 | ||
1535 | static bool | |
1536 | accessible_nvdtor_p (tree t) | |
1537 | { | |
1538 | tree dtor = CLASSTYPE_DESTRUCTORS (t); | |
1539 | ||
1540 | /* An implicitly declared destructor is always public. And, | |
1541 | if it were virtual, we would have created it by now. */ | |
1542 | if (!dtor) | |
1543 | return true; | |
1544 | ||
1545 | if (DECL_VINDEX (dtor)) | |
1546 | return false; /* Virtual */ | |
1547 | ||
1548 | if (!TREE_PRIVATE (dtor) && !TREE_PROTECTED (dtor)) | |
1549 | return true; /* Public */ | |
1550 | ||
1551 | if (CLASSTYPE_FRIEND_CLASSES (t) | |
1552 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))) | |
1553 | return true; /* Has friends */ | |
1554 | ||
1555 | return false; | |
1556 | } | |
1557 | ||
e5e459bf AO |
1558 | /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P, |
1559 | and NO_CONST_ASN_REF_P. Also set flag bits in T based on | |
1560 | properties of the bases. */ | |
8d08fdba | 1561 | |
607cf131 | 1562 | static void |
94edc4ab | 1563 | check_bases (tree t, |
0cbd7506 | 1564 | int* cant_have_const_ctor_p, |
10746f37 | 1565 | int* no_const_asn_ref_p) |
8d08fdba | 1566 | { |
607cf131 | 1567 | int i; |
0a35513e AH |
1568 | bool seen_non_virtual_nearly_empty_base_p = 0; |
1569 | int seen_tm_mask = 0; | |
fa743e8c NS |
1570 | tree base_binfo; |
1571 | tree binfo; | |
c32097d8 | 1572 | tree field = NULL_TREE; |
8d08fdba | 1573 | |
c32097d8 | 1574 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) |
910ad8de | 1575 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
c32097d8 JM |
1576 | if (TREE_CODE (field) == FIELD_DECL) |
1577 | break; | |
1578 | ||
fa743e8c NS |
1579 | for (binfo = TYPE_BINFO (t), i = 0; |
1580 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
8d08fdba | 1581 | { |
fa743e8c | 1582 | tree basetype = TREE_TYPE (base_binfo); |
9a71c18b | 1583 | |
50bc768d | 1584 | gcc_assert (COMPLETE_TYPE_P (basetype)); |
c8094d83 | 1585 | |
486d481b VV |
1586 | if (CLASSTYPE_FINAL (basetype)) |
1587 | error ("cannot derive from %<final%> base %qT in derived type %qT", | |
1588 | basetype, t); | |
1589 | ||
3b49d762 GDR |
1590 | /* If any base class is non-literal, so is the derived class. */ |
1591 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
1592 | CLASSTYPE_LITERAL_P (t) = false; | |
1593 | ||
607cf131 MM |
1594 | /* If the base class doesn't have copy constructors or |
1595 | assignment operators that take const references, then the | |
1596 | derived class cannot have such a member automatically | |
1597 | generated. */ | |
d758e847 JM |
1598 | if (TYPE_HAS_COPY_CTOR (basetype) |
1599 | && ! TYPE_HAS_CONST_COPY_CTOR (basetype)) | |
607cf131 | 1600 | *cant_have_const_ctor_p = 1; |
066ec0a4 JM |
1601 | if (TYPE_HAS_COPY_ASSIGN (basetype) |
1602 | && !TYPE_HAS_CONST_COPY_ASSIGN (basetype)) | |
607cf131 | 1603 | *no_const_asn_ref_p = 1; |
8d08fdba | 1604 | |
809e3e7f | 1605 | if (BINFO_VIRTUAL_P (base_binfo)) |
00a17e31 | 1606 | /* A virtual base does not effect nearly emptiness. */ |
0fb3018c | 1607 | ; |
f9c528ea | 1608 | else if (CLASSTYPE_NEARLY_EMPTY_P (basetype)) |
0fb3018c NS |
1609 | { |
1610 | if (seen_non_virtual_nearly_empty_base_p) | |
1611 | /* And if there is more than one nearly empty base, then the | |
1612 | derived class is not nearly empty either. */ | |
1613 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
1614 | else | |
00a17e31 | 1615 | /* Remember we've seen one. */ |
0fb3018c NS |
1616 | seen_non_virtual_nearly_empty_base_p = 1; |
1617 | } | |
1618 | else if (!is_empty_class (basetype)) | |
1619 | /* If the base class is not empty or nearly empty, then this | |
1620 | class cannot be nearly empty. */ | |
1621 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
f9c528ea | 1622 | |
607cf131 MM |
1623 | /* A lot of properties from the bases also apply to the derived |
1624 | class. */ | |
8d08fdba | 1625 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype); |
c8094d83 | 1626 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 1627 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype); |
066ec0a4 | 1628 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
d758e847 JM |
1629 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype) |
1630 | || !TYPE_HAS_COPY_ASSIGN (basetype)); | |
1631 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype) | |
1632 | || !TYPE_HAS_COPY_CTOR (basetype)); | |
ac177431 JM |
1633 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |
1634 | |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype); | |
1635 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype); | |
4c6b7393 | 1636 | TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype); |
c8094d83 | 1637 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) |
5ec1192e | 1638 | |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype); |
ac177431 JM |
1639 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) |
1640 | || TYPE_HAS_COMPLEX_DFLT (basetype)); | |
0e02d8e3 PC |
1641 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT |
1642 | (t, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) | |
1643 | | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype)); | |
1644 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT | |
1645 | (t, CLASSTYPE_REF_FIELDS_NEED_INIT (t) | |
1646 | | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype)); | |
c32097d8 JM |
1647 | |
1648 | /* A standard-layout class is a class that: | |
1649 | ... | |
1650 | * has no non-standard-layout base classes, */ | |
1651 | CLASSTYPE_NON_STD_LAYOUT (t) |= CLASSTYPE_NON_STD_LAYOUT (basetype); | |
1652 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) | |
1653 | { | |
1654 | tree basefield; | |
1655 | /* ...has no base classes of the same type as the first non-static | |
1656 | data member... */ | |
1657 | if (field && DECL_CONTEXT (field) == t | |
1658 | && (same_type_ignoring_top_level_qualifiers_p | |
1659 | (TREE_TYPE (field), basetype))) | |
1660 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1661 | else | |
1662 | /* ...either has no non-static data members in the most-derived | |
1663 | class and at most one base class with non-static data | |
1664 | members, or has no base classes with non-static data | |
1665 | members */ | |
1666 | for (basefield = TYPE_FIELDS (basetype); basefield; | |
910ad8de | 1667 | basefield = DECL_CHAIN (basefield)) |
c32097d8 JM |
1668 | if (TREE_CODE (basefield) == FIELD_DECL) |
1669 | { | |
1670 | if (field) | |
1671 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1672 | else | |
1673 | field = basefield; | |
1674 | break; | |
1675 | } | |
1676 | } | |
0a35513e AH |
1677 | |
1678 | /* Don't bother collecting tm attributes if transactional memory | |
1679 | support is not enabled. */ | |
1680 | if (flag_tm) | |
1681 | { | |
1682 | tree tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (basetype)); | |
1683 | if (tm_attr) | |
1684 | seen_tm_mask |= tm_attr_to_mask (tm_attr); | |
1685 | } | |
7dbb85a7 JM |
1686 | |
1687 | check_abi_tags (t, basetype); | |
0a35513e AH |
1688 | } |
1689 | ||
1690 | /* If one of the base classes had TM attributes, and the current class | |
1691 | doesn't define its own, then the current class inherits one. */ | |
1692 | if (seen_tm_mask && !find_tm_attribute (TYPE_ATTRIBUTES (t))) | |
1693 | { | |
1694 | tree tm_attr = tm_mask_to_attr (seen_tm_mask & -seen_tm_mask); | |
1695 | TYPE_ATTRIBUTES (t) = tree_cons (tm_attr, NULL, TYPE_ATTRIBUTES (t)); | |
607cf131 MM |
1696 | } |
1697 | } | |
1698 | ||
fc6633e0 NS |
1699 | /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for |
1700 | those that are primaries. Sets BINFO_LOST_PRIMARY_P for those | |
1701 | that have had a nearly-empty virtual primary base stolen by some | |
77880ae4 | 1702 | other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for |
fc6633e0 | 1703 | T. */ |
c35cce41 MM |
1704 | |
1705 | static void | |
fc6633e0 | 1706 | determine_primary_bases (tree t) |
c35cce41 | 1707 | { |
fc6633e0 NS |
1708 | unsigned i; |
1709 | tree primary = NULL_TREE; | |
1710 | tree type_binfo = TYPE_BINFO (t); | |
1711 | tree base_binfo; | |
1712 | ||
1713 | /* Determine the primary bases of our bases. */ | |
1714 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1715 | base_binfo = TREE_CHAIN (base_binfo)) | |
c35cce41 | 1716 | { |
fc6633e0 | 1717 | tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo)); |
c35cce41 | 1718 | |
fc6633e0 NS |
1719 | /* See if we're the non-virtual primary of our inheritance |
1720 | chain. */ | |
1721 | if (!BINFO_VIRTUAL_P (base_binfo)) | |
dbbf88d1 | 1722 | { |
fc6633e0 NS |
1723 | tree parent = BINFO_INHERITANCE_CHAIN (base_binfo); |
1724 | tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent)); | |
c8094d83 | 1725 | |
fc6633e0 | 1726 | if (parent_primary |
539ed333 NS |
1727 | && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), |
1728 | BINFO_TYPE (parent_primary))) | |
fc6633e0 NS |
1729 | /* We are the primary binfo. */ |
1730 | BINFO_PRIMARY_P (base_binfo) = 1; | |
1731 | } | |
1732 | /* Determine if we have a virtual primary base, and mark it so. | |
1733 | */ | |
1734 | if (primary && BINFO_VIRTUAL_P (primary)) | |
1735 | { | |
1736 | tree this_primary = copied_binfo (primary, base_binfo); | |
1737 | ||
1738 | if (BINFO_PRIMARY_P (this_primary)) | |
1739 | /* Someone already claimed this base. */ | |
1740 | BINFO_LOST_PRIMARY_P (base_binfo) = 1; | |
1741 | else | |
dbbf88d1 | 1742 | { |
fc6633e0 | 1743 | tree delta; |
c8094d83 | 1744 | |
fc6633e0 NS |
1745 | BINFO_PRIMARY_P (this_primary) = 1; |
1746 | BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo; | |
c8094d83 | 1747 | |
fc6633e0 | 1748 | /* A virtual binfo might have been copied from within |
0cbd7506 MS |
1749 | another hierarchy. As we're about to use it as a |
1750 | primary base, make sure the offsets match. */ | |
db3927fb AH |
1751 | delta = size_diffop_loc (input_location, |
1752 | convert (ssizetype, | |
fc6633e0 NS |
1753 | BINFO_OFFSET (base_binfo)), |
1754 | convert (ssizetype, | |
1755 | BINFO_OFFSET (this_primary))); | |
c8094d83 | 1756 | |
fc6633e0 | 1757 | propagate_binfo_offsets (this_primary, delta); |
dbbf88d1 NS |
1758 | } |
1759 | } | |
c35cce41 | 1760 | } |
8026246f | 1761 | |
fc6633e0 | 1762 | /* First look for a dynamic direct non-virtual base. */ |
fa743e8c | 1763 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++) |
607cf131 | 1764 | { |
607cf131 | 1765 | tree basetype = BINFO_TYPE (base_binfo); |
aff08c18 | 1766 | |
fc6633e0 | 1767 | if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo)) |
8d08fdba | 1768 | { |
fc6633e0 NS |
1769 | primary = base_binfo; |
1770 | goto found; | |
911a71a7 MM |
1771 | } |
1772 | } | |
8026246f | 1773 | |
3461fba7 | 1774 | /* A "nearly-empty" virtual base class can be the primary base |
fc6633e0 NS |
1775 | class, if no non-virtual polymorphic base can be found. Look for |
1776 | a nearly-empty virtual dynamic base that is not already a primary | |
77880ae4 | 1777 | base of something in the hierarchy. If there is no such base, |
fc6633e0 NS |
1778 | just pick the first nearly-empty virtual base. */ |
1779 | ||
1780 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1781 | base_binfo = TREE_CHAIN (base_binfo)) | |
1782 | if (BINFO_VIRTUAL_P (base_binfo) | |
1783 | && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo))) | |
1784 | { | |
1785 | if (!BINFO_PRIMARY_P (base_binfo)) | |
1786 | { | |
1787 | /* Found one that is not primary. */ | |
1788 | primary = base_binfo; | |
1789 | goto found; | |
1790 | } | |
1791 | else if (!primary) | |
1792 | /* Remember the first candidate. */ | |
1793 | primary = base_binfo; | |
1794 | } | |
c8094d83 | 1795 | |
fc6633e0 NS |
1796 | found: |
1797 | /* If we've got a primary base, use it. */ | |
1798 | if (primary) | |
7cafdb8b | 1799 | { |
fc6633e0 | 1800 | tree basetype = BINFO_TYPE (primary); |
c8094d83 | 1801 | |
fc6633e0 NS |
1802 | CLASSTYPE_PRIMARY_BINFO (t) = primary; |
1803 | if (BINFO_PRIMARY_P (primary)) | |
1804 | /* We are stealing a primary base. */ | |
1805 | BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1; | |
1806 | BINFO_PRIMARY_P (primary) = 1; | |
1807 | if (BINFO_VIRTUAL_P (primary)) | |
7cafdb8b | 1808 | { |
fc6633e0 | 1809 | tree delta; |
7cafdb8b | 1810 | |
fc6633e0 NS |
1811 | BINFO_INHERITANCE_CHAIN (primary) = type_binfo; |
1812 | /* A virtual binfo might have been copied from within | |
0cbd7506 MS |
1813 | another hierarchy. As we're about to use it as a primary |
1814 | base, make sure the offsets match. */ | |
db3927fb | 1815 | delta = size_diffop_loc (input_location, ssize_int (0), |
fc6633e0 | 1816 | convert (ssizetype, BINFO_OFFSET (primary))); |
c8094d83 | 1817 | |
fc6633e0 | 1818 | propagate_binfo_offsets (primary, delta); |
7cafdb8b | 1819 | } |
c8094d83 | 1820 | |
fc6633e0 | 1821 | primary = TYPE_BINFO (basetype); |
c8094d83 | 1822 | |
fc6633e0 NS |
1823 | TYPE_VFIELD (t) = TYPE_VFIELD (basetype); |
1824 | BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary); | |
1825 | BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary); | |
7cafdb8b | 1826 | } |
8d08fdba | 1827 | } |
e92cc029 | 1828 | |
d0940d56 DS |
1829 | /* Update the variant types of T. */ |
1830 | ||
1831 | void | |
1832 | fixup_type_variants (tree t) | |
8d08fdba | 1833 | { |
090ad434 | 1834 | tree variants; |
c8094d83 | 1835 | |
d0940d56 DS |
1836 | if (!t) |
1837 | return; | |
1838 | ||
090ad434 NS |
1839 | for (variants = TYPE_NEXT_VARIANT (t); |
1840 | variants; | |
1841 | variants = TYPE_NEXT_VARIANT (variants)) | |
8d08fdba MS |
1842 | { |
1843 | /* These fields are in the _TYPE part of the node, not in | |
1844 | the TYPE_LANG_SPECIFIC component, so they are not shared. */ | |
0fcedd9c | 1845 | TYPE_HAS_USER_CONSTRUCTOR (variants) = TYPE_HAS_USER_CONSTRUCTOR (t); |
8d08fdba | 1846 | TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t); |
c8094d83 | 1847 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants) |
834c6dff | 1848 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
8d08fdba | 1849 | |
4c6b7393 | 1850 | TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t); |
c8094d83 | 1851 | |
cad7e87b NS |
1852 | TYPE_BINFO (variants) = TYPE_BINFO (t); |
1853 | ||
8d08fdba | 1854 | /* Copy whatever these are holding today. */ |
eb34af89 RK |
1855 | TYPE_VFIELD (variants) = TYPE_VFIELD (t); |
1856 | TYPE_METHODS (variants) = TYPE_METHODS (t); | |
5566b478 | 1857 | TYPE_FIELDS (variants) = TYPE_FIELDS (t); |
8943989d JM |
1858 | } |
1859 | } | |
1860 | ||
1861 | /* Early variant fixups: we apply attributes at the beginning of the class | |
1862 | definition, and we need to fix up any variants that have already been | |
1863 | made via elaborated-type-specifier so that check_qualified_type works. */ | |
1864 | ||
1865 | void | |
1866 | fixup_attribute_variants (tree t) | |
1867 | { | |
1868 | tree variants; | |
5818c8e4 | 1869 | |
8943989d JM |
1870 | if (!t) |
1871 | return; | |
1872 | ||
1873 | for (variants = TYPE_NEXT_VARIANT (t); | |
1874 | variants; | |
1875 | variants = TYPE_NEXT_VARIANT (variants)) | |
1876 | { | |
1877 | /* These are the two fields that check_qualified_type looks at and | |
1878 | are affected by attributes. */ | |
5818c8e4 | 1879 | TYPE_ATTRIBUTES (variants) = TYPE_ATTRIBUTES (t); |
8943989d | 1880 | TYPE_ALIGN (variants) = TYPE_ALIGN (t); |
8d08fdba | 1881 | } |
d0940d56 | 1882 | } |
d0940d56 DS |
1883 | \f |
1884 | /* Set memoizing fields and bits of T (and its variants) for later | |
1885 | use. */ | |
1886 | ||
1887 | static void | |
1888 | finish_struct_bits (tree t) | |
1889 | { | |
1890 | /* Fix up variants (if any). */ | |
1891 | fixup_type_variants (t); | |
8d08fdba | 1892 | |
fa743e8c | 1893 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t)) |
16ae29f1 NS |
1894 | /* For a class w/o baseclasses, 'finish_struct' has set |
1895 | CLASSTYPE_PURE_VIRTUALS correctly (by definition). | |
132c7dd3 NS |
1896 | Similarly for a class whose base classes do not have vtables. |
1897 | When neither of these is true, we might have removed abstract | |
1898 | virtuals (by providing a definition), added some (by declaring | |
1899 | new ones), or redeclared ones from a base class. We need to | |
1900 | recalculate what's really an abstract virtual at this point (by | |
1901 | looking in the vtables). */ | |
1902 | get_pure_virtuals (t); | |
c8094d83 | 1903 | |
132c7dd3 NS |
1904 | /* If this type has a copy constructor or a destructor, force its |
1905 | mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be | |
1906 | nonzero. This will cause it to be passed by invisible reference | |
1907 | and prevent it from being returned in a register. */ | |
d758e847 JM |
1908 | if (type_has_nontrivial_copy_init (t) |
1909 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
8d08fdba | 1910 | { |
e8abc66f | 1911 | tree variants; |
d2e5ee5c | 1912 | DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode; |
e8abc66f | 1913 | for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants)) |
8d08fdba | 1914 | { |
179d2f74 | 1915 | SET_TYPE_MODE (variants, BLKmode); |
8d08fdba | 1916 | TREE_ADDRESSABLE (variants) = 1; |
8d08fdba MS |
1917 | } |
1918 | } | |
1919 | } | |
1920 | ||
b0e0b31f | 1921 | /* Issue warnings about T having private constructors, but no friends, |
c8094d83 | 1922 | and so forth. |
aed7b2a6 | 1923 | |
b0e0b31f MM |
1924 | HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or |
1925 | static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any | |
1926 | non-private static member functions. */ | |
1927 | ||
1928 | static void | |
94edc4ab | 1929 | maybe_warn_about_overly_private_class (tree t) |
aed7b2a6 | 1930 | { |
056a3b12 MM |
1931 | int has_member_fn = 0; |
1932 | int has_nonprivate_method = 0; | |
1933 | tree fn; | |
1934 | ||
1935 | if (!warn_ctor_dtor_privacy | |
b0e0b31f MM |
1936 | /* If the class has friends, those entities might create and |
1937 | access instances, so we should not warn. */ | |
056a3b12 MM |
1938 | || (CLASSTYPE_FRIEND_CLASSES (t) |
1939 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))) | |
b0e0b31f MM |
1940 | /* We will have warned when the template was declared; there's |
1941 | no need to warn on every instantiation. */ | |
056a3b12 | 1942 | || CLASSTYPE_TEMPLATE_INSTANTIATION (t)) |
c8094d83 | 1943 | /* There's no reason to even consider warning about this |
056a3b12 MM |
1944 | class. */ |
1945 | return; | |
c8094d83 | 1946 | |
056a3b12 MM |
1947 | /* We only issue one warning, if more than one applies, because |
1948 | otherwise, on code like: | |
1949 | ||
1950 | class A { | |
1951 | // Oops - forgot `public:' | |
1952 | A(); | |
1953 | A(const A&); | |
1954 | ~A(); | |
1955 | }; | |
1956 | ||
1957 | we warn several times about essentially the same problem. */ | |
1958 | ||
1959 | /* Check to see if all (non-constructor, non-destructor) member | |
1960 | functions are private. (Since there are no friends or | |
1961 | non-private statics, we can't ever call any of the private member | |
1962 | functions.) */ | |
910ad8de | 1963 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
056a3b12 MM |
1964 | /* We're not interested in compiler-generated methods; they don't |
1965 | provide any way to call private members. */ | |
c8094d83 | 1966 | if (!DECL_ARTIFICIAL (fn)) |
056a3b12 MM |
1967 | { |
1968 | if (!TREE_PRIVATE (fn)) | |
b0e0b31f | 1969 | { |
c8094d83 | 1970 | if (DECL_STATIC_FUNCTION_P (fn)) |
056a3b12 MM |
1971 | /* A non-private static member function is just like a |
1972 | friend; it can create and invoke private member | |
1973 | functions, and be accessed without a class | |
1974 | instance. */ | |
1975 | return; | |
c8094d83 | 1976 | |
056a3b12 | 1977 | has_nonprivate_method = 1; |
f576dfc4 | 1978 | /* Keep searching for a static member function. */ |
056a3b12 | 1979 | } |
ce0a5952 | 1980 | else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn)) |
056a3b12 | 1981 | has_member_fn = 1; |
c8094d83 | 1982 | } |
aed7b2a6 | 1983 | |
c8094d83 | 1984 | if (!has_nonprivate_method && has_member_fn) |
056a3b12 | 1985 | { |
ce0a5952 MM |
1986 | /* There are no non-private methods, and there's at least one |
1987 | private member function that isn't a constructor or | |
1988 | destructor. (If all the private members are | |
1989 | constructors/destructors we want to use the code below that | |
1990 | issues error messages specifically referring to | |
1991 | constructors/destructors.) */ | |
fa743e8c | 1992 | unsigned i; |
dbbf88d1 | 1993 | tree binfo = TYPE_BINFO (t); |
c8094d83 | 1994 | |
fa743e8c | 1995 | for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++) |
604a3205 | 1996 | if (BINFO_BASE_ACCESS (binfo, i) != access_private_node) |
056a3b12 MM |
1997 | { |
1998 | has_nonprivate_method = 1; | |
1999 | break; | |
2000 | } | |
c8094d83 | 2001 | if (!has_nonprivate_method) |
b0e0b31f | 2002 | { |
74fa0285 | 2003 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 2004 | "all member functions in class %qT are private", t); |
056a3b12 | 2005 | return; |
b0e0b31f | 2006 | } |
056a3b12 | 2007 | } |
aed7b2a6 | 2008 | |
056a3b12 MM |
2009 | /* Even if some of the member functions are non-private, the class |
2010 | won't be useful for much if all the constructors or destructors | |
2011 | are private: such an object can never be created or destroyed. */ | |
9f4faeae MM |
2012 | fn = CLASSTYPE_DESTRUCTORS (t); |
2013 | if (fn && TREE_PRIVATE (fn)) | |
056a3b12 | 2014 | { |
74fa0285 | 2015 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 2016 | "%q#T only defines a private destructor and has no friends", |
4b0d3cbe MM |
2017 | t); |
2018 | return; | |
056a3b12 | 2019 | } |
b0e0b31f | 2020 | |
0fcedd9c JM |
2021 | /* Warn about classes that have private constructors and no friends. */ |
2022 | if (TYPE_HAS_USER_CONSTRUCTOR (t) | |
550d1bf4 MM |
2023 | /* Implicitly generated constructors are always public. */ |
2024 | && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t) | |
2025 | || !CLASSTYPE_LAZY_COPY_CTOR (t))) | |
056a3b12 MM |
2026 | { |
2027 | int nonprivate_ctor = 0; | |
c8094d83 | 2028 | |
056a3b12 MM |
2029 | /* If a non-template class does not define a copy |
2030 | constructor, one is defined for it, enabling it to avoid | |
2031 | this warning. For a template class, this does not | |
2032 | happen, and so we would normally get a warning on: | |
b0e0b31f | 2033 | |
c8094d83 MS |
2034 | template <class T> class C { private: C(); }; |
2035 | ||
066ec0a4 | 2036 | To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All |
056a3b12 MM |
2037 | complete non-template or fully instantiated classes have this |
2038 | flag set. */ | |
066ec0a4 | 2039 | if (!TYPE_HAS_COPY_CTOR (t)) |
056a3b12 | 2040 | nonprivate_ctor = 1; |
c8094d83 MS |
2041 | else |
2042 | for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn)) | |
056a3b12 MM |
2043 | { |
2044 | tree ctor = OVL_CURRENT (fn); | |
2045 | /* Ideally, we wouldn't count copy constructors (or, in | |
2046 | fact, any constructor that takes an argument of the | |
2047 | class type as a parameter) because such things cannot | |
2048 | be used to construct an instance of the class unless | |
2049 | you already have one. But, for now at least, we're | |
2050 | more generous. */ | |
2051 | if (! TREE_PRIVATE (ctor)) | |
b0e0b31f | 2052 | { |
056a3b12 MM |
2053 | nonprivate_ctor = 1; |
2054 | break; | |
b0e0b31f | 2055 | } |
056a3b12 | 2056 | } |
aed7b2a6 | 2057 | |
056a3b12 MM |
2058 | if (nonprivate_ctor == 0) |
2059 | { | |
74fa0285 | 2060 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 2061 | "%q#T only defines private constructors and has no friends", |
0cbd7506 | 2062 | t); |
056a3b12 | 2063 | return; |
b0e0b31f MM |
2064 | } |
2065 | } | |
aed7b2a6 MM |
2066 | } |
2067 | ||
17211ab5 GK |
2068 | static struct { |
2069 | gt_pointer_operator new_value; | |
2070 | void *cookie; | |
2071 | } resort_data; | |
2072 | ||
f90cdf34 MT |
2073 | /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */ |
2074 | ||
2075 | static int | |
94edc4ab | 2076 | method_name_cmp (const void* m1_p, const void* m2_p) |
f90cdf34 | 2077 | { |
67f5655f GDR |
2078 | const tree *const m1 = (const tree *) m1_p; |
2079 | const tree *const m2 = (const tree *) m2_p; | |
c8094d83 | 2080 | |
f90cdf34 MT |
2081 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
2082 | return 0; | |
2083 | if (*m1 == NULL_TREE) | |
2084 | return -1; | |
2085 | if (*m2 == NULL_TREE) | |
2086 | return 1; | |
2087 | if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2))) | |
2088 | return -1; | |
2089 | return 1; | |
2090 | } | |
b0e0b31f | 2091 | |
17211ab5 GK |
2092 | /* This routine compares two fields like method_name_cmp but using the |
2093 | pointer operator in resort_field_decl_data. */ | |
2094 | ||
2095 | static int | |
94edc4ab | 2096 | resort_method_name_cmp (const void* m1_p, const void* m2_p) |
17211ab5 | 2097 | { |
67f5655f GDR |
2098 | const tree *const m1 = (const tree *) m1_p; |
2099 | const tree *const m2 = (const tree *) m2_p; | |
17211ab5 GK |
2100 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
2101 | return 0; | |
2102 | if (*m1 == NULL_TREE) | |
2103 | return -1; | |
2104 | if (*m2 == NULL_TREE) | |
2105 | return 1; | |
2106 | { | |
2107 | tree d1 = DECL_NAME (OVL_CURRENT (*m1)); | |
2108 | tree d2 = DECL_NAME (OVL_CURRENT (*m2)); | |
2109 | resort_data.new_value (&d1, resort_data.cookie); | |
2110 | resort_data.new_value (&d2, resort_data.cookie); | |
2111 | if (d1 < d2) | |
2112 | return -1; | |
2113 | } | |
2114 | return 1; | |
2115 | } | |
2116 | ||
2117 | /* Resort TYPE_METHOD_VEC because pointers have been reordered. */ | |
2118 | ||
c8094d83 | 2119 | void |
94edc4ab | 2120 | resort_type_method_vec (void* obj, |
12308bc6 | 2121 | void* /*orig_obj*/, |
0cbd7506 MS |
2122 | gt_pointer_operator new_value, |
2123 | void* cookie) | |
17211ab5 | 2124 | { |
9771b263 DN |
2125 | vec<tree, va_gc> *method_vec = (vec<tree, va_gc> *) obj; |
2126 | int len = vec_safe_length (method_vec); | |
aaaa46d2 MM |
2127 | size_t slot; |
2128 | tree fn; | |
17211ab5 GK |
2129 | |
2130 | /* The type conversion ops have to live at the front of the vec, so we | |
2131 | can't sort them. */ | |
aaaa46d2 | 2132 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2133 | vec_safe_iterate (method_vec, slot, &fn); |
aaaa46d2 MM |
2134 | ++slot) |
2135 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn))) | |
2136 | break; | |
2137 | ||
17211ab5 GK |
2138 | if (len - slot > 1) |
2139 | { | |
2140 | resort_data.new_value = new_value; | |
2141 | resort_data.cookie = cookie; | |
9771b263 | 2142 | qsort (method_vec->address () + slot, len - slot, sizeof (tree), |
17211ab5 GK |
2143 | resort_method_name_cmp); |
2144 | } | |
2145 | } | |
2146 | ||
c7222c02 | 2147 | /* Warn about duplicate methods in fn_fields. |
8d08fdba | 2148 | |
5b0cec3b MM |
2149 | Sort methods that are not special (i.e., constructors, destructors, |
2150 | and type conversion operators) so that we can find them faster in | |
2151 | search. */ | |
8d08fdba | 2152 | |
b0e0b31f | 2153 | static void |
94edc4ab | 2154 | finish_struct_methods (tree t) |
8d08fdba | 2155 | { |
b0e0b31f | 2156 | tree fn_fields; |
9771b263 | 2157 | vec<tree, va_gc> *method_vec; |
58010b57 MM |
2158 | int slot, len; |
2159 | ||
58010b57 | 2160 | method_vec = CLASSTYPE_METHOD_VEC (t); |
508a1c9c MM |
2161 | if (!method_vec) |
2162 | return; | |
2163 | ||
9771b263 | 2164 | len = method_vec->length (); |
8d08fdba | 2165 | |
c7222c02 | 2166 | /* Clear DECL_IN_AGGR_P for all functions. */ |
c8094d83 | 2167 | for (fn_fields = TYPE_METHODS (t); fn_fields; |
910ad8de | 2168 | fn_fields = DECL_CHAIN (fn_fields)) |
5b0cec3b | 2169 | DECL_IN_AGGR_P (fn_fields) = 0; |
8d08fdba | 2170 | |
b0e0b31f MM |
2171 | /* Issue warnings about private constructors and such. If there are |
2172 | no methods, then some public defaults are generated. */ | |
f90cdf34 MT |
2173 | maybe_warn_about_overly_private_class (t); |
2174 | ||
f90cdf34 MT |
2175 | /* The type conversion ops have to live at the front of the vec, so we |
2176 | can't sort them. */ | |
9ba5ff0f | 2177 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2178 | method_vec->iterate (slot, &fn_fields); |
aaaa46d2 MM |
2179 | ++slot) |
2180 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields))) | |
2181 | break; | |
f90cdf34 | 2182 | if (len - slot > 1) |
9771b263 | 2183 | qsort (method_vec->address () + slot, |
aaaa46d2 | 2184 | len-slot, sizeof (tree), method_name_cmp); |
8d08fdba MS |
2185 | } |
2186 | ||
90ecce3e | 2187 | /* Make BINFO's vtable have N entries, including RTTI entries, |
3b426391 | 2188 | vbase and vcall offsets, etc. Set its type and call the back end |
8d7a5379 | 2189 | to lay it out. */ |
1a588ad7 MM |
2190 | |
2191 | static void | |
94edc4ab | 2192 | layout_vtable_decl (tree binfo, int n) |
1a588ad7 | 2193 | { |
1a588ad7 | 2194 | tree atype; |
c35cce41 | 2195 | tree vtable; |
1a588ad7 | 2196 | |
dcedcddb | 2197 | atype = build_array_of_n_type (vtable_entry_type, n); |
1a588ad7 MM |
2198 | layout_type (atype); |
2199 | ||
2200 | /* We may have to grow the vtable. */ | |
c35cce41 MM |
2201 | vtable = get_vtbl_decl_for_binfo (binfo); |
2202 | if (!same_type_p (TREE_TYPE (vtable), atype)) | |
1a588ad7 | 2203 | { |
06ceef4e | 2204 | TREE_TYPE (vtable) = atype; |
c35cce41 | 2205 | DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE; |
06ceef4e | 2206 | layout_decl (vtable, 0); |
1a588ad7 MM |
2207 | } |
2208 | } | |
2209 | ||
9bab6c90 MM |
2210 | /* True iff FNDECL and BASE_FNDECL (both non-static member functions) |
2211 | have the same signature. */ | |
83f2ccf4 | 2212 | |
e0fff4b3 | 2213 | int |
58f9752a | 2214 | same_signature_p (const_tree fndecl, const_tree base_fndecl) |
83f2ccf4 | 2215 | { |
872f37f9 MM |
2216 | /* One destructor overrides another if they are the same kind of |
2217 | destructor. */ | |
2218 | if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl) | |
2219 | && special_function_p (base_fndecl) == special_function_p (fndecl)) | |
ca36f057 | 2220 | return 1; |
872f37f9 MM |
2221 | /* But a non-destructor never overrides a destructor, nor vice |
2222 | versa, nor do different kinds of destructors override | |
2223 | one-another. For example, a complete object destructor does not | |
2224 | override a deleting destructor. */ | |
0d9eb3ba | 2225 | if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl)) |
ca36f057 | 2226 | return 0; |
872f37f9 | 2227 | |
a6c0d772 MM |
2228 | if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl) |
2229 | || (DECL_CONV_FN_P (fndecl) | |
2230 | && DECL_CONV_FN_P (base_fndecl) | |
2231 | && same_type_p (DECL_CONV_FN_TYPE (fndecl), | |
2232 | DECL_CONV_FN_TYPE (base_fndecl)))) | |
83f2ccf4 | 2233 | { |
c4101929 JM |
2234 | tree fntype = TREE_TYPE (fndecl); |
2235 | tree base_fntype = TREE_TYPE (base_fndecl); | |
2236 | if (type_memfn_quals (fntype) == type_memfn_quals (base_fntype) | |
2237 | && type_memfn_rqual (fntype) == type_memfn_rqual (base_fntype) | |
2238 | && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl), | |
2239 | FUNCTION_FIRST_USER_PARMTYPE (base_fndecl))) | |
ca36f057 | 2240 | return 1; |
83f2ccf4 | 2241 | } |
ca36f057 | 2242 | return 0; |
83f2ccf4 MM |
2243 | } |
2244 | ||
9368208b MM |
2245 | /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a |
2246 | subobject. */ | |
c8094d83 | 2247 | |
9368208b MM |
2248 | static bool |
2249 | base_derived_from (tree derived, tree base) | |
2250 | { | |
dbbf88d1 NS |
2251 | tree probe; |
2252 | ||
2253 | for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
2254 | { | |
2255 | if (probe == derived) | |
2256 | return true; | |
809e3e7f | 2257 | else if (BINFO_VIRTUAL_P (probe)) |
dbbf88d1 NS |
2258 | /* If we meet a virtual base, we can't follow the inheritance |
2259 | any more. See if the complete type of DERIVED contains | |
2260 | such a virtual base. */ | |
58c42dc2 NS |
2261 | return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived)) |
2262 | != NULL_TREE); | |
dbbf88d1 NS |
2263 | } |
2264 | return false; | |
9368208b MM |
2265 | } |
2266 | ||
ca36f057 MM |
2267 | typedef struct find_final_overrider_data_s { |
2268 | /* The function for which we are trying to find a final overrider. */ | |
2269 | tree fn; | |
2270 | /* The base class in which the function was declared. */ | |
2271 | tree declaring_base; | |
9368208b | 2272 | /* The candidate overriders. */ |
78b45a24 | 2273 | tree candidates; |
5d5a519f | 2274 | /* Path to most derived. */ |
9771b263 | 2275 | vec<tree> path; |
ca36f057 | 2276 | } find_final_overrider_data; |
8d7a5379 | 2277 | |
f7a8132a MM |
2278 | /* Add the overrider along the current path to FFOD->CANDIDATES. |
2279 | Returns true if an overrider was found; false otherwise. */ | |
8d7a5379 | 2280 | |
f7a8132a | 2281 | static bool |
c8094d83 | 2282 | dfs_find_final_overrider_1 (tree binfo, |
5d5a519f NS |
2283 | find_final_overrider_data *ffod, |
2284 | unsigned depth) | |
7177d104 | 2285 | { |
741d8ca3 MM |
2286 | tree method; |
2287 | ||
f7a8132a MM |
2288 | /* If BINFO is not the most derived type, try a more derived class. |
2289 | A definition there will overrider a definition here. */ | |
5d5a519f | 2290 | if (depth) |
dbbf88d1 | 2291 | { |
5d5a519f NS |
2292 | depth--; |
2293 | if (dfs_find_final_overrider_1 | |
9771b263 | 2294 | (ffod->path[depth], ffod, depth)) |
f7a8132a MM |
2295 | return true; |
2296 | } | |
dbbf88d1 | 2297 | |
741d8ca3 | 2298 | method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn); |
f7a8132a MM |
2299 | if (method) |
2300 | { | |
2301 | tree *candidate = &ffod->candidates; | |
c8094d83 | 2302 | |
f7a8132a MM |
2303 | /* Remove any candidates overridden by this new function. */ |
2304 | while (*candidate) | |
8d7a5379 | 2305 | { |
f7a8132a MM |
2306 | /* If *CANDIDATE overrides METHOD, then METHOD |
2307 | cannot override anything else on the list. */ | |
2308 | if (base_derived_from (TREE_VALUE (*candidate), binfo)) | |
2309 | return true; | |
2310 | /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */ | |
2311 | if (base_derived_from (binfo, TREE_VALUE (*candidate))) | |
2312 | *candidate = TREE_CHAIN (*candidate); | |
dbbf88d1 | 2313 | else |
f7a8132a | 2314 | candidate = &TREE_CHAIN (*candidate); |
5e19c053 | 2315 | } |
c8094d83 | 2316 | |
f7a8132a MM |
2317 | /* Add the new function. */ |
2318 | ffod->candidates = tree_cons (method, binfo, ffod->candidates); | |
2319 | return true; | |
dbbf88d1 | 2320 | } |
5e19c053 | 2321 | |
f7a8132a MM |
2322 | return false; |
2323 | } | |
2324 | ||
2325 | /* Called from find_final_overrider via dfs_walk. */ | |
2326 | ||
2327 | static tree | |
5d5a519f | 2328 | dfs_find_final_overrider_pre (tree binfo, void *data) |
f7a8132a MM |
2329 | { |
2330 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; | |
2331 | ||
2332 | if (binfo == ffod->declaring_base) | |
9771b263 DN |
2333 | dfs_find_final_overrider_1 (binfo, ffod, ffod->path.length ()); |
2334 | ffod->path.safe_push (binfo); | |
f7a8132a | 2335 | |
dbbf88d1 NS |
2336 | return NULL_TREE; |
2337 | } | |
db3d8cde | 2338 | |
dbbf88d1 | 2339 | static tree |
12308bc6 | 2340 | dfs_find_final_overrider_post (tree /*binfo*/, void *data) |
dbbf88d1 | 2341 | { |
dbbf88d1 | 2342 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; |
9771b263 | 2343 | ffod->path.pop (); |
78b45a24 | 2344 | |
dd42e135 MM |
2345 | return NULL_TREE; |
2346 | } | |
2347 | ||
5e19c053 MM |
2348 | /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for |
2349 | FN and whose TREE_VALUE is the binfo for the base where the | |
95675950 MM |
2350 | overriding occurs. BINFO (in the hierarchy dominated by the binfo |
2351 | DERIVED) is the base object in which FN is declared. */ | |
e92cc029 | 2352 | |
a292b002 | 2353 | static tree |
94edc4ab | 2354 | find_final_overrider (tree derived, tree binfo, tree fn) |
a292b002 | 2355 | { |
5e19c053 | 2356 | find_final_overrider_data ffod; |
a292b002 | 2357 | |
0e339752 | 2358 | /* Getting this right is a little tricky. This is valid: |
a292b002 | 2359 | |
5e19c053 MM |
2360 | struct S { virtual void f (); }; |
2361 | struct T { virtual void f (); }; | |
2362 | struct U : public S, public T { }; | |
a292b002 | 2363 | |
c8094d83 | 2364 | even though calling `f' in `U' is ambiguous. But, |
a292b002 | 2365 | |
5e19c053 MM |
2366 | struct R { virtual void f(); }; |
2367 | struct S : virtual public R { virtual void f (); }; | |
2368 | struct T : virtual public R { virtual void f (); }; | |
2369 | struct U : public S, public T { }; | |
dd42e135 | 2370 | |
d0cd8b44 | 2371 | is not -- there's no way to decide whether to put `S::f' or |
c8094d83 MS |
2372 | `T::f' in the vtable for `R'. |
2373 | ||
5e19c053 MM |
2374 | The solution is to look at all paths to BINFO. If we find |
2375 | different overriders along any two, then there is a problem. */ | |
07fa4878 NS |
2376 | if (DECL_THUNK_P (fn)) |
2377 | fn = THUNK_TARGET (fn); | |
f7a8132a MM |
2378 | |
2379 | /* Determine the depth of the hierarchy. */ | |
5e19c053 MM |
2380 | ffod.fn = fn; |
2381 | ffod.declaring_base = binfo; | |
78b45a24 | 2382 | ffod.candidates = NULL_TREE; |
9771b263 | 2383 | ffod.path.create (30); |
5e19c053 | 2384 | |
5d5a519f NS |
2385 | dfs_walk_all (derived, dfs_find_final_overrider_pre, |
2386 | dfs_find_final_overrider_post, &ffod); | |
f7a8132a | 2387 | |
9771b263 | 2388 | ffod.path.release (); |
c8094d83 | 2389 | |
78b45a24 | 2390 | /* If there was no winner, issue an error message. */ |
9368208b | 2391 | if (!ffod.candidates || TREE_CHAIN (ffod.candidates)) |
16a1369e | 2392 | return error_mark_node; |
dd42e135 | 2393 | |
9368208b | 2394 | return ffod.candidates; |
a292b002 MS |
2395 | } |
2396 | ||
548502d3 MM |
2397 | /* Return the index of the vcall offset for FN when TYPE is used as a |
2398 | virtual base. */ | |
d0cd8b44 | 2399 | |
d0cd8b44 | 2400 | static tree |
548502d3 | 2401 | get_vcall_index (tree fn, tree type) |
d0cd8b44 | 2402 | { |
9771b263 | 2403 | vec<tree_pair_s, va_gc> *indices = CLASSTYPE_VCALL_INDICES (type); |
0871761b NS |
2404 | tree_pair_p p; |
2405 | unsigned ix; | |
d0cd8b44 | 2406 | |
9771b263 | 2407 | FOR_EACH_VEC_SAFE_ELT (indices, ix, p) |
0871761b NS |
2408 | if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose)) |
2409 | || same_signature_p (fn, p->purpose)) | |
2410 | return p->value; | |
548502d3 MM |
2411 | |
2412 | /* There should always be an appropriate index. */ | |
8dc2b103 | 2413 | gcc_unreachable (); |
d0cd8b44 | 2414 | } |
d0cd8b44 JM |
2415 | |
2416 | /* Update an entry in the vtable for BINFO, which is in the hierarchy | |
bf1cb49e JM |
2417 | dominated by T. FN is the old function; VIRTUALS points to the |
2418 | corresponding position in the new BINFO_VIRTUALS list. IX is the index | |
2419 | of that entry in the list. */ | |
4e7512c9 MM |
2420 | |
2421 | static void | |
a2ddc397 NS |
2422 | update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals, |
2423 | unsigned ix) | |
4e7512c9 MM |
2424 | { |
2425 | tree b; | |
2426 | tree overrider; | |
4e7512c9 | 2427 | tree delta; |
31f8e4f3 | 2428 | tree virtual_base; |
d0cd8b44 | 2429 | tree first_defn; |
3cfabe60 NS |
2430 | tree overrider_fn, overrider_target; |
2431 | tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn; | |
2432 | tree over_return, base_return; | |
f11ee281 | 2433 | bool lost = false; |
4e7512c9 | 2434 | |
d0cd8b44 JM |
2435 | /* Find the nearest primary base (possibly binfo itself) which defines |
2436 | this function; this is the class the caller will convert to when | |
2437 | calling FN through BINFO. */ | |
2438 | for (b = binfo; ; b = get_primary_binfo (b)) | |
4e7512c9 | 2439 | { |
50bc768d | 2440 | gcc_assert (b); |
3cfabe60 | 2441 | if (look_for_overrides_here (BINFO_TYPE (b), target_fn)) |
31f8e4f3 | 2442 | break; |
f11ee281 JM |
2443 | |
2444 | /* The nearest definition is from a lost primary. */ | |
2445 | if (BINFO_LOST_PRIMARY_P (b)) | |
2446 | lost = true; | |
4e7512c9 | 2447 | } |
d0cd8b44 | 2448 | first_defn = b; |
4e7512c9 | 2449 | |
31f8e4f3 | 2450 | /* Find the final overrider. */ |
3cfabe60 | 2451 | overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn); |
4e7512c9 | 2452 | if (overrider == error_mark_node) |
16a1369e JJ |
2453 | { |
2454 | error ("no unique final overrider for %qD in %qT", target_fn, t); | |
2455 | return; | |
2456 | } | |
3cfabe60 | 2457 | overrider_target = overrider_fn = TREE_PURPOSE (overrider); |
c8094d83 | 2458 | |
9bcb9aae | 2459 | /* Check for adjusting covariant return types. */ |
3cfabe60 NS |
2460 | over_return = TREE_TYPE (TREE_TYPE (overrider_target)); |
2461 | base_return = TREE_TYPE (TREE_TYPE (target_fn)); | |
c8094d83 | 2462 | |
3cfabe60 NS |
2463 | if (POINTER_TYPE_P (over_return) |
2464 | && TREE_CODE (over_return) == TREE_CODE (base_return) | |
2465 | && CLASS_TYPE_P (TREE_TYPE (over_return)) | |
b77fe7b4 NS |
2466 | && CLASS_TYPE_P (TREE_TYPE (base_return)) |
2467 | /* If the overrider is invalid, don't even try. */ | |
2468 | && !DECL_INVALID_OVERRIDER_P (overrider_target)) | |
3cfabe60 NS |
2469 | { |
2470 | /* If FN is a covariant thunk, we must figure out the adjustment | |
0cbd7506 MS |
2471 | to the final base FN was converting to. As OVERRIDER_TARGET might |
2472 | also be converting to the return type of FN, we have to | |
2473 | combine the two conversions here. */ | |
3cfabe60 | 2474 | tree fixed_offset, virtual_offset; |
12a669d1 NS |
2475 | |
2476 | over_return = TREE_TYPE (over_return); | |
2477 | base_return = TREE_TYPE (base_return); | |
c8094d83 | 2478 | |
3cfabe60 NS |
2479 | if (DECL_THUNK_P (fn)) |
2480 | { | |
50bc768d | 2481 | gcc_assert (DECL_RESULT_THUNK_P (fn)); |
3cfabe60 NS |
2482 | fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn)); |
2483 | virtual_offset = THUNK_VIRTUAL_OFFSET (fn); | |
3cfabe60 NS |
2484 | } |
2485 | else | |
2486 | fixed_offset = virtual_offset = NULL_TREE; | |
4977bab6 | 2487 | |
e00853fd NS |
2488 | if (virtual_offset) |
2489 | /* Find the equivalent binfo within the return type of the | |
2490 | overriding function. We will want the vbase offset from | |
2491 | there. */ | |
58c42dc2 | 2492 | virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset), |
12a669d1 NS |
2493 | over_return); |
2494 | else if (!same_type_ignoring_top_level_qualifiers_p | |
2495 | (over_return, base_return)) | |
3cfabe60 NS |
2496 | { |
2497 | /* There was no existing virtual thunk (which takes | |
12a669d1 NS |
2498 | precedence). So find the binfo of the base function's |
2499 | return type within the overriding function's return type. | |
2500 | We cannot call lookup base here, because we're inside a | |
2501 | dfs_walk, and will therefore clobber the BINFO_MARKED | |
2502 | flags. Fortunately we know the covariancy is valid (it | |
2503 | has already been checked), so we can just iterate along | |
2504 | the binfos, which have been chained in inheritance graph | |
2505 | order. Of course it is lame that we have to repeat the | |
2506 | search here anyway -- we should really be caching pieces | |
2507 | of the vtable and avoiding this repeated work. */ | |
2508 | tree thunk_binfo, base_binfo; | |
2509 | ||
2510 | /* Find the base binfo within the overriding function's | |
742f25b3 NS |
2511 | return type. We will always find a thunk_binfo, except |
2512 | when the covariancy is invalid (which we will have | |
2513 | already diagnosed). */ | |
12a669d1 NS |
2514 | for (base_binfo = TYPE_BINFO (base_return), |
2515 | thunk_binfo = TYPE_BINFO (over_return); | |
742f25b3 | 2516 | thunk_binfo; |
12a669d1 | 2517 | thunk_binfo = TREE_CHAIN (thunk_binfo)) |
742f25b3 NS |
2518 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo), |
2519 | BINFO_TYPE (base_binfo))) | |
2520 | break; | |
c8094d83 | 2521 | |
12a669d1 NS |
2522 | /* See if virtual inheritance is involved. */ |
2523 | for (virtual_offset = thunk_binfo; | |
2524 | virtual_offset; | |
2525 | virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset)) | |
2526 | if (BINFO_VIRTUAL_P (virtual_offset)) | |
2527 | break; | |
c8094d83 | 2528 | |
742f25b3 NS |
2529 | if (virtual_offset |
2530 | || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo))) | |
3cfabe60 | 2531 | { |
bb885938 | 2532 | tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo)); |
8d1f0f67 | 2533 | |
12a669d1 | 2534 | if (virtual_offset) |
3cfabe60 | 2535 | { |
12a669d1 NS |
2536 | /* We convert via virtual base. Adjust the fixed |
2537 | offset to be from there. */ | |
db3927fb AH |
2538 | offset = |
2539 | size_diffop (offset, | |
2540 | convert (ssizetype, | |
2541 | BINFO_OFFSET (virtual_offset))); | |
3cfabe60 NS |
2542 | } |
2543 | if (fixed_offset) | |
2544 | /* There was an existing fixed offset, this must be | |
2545 | from the base just converted to, and the base the | |
2546 | FN was thunking to. */ | |
2547 | fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset); | |
2548 | else | |
2549 | fixed_offset = offset; | |
2550 | } | |
2551 | } | |
c8094d83 | 2552 | |
3cfabe60 NS |
2553 | if (fixed_offset || virtual_offset) |
2554 | /* Replace the overriding function with a covariant thunk. We | |
2555 | will emit the overriding function in its own slot as | |
9bcb9aae | 2556 | well. */ |
3cfabe60 NS |
2557 | overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0, |
2558 | fixed_offset, virtual_offset); | |
2559 | } | |
2560 | else | |
49fedf5a SM |
2561 | gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) || |
2562 | !DECL_THUNK_P (fn)); | |
c8094d83 | 2563 | |
02dea3ff JM |
2564 | /* If we need a covariant thunk, then we may need to adjust first_defn. |
2565 | The ABI specifies that the thunks emitted with a function are | |
2566 | determined by which bases the function overrides, so we need to be | |
2567 | sure that we're using a thunk for some overridden base; even if we | |
2568 | know that the necessary this adjustment is zero, there may not be an | |
2569 | appropriate zero-this-adjusment thunk for us to use since thunks for | |
2570 | overriding virtual bases always use the vcall offset. | |
2571 | ||
2572 | Furthermore, just choosing any base that overrides this function isn't | |
2573 | quite right, as this slot won't be used for calls through a type that | |
2574 | puts a covariant thunk here. Calling the function through such a type | |
2575 | will use a different slot, and that slot is the one that determines | |
2576 | the thunk emitted for that base. | |
2577 | ||
2578 | So, keep looking until we find the base that we're really overriding | |
2579 | in this slot: the nearest primary base that doesn't use a covariant | |
2580 | thunk in this slot. */ | |
2581 | if (overrider_target != overrider_fn) | |
2582 | { | |
2583 | if (BINFO_TYPE (b) == DECL_CONTEXT (overrider_target)) | |
2584 | /* We already know that the overrider needs a covariant thunk. */ | |
2585 | b = get_primary_binfo (b); | |
2586 | for (; ; b = get_primary_binfo (b)) | |
2587 | { | |
2588 | tree main_binfo = TYPE_BINFO (BINFO_TYPE (b)); | |
2589 | tree bv = chain_index (ix, BINFO_VIRTUALS (main_binfo)); | |
02dea3ff JM |
2590 | if (!DECL_THUNK_P (TREE_VALUE (bv))) |
2591 | break; | |
2c1fb3ee JM |
2592 | if (BINFO_LOST_PRIMARY_P (b)) |
2593 | lost = true; | |
02dea3ff JM |
2594 | } |
2595 | first_defn = b; | |
2596 | } | |
2597 | ||
31f8e4f3 MM |
2598 | /* Assume that we will produce a thunk that convert all the way to |
2599 | the final overrider, and not to an intermediate virtual base. */ | |
9ccf6541 | 2600 | virtual_base = NULL_TREE; |
31f8e4f3 | 2601 | |
f11ee281 | 2602 | /* See if we can convert to an intermediate virtual base first, and then |
3461fba7 | 2603 | use the vcall offset located there to finish the conversion. */ |
f11ee281 | 2604 | for (; b; b = BINFO_INHERITANCE_CHAIN (b)) |
4e7512c9 | 2605 | { |
d0cd8b44 JM |
2606 | /* If we find the final overrider, then we can stop |
2607 | walking. */ | |
539ed333 NS |
2608 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (b), |
2609 | BINFO_TYPE (TREE_VALUE (overrider)))) | |
1f84ec23 | 2610 | break; |
31f8e4f3 | 2611 | |
d0cd8b44 JM |
2612 | /* If we find a virtual base, and we haven't yet found the |
2613 | overrider, then there is a virtual base between the | |
2614 | declaring base (first_defn) and the final overrider. */ | |
809e3e7f | 2615 | if (BINFO_VIRTUAL_P (b)) |
dbbf88d1 NS |
2616 | { |
2617 | virtual_base = b; | |
2618 | break; | |
2619 | } | |
4e7512c9 | 2620 | } |
4e7512c9 | 2621 | |
d0cd8b44 JM |
2622 | /* Compute the constant adjustment to the `this' pointer. The |
2623 | `this' pointer, when this function is called, will point at BINFO | |
2624 | (or one of its primary bases, which are at the same offset). */ | |
31f8e4f3 | 2625 | if (virtual_base) |
20dde49d NS |
2626 | /* The `this' pointer needs to be adjusted from the declaration to |
2627 | the nearest virtual base. */ | |
db3927fb AH |
2628 | delta = size_diffop_loc (input_location, |
2629 | convert (ssizetype, BINFO_OFFSET (virtual_base)), | |
bb885938 | 2630 | convert (ssizetype, BINFO_OFFSET (first_defn))); |
f11ee281 JM |
2631 | else if (lost) |
2632 | /* If the nearest definition is in a lost primary, we don't need an | |
2633 | entry in our vtable. Except possibly in a constructor vtable, | |
2634 | if we happen to get our primary back. In that case, the offset | |
2635 | will be zero, as it will be a primary base. */ | |
2636 | delta = size_zero_node; | |
4e7512c9 | 2637 | else |
548502d3 MM |
2638 | /* The `this' pointer needs to be adjusted from pointing to |
2639 | BINFO to pointing at the base where the final overrider | |
2640 | appears. */ | |
db3927fb AH |
2641 | delta = size_diffop_loc (input_location, |
2642 | convert (ssizetype, | |
bb885938 NS |
2643 | BINFO_OFFSET (TREE_VALUE (overrider))), |
2644 | convert (ssizetype, BINFO_OFFSET (binfo))); | |
4e7512c9 | 2645 | |
3cfabe60 | 2646 | modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals); |
31f8e4f3 MM |
2647 | |
2648 | if (virtual_base) | |
c8094d83 | 2649 | BV_VCALL_INDEX (*virtuals) |
3cfabe60 | 2650 | = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base)); |
d1f05f93 NS |
2651 | else |
2652 | BV_VCALL_INDEX (*virtuals) = NULL_TREE; | |
02dea3ff | 2653 | |
8434c305 | 2654 | BV_LOST_PRIMARY (*virtuals) = lost; |
4e7512c9 MM |
2655 | } |
2656 | ||
8026246f | 2657 | /* Called from modify_all_vtables via dfs_walk. */ |
e92cc029 | 2658 | |
8026246f | 2659 | static tree |
94edc4ab | 2660 | dfs_modify_vtables (tree binfo, void* data) |
8026246f | 2661 | { |
bcb1079e | 2662 | tree t = (tree) data; |
5b94d9dd NS |
2663 | tree virtuals; |
2664 | tree old_virtuals; | |
2665 | unsigned ix; | |
2666 | ||
2667 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2668 | /* A base without a vtable needs no modification, and its bases | |
2669 | are uninteresting. */ | |
2670 | return dfs_skip_bases; | |
c8094d83 | 2671 | |
5b94d9dd NS |
2672 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t) |
2673 | && !CLASSTYPE_HAS_PRIMARY_BASE_P (t)) | |
2674 | /* Don't do the primary vtable, if it's new. */ | |
2675 | return NULL_TREE; | |
2676 | ||
2677 | if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo)) | |
2678 | /* There's no need to modify the vtable for a non-virtual primary | |
2679 | base; we're not going to use that vtable anyhow. We do still | |
2680 | need to do this for virtual primary bases, as they could become | |
2681 | non-primary in a construction vtable. */ | |
2682 | return NULL_TREE; | |
2683 | ||
2684 | make_new_vtable (t, binfo); | |
c8094d83 | 2685 | |
5b94d9dd NS |
2686 | /* Now, go through each of the virtual functions in the virtual |
2687 | function table for BINFO. Find the final overrider, and update | |
2688 | the BINFO_VIRTUALS list appropriately. */ | |
2689 | for (ix = 0, virtuals = BINFO_VIRTUALS (binfo), | |
2690 | old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
2691 | virtuals; | |
2692 | ix++, virtuals = TREE_CHAIN (virtuals), | |
2693 | old_virtuals = TREE_CHAIN (old_virtuals)) | |
c8094d83 MS |
2694 | update_vtable_entry_for_fn (t, |
2695 | binfo, | |
5b94d9dd NS |
2696 | BV_FN (old_virtuals), |
2697 | &virtuals, ix); | |
8026246f | 2698 | |
8026246f MM |
2699 | return NULL_TREE; |
2700 | } | |
2701 | ||
a68ad5bd MM |
2702 | /* Update all of the primary and secondary vtables for T. Create new |
2703 | vtables as required, and initialize their RTTI information. Each | |
e6858a84 NS |
2704 | of the functions in VIRTUALS is declared in T and may override a |
2705 | virtual function from a base class; find and modify the appropriate | |
2706 | entries to point to the overriding functions. Returns a list, in | |
2707 | declaration order, of the virtual functions that are declared in T, | |
2708 | but do not appear in the primary base class vtable, and which | |
2709 | should therefore be appended to the end of the vtable for T. */ | |
a68ad5bd MM |
2710 | |
2711 | static tree | |
94edc4ab | 2712 | modify_all_vtables (tree t, tree virtuals) |
8026246f | 2713 | { |
3461fba7 NS |
2714 | tree binfo = TYPE_BINFO (t); |
2715 | tree *fnsp; | |
a68ad5bd | 2716 | |
9d13a069 JM |
2717 | /* Mangle the vtable name before entering dfs_walk (c++/51884). */ |
2718 | if (TYPE_CONTAINS_VPTR_P (t)) | |
2719 | get_vtable_decl (t, false); | |
2720 | ||
5e19c053 | 2721 | /* Update all of the vtables. */ |
5b94d9dd | 2722 | dfs_walk_once (binfo, dfs_modify_vtables, NULL, t); |
a68ad5bd | 2723 | |
e6858a84 NS |
2724 | /* Add virtual functions not already in our primary vtable. These |
2725 | will be both those introduced by this class, and those overridden | |
2726 | from secondary bases. It does not include virtuals merely | |
2727 | inherited from secondary bases. */ | |
2728 | for (fnsp = &virtuals; *fnsp; ) | |
a68ad5bd | 2729 | { |
3461fba7 | 2730 | tree fn = TREE_VALUE (*fnsp); |
a68ad5bd | 2731 | |
e6858a84 NS |
2732 | if (!value_member (fn, BINFO_VIRTUALS (binfo)) |
2733 | || DECL_VINDEX (fn) == error_mark_node) | |
a68ad5bd | 2734 | { |
3461fba7 NS |
2735 | /* We don't need to adjust the `this' pointer when |
2736 | calling this function. */ | |
2737 | BV_DELTA (*fnsp) = integer_zero_node; | |
2738 | BV_VCALL_INDEX (*fnsp) = NULL_TREE; | |
2739 | ||
e6858a84 | 2740 | /* This is a function not already in our vtable. Keep it. */ |
3461fba7 | 2741 | fnsp = &TREE_CHAIN (*fnsp); |
a68ad5bd | 2742 | } |
3461fba7 NS |
2743 | else |
2744 | /* We've already got an entry for this function. Skip it. */ | |
2745 | *fnsp = TREE_CHAIN (*fnsp); | |
a68ad5bd | 2746 | } |
e93ee644 | 2747 | |
e6858a84 | 2748 | return virtuals; |
7177d104 MS |
2749 | } |
2750 | ||
7d5b8b11 MM |
2751 | /* Get the base virtual function declarations in T that have the |
2752 | indicated NAME. */ | |
e92cc029 | 2753 | |
5ddc28a5 | 2754 | static tree |
94edc4ab | 2755 | get_basefndecls (tree name, tree t) |
9e9ff709 | 2756 | { |
7d5b8b11 | 2757 | tree methods; |
9e9ff709 | 2758 | tree base_fndecls = NULL_TREE; |
604a3205 | 2759 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
7d5b8b11 | 2760 | int i; |
9e9ff709 | 2761 | |
3d1df1fa MM |
2762 | /* Find virtual functions in T with the indicated NAME. */ |
2763 | i = lookup_fnfields_1 (t, name); | |
2764 | if (i != -1) | |
9771b263 | 2765 | for (methods = (*CLASSTYPE_METHOD_VEC (t))[i]; |
3d1df1fa MM |
2766 | methods; |
2767 | methods = OVL_NEXT (methods)) | |
2768 | { | |
2769 | tree method = OVL_CURRENT (methods); | |
2770 | ||
2771 | if (TREE_CODE (method) == FUNCTION_DECL | |
2772 | && DECL_VINDEX (method)) | |
2773 | base_fndecls = tree_cons (NULL_TREE, method, base_fndecls); | |
2774 | } | |
9e9ff709 MS |
2775 | |
2776 | if (base_fndecls) | |
2777 | return base_fndecls; | |
2778 | ||
2779 | for (i = 0; i < n_baseclasses; i++) | |
2780 | { | |
604a3205 | 2781 | tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i)); |
7d5b8b11 | 2782 | base_fndecls = chainon (get_basefndecls (name, basetype), |
9e9ff709 MS |
2783 | base_fndecls); |
2784 | } | |
2785 | ||
2786 | return base_fndecls; | |
2787 | } | |
2788 | ||
2ee887f2 MS |
2789 | /* If this declaration supersedes the declaration of |
2790 | a method declared virtual in the base class, then | |
2791 | mark this field as being virtual as well. */ | |
2792 | ||
9f4faeae | 2793 | void |
94edc4ab | 2794 | check_for_override (tree decl, tree ctype) |
2ee887f2 | 2795 | { |
7506ab1d | 2796 | bool overrides_found = false; |
cbb40945 NS |
2797 | if (TREE_CODE (decl) == TEMPLATE_DECL) |
2798 | /* In [temp.mem] we have: | |
2ee887f2 | 2799 | |
0cbd7506 MS |
2800 | A specialization of a member function template does not |
2801 | override a virtual function from a base class. */ | |
cbb40945 NS |
2802 | return; |
2803 | if ((DECL_DESTRUCTOR_P (decl) | |
a6c0d772 MM |
2804 | || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) |
2805 | || DECL_CONV_FN_P (decl)) | |
cbb40945 NS |
2806 | && look_for_overrides (ctype, decl) |
2807 | && !DECL_STATIC_FUNCTION_P (decl)) | |
e6858a84 NS |
2808 | /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor |
2809 | the error_mark_node so that we know it is an overriding | |
2810 | function. */ | |
7506ab1d VV |
2811 | { |
2812 | DECL_VINDEX (decl) = decl; | |
2813 | overrides_found = true; | |
2814 | } | |
e6858a84 | 2815 | |
cbb40945 | 2816 | if (DECL_VIRTUAL_P (decl)) |
2ee887f2 | 2817 | { |
e6858a84 | 2818 | if (!DECL_VINDEX (decl)) |
2ee887f2 MS |
2819 | DECL_VINDEX (decl) = error_mark_node; |
2820 | IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1; | |
5ade176d JM |
2821 | if (DECL_DESTRUCTOR_P (decl)) |
2822 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype) = true; | |
2ee887f2 | 2823 | } |
7506ab1d | 2824 | else if (DECL_FINAL_P (decl)) |
8895d9a1 | 2825 | error ("%q+#D marked %<final%>, but is not virtual", decl); |
7506ab1d | 2826 | if (DECL_OVERRIDE_P (decl) && !overrides_found) |
8895d9a1 | 2827 | error ("%q+#D marked %<override%>, but does not override", decl); |
2ee887f2 MS |
2828 | } |
2829 | ||
fc378698 MS |
2830 | /* Warn about hidden virtual functions that are not overridden in t. |
2831 | We know that constructors and destructors don't apply. */ | |
e92cc029 | 2832 | |
b23e103b | 2833 | static void |
94edc4ab | 2834 | warn_hidden (tree t) |
9e9ff709 | 2835 | { |
9771b263 | 2836 | vec<tree, va_gc> *method_vec = CLASSTYPE_METHOD_VEC (t); |
aaaa46d2 MM |
2837 | tree fns; |
2838 | size_t i; | |
9e9ff709 MS |
2839 | |
2840 | /* We go through each separately named virtual function. */ | |
c8094d83 | 2841 | for (i = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9771b263 | 2842 | vec_safe_iterate (method_vec, i, &fns); |
aaaa46d2 | 2843 | ++i) |
9e9ff709 | 2844 | { |
aaaa46d2 | 2845 | tree fn; |
7d5b8b11 MM |
2846 | tree name; |
2847 | tree fndecl; | |
2848 | tree base_fndecls; | |
fa743e8c NS |
2849 | tree base_binfo; |
2850 | tree binfo; | |
7d5b8b11 MM |
2851 | int j; |
2852 | ||
2853 | /* All functions in this slot in the CLASSTYPE_METHOD_VEC will | |
2854 | have the same name. Figure out what name that is. */ | |
aaaa46d2 | 2855 | name = DECL_NAME (OVL_CURRENT (fns)); |
7d5b8b11 MM |
2856 | /* There are no possibly hidden functions yet. */ |
2857 | base_fndecls = NULL_TREE; | |
2858 | /* Iterate through all of the base classes looking for possibly | |
2859 | hidden functions. */ | |
fa743e8c NS |
2860 | for (binfo = TYPE_BINFO (t), j = 0; |
2861 | BINFO_BASE_ITERATE (binfo, j, base_binfo); j++) | |
a4832853 | 2862 | { |
fa743e8c | 2863 | tree basetype = BINFO_TYPE (base_binfo); |
7d5b8b11 MM |
2864 | base_fndecls = chainon (get_basefndecls (name, basetype), |
2865 | base_fndecls); | |
a4832853 JM |
2866 | } |
2867 | ||
00a17e31 | 2868 | /* If there are no functions to hide, continue. */ |
7d5b8b11 | 2869 | if (!base_fndecls) |
9e9ff709 MS |
2870 | continue; |
2871 | ||
00a17e31 | 2872 | /* Remove any overridden functions. */ |
aaaa46d2 | 2873 | for (fn = fns; fn; fn = OVL_NEXT (fn)) |
9e9ff709 | 2874 | { |
aaaa46d2 | 2875 | fndecl = OVL_CURRENT (fn); |
6597738a MP |
2876 | if (TREE_CODE (fndecl) == FUNCTION_DECL |
2877 | && DECL_VINDEX (fndecl)) | |
7d5b8b11 MM |
2878 | { |
2879 | tree *prev = &base_fndecls; | |
c8094d83 MS |
2880 | |
2881 | while (*prev) | |
7d5b8b11 MM |
2882 | /* If the method from the base class has the same |
2883 | signature as the method from the derived class, it | |
2884 | has been overridden. */ | |
2885 | if (same_signature_p (fndecl, TREE_VALUE (*prev))) | |
2886 | *prev = TREE_CHAIN (*prev); | |
2887 | else | |
2888 | prev = &TREE_CHAIN (*prev); | |
2889 | } | |
9e9ff709 MS |
2890 | } |
2891 | ||
9e9ff709 MS |
2892 | /* Now give a warning for all base functions without overriders, |
2893 | as they are hidden. */ | |
c8094d83 | 2894 | while (base_fndecls) |
7d5b8b11 MM |
2895 | { |
2896 | /* Here we know it is a hider, and no overrider exists. */ | |
286d12f9 MLI |
2897 | warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls)); |
2898 | warning (OPT_Woverloaded_virtual, " by %q+D", fns); | |
7d5b8b11 MM |
2899 | base_fndecls = TREE_CHAIN (base_fndecls); |
2900 | } | |
9e9ff709 MS |
2901 | } |
2902 | } | |
2903 | ||
096a4865 PC |
2904 | /* Recursive helper for finish_struct_anon. */ |
2905 | ||
2906 | static void | |
2907 | finish_struct_anon_r (tree field, bool complain) | |
2908 | { | |
2909 | bool is_union = TREE_CODE (TREE_TYPE (field)) == UNION_TYPE; | |
2910 | tree elt = TYPE_FIELDS (TREE_TYPE (field)); | |
2911 | for (; elt; elt = DECL_CHAIN (elt)) | |
2912 | { | |
2913 | /* We're generally only interested in entities the user | |
2914 | declared, but we also find nested classes by noticing | |
2915 | the TYPE_DECL that we create implicitly. You're | |
2916 | allowed to put one anonymous union inside another, | |
2917 | though, so we explicitly tolerate that. We use | |
2918 | TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that | |
2919 | we also allow unnamed types used for defining fields. */ | |
2920 | if (DECL_ARTIFICIAL (elt) | |
2921 | && (!DECL_IMPLICIT_TYPEDEF_P (elt) | |
2922 | || TYPE_ANONYMOUS_P (TREE_TYPE (elt)))) | |
2923 | continue; | |
2924 | ||
2925 | if (TREE_CODE (elt) != FIELD_DECL) | |
2926 | { | |
a6659b55 JM |
2927 | /* We already complained about static data members in |
2928 | finish_static_data_member_decl. */ | |
2929 | if (complain && TREE_CODE (elt) != VAR_DECL) | |
096a4865 PC |
2930 | { |
2931 | if (is_union) | |
2932 | permerror (input_location, | |
2933 | "%q+#D invalid; an anonymous union can " | |
2934 | "only have non-static data members", elt); | |
2935 | else | |
2936 | permerror (input_location, | |
2937 | "%q+#D invalid; an anonymous struct can " | |
2938 | "only have non-static data members", elt); | |
2939 | } | |
2940 | continue; | |
2941 | } | |
2942 | ||
2943 | if (complain) | |
2944 | { | |
2945 | if (TREE_PRIVATE (elt)) | |
2946 | { | |
2947 | if (is_union) | |
2948 | permerror (input_location, | |
2949 | "private member %q+#D in anonymous union", elt); | |
2950 | else | |
2951 | permerror (input_location, | |
2952 | "private member %q+#D in anonymous struct", elt); | |
2953 | } | |
2954 | else if (TREE_PROTECTED (elt)) | |
2955 | { | |
2956 | if (is_union) | |
2957 | permerror (input_location, | |
2958 | "protected member %q+#D in anonymous union", elt); | |
2959 | else | |
2960 | permerror (input_location, | |
2961 | "protected member %q+#D in anonymous struct", elt); | |
2962 | } | |
2963 | } | |
2964 | ||
2965 | TREE_PRIVATE (elt) = TREE_PRIVATE (field); | |
2966 | TREE_PROTECTED (elt) = TREE_PROTECTED (field); | |
2967 | ||
2968 | /* Recurse into the anonymous aggregates to handle correctly | |
2969 | access control (c++/24926): | |
2970 | ||
2971 | class A { | |
2972 | union { | |
2973 | union { | |
2974 | int i; | |
2975 | }; | |
2976 | }; | |
2977 | }; | |
2978 | ||
2979 | int j=A().i; */ | |
2980 | if (DECL_NAME (elt) == NULL_TREE | |
2981 | && ANON_AGGR_TYPE_P (TREE_TYPE (elt))) | |
2982 | finish_struct_anon_r (elt, /*complain=*/false); | |
2983 | } | |
2984 | } | |
2985 | ||
9e9ff709 MS |
2986 | /* Check for things that are invalid. There are probably plenty of other |
2987 | things we should check for also. */ | |
e92cc029 | 2988 | |
9e9ff709 | 2989 | static void |
94edc4ab | 2990 | finish_struct_anon (tree t) |
9e9ff709 | 2991 | { |
096a4865 | 2992 | for (tree field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
9e9ff709 MS |
2993 | { |
2994 | if (TREE_STATIC (field)) | |
2995 | continue; | |
2996 | if (TREE_CODE (field) != FIELD_DECL) | |
2997 | continue; | |
2998 | ||
2999 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 3000 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
096a4865 | 3001 | finish_struct_anon_r (field, /*complain=*/true); |
9e9ff709 MS |
3002 | } |
3003 | } | |
3004 | ||
7088fca9 KL |
3005 | /* Add T to CLASSTYPE_DECL_LIST of current_class_type which |
3006 | will be used later during class template instantiation. | |
3007 | When FRIEND_P is zero, T can be a static member data (VAR_DECL), | |
3008 | a non-static member data (FIELD_DECL), a member function | |
c8094d83 | 3009 | (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE), |
7088fca9 KL |
3010 | a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL) |
3011 | When FRIEND_P is nonzero, T is either a friend class | |
3012 | (RECORD_TYPE, TEMPLATE_DECL) or a friend function | |
3013 | (FUNCTION_DECL, TEMPLATE_DECL). */ | |
3014 | ||
3015 | void | |
94edc4ab | 3016 | maybe_add_class_template_decl_list (tree type, tree t, int friend_p) |
7088fca9 KL |
3017 | { |
3018 | /* Save some memory by not creating TREE_LIST if TYPE is not template. */ | |
3019 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
3020 | CLASSTYPE_DECL_LIST (type) | |
3021 | = tree_cons (friend_p ? NULL_TREE : type, | |
3022 | t, CLASSTYPE_DECL_LIST (type)); | |
3023 | } | |
3024 | ||
ca2409f9 DS |
3025 | /* This function is called from declare_virt_assop_and_dtor via |
3026 | dfs_walk_all. | |
3027 | ||
3028 | DATA is a type that direcly or indirectly inherits the base | |
3029 | represented by BINFO. If BINFO contains a virtual assignment [copy | |
3030 | assignment or move assigment] operator or a virtual constructor, | |
3031 | declare that function in DATA if it hasn't been already declared. */ | |
3032 | ||
3033 | static tree | |
3034 | dfs_declare_virt_assop_and_dtor (tree binfo, void *data) | |
3035 | { | |
3036 | tree bv, fn, t = (tree)data; | |
3037 | tree opname = ansi_assopname (NOP_EXPR); | |
3038 | ||
3039 | gcc_assert (t && CLASS_TYPE_P (t)); | |
3040 | gcc_assert (binfo && TREE_CODE (binfo) == TREE_BINFO); | |
3041 | ||
3042 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
3043 | /* A base without a vtable needs no modification, and its bases | |
3044 | are uninteresting. */ | |
3045 | return dfs_skip_bases; | |
3046 | ||
3047 | if (BINFO_PRIMARY_P (binfo)) | |
3048 | /* If this is a primary base, then we have already looked at the | |
3049 | virtual functions of its vtable. */ | |
3050 | return NULL_TREE; | |
3051 | ||
3052 | for (bv = BINFO_VIRTUALS (binfo); bv; bv = TREE_CHAIN (bv)) | |
3053 | { | |
3054 | fn = BV_FN (bv); | |
3055 | ||
3056 | if (DECL_NAME (fn) == opname) | |
3057 | { | |
3058 | if (CLASSTYPE_LAZY_COPY_ASSIGN (t)) | |
3059 | lazily_declare_fn (sfk_copy_assignment, t); | |
3060 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
3061 | lazily_declare_fn (sfk_move_assignment, t); | |
3062 | } | |
3063 | else if (DECL_DESTRUCTOR_P (fn) | |
3064 | && CLASSTYPE_LAZY_DESTRUCTOR (t)) | |
3065 | lazily_declare_fn (sfk_destructor, t); | |
3066 | } | |
3067 | ||
3068 | return NULL_TREE; | |
3069 | } | |
3070 | ||
3071 | /* If the class type T has a direct or indirect base that contains a | |
3072 | virtual assignment operator or a virtual destructor, declare that | |
3073 | function in T if it hasn't been already declared. */ | |
3074 | ||
3075 | static void | |
3076 | declare_virt_assop_and_dtor (tree t) | |
3077 | { | |
3078 | if (!(TYPE_POLYMORPHIC_P (t) | |
3079 | && (CLASSTYPE_LAZY_COPY_ASSIGN (t) | |
3080 | || CLASSTYPE_LAZY_MOVE_ASSIGN (t) | |
3081 | || CLASSTYPE_LAZY_DESTRUCTOR (t)))) | |
3082 | return; | |
3083 | ||
3084 | dfs_walk_all (TYPE_BINFO (t), | |
3085 | dfs_declare_virt_assop_and_dtor, | |
3086 | NULL, t); | |
3087 | } | |
3088 | ||
85b5d65a JM |
3089 | /* Declare the inheriting constructor for class T inherited from base |
3090 | constructor CTOR with the parameter array PARMS of size NPARMS. */ | |
3091 | ||
3092 | static void | |
3093 | one_inheriting_sig (tree t, tree ctor, tree *parms, int nparms) | |
3094 | { | |
3095 | /* We don't declare an inheriting ctor that would be a default, | |
e252e96a JM |
3096 | copy or move ctor for derived or base. */ |
3097 | if (nparms == 0) | |
85b5d65a | 3098 | return; |
e252e96a JM |
3099 | if (nparms == 1 |
3100 | && TREE_CODE (parms[0]) == REFERENCE_TYPE) | |
3101 | { | |
3102 | tree parm = TYPE_MAIN_VARIANT (TREE_TYPE (parms[0])); | |
3103 | if (parm == t || parm == DECL_CONTEXT (ctor)) | |
3104 | return; | |
3105 | } | |
3106 | ||
85b5d65a | 3107 | tree parmlist = void_list_node; |
e252e96a | 3108 | for (int i = nparms - 1; i >= 0; i--) |
85b5d65a JM |
3109 | parmlist = tree_cons (NULL_TREE, parms[i], parmlist); |
3110 | tree fn = implicitly_declare_fn (sfk_inheriting_constructor, | |
3111 | t, false, ctor, parmlist); | |
3112 | if (add_method (t, fn, NULL_TREE)) | |
3113 | { | |
3114 | DECL_CHAIN (fn) = TYPE_METHODS (t); | |
3115 | TYPE_METHODS (t) = fn; | |
3116 | } | |
3117 | } | |
3118 | ||
3119 | /* Declare all the inheriting constructors for class T inherited from base | |
3120 | constructor CTOR. */ | |
3121 | ||
3122 | static void | |
3123 | one_inherited_ctor (tree ctor, tree t) | |
3124 | { | |
3125 | tree parms = FUNCTION_FIRST_USER_PARMTYPE (ctor); | |
3126 | ||
3127 | tree *new_parms = XALLOCAVEC (tree, list_length (parms)); | |
3128 | int i = 0; | |
3129 | for (; parms && parms != void_list_node; parms = TREE_CHAIN (parms)) | |
3130 | { | |
3131 | if (TREE_PURPOSE (parms)) | |
3132 | one_inheriting_sig (t, ctor, new_parms, i); | |
3133 | new_parms[i++] = TREE_VALUE (parms); | |
3134 | } | |
3135 | one_inheriting_sig (t, ctor, new_parms, i); | |
4514a96b JM |
3136 | if (parms == NULL_TREE) |
3137 | { | |
3fe99aa5 FC |
3138 | if (warning (OPT_Winherited_variadic_ctor, |
3139 | "the ellipsis in %qD is not inherited", ctor)) | |
3140 | inform (DECL_SOURCE_LOCATION (ctor), "%qD declared here", ctor); | |
4514a96b | 3141 | } |
85b5d65a JM |
3142 | } |
3143 | ||
61a127b3 | 3144 | /* Create default constructors, assignment operators, and so forth for |
e5e459bf AO |
3145 | the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR, |
3146 | and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, | |
3147 | the class cannot have a default constructor, copy constructor | |
3148 | taking a const reference argument, or an assignment operator taking | |
3149 | a const reference, respectively. */ | |
61a127b3 | 3150 | |
f72ab53b | 3151 | static void |
85b5d65a | 3152 | add_implicitly_declared_members (tree t, tree* access_decls, |
94edc4ab | 3153 | int cant_have_const_cctor, |
10746f37 | 3154 | int cant_have_const_assignment) |
61a127b3 | 3155 | { |
830dea94 JM |
3156 | bool move_ok = false; |
3157 | ||
604b2bfc | 3158 | if (cxx_dialect >= cxx11 && !CLASSTYPE_DESTRUCTORS (t) |
830dea94 JM |
3159 | && !TYPE_HAS_COPY_CTOR (t) && !TYPE_HAS_COPY_ASSIGN (t) |
3160 | && !type_has_move_constructor (t) && !type_has_move_assign (t)) | |
3161 | move_ok = true; | |
3162 | ||
61a127b3 | 3163 | /* Destructor. */ |
9f4faeae | 3164 | if (!CLASSTYPE_DESTRUCTORS (t)) |
61a127b3 | 3165 | { |
9f4faeae MM |
3166 | /* In general, we create destructors lazily. */ |
3167 | CLASSTYPE_LAZY_DESTRUCTOR (t) = 1; | |
9f4faeae | 3168 | |
d1a115f8 JM |
3169 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
3170 | && TYPE_FOR_JAVA (t)) | |
3171 | /* But if this is a Java class, any non-trivial destructor is | |
3172 | invalid, even if compiler-generated. Therefore, if the | |
3173 | destructor is non-trivial we create it now. */ | |
3174 | lazily_declare_fn (sfk_destructor, t); | |
61a127b3 | 3175 | } |
61a127b3 | 3176 | |
0fcedd9c JM |
3177 | /* [class.ctor] |
3178 | ||
3179 | If there is no user-declared constructor for a class, a default | |
3180 | constructor is implicitly declared. */ | |
3181 | if (! TYPE_HAS_USER_CONSTRUCTOR (t)) | |
61a127b3 | 3182 | { |
508a1c9c | 3183 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1; |
0930cc0e | 3184 | CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1; |
604b2bfc | 3185 | if (cxx_dialect >= cxx11) |
0930cc0e | 3186 | TYPE_HAS_CONSTEXPR_CTOR (t) |
fd3faf2b JM |
3187 | /* This might force the declaration. */ |
3188 | = type_has_constexpr_default_constructor (t); | |
61a127b3 MM |
3189 | } |
3190 | ||
0fcedd9c JM |
3191 | /* [class.ctor] |
3192 | ||
3193 | If a class definition does not explicitly declare a copy | |
3194 | constructor, one is declared implicitly. */ | |
a2e70335 | 3195 | if (! TYPE_HAS_COPY_CTOR (t) && ! TYPE_FOR_JAVA (t)) |
61a127b3 | 3196 | { |
066ec0a4 JM |
3197 | TYPE_HAS_COPY_CTOR (t) = 1; |
3198 | TYPE_HAS_CONST_COPY_CTOR (t) = !cant_have_const_cctor; | |
508a1c9c | 3199 | CLASSTYPE_LAZY_COPY_CTOR (t) = 1; |
830dea94 | 3200 | if (move_ok) |
d758e847 | 3201 | CLASSTYPE_LAZY_MOVE_CTOR (t) = 1; |
61a127b3 MM |
3202 | } |
3203 | ||
aaaa46d2 MM |
3204 | /* If there is no assignment operator, one will be created if and |
3205 | when it is needed. For now, just record whether or not the type | |
3206 | of the parameter to the assignment operator will be a const or | |
3207 | non-const reference. */ | |
a2e70335 | 3208 | if (!TYPE_HAS_COPY_ASSIGN (t) && !TYPE_FOR_JAVA (t)) |
fb232476 | 3209 | { |
066ec0a4 JM |
3210 | TYPE_HAS_COPY_ASSIGN (t) = 1; |
3211 | TYPE_HAS_CONST_COPY_ASSIGN (t) = !cant_have_const_assignment; | |
3212 | CLASSTYPE_LAZY_COPY_ASSIGN (t) = 1; | |
c6250f73 | 3213 | if (move_ok && !LAMBDA_TYPE_P (t)) |
d758e847 | 3214 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 1; |
fb232476 | 3215 | } |
d1a115f8 JM |
3216 | |
3217 | /* We can't be lazy about declaring functions that might override | |
3218 | a virtual function from a base class. */ | |
ca2409f9 | 3219 | declare_virt_assop_and_dtor (t); |
85b5d65a JM |
3220 | |
3221 | while (*access_decls) | |
3222 | { | |
3223 | tree using_decl = TREE_VALUE (*access_decls); | |
3224 | tree decl = USING_DECL_DECLS (using_decl); | |
140bec21 | 3225 | if (DECL_NAME (using_decl) == ctor_identifier) |
85b5d65a JM |
3226 | { |
3227 | /* declare, then remove the decl */ | |
140bec21 | 3228 | tree ctor_list = decl; |
85b5d65a JM |
3229 | location_t loc = input_location; |
3230 | input_location = DECL_SOURCE_LOCATION (using_decl); | |
3231 | if (ctor_list) | |
3232 | for (; ctor_list; ctor_list = OVL_NEXT (ctor_list)) | |
3233 | one_inherited_ctor (OVL_CURRENT (ctor_list), t); | |
3234 | *access_decls = TREE_CHAIN (*access_decls); | |
3235 | input_location = loc; | |
3236 | } | |
3237 | else | |
3238 | access_decls = &TREE_CHAIN (*access_decls); | |
3239 | } | |
61a127b3 MM |
3240 | } |
3241 | ||
cba0366c FC |
3242 | /* Subroutine of insert_into_classtype_sorted_fields. Recursively |
3243 | count the number of fields in TYPE, including anonymous union | |
3244 | members. */ | |
f90cdf34 MT |
3245 | |
3246 | static int | |
94edc4ab | 3247 | count_fields (tree fields) |
f90cdf34 MT |
3248 | { |
3249 | tree x; | |
3250 | int n_fields = 0; | |
910ad8de | 3251 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
3252 | { |
3253 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
3254 | n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x))); | |
3255 | else | |
3256 | n_fields += 1; | |
3257 | } | |
3258 | return n_fields; | |
3259 | } | |
3260 | ||
cba0366c FC |
3261 | /* Subroutine of insert_into_classtype_sorted_fields. Recursively add |
3262 | all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE | |
3263 | elts, starting at offset IDX. */ | |
f90cdf34 MT |
3264 | |
3265 | static int | |
d07605f5 | 3266 | add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx) |
f90cdf34 MT |
3267 | { |
3268 | tree x; | |
910ad8de | 3269 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
3270 | { |
3271 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
d07605f5 | 3272 | idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx); |
f90cdf34 | 3273 | else |
d07605f5 | 3274 | field_vec->elts[idx++] = x; |
f90cdf34 MT |
3275 | } |
3276 | return idx; | |
3277 | } | |
3278 | ||
cba0366c FC |
3279 | /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts, |
3280 | starting at offset IDX. */ | |
3281 | ||
3282 | static int | |
3283 | add_enum_fields_to_record_type (tree enumtype, | |
3284 | struct sorted_fields_type *field_vec, | |
3285 | int idx) | |
3286 | { | |
3287 | tree values; | |
3288 | for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values)) | |
3289 | field_vec->elts[idx++] = TREE_VALUE (values); | |
3290 | return idx; | |
3291 | } | |
3292 | ||
1e30f9b4 MM |
3293 | /* FIELD is a bit-field. We are finishing the processing for its |
3294 | enclosing type. Issue any appropriate messages and set appropriate | |
e7df0180 | 3295 | flags. Returns false if an error has been diagnosed. */ |
1e30f9b4 | 3296 | |
e7df0180 | 3297 | static bool |
94edc4ab | 3298 | check_bitfield_decl (tree field) |
1e30f9b4 MM |
3299 | { |
3300 | tree type = TREE_TYPE (field); | |
606791f6 MM |
3301 | tree w; |
3302 | ||
3303 | /* Extract the declared width of the bitfield, which has been | |
3304 | temporarily stashed in DECL_INITIAL. */ | |
3305 | w = DECL_INITIAL (field); | |
3db45ab5 | 3306 | gcc_assert (w != NULL_TREE); |
606791f6 MM |
3307 | /* Remove the bit-field width indicator so that the rest of the |
3308 | compiler does not treat that value as an initializer. */ | |
3309 | DECL_INITIAL (field) = NULL_TREE; | |
1e30f9b4 | 3310 | |
cd8ed629 | 3311 | /* Detect invalid bit-field type. */ |
550a799d | 3312 | if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type)) |
1e30f9b4 | 3313 | { |
dee15844 | 3314 | error ("bit-field %q+#D with non-integral type", field); |
cd8ed629 | 3315 | w = error_mark_node; |
1e30f9b4 | 3316 | } |
606791f6 | 3317 | else |
1e30f9b4 | 3318 | { |
9e115cec | 3319 | location_t loc = input_location; |
1e30f9b4 MM |
3320 | /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */ |
3321 | STRIP_NOPS (w); | |
3322 | ||
3323 | /* detect invalid field size. */ | |
9e115cec | 3324 | input_location = DECL_SOURCE_LOCATION (field); |
fa2200cb | 3325 | w = cxx_constant_value (w); |
9e115cec | 3326 | input_location = loc; |
1e30f9b4 MM |
3327 | |
3328 | if (TREE_CODE (w) != INTEGER_CST) | |
3329 | { | |
dee15844 | 3330 | error ("bit-field %q+D width not an integer constant", field); |
cd8ed629 | 3331 | w = error_mark_node; |
1e30f9b4 | 3332 | } |
05bccae2 | 3333 | else if (tree_int_cst_sgn (w) < 0) |
1e30f9b4 | 3334 | { |
dee15844 | 3335 | error ("negative width in bit-field %q+D", field); |
cd8ed629 | 3336 | w = error_mark_node; |
1e30f9b4 | 3337 | } |
05bccae2 | 3338 | else if (integer_zerop (w) && DECL_NAME (field) != 0) |
1e30f9b4 | 3339 | { |
dee15844 | 3340 | error ("zero width for bit-field %q+D", field); |
cd8ed629 | 3341 | w = error_mark_node; |
1e30f9b4 | 3342 | } |
7f5d76fb PC |
3343 | else if ((TREE_CODE (type) != ENUMERAL_TYPE |
3344 | && TREE_CODE (type) != BOOLEAN_TYPE | |
3345 | && compare_tree_int (w, TYPE_PRECISION (type)) > 0) | |
3346 | || ((TREE_CODE (type) == ENUMERAL_TYPE | |
3347 | || TREE_CODE (type) == BOOLEAN_TYPE) | |
3348 | && tree_int_cst_lt (TYPE_SIZE (type), w))) | |
dee15844 | 3349 | warning (0, "width of %q+D exceeds its type", field); |
1e30f9b4 | 3350 | else if (TREE_CODE (type) == ENUMERAL_TYPE |
cbb4feb3 JM |
3351 | && (0 > (compare_tree_int |
3352 | (w, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type)))))) | |
dee15844 | 3353 | warning (0, "%q+D is too small to hold all values of %q#T", field, type); |
cd8ed629 | 3354 | } |
c8094d83 | 3355 | |
cd8ed629 MM |
3356 | if (w != error_mark_node) |
3357 | { | |
3358 | DECL_SIZE (field) = convert (bitsizetype, w); | |
3359 | DECL_BIT_FIELD (field) = 1; | |
e7df0180 | 3360 | return true; |
1e30f9b4 MM |
3361 | } |
3362 | else | |
cd8ed629 MM |
3363 | { |
3364 | /* Non-bit-fields are aligned for their type. */ | |
3365 | DECL_BIT_FIELD (field) = 0; | |
3366 | CLEAR_DECL_C_BIT_FIELD (field); | |
e7df0180 | 3367 | return false; |
cd8ed629 | 3368 | } |
1e30f9b4 MM |
3369 | } |
3370 | ||
3371 | /* FIELD is a non bit-field. We are finishing the processing for its | |
3372 | enclosing type T. Issue any appropriate messages and set appropriate | |
3373 | flags. */ | |
3374 | ||
3375 | static void | |
94edc4ab | 3376 | check_field_decl (tree field, |
0cbd7506 MS |
3377 | tree t, |
3378 | int* cant_have_const_ctor, | |
3379 | int* no_const_asn_ref, | |
10746f37 | 3380 | int* any_default_members) |
1e30f9b4 MM |
3381 | { |
3382 | tree type = strip_array_types (TREE_TYPE (field)); | |
3383 | ||
57ece258 | 3384 | /* In C++98 an anonymous union cannot contain any fields which would change |
1e30f9b4 | 3385 | the settings of CANT_HAVE_CONST_CTOR and friends. */ |
604b2bfc | 3386 | if (ANON_UNION_TYPE_P (type) && cxx_dialect < cxx11) |
1e30f9b4 | 3387 | ; |
066ec0a4 | 3388 | /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous |
1e30f9b4 MM |
3389 | structs. So, we recurse through their fields here. */ |
3390 | else if (ANON_AGGR_TYPE_P (type)) | |
3391 | { | |
3392 | tree fields; | |
3393 | ||
910ad8de | 3394 | for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields)) |
17aec3eb | 3395 | if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field)) |
1e30f9b4 | 3396 | check_field_decl (fields, t, cant_have_const_ctor, |
10746f37 | 3397 | no_const_asn_ref, any_default_members); |
1e30f9b4 MM |
3398 | } |
3399 | /* Check members with class type for constructors, destructors, | |
3400 | etc. */ | |
3401 | else if (CLASS_TYPE_P (type)) | |
3402 | { | |
3403 | /* Never let anything with uninheritable virtuals | |
3404 | make it through without complaint. */ | |
3405 | abstract_virtuals_error (field, type); | |
c8094d83 | 3406 | |
604b2bfc | 3407 | if (TREE_CODE (t) == UNION_TYPE && cxx_dialect < cxx11) |
1e30f9b4 | 3408 | { |
57ece258 JM |
3409 | static bool warned; |
3410 | int oldcount = errorcount; | |
1e30f9b4 | 3411 | if (TYPE_NEEDS_CONSTRUCTING (type)) |
dee15844 JM |
3412 | error ("member %q+#D with constructor not allowed in union", |
3413 | field); | |
834c6dff | 3414 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
dee15844 | 3415 | error ("member %q+#D with destructor not allowed in union", field); |
066ec0a4 | 3416 | if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type)) |
dee15844 JM |
3417 | error ("member %q+#D with copy assignment operator not allowed in union", |
3418 | field); | |
57ece258 JM |
3419 | if (!warned && errorcount > oldcount) |
3420 | { | |
3421 | inform (DECL_SOURCE_LOCATION (field), "unrestricted unions " | |
97e3ad20 | 3422 | "only available with -std=c++11 or -std=gnu++11"); |
57ece258 JM |
3423 | warned = true; |
3424 | } | |
1e30f9b4 MM |
3425 | } |
3426 | else | |
3427 | { | |
3428 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type); | |
c8094d83 | 3429 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 3430 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type); |
d758e847 JM |
3431 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
3432 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type) | |
3433 | || !TYPE_HAS_COPY_ASSIGN (type)); | |
3434 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type) | |
3435 | || !TYPE_HAS_COPY_CTOR (type)); | |
ac177431 JM |
3436 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type); |
3437 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type); | |
3438 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type) | |
3439 | || TYPE_HAS_COMPLEX_DFLT (type)); | |
1e30f9b4 MM |
3440 | } |
3441 | ||
d758e847 JM |
3442 | if (TYPE_HAS_COPY_CTOR (type) |
3443 | && !TYPE_HAS_CONST_COPY_CTOR (type)) | |
1e30f9b4 MM |
3444 | *cant_have_const_ctor = 1; |
3445 | ||
d758e847 JM |
3446 | if (TYPE_HAS_COPY_ASSIGN (type) |
3447 | && !TYPE_HAS_CONST_COPY_ASSIGN (type)) | |
1e30f9b4 | 3448 | *no_const_asn_ref = 1; |
1e30f9b4 | 3449 | } |
7dbb85a7 JM |
3450 | |
3451 | check_abi_tags (t, field); | |
3452 | ||
1e30f9b4 MM |
3453 | if (DECL_INITIAL (field) != NULL_TREE) |
3454 | { | |
3455 | /* `build_class_init_list' does not recognize | |
3456 | non-FIELD_DECLs. */ | |
0e5f8a59 | 3457 | if (TREE_CODE (t) == UNION_TYPE && *any_default_members != 0) |
1f070f2b | 3458 | error ("multiple fields in union %qT initialized", t); |
1e30f9b4 MM |
3459 | *any_default_members = 1; |
3460 | } | |
6bb88f3b | 3461 | } |
1e30f9b4 | 3462 | |
08b962b0 MM |
3463 | /* Check the data members (both static and non-static), class-scoped |
3464 | typedefs, etc., appearing in the declaration of T. Issue | |
3465 | appropriate diagnostics. Sets ACCESS_DECLS to a list (in | |
3466 | declaration order) of access declarations; each TREE_VALUE in this | |
3467 | list is a USING_DECL. | |
8d08fdba | 3468 | |
08b962b0 | 3469 | In addition, set the following flags: |
8d08fdba | 3470 | |
08b962b0 MM |
3471 | EMPTY_P |
3472 | The class is empty, i.e., contains no non-static data members. | |
8d08fdba | 3473 | |
08b962b0 MM |
3474 | CANT_HAVE_CONST_CTOR_P |
3475 | This class cannot have an implicitly generated copy constructor | |
3476 | taking a const reference. | |
8d08fdba | 3477 | |
08b962b0 MM |
3478 | CANT_HAVE_CONST_ASN_REF |
3479 | This class cannot have an implicitly generated assignment | |
3480 | operator taking a const reference. | |
8d08fdba | 3481 | |
08b962b0 MM |
3482 | All of these flags should be initialized before calling this |
3483 | function. | |
8d08fdba | 3484 | |
08b962b0 MM |
3485 | Returns a pointer to the end of the TYPE_FIELDs chain; additional |
3486 | fields can be added by adding to this chain. */ | |
8d08fdba | 3487 | |
607cf131 | 3488 | static void |
58731fd1 | 3489 | check_field_decls (tree t, tree *access_decls, |
58731fd1 | 3490 | int *cant_have_const_ctor_p, |
10746f37 | 3491 | int *no_const_asn_ref_p) |
08b962b0 MM |
3492 | { |
3493 | tree *field; | |
3494 | tree *next; | |
dd29d26b | 3495 | bool has_pointers; |
08b962b0 | 3496 | int any_default_members; |
22002050 | 3497 | int cant_pack = 0; |
c32097d8 | 3498 | int field_access = -1; |
08b962b0 MM |
3499 | |
3500 | /* Assume there are no access declarations. */ | |
3501 | *access_decls = NULL_TREE; | |
3502 | /* Assume this class has no pointer members. */ | |
dd29d26b | 3503 | has_pointers = false; |
08b962b0 MM |
3504 | /* Assume none of the members of this class have default |
3505 | initializations. */ | |
3506 | any_default_members = 0; | |
3507 | ||
3508 | for (field = &TYPE_FIELDS (t); *field; field = next) | |
8d08fdba | 3509 | { |
08b962b0 MM |
3510 | tree x = *field; |
3511 | tree type = TREE_TYPE (x); | |
c32097d8 | 3512 | int this_field_access; |
8d08fdba | 3513 | |
910ad8de | 3514 | next = &DECL_CHAIN (x); |
8d08fdba | 3515 | |
cffa8729 | 3516 | if (TREE_CODE (x) == USING_DECL) |
f30432d7 | 3517 | { |
08b962b0 MM |
3518 | /* Save the access declarations for our caller. */ |
3519 | *access_decls = tree_cons (NULL_TREE, x, *access_decls); | |
f30432d7 MS |
3520 | continue; |
3521 | } | |
8d08fdba | 3522 | |
050367a3 MM |
3523 | if (TREE_CODE (x) == TYPE_DECL |
3524 | || TREE_CODE (x) == TEMPLATE_DECL) | |
f30432d7 | 3525 | continue; |
8d08fdba | 3526 | |
f30432d7 | 3527 | /* If we've gotten this far, it's a data member, possibly static, |
e92cc029 | 3528 | or an enumerator. */ |
8d0d1915 JM |
3529 | if (TREE_CODE (x) != CONST_DECL) |
3530 | DECL_CONTEXT (x) = t; | |
8d08fdba | 3531 | |
58ec3cc5 MM |
3532 | /* When this goes into scope, it will be a non-local reference. */ |
3533 | DECL_NONLOCAL (x) = 1; | |
3534 | ||
4dadc66d PC |
3535 | if (TREE_CODE (t) == UNION_TYPE |
3536 | && cxx_dialect < cxx11) | |
58ec3cc5 | 3537 | { |
4dadc66d | 3538 | /* [class.union] (C++98) |
58ec3cc5 MM |
3539 | |
3540 | If a union contains a static data member, or a member of | |
4dadc66d PC |
3541 | reference type, the program is ill-formed. |
3542 | ||
3543 | In C++11 this limitation doesn't exist anymore. */ | |
5a6ccc94 | 3544 | if (VAR_P (x)) |
58ec3cc5 | 3545 | { |
4dadc66d PC |
3546 | error ("in C++98 %q+D may not be static because it is " |
3547 | "a member of a union", x); | |
58ec3cc5 MM |
3548 | continue; |
3549 | } | |
3550 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
3551 | { | |
4dadc66d PC |
3552 | error ("in C++98 %q+D may not have reference type %qT " |
3553 | "because it is a member of a union", x, type); | |
58ec3cc5 MM |
3554 | continue; |
3555 | } | |
3556 | } | |
3557 | ||
f30432d7 MS |
3558 | /* Perform error checking that did not get done in |
3559 | grokdeclarator. */ | |
52fb2769 | 3560 | if (TREE_CODE (type) == FUNCTION_TYPE) |
f30432d7 | 3561 | { |
dee15844 | 3562 | error ("field %q+D invalidly declared function type", x); |
52fb2769 NS |
3563 | type = build_pointer_type (type); |
3564 | TREE_TYPE (x) = type; | |
f30432d7 | 3565 | } |
52fb2769 | 3566 | else if (TREE_CODE (type) == METHOD_TYPE) |
f30432d7 | 3567 | { |
dee15844 | 3568 | error ("field %q+D invalidly declared method type", x); |
52fb2769 NS |
3569 | type = build_pointer_type (type); |
3570 | TREE_TYPE (x) = type; | |
f30432d7 | 3571 | } |
8d08fdba | 3572 | |
52fb2769 | 3573 | if (type == error_mark_node) |
f30432d7 | 3574 | continue; |
c8094d83 | 3575 | |
5a6ccc94 | 3576 | if (TREE_CODE (x) == CONST_DECL || VAR_P (x)) |
73a8adb6 | 3577 | continue; |
8d08fdba | 3578 | |
f30432d7 | 3579 | /* Now it can only be a FIELD_DECL. */ |
8d08fdba | 3580 | |
f30432d7 | 3581 | if (TREE_PRIVATE (x) || TREE_PROTECTED (x)) |
08b962b0 | 3582 | CLASSTYPE_NON_AGGREGATE (t) = 1; |
8d08fdba | 3583 | |
3b49d762 | 3584 | /* If at least one non-static data member is non-literal, the whole |
cec362c9 PC |
3585 | class becomes non-literal. Per Core/1453, volatile non-static |
3586 | data members and base classes are also not allowed. | |
3587 | Note: if the type is incomplete we will complain later on. */ | |
3588 | if (COMPLETE_TYPE_P (type) | |
3589 | && (!literal_type_p (type) || CP_TYPE_VOLATILE_P (type))) | |
3b49d762 GDR |
3590 | CLASSTYPE_LITERAL_P (t) = false; |
3591 | ||
c32097d8 JM |
3592 | /* A standard-layout class is a class that: |
3593 | ... | |
3594 | has the same access control (Clause 11) for all non-static data members, | |
3595 | ... */ | |
3596 | this_field_access = TREE_PROTECTED (x) ? 1 : TREE_PRIVATE (x) ? 2 : 0; | |
3597 | if (field_access == -1) | |
3598 | field_access = this_field_access; | |
3599 | else if (this_field_access != field_access) | |
3600 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
3601 | ||
0fcedd9c | 3602 | /* If this is of reference type, check if it needs an init. */ |
52fb2769 | 3603 | if (TREE_CODE (type) == REFERENCE_TYPE) |
0cbd7506 | 3604 | { |
c32097d8 JM |
3605 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3606 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
f30432d7 | 3607 | if (DECL_INITIAL (x) == NULL_TREE) |
6eb35968 | 3608 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); |
8d08fdba | 3609 | |
f30432d7 MS |
3610 | /* ARM $12.6.2: [A member initializer list] (or, for an |
3611 | aggregate, initialization by a brace-enclosed list) is the | |
3612 | only way to initialize nonstatic const and reference | |
3613 | members. */ | |
066ec0a4 | 3614 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3615 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3616 | } |
8d08fdba | 3617 | |
1e30f9b4 | 3618 | type = strip_array_types (type); |
dd29d26b | 3619 | |
1937f939 JM |
3620 | if (TYPE_PACKED (t)) |
3621 | { | |
c32097d8 | 3622 | if (!layout_pod_type_p (type) && !TYPE_PACKED (type)) |
4666cd04 JM |
3623 | { |
3624 | warning | |
3625 | (0, | |
3626 | "ignoring packed attribute because of unpacked non-POD field %q+#D", | |
3627 | x); | |
22002050 | 3628 | cant_pack = 1; |
4666cd04 | 3629 | } |
2cd36c22 AN |
3630 | else if (DECL_C_BIT_FIELD (x) |
3631 | || TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT) | |
1937f939 JM |
3632 | DECL_PACKED (x) = 1; |
3633 | } | |
3634 | ||
3635 | if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x))) | |
3636 | /* We don't treat zero-width bitfields as making a class | |
3637 | non-empty. */ | |
3638 | ; | |
3639 | else | |
3640 | { | |
3641 | /* The class is non-empty. */ | |
3642 | CLASSTYPE_EMPTY_P (t) = 0; | |
3643 | /* The class is not even nearly empty. */ | |
3644 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
3645 | /* If one of the data members contains an empty class, | |
3646 | so does T. */ | |
3647 | if (CLASS_TYPE_P (type) | |
3648 | && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3649 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
3650 | } | |
3651 | ||
dd29d26b GB |
3652 | /* This is used by -Weffc++ (see below). Warn only for pointers |
3653 | to members which might hold dynamic memory. So do not warn | |
3654 | for pointers to functions or pointers to members. */ | |
3655 | if (TYPE_PTR_P (type) | |
66b1156a | 3656 | && !TYPE_PTRFN_P (type)) |
dd29d26b | 3657 | has_pointers = true; |
824b9a4c | 3658 | |
58ec3cc5 MM |
3659 | if (CLASS_TYPE_P (type)) |
3660 | { | |
3661 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (type)) | |
3662 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); | |
3663 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)) | |
3664 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); | |
3665 | } | |
3666 | ||
52fb2769 | 3667 | if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type)) |
08b962b0 | 3668 | CLASSTYPE_HAS_MUTABLE (t) = 1; |
a7a7710d | 3669 | |
42306d73 PC |
3670 | if (DECL_MUTABLE_P (x)) |
3671 | { | |
3672 | if (CP_TYPE_CONST_P (type)) | |
3673 | { | |
3674 | error ("member %q+D cannot be declared both %<const%> " | |
3675 | "and %<mutable%>", x); | |
3676 | continue; | |
3677 | } | |
3678 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
3679 | { | |
3680 | error ("member %q+D cannot be declared as a %<mutable%> " | |
3681 | "reference", x); | |
3682 | continue; | |
3683 | } | |
3684 | } | |
3685 | ||
c32097d8 | 3686 | if (! layout_pod_type_p (type)) |
0cbd7506 MS |
3687 | /* DR 148 now allows pointers to members (which are POD themselves), |
3688 | to be allowed in POD structs. */ | |
c32097d8 JM |
3689 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3690 | ||
3691 | if (!std_layout_type_p (type)) | |
3692 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
52fb2769 | 3693 | |
94e6e4c4 AO |
3694 | if (! zero_init_p (type)) |
3695 | CLASSTYPE_NON_ZERO_INIT_P (t) = 1; | |
3696 | ||
640c2adf FC |
3697 | /* We set DECL_C_BIT_FIELD in grokbitfield. |
3698 | If the type and width are valid, we'll also set DECL_BIT_FIELD. */ | |
3699 | if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x)) | |
3700 | check_field_decl (x, t, | |
3701 | cant_have_const_ctor_p, | |
3702 | no_const_asn_ref_p, | |
10746f37 | 3703 | &any_default_members); |
640c2adf | 3704 | |
ec3ebf45 OG |
3705 | /* Now that we've removed bit-field widths from DECL_INITIAL, |
3706 | anything left in DECL_INITIAL is an NSDMI that makes the class | |
3e605b20 JM |
3707 | non-aggregate in C++11. */ |
3708 | if (DECL_INITIAL (x) && cxx_dialect < cxx14) | |
ec3ebf45 OG |
3709 | CLASSTYPE_NON_AGGREGATE (t) = true; |
3710 | ||
f30432d7 | 3711 | /* If any field is const, the structure type is pseudo-const. */ |
52fb2769 | 3712 | if (CP_TYPE_CONST_P (type)) |
f30432d7 MS |
3713 | { |
3714 | C_TYPE_FIELDS_READONLY (t) = 1; | |
3715 | if (DECL_INITIAL (x) == NULL_TREE) | |
6eb35968 | 3716 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); |
f30432d7 MS |
3717 | |
3718 | /* ARM $12.6.2: [A member initializer list] (or, for an | |
3719 | aggregate, initialization by a brace-enclosed list) is the | |
3720 | only way to initialize nonstatic const and reference | |
3721 | members. */ | |
066ec0a4 | 3722 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3723 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3724 | } |
08b962b0 | 3725 | /* A field that is pseudo-const makes the structure likewise. */ |
5552b43c | 3726 | else if (CLASS_TYPE_P (type)) |
f30432d7 | 3727 | { |
08b962b0 | 3728 | C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type); |
6eb35968 DE |
3729 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, |
3730 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) | |
3731 | | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)); | |
f30432d7 | 3732 | } |
8d08fdba | 3733 | |
c10bffd0 JM |
3734 | /* Core issue 80: A nonstatic data member is required to have a |
3735 | different name from the class iff the class has a | |
b87d79e6 | 3736 | user-declared constructor. */ |
0fcedd9c JM |
3737 | if (constructor_name_p (DECL_NAME (x), t) |
3738 | && TYPE_HAS_USER_CONSTRUCTOR (t)) | |
cbe5f3b3 | 3739 | permerror (input_location, "field %q+#D with same name as class", x); |
8d08fdba MS |
3740 | } |
3741 | ||
dd29d26b GB |
3742 | /* Effective C++ rule 11: if a class has dynamic memory held by pointers, |
3743 | it should also define a copy constructor and an assignment operator to | |
3744 | implement the correct copy semantic (deep vs shallow, etc.). As it is | |
3745 | not feasible to check whether the constructors do allocate dynamic memory | |
3746 | and store it within members, we approximate the warning like this: | |
3747 | ||
3748 | -- Warn only if there are members which are pointers | |
3749 | -- Warn only if there is a non-trivial constructor (otherwise, | |
3750 | there cannot be memory allocated). | |
3751 | -- Warn only if there is a non-trivial destructor. We assume that the | |
3752 | user at least implemented the cleanup correctly, and a destructor | |
3753 | is needed to free dynamic memory. | |
c8094d83 | 3754 | |
77880ae4 | 3755 | This seems enough for practical purposes. */ |
22002050 JM |
3756 | if (warn_ecpp |
3757 | && has_pointers | |
0fcedd9c | 3758 | && TYPE_HAS_USER_CONSTRUCTOR (t) |
22002050 | 3759 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
066ec0a4 | 3760 | && !(TYPE_HAS_COPY_CTOR (t) && TYPE_HAS_COPY_ASSIGN (t))) |
824b9a4c | 3761 | { |
b323323f | 3762 | warning (OPT_Weffc__, "%q#T has pointer data members", t); |
c8094d83 | 3763 | |
066ec0a4 | 3764 | if (! TYPE_HAS_COPY_CTOR (t)) |
824b9a4c | 3765 | { |
74fa0285 | 3766 | warning (OPT_Weffc__, |
3db45ab5 | 3767 | " but does not override %<%T(const %T&)%>", t, t); |
066ec0a4 | 3768 | if (!TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3769 | warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t); |
824b9a4c | 3770 | } |
066ec0a4 | 3771 | else if (! TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3772 | warning (OPT_Weffc__, |
3db45ab5 | 3773 | " but does not override %<operator=(const %T&)%>", t); |
824b9a4c | 3774 | } |
08b962b0 | 3775 | |
0e5f8a59 JM |
3776 | /* Non-static data member initializers make the default constructor |
3777 | non-trivial. */ | |
3778 | if (any_default_members) | |
3779 | { | |
3780 | TYPE_NEEDS_CONSTRUCTING (t) = true; | |
3781 | TYPE_HAS_COMPLEX_DFLT (t) = true; | |
3782 | } | |
3783 | ||
22002050 JM |
3784 | /* If any of the fields couldn't be packed, unset TYPE_PACKED. */ |
3785 | if (cant_pack) | |
3786 | TYPE_PACKED (t) = 0; | |
607cf131 MM |
3787 | |
3788 | /* Check anonymous struct/anonymous union fields. */ | |
3789 | finish_struct_anon (t); | |
3790 | ||
08b962b0 MM |
3791 | /* We've built up the list of access declarations in reverse order. |
3792 | Fix that now. */ | |
3793 | *access_decls = nreverse (*access_decls); | |
08b962b0 MM |
3794 | } |
3795 | ||
c20118a8 MM |
3796 | /* If TYPE is an empty class type, records its OFFSET in the table of |
3797 | OFFSETS. */ | |
607cf131 | 3798 | |
c20118a8 | 3799 | static int |
94edc4ab | 3800 | record_subobject_offset (tree type, tree offset, splay_tree offsets) |
5c24fba6 | 3801 | { |
c20118a8 | 3802 | splay_tree_node n; |
5c24fba6 | 3803 | |
c20118a8 MM |
3804 | if (!is_empty_class (type)) |
3805 | return 0; | |
5c24fba6 | 3806 | |
c20118a8 MM |
3807 | /* Record the location of this empty object in OFFSETS. */ |
3808 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3809 | if (!n) | |
c8094d83 | 3810 | n = splay_tree_insert (offsets, |
c20118a8 MM |
3811 | (splay_tree_key) offset, |
3812 | (splay_tree_value) NULL_TREE); | |
c8094d83 | 3813 | n->value = ((splay_tree_value) |
c20118a8 MM |
3814 | tree_cons (NULL_TREE, |
3815 | type, | |
3816 | (tree) n->value)); | |
3817 | ||
3818 | return 0; | |
607cf131 MM |
3819 | } |
3820 | ||
838dfd8a | 3821 | /* Returns nonzero if TYPE is an empty class type and there is |
c20118a8 | 3822 | already an entry in OFFSETS for the same TYPE as the same OFFSET. */ |
9785e4b1 | 3823 | |
c20118a8 | 3824 | static int |
94edc4ab | 3825 | check_subobject_offset (tree type, tree offset, splay_tree offsets) |
9785e4b1 | 3826 | { |
c20118a8 MM |
3827 | splay_tree_node n; |
3828 | tree t; | |
3829 | ||
3830 | if (!is_empty_class (type)) | |
3831 | return 0; | |
3832 | ||
3833 | /* Record the location of this empty object in OFFSETS. */ | |
3834 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3835 | if (!n) | |
3836 | return 0; | |
3837 | ||
3838 | for (t = (tree) n->value; t; t = TREE_CHAIN (t)) | |
3839 | if (same_type_p (TREE_VALUE (t), type)) | |
3840 | return 1; | |
3841 | ||
3842 | return 0; | |
9785e4b1 MM |
3843 | } |
3844 | ||
c20118a8 MM |
3845 | /* Walk through all the subobjects of TYPE (located at OFFSET). Call |
3846 | F for every subobject, passing it the type, offset, and table of | |
2003cd37 MM |
3847 | OFFSETS. If VBASES_P is one, then virtual non-primary bases should |
3848 | be traversed. | |
5cdba4ff MM |
3849 | |
3850 | If MAX_OFFSET is non-NULL, then subobjects with an offset greater | |
3851 | than MAX_OFFSET will not be walked. | |
3852 | ||
838dfd8a | 3853 | If F returns a nonzero value, the traversal ceases, and that value |
5cdba4ff | 3854 | is returned. Otherwise, returns zero. */ |
d77249e7 | 3855 | |
c20118a8 | 3856 | static int |
c8094d83 | 3857 | walk_subobject_offsets (tree type, |
0cbd7506 MS |
3858 | subobject_offset_fn f, |
3859 | tree offset, | |
3860 | splay_tree offsets, | |
3861 | tree max_offset, | |
3862 | int vbases_p) | |
5c24fba6 | 3863 | { |
c20118a8 | 3864 | int r = 0; |
ff944b49 | 3865 | tree type_binfo = NULL_TREE; |
c20118a8 | 3866 | |
5cdba4ff MM |
3867 | /* If this OFFSET is bigger than the MAX_OFFSET, then we should |
3868 | stop. */ | |
807e902e | 3869 | if (max_offset && tree_int_cst_lt (max_offset, offset)) |
5cdba4ff MM |
3870 | return 0; |
3871 | ||
dbe91deb NS |
3872 | if (type == error_mark_node) |
3873 | return 0; | |
3db45ab5 | 3874 | |
c8094d83 | 3875 | if (!TYPE_P (type)) |
ff944b49 | 3876 | { |
90d84934 | 3877 | type_binfo = type; |
ff944b49 MM |
3878 | type = BINFO_TYPE (type); |
3879 | } | |
3880 | ||
c20118a8 | 3881 | if (CLASS_TYPE_P (type)) |
5c24fba6 | 3882 | { |
c20118a8 | 3883 | tree field; |
17bbb839 | 3884 | tree binfo; |
c20118a8 MM |
3885 | int i; |
3886 | ||
5ec1192e MM |
3887 | /* Avoid recursing into objects that are not interesting. */ |
3888 | if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3889 | return 0; | |
3890 | ||
c20118a8 MM |
3891 | /* Record the location of TYPE. */ |
3892 | r = (*f) (type, offset, offsets); | |
3893 | if (r) | |
3894 | return r; | |
3895 | ||
3896 | /* Iterate through the direct base classes of TYPE. */ | |
ff944b49 MM |
3897 | if (!type_binfo) |
3898 | type_binfo = TYPE_BINFO (type); | |
fa743e8c | 3899 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++) |
c20118a8 | 3900 | { |
ff944b49 MM |
3901 | tree binfo_offset; |
3902 | ||
90d84934 | 3903 | if (BINFO_VIRTUAL_P (binfo)) |
17bbb839 | 3904 | continue; |
5c24fba6 | 3905 | |
90d84934 JM |
3906 | tree orig_binfo; |
3907 | /* We cannot rely on BINFO_OFFSET being set for the base | |
3908 | class yet, but the offsets for direct non-virtual | |
3909 | bases can be calculated by going back to the TYPE. */ | |
3910 | orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i); | |
3911 | binfo_offset = size_binop (PLUS_EXPR, | |
3912 | offset, | |
3913 | BINFO_OFFSET (orig_binfo)); | |
ff944b49 MM |
3914 | |
3915 | r = walk_subobject_offsets (binfo, | |
c20118a8 | 3916 | f, |
ff944b49 | 3917 | binfo_offset, |
c20118a8 | 3918 | offsets, |
5cdba4ff | 3919 | max_offset, |
90d84934 | 3920 | /*vbases_p=*/0); |
c20118a8 MM |
3921 | if (r) |
3922 | return r; | |
3923 | } | |
3924 | ||
90d84934 | 3925 | if (CLASSTYPE_VBASECLASSES (type)) |
17bbb839 | 3926 | { |
58c42dc2 | 3927 | unsigned ix; |
9771b263 | 3928 | vec<tree, va_gc> *vbases; |
17bbb839 | 3929 | |
ff944b49 MM |
3930 | /* Iterate through the virtual base classes of TYPE. In G++ |
3931 | 3.2, we included virtual bases in the direct base class | |
3932 | loop above, which results in incorrect results; the | |
3933 | correct offsets for virtual bases are only known when | |
3934 | working with the most derived type. */ | |
3935 | if (vbases_p) | |
9ba5ff0f | 3936 | for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0; |
9771b263 | 3937 | vec_safe_iterate (vbases, ix, &binfo); ix++) |
ff944b49 | 3938 | { |
ff944b49 MM |
3939 | r = walk_subobject_offsets (binfo, |
3940 | f, | |
3941 | size_binop (PLUS_EXPR, | |
3942 | offset, | |
3943 | BINFO_OFFSET (binfo)), | |
3944 | offsets, | |
3945 | max_offset, | |
3946 | /*vbases_p=*/0); | |
3947 | if (r) | |
3948 | return r; | |
3949 | } | |
3950 | else | |
17bbb839 | 3951 | { |
ff944b49 MM |
3952 | /* We still have to walk the primary base, if it is |
3953 | virtual. (If it is non-virtual, then it was walked | |
3954 | above.) */ | |
58c42dc2 | 3955 | tree vbase = get_primary_binfo (type_binfo); |
c8094d83 | 3956 | |
809e3e7f | 3957 | if (vbase && BINFO_VIRTUAL_P (vbase) |
fc6633e0 NS |
3958 | && BINFO_PRIMARY_P (vbase) |
3959 | && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo) | |
ff944b49 | 3960 | { |
c8094d83 | 3961 | r = (walk_subobject_offsets |
dbbf88d1 NS |
3962 | (vbase, f, offset, |
3963 | offsets, max_offset, /*vbases_p=*/0)); | |
3964 | if (r) | |
3965 | return r; | |
ff944b49 | 3966 | } |
17bbb839 MM |
3967 | } |
3968 | } | |
3969 | ||
c20118a8 | 3970 | /* Iterate through the fields of TYPE. */ |
910ad8de | 3971 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
e765a228 JM |
3972 | if (TREE_CODE (field) == FIELD_DECL |
3973 | && TREE_TYPE (field) != error_mark_node | |
3974 | && !DECL_ARTIFICIAL (field)) | |
c20118a8 | 3975 | { |
956d9305 MM |
3976 | tree field_offset; |
3977 | ||
90d84934 | 3978 | field_offset = byte_position (field); |
956d9305 | 3979 | |
c20118a8 MM |
3980 | r = walk_subobject_offsets (TREE_TYPE (field), |
3981 | f, | |
3982 | size_binop (PLUS_EXPR, | |
3983 | offset, | |
956d9305 | 3984 | field_offset), |
c20118a8 | 3985 | offsets, |
5cdba4ff | 3986 | max_offset, |
c20118a8 MM |
3987 | /*vbases_p=*/1); |
3988 | if (r) | |
3989 | return r; | |
3990 | } | |
5c24fba6 | 3991 | } |
c20118a8 MM |
3992 | else if (TREE_CODE (type) == ARRAY_TYPE) |
3993 | { | |
5ec1192e | 3994 | tree element_type = strip_array_types (type); |
c20118a8 MM |
3995 | tree domain = TYPE_DOMAIN (type); |
3996 | tree index; | |
5c24fba6 | 3997 | |
5ec1192e MM |
3998 | /* Avoid recursing into objects that are not interesting. */ |
3999 | if (!CLASS_TYPE_P (element_type) | |
4000 | || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type)) | |
4001 | return 0; | |
4002 | ||
c20118a8 | 4003 | /* Step through each of the elements in the array. */ |
17bbb839 | 4004 | for (index = size_zero_node; |
90d84934 | 4005 | !tree_int_cst_lt (TYPE_MAX_VALUE (domain), index); |
c20118a8 MM |
4006 | index = size_binop (PLUS_EXPR, index, size_one_node)) |
4007 | { | |
4008 | r = walk_subobject_offsets (TREE_TYPE (type), | |
4009 | f, | |
4010 | offset, | |
4011 | offsets, | |
5cdba4ff | 4012 | max_offset, |
c20118a8 MM |
4013 | /*vbases_p=*/1); |
4014 | if (r) | |
4015 | return r; | |
c8094d83 | 4016 | offset = size_binop (PLUS_EXPR, offset, |
c20118a8 | 4017 | TYPE_SIZE_UNIT (TREE_TYPE (type))); |
5cdba4ff MM |
4018 | /* If this new OFFSET is bigger than the MAX_OFFSET, then |
4019 | there's no point in iterating through the remaining | |
4020 | elements of the array. */ | |
807e902e | 4021 | if (max_offset && tree_int_cst_lt (max_offset, offset)) |
5cdba4ff | 4022 | break; |
c20118a8 MM |
4023 | } |
4024 | } | |
4025 | ||
4026 | return 0; | |
4027 | } | |
4028 | ||
c0572427 MM |
4029 | /* Record all of the empty subobjects of TYPE (either a type or a |
4030 | binfo). If IS_DATA_MEMBER is true, then a non-static data member | |
c5a35c3c MM |
4031 | is being placed at OFFSET; otherwise, it is a base class that is |
4032 | being placed at OFFSET. */ | |
c20118a8 MM |
4033 | |
4034 | static void | |
c8094d83 | 4035 | record_subobject_offsets (tree type, |
0cbd7506 MS |
4036 | tree offset, |
4037 | splay_tree offsets, | |
c5a35c3c | 4038 | bool is_data_member) |
c20118a8 | 4039 | { |
c5a35c3c | 4040 | tree max_offset; |
c0572427 MM |
4041 | /* If recording subobjects for a non-static data member or a |
4042 | non-empty base class , we do not need to record offsets beyond | |
4043 | the size of the biggest empty class. Additional data members | |
4044 | will go at the end of the class. Additional base classes will go | |
4045 | either at offset zero (if empty, in which case they cannot | |
4046 | overlap with offsets past the size of the biggest empty class) or | |
4047 | at the end of the class. | |
4048 | ||
4049 | However, if we are placing an empty base class, then we must record | |
c5a35c3c MM |
4050 | all offsets, as either the empty class is at offset zero (where |
4051 | other empty classes might later be placed) or at the end of the | |
4052 | class (where other objects might then be placed, so other empty | |
4053 | subobjects might later overlap). */ | |
3db45ab5 | 4054 | if (is_data_member |
c0572427 | 4055 | || !is_empty_class (BINFO_TYPE (type))) |
c5a35c3c MM |
4056 | max_offset = sizeof_biggest_empty_class; |
4057 | else | |
4058 | max_offset = NULL_TREE; | |
c20118a8 | 4059 | walk_subobject_offsets (type, record_subobject_offset, offset, |
c5a35c3c | 4060 | offsets, max_offset, is_data_member); |
5c24fba6 MM |
4061 | } |
4062 | ||
838dfd8a KH |
4063 | /* Returns nonzero if any of the empty subobjects of TYPE (located at |
4064 | OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero, | |
c20118a8 | 4065 | virtual bases of TYPE are examined. */ |
9785e4b1 MM |
4066 | |
4067 | static int | |
94edc4ab | 4068 | layout_conflict_p (tree type, |
0cbd7506 MS |
4069 | tree offset, |
4070 | splay_tree offsets, | |
4071 | int vbases_p) | |
9785e4b1 | 4072 | { |
5cdba4ff MM |
4073 | splay_tree_node max_node; |
4074 | ||
4075 | /* Get the node in OFFSETS that indicates the maximum offset where | |
4076 | an empty subobject is located. */ | |
4077 | max_node = splay_tree_max (offsets); | |
4078 | /* If there aren't any empty subobjects, then there's no point in | |
4079 | performing this check. */ | |
4080 | if (!max_node) | |
4081 | return 0; | |
4082 | ||
c20118a8 | 4083 | return walk_subobject_offsets (type, check_subobject_offset, offset, |
5cdba4ff MM |
4084 | offsets, (tree) (max_node->key), |
4085 | vbases_p); | |
9785e4b1 MM |
4086 | } |
4087 | ||
5c24fba6 MM |
4088 | /* DECL is a FIELD_DECL corresponding either to a base subobject of a |
4089 | non-static data member of the type indicated by RLI. BINFO is the | |
c20118a8 | 4090 | binfo corresponding to the base subobject, OFFSETS maps offsets to |
17bbb839 MM |
4091 | types already located at those offsets. This function determines |
4092 | the position of the DECL. */ | |
5c24fba6 MM |
4093 | |
4094 | static void | |
c8094d83 MS |
4095 | layout_nonempty_base_or_field (record_layout_info rli, |
4096 | tree decl, | |
4097 | tree binfo, | |
17bbb839 | 4098 | splay_tree offsets) |
5c24fba6 | 4099 | { |
c20118a8 | 4100 | tree offset = NULL_TREE; |
17bbb839 MM |
4101 | bool field_p; |
4102 | tree type; | |
c8094d83 | 4103 | |
17bbb839 MM |
4104 | if (binfo) |
4105 | { | |
4106 | /* For the purposes of determining layout conflicts, we want to | |
4107 | use the class type of BINFO; TREE_TYPE (DECL) will be the | |
4108 | CLASSTYPE_AS_BASE version, which does not contain entries for | |
4109 | zero-sized bases. */ | |
4110 | type = TREE_TYPE (binfo); | |
4111 | field_p = false; | |
4112 | } | |
4113 | else | |
4114 | { | |
4115 | type = TREE_TYPE (decl); | |
4116 | field_p = true; | |
4117 | } | |
c20118a8 | 4118 | |
5c24fba6 MM |
4119 | /* Try to place the field. It may take more than one try if we have |
4120 | a hard time placing the field without putting two objects of the | |
4121 | same type at the same address. */ | |
4122 | while (1) | |
4123 | { | |
defd0dea | 4124 | struct record_layout_info_s old_rli = *rli; |
5c24fba6 | 4125 | |
770ae6cc RK |
4126 | /* Place this field. */ |
4127 | place_field (rli, decl); | |
da3d4dfa | 4128 | offset = byte_position (decl); |
1e2e9f54 | 4129 | |
5c24fba6 MM |
4130 | /* We have to check to see whether or not there is already |
4131 | something of the same type at the offset we're about to use. | |
1e2e9f54 | 4132 | For example, consider: |
c8094d83 | 4133 | |
1e2e9f54 MM |
4134 | struct S {}; |
4135 | struct T : public S { int i; }; | |
4136 | struct U : public S, public T {}; | |
c8094d83 | 4137 | |
5c24fba6 MM |
4138 | Here, we put S at offset zero in U. Then, we can't put T at |
4139 | offset zero -- its S component would be at the same address | |
4140 | as the S we already allocated. So, we have to skip ahead. | |
4141 | Since all data members, including those whose type is an | |
838dfd8a | 4142 | empty class, have nonzero size, any overlap can happen only |
5c24fba6 MM |
4143 | with a direct or indirect base-class -- it can't happen with |
4144 | a data member. */ | |
1e2e9f54 MM |
4145 | /* In a union, overlap is permitted; all members are placed at |
4146 | offset zero. */ | |
4147 | if (TREE_CODE (rli->t) == UNION_TYPE) | |
4148 | break; | |
c8094d83 | 4149 | if (layout_conflict_p (field_p ? type : binfo, offset, |
ff944b49 | 4150 | offsets, field_p)) |
5c24fba6 | 4151 | { |
5c24fba6 MM |
4152 | /* Strip off the size allocated to this field. That puts us |
4153 | at the first place we could have put the field with | |
4154 | proper alignment. */ | |
770ae6cc RK |
4155 | *rli = old_rli; |
4156 | ||
c20118a8 | 4157 | /* Bump up by the alignment required for the type. */ |
770ae6cc | 4158 | rli->bitpos |
c8094d83 MS |
4159 | = size_binop (PLUS_EXPR, rli->bitpos, |
4160 | bitsize_int (binfo | |
c20118a8 MM |
4161 | ? CLASSTYPE_ALIGN (type) |
4162 | : TYPE_ALIGN (type))); | |
770ae6cc | 4163 | normalize_rli (rli); |
5c24fba6 MM |
4164 | } |
4165 | else | |
4166 | /* There was no conflict. We're done laying out this field. */ | |
4167 | break; | |
4168 | } | |
c20118a8 | 4169 | |
623fe76a | 4170 | /* Now that we know where it will be placed, update its |
c20118a8 MM |
4171 | BINFO_OFFSET. */ |
4172 | if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo))) | |
90024bdc | 4173 | /* Indirect virtual bases may have a nonzero BINFO_OFFSET at |
17bbb839 MM |
4174 | this point because their BINFO_OFFSET is copied from another |
4175 | hierarchy. Therefore, we may not need to add the entire | |
4176 | OFFSET. */ | |
c8094d83 | 4177 | propagate_binfo_offsets (binfo, |
db3927fb AH |
4178 | size_diffop_loc (input_location, |
4179 | convert (ssizetype, offset), | |
c8094d83 | 4180 | convert (ssizetype, |
dbbf88d1 | 4181 | BINFO_OFFSET (binfo)))); |
5c24fba6 MM |
4182 | } |
4183 | ||
90024bdc | 4184 | /* Returns true if TYPE is empty and OFFSET is nonzero. */ |
7ba539c6 MM |
4185 | |
4186 | static int | |
4187 | empty_base_at_nonzero_offset_p (tree type, | |
4188 | tree offset, | |
12308bc6 | 4189 | splay_tree /*offsets*/) |
7ba539c6 MM |
4190 | { |
4191 | return is_empty_class (type) && !integer_zerop (offset); | |
4192 | } | |
4193 | ||
9785e4b1 | 4194 | /* Layout the empty base BINFO. EOC indicates the byte currently just |
ec386958 | 4195 | past the end of the class, and should be correctly aligned for a |
c20118a8 | 4196 | class of the type indicated by BINFO; OFFSETS gives the offsets of |
623fe76a | 4197 | the empty bases allocated so far. T is the most derived |
838dfd8a | 4198 | type. Return nonzero iff we added it at the end. */ |
9785e4b1 | 4199 | |
06d9f09f | 4200 | static bool |
d9d9dbc0 JM |
4201 | layout_empty_base (record_layout_info rli, tree binfo, |
4202 | tree eoc, splay_tree offsets) | |
9785e4b1 | 4203 | { |
ec386958 | 4204 | tree alignment; |
9785e4b1 | 4205 | tree basetype = BINFO_TYPE (binfo); |
06d9f09f | 4206 | bool atend = false; |
956d9305 | 4207 | |
9785e4b1 | 4208 | /* This routine should only be used for empty classes. */ |
50bc768d | 4209 | gcc_assert (is_empty_class (basetype)); |
1b50716d | 4210 | alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype)); |
9785e4b1 | 4211 | |
3075b327 | 4212 | if (!integer_zerop (BINFO_OFFSET (binfo))) |
90d84934 JM |
4213 | propagate_binfo_offsets |
4214 | (binfo, size_diffop_loc (input_location, | |
db3927fb | 4215 | size_zero_node, BINFO_OFFSET (binfo))); |
c8094d83 | 4216 | |
9785e4b1 MM |
4217 | /* This is an empty base class. We first try to put it at offset |
4218 | zero. */ | |
ff944b49 | 4219 | if (layout_conflict_p (binfo, |
c20118a8 | 4220 | BINFO_OFFSET (binfo), |
c8094d83 | 4221 | offsets, |
c20118a8 | 4222 | /*vbases_p=*/0)) |
9785e4b1 MM |
4223 | { |
4224 | /* That didn't work. Now, we move forward from the next | |
4225 | available spot in the class. */ | |
06d9f09f | 4226 | atend = true; |
dbbf88d1 | 4227 | propagate_binfo_offsets (binfo, convert (ssizetype, eoc)); |
c8094d83 | 4228 | while (1) |
9785e4b1 | 4229 | { |
ff944b49 | 4230 | if (!layout_conflict_p (binfo, |
c8094d83 | 4231 | BINFO_OFFSET (binfo), |
c20118a8 MM |
4232 | offsets, |
4233 | /*vbases_p=*/0)) | |
9785e4b1 MM |
4234 | /* We finally found a spot where there's no overlap. */ |
4235 | break; | |
4236 | ||
4237 | /* There's overlap here, too. Bump along to the next spot. */ | |
dbbf88d1 | 4238 | propagate_binfo_offsets (binfo, alignment); |
9785e4b1 MM |
4239 | } |
4240 | } | |
d9d9dbc0 JM |
4241 | |
4242 | if (CLASSTYPE_USER_ALIGN (basetype)) | |
4243 | { | |
4244 | rli->record_align = MAX (rli->record_align, CLASSTYPE_ALIGN (basetype)); | |
4245 | if (warn_packed) | |
4246 | rli->unpacked_align = MAX (rli->unpacked_align, CLASSTYPE_ALIGN (basetype)); | |
4247 | TYPE_USER_ALIGN (rli->t) = 1; | |
4248 | } | |
4249 | ||
06d9f09f | 4250 | return atend; |
9785e4b1 MM |
4251 | } |
4252 | ||
78dcd41a | 4253 | /* Layout the base given by BINFO in the class indicated by RLI. |
58731fd1 | 4254 | *BASE_ALIGN is a running maximum of the alignments of |
17bbb839 MM |
4255 | any base class. OFFSETS gives the location of empty base |
4256 | subobjects. T is the most derived type. Return nonzero if the new | |
4257 | object cannot be nearly-empty. A new FIELD_DECL is inserted at | |
c8094d83 | 4258 | *NEXT_FIELD, unless BINFO is for an empty base class. |
5c24fba6 | 4259 | |
17bbb839 MM |
4260 | Returns the location at which the next field should be inserted. */ |
4261 | ||
4262 | static tree * | |
58731fd1 | 4263 | build_base_field (record_layout_info rli, tree binfo, |
17bbb839 | 4264 | splay_tree offsets, tree *next_field) |
d77249e7 | 4265 | { |
17bbb839 | 4266 | tree t = rli->t; |
d77249e7 | 4267 | tree basetype = BINFO_TYPE (binfo); |
d77249e7 | 4268 | |
d0f062fb | 4269 | if (!COMPLETE_TYPE_P (basetype)) |
d77249e7 MM |
4270 | /* This error is now reported in xref_tag, thus giving better |
4271 | location information. */ | |
17bbb839 | 4272 | return next_field; |
c8094d83 | 4273 | |
17bbb839 MM |
4274 | /* Place the base class. */ |
4275 | if (!is_empty_class (basetype)) | |
5c24fba6 | 4276 | { |
17bbb839 MM |
4277 | tree decl; |
4278 | ||
5c24fba6 MM |
4279 | /* The containing class is non-empty because it has a non-empty |
4280 | base class. */ | |
58731fd1 | 4281 | CLASSTYPE_EMPTY_P (t) = 0; |
c8094d83 | 4282 | |
17bbb839 | 4283 | /* Create the FIELD_DECL. */ |
c2255bc4 AH |
4284 | decl = build_decl (input_location, |
4285 | FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype)); | |
17bbb839 | 4286 | DECL_ARTIFICIAL (decl) = 1; |
78e0d62b | 4287 | DECL_IGNORED_P (decl) = 1; |
17bbb839 | 4288 | DECL_FIELD_CONTEXT (decl) = t; |
1ad8aeeb DG |
4289 | if (CLASSTYPE_AS_BASE (basetype)) |
4290 | { | |
4291 | DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype); | |
4292 | DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype); | |
4293 | DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype); | |
4294 | DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype); | |
4295 | DECL_MODE (decl) = TYPE_MODE (basetype); | |
4296 | DECL_FIELD_IS_BASE (decl) = 1; | |
4297 | ||
4298 | /* Try to place the field. It may take more than one try if we | |
4299 | have a hard time placing the field without putting two | |
4300 | objects of the same type at the same address. */ | |
4301 | layout_nonempty_base_or_field (rli, decl, binfo, offsets); | |
4302 | /* Add the new FIELD_DECL to the list of fields for T. */ | |
910ad8de | 4303 | DECL_CHAIN (decl) = *next_field; |
1ad8aeeb | 4304 | *next_field = decl; |
910ad8de | 4305 | next_field = &DECL_CHAIN (decl); |
1ad8aeeb | 4306 | } |
5c24fba6 MM |
4307 | } |
4308 | else | |
ec386958 | 4309 | { |
17bbb839 | 4310 | tree eoc; |
7ba539c6 | 4311 | bool atend; |
ec386958 MM |
4312 | |
4313 | /* On some platforms (ARM), even empty classes will not be | |
4314 | byte-aligned. */ | |
db3927fb AH |
4315 | eoc = round_up_loc (input_location, |
4316 | rli_size_unit_so_far (rli), | |
17bbb839 | 4317 | CLASSTYPE_ALIGN_UNIT (basetype)); |
d9d9dbc0 | 4318 | atend = layout_empty_base (rli, binfo, eoc, offsets); |
7ba539c6 MM |
4319 | /* A nearly-empty class "has no proper base class that is empty, |
4320 | not morally virtual, and at an offset other than zero." */ | |
809e3e7f | 4321 | if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t)) |
7ba539c6 MM |
4322 | { |
4323 | if (atend) | |
4324 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
c5a35c3c | 4325 | /* The check above (used in G++ 3.2) is insufficient because |
7ba539c6 | 4326 | an empty class placed at offset zero might itself have an |
90024bdc | 4327 | empty base at a nonzero offset. */ |
c8094d83 | 4328 | else if (walk_subobject_offsets (basetype, |
7ba539c6 MM |
4329 | empty_base_at_nonzero_offset_p, |
4330 | size_zero_node, | |
4331 | /*offsets=*/NULL, | |
4332 | /*max_offset=*/NULL_TREE, | |
4333 | /*vbases_p=*/true)) | |
90d84934 | 4334 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; |
7ba539c6 | 4335 | } |
c8094d83 | 4336 | |
17bbb839 MM |
4337 | /* We do not create a FIELD_DECL for empty base classes because |
4338 | it might overlap some other field. We want to be able to | |
4339 | create CONSTRUCTORs for the class by iterating over the | |
4340 | FIELD_DECLs, and the back end does not handle overlapping | |
4341 | FIELD_DECLs. */ | |
58731fd1 MM |
4342 | |
4343 | /* An empty virtual base causes a class to be non-empty | |
4344 | -- but in that case we do not need to clear CLASSTYPE_EMPTY_P | |
4345 | here because that was already done when the virtual table | |
4346 | pointer was created. */ | |
ec386958 | 4347 | } |
5c24fba6 | 4348 | |
5c24fba6 | 4349 | /* Record the offsets of BINFO and its base subobjects. */ |
ff944b49 | 4350 | record_subobject_offsets (binfo, |
c20118a8 | 4351 | BINFO_OFFSET (binfo), |
c8094d83 | 4352 | offsets, |
c5a35c3c | 4353 | /*is_data_member=*/false); |
17bbb839 MM |
4354 | |
4355 | return next_field; | |
d77249e7 MM |
4356 | } |
4357 | ||
c20118a8 | 4358 | /* Layout all of the non-virtual base classes. Record empty |
17bbb839 MM |
4359 | subobjects in OFFSETS. T is the most derived type. Return nonzero |
4360 | if the type cannot be nearly empty. The fields created | |
4361 | corresponding to the base classes will be inserted at | |
4362 | *NEXT_FIELD. */ | |
607cf131 | 4363 | |
17bbb839 | 4364 | static void |
58731fd1 | 4365 | build_base_fields (record_layout_info rli, |
17bbb839 | 4366 | splay_tree offsets, tree *next_field) |
607cf131 MM |
4367 | { |
4368 | /* Chain to hold all the new FIELD_DECLs which stand in for base class | |
4369 | subobjects. */ | |
17bbb839 | 4370 | tree t = rli->t; |
604a3205 | 4371 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
5c24fba6 | 4372 | int i; |
607cf131 | 4373 | |
3461fba7 | 4374 | /* The primary base class is always allocated first. */ |
17bbb839 MM |
4375 | if (CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
4376 | next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t), | |
58731fd1 | 4377 | offsets, next_field); |
d77249e7 MM |
4378 | |
4379 | /* Now allocate the rest of the bases. */ | |
607cf131 MM |
4380 | for (i = 0; i < n_baseclasses; ++i) |
4381 | { | |
d77249e7 | 4382 | tree base_binfo; |
607cf131 | 4383 | |
604a3205 | 4384 | base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i); |
911a71a7 | 4385 | |
3461fba7 NS |
4386 | /* The primary base was already allocated above, so we don't |
4387 | need to allocate it again here. */ | |
17bbb839 | 4388 | if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t)) |
607cf131 MM |
4389 | continue; |
4390 | ||
dbbf88d1 NS |
4391 | /* Virtual bases are added at the end (a primary virtual base |
4392 | will have already been added). */ | |
809e3e7f | 4393 | if (BINFO_VIRTUAL_P (base_binfo)) |
607cf131 MM |
4394 | continue; |
4395 | ||
58731fd1 | 4396 | next_field = build_base_field (rli, base_binfo, |
17bbb839 | 4397 | offsets, next_field); |
607cf131 | 4398 | } |
607cf131 MM |
4399 | } |
4400 | ||
58010b57 MM |
4401 | /* Go through the TYPE_METHODS of T issuing any appropriate |
4402 | diagnostics, figuring out which methods override which other | |
3ef397c1 | 4403 | methods, and so forth. */ |
58010b57 MM |
4404 | |
4405 | static void | |
94edc4ab | 4406 | check_methods (tree t) |
58010b57 MM |
4407 | { |
4408 | tree x; | |
58010b57 | 4409 | |
910ad8de | 4410 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
58010b57 | 4411 | { |
58010b57 | 4412 | check_for_override (x, t); |
aaf8a23e | 4413 | if (DECL_PURE_VIRTUAL_P (x) && (TREE_CODE (x) != FUNCTION_DECL || ! DECL_VINDEX (x))) |
dee15844 | 4414 | error ("initializer specified for non-virtual method %q+D", x); |
58010b57 MM |
4415 | /* The name of the field is the original field name |
4416 | Save this in auxiliary field for later overloading. */ | |
aaf8a23e | 4417 | if (TREE_CODE (x) == FUNCTION_DECL && DECL_VINDEX (x)) |
58010b57 | 4418 | { |
3ef397c1 | 4419 | TYPE_POLYMORPHIC_P (t) = 1; |
fee7654e | 4420 | if (DECL_PURE_VIRTUAL_P (x)) |
9771b263 | 4421 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x); |
58010b57 | 4422 | } |
46408846 JM |
4423 | /* All user-provided destructors are non-trivial. |
4424 | Constructors and assignment ops are handled in | |
4425 | grok_special_member_properties. */ | |
20f2653e | 4426 | if (DECL_DESTRUCTOR_P (x) && user_provided_p (x)) |
9f4faeae | 4427 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1; |
58010b57 | 4428 | } |
58010b57 MM |
4429 | } |
4430 | ||
db9b2174 MM |
4431 | /* FN is a constructor or destructor. Clone the declaration to create |
4432 | a specialized in-charge or not-in-charge version, as indicated by | |
4433 | NAME. */ | |
4434 | ||
4435 | static tree | |
94edc4ab | 4436 | build_clone (tree fn, tree name) |
db9b2174 MM |
4437 | { |
4438 | tree parms; | |
4439 | tree clone; | |
4440 | ||
4441 | /* Copy the function. */ | |
4442 | clone = copy_decl (fn); | |
db9b2174 MM |
4443 | /* Reset the function name. */ |
4444 | DECL_NAME (clone) = name; | |
b97e8a14 JM |
4445 | /* Remember where this function came from. */ |
4446 | DECL_ABSTRACT_ORIGIN (clone) = fn; | |
4447 | /* Make it easy to find the CLONE given the FN. */ | |
910ad8de NF |
4448 | DECL_CHAIN (clone) = DECL_CHAIN (fn); |
4449 | DECL_CHAIN (fn) = clone; | |
b97e8a14 JM |
4450 | |
4451 | /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */ | |
4452 | if (TREE_CODE (clone) == TEMPLATE_DECL) | |
4453 | { | |
4454 | tree result = build_clone (DECL_TEMPLATE_RESULT (clone), name); | |
4455 | DECL_TEMPLATE_RESULT (clone) = result; | |
4456 | DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result)); | |
4457 | DECL_TI_TEMPLATE (result) = clone; | |
4458 | TREE_TYPE (clone) = TREE_TYPE (result); | |
4459 | return clone; | |
4460 | } | |
4461 | ||
ad115a3c | 4462 | SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE); |
b97e8a14 | 4463 | DECL_CLONED_FUNCTION (clone) = fn; |
db9b2174 MM |
4464 | /* There's no pending inline data for this function. */ |
4465 | DECL_PENDING_INLINE_INFO (clone) = NULL; | |
4466 | DECL_PENDING_INLINE_P (clone) = 0; | |
db9b2174 | 4467 | |
298d6f60 MM |
4468 | /* The base-class destructor is not virtual. */ |
4469 | if (name == base_dtor_identifier) | |
4470 | { | |
4471 | DECL_VIRTUAL_P (clone) = 0; | |
4472 | if (TREE_CODE (clone) != TEMPLATE_DECL) | |
4473 | DECL_VINDEX (clone) = NULL_TREE; | |
4474 | } | |
4475 | ||
4e7512c9 | 4476 | /* If there was an in-charge parameter, drop it from the function |
db9b2174 MM |
4477 | type. */ |
4478 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4479 | { | |
4480 | tree basetype; | |
4481 | tree parmtypes; | |
4482 | tree exceptions; | |
4483 | ||
4484 | exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); | |
4485 | basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); | |
4486 | parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4487 | /* Skip the `this' parameter. */ | |
4488 | parmtypes = TREE_CHAIN (parmtypes); | |
4489 | /* Skip the in-charge parameter. */ | |
4490 | parmtypes = TREE_CHAIN (parmtypes); | |
e0fff4b3 JM |
4491 | /* And the VTT parm, in a complete [cd]tor. */ |
4492 | if (DECL_HAS_VTT_PARM_P (fn) | |
4493 | && ! DECL_NEEDS_VTT_PARM_P (clone)) | |
4494 | parmtypes = TREE_CHAIN (parmtypes); | |
3ec6bad3 MM |
4495 | /* If this is subobject constructor or destructor, add the vtt |
4496 | parameter. */ | |
c8094d83 | 4497 | TREE_TYPE (clone) |
43dc123f MM |
4498 | = build_method_type_directly (basetype, |
4499 | TREE_TYPE (TREE_TYPE (clone)), | |
4500 | parmtypes); | |
db9b2174 MM |
4501 | if (exceptions) |
4502 | TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone), | |
4503 | exceptions); | |
c8094d83 | 4504 | TREE_TYPE (clone) |
e9525111 MM |
4505 | = cp_build_type_attribute_variant (TREE_TYPE (clone), |
4506 | TYPE_ATTRIBUTES (TREE_TYPE (fn))); | |
db9b2174 MM |
4507 | } |
4508 | ||
b97e8a14 JM |
4509 | /* Copy the function parameters. */ |
4510 | DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone)); | |
4511 | /* Remove the in-charge parameter. */ | |
4512 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4513 | { | |
910ad8de NF |
4514 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4515 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 JM |
4516 | DECL_HAS_IN_CHARGE_PARM_P (clone) = 0; |
4517 | } | |
4518 | /* And the VTT parm, in a complete [cd]tor. */ | |
4519 | if (DECL_HAS_VTT_PARM_P (fn)) | |
db9b2174 | 4520 | { |
b97e8a14 JM |
4521 | if (DECL_NEEDS_VTT_PARM_P (clone)) |
4522 | DECL_HAS_VTT_PARM_P (clone) = 1; | |
4523 | else | |
db9b2174 | 4524 | { |
910ad8de NF |
4525 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4526 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 | 4527 | DECL_HAS_VTT_PARM_P (clone) = 0; |
3ec6bad3 | 4528 | } |
b97e8a14 | 4529 | } |
3ec6bad3 | 4530 | |
910ad8de | 4531 | for (parms = DECL_ARGUMENTS (clone); parms; parms = DECL_CHAIN (parms)) |
b97e8a14 JM |
4532 | { |
4533 | DECL_CONTEXT (parms) = clone; | |
4534 | cxx_dup_lang_specific_decl (parms); | |
db9b2174 MM |
4535 | } |
4536 | ||
db9b2174 | 4537 | /* Create the RTL for this function. */ |
245763e3 | 4538 | SET_DECL_RTL (clone, NULL); |
0e6df31e | 4539 | rest_of_decl_compilation (clone, /*top_level=*/1, at_eof); |
c8094d83 | 4540 | |
b97e8a14 JM |
4541 | if (pch_file) |
4542 | note_decl_for_pch (clone); | |
db9b2174 | 4543 | |
b97e8a14 JM |
4544 | return clone; |
4545 | } | |
db9b2174 | 4546 | |
b97e8a14 JM |
4547 | /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do |
4548 | not invoke this function directly. | |
4549 | ||
4550 | For a non-thunk function, returns the address of the slot for storing | |
4551 | the function it is a clone of. Otherwise returns NULL_TREE. | |
4552 | ||
4553 | If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if | |
4554 | cloned_function is unset. This is to support the separate | |
4555 | DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter | |
4556 | on a template makes sense, but not the former. */ | |
4557 | ||
4558 | tree * | |
4559 | decl_cloned_function_p (const_tree decl, bool just_testing) | |
4560 | { | |
4561 | tree *ptr; | |
4562 | if (just_testing) | |
4563 | decl = STRIP_TEMPLATE (decl); | |
4564 | ||
4565 | if (TREE_CODE (decl) != FUNCTION_DECL | |
4566 | || !DECL_LANG_SPECIFIC (decl) | |
4567 | || DECL_LANG_SPECIFIC (decl)->u.fn.thunk_p) | |
4568 | { | |
4569 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
4570 | if (!just_testing) | |
4571 | lang_check_failed (__FILE__, __LINE__, __FUNCTION__); | |
4572 | else | |
4573 | #endif | |
4574 | return NULL; | |
db9b2174 MM |
4575 | } |
4576 | ||
b97e8a14 JM |
4577 | ptr = &DECL_LANG_SPECIFIC (decl)->u.fn.u5.cloned_function; |
4578 | if (just_testing && *ptr == NULL_TREE) | |
4579 | return NULL; | |
4580 | else | |
4581 | return ptr; | |
db9b2174 MM |
4582 | } |
4583 | ||
4584 | /* Produce declarations for all appropriate clones of FN. If | |
838dfd8a | 4585 | UPDATE_METHOD_VEC_P is nonzero, the clones are added to the |
db9b2174 MM |
4586 | CLASTYPE_METHOD_VEC as well. */ |
4587 | ||
4588 | void | |
94edc4ab | 4589 | clone_function_decl (tree fn, int update_method_vec_p) |
db9b2174 MM |
4590 | { |
4591 | tree clone; | |
4592 | ||
c00996a3 | 4593 | /* Avoid inappropriate cloning. */ |
910ad8de NF |
4594 | if (DECL_CHAIN (fn) |
4595 | && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn))) | |
c00996a3 JM |
4596 | return; |
4597 | ||
298d6f60 | 4598 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) |
db9b2174 | 4599 | { |
298d6f60 MM |
4600 | /* For each constructor, we need two variants: an in-charge version |
4601 | and a not-in-charge version. */ | |
db9b2174 MM |
4602 | clone = build_clone (fn, complete_ctor_identifier); |
4603 | if (update_method_vec_p) | |
b2a9b208 | 4604 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4605 | clone = build_clone (fn, base_ctor_identifier); |
4606 | if (update_method_vec_p) | |
b2a9b208 | 4607 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4608 | } |
4609 | else | |
298d6f60 | 4610 | { |
50bc768d | 4611 | gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)); |
298d6f60 | 4612 | |
3ec6bad3 | 4613 | /* For each destructor, we need three variants: an in-charge |
298d6f60 | 4614 | version, a not-in-charge version, and an in-charge deleting |
4e7512c9 MM |
4615 | version. We clone the deleting version first because that |
4616 | means it will go second on the TYPE_METHODS list -- and that | |
4617 | corresponds to the correct layout order in the virtual | |
c8094d83 | 4618 | function table. |
52682a1b | 4619 | |
0cbd7506 | 4620 | For a non-virtual destructor, we do not build a deleting |
52682a1b MM |
4621 | destructor. */ |
4622 | if (DECL_VIRTUAL_P (fn)) | |
4623 | { | |
4624 | clone = build_clone (fn, deleting_dtor_identifier); | |
4625 | if (update_method_vec_p) | |
b2a9b208 | 4626 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
52682a1b | 4627 | } |
4e7512c9 | 4628 | clone = build_clone (fn, complete_dtor_identifier); |
298d6f60 | 4629 | if (update_method_vec_p) |
b2a9b208 | 4630 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 MM |
4631 | clone = build_clone (fn, base_dtor_identifier); |
4632 | if (update_method_vec_p) | |
b2a9b208 | 4633 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 | 4634 | } |
5daf7c0a JM |
4635 | |
4636 | /* Note that this is an abstract function that is never emitted. */ | |
00de328a | 4637 | DECL_ABSTRACT_P (fn) = true; |
db9b2174 MM |
4638 | } |
4639 | ||
5f6eeeb3 NS |
4640 | /* DECL is an in charge constructor, which is being defined. This will |
4641 | have had an in class declaration, from whence clones were | |
4642 | declared. An out-of-class definition can specify additional default | |
4643 | arguments. As it is the clones that are involved in overload | |
4644 | resolution, we must propagate the information from the DECL to its | |
00a17e31 | 4645 | clones. */ |
5f6eeeb3 NS |
4646 | |
4647 | void | |
94edc4ab | 4648 | adjust_clone_args (tree decl) |
5f6eeeb3 NS |
4649 | { |
4650 | tree clone; | |
c8094d83 | 4651 | |
910ad8de NF |
4652 | for (clone = DECL_CHAIN (decl); clone && DECL_CLONED_FUNCTION_P (clone); |
4653 | clone = DECL_CHAIN (clone)) | |
5f6eeeb3 NS |
4654 | { |
4655 | tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4656 | tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
4657 | tree decl_parms, clone_parms; | |
4658 | ||
4659 | clone_parms = orig_clone_parms; | |
c8094d83 | 4660 | |
00a17e31 | 4661 | /* Skip the 'this' parameter. */ |
5f6eeeb3 NS |
4662 | orig_clone_parms = TREE_CHAIN (orig_clone_parms); |
4663 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4664 | ||
4665 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) | |
4666 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4667 | if (DECL_HAS_VTT_PARM_P (decl)) | |
4668 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
c8094d83 | 4669 | |
5f6eeeb3 NS |
4670 | clone_parms = orig_clone_parms; |
4671 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4672 | clone_parms = TREE_CHAIN (clone_parms); | |
c8094d83 | 4673 | |
5f6eeeb3 NS |
4674 | for (decl_parms = orig_decl_parms; decl_parms; |
4675 | decl_parms = TREE_CHAIN (decl_parms), | |
4676 | clone_parms = TREE_CHAIN (clone_parms)) | |
4677 | { | |
50bc768d NS |
4678 | gcc_assert (same_type_p (TREE_TYPE (decl_parms), |
4679 | TREE_TYPE (clone_parms))); | |
c8094d83 | 4680 | |
5f6eeeb3 NS |
4681 | if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms)) |
4682 | { | |
4683 | /* A default parameter has been added. Adjust the | |
00a17e31 | 4684 | clone's parameters. */ |
5f6eeeb3 | 4685 | tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); |
3c3905fc | 4686 | tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (clone)); |
5f6eeeb3 NS |
4687 | tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); |
4688 | tree type; | |
4689 | ||
4690 | clone_parms = orig_decl_parms; | |
4691 | ||
4692 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4693 | { | |
4694 | clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms), | |
4695 | TREE_VALUE (orig_clone_parms), | |
4696 | clone_parms); | |
4697 | TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms); | |
4698 | } | |
43dc123f MM |
4699 | type = build_method_type_directly (basetype, |
4700 | TREE_TYPE (TREE_TYPE (clone)), | |
4701 | clone_parms); | |
5f6eeeb3 NS |
4702 | if (exceptions) |
4703 | type = build_exception_variant (type, exceptions); | |
3c3905fc JM |
4704 | if (attrs) |
4705 | type = cp_build_type_attribute_variant (type, attrs); | |
5f6eeeb3 | 4706 | TREE_TYPE (clone) = type; |
c8094d83 | 4707 | |
5f6eeeb3 NS |
4708 | clone_parms = NULL_TREE; |
4709 | break; | |
4710 | } | |
4711 | } | |
50bc768d | 4712 | gcc_assert (!clone_parms); |
5f6eeeb3 NS |
4713 | } |
4714 | } | |
4715 | ||
db9b2174 MM |
4716 | /* For each of the constructors and destructors in T, create an |
4717 | in-charge and not-in-charge variant. */ | |
4718 | ||
4719 | static void | |
94edc4ab | 4720 | clone_constructors_and_destructors (tree t) |
db9b2174 MM |
4721 | { |
4722 | tree fns; | |
4723 | ||
db9b2174 MM |
4724 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail |
4725 | out now. */ | |
4726 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4727 | return; | |
4728 | ||
db9b2174 MM |
4729 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4730 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
298d6f60 MM |
4731 | for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4732 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
db9b2174 MM |
4733 | } |
4734 | ||
593a0835 PC |
4735 | /* Deduce noexcept for a destructor DTOR. */ |
4736 | ||
4737 | void | |
4738 | deduce_noexcept_on_destructor (tree dtor) | |
4739 | { | |
4740 | if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor))) | |
4741 | { | |
b15ea309 | 4742 | tree eh_spec = unevaluated_noexcept_spec (); |
593a0835 PC |
4743 | TREE_TYPE (dtor) = build_exception_variant (TREE_TYPE (dtor), eh_spec); |
4744 | } | |
4745 | } | |
4746 | ||
4747 | /* For each destructor in T, deduce noexcept: | |
4748 | ||
4749 | 12.4/3: A declaration of a destructor that does not have an | |
4750 | exception-specification is implicitly considered to have the | |
4751 | same exception-specification as an implicit declaration (15.4). */ | |
4752 | ||
4753 | static void | |
4754 | deduce_noexcept_on_destructors (tree t) | |
4755 | { | |
593a0835 PC |
4756 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail |
4757 | out now. */ | |
4758 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4759 | return; | |
4760 | ||
a5e90b2a | 4761 | for (tree fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
593a0835 PC |
4762 | deduce_noexcept_on_destructor (OVL_CURRENT (fns)); |
4763 | } | |
4764 | ||
0a35513e AH |
4765 | /* Subroutine of set_one_vmethod_tm_attributes. Search base classes |
4766 | of TYPE for virtual functions which FNDECL overrides. Return a | |
4767 | mask of the tm attributes found therein. */ | |
4768 | ||
4769 | static int | |
4770 | look_for_tm_attr_overrides (tree type, tree fndecl) | |
4771 | { | |
4772 | tree binfo = TYPE_BINFO (type); | |
4773 | tree base_binfo; | |
4774 | int ix, found = 0; | |
4775 | ||
4776 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ++ix) | |
4777 | { | |
4778 | tree o, basetype = BINFO_TYPE (base_binfo); | |
4779 | ||
4780 | if (!TYPE_POLYMORPHIC_P (basetype)) | |
4781 | continue; | |
4782 | ||
4783 | o = look_for_overrides_here (basetype, fndecl); | |
4784 | if (o) | |
4785 | found |= tm_attr_to_mask (find_tm_attribute | |
4786 | (TYPE_ATTRIBUTES (TREE_TYPE (o)))); | |
4787 | else | |
4788 | found |= look_for_tm_attr_overrides (basetype, fndecl); | |
4789 | } | |
4790 | ||
4791 | return found; | |
4792 | } | |
4793 | ||
4794 | /* Subroutine of set_method_tm_attributes. Handle the checks and | |
4795 | inheritance for one virtual method FNDECL. */ | |
4796 | ||
4797 | static void | |
4798 | set_one_vmethod_tm_attributes (tree type, tree fndecl) | |
4799 | { | |
4800 | tree tm_attr; | |
4801 | int found, have; | |
4802 | ||
4803 | found = look_for_tm_attr_overrides (type, fndecl); | |
4804 | ||
4805 | /* If FNDECL doesn't actually override anything (i.e. T is the | |
4806 | class that first declares FNDECL virtual), then we're done. */ | |
4807 | if (found == 0) | |
4808 | return; | |
4809 | ||
4810 | tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl))); | |
4811 | have = tm_attr_to_mask (tm_attr); | |
4812 | ||
4813 | /* Intel STM Language Extension 3.0, Section 4.2 table 4: | |
4814 | tm_pure must match exactly, otherwise no weakening of | |
4815 | tm_safe > tm_callable > nothing. */ | |
4816 | /* ??? The tm_pure attribute didn't make the transition to the | |
4817 | multivendor language spec. */ | |
4818 | if (have == TM_ATTR_PURE) | |
4819 | { | |
4820 | if (found != TM_ATTR_PURE) | |
4821 | { | |
4822 | found &= -found; | |
4823 | goto err_override; | |
4824 | } | |
4825 | } | |
4826 | /* If the overridden function is tm_pure, then FNDECL must be. */ | |
4827 | else if (found == TM_ATTR_PURE && tm_attr) | |
4828 | goto err_override; | |
4829 | /* Look for base class combinations that cannot be satisfied. */ | |
4830 | else if (found != TM_ATTR_PURE && (found & TM_ATTR_PURE)) | |
4831 | { | |
4832 | found &= ~TM_ATTR_PURE; | |
4833 | found &= -found; | |
4834 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4835 | "method overrides both %<transaction_pure%> and %qE methods", | |
4836 | tm_mask_to_attr (found)); | |
4837 | } | |
4838 | /* If FNDECL did not declare an attribute, then inherit the most | |
4839 | restrictive one. */ | |
4840 | else if (tm_attr == NULL) | |
4841 | { | |
4842 | apply_tm_attr (fndecl, tm_mask_to_attr (found & -found)); | |
4843 | } | |
4844 | /* Otherwise validate that we're not weaker than a function | |
4845 | that is being overridden. */ | |
4846 | else | |
4847 | { | |
4848 | found &= -found; | |
4849 | if (found <= TM_ATTR_CALLABLE && have > found) | |
4850 | goto err_override; | |
4851 | } | |
4852 | return; | |
4853 | ||
4854 | err_override: | |
4855 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4856 | "method declared %qE overriding %qE method", | |
4857 | tm_attr, tm_mask_to_attr (found)); | |
4858 | } | |
4859 | ||
4860 | /* For each of the methods in T, propagate a class-level tm attribute. */ | |
4861 | ||
4862 | static void | |
4863 | set_method_tm_attributes (tree t) | |
4864 | { | |
4865 | tree class_tm_attr, fndecl; | |
4866 | ||
4867 | /* Don't bother collecting tm attributes if transactional memory | |
4868 | support is not enabled. */ | |
4869 | if (!flag_tm) | |
4870 | return; | |
4871 | ||
4872 | /* Process virtual methods first, as they inherit directly from the | |
4873 | base virtual function and also require validation of new attributes. */ | |
4874 | if (TYPE_CONTAINS_VPTR_P (t)) | |
4875 | { | |
4876 | tree vchain; | |
4877 | for (vchain = BINFO_VIRTUALS (TYPE_BINFO (t)); vchain; | |
4878 | vchain = TREE_CHAIN (vchain)) | |
00a42fb3 AH |
4879 | { |
4880 | fndecl = BV_FN (vchain); | |
4881 | if (DECL_THUNK_P (fndecl)) | |
4882 | fndecl = THUNK_TARGET (fndecl); | |
4883 | set_one_vmethod_tm_attributes (t, fndecl); | |
4884 | } | |
0a35513e AH |
4885 | } |
4886 | ||
4887 | /* If the class doesn't have an attribute, nothing more to do. */ | |
4888 | class_tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (t)); | |
4889 | if (class_tm_attr == NULL) | |
4890 | return; | |
4891 | ||
4892 | /* Any method that does not yet have a tm attribute inherits | |
4893 | the one from the class. */ | |
4894 | for (fndecl = TYPE_METHODS (t); fndecl; fndecl = TREE_CHAIN (fndecl)) | |
4895 | { | |
4896 | if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl)))) | |
4897 | apply_tm_attr (fndecl, class_tm_attr); | |
4898 | } | |
4899 | } | |
4900 | ||
8c95264b MLI |
4901 | /* Returns true iff class T has a user-defined constructor other than |
4902 | the default constructor. */ | |
4903 | ||
4904 | bool | |
4905 | type_has_user_nondefault_constructor (tree t) | |
4906 | { | |
4907 | tree fns; | |
4908 | ||
4909 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4910 | return false; | |
4911 | ||
4912 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4913 | { | |
4914 | tree fn = OVL_CURRENT (fns); | |
4915 | if (!DECL_ARTIFICIAL (fn) | |
c2b58ba2 JM |
4916 | && (TREE_CODE (fn) == TEMPLATE_DECL |
4917 | || (skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn)) | |
4918 | != NULL_TREE))) | |
8c95264b MLI |
4919 | return true; |
4920 | } | |
4921 | ||
4922 | return false; | |
4923 | } | |
4924 | ||
6ad86a5b FC |
4925 | /* Returns the defaulted constructor if T has one. Otherwise, returns |
4926 | NULL_TREE. */ | |
4927 | ||
4928 | tree | |
4929 | in_class_defaulted_default_constructor (tree t) | |
4930 | { | |
4931 | tree fns, args; | |
4932 | ||
4933 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4934 | return NULL_TREE; | |
4935 | ||
4936 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4937 | { | |
4938 | tree fn = OVL_CURRENT (fns); | |
4939 | ||
4940 | if (DECL_DEFAULTED_IN_CLASS_P (fn)) | |
4941 | { | |
4942 | args = FUNCTION_FIRST_USER_PARMTYPE (fn); | |
4943 | while (args && TREE_PURPOSE (args)) | |
4944 | args = TREE_CHAIN (args); | |
4945 | if (!args || args == void_list_node) | |
4946 | return fn; | |
4947 | } | |
4948 | } | |
4949 | ||
4950 | return NULL_TREE; | |
4951 | } | |
4952 | ||
b87d79e6 | 4953 | /* Returns true iff FN is a user-provided function, i.e. user-declared |
20f2653e JM |
4954 | and not defaulted at its first declaration; or explicit, private, |
4955 | protected, or non-const. */ | |
b87d79e6 | 4956 | |
20f2653e | 4957 | bool |
b87d79e6 JM |
4958 | user_provided_p (tree fn) |
4959 | { | |
4960 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
4961 | return true; | |
4962 | else | |
4963 | return (!DECL_ARTIFICIAL (fn) | |
eca7fc57 JM |
4964 | && !(DECL_INITIALIZED_IN_CLASS_P (fn) |
4965 | && (DECL_DEFAULTED_FN (fn) || DECL_DELETED_FN (fn)))); | |
b87d79e6 JM |
4966 | } |
4967 | ||
4968 | /* Returns true iff class T has a user-provided constructor. */ | |
4969 | ||
4970 | bool | |
4971 | type_has_user_provided_constructor (tree t) | |
4972 | { | |
4973 | tree fns; | |
4974 | ||
fd97a96a JM |
4975 | if (!CLASS_TYPE_P (t)) |
4976 | return false; | |
4977 | ||
b87d79e6 JM |
4978 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) |
4979 | return false; | |
4980 | ||
4981 | /* This can happen in error cases; avoid crashing. */ | |
4982 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4983 | return false; | |
4984 | ||
4985 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4986 | if (user_provided_p (OVL_CURRENT (fns))) | |
4987 | return true; | |
4988 | ||
4989 | return false; | |
4990 | } | |
4991 | ||
a710f1f8 JM |
4992 | /* Returns true iff class T has a non-user-provided (i.e. implicitly |
4993 | declared or explicitly defaulted in the class body) default | |
4994 | constructor. */ | |
b87d79e6 JM |
4995 | |
4996 | bool | |
a710f1f8 | 4997 | type_has_non_user_provided_default_constructor (tree t) |
b87d79e6 | 4998 | { |
71b8cb01 | 4999 | tree fns; |
b87d79e6 | 5000 | |
a710f1f8 | 5001 | if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (t)) |
b87d79e6 | 5002 | return false; |
a710f1f8 JM |
5003 | if (CLASSTYPE_LAZY_DEFAULT_CTOR (t)) |
5004 | return true; | |
b87d79e6 JM |
5005 | |
5006 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5007 | { | |
5008 | tree fn = OVL_CURRENT (fns); | |
7ad8d488 | 5009 | if (TREE_CODE (fn) == FUNCTION_DECL |
a710f1f8 | 5010 | && !user_provided_p (fn) |
71b8cb01 JM |
5011 | && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn))) |
5012 | return true; | |
b87d79e6 JM |
5013 | } |
5014 | ||
5015 | return false; | |
5016 | } | |
5017 | ||
32bfcf80 JM |
5018 | /* TYPE is being used as a virtual base, and has a non-trivial move |
5019 | assignment. Return true if this is due to there being a user-provided | |
5020 | move assignment in TYPE or one of its subobjects; if there isn't, then | |
5021 | multiple move assignment can't cause any harm. */ | |
5022 | ||
5023 | bool | |
5024 | vbase_has_user_provided_move_assign (tree type) | |
5025 | { | |
5026 | /* Does the type itself have a user-provided move assignment operator? */ | |
5027 | for (tree fns | |
5028 | = lookup_fnfields_slot_nolazy (type, ansi_assopname (NOP_EXPR)); | |
5029 | fns; fns = OVL_NEXT (fns)) | |
5030 | { | |
5031 | tree fn = OVL_CURRENT (fns); | |
5032 | if (move_fn_p (fn) && user_provided_p (fn)) | |
5033 | return true; | |
5034 | } | |
5035 | ||
5036 | /* Do any of its bases? */ | |
5037 | tree binfo = TYPE_BINFO (type); | |
5038 | tree base_binfo; | |
5039 | for (int i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
5040 | if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo))) | |
5041 | return true; | |
5042 | ||
5043 | /* Or non-static data members? */ | |
5044 | for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
5045 | { | |
5046 | if (TREE_CODE (field) == FIELD_DECL | |
5047 | && CLASS_TYPE_P (TREE_TYPE (field)) | |
5048 | && vbase_has_user_provided_move_assign (TREE_TYPE (field))) | |
5049 | return true; | |
5050 | } | |
5051 | ||
5052 | /* Seems not. */ | |
5053 | return false; | |
5054 | } | |
5055 | ||
6132bdd7 JM |
5056 | /* If default-initialization leaves part of TYPE uninitialized, returns |
5057 | a DECL for the field or TYPE itself (DR 253). */ | |
5058 | ||
5059 | tree | |
5060 | default_init_uninitialized_part (tree type) | |
5061 | { | |
5062 | tree t, r, binfo; | |
5063 | int i; | |
5064 | ||
5065 | type = strip_array_types (type); | |
5066 | if (!CLASS_TYPE_P (type)) | |
5067 | return type; | |
a710f1f8 | 5068 | if (!type_has_non_user_provided_default_constructor (type)) |
6132bdd7 JM |
5069 | return NULL_TREE; |
5070 | for (binfo = TYPE_BINFO (type), i = 0; | |
5071 | BINFO_BASE_ITERATE (binfo, i, t); ++i) | |
5072 | { | |
5073 | r = default_init_uninitialized_part (BINFO_TYPE (t)); | |
5074 | if (r) | |
5075 | return r; | |
5076 | } | |
5077 | for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t)) | |
5078 | if (TREE_CODE (t) == FIELD_DECL | |
5079 | && !DECL_ARTIFICIAL (t) | |
5080 | && !DECL_INITIAL (t)) | |
5081 | { | |
5082 | r = default_init_uninitialized_part (TREE_TYPE (t)); | |
5083 | if (r) | |
5084 | return DECL_P (r) ? r : t; | |
5085 | } | |
5086 | ||
5087 | return NULL_TREE; | |
5088 | } | |
5089 | ||
fd3faf2b | 5090 | /* Returns true iff for class T, a trivial synthesized default constructor |
0930cc0e JM |
5091 | would be constexpr. */ |
5092 | ||
5093 | bool | |
fd3faf2b | 5094 | trivial_default_constructor_is_constexpr (tree t) |
0930cc0e | 5095 | { |
fd3faf2b | 5096 | /* A defaulted trivial default constructor is constexpr |
0930cc0e | 5097 | if there is nothing to initialize. */ |
fd3faf2b | 5098 | gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t)); |
0930cc0e JM |
5099 | return is_really_empty_class (t); |
5100 | } | |
5101 | ||
91ea6df3 GDR |
5102 | /* Returns true iff class T has a constexpr default constructor. */ |
5103 | ||
5104 | bool | |
5105 | type_has_constexpr_default_constructor (tree t) | |
5106 | { | |
5107 | tree fns; | |
5108 | ||
5109 | if (!CLASS_TYPE_P (t)) | |
69f36ba6 JM |
5110 | { |
5111 | /* The caller should have stripped an enclosing array. */ | |
5112 | gcc_assert (TREE_CODE (t) != ARRAY_TYPE); | |
5113 | return false; | |
5114 | } | |
0930cc0e | 5115 | if (CLASSTYPE_LAZY_DEFAULT_CTOR (t)) |
fd3faf2b JM |
5116 | { |
5117 | if (!TYPE_HAS_COMPLEX_DFLT (t)) | |
5118 | return trivial_default_constructor_is_constexpr (t); | |
5119 | /* Non-trivial, we need to check subobject constructors. */ | |
5120 | lazily_declare_fn (sfk_constructor, t); | |
5121 | } | |
f7d042e2 | 5122 | fns = locate_ctor (t); |
91ea6df3 GDR |
5123 | return (fns && DECL_DECLARED_CONSTEXPR_P (fns)); |
5124 | } | |
5125 | ||
46408846 JM |
5126 | /* Returns true iff class TYPE has a virtual destructor. */ |
5127 | ||
5128 | bool | |
5129 | type_has_virtual_destructor (tree type) | |
5130 | { | |
5131 | tree dtor; | |
5132 | ||
5133 | if (!CLASS_TYPE_P (type)) | |
5134 | return false; | |
5135 | ||
5136 | gcc_assert (COMPLETE_TYPE_P (type)); | |
5137 | dtor = CLASSTYPE_DESTRUCTORS (type); | |
5138 | return (dtor && DECL_VIRTUAL_P (dtor)); | |
5139 | } | |
5140 | ||
ac177431 JM |
5141 | /* Returns true iff class T has a move constructor. */ |
5142 | ||
5143 | bool | |
5144 | type_has_move_constructor (tree t) | |
5145 | { | |
5146 | tree fns; | |
5147 | ||
5148 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
5149 | { | |
5150 | gcc_assert (COMPLETE_TYPE_P (t)); | |
5151 | lazily_declare_fn (sfk_move_constructor, t); | |
5152 | } | |
5153 | ||
5154 | if (!CLASSTYPE_METHOD_VEC (t)) | |
5155 | return false; | |
5156 | ||
5157 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5158 | if (move_fn_p (OVL_CURRENT (fns))) | |
5159 | return true; | |
5160 | ||
5161 | return false; | |
5162 | } | |
5163 | ||
5164 | /* Returns true iff class T has a move assignment operator. */ | |
5165 | ||
5166 | bool | |
5167 | type_has_move_assign (tree t) | |
5168 | { | |
5169 | tree fns; | |
5170 | ||
5171 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
5172 | { | |
5173 | gcc_assert (COMPLETE_TYPE_P (t)); | |
5174 | lazily_declare_fn (sfk_move_assignment, t); | |
5175 | } | |
5176 | ||
fa4ba4af | 5177 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
ac177431 JM |
5178 | fns; fns = OVL_NEXT (fns)) |
5179 | if (move_fn_p (OVL_CURRENT (fns))) | |
5180 | return true; | |
5181 | ||
5182 | return false; | |
5183 | } | |
5184 | ||
a2e70335 JM |
5185 | /* Returns true iff class T has a move constructor that was explicitly |
5186 | declared in the class body. Note that this is different from | |
5187 | "user-provided", which doesn't include functions that are defaulted in | |
5188 | the class. */ | |
5189 | ||
5190 | bool | |
5191 | type_has_user_declared_move_constructor (tree t) | |
5192 | { | |
5193 | tree fns; | |
5194 | ||
5195 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
5196 | return false; | |
5197 | ||
5198 | if (!CLASSTYPE_METHOD_VEC (t)) | |
5199 | return false; | |
5200 | ||
5201 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5202 | { | |
5203 | tree fn = OVL_CURRENT (fns); | |
5204 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
5205 | return true; | |
5206 | } | |
5207 | ||
5208 | return false; | |
5209 | } | |
5210 | ||
5211 | /* Returns true iff class T has a move assignment operator that was | |
5212 | explicitly declared in the class body. */ | |
5213 | ||
5214 | bool | |
5215 | type_has_user_declared_move_assign (tree t) | |
5216 | { | |
5217 | tree fns; | |
5218 | ||
5219 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
5220 | return false; | |
5221 | ||
fa4ba4af | 5222 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
a2e70335 JM |
5223 | fns; fns = OVL_NEXT (fns)) |
5224 | { | |
5225 | tree fn = OVL_CURRENT (fns); | |
5226 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
5227 | return true; | |
5228 | } | |
5229 | ||
5230 | return false; | |
5231 | } | |
5232 | ||
95552437 | 5233 | /* Nonzero if we need to build up a constructor call when initializing an |
eca7fc57 | 5234 | object of this class, either because it has a user-declared constructor |
95552437 JM |
5235 | or because it doesn't have a default constructor (so we need to give an |
5236 | error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when | |
5237 | what you care about is whether or not an object can be produced by a | |
5238 | constructor (e.g. so we don't set TREE_READONLY on const variables of | |
5239 | such type); use this function when what you care about is whether or not | |
5240 | to try to call a constructor to create an object. The latter case is | |
5241 | the former plus some cases of constructors that cannot be called. */ | |
5242 | ||
5243 | bool | |
5244 | type_build_ctor_call (tree t) | |
5245 | { | |
5246 | tree inner; | |
5247 | if (TYPE_NEEDS_CONSTRUCTING (t)) | |
5248 | return true; | |
5249 | inner = strip_array_types (t); | |
eca7fc57 JM |
5250 | if (!CLASS_TYPE_P (inner) || ANON_AGGR_TYPE_P (inner)) |
5251 | return false; | |
5252 | if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner)) | |
5253 | return true; | |
83f31d8d JM |
5254 | if (cxx_dialect < cxx11) |
5255 | return false; | |
eca7fc57 JM |
5256 | /* A user-declared constructor might be private, and a constructor might |
5257 | be trivial but deleted. */ | |
5258 | for (tree fns = lookup_fnfields_slot (inner, complete_ctor_identifier); | |
5259 | fns; fns = OVL_NEXT (fns)) | |
5260 | { | |
5261 | tree fn = OVL_CURRENT (fns); | |
5262 | if (!DECL_ARTIFICIAL (fn) | |
5263 | || DECL_DELETED_FN (fn)) | |
5264 | return true; | |
5265 | } | |
5266 | return false; | |
5267 | } | |
5268 | ||
5269 | /* Like type_build_ctor_call, but for destructors. */ | |
5270 | ||
5271 | bool | |
5272 | type_build_dtor_call (tree t) | |
5273 | { | |
5274 | tree inner; | |
5275 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
5276 | return true; | |
5277 | inner = strip_array_types (t); | |
5278 | if (!CLASS_TYPE_P (inner) || ANON_AGGR_TYPE_P (inner) | |
5279 | || !COMPLETE_TYPE_P (inner)) | |
5280 | return false; | |
83f31d8d JM |
5281 | if (cxx_dialect < cxx11) |
5282 | return false; | |
eca7fc57 JM |
5283 | /* A user-declared destructor might be private, and a destructor might |
5284 | be trivial but deleted. */ | |
5285 | for (tree fns = lookup_fnfields_slot (inner, complete_dtor_identifier); | |
5286 | fns; fns = OVL_NEXT (fns)) | |
5287 | { | |
5288 | tree fn = OVL_CURRENT (fns); | |
5289 | if (!DECL_ARTIFICIAL (fn) | |
5290 | || DECL_DELETED_FN (fn)) | |
5291 | return true; | |
5292 | } | |
5293 | return false; | |
95552437 JM |
5294 | } |
5295 | ||
58010b57 MM |
5296 | /* Remove all zero-width bit-fields from T. */ |
5297 | ||
5298 | static void | |
94edc4ab | 5299 | remove_zero_width_bit_fields (tree t) |
58010b57 MM |
5300 | { |
5301 | tree *fieldsp; | |
5302 | ||
c8094d83 | 5303 | fieldsp = &TYPE_FIELDS (t); |
58010b57 MM |
5304 | while (*fieldsp) |
5305 | { | |
5306 | if (TREE_CODE (*fieldsp) == FIELD_DECL | |
c8094d83 | 5307 | && DECL_C_BIT_FIELD (*fieldsp) |
84894f85 DS |
5308 | /* We should not be confused by the fact that grokbitfield |
5309 | temporarily sets the width of the bit field into | |
5310 | DECL_INITIAL (*fieldsp). | |
5311 | check_bitfield_decl eventually sets DECL_SIZE (*fieldsp) | |
5312 | to that width. */ | |
5313 | && integer_zerop (DECL_SIZE (*fieldsp))) | |
910ad8de | 5314 | *fieldsp = DECL_CHAIN (*fieldsp); |
58010b57 | 5315 | else |
910ad8de | 5316 | fieldsp = &DECL_CHAIN (*fieldsp); |
58010b57 MM |
5317 | } |
5318 | } | |
5319 | ||
dbc957f1 MM |
5320 | /* Returns TRUE iff we need a cookie when dynamically allocating an |
5321 | array whose elements have the indicated class TYPE. */ | |
5322 | ||
5323 | static bool | |
94edc4ab | 5324 | type_requires_array_cookie (tree type) |
dbc957f1 MM |
5325 | { |
5326 | tree fns; | |
18fee3ee | 5327 | bool has_two_argument_delete_p = false; |
dbc957f1 | 5328 | |
50bc768d | 5329 | gcc_assert (CLASS_TYPE_P (type)); |
dbc957f1 MM |
5330 | |
5331 | /* If there's a non-trivial destructor, we need a cookie. In order | |
5332 | to iterate through the array calling the destructor for each | |
5333 | element, we'll have to know how many elements there are. */ | |
5334 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
5335 | return true; | |
5336 | ||
5337 | /* If the usual deallocation function is a two-argument whose second | |
5338 | argument is of type `size_t', then we have to pass the size of | |
5339 | the array to the deallocation function, so we will need to store | |
5340 | a cookie. */ | |
c8094d83 | 5341 | fns = lookup_fnfields (TYPE_BINFO (type), |
dbc957f1 MM |
5342 | ansi_opname (VEC_DELETE_EXPR), |
5343 | /*protect=*/0); | |
5344 | /* If there are no `operator []' members, or the lookup is | |
5345 | ambiguous, then we don't need a cookie. */ | |
5346 | if (!fns || fns == error_mark_node) | |
5347 | return false; | |
5348 | /* Loop through all of the functions. */ | |
50ad9642 | 5349 | for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns)) |
dbc957f1 MM |
5350 | { |
5351 | tree fn; | |
5352 | tree second_parm; | |
5353 | ||
5354 | /* Select the current function. */ | |
5355 | fn = OVL_CURRENT (fns); | |
5356 | /* See if this function is a one-argument delete function. If | |
5357 | it is, then it will be the usual deallocation function. */ | |
5358 | second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))); | |
5359 | if (second_parm == void_list_node) | |
5360 | return false; | |
4b8cb94c SM |
5361 | /* Do not consider this function if its second argument is an |
5362 | ellipsis. */ | |
5363 | if (!second_parm) | |
5364 | continue; | |
dbc957f1 MM |
5365 | /* Otherwise, if we have a two-argument function and the second |
5366 | argument is `size_t', it will be the usual deallocation | |
5367 | function -- unless there is one-argument function, too. */ | |
5368 | if (TREE_CHAIN (second_parm) == void_list_node | |
c79154c4 | 5369 | && same_type_p (TREE_VALUE (second_parm), size_type_node)) |
dbc957f1 MM |
5370 | has_two_argument_delete_p = true; |
5371 | } | |
5372 | ||
5373 | return has_two_argument_delete_p; | |
5374 | } | |
5375 | ||
3b49d762 GDR |
5376 | /* Finish computing the `literal type' property of class type T. |
5377 | ||
5378 | At this point, we have already processed base classes and | |
5379 | non-static data members. We need to check whether the copy | |
5380 | constructor is trivial, the destructor is trivial, and there | |
5381 | is a trivial default constructor or at least one constexpr | |
5382 | constructor other than the copy constructor. */ | |
5383 | ||
5384 | static void | |
5385 | finalize_literal_type_property (tree t) | |
5386 | { | |
0515f4d2 JM |
5387 | tree fn; |
5388 | ||
604b2bfc | 5389 | if (cxx_dialect < cxx11 |
b198484e | 5390 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) |
3b49d762 GDR |
5391 | CLASSTYPE_LITERAL_P (t) = false; |
5392 | else if (CLASSTYPE_LITERAL_P (t) && !TYPE_HAS_TRIVIAL_DFLT (t) | |
b198484e | 5393 | && CLASSTYPE_NON_AGGREGATE (t) |
3b49d762 GDR |
5394 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) |
5395 | CLASSTYPE_LITERAL_P (t) = false; | |
0515f4d2 JM |
5396 | |
5397 | if (!CLASSTYPE_LITERAL_P (t)) | |
5398 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) | |
5399 | if (DECL_DECLARED_CONSTEXPR_P (fn) | |
5400 | && TREE_CODE (fn) != TEMPLATE_DECL | |
5401 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
5402 | && !DECL_CONSTRUCTOR_P (fn)) | |
5403 | { | |
5404 | DECL_DECLARED_CONSTEXPR_P (fn) = false; | |
b432106b | 5405 | if (!DECL_GENERATED_P (fn)) |
f732fa7b JM |
5406 | { |
5407 | error ("enclosing class of constexpr non-static member " | |
5408 | "function %q+#D is not a literal type", fn); | |
5409 | explain_non_literal_class (t); | |
5410 | } | |
0515f4d2 | 5411 | } |
3b49d762 GDR |
5412 | } |
5413 | ||
f732fa7b JM |
5414 | /* T is a non-literal type used in a context which requires a constant |
5415 | expression. Explain why it isn't literal. */ | |
5416 | ||
5417 | void | |
5418 | explain_non_literal_class (tree t) | |
5419 | { | |
6e2830c3 | 5420 | static hash_set<tree> *diagnosed; |
f732fa7b JM |
5421 | |
5422 | if (!CLASS_TYPE_P (t)) | |
5423 | return; | |
5424 | t = TYPE_MAIN_VARIANT (t); | |
5425 | ||
5426 | if (diagnosed == NULL) | |
6e2830c3 TS |
5427 | diagnosed = new hash_set<tree>; |
5428 | if (diagnosed->add (t)) | |
f732fa7b JM |
5429 | /* Already explained. */ |
5430 | return; | |
5431 | ||
5432 | inform (0, "%q+T is not literal because:", t); | |
5433 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
5434 | inform (0, " %q+T has a non-trivial destructor", t); | |
5435 | else if (CLASSTYPE_NON_AGGREGATE (t) | |
5436 | && !TYPE_HAS_TRIVIAL_DFLT (t) | |
5437 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) | |
fd3faf2b JM |
5438 | { |
5439 | inform (0, " %q+T is not an aggregate, does not have a trivial " | |
5440 | "default constructor, and has no constexpr constructor that " | |
5441 | "is not a copy or move constructor", t); | |
a710f1f8 | 5442 | if (type_has_non_user_provided_default_constructor (t)) |
efff2fb4 PC |
5443 | { |
5444 | /* Note that we can't simply call locate_ctor because when the | |
5445 | constructor is deleted it just returns NULL_TREE. */ | |
5446 | tree fns; | |
5447 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
5448 | { | |
5449 | tree fn = OVL_CURRENT (fns); | |
5450 | tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
5451 | ||
5452 | parms = skip_artificial_parms_for (fn, parms); | |
5453 | ||
5454 | if (sufficient_parms_p (parms)) | |
5455 | { | |
5456 | if (DECL_DELETED_FN (fn)) | |
5457 | maybe_explain_implicit_delete (fn); | |
5458 | else | |
5459 | explain_invalid_constexpr_fn (fn); | |
5460 | break; | |
5461 | } | |
5462 | } | |
5463 | } | |
fd3faf2b | 5464 | } |
f732fa7b JM |
5465 | else |
5466 | { | |
5467 | tree binfo, base_binfo, field; int i; | |
5468 | for (binfo = TYPE_BINFO (t), i = 0; | |
5469 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
5470 | { | |
5471 | tree basetype = TREE_TYPE (base_binfo); | |
5472 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
5473 | { | |
5474 | inform (0, " base class %qT of %q+T is non-literal", | |
5475 | basetype, t); | |
5476 | explain_non_literal_class (basetype); | |
5477 | return; | |
5478 | } | |
5479 | } | |
5480 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
5481 | { | |
5482 | tree ftype; | |
5483 | if (TREE_CODE (field) != FIELD_DECL) | |
5484 | continue; | |
5485 | ftype = TREE_TYPE (field); | |
5486 | if (!literal_type_p (ftype)) | |
5487 | { | |
5488 | inform (0, " non-static data member %q+D has " | |
5489 | "non-literal type", field); | |
5490 | if (CLASS_TYPE_P (ftype)) | |
5491 | explain_non_literal_class (ftype); | |
5492 | } | |
cec362c9 PC |
5493 | if (CP_TYPE_VOLATILE_P (ftype)) |
5494 | inform (0, " non-static data member %q+D has " | |
5495 | "volatile type", field); | |
f732fa7b JM |
5496 | } |
5497 | } | |
5498 | } | |
5499 | ||
607cf131 MM |
5500 | /* Check the validity of the bases and members declared in T. Add any |
5501 | implicitly-generated functions (like copy-constructors and | |
5502 | assignment operators). Compute various flag bits (like | |
c32097d8 | 5503 | CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++ |
607cf131 MM |
5504 | level: i.e., independently of the ABI in use. */ |
5505 | ||
5506 | static void | |
58731fd1 | 5507 | check_bases_and_members (tree t) |
607cf131 | 5508 | { |
607cf131 MM |
5509 | /* Nonzero if the implicitly generated copy constructor should take |
5510 | a non-const reference argument. */ | |
5511 | int cant_have_const_ctor; | |
78dcd41a | 5512 | /* Nonzero if the implicitly generated assignment operator |
607cf131 MM |
5513 | should take a non-const reference argument. */ |
5514 | int no_const_asn_ref; | |
5515 | tree access_decls; | |
b87d79e6 JM |
5516 | bool saved_complex_asn_ref; |
5517 | bool saved_nontrivial_dtor; | |
20f2653e | 5518 | tree fn; |
607cf131 MM |
5519 | |
5520 | /* By default, we use const reference arguments and generate default | |
5521 | constructors. */ | |
607cf131 MM |
5522 | cant_have_const_ctor = 0; |
5523 | no_const_asn_ref = 0; | |
5524 | ||
00a17e31 | 5525 | /* Check all the base-classes. */ |
e5e459bf | 5526 | check_bases (t, &cant_have_const_ctor, |
10746f37 | 5527 | &no_const_asn_ref); |
607cf131 | 5528 | |
52d95c21 JM |
5529 | /* Deduce noexcept on destructors. This needs to happen after we've set |
5530 | triviality flags appropriately for our bases. */ | |
604b2bfc | 5531 | if (cxx_dialect >= cxx11) |
52d95c21 JM |
5532 | deduce_noexcept_on_destructors (t); |
5533 | ||
9f4faeae MM |
5534 | /* Check all the method declarations. */ |
5535 | check_methods (t); | |
5536 | ||
b87d79e6 JM |
5537 | /* Save the initial values of these flags which only indicate whether |
5538 | or not the class has user-provided functions. As we analyze the | |
5539 | bases and members we can set these flags for other reasons. */ | |
066ec0a4 | 5540 | saved_complex_asn_ref = TYPE_HAS_COMPLEX_COPY_ASSIGN (t); |
b87d79e6 JM |
5541 | saved_nontrivial_dtor = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
5542 | ||
9f4faeae MM |
5543 | /* Check all the data member declarations. We cannot call |
5544 | check_field_decls until we have called check_bases check_methods, | |
5545 | as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
5546 | being set appropriately. */ | |
58731fd1 | 5547 | check_field_decls (t, &access_decls, |
607cf131 | 5548 | &cant_have_const_ctor, |
10746f37 | 5549 | &no_const_asn_ref); |
607cf131 | 5550 | |
bbd15aac MM |
5551 | /* A nearly-empty class has to be vptr-containing; a nearly empty |
5552 | class contains just a vptr. */ | |
5553 | if (!TYPE_CONTAINS_VPTR_P (t)) | |
f9c528ea MM |
5554 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; |
5555 | ||
607cf131 MM |
5556 | /* Do some bookkeeping that will guide the generation of implicitly |
5557 | declared member functions. */ | |
066ec0a4 | 5558 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 5559 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
0fcedd9c | 5560 | /* We need to call a constructor for this class if it has a |
b87d79e6 | 5561 | user-provided constructor, or if the default constructor is going |
0fcedd9c JM |
5562 | to initialize the vptr. (This is not an if-and-only-if; |
5563 | TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members | |
5564 | themselves need constructing.) */ | |
607cf131 | 5565 | TYPE_NEEDS_CONSTRUCTING (t) |
b87d79e6 | 5566 | |= (type_has_user_provided_constructor (t) || TYPE_CONTAINS_VPTR_P (t)); |
0fcedd9c JM |
5567 | /* [dcl.init.aggr] |
5568 | ||
b87d79e6 | 5569 | An aggregate is an array or a class with no user-provided |
0fcedd9c JM |
5570 | constructors ... and no virtual functions. |
5571 | ||
5572 | Again, other conditions for being an aggregate are checked | |
5573 | elsewhere. */ | |
5775a06a | 5574 | CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 5575 | |= (type_has_user_provided_constructor (t) || TYPE_POLYMORPHIC_P (t)); |
c32097d8 JM |
5576 | /* This is the C++98/03 definition of POD; it changed in C++0x, but we |
5577 | retain the old definition internally for ABI reasons. */ | |
5578 | CLASSTYPE_NON_LAYOUT_POD_P (t) | |
c8094d83 | 5579 | |= (CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 5580 | || saved_nontrivial_dtor || saved_complex_asn_ref); |
c32097d8 | 5581 | CLASSTYPE_NON_STD_LAYOUT (t) |= TYPE_CONTAINS_VPTR_P (t); |
066ec0a4 | 5582 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 5583 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
f782c65c | 5584 | TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_CONTAINS_VPTR_P (t); |
607cf131 | 5585 | |
a710f1f8 JM |
5586 | /* If the only explicitly declared default constructor is user-provided, |
5587 | set TYPE_HAS_COMPLEX_DFLT. */ | |
5588 | if (!TYPE_HAS_COMPLEX_DFLT (t) | |
5589 | && TYPE_HAS_DEFAULT_CONSTRUCTOR (t) | |
5590 | && !type_has_non_user_provided_default_constructor (t)) | |
5591 | TYPE_HAS_COMPLEX_DFLT (t) = true; | |
5592 | ||
38f09da3 | 5593 | /* Warn if a public base of a polymorphic type has an accessible |
880a467b NS |
5594 | non-virtual destructor. It is only now that we know the class is |
5595 | polymorphic. Although a polymorphic base will have a already | |
5596 | been diagnosed during its definition, we warn on use too. */ | |
5597 | if (TYPE_POLYMORPHIC_P (t) && warn_nonvdtor) | |
5598 | { | |
38f09da3 NS |
5599 | tree binfo = TYPE_BINFO (t); |
5600 | vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); | |
5601 | tree base_binfo; | |
880a467b NS |
5602 | unsigned i; |
5603 | ||
38f09da3 | 5604 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
880a467b NS |
5605 | { |
5606 | tree basetype = TREE_TYPE (base_binfo); | |
5607 | ||
38f09da3 NS |
5608 | if ((*accesses)[i] == access_public_node |
5609 | && (TYPE_POLYMORPHIC_P (basetype) || warn_ecpp) | |
5610 | && accessible_nvdtor_p (basetype)) | |
880a467b NS |
5611 | warning (OPT_Wnon_virtual_dtor, |
5612 | "base class %q#T has accessible non-virtual destructor", | |
5613 | basetype); | |
5614 | } | |
5615 | } | |
5616 | ||
0fcedd9c JM |
5617 | /* If the class has no user-declared constructor, but does have |
5618 | non-static const or reference data members that can never be | |
5619 | initialized, issue a warning. */ | |
c73d5dd9 | 5620 | if (warn_uninitialized |
0fcedd9c JM |
5621 | /* Classes with user-declared constructors are presumed to |
5622 | initialize these members. */ | |
5623 | && !TYPE_HAS_USER_CONSTRUCTOR (t) | |
5624 | /* Aggregates can be initialized with brace-enclosed | |
5625 | initializers. */ | |
5626 | && CLASSTYPE_NON_AGGREGATE (t)) | |
5627 | { | |
5628 | tree field; | |
5629 | ||
910ad8de | 5630 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
0fcedd9c JM |
5631 | { |
5632 | tree type; | |
5633 | ||
f315d618 JJ |
5634 | if (TREE_CODE (field) != FIELD_DECL |
5635 | || DECL_INITIAL (field) != NULL_TREE) | |
0fcedd9c JM |
5636 | continue; |
5637 | ||
5638 | type = TREE_TYPE (field); | |
5639 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
c73d5dd9 MLI |
5640 | warning (OPT_Wuninitialized, "non-static reference %q+#D " |
5641 | "in class without a constructor", field); | |
0fcedd9c JM |
5642 | else if (CP_TYPE_CONST_P (type) |
5643 | && (!CLASS_TYPE_P (type) | |
5644 | || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type))) | |
c73d5dd9 MLI |
5645 | warning (OPT_Wuninitialized, "non-static const member %q+#D " |
5646 | "in class without a constructor", field); | |
0fcedd9c JM |
5647 | } |
5648 | } | |
5649 | ||
03fd3f84 | 5650 | /* Synthesize any needed methods. */ |
85b5d65a | 5651 | add_implicitly_declared_members (t, &access_decls, |
607cf131 | 5652 | cant_have_const_ctor, |
10746f37 | 5653 | no_const_asn_ref); |
607cf131 | 5654 | |
20f2653e JM |
5655 | /* Check defaulted declarations here so we have cant_have_const_ctor |
5656 | and don't need to worry about clones. */ | |
910ad8de | 5657 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
85b5d65a | 5658 | if (!DECL_ARTIFICIAL (fn) && DECL_DEFAULTED_IN_CLASS_P (fn)) |
20f2653e JM |
5659 | { |
5660 | int copy = copy_fn_p (fn); | |
5661 | if (copy > 0) | |
5662 | { | |
5663 | bool imp_const_p | |
5664 | = (DECL_CONSTRUCTOR_P (fn) ? !cant_have_const_ctor | |
5665 | : !no_const_asn_ref); | |
5666 | bool fn_const_p = (copy == 2); | |
5667 | ||
5668 | if (fn_const_p && !imp_const_p) | |
5669 | /* If the function is defaulted outside the class, we just | |
5670 | give the synthesis error. */ | |
5671 | error ("%q+D declared to take const reference, but implicit " | |
5672 | "declaration would take non-const", fn); | |
20f2653e JM |
5673 | } |
5674 | defaulted_late_check (fn); | |
5675 | } | |
5676 | ||
d5f4eddd JM |
5677 | if (LAMBDA_TYPE_P (t)) |
5678 | { | |
d5f4eddd JM |
5679 | /* "This class type is not an aggregate." */ |
5680 | CLASSTYPE_NON_AGGREGATE (t) = 1; | |
5681 | } | |
5682 | ||
3b49d762 GDR |
5683 | /* Compute the 'literal type' property before we |
5684 | do anything with non-static member functions. */ | |
5685 | finalize_literal_type_property (t); | |
5686 | ||
db9b2174 MM |
5687 | /* Create the in-charge and not-in-charge variants of constructors |
5688 | and destructors. */ | |
5689 | clone_constructors_and_destructors (t); | |
5690 | ||
aa52c1ff JM |
5691 | /* Process the using-declarations. */ |
5692 | for (; access_decls; access_decls = TREE_CHAIN (access_decls)) | |
5693 | handle_using_decl (TREE_VALUE (access_decls), t); | |
5694 | ||
607cf131 MM |
5695 | /* Build and sort the CLASSTYPE_METHOD_VEC. */ |
5696 | finish_struct_methods (t); | |
dbc957f1 MM |
5697 | |
5698 | /* Figure out whether or not we will need a cookie when dynamically | |
5699 | allocating an array of this type. */ | |
e2500fed | 5700 | TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie |
dbc957f1 | 5701 | = type_requires_array_cookie (t); |
607cf131 MM |
5702 | } |
5703 | ||
3ef397c1 | 5704 | /* If T needs a pointer to its virtual function table, set TYPE_VFIELD |
5c24fba6 MM |
5705 | accordingly. If a new vfield was created (because T doesn't have a |
5706 | primary base class), then the newly created field is returned. It | |
c35cce41 | 5707 | is not added to the TYPE_FIELDS list; it is the caller's |
e6858a84 NS |
5708 | responsibility to do that. Accumulate declared virtual functions |
5709 | on VIRTUALS_P. */ | |
3ef397c1 | 5710 | |
5c24fba6 | 5711 | static tree |
94edc4ab | 5712 | create_vtable_ptr (tree t, tree* virtuals_p) |
3ef397c1 MM |
5713 | { |
5714 | tree fn; | |
5715 | ||
e6858a84 | 5716 | /* Collect the virtual functions declared in T. */ |
910ad8de | 5717 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
aaf8a23e JH |
5718 | if (TREE_CODE (fn) == FUNCTION_DECL |
5719 | && DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn) | |
e6858a84 NS |
5720 | && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST) |
5721 | { | |
5722 | tree new_virtual = make_node (TREE_LIST); | |
c8094d83 | 5723 | |
e6858a84 NS |
5724 | BV_FN (new_virtual) = fn; |
5725 | BV_DELTA (new_virtual) = integer_zero_node; | |
d1f05f93 | 5726 | BV_VCALL_INDEX (new_virtual) = NULL_TREE; |
3ef397c1 | 5727 | |
e6858a84 NS |
5728 | TREE_CHAIN (new_virtual) = *virtuals_p; |
5729 | *virtuals_p = new_virtual; | |
5730 | } | |
c8094d83 | 5731 | |
da3d4dfa MM |
5732 | /* If we couldn't find an appropriate base class, create a new field |
5733 | here. Even if there weren't any new virtual functions, we might need a | |
bbd15aac MM |
5734 | new virtual function table if we're supposed to include vptrs in |
5735 | all classes that need them. */ | |
e6858a84 | 5736 | if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t))) |
3ef397c1 MM |
5737 | { |
5738 | /* We build this decl with vtbl_ptr_type_node, which is a | |
5739 | `vtable_entry_type*'. It might seem more precise to use | |
a692ad2e | 5740 | `vtable_entry_type (*)[N]' where N is the number of virtual |
3ef397c1 MM |
5741 | functions. However, that would require the vtable pointer in |
5742 | base classes to have a different type than the vtable pointer | |
5743 | in derived classes. We could make that happen, but that | |
5744 | still wouldn't solve all the problems. In particular, the | |
5745 | type-based alias analysis code would decide that assignments | |
5746 | to the base class vtable pointer can't alias assignments to | |
5747 | the derived class vtable pointer, since they have different | |
4639c5c6 | 5748 | types. Thus, in a derived class destructor, where the base |
3ef397c1 | 5749 | class constructor was inlined, we could generate bad code for |
c8094d83 | 5750 | setting up the vtable pointer. |
3ef397c1 | 5751 | |
0cbd7506 | 5752 | Therefore, we use one type for all vtable pointers. We still |
3ef397c1 MM |
5753 | use a type-correct type; it's just doesn't indicate the array |
5754 | bounds. That's better than using `void*' or some such; it's | |
5755 | cleaner, and it let's the alias analysis code know that these | |
5756 | stores cannot alias stores to void*! */ | |
0abe00c5 NS |
5757 | tree field; |
5758 | ||
c2255bc4 AH |
5759 | field = build_decl (input_location, |
5760 | FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node); | |
0abe00c5 NS |
5761 | DECL_VIRTUAL_P (field) = 1; |
5762 | DECL_ARTIFICIAL (field) = 1; | |
5763 | DECL_FIELD_CONTEXT (field) = t; | |
5764 | DECL_FCONTEXT (field) = t; | |
7c08df6c JM |
5765 | if (TYPE_PACKED (t)) |
5766 | DECL_PACKED (field) = 1; | |
c8094d83 | 5767 | |
0abe00c5 | 5768 | TYPE_VFIELD (t) = field; |
c8094d83 | 5769 | |
0abe00c5 | 5770 | /* This class is non-empty. */ |
58731fd1 | 5771 | CLASSTYPE_EMPTY_P (t) = 0; |
3ef397c1 | 5772 | |
0abe00c5 | 5773 | return field; |
3ef397c1 | 5774 | } |
5c24fba6 MM |
5775 | |
5776 | return NULL_TREE; | |
3ef397c1 MM |
5777 | } |
5778 | ||
9d4c0187 MM |
5779 | /* Add OFFSET to all base types of BINFO which is a base in the |
5780 | hierarchy dominated by T. | |
80fd5f48 | 5781 | |
911a71a7 | 5782 | OFFSET, which is a type offset, is number of bytes. */ |
80fd5f48 MM |
5783 | |
5784 | static void | |
dbbf88d1 | 5785 | propagate_binfo_offsets (tree binfo, tree offset) |
80fd5f48 | 5786 | { |
911a71a7 MM |
5787 | int i; |
5788 | tree primary_binfo; | |
fa743e8c | 5789 | tree base_binfo; |
80fd5f48 | 5790 | |
911a71a7 MM |
5791 | /* Update BINFO's offset. */ |
5792 | BINFO_OFFSET (binfo) | |
c8094d83 | 5793 | = convert (sizetype, |
911a71a7 MM |
5794 | size_binop (PLUS_EXPR, |
5795 | convert (ssizetype, BINFO_OFFSET (binfo)), | |
5796 | offset)); | |
80fd5f48 | 5797 | |
911a71a7 MM |
5798 | /* Find the primary base class. */ |
5799 | primary_binfo = get_primary_binfo (binfo); | |
5800 | ||
fc6633e0 | 5801 | if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo) |
090ad434 | 5802 | propagate_binfo_offsets (primary_binfo, offset); |
c8094d83 | 5803 | |
911a71a7 MM |
5804 | /* Scan all of the bases, pushing the BINFO_OFFSET adjust |
5805 | downwards. */ | |
fa743e8c | 5806 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
80fd5f48 | 5807 | { |
090ad434 NS |
5808 | /* Don't do the primary base twice. */ |
5809 | if (base_binfo == primary_binfo) | |
5810 | continue; | |
911a71a7 | 5811 | |
090ad434 | 5812 | if (BINFO_VIRTUAL_P (base_binfo)) |
911a71a7 MM |
5813 | continue; |
5814 | ||
dbbf88d1 | 5815 | propagate_binfo_offsets (base_binfo, offset); |
911a71a7 | 5816 | } |
9d4c0187 MM |
5817 | } |
5818 | ||
17bbb839 | 5819 | /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update |
c20118a8 MM |
5820 | TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of |
5821 | empty subobjects of T. */ | |
80fd5f48 | 5822 | |
d2c5305b | 5823 | static void |
17bbb839 | 5824 | layout_virtual_bases (record_layout_info rli, splay_tree offsets) |
80fd5f48 | 5825 | { |
dbbf88d1 | 5826 | tree vbase; |
17bbb839 | 5827 | tree t = rli->t; |
17bbb839 | 5828 | tree *next_field; |
9785e4b1 | 5829 | |
604a3205 | 5830 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0) |
9785e4b1 MM |
5831 | return; |
5832 | ||
17bbb839 MM |
5833 | /* Find the last field. The artificial fields created for virtual |
5834 | bases will go after the last extant field to date. */ | |
5835 | next_field = &TYPE_FIELDS (t); | |
5836 | while (*next_field) | |
910ad8de | 5837 | next_field = &DECL_CHAIN (*next_field); |
80fd5f48 | 5838 | |
9d4c0187 | 5839 | /* Go through the virtual bases, allocating space for each virtual |
3461fba7 NS |
5840 | base that is not already a primary base class. These are |
5841 | allocated in inheritance graph order. */ | |
dbbf88d1 | 5842 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) |
c35cce41 | 5843 | { |
809e3e7f | 5844 | if (!BINFO_VIRTUAL_P (vbase)) |
1f84ec23 | 5845 | continue; |
eca7f13c | 5846 | |
9965d119 | 5847 | if (!BINFO_PRIMARY_P (vbase)) |
c35cce41 MM |
5848 | { |
5849 | /* This virtual base is not a primary base of any class in the | |
5850 | hierarchy, so we have to add space for it. */ | |
58731fd1 | 5851 | next_field = build_base_field (rli, vbase, |
17bbb839 | 5852 | offsets, next_field); |
c35cce41 MM |
5853 | } |
5854 | } | |
80fd5f48 MM |
5855 | } |
5856 | ||
ba9a991f MM |
5857 | /* Returns the offset of the byte just past the end of the base class |
5858 | BINFO. */ | |
5859 | ||
5860 | static tree | |
5861 | end_of_base (tree binfo) | |
5862 | { | |
5863 | tree size; | |
5864 | ||
1ad8aeeb DG |
5865 | if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo))) |
5866 | size = TYPE_SIZE_UNIT (char_type_node); | |
5867 | else if (is_empty_class (BINFO_TYPE (binfo))) | |
ba9a991f MM |
5868 | /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to |
5869 | allocate some space for it. It cannot have virtual bases, so | |
5870 | TYPE_SIZE_UNIT is fine. */ | |
5871 | size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5872 | else | |
5873 | size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5874 | ||
5875 | return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size); | |
5876 | } | |
5877 | ||
9785e4b1 MM |
5878 | /* Returns the offset of the byte just past the end of the base class |
5879 | with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then | |
5880 | only non-virtual bases are included. */ | |
80fd5f48 | 5881 | |
17bbb839 | 5882 | static tree |
94edc4ab | 5883 | end_of_class (tree t, int include_virtuals_p) |
80fd5f48 | 5884 | { |
17bbb839 | 5885 | tree result = size_zero_node; |
9771b263 | 5886 | vec<tree, va_gc> *vbases; |
ba9a991f | 5887 | tree binfo; |
9ba5ff0f | 5888 | tree base_binfo; |
ba9a991f | 5889 | tree offset; |
9785e4b1 | 5890 | int i; |
80fd5f48 | 5891 | |
fa743e8c NS |
5892 | for (binfo = TYPE_BINFO (t), i = 0; |
5893 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
9785e4b1 | 5894 | { |
9785e4b1 | 5895 | if (!include_virtuals_p |
fc6633e0 NS |
5896 | && BINFO_VIRTUAL_P (base_binfo) |
5897 | && (!BINFO_PRIMARY_P (base_binfo) | |
5898 | || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t))) | |
9785e4b1 | 5899 | continue; |
80fd5f48 | 5900 | |
fa743e8c | 5901 | offset = end_of_base (base_binfo); |
807e902e | 5902 | if (tree_int_cst_lt (result, offset)) |
17bbb839 | 5903 | result = offset; |
9785e4b1 | 5904 | } |
80fd5f48 | 5905 | |
90d84934 | 5906 | if (include_virtuals_p) |
9ba5ff0f | 5907 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 5908 | vec_safe_iterate (vbases, i, &base_binfo); i++) |
ba9a991f | 5909 | { |
9ba5ff0f | 5910 | offset = end_of_base (base_binfo); |
807e902e | 5911 | if (tree_int_cst_lt (result, offset)) |
ba9a991f MM |
5912 | result = offset; |
5913 | } | |
5914 | ||
9785e4b1 | 5915 | return result; |
80fd5f48 MM |
5916 | } |
5917 | ||
17bbb839 | 5918 | /* Warn about bases of T that are inaccessible because they are |
78b45a24 MM |
5919 | ambiguous. For example: |
5920 | ||
5921 | struct S {}; | |
5922 | struct T : public S {}; | |
5923 | struct U : public S, public T {}; | |
5924 | ||
5925 | Here, `(S*) new U' is not allowed because there are two `S' | |
5926 | subobjects of U. */ | |
5927 | ||
5928 | static void | |
94edc4ab | 5929 | warn_about_ambiguous_bases (tree t) |
78b45a24 MM |
5930 | { |
5931 | int i; | |
9771b263 | 5932 | vec<tree, va_gc> *vbases; |
17bbb839 | 5933 | tree basetype; |
58c42dc2 | 5934 | tree binfo; |
fa743e8c | 5935 | tree base_binfo; |
78b45a24 | 5936 | |
18e4be85 NS |
5937 | /* If there are no repeated bases, nothing can be ambiguous. */ |
5938 | if (!CLASSTYPE_REPEATED_BASE_P (t)) | |
5939 | return; | |
c8094d83 | 5940 | |
17bbb839 | 5941 | /* Check direct bases. */ |
fa743e8c NS |
5942 | for (binfo = TYPE_BINFO (t), i = 0; |
5943 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
78b45a24 | 5944 | { |
fa743e8c | 5945 | basetype = BINFO_TYPE (base_binfo); |
78b45a24 | 5946 | |
22854930 | 5947 | if (!uniquely_derived_from_p (basetype, t)) |
d4ee4d25 | 5948 | warning (0, "direct base %qT inaccessible in %qT due to ambiguity", |
17bbb839 | 5949 | basetype, t); |
78b45a24 | 5950 | } |
17bbb839 MM |
5951 | |
5952 | /* Check for ambiguous virtual bases. */ | |
5953 | if (extra_warnings) | |
9ba5ff0f | 5954 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
9771b263 | 5955 | vec_safe_iterate (vbases, i, &binfo); i++) |
17bbb839 | 5956 | { |
58c42dc2 | 5957 | basetype = BINFO_TYPE (binfo); |
c8094d83 | 5958 | |
22854930 PC |
5959 | if (!uniquely_derived_from_p (basetype, t)) |
5960 | warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due " | |
5961 | "to ambiguity", basetype, t); | |
17bbb839 | 5962 | } |
78b45a24 MM |
5963 | } |
5964 | ||
c20118a8 MM |
5965 | /* Compare two INTEGER_CSTs K1 and K2. */ |
5966 | ||
5967 | static int | |
94edc4ab | 5968 | splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2) |
c20118a8 MM |
5969 | { |
5970 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
5971 | } | |
5972 | ||
17bbb839 MM |
5973 | /* Increase the size indicated in RLI to account for empty classes |
5974 | that are "off the end" of the class. */ | |
5975 | ||
5976 | static void | |
5977 | include_empty_classes (record_layout_info rli) | |
5978 | { | |
5979 | tree eoc; | |
e3ccdd50 | 5980 | tree rli_size; |
17bbb839 MM |
5981 | |
5982 | /* It might be the case that we grew the class to allocate a | |
5983 | zero-sized base class. That won't be reflected in RLI, yet, | |
5984 | because we are willing to overlay multiple bases at the same | |
5985 | offset. However, now we need to make sure that RLI is big enough | |
5986 | to reflect the entire class. */ | |
c8094d83 | 5987 | eoc = end_of_class (rli->t, |
17bbb839 | 5988 | CLASSTYPE_AS_BASE (rli->t) != NULL_TREE); |
e3ccdd50 MM |
5989 | rli_size = rli_size_unit_so_far (rli); |
5990 | if (TREE_CODE (rli_size) == INTEGER_CST | |
807e902e | 5991 | && tree_int_cst_lt (rli_size, eoc)) |
17bbb839 | 5992 | { |
90d84934 JM |
5993 | /* The size should have been rounded to a whole byte. */ |
5994 | gcc_assert (tree_int_cst_equal | |
5995 | (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT))); | |
c8094d83 MS |
5996 | rli->bitpos |
5997 | = size_binop (PLUS_EXPR, | |
e3ccdd50 MM |
5998 | rli->bitpos, |
5999 | size_binop (MULT_EXPR, | |
6000 | convert (bitsizetype, | |
6001 | size_binop (MINUS_EXPR, | |
6002 | eoc, rli_size)), | |
6003 | bitsize_int (BITS_PER_UNIT))); | |
6004 | normalize_rli (rli); | |
17bbb839 MM |
6005 | } |
6006 | } | |
6007 | ||
2ef16140 MM |
6008 | /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate |
6009 | BINFO_OFFSETs for all of the base-classes. Position the vtable | |
00a17e31 | 6010 | pointer. Accumulate declared virtual functions on VIRTUALS_P. */ |
607cf131 | 6011 | |
2ef16140 | 6012 | static void |
e93ee644 | 6013 | layout_class_type (tree t, tree *virtuals_p) |
2ef16140 | 6014 | { |
5c24fba6 MM |
6015 | tree non_static_data_members; |
6016 | tree field; | |
6017 | tree vptr; | |
6018 | record_layout_info rli; | |
c20118a8 MM |
6019 | /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of |
6020 | types that appear at that offset. */ | |
6021 | splay_tree empty_base_offsets; | |
c65cb8d1 | 6022 | /* True if the last field laid out was a bit-field. */ |
eca7f13c | 6023 | bool last_field_was_bitfield = false; |
17bbb839 MM |
6024 | /* The location at which the next field should be inserted. */ |
6025 | tree *next_field; | |
6026 | /* T, as a base class. */ | |
6027 | tree base_t; | |
5c24fba6 MM |
6028 | |
6029 | /* Keep track of the first non-static data member. */ | |
6030 | non_static_data_members = TYPE_FIELDS (t); | |
6031 | ||
770ae6cc RK |
6032 | /* Start laying out the record. */ |
6033 | rli = start_record_layout (t); | |
534170eb | 6034 | |
fc6633e0 NS |
6035 | /* Mark all the primary bases in the hierarchy. */ |
6036 | determine_primary_bases (t); | |
8026246f | 6037 | |
5c24fba6 | 6038 | /* Create a pointer to our virtual function table. */ |
58731fd1 | 6039 | vptr = create_vtable_ptr (t, virtuals_p); |
5c24fba6 | 6040 | |
3461fba7 | 6041 | /* The vptr is always the first thing in the class. */ |
1f84ec23 | 6042 | if (vptr) |
5c24fba6 | 6043 | { |
910ad8de | 6044 | DECL_CHAIN (vptr) = TYPE_FIELDS (t); |
17bbb839 | 6045 | TYPE_FIELDS (t) = vptr; |
910ad8de | 6046 | next_field = &DECL_CHAIN (vptr); |
770ae6cc | 6047 | place_field (rli, vptr); |
5c24fba6 | 6048 | } |
17bbb839 MM |
6049 | else |
6050 | next_field = &TYPE_FIELDS (t); | |
5c24fba6 | 6051 | |
72a50ab0 | 6052 | /* Build FIELD_DECLs for all of the non-virtual base-types. */ |
c8094d83 | 6053 | empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts, |
c20118a8 | 6054 | NULL, NULL); |
58731fd1 | 6055 | build_base_fields (rli, empty_base_offsets, next_field); |
c8094d83 | 6056 | |
5c24fba6 | 6057 | /* Layout the non-static data members. */ |
910ad8de | 6058 | for (field = non_static_data_members; field; field = DECL_CHAIN (field)) |
5c24fba6 | 6059 | { |
01955e96 MM |
6060 | tree type; |
6061 | tree padding; | |
5c24fba6 MM |
6062 | |
6063 | /* We still pass things that aren't non-static data members to | |
3b426391 | 6064 | the back end, in case it wants to do something with them. */ |
5c24fba6 MM |
6065 | if (TREE_CODE (field) != FIELD_DECL) |
6066 | { | |
770ae6cc | 6067 | place_field (rli, field); |
0154eaa8 | 6068 | /* If the static data member has incomplete type, keep track |
c8094d83 | 6069 | of it so that it can be completed later. (The handling |
0154eaa8 MM |
6070 | of pending statics in finish_record_layout is |
6071 | insufficient; consider: | |
6072 | ||
6073 | struct S1; | |
6074 | struct S2 { static S1 s1; }; | |
c8094d83 | 6075 | |
0cbd7506 | 6076 | At this point, finish_record_layout will be called, but |
0154eaa8 | 6077 | S1 is still incomplete.) */ |
5a6ccc94 | 6078 | if (VAR_P (field)) |
532b37d9 MM |
6079 | { |
6080 | maybe_register_incomplete_var (field); | |
6081 | /* The visibility of static data members is determined | |
6082 | at their point of declaration, not their point of | |
6083 | definition. */ | |
6084 | determine_visibility (field); | |
6085 | } | |
5c24fba6 MM |
6086 | continue; |
6087 | } | |
6088 | ||
01955e96 | 6089 | type = TREE_TYPE (field); |
4e3bd7d5 VR |
6090 | if (type == error_mark_node) |
6091 | continue; | |
c8094d83 | 6092 | |
1e099144 | 6093 | padding = NULL_TREE; |
01955e96 MM |
6094 | |
6095 | /* If this field is a bit-field whose width is greater than its | |
3461fba7 NS |
6096 | type, then there are some special rules for allocating |
6097 | it. */ | |
01955e96 | 6098 | if (DECL_C_BIT_FIELD (field) |
807e902e | 6099 | && tree_int_cst_lt (TYPE_SIZE (type), DECL_SIZE (field))) |
01955e96 | 6100 | { |
09639a83 | 6101 | unsigned int itk; |
01955e96 | 6102 | tree integer_type; |
555456b1 | 6103 | bool was_unnamed_p = false; |
01955e96 MM |
6104 | /* We must allocate the bits as if suitably aligned for the |
6105 | longest integer type that fits in this many bits. type | |
6106 | of the field. Then, we are supposed to use the left over | |
6107 | bits as additional padding. */ | |
6108 | for (itk = itk_char; itk != itk_none; ++itk) | |
64c31785 | 6109 | if (integer_types[itk] != NULL_TREE |
807e902e KZ |
6110 | && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE), |
6111 | TYPE_SIZE (integer_types[itk])) | |
6112 | || tree_int_cst_lt (DECL_SIZE (field), | |
6113 | TYPE_SIZE (integer_types[itk])))) | |
01955e96 MM |
6114 | break; |
6115 | ||
6116 | /* ITK now indicates a type that is too large for the | |
6117 | field. We have to back up by one to find the largest | |
6118 | type that fits. */ | |
64c31785 KT |
6119 | do |
6120 | { | |
6121 | --itk; | |
6122 | integer_type = integer_types[itk]; | |
6123 | } while (itk > 0 && integer_type == NULL_TREE); | |
2d3e278d | 6124 | |
90d84934 JM |
6125 | /* Figure out how much additional padding is required. */ |
6126 | if (tree_int_cst_lt (TYPE_SIZE (integer_type), DECL_SIZE (field))) | |
2d3e278d | 6127 | { |
90d84934 | 6128 | if (TREE_CODE (t) == UNION_TYPE) |
1e099144 MM |
6129 | /* In a union, the padding field must have the full width |
6130 | of the bit-field; all fields start at offset zero. */ | |
6131 | padding = DECL_SIZE (field); | |
6132 | else | |
90d84934 JM |
6133 | padding = size_binop (MINUS_EXPR, DECL_SIZE (field), |
6134 | TYPE_SIZE (integer_type)); | |
2d3e278d | 6135 | } |
c9372112 | 6136 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
63e5f567 MM |
6137 | /* An unnamed bitfield does not normally affect the |
6138 | alignment of the containing class on a target where | |
6139 | PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not | |
6140 | make any exceptions for unnamed bitfields when the | |
6141 | bitfields are longer than their types. Therefore, we | |
6142 | temporarily give the field a name. */ | |
6143 | if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field)) | |
6144 | { | |
6145 | was_unnamed_p = true; | |
6146 | DECL_NAME (field) = make_anon_name (); | |
6147 | } | |
c9372112 | 6148 | #endif |
01955e96 MM |
6149 | DECL_SIZE (field) = TYPE_SIZE (integer_type); |
6150 | DECL_ALIGN (field) = TYPE_ALIGN (integer_type); | |
11cf4d18 | 6151 | DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type); |
555456b1 MM |
6152 | layout_nonempty_base_or_field (rli, field, NULL_TREE, |
6153 | empty_base_offsets); | |
6154 | if (was_unnamed_p) | |
6155 | DECL_NAME (field) = NULL_TREE; | |
6156 | /* Now that layout has been performed, set the size of the | |
6157 | field to the size of its declared type; the rest of the | |
6158 | field is effectively invisible. */ | |
6159 | DECL_SIZE (field) = TYPE_SIZE (type); | |
29edb15c | 6160 | /* We must also reset the DECL_MODE of the field. */ |
90d84934 | 6161 | DECL_MODE (field) = TYPE_MODE (type); |
01955e96 | 6162 | } |
555456b1 MM |
6163 | else |
6164 | layout_nonempty_base_or_field (rli, field, NULL_TREE, | |
6165 | empty_base_offsets); | |
01955e96 | 6166 | |
2003cd37 | 6167 | /* Remember the location of any empty classes in FIELD. */ |
90d84934 JM |
6168 | record_subobject_offsets (TREE_TYPE (field), |
6169 | byte_position(field), | |
6170 | empty_base_offsets, | |
6171 | /*is_data_member=*/true); | |
2003cd37 | 6172 | |
eca7f13c MM |
6173 | /* If a bit-field does not immediately follow another bit-field, |
6174 | and yet it starts in the middle of a byte, we have failed to | |
6175 | comply with the ABI. */ | |
6176 | if (warn_abi | |
c8094d83 | 6177 | && DECL_C_BIT_FIELD (field) |
660845bf ZL |
6178 | /* The TREE_NO_WARNING flag gets set by Objective-C when |
6179 | laying out an Objective-C class. The ObjC ABI differs | |
6180 | from the C++ ABI, and so we do not want a warning | |
6181 | here. */ | |
6182 | && !TREE_NO_WARNING (field) | |
eca7f13c MM |
6183 | && !last_field_was_bitfield |
6184 | && !integer_zerop (size_binop (TRUNC_MOD_EXPR, | |
6185 | DECL_FIELD_BIT_OFFSET (field), | |
6186 | bitsize_unit_node))) | |
74fa0285 | 6187 | warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may " |
dee15844 | 6188 | "change in a future version of GCC", field); |
eca7f13c | 6189 | |
38a4afee MM |
6190 | /* The middle end uses the type of expressions to determine the |
6191 | possible range of expression values. In order to optimize | |
6192 | "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end | |
3db45ab5 | 6193 | must be made aware of the width of "i", via its type. |
38a4afee | 6194 | |
3db45ab5 | 6195 | Because C++ does not have integer types of arbitrary width, |
38a4afee MM |
6196 | we must (for the purposes of the front end) convert from the |
6197 | type assigned here to the declared type of the bitfield | |
6198 | whenever a bitfield expression is used as an rvalue. | |
6199 | Similarly, when assigning a value to a bitfield, the value | |
6200 | must be converted to the type given the bitfield here. */ | |
6201 | if (DECL_C_BIT_FIELD (field)) | |
6202 | { | |
38a4afee | 6203 | unsigned HOST_WIDE_INT width; |
24030e4c | 6204 | tree ftype = TREE_TYPE (field); |
ae7e9ddd | 6205 | width = tree_to_uhwi (DECL_SIZE (field)); |
38a4afee | 6206 | if (width != TYPE_PRECISION (ftype)) |
24030e4c JJ |
6207 | { |
6208 | TREE_TYPE (field) | |
6209 | = c_build_bitfield_integer_type (width, | |
6210 | TYPE_UNSIGNED (ftype)); | |
6211 | TREE_TYPE (field) | |
6212 | = cp_build_qualified_type (TREE_TYPE (field), | |
a3360e77 | 6213 | cp_type_quals (ftype)); |
24030e4c | 6214 | } |
38a4afee MM |
6215 | } |
6216 | ||
01955e96 MM |
6217 | /* If we needed additional padding after this field, add it |
6218 | now. */ | |
6219 | if (padding) | |
6220 | { | |
6221 | tree padding_field; | |
6222 | ||
c2255bc4 AH |
6223 | padding_field = build_decl (input_location, |
6224 | FIELD_DECL, | |
01955e96 | 6225 | NULL_TREE, |
c8094d83 | 6226 | char_type_node); |
01955e96 MM |
6227 | DECL_BIT_FIELD (padding_field) = 1; |
6228 | DECL_SIZE (padding_field) = padding; | |
1e099144 | 6229 | DECL_CONTEXT (padding_field) = t; |
ea258926 | 6230 | DECL_ARTIFICIAL (padding_field) = 1; |
78e0d62b | 6231 | DECL_IGNORED_P (padding_field) = 1; |
c20118a8 | 6232 | layout_nonempty_base_or_field (rli, padding_field, |
c8094d83 | 6233 | NULL_TREE, |
17bbb839 | 6234 | empty_base_offsets); |
01955e96 | 6235 | } |
eca7f13c MM |
6236 | |
6237 | last_field_was_bitfield = DECL_C_BIT_FIELD (field); | |
5c24fba6 MM |
6238 | } |
6239 | ||
90d84934 | 6240 | if (!integer_zerop (rli->bitpos)) |
e3ccdd50 MM |
6241 | { |
6242 | /* Make sure that we are on a byte boundary so that the size of | |
6243 | the class without virtual bases will always be a round number | |
6244 | of bytes. */ | |
db3927fb | 6245 | rli->bitpos = round_up_loc (input_location, rli->bitpos, BITS_PER_UNIT); |
e3ccdd50 MM |
6246 | normalize_rli (rli); |
6247 | } | |
17bbb839 | 6248 | |
3ef397c1 MM |
6249 | /* Delete all zero-width bit-fields from the list of fields. Now |
6250 | that the type is laid out they are no longer important. */ | |
6251 | remove_zero_width_bit_fields (t); | |
6252 | ||
17bbb839 | 6253 | /* Create the version of T used for virtual bases. We do not use |
9e1e64ec | 6254 | make_class_type for this version; this is an artificial type. For |
17bbb839 | 6255 | a POD type, we just reuse T. */ |
c32097d8 | 6256 | if (CLASSTYPE_NON_LAYOUT_POD_P (t) || CLASSTYPE_EMPTY_P (t)) |
06ceef4e | 6257 | { |
17bbb839 | 6258 | base_t = make_node (TREE_CODE (t)); |
c8094d83 | 6259 | |
90d84934 JM |
6260 | /* Set the size and alignment for the new type. */ |
6261 | tree eoc; | |
6262 | ||
6263 | /* If the ABI version is not at least two, and the last | |
6264 | field was a bit-field, RLI may not be on a byte | |
6265 | boundary. In particular, rli_size_unit_so_far might | |
6266 | indicate the last complete byte, while rli_size_so_far | |
6267 | indicates the total number of bits used. Therefore, | |
6268 | rli_size_so_far, rather than rli_size_unit_so_far, is | |
6269 | used to compute TYPE_SIZE_UNIT. */ | |
6270 | eoc = end_of_class (t, /*include_virtuals_p=*/0); | |
6271 | TYPE_SIZE_UNIT (base_t) | |
6272 | = size_binop (MAX_EXPR, | |
6273 | convert (sizetype, | |
6274 | size_binop (CEIL_DIV_EXPR, | |
6275 | rli_size_so_far (rli), | |
6276 | bitsize_int (BITS_PER_UNIT))), | |
6277 | eoc); | |
6278 | TYPE_SIZE (base_t) | |
6279 | = size_binop (MAX_EXPR, | |
6280 | rli_size_so_far (rli), | |
6281 | size_binop (MULT_EXPR, | |
6282 | convert (bitsizetype, eoc), | |
6283 | bitsize_int (BITS_PER_UNIT))); | |
17bbb839 MM |
6284 | TYPE_ALIGN (base_t) = rli->record_align; |
6285 | TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t); | |
6286 | ||
6287 | /* Copy the fields from T. */ | |
6288 | next_field = &TYPE_FIELDS (base_t); | |
910ad8de | 6289 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
17bbb839 MM |
6290 | if (TREE_CODE (field) == FIELD_DECL) |
6291 | { | |
c2255bc4 AH |
6292 | *next_field = build_decl (input_location, |
6293 | FIELD_DECL, | |
c8094d83 | 6294 | DECL_NAME (field), |
17bbb839 MM |
6295 | TREE_TYPE (field)); |
6296 | DECL_CONTEXT (*next_field) = base_t; | |
6297 | DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field); | |
6298 | DECL_FIELD_BIT_OFFSET (*next_field) | |
6299 | = DECL_FIELD_BIT_OFFSET (field); | |
4f0a2b81 MM |
6300 | DECL_SIZE (*next_field) = DECL_SIZE (field); |
6301 | DECL_MODE (*next_field) = DECL_MODE (field); | |
910ad8de | 6302 | next_field = &DECL_CHAIN (*next_field); |
17bbb839 MM |
6303 | } |
6304 | ||
6305 | /* Record the base version of the type. */ | |
6306 | CLASSTYPE_AS_BASE (t) = base_t; | |
5a5cccaa | 6307 | TYPE_CONTEXT (base_t) = t; |
83b14b88 | 6308 | } |
1f84ec23 | 6309 | else |
17bbb839 | 6310 | CLASSTYPE_AS_BASE (t) = t; |
0b41abe6 | 6311 | |
5ec1192e MM |
6312 | /* Every empty class contains an empty class. */ |
6313 | if (CLASSTYPE_EMPTY_P (t)) | |
6314 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
6315 | ||
8d08fdba MS |
6316 | /* Set the TYPE_DECL for this type to contain the right |
6317 | value for DECL_OFFSET, so that we can use it as part | |
6318 | of a COMPONENT_REF for multiple inheritance. */ | |
d2e5ee5c | 6319 | layout_decl (TYPE_MAIN_DECL (t), 0); |
8d08fdba | 6320 | |
7177d104 MS |
6321 | /* Now fix up any virtual base class types that we left lying |
6322 | around. We must get these done before we try to lay out the | |
5c24fba6 MM |
6323 | virtual function table. As a side-effect, this will remove the |
6324 | base subobject fields. */ | |
17bbb839 MM |
6325 | layout_virtual_bases (rli, empty_base_offsets); |
6326 | ||
c8094d83 | 6327 | /* Make sure that empty classes are reflected in RLI at this |
17bbb839 MM |
6328 | point. */ |
6329 | include_empty_classes(rli); | |
6330 | ||
6331 | /* Make sure not to create any structures with zero size. */ | |
58731fd1 | 6332 | if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t)) |
c8094d83 | 6333 | place_field (rli, |
c2255bc4 AH |
6334 | build_decl (input_location, |
6335 | FIELD_DECL, NULL_TREE, char_type_node)); | |
17bbb839 | 6336 | |
a402c1b1 JM |
6337 | /* If this is a non-POD, declaring it packed makes a difference to how it |
6338 | can be used as a field; don't let finalize_record_size undo it. */ | |
6339 | if (TYPE_PACKED (t) && !layout_pod_type_p (t)) | |
6340 | rli->packed_maybe_necessary = true; | |
6341 | ||
3b426391 | 6342 | /* Let the back end lay out the type. */ |
17bbb839 | 6343 | finish_record_layout (rli, /*free_p=*/true); |
9785e4b1 | 6344 | |
26d40c3d JM |
6345 | if (TYPE_SIZE_UNIT (t) |
6346 | && TREE_CODE (TYPE_SIZE_UNIT (t)) == INTEGER_CST | |
6347 | && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t)) | |
6348 | && !valid_constant_size_p (TYPE_SIZE_UNIT (t))) | |
6349 | error ("type %qT is too large", t); | |
6350 | ||
17bbb839 MM |
6351 | /* Warn about bases that can't be talked about due to ambiguity. */ |
6352 | warn_about_ambiguous_bases (t); | |
78b45a24 | 6353 | |
00bfffa4 | 6354 | /* Now that we're done with layout, give the base fields the real types. */ |
910ad8de | 6355 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
6356 | if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field))) |
6357 | TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field)); | |
6358 | ||
9785e4b1 | 6359 | /* Clean up. */ |
c20118a8 | 6360 | splay_tree_delete (empty_base_offsets); |
c5a35c3c MM |
6361 | |
6362 | if (CLASSTYPE_EMPTY_P (t) | |
3db45ab5 | 6363 | && tree_int_cst_lt (sizeof_biggest_empty_class, |
c0572427 MM |
6364 | TYPE_SIZE_UNIT (t))) |
6365 | sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t); | |
2ef16140 | 6366 | } |
c35cce41 | 6367 | |
af287697 MM |
6368 | /* Determine the "key method" for the class type indicated by TYPE, |
6369 | and set CLASSTYPE_KEY_METHOD accordingly. */ | |
9aad8f83 | 6370 | |
af287697 MM |
6371 | void |
6372 | determine_key_method (tree type) | |
9aad8f83 MA |
6373 | { |
6374 | tree method; | |
6375 | ||
6376 | if (TYPE_FOR_JAVA (type) | |
6377 | || processing_template_decl | |
6378 | || CLASSTYPE_TEMPLATE_INSTANTIATION (type) | |
6379 | || CLASSTYPE_INTERFACE_KNOWN (type)) | |
af287697 | 6380 | return; |
9aad8f83 | 6381 | |
af287697 MM |
6382 | /* The key method is the first non-pure virtual function that is not |
6383 | inline at the point of class definition. On some targets the | |
6384 | key function may not be inline; those targets should not call | |
6385 | this function until the end of the translation unit. */ | |
9aad8f83 | 6386 | for (method = TYPE_METHODS (type); method != NULL_TREE; |
910ad8de | 6387 | method = DECL_CHAIN (method)) |
aaf8a23e JH |
6388 | if (TREE_CODE (method) == FUNCTION_DECL |
6389 | && DECL_VINDEX (method) != NULL_TREE | |
9aad8f83 MA |
6390 | && ! DECL_DECLARED_INLINE_P (method) |
6391 | && ! DECL_PURE_VIRTUAL_P (method)) | |
af287697 MM |
6392 | { |
6393 | CLASSTYPE_KEY_METHOD (type) = method; | |
6394 | break; | |
6395 | } | |
9aad8f83 | 6396 | |
af287697 | 6397 | return; |
9aad8f83 MA |
6398 | } |
6399 | ||
385b73ab DN |
6400 | |
6401 | /* Allocate and return an instance of struct sorted_fields_type with | |
6402 | N fields. */ | |
6403 | ||
6404 | static struct sorted_fields_type * | |
6405 | sorted_fields_type_new (int n) | |
6406 | { | |
6407 | struct sorted_fields_type *sft; | |
766090c2 | 6408 | sft = (sorted_fields_type *) ggc_internal_alloc (sizeof (sorted_fields_type) |
385b73ab DN |
6409 | + n * sizeof (tree)); |
6410 | sft->len = n; | |
6411 | ||
6412 | return sft; | |
6413 | } | |
6414 | ||
6415 | ||
548502d3 MM |
6416 | /* Perform processing required when the definition of T (a class type) |
6417 | is complete. */ | |
2ef16140 MM |
6418 | |
6419 | void | |
94edc4ab | 6420 | finish_struct_1 (tree t) |
2ef16140 MM |
6421 | { |
6422 | tree x; | |
00a17e31 | 6423 | /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */ |
e6858a84 | 6424 | tree virtuals = NULL_TREE; |
2ef16140 | 6425 | |
d0f062fb | 6426 | if (COMPLETE_TYPE_P (t)) |
2ef16140 | 6427 | { |
9e1e64ec | 6428 | gcc_assert (MAYBE_CLASS_TYPE_P (t)); |
1f070f2b | 6429 | error ("redefinition of %q#T", t); |
2ef16140 MM |
6430 | popclass (); |
6431 | return; | |
6432 | } | |
6433 | ||
2ef16140 MM |
6434 | /* If this type was previously laid out as a forward reference, |
6435 | make sure we lay it out again. */ | |
2ef16140 | 6436 | TYPE_SIZE (t) = NULL_TREE; |
911a71a7 | 6437 | CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE; |
2ef16140 | 6438 | |
5ec1192e MM |
6439 | /* Make assumptions about the class; we'll reset the flags if |
6440 | necessary. */ | |
58731fd1 MM |
6441 | CLASSTYPE_EMPTY_P (t) = 1; |
6442 | CLASSTYPE_NEARLY_EMPTY_P (t) = 1; | |
5ec1192e | 6443 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0; |
3b49d762 | 6444 | CLASSTYPE_LITERAL_P (t) = true; |
58731fd1 | 6445 | |
2ef16140 | 6446 | /* Do end-of-class semantic processing: checking the validity of the |
03702748 | 6447 | bases and members and add implicitly generated methods. */ |
58731fd1 | 6448 | check_bases_and_members (t); |
2ef16140 | 6449 | |
f4f206f4 | 6450 | /* Find the key method. */ |
a63996f1 | 6451 | if (TYPE_CONTAINS_VPTR_P (t)) |
9aad8f83 | 6452 | { |
af287697 MM |
6453 | /* The Itanium C++ ABI permits the key method to be chosen when |
6454 | the class is defined -- even though the key method so | |
6455 | selected may later turn out to be an inline function. On | |
6456 | some systems (such as ARM Symbian OS) the key method cannot | |
6457 | be determined until the end of the translation unit. On such | |
6458 | systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which | |
6459 | will cause the class to be added to KEYED_CLASSES. Then, in | |
6460 | finish_file we will determine the key method. */ | |
6461 | if (targetm.cxx.key_method_may_be_inline ()) | |
6462 | determine_key_method (t); | |
9aad8f83 MA |
6463 | |
6464 | /* If a polymorphic class has no key method, we may emit the vtable | |
5796bf34 JM |
6465 | in every translation unit where the class definition appears. If |
6466 | we're devirtualizing, we can look into the vtable even if we | |
6467 | aren't emitting it. */ | |
a41844e5 | 6468 | if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE) |
9aad8f83 MA |
6469 | keyed_classes = tree_cons (NULL_TREE, t, keyed_classes); |
6470 | } | |
6471 | ||
2ef16140 | 6472 | /* Layout the class itself. */ |
e93ee644 | 6473 | layout_class_type (t, &virtuals); |
a0c68737 NS |
6474 | if (CLASSTYPE_AS_BASE (t) != t) |
6475 | /* We use the base type for trivial assignments, and hence it | |
6476 | needs a mode. */ | |
6477 | compute_record_mode (CLASSTYPE_AS_BASE (t)); | |
8ebeee52 | 6478 | |
e93ee644 | 6479 | virtuals = modify_all_vtables (t, nreverse (virtuals)); |
db5ae43f | 6480 | |
5e19c053 | 6481 | /* If necessary, create the primary vtable for this class. */ |
e6858a84 | 6482 | if (virtuals || TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 6483 | { |
8d08fdba | 6484 | /* We must enter these virtuals into the table. */ |
3ef397c1 | 6485 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
da3d4dfa | 6486 | build_primary_vtable (NULL_TREE, t); |
dbbf88d1 | 6487 | else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t))) |
0533d788 MM |
6488 | /* Here we know enough to change the type of our virtual |
6489 | function table, but we will wait until later this function. */ | |
28531dd0 | 6490 | build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t); |
d3061adb JM |
6491 | |
6492 | /* If we're warning about ABI tags, check the types of the new | |
6493 | virtual functions. */ | |
6494 | if (warn_abi_tag) | |
6495 | for (tree v = virtuals; v; v = TREE_CHAIN (v)) | |
6496 | check_abi_tags (t, TREE_VALUE (v)); | |
8d08fdba MS |
6497 | } |
6498 | ||
bbd15aac | 6499 | if (TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 6500 | { |
e93ee644 MM |
6501 | int vindex; |
6502 | tree fn; | |
6503 | ||
604a3205 | 6504 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
50bc768d | 6505 | gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t)))); |
1eb4bea9 | 6506 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
50bc768d | 6507 | gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE); |
1eb4bea9 | 6508 | |
e6858a84 | 6509 | /* Add entries for virtual functions introduced by this class. */ |
604a3205 NS |
6510 | BINFO_VIRTUALS (TYPE_BINFO (t)) |
6511 | = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals); | |
e93ee644 MM |
6512 | |
6513 | /* Set DECL_VINDEX for all functions declared in this class. */ | |
c8094d83 MS |
6514 | for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t)); |
6515 | fn; | |
6516 | fn = TREE_CHAIN (fn), | |
e93ee644 MM |
6517 | vindex += (TARGET_VTABLE_USES_DESCRIPTORS |
6518 | ? TARGET_VTABLE_USES_DESCRIPTORS : 1)) | |
4977bab6 ZW |
6519 | { |
6520 | tree fndecl = BV_FN (fn); | |
6521 | ||
6522 | if (DECL_THUNK_P (fndecl)) | |
6523 | /* A thunk. We should never be calling this entry directly | |
6524 | from this vtable -- we'd use the entry for the non | |
6525 | thunk base function. */ | |
6526 | DECL_VINDEX (fndecl) = NULL_TREE; | |
6527 | else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST) | |
7d60be94 | 6528 | DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex); |
4977bab6 | 6529 | } |
8d08fdba MS |
6530 | } |
6531 | ||
d2c5305b | 6532 | finish_struct_bits (t); |
0a35513e | 6533 | set_method_tm_attributes (t); |
8d08fdba | 6534 | |
f30432d7 MS |
6535 | /* Complete the rtl for any static member objects of the type we're |
6536 | working on. */ | |
910ad8de | 6537 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) |
5a6ccc94 | 6538 | if (VAR_P (x) && TREE_STATIC (x) |
650fcd07 | 6539 | && TREE_TYPE (x) != error_mark_node |
c7f4981a | 6540 | && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t)) |
19e7881c | 6541 | DECL_MODE (x) = TYPE_MODE (t); |
8d08fdba | 6542 | |
f90cdf34 | 6543 | /* Done with FIELDS...now decide whether to sort these for |
58010b57 | 6544 | faster lookups later. |
f90cdf34 | 6545 | |
6c73ad72 | 6546 | We use a small number because most searches fail (succeeding |
f90cdf34 MT |
6547 | ultimately as the search bores through the inheritance |
6548 | hierarchy), and we want this failure to occur quickly. */ | |
6549 | ||
cba0366c | 6550 | insert_into_classtype_sorted_fields (TYPE_FIELDS (t), t, 8); |
f90cdf34 | 6551 | |
b9e75696 JM |
6552 | /* Complain if one of the field types requires lower visibility. */ |
6553 | constrain_class_visibility (t); | |
6554 | ||
8d7a5379 MM |
6555 | /* Make the rtl for any new vtables we have created, and unmark |
6556 | the base types we marked. */ | |
6557 | finish_vtbls (t); | |
c8094d83 | 6558 | |
23656158 MM |
6559 | /* Build the VTT for T. */ |
6560 | build_vtt (t); | |
8d7a5379 | 6561 | |
f03e8526 MM |
6562 | /* This warning does not make sense for Java classes, since they |
6563 | cannot have destructors. */ | |
880a467b | 6564 | if (!TYPE_FOR_JAVA (t) && warn_nonvdtor |
abce9208 PC |
6565 | && TYPE_POLYMORPHIC_P (t) && accessible_nvdtor_p (t) |
6566 | && !CLASSTYPE_FINAL (t)) | |
880a467b NS |
6567 | warning (OPT_Wnon_virtual_dtor, |
6568 | "%q#T has virtual functions and accessible" | |
6569 | " non-virtual destructor", t); | |
8d08fdba | 6570 | |
0154eaa8 | 6571 | complete_vars (t); |
8d08fdba | 6572 | |
9e9ff709 MS |
6573 | if (warn_overloaded_virtual) |
6574 | warn_hidden (t); | |
8d08fdba | 6575 | |
43d9ad1d DS |
6576 | /* Class layout, assignment of virtual table slots, etc., is now |
6577 | complete. Give the back end a chance to tweak the visibility of | |
6578 | the class or perform any other required target modifications. */ | |
6579 | targetm.cxx.adjust_class_at_definition (t); | |
6580 | ||
ae673f14 | 6581 | maybe_suppress_debug_info (t); |
8d08fdba | 6582 | |
2077db1b CT |
6583 | if (flag_vtable_verify) |
6584 | vtv_save_class_info (t); | |
6585 | ||
b7442fb5 | 6586 | dump_class_hierarchy (t); |
c8094d83 | 6587 | |
d2e5ee5c | 6588 | /* Finish debugging output for this type. */ |
881c6935 | 6589 | rest_of_type_compilation (t, ! LOCAL_CLASS_P (t)); |
bfcbe068 | 6590 | |
e7b6bcf3 | 6591 | if (TYPE_TRANSPARENT_AGGR (t)) |
bfcbe068 | 6592 | { |
e7b6bcf3 JJ |
6593 | tree field = first_field (t); |
6594 | if (field == NULL_TREE || error_operand_p (field)) | |
6595 | { | |
42b40eff | 6596 | error ("type transparent %q#T does not have any fields", t); |
e7b6bcf3 JJ |
6597 | TYPE_TRANSPARENT_AGGR (t) = 0; |
6598 | } | |
6599 | else if (DECL_ARTIFICIAL (field)) | |
6600 | { | |
6601 | if (DECL_FIELD_IS_BASE (field)) | |
6602 | error ("type transparent class %qT has base classes", t); | |
6603 | else | |
6604 | { | |
6605 | gcc_checking_assert (DECL_VIRTUAL_P (field)); | |
6606 | error ("type transparent class %qT has virtual functions", t); | |
6607 | } | |
6608 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6609 | } | |
42b40eff PC |
6610 | else if (TYPE_MODE (t) != DECL_MODE (field)) |
6611 | { | |
6612 | error ("type transparent %q#T cannot be made transparent because " | |
6613 | "the type of the first field has a different ABI from the " | |
6614 | "class overall", t); | |
6615 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6616 | } | |
bfcbe068 | 6617 | } |
8d08fdba | 6618 | } |
f30432d7 | 6619 | |
cba0366c FC |
6620 | /* Insert FIELDS into T for the sorted case if the FIELDS count is |
6621 | equal to THRESHOLD or greater than THRESHOLD. */ | |
6622 | ||
6623 | static void | |
6624 | insert_into_classtype_sorted_fields (tree fields, tree t, int threshold) | |
6625 | { | |
6626 | int n_fields = count_fields (fields); | |
6627 | if (n_fields >= threshold) | |
6628 | { | |
6629 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); | |
6630 | add_fields_to_record_type (fields, field_vec, 0); | |
6631 | qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp); | |
6632 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; | |
6633 | } | |
6634 | } | |
6635 | ||
6636 | /* Insert lately defined enum ENUMTYPE into T for the sorted case. */ | |
6637 | ||
6638 | void | |
6639 | insert_late_enum_def_into_classtype_sorted_fields (tree enumtype, tree t) | |
6640 | { | |
6641 | struct sorted_fields_type *sorted_fields = CLASSTYPE_SORTED_FIELDS (t); | |
6642 | if (sorted_fields) | |
6643 | { | |
6644 | int i; | |
6645 | int n_fields | |
6646 | = list_length (TYPE_VALUES (enumtype)) + sorted_fields->len; | |
6647 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); | |
6648 | ||
6649 | for (i = 0; i < sorted_fields->len; ++i) | |
6650 | field_vec->elts[i] = sorted_fields->elts[i]; | |
6651 | ||
6652 | add_enum_fields_to_record_type (enumtype, field_vec, | |
6653 | sorted_fields->len); | |
6654 | qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp); | |
6655 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; | |
6656 | } | |
6657 | } | |
6658 | ||
61a127b3 MM |
6659 | /* When T was built up, the member declarations were added in reverse |
6660 | order. Rearrange them to declaration order. */ | |
6661 | ||
6662 | void | |
94edc4ab | 6663 | unreverse_member_declarations (tree t) |
61a127b3 MM |
6664 | { |
6665 | tree next; | |
6666 | tree prev; | |
6667 | tree x; | |
6668 | ||
7088fca9 KL |
6669 | /* The following lists are all in reverse order. Put them in |
6670 | declaration order now. */ | |
61a127b3 | 6671 | TYPE_METHODS (t) = nreverse (TYPE_METHODS (t)); |
7088fca9 | 6672 | CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t)); |
61a127b3 MM |
6673 | |
6674 | /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in | |
6675 | reverse order, so we can't just use nreverse. */ | |
6676 | prev = NULL_TREE; | |
c8094d83 MS |
6677 | for (x = TYPE_FIELDS (t); |
6678 | x && TREE_CODE (x) != TYPE_DECL; | |
61a127b3 MM |
6679 | x = next) |
6680 | { | |
910ad8de NF |
6681 | next = DECL_CHAIN (x); |
6682 | DECL_CHAIN (x) = prev; | |
61a127b3 MM |
6683 | prev = x; |
6684 | } | |
6685 | if (prev) | |
6686 | { | |
910ad8de | 6687 | DECL_CHAIN (TYPE_FIELDS (t)) = x; |
61a127b3 MM |
6688 | if (prev) |
6689 | TYPE_FIELDS (t) = prev; | |
6690 | } | |
6691 | } | |
6692 | ||
f30432d7 | 6693 | tree |
94edc4ab | 6694 | finish_struct (tree t, tree attributes) |
f30432d7 | 6695 | { |
82a98427 | 6696 | location_t saved_loc = input_location; |
1f0d71c5 | 6697 | |
61a127b3 MM |
6698 | /* Now that we've got all the field declarations, reverse everything |
6699 | as necessary. */ | |
6700 | unreverse_member_declarations (t); | |
f30432d7 | 6701 | |
91d231cb | 6702 | cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); |
6467930b | 6703 | |
1f0d71c5 NS |
6704 | /* Nadger the current location so that diagnostics point to the start of |
6705 | the struct, not the end. */ | |
f31686a3 | 6706 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t)); |
1f0d71c5 | 6707 | |
5566b478 | 6708 | if (processing_template_decl) |
f30432d7 | 6709 | { |
7fb213d8 GB |
6710 | tree x; |
6711 | ||
b0e0b31f | 6712 | finish_struct_methods (t); |
867580ce | 6713 | TYPE_SIZE (t) = bitsize_zero_node; |
ae54ec16 | 6714 | TYPE_SIZE_UNIT (t) = size_zero_node; |
7fb213d8 GB |
6715 | |
6716 | /* We need to emit an error message if this type was used as a parameter | |
6717 | and it is an abstract type, even if it is a template. We construct | |
6718 | a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into | |
6719 | account and we call complete_vars with this type, which will check | |
6720 | the PARM_DECLS. Note that while the type is being defined, | |
6721 | CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends | |
6722 | (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */ | |
585b44d3 | 6723 | CLASSTYPE_PURE_VIRTUALS (t) = NULL; |
910ad8de | 6724 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
7fb213d8 | 6725 | if (DECL_PURE_VIRTUAL_P (x)) |
9771b263 | 6726 | vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x); |
7fb213d8 | 6727 | complete_vars (t); |
e58d4228 JM |
6728 | /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if |
6729 | an enclosing scope is a template class, so that this function be | |
6730 | found by lookup_fnfields_1 when the using declaration is not | |
6731 | instantiated yet. */ | |
6732 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) | |
6733 | if (TREE_CODE (x) == USING_DECL) | |
6734 | { | |
6735 | tree fn = strip_using_decl (x); | |
6736 | if (is_overloaded_fn (fn)) | |
6737 | for (; fn; fn = OVL_NEXT (fn)) | |
6738 | add_method (t, OVL_CURRENT (fn), x); | |
6739 | } | |
040ca4b3 JM |
6740 | |
6741 | /* Remember current #pragma pack value. */ | |
6742 | TYPE_PRECISION (t) = maximum_field_alignment; | |
947296ca JM |
6743 | |
6744 | /* Fix up any variants we've already built. */ | |
6745 | for (x = TYPE_NEXT_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x)) | |
6746 | { | |
6747 | TYPE_SIZE (x) = TYPE_SIZE (t); | |
6748 | TYPE_SIZE_UNIT (x) = TYPE_SIZE_UNIT (t); | |
6749 | TYPE_FIELDS (x) = TYPE_FIELDS (t); | |
6750 | TYPE_METHODS (x) = TYPE_METHODS (t); | |
6751 | } | |
6f1b4c42 | 6752 | } |
f30432d7 | 6753 | else |
9f33663b | 6754 | finish_struct_1 (t); |
5566b478 | 6755 | |
0090caca JM |
6756 | if (is_std_init_list (t)) |
6757 | { | |
6758 | /* People keep complaining that the compiler crashes on an invalid | |
6759 | definition of initializer_list, so I guess we should explicitly | |
6760 | reject it. What the compiler internals care about is that it's a | |
6761 | template and has a pointer field followed by an integer field. */ | |
6762 | bool ok = false; | |
6763 | if (processing_template_decl) | |
6764 | { | |
6765 | tree f = next_initializable_field (TYPE_FIELDS (t)); | |
6766 | if (f && TREE_CODE (TREE_TYPE (f)) == POINTER_TYPE) | |
6767 | { | |
6768 | f = next_initializable_field (DECL_CHAIN (f)); | |
6769 | if (f && TREE_CODE (TREE_TYPE (f)) == INTEGER_TYPE) | |
6770 | ok = true; | |
6771 | } | |
6772 | } | |
6773 | if (!ok) | |
6774 | fatal_error ("definition of std::initializer_list does not match " | |
6775 | "#include <initializer_list>"); | |
6776 | } | |
6777 | ||
82a98427 | 6778 | input_location = saved_loc; |
1f0d71c5 | 6779 | |
5566b478 | 6780 | TYPE_BEING_DEFINED (t) = 0; |
8f032717 | 6781 | |
5566b478 | 6782 | if (current_class_type) |
b74a0560 | 6783 | popclass (); |
5566b478 | 6784 | else |
357351e5 | 6785 | error ("trying to finish struct, but kicked out due to previous parse errors"); |
5566b478 | 6786 | |
637f68e8 JM |
6787 | if (processing_template_decl && at_function_scope_p () |
6788 | /* Lambdas are defined by the LAMBDA_EXPR. */ | |
6789 | && !LAMBDA_TYPE_P (t)) | |
5f261ba9 | 6790 | add_stmt (build_min (TAG_DEFN, t)); |
ae673f14 | 6791 | |
5566b478 | 6792 | return t; |
f30432d7 | 6793 | } |
8d08fdba | 6794 | \f |
abcc192b | 6795 | /* Hash table to avoid endless recursion when handling references. */ |
c203e8a7 | 6796 | static hash_table<pointer_hash<tree_node> > *fixed_type_or_null_ref_ht; |
abcc192b | 6797 | |
51ddb82e | 6798 | /* Return the dynamic type of INSTANCE, if known. |
8d08fdba MS |
6799 | Used to determine whether the virtual function table is needed |
6800 | or not. | |
6801 | ||
6802 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6803 | of our knowledge of its type. *NONNULL should be initialized |
6804 | before this function is called. */ | |
e92cc029 | 6805 | |
d8e178a0 | 6806 | static tree |
555551c2 | 6807 | fixed_type_or_null (tree instance, int *nonnull, int *cdtorp) |
8d08fdba | 6808 | { |
555551c2 MM |
6809 | #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp) |
6810 | ||
8d08fdba MS |
6811 | switch (TREE_CODE (instance)) |
6812 | { | |
6813 | case INDIRECT_REF: | |
608afcc5 | 6814 | if (POINTER_TYPE_P (TREE_TYPE (instance))) |
a0de9d20 JM |
6815 | return NULL_TREE; |
6816 | else | |
555551c2 | 6817 | return RECUR (TREE_OPERAND (instance, 0)); |
a0de9d20 | 6818 | |
8d08fdba MS |
6819 | case CALL_EXPR: |
6820 | /* This is a call to a constructor, hence it's never zero. */ | |
6821 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6822 | { | |
6823 | if (nonnull) | |
6824 | *nonnull = 1; | |
51ddb82e | 6825 | return TREE_TYPE (instance); |
8d08fdba | 6826 | } |
51ddb82e | 6827 | return NULL_TREE; |
8d08fdba MS |
6828 | |
6829 | case SAVE_EXPR: | |
6830 | /* This is a call to a constructor, hence it's never zero. */ | |
6831 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6832 | { | |
6833 | if (nonnull) | |
6834 | *nonnull = 1; | |
51ddb82e | 6835 | return TREE_TYPE (instance); |
8d08fdba | 6836 | } |
555551c2 | 6837 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba | 6838 | |
5be014d5 | 6839 | case POINTER_PLUS_EXPR: |
8d08fdba MS |
6840 | case PLUS_EXPR: |
6841 | case MINUS_EXPR: | |
394fd776 | 6842 | if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR) |
555551c2 | 6843 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6844 | if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST) |
6845 | /* Propagate nonnull. */ | |
555551c2 MM |
6846 | return RECUR (TREE_OPERAND (instance, 0)); |
6847 | ||
51ddb82e | 6848 | return NULL_TREE; |
8d08fdba | 6849 | |
63a906f0 | 6850 | CASE_CONVERT: |
555551c2 | 6851 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6852 | |
6853 | case ADDR_EXPR: | |
88f19756 | 6854 | instance = TREE_OPERAND (instance, 0); |
8d08fdba | 6855 | if (nonnull) |
88f19756 RH |
6856 | { |
6857 | /* Just because we see an ADDR_EXPR doesn't mean we're dealing | |
6858 | with a real object -- given &p->f, p can still be null. */ | |
6859 | tree t = get_base_address (instance); | |
6860 | /* ??? Probably should check DECL_WEAK here. */ | |
6861 | if (t && DECL_P (t)) | |
6862 | *nonnull = 1; | |
6863 | } | |
555551c2 | 6864 | return RECUR (instance); |
8d08fdba MS |
6865 | |
6866 | case COMPONENT_REF: | |
642124c6 RH |
6867 | /* If this component is really a base class reference, then the field |
6868 | itself isn't definitive. */ | |
6869 | if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1))) | |
555551c2 MM |
6870 | return RECUR (TREE_OPERAND (instance, 0)); |
6871 | return RECUR (TREE_OPERAND (instance, 1)); | |
8d08fdba | 6872 | |
8d08fdba MS |
6873 | case VAR_DECL: |
6874 | case FIELD_DECL: | |
6875 | if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE | |
9e1e64ec | 6876 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance)))) |
8d08fdba MS |
6877 | { |
6878 | if (nonnull) | |
6879 | *nonnull = 1; | |
51ddb82e | 6880 | return TREE_TYPE (TREE_TYPE (instance)); |
8d08fdba | 6881 | } |
e92cc029 | 6882 | /* fall through... */ |
8d08fdba MS |
6883 | case TARGET_EXPR: |
6884 | case PARM_DECL: | |
f63ab951 | 6885 | case RESULT_DECL: |
9e1e64ec | 6886 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance))) |
8d08fdba MS |
6887 | { |
6888 | if (nonnull) | |
6889 | *nonnull = 1; | |
51ddb82e | 6890 | return TREE_TYPE (instance); |
8d08fdba | 6891 | } |
394fd776 | 6892 | else if (instance == current_class_ptr) |
0cbd7506 MS |
6893 | { |
6894 | if (nonnull) | |
6895 | *nonnull = 1; | |
6896 | ||
f10eaa2d JM |
6897 | /* if we're in a ctor or dtor, we know our type. If |
6898 | current_class_ptr is set but we aren't in a function, we're in | |
6899 | an NSDMI (and therefore a constructor). */ | |
6900 | if (current_scope () != current_function_decl | |
6901 | || (DECL_LANG_SPECIFIC (current_function_decl) | |
6902 | && (DECL_CONSTRUCTOR_P (current_function_decl) | |
6903 | || DECL_DESTRUCTOR_P (current_function_decl)))) | |
0cbd7506 MS |
6904 | { |
6905 | if (cdtorp) | |
6906 | *cdtorp = 1; | |
6907 | return TREE_TYPE (TREE_TYPE (instance)); | |
6908 | } | |
6909 | } | |
394fd776 | 6910 | else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE) |
0cbd7506 | 6911 | { |
555551c2 | 6912 | /* We only need one hash table because it is always left empty. */ |
c203e8a7 TS |
6913 | if (!fixed_type_or_null_ref_ht) |
6914 | fixed_type_or_null_ref_ht | |
6915 | = new hash_table<pointer_hash<tree_node> > (37); | |
555551c2 | 6916 | |
0cbd7506 MS |
6917 | /* Reference variables should be references to objects. */ |
6918 | if (nonnull) | |
8d08fdba | 6919 | *nonnull = 1; |
c8094d83 | 6920 | |
555551c2 | 6921 | /* Enter the INSTANCE in a table to prevent recursion; a |
772f8889 MM |
6922 | variable's initializer may refer to the variable |
6923 | itself. */ | |
5a6ccc94 | 6924 | if (VAR_P (instance) |
772f8889 | 6925 | && DECL_INITIAL (instance) |
bae14a37 | 6926 | && !type_dependent_expression_p_push (DECL_INITIAL (instance)) |
c203e8a7 | 6927 | && !fixed_type_or_null_ref_ht->find (instance)) |
772f8889 MM |
6928 | { |
6929 | tree type; | |
703c8606 | 6930 | tree_node **slot; |
555551c2 | 6931 | |
c203e8a7 | 6932 | slot = fixed_type_or_null_ref_ht->find_slot (instance, INSERT); |
555551c2 MM |
6933 | *slot = instance; |
6934 | type = RECUR (DECL_INITIAL (instance)); | |
c203e8a7 | 6935 | fixed_type_or_null_ref_ht->remove_elt (instance); |
555551c2 | 6936 | |
772f8889 MM |
6937 | return type; |
6938 | } | |
8d08fdba | 6939 | } |
51ddb82e | 6940 | return NULL_TREE; |
8d08fdba MS |
6941 | |
6942 | default: | |
51ddb82e | 6943 | return NULL_TREE; |
8d08fdba | 6944 | } |
555551c2 | 6945 | #undef RECUR |
8d08fdba | 6946 | } |
51ddb82e | 6947 | |
838dfd8a | 6948 | /* Return nonzero if the dynamic type of INSTANCE is known, and |
338d90b8 NS |
6949 | equivalent to the static type. We also handle the case where |
6950 | INSTANCE is really a pointer. Return negative if this is a | |
6951 | ctor/dtor. There the dynamic type is known, but this might not be | |
6952 | the most derived base of the original object, and hence virtual | |
c65cb8d1 | 6953 | bases may not be laid out according to this type. |
51ddb82e JM |
6954 | |
6955 | Used to determine whether the virtual function table is needed | |
6956 | or not. | |
6957 | ||
6958 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6959 | of our knowledge of its type. *NONNULL should be initialized |
6960 | before this function is called. */ | |
51ddb82e JM |
6961 | |
6962 | int | |
94edc4ab | 6963 | resolves_to_fixed_type_p (tree instance, int* nonnull) |
51ddb82e JM |
6964 | { |
6965 | tree t = TREE_TYPE (instance); | |
394fd776 | 6966 | int cdtorp = 0; |
4d3baecc JM |
6967 | tree fixed; |
6968 | ||
65f0c5b3 | 6969 | /* processing_template_decl can be false in a template if we're in |
234bef96 PC |
6970 | instantiate_non_dependent_expr, but we still want to suppress |
6971 | this check. */ | |
e0e1b357 | 6972 | if (in_template_function ()) |
4d3baecc JM |
6973 | { |
6974 | /* In a template we only care about the type of the result. */ | |
6975 | if (nonnull) | |
6976 | *nonnull = true; | |
6977 | return true; | |
6978 | } | |
6979 | ||
6980 | fixed = fixed_type_or_null (instance, nonnull, &cdtorp); | |
51ddb82e JM |
6981 | if (fixed == NULL_TREE) |
6982 | return 0; | |
6983 | if (POINTER_TYPE_P (t)) | |
6984 | t = TREE_TYPE (t); | |
394fd776 NS |
6985 | if (!same_type_ignoring_top_level_qualifiers_p (t, fixed)) |
6986 | return 0; | |
6987 | return cdtorp ? -1 : 1; | |
51ddb82e JM |
6988 | } |
6989 | ||
8d08fdba MS |
6990 | \f |
6991 | void | |
94edc4ab | 6992 | init_class_processing (void) |
8d08fdba MS |
6993 | { |
6994 | current_class_depth = 0; | |
61a127b3 | 6995 | current_class_stack_size = 10; |
c8094d83 | 6996 | current_class_stack |
0ac1b889 | 6997 | = XNEWVEC (struct class_stack_node, current_class_stack_size); |
9771b263 | 6998 | vec_alloc (local_classes, 8); |
c5a35c3c | 6999 | sizeof_biggest_empty_class = size_zero_node; |
8d08fdba | 7000 | |
0e5921e8 ZW |
7001 | ridpointers[(int) RID_PUBLIC] = access_public_node; |
7002 | ridpointers[(int) RID_PRIVATE] = access_private_node; | |
7003 | ridpointers[(int) RID_PROTECTED] = access_protected_node; | |
8d08fdba MS |
7004 | } |
7005 | ||
39fb05d0 MM |
7006 | /* Restore the cached PREVIOUS_CLASS_LEVEL. */ |
7007 | ||
7008 | static void | |
7009 | restore_class_cache (void) | |
7010 | { | |
39fb05d0 | 7011 | tree type; |
39fb05d0 MM |
7012 | |
7013 | /* We are re-entering the same class we just left, so we don't | |
7014 | have to search the whole inheritance matrix to find all the | |
7015 | decls to bind again. Instead, we install the cached | |
7016 | class_shadowed list and walk through it binding names. */ | |
7017 | push_binding_level (previous_class_level); | |
7018 | class_binding_level = previous_class_level; | |
39fb05d0 | 7019 | /* Restore IDENTIFIER_TYPE_VALUE. */ |
c8094d83 MS |
7020 | for (type = class_binding_level->type_shadowed; |
7021 | type; | |
39fb05d0 MM |
7022 | type = TREE_CHAIN (type)) |
7023 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type)); | |
7024 | } | |
7025 | ||
a723baf1 MM |
7026 | /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as |
7027 | appropriate for TYPE. | |
8d08fdba | 7028 | |
8d08fdba MS |
7029 | So that we may avoid calls to lookup_name, we cache the _TYPE |
7030 | nodes of local TYPE_DECLs in the TREE_TYPE field of the name. | |
7031 | ||
7032 | For multiple inheritance, we perform a two-pass depth-first search | |
39fb05d0 | 7033 | of the type lattice. */ |
8d08fdba MS |
7034 | |
7035 | void | |
29370796 | 7036 | pushclass (tree type) |
8d08fdba | 7037 | { |
c888c93b MM |
7038 | class_stack_node_t csn; |
7039 | ||
0771d9d7 JM |
7040 | type = TYPE_MAIN_VARIANT (type); |
7041 | ||
61a127b3 | 7042 | /* Make sure there is enough room for the new entry on the stack. */ |
c8094d83 | 7043 | if (current_class_depth + 1 >= current_class_stack_size) |
8d08fdba | 7044 | { |
61a127b3 MM |
7045 | current_class_stack_size *= 2; |
7046 | current_class_stack | |
7767580e | 7047 | = XRESIZEVEC (struct class_stack_node, current_class_stack, |
3db45ab5 | 7048 | current_class_stack_size); |
8d08fdba MS |
7049 | } |
7050 | ||
61a127b3 | 7051 | /* Insert a new entry on the class stack. */ |
c888c93b MM |
7052 | csn = current_class_stack + current_class_depth; |
7053 | csn->name = current_class_name; | |
7054 | csn->type = current_class_type; | |
7055 | csn->access = current_access_specifier; | |
7056 | csn->names_used = 0; | |
7057 | csn->hidden = 0; | |
61a127b3 MM |
7058 | current_class_depth++; |
7059 | ||
7060 | /* Now set up the new type. */ | |
8d08fdba MS |
7061 | current_class_name = TYPE_NAME (type); |
7062 | if (TREE_CODE (current_class_name) == TYPE_DECL) | |
7063 | current_class_name = DECL_NAME (current_class_name); | |
7064 | current_class_type = type; | |
7065 | ||
61a127b3 MM |
7066 | /* By default, things in classes are private, while things in |
7067 | structures or unions are public. */ | |
c8094d83 MS |
7068 | current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type) |
7069 | ? access_private_node | |
61a127b3 MM |
7070 | : access_public_node); |
7071 | ||
89b578be MM |
7072 | if (previous_class_level |
7073 | && type != previous_class_level->this_entity | |
8d08fdba MS |
7074 | && current_class_depth == 1) |
7075 | { | |
7076 | /* Forcibly remove any old class remnants. */ | |
8f032717 | 7077 | invalidate_class_lookup_cache (); |
8d08fdba MS |
7078 | } |
7079 | ||
c8094d83 | 7080 | if (!previous_class_level |
89b578be MM |
7081 | || type != previous_class_level->this_entity |
7082 | || current_class_depth > 1) | |
90ea9897 | 7083 | pushlevel_class (); |
29370796 | 7084 | else |
39fb05d0 | 7085 | restore_class_cache (); |
8f032717 MM |
7086 | } |
7087 | ||
39fb05d0 MM |
7088 | /* When we exit a toplevel class scope, we save its binding level so |
7089 | that we can restore it quickly. Here, we've entered some other | |
7090 | class, so we must invalidate our cache. */ | |
8d08fdba | 7091 | |
8f032717 | 7092 | void |
94edc4ab | 7093 | invalidate_class_lookup_cache (void) |
8f032717 | 7094 | { |
89b578be | 7095 | previous_class_level = NULL; |
8d08fdba | 7096 | } |
c8094d83 | 7097 | |
8d08fdba | 7098 | /* Get out of the current class scope. If we were in a class scope |
b74a0560 | 7099 | previously, that is the one popped to. */ |
e92cc029 | 7100 | |
8d08fdba | 7101 | void |
94edc4ab | 7102 | popclass (void) |
8d08fdba | 7103 | { |
0771d9d7 | 7104 | poplevel_class (); |
8d08fdba MS |
7105 | |
7106 | current_class_depth--; | |
61a127b3 MM |
7107 | current_class_name = current_class_stack[current_class_depth].name; |
7108 | current_class_type = current_class_stack[current_class_depth].type; | |
7109 | current_access_specifier = current_class_stack[current_class_depth].access; | |
8f032717 MM |
7110 | if (current_class_stack[current_class_depth].names_used) |
7111 | splay_tree_delete (current_class_stack[current_class_depth].names_used); | |
8d08fdba MS |
7112 | } |
7113 | ||
c888c93b MM |
7114 | /* Mark the top of the class stack as hidden. */ |
7115 | ||
7116 | void | |
7117 | push_class_stack (void) | |
7118 | { | |
7119 | if (current_class_depth) | |
7120 | ++current_class_stack[current_class_depth - 1].hidden; | |
7121 | } | |
7122 | ||
7123 | /* Mark the top of the class stack as un-hidden. */ | |
7124 | ||
7125 | void | |
7126 | pop_class_stack (void) | |
7127 | { | |
7128 | if (current_class_depth) | |
7129 | --current_class_stack[current_class_depth - 1].hidden; | |
7130 | } | |
7131 | ||
fa6098f8 MM |
7132 | /* Returns 1 if the class type currently being defined is either T or |
7133 | a nested type of T. */ | |
b9082e8a | 7134 | |
fa6098f8 | 7135 | bool |
94edc4ab | 7136 | currently_open_class (tree t) |
b9082e8a JM |
7137 | { |
7138 | int i; | |
fa6098f8 | 7139 | |
1cb801bc JM |
7140 | if (!CLASS_TYPE_P (t)) |
7141 | return false; | |
7142 | ||
3e5e84be JM |
7143 | t = TYPE_MAIN_VARIANT (t); |
7144 | ||
fa6098f8 MM |
7145 | /* We start looking from 1 because entry 0 is from global scope, |
7146 | and has no type. */ | |
7147 | for (i = current_class_depth; i > 0; --i) | |
c888c93b | 7148 | { |
fa6098f8 MM |
7149 | tree c; |
7150 | if (i == current_class_depth) | |
7151 | c = current_class_type; | |
7152 | else | |
7153 | { | |
7154 | if (current_class_stack[i].hidden) | |
7155 | break; | |
7156 | c = current_class_stack[i].type; | |
7157 | } | |
7158 | if (!c) | |
7159 | continue; | |
7160 | if (same_type_p (c, t)) | |
7161 | return true; | |
c888c93b | 7162 | } |
fa6098f8 | 7163 | return false; |
b9082e8a JM |
7164 | } |
7165 | ||
70adf8a9 JM |
7166 | /* If either current_class_type or one of its enclosing classes are derived |
7167 | from T, return the appropriate type. Used to determine how we found | |
7168 | something via unqualified lookup. */ | |
7169 | ||
7170 | tree | |
94edc4ab | 7171 | currently_open_derived_class (tree t) |
70adf8a9 JM |
7172 | { |
7173 | int i; | |
7174 | ||
9bcb9aae | 7175 | /* The bases of a dependent type are unknown. */ |
1fb3244a MM |
7176 | if (dependent_type_p (t)) |
7177 | return NULL_TREE; | |
7178 | ||
c44e68a5 KL |
7179 | if (!current_class_type) |
7180 | return NULL_TREE; | |
7181 | ||
70adf8a9 JM |
7182 | if (DERIVED_FROM_P (t, current_class_type)) |
7183 | return current_class_type; | |
7184 | ||
7185 | for (i = current_class_depth - 1; i > 0; --i) | |
c888c93b MM |
7186 | { |
7187 | if (current_class_stack[i].hidden) | |
7188 | break; | |
7189 | if (DERIVED_FROM_P (t, current_class_stack[i].type)) | |
7190 | return current_class_stack[i].type; | |
7191 | } | |
70adf8a9 JM |
7192 | |
7193 | return NULL_TREE; | |
7194 | } | |
7195 | ||
2d7d7f0f JM |
7196 | /* Return the outermost enclosing class type that is still open, or |
7197 | NULL_TREE. */ | |
7198 | ||
7199 | tree | |
7200 | outermost_open_class (void) | |
7201 | { | |
7202 | if (!current_class_type) | |
7203 | return NULL_TREE; | |
7204 | tree r = NULL_TREE; | |
cea83a3a JM |
7205 | if (TYPE_BEING_DEFINED (current_class_type)) |
7206 | r = current_class_type; | |
7207 | for (int i = current_class_depth - 1; i > 0; --i) | |
2d7d7f0f JM |
7208 | { |
7209 | if (current_class_stack[i].hidden) | |
7210 | break; | |
7211 | tree t = current_class_stack[i].type; | |
7212 | if (!TYPE_BEING_DEFINED (t)) | |
7213 | break; | |
7214 | r = t; | |
7215 | } | |
7216 | return r; | |
7217 | } | |
7218 | ||
a6846853 JM |
7219 | /* Returns the innermost class type which is not a lambda closure type. */ |
7220 | ||
7221 | tree | |
7222 | current_nonlambda_class_type (void) | |
7223 | { | |
7224 | int i; | |
7225 | ||
7226 | /* We start looking from 1 because entry 0 is from global scope, | |
7227 | and has no type. */ | |
7228 | for (i = current_class_depth; i > 0; --i) | |
7229 | { | |
7230 | tree c; | |
7231 | if (i == current_class_depth) | |
7232 | c = current_class_type; | |
7233 | else | |
7234 | { | |
7235 | if (current_class_stack[i].hidden) | |
7236 | break; | |
7237 | c = current_class_stack[i].type; | |
7238 | } | |
7239 | if (!c) | |
7240 | continue; | |
7241 | if (!LAMBDA_TYPE_P (c)) | |
7242 | return c; | |
7243 | } | |
7244 | return NULL_TREE; | |
7245 | } | |
7246 | ||
8d08fdba | 7247 | /* When entering a class scope, all enclosing class scopes' names with |
14d22dd6 MM |
7248 | static meaning (static variables, static functions, types and |
7249 | enumerators) have to be visible. This recursive function calls | |
7250 | pushclass for all enclosing class contexts until global or a local | |
7251 | scope is reached. TYPE is the enclosed class. */ | |
8d08fdba MS |
7252 | |
7253 | void | |
14d22dd6 | 7254 | push_nested_class (tree type) |
8d08fdba | 7255 | { |
b262d64c | 7256 | /* A namespace might be passed in error cases, like A::B:C. */ |
c8094d83 | 7257 | if (type == NULL_TREE |
56d0c6e3 | 7258 | || !CLASS_TYPE_P (type)) |
a28e3c7f | 7259 | return; |
c8094d83 | 7260 | |
56d0c6e3 | 7261 | push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type))); |
8d08fdba | 7262 | |
29370796 | 7263 | pushclass (type); |
8d08fdba MS |
7264 | } |
7265 | ||
a723baf1 | 7266 | /* Undoes a push_nested_class call. */ |
8d08fdba MS |
7267 | |
7268 | void | |
94edc4ab | 7269 | pop_nested_class (void) |
8d08fdba | 7270 | { |
d2e5ee5c | 7271 | tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type)); |
8d08fdba | 7272 | |
b74a0560 | 7273 | popclass (); |
6b400b21 | 7274 | if (context && CLASS_TYPE_P (context)) |
b74a0560 | 7275 | pop_nested_class (); |
8d08fdba MS |
7276 | } |
7277 | ||
46ccf50a JM |
7278 | /* Returns the number of extern "LANG" blocks we are nested within. */ |
7279 | ||
7280 | int | |
94edc4ab | 7281 | current_lang_depth (void) |
46ccf50a | 7282 | { |
9771b263 | 7283 | return vec_safe_length (current_lang_base); |
46ccf50a JM |
7284 | } |
7285 | ||
8d08fdba MS |
7286 | /* Set global variables CURRENT_LANG_NAME to appropriate value |
7287 | so that behavior of name-mangling machinery is correct. */ | |
7288 | ||
7289 | void | |
94edc4ab | 7290 | push_lang_context (tree name) |
8d08fdba | 7291 | { |
9771b263 | 7292 | vec_safe_push (current_lang_base, current_lang_name); |
8d08fdba | 7293 | |
e229f2cd | 7294 | if (name == lang_name_cplusplus) |
8d08fdba | 7295 | { |
8d08fdba MS |
7296 | current_lang_name = name; |
7297 | } | |
e229f2cd PB |
7298 | else if (name == lang_name_java) |
7299 | { | |
e229f2cd PB |
7300 | current_lang_name = name; |
7301 | /* DECL_IGNORED_P is initially set for these types, to avoid clutter. | |
7302 | (See record_builtin_java_type in decl.c.) However, that causes | |
7303 | incorrect debug entries if these types are actually used. | |
00a17e31 | 7304 | So we re-enable debug output after extern "Java". */ |
e3cd9945 APB |
7305 | DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0; |
7306 | DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0; | |
7307 | DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0; | |
7308 | DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0; | |
7309 | DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0; | |
7310 | DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0; | |
7311 | DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0; | |
7312 | DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0; | |
e229f2cd | 7313 | } |
8d08fdba MS |
7314 | else if (name == lang_name_c) |
7315 | { | |
8d08fdba MS |
7316 | current_lang_name = name; |
7317 | } | |
7318 | else | |
9e637a26 | 7319 | error ("language string %<\"%E\"%> not recognized", name); |
8d08fdba | 7320 | } |
c8094d83 | 7321 | |
8d08fdba | 7322 | /* Get out of the current language scope. */ |
e92cc029 | 7323 | |
8d08fdba | 7324 | void |
94edc4ab | 7325 | pop_lang_context (void) |
8d08fdba | 7326 | { |
9771b263 | 7327 | current_lang_name = current_lang_base->pop (); |
8d08fdba | 7328 | } |
8d08fdba MS |
7329 | \f |
7330 | /* Type instantiation routines. */ | |
7331 | ||
104bf76a MM |
7332 | /* Given an OVERLOAD and a TARGET_TYPE, return the function that |
7333 | matches the TARGET_TYPE. If there is no satisfactory match, return | |
eff3a276 MM |
7334 | error_mark_node, and issue an error & warning messages under |
7335 | control of FLAGS. Permit pointers to member function if FLAGS | |
7336 | permits. If TEMPLATE_ONLY, the name of the overloaded function was | |
7337 | a template-id, and EXPLICIT_TARGS are the explicitly provided | |
248e1b22 MM |
7338 | template arguments. |
7339 | ||
7340 | If OVERLOAD is for one or more member functions, then ACCESS_PATH | |
7341 | is the base path used to reference those member functions. If | |
5e7b9f60 JM |
7342 | the address is resolved to a member function, access checks will be |
7343 | performed and errors issued if appropriate. */ | |
104bf76a | 7344 | |
2c73f9f5 | 7345 | static tree |
c8094d83 | 7346 | resolve_address_of_overloaded_function (tree target_type, |
94edc4ab | 7347 | tree overload, |
92af500d NS |
7348 | tsubst_flags_t flags, |
7349 | bool template_only, | |
eff3a276 MM |
7350 | tree explicit_targs, |
7351 | tree access_path) | |
2c73f9f5 | 7352 | { |
104bf76a | 7353 | /* Here's what the standard says: |
c8094d83 | 7354 | |
104bf76a MM |
7355 | [over.over] |
7356 | ||
7357 | If the name is a function template, template argument deduction | |
7358 | is done, and if the argument deduction succeeds, the deduced | |
7359 | arguments are used to generate a single template function, which | |
7360 | is added to the set of overloaded functions considered. | |
7361 | ||
7362 | Non-member functions and static member functions match targets of | |
7363 | type "pointer-to-function" or "reference-to-function." Nonstatic | |
7364 | member functions match targets of type "pointer-to-member | |
7365 | function;" the function type of the pointer to member is used to | |
7366 | select the member function from the set of overloaded member | |
7367 | functions. If a nonstatic member function is selected, the | |
7368 | reference to the overloaded function name is required to have the | |
7369 | form of a pointer to member as described in 5.3.1. | |
7370 | ||
7371 | If more than one function is selected, any template functions in | |
7372 | the set are eliminated if the set also contains a non-template | |
7373 | function, and any given template function is eliminated if the | |
7374 | set contains a second template function that is more specialized | |
7375 | than the first according to the partial ordering rules 14.5.5.2. | |
7376 | After such eliminations, if any, there shall remain exactly one | |
7377 | selected function. */ | |
7378 | ||
7379 | int is_ptrmem = 0; | |
104bf76a MM |
7380 | /* We store the matches in a TREE_LIST rooted here. The functions |
7381 | are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy | |
7382 | interoperability with most_specialized_instantiation. */ | |
7383 | tree matches = NULL_TREE; | |
50714e79 | 7384 | tree fn; |
7bead48f | 7385 | tree target_fn_type; |
104bf76a | 7386 | |
d8f8dca1 MM |
7387 | /* By the time we get here, we should be seeing only real |
7388 | pointer-to-member types, not the internal POINTER_TYPE to | |
7389 | METHOD_TYPE representation. */ | |
50e10fa8 | 7390 | gcc_assert (!TYPE_PTR_P (target_type) |
50bc768d | 7391 | || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE); |
104bf76a | 7392 | |
50bc768d | 7393 | gcc_assert (is_overloaded_fn (overload)); |
c8094d83 | 7394 | |
104bf76a | 7395 | /* Check that the TARGET_TYPE is reasonable. */ |
6721db5d JM |
7396 | if (TYPE_PTRFN_P (target_type) |
7397 | || TYPE_REFFN_P (target_type)) | |
381ddaa6 | 7398 | /* This is OK. */; |
104bf76a MM |
7399 | else if (TYPE_PTRMEMFUNC_P (target_type)) |
7400 | /* This is OK, too. */ | |
7401 | is_ptrmem = 1; | |
7402 | else if (TREE_CODE (target_type) == FUNCTION_TYPE) | |
db80e34e JJ |
7403 | /* This is OK, too. This comes from a conversion to reference |
7404 | type. */ | |
7405 | target_type = build_reference_type (target_type); | |
c8094d83 | 7406 | else |
104bf76a | 7407 | { |
92af500d | 7408 | if (flags & tf_error) |
c4f73174 | 7409 | error ("cannot resolve overloaded function %qD based on" |
0cbd7506 MS |
7410 | " conversion to type %qT", |
7411 | DECL_NAME (OVL_FUNCTION (overload)), target_type); | |
104bf76a MM |
7412 | return error_mark_node; |
7413 | } | |
c8094d83 | 7414 | |
7bead48f JM |
7415 | /* Non-member functions and static member functions match targets of type |
7416 | "pointer-to-function" or "reference-to-function." Nonstatic member | |
7417 | functions match targets of type "pointer-to-member-function;" the | |
7418 | function type of the pointer to member is used to select the member | |
7419 | function from the set of overloaded member functions. | |
7420 | ||
7421 | So figure out the FUNCTION_TYPE that we want to match against. */ | |
7422 | target_fn_type = static_fn_type (target_type); | |
7423 | ||
104bf76a MM |
7424 | /* If we can find a non-template function that matches, we can just |
7425 | use it. There's no point in generating template instantiations | |
7426 | if we're just going to throw them out anyhow. But, of course, we | |
7427 | can only do this when we don't *need* a template function. */ | |
7428 | if (!template_only) | |
7429 | { | |
7430 | tree fns; | |
7431 | ||
a723baf1 | 7432 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 7433 | { |
a723baf1 | 7434 | tree fn = OVL_CURRENT (fns); |
2c73f9f5 | 7435 | |
104bf76a MM |
7436 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
7437 | /* We're not looking for templates just yet. */ | |
7438 | continue; | |
7439 | ||
7440 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7441 | != is_ptrmem) | |
7442 | /* We're looking for a non-static member, and this isn't | |
7443 | one, or vice versa. */ | |
7444 | continue; | |
34ff2673 | 7445 | |
d63d5d0c ILT |
7446 | /* Ignore functions which haven't been explicitly |
7447 | declared. */ | |
34ff2673 RS |
7448 | if (DECL_ANTICIPATED (fn)) |
7449 | continue; | |
7450 | ||
104bf76a | 7451 | /* See if there's a match. */ |
7bead48f | 7452 | if (same_type_p (target_fn_type, static_fn_type (fn))) |
e1b3e07d | 7453 | matches = tree_cons (fn, NULL_TREE, matches); |
104bf76a MM |
7454 | } |
7455 | } | |
7456 | ||
7457 | /* Now, if we've already got a match (or matches), there's no need | |
7458 | to proceed to the template functions. But, if we don't have a | |
7459 | match we need to look at them, too. */ | |
c8094d83 | 7460 | if (!matches) |
2c73f9f5 | 7461 | { |
104bf76a | 7462 | tree target_arg_types; |
8d3631f8 | 7463 | tree target_ret_type; |
104bf76a | 7464 | tree fns; |
c166b898 ILT |
7465 | tree *args; |
7466 | unsigned int nargs, ia; | |
7467 | tree arg; | |
104bf76a | 7468 | |
4393e105 | 7469 | target_arg_types = TYPE_ARG_TYPES (target_fn_type); |
8d3631f8 | 7470 | target_ret_type = TREE_TYPE (target_fn_type); |
e5214479 | 7471 | |
c166b898 ILT |
7472 | nargs = list_length (target_arg_types); |
7473 | args = XALLOCAVEC (tree, nargs); | |
7474 | for (arg = target_arg_types, ia = 0; | |
7475 | arg != NULL_TREE && arg != void_list_node; | |
7476 | arg = TREE_CHAIN (arg), ++ia) | |
7477 | args[ia] = TREE_VALUE (arg); | |
7478 | nargs = ia; | |
7479 | ||
a723baf1 | 7480 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 7481 | { |
a723baf1 | 7482 | tree fn = OVL_CURRENT (fns); |
104bf76a | 7483 | tree instantiation; |
104bf76a MM |
7484 | tree targs; |
7485 | ||
7486 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
7487 | /* We're only looking for templates. */ | |
7488 | continue; | |
7489 | ||
7490 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
7491 | != is_ptrmem) | |
4393e105 | 7492 | /* We're not looking for a non-static member, and this is |
104bf76a MM |
7493 | one, or vice versa. */ |
7494 | continue; | |
7495 | ||
79d8a272 JM |
7496 | tree ret = target_ret_type; |
7497 | ||
7498 | /* If the template has a deduced return type, don't expose it to | |
7499 | template argument deduction. */ | |
7500 | if (undeduced_auto_decl (fn)) | |
7501 | ret = NULL_TREE; | |
7502 | ||
104bf76a | 7503 | /* Try to do argument deduction. */ |
f31c0a32 | 7504 | targs = make_tree_vec (DECL_NTPARMS (fn)); |
cd057e3a | 7505 | instantiation = fn_type_unification (fn, explicit_targs, targs, args, |
79d8a272 | 7506 | nargs, ret, |
cd057e3a | 7507 | DEDUCE_EXACT, LOOKUP_NORMAL, |
2b24855e | 7508 | false, false); |
104bf76a MM |
7509 | if (instantiation == error_mark_node) |
7510 | /* Instantiation failed. */ | |
7511 | continue; | |
7512 | ||
79d8a272 JM |
7513 | /* And now force instantiation to do return type deduction. */ |
7514 | if (undeduced_auto_decl (instantiation)) | |
7515 | { | |
7516 | ++function_depth; | |
7517 | instantiate_decl (instantiation, /*defer*/false, /*class*/false); | |
7518 | --function_depth; | |
7519 | ||
7520 | require_deduced_type (instantiation); | |
7521 | } | |
7522 | ||
104bf76a | 7523 | /* See if there's a match. */ |
7bead48f | 7524 | if (same_type_p (target_fn_type, static_fn_type (instantiation))) |
e1b3e07d | 7525 | matches = tree_cons (instantiation, fn, matches); |
104bf76a MM |
7526 | } |
7527 | ||
7528 | /* Now, remove all but the most specialized of the matches. */ | |
7529 | if (matches) | |
7530 | { | |
e5214479 | 7531 | tree match = most_specialized_instantiation (matches); |
104bf76a MM |
7532 | |
7533 | if (match != error_mark_node) | |
3db45ab5 MS |
7534 | matches = tree_cons (TREE_PURPOSE (match), |
7535 | NULL_TREE, | |
7ca383e6 | 7536 | NULL_TREE); |
104bf76a MM |
7537 | } |
7538 | } | |
7539 | ||
7540 | /* Now we should have exactly one function in MATCHES. */ | |
7541 | if (matches == NULL_TREE) | |
7542 | { | |
7543 | /* There were *no* matches. */ | |
92af500d | 7544 | if (flags & tf_error) |
104bf76a | 7545 | { |
0cbd7506 | 7546 | error ("no matches converting function %qD to type %q#T", |
95e20768 | 7547 | DECL_NAME (OVL_CURRENT (overload)), |
0cbd7506 | 7548 | target_type); |
6b9b6b15 | 7549 | |
c224bdc1 | 7550 | print_candidates (overload); |
104bf76a MM |
7551 | } |
7552 | return error_mark_node; | |
2c73f9f5 | 7553 | } |
104bf76a MM |
7554 | else if (TREE_CHAIN (matches)) |
7555 | { | |
e04c614e JM |
7556 | /* There were too many matches. First check if they're all |
7557 | the same function. */ | |
3649b9b7 | 7558 | tree match = NULL_TREE; |
104bf76a | 7559 | |
e04c614e | 7560 | fn = TREE_PURPOSE (matches); |
3649b9b7 | 7561 | |
beb42d20 ST |
7562 | /* For multi-versioned functions, more than one match is just fine and |
7563 | decls_match will return false as they are different. */ | |
7564 | for (match = TREE_CHAIN (matches); match; match = TREE_CHAIN (match)) | |
7565 | if (!decls_match (fn, TREE_PURPOSE (match)) | |
7566 | && !targetm.target_option.function_versions | |
7567 | (fn, TREE_PURPOSE (match))) | |
7568 | break; | |
e04c614e JM |
7569 | |
7570 | if (match) | |
104bf76a | 7571 | { |
e04c614e JM |
7572 | if (flags & tf_error) |
7573 | { | |
7574 | error ("converting overloaded function %qD to type %q#T is ambiguous", | |
7575 | DECL_NAME (OVL_FUNCTION (overload)), | |
7576 | target_type); | |
104bf76a | 7577 | |
e04c614e JM |
7578 | /* Since print_candidates expects the functions in the |
7579 | TREE_VALUE slot, we flip them here. */ | |
7580 | for (match = matches; match; match = TREE_CHAIN (match)) | |
7581 | TREE_VALUE (match) = TREE_PURPOSE (match); | |
104bf76a | 7582 | |
e04c614e JM |
7583 | print_candidates (matches); |
7584 | } | |
104bf76a | 7585 | |
e04c614e | 7586 | return error_mark_node; |
104bf76a | 7587 | } |
104bf76a MM |
7588 | } |
7589 | ||
50714e79 MM |
7590 | /* Good, exactly one match. Now, convert it to the correct type. */ |
7591 | fn = TREE_PURPOSE (matches); | |
7592 | ||
b1ce3eb2 | 7593 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
92af500d | 7594 | && !(flags & tf_ptrmem_ok) && !flag_ms_extensions) |
19420d00 | 7595 | { |
b1ce3eb2 | 7596 | static int explained; |
c8094d83 | 7597 | |
92af500d | 7598 | if (!(flags & tf_error)) |
0cbd7506 | 7599 | return error_mark_node; |
19420d00 | 7600 | |
cbe5f3b3 | 7601 | permerror (input_location, "assuming pointer to member %qD", fn); |
b1ce3eb2 | 7602 | if (!explained) |
0cbd7506 | 7603 | { |
1f5b3869 | 7604 | inform (input_location, "(a pointer to member can only be formed with %<&%E%>)", fn); |
0cbd7506 MS |
7605 | explained = 1; |
7606 | } | |
19420d00 | 7607 | } |
84583208 | 7608 | |
3649b9b7 ST |
7609 | /* If a pointer to a function that is multi-versioned is requested, the |
7610 | pointer to the dispatcher function is returned instead. This works | |
7611 | well because indirectly calling the function will dispatch the right | |
7612 | function version at run-time. */ | |
7613 | if (DECL_FUNCTION_VERSIONED (fn)) | |
7614 | { | |
beb42d20 ST |
7615 | fn = get_function_version_dispatcher (fn); |
7616 | if (fn == NULL) | |
7617 | return error_mark_node; | |
3649b9b7 ST |
7618 | /* Mark all the versions corresponding to the dispatcher as used. */ |
7619 | if (!(flags & tf_conv)) | |
7620 | mark_versions_used (fn); | |
7621 | } | |
7622 | ||
84583208 MM |
7623 | /* If we're doing overload resolution purely for the purpose of |
7624 | determining conversion sequences, we should not consider the | |
7625 | function used. If this conversion sequence is selected, the | |
7626 | function will be marked as used at this point. */ | |
7627 | if (!(flags & tf_conv)) | |
eff3a276 | 7628 | { |
4ad610c9 JM |
7629 | /* Make =delete work with SFINAE. */ |
7630 | if (DECL_DELETED_FN (fn) && !(flags & tf_error)) | |
7631 | return error_mark_node; | |
7632 | ||
eff3a276 | 7633 | mark_used (fn); |
248e1b22 MM |
7634 | } |
7635 | ||
7636 | /* We could not check access to member functions when this | |
7637 | expression was originally created since we did not know at that | |
7638 | time to which function the expression referred. */ | |
5e7b9f60 | 7639 | if (DECL_FUNCTION_MEMBER_P (fn)) |
248e1b22 MM |
7640 | { |
7641 | gcc_assert (access_path); | |
5e7b9f60 | 7642 | perform_or_defer_access_check (access_path, fn, fn, flags); |
eff3a276 | 7643 | } |
a6ecf8b6 | 7644 | |
50714e79 | 7645 | if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type)) |
93c0e0bb | 7646 | return cp_build_addr_expr (fn, flags); |
50714e79 MM |
7647 | else |
7648 | { | |
5ade1ed2 | 7649 | /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op |
50714e79 MM |
7650 | will mark the function as addressed, but here we must do it |
7651 | explicitly. */ | |
dffd7eb6 | 7652 | cxx_mark_addressable (fn); |
50714e79 MM |
7653 | |
7654 | return fn; | |
7655 | } | |
2c73f9f5 ML |
7656 | } |
7657 | ||
ec255269 MS |
7658 | /* This function will instantiate the type of the expression given in |
7659 | RHS to match the type of LHSTYPE. If errors exist, then return | |
92af500d | 7660 | error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then |
5e76004e NS |
7661 | we complain on errors. If we are not complaining, never modify rhs, |
7662 | as overload resolution wants to try many possible instantiations, in | |
7663 | the hope that at least one will work. | |
c8094d83 | 7664 | |
e6e174e5 JM |
7665 | For non-recursive calls, LHSTYPE should be a function, pointer to |
7666 | function, or a pointer to member function. */ | |
e92cc029 | 7667 | |
8d08fdba | 7668 | tree |
94edc4ab | 7669 | instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags) |
8d08fdba | 7670 | { |
92af500d | 7671 | tsubst_flags_t flags_in = flags; |
eff3a276 | 7672 | tree access_path = NULL_TREE; |
c8094d83 | 7673 | |
c2ea3a40 | 7674 | flags &= ~tf_ptrmem_ok; |
c8094d83 | 7675 | |
fbfc8363 | 7676 | if (lhstype == unknown_type_node) |
8d08fdba | 7677 | { |
92af500d | 7678 | if (flags & tf_error) |
8251199e | 7679 | error ("not enough type information"); |
8d08fdba MS |
7680 | return error_mark_node; |
7681 | } | |
7682 | ||
7683 | if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs))) | |
abff8e06 | 7684 | { |
6721db5d JM |
7685 | tree fntype = non_reference (lhstype); |
7686 | if (same_type_p (fntype, TREE_TYPE (rhs))) | |
abff8e06 | 7687 | return rhs; |
c8094d83 | 7688 | if (flag_ms_extensions |
6721db5d | 7689 | && TYPE_PTRMEMFUNC_P (fntype) |
a723baf1 MM |
7690 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs))) |
7691 | /* Microsoft allows `A::f' to be resolved to a | |
7692 | pointer-to-member. */ | |
7693 | ; | |
7694 | else | |
7695 | { | |
92af500d | 7696 | if (flags & tf_error) |
c3c1f2b7 | 7697 | error ("cannot convert %qE from type %qT to type %qT", |
6721db5d | 7698 | rhs, TREE_TYPE (rhs), fntype); |
a723baf1 MM |
7699 | return error_mark_node; |
7700 | } | |
abff8e06 | 7701 | } |
8d08fdba | 7702 | |
c5ce25ce | 7703 | if (BASELINK_P (rhs)) |
eff3a276 MM |
7704 | { |
7705 | access_path = BASELINK_ACCESS_BINFO (rhs); | |
7706 | rhs = BASELINK_FUNCTIONS (rhs); | |
7707 | } | |
50ad9642 | 7708 | |
5ae9ba3e MM |
7709 | /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot |
7710 | deduce any type information. */ | |
7711 | if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR) | |
7712 | { | |
7713 | if (flags & tf_error) | |
7714 | error ("not enough type information"); | |
7715 | return error_mark_node; | |
7716 | } | |
7717 | ||
eff3a276 MM |
7718 | /* There only a few kinds of expressions that may have a type |
7719 | dependent on overload resolution. */ | |
7720 | gcc_assert (TREE_CODE (rhs) == ADDR_EXPR | |
7721 | || TREE_CODE (rhs) == COMPONENT_REF | |
3f3fd87d | 7722 | || is_overloaded_fn (rhs) |
95e20768 | 7723 | || (flag_ms_extensions && TREE_CODE (rhs) == FUNCTION_DECL)); |
c73964b2 | 7724 | |
8d08fdba MS |
7725 | /* This should really only be used when attempting to distinguish |
7726 | what sort of a pointer to function we have. For now, any | |
7727 | arithmetic operation which is not supported on pointers | |
7728 | is rejected as an error. */ | |
7729 | ||
7730 | switch (TREE_CODE (rhs)) | |
7731 | { | |
8d08fdba | 7732 | case COMPONENT_REF: |
92af500d | 7733 | { |
5ae9ba3e | 7734 | tree member = TREE_OPERAND (rhs, 1); |
92af500d | 7735 | |
5ae9ba3e MM |
7736 | member = instantiate_type (lhstype, member, flags); |
7737 | if (member != error_mark_node | |
92af500d | 7738 | && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0))) |
04c06002 | 7739 | /* Do not lose object's side effects. */ |
5ae9ba3e MM |
7740 | return build2 (COMPOUND_EXPR, TREE_TYPE (member), |
7741 | TREE_OPERAND (rhs, 0), member); | |
7742 | return member; | |
92af500d | 7743 | } |
8d08fdba | 7744 | |
2a238a97 | 7745 | case OFFSET_REF: |
05e0b2f4 JM |
7746 | rhs = TREE_OPERAND (rhs, 1); |
7747 | if (BASELINK_P (rhs)) | |
eff3a276 | 7748 | return instantiate_type (lhstype, rhs, flags_in); |
05e0b2f4 | 7749 | |
2a238a97 MM |
7750 | /* This can happen if we are forming a pointer-to-member for a |
7751 | member template. */ | |
50bc768d | 7752 | gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR); |
05e0b2f4 | 7753 | |
2a238a97 | 7754 | /* Fall through. */ |
874503bc | 7755 | |
386b8a85 | 7756 | case TEMPLATE_ID_EXPR: |
2bdb0643 JM |
7757 | { |
7758 | tree fns = TREE_OPERAND (rhs, 0); | |
7759 | tree args = TREE_OPERAND (rhs, 1); | |
7760 | ||
19420d00 | 7761 | return |
92af500d NS |
7762 | resolve_address_of_overloaded_function (lhstype, fns, flags_in, |
7763 | /*template_only=*/true, | |
eff3a276 | 7764 | args, access_path); |
2bdb0643 | 7765 | } |
386b8a85 | 7766 | |
2c73f9f5 | 7767 | case OVERLOAD: |
a723baf1 | 7768 | case FUNCTION_DECL: |
c8094d83 | 7769 | return |
92af500d NS |
7770 | resolve_address_of_overloaded_function (lhstype, rhs, flags_in, |
7771 | /*template_only=*/false, | |
eff3a276 MM |
7772 | /*explicit_targs=*/NULL_TREE, |
7773 | access_path); | |
2c73f9f5 | 7774 | |
ca36f057 | 7775 | case ADDR_EXPR: |
19420d00 NS |
7776 | { |
7777 | if (PTRMEM_OK_P (rhs)) | |
0cbd7506 | 7778 | flags |= tf_ptrmem_ok; |
c8094d83 | 7779 | |
ca36f057 | 7780 | return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags); |
19420d00 | 7781 | } |
ca36f057 MM |
7782 | |
7783 | case ERROR_MARK: | |
7784 | return error_mark_node; | |
7785 | ||
7786 | default: | |
8dc2b103 | 7787 | gcc_unreachable (); |
ca36f057 | 7788 | } |
8dc2b103 | 7789 | return error_mark_node; |
ca36f057 MM |
7790 | } |
7791 | \f | |
7792 | /* Return the name of the virtual function pointer field | |
7793 | (as an IDENTIFIER_NODE) for the given TYPE. Note that | |
7794 | this may have to look back through base types to find the | |
7795 | ultimate field name. (For single inheritance, these could | |
7796 | all be the same name. Who knows for multiple inheritance). */ | |
7797 | ||
7798 | static tree | |
94edc4ab | 7799 | get_vfield_name (tree type) |
ca36f057 | 7800 | { |
37a247a0 | 7801 | tree binfo, base_binfo; |
ca36f057 MM |
7802 | char *buf; |
7803 | ||
37a247a0 | 7804 | for (binfo = TYPE_BINFO (type); |
fa743e8c | 7805 | BINFO_N_BASE_BINFOS (binfo); |
37a247a0 NS |
7806 | binfo = base_binfo) |
7807 | { | |
7808 | base_binfo = BINFO_BASE_BINFO (binfo, 0); | |
ca36f057 | 7809 | |
37a247a0 NS |
7810 | if (BINFO_VIRTUAL_P (base_binfo) |
7811 | || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo))) | |
7812 | break; | |
7813 | } | |
c8094d83 | 7814 | |
ca36f057 | 7815 | type = BINFO_TYPE (binfo); |
67f5655f | 7816 | buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT) |
3db45ab5 | 7817 | + TYPE_NAME_LENGTH (type) + 2); |
ea122333 JM |
7818 | sprintf (buf, VFIELD_NAME_FORMAT, |
7819 | IDENTIFIER_POINTER (constructor_name (type))); | |
ca36f057 MM |
7820 | return get_identifier (buf); |
7821 | } | |
7822 | ||
7823 | void | |
94edc4ab | 7824 | print_class_statistics (void) |
ca36f057 | 7825 | { |
7aa6d18a SB |
7826 | if (! GATHER_STATISTICS) |
7827 | return; | |
7828 | ||
ca36f057 MM |
7829 | fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness); |
7830 | fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs); | |
ca36f057 MM |
7831 | if (n_vtables) |
7832 | { | |
7833 | fprintf (stderr, "vtables = %d; vtable searches = %d\n", | |
7834 | n_vtables, n_vtable_searches); | |
7835 | fprintf (stderr, "vtable entries = %d; vtable elems = %d\n", | |
7836 | n_vtable_entries, n_vtable_elems); | |
7837 | } | |
ca36f057 MM |
7838 | } |
7839 | ||
7840 | /* Build a dummy reference to ourselves so Derived::Base (and A::A) works, | |
7841 | according to [class]: | |
0cbd7506 | 7842 | The class-name is also inserted |
ca36f057 MM |
7843 | into the scope of the class itself. For purposes of access checking, |
7844 | the inserted class name is treated as if it were a public member name. */ | |
7845 | ||
7846 | void | |
94edc4ab | 7847 | build_self_reference (void) |
ca36f057 MM |
7848 | { |
7849 | tree name = constructor_name (current_class_type); | |
7850 | tree value = build_lang_decl (TYPE_DECL, name, current_class_type); | |
7851 | tree saved_cas; | |
7852 | ||
7853 | DECL_NONLOCAL (value) = 1; | |
7854 | DECL_CONTEXT (value) = current_class_type; | |
7855 | DECL_ARTIFICIAL (value) = 1; | |
a3d87771 | 7856 | SET_DECL_SELF_REFERENCE_P (value); |
6f1abb06 | 7857 | set_underlying_type (value); |
ca36f057 MM |
7858 | |
7859 | if (processing_template_decl) | |
7860 | value = push_template_decl (value); | |
7861 | ||
7862 | saved_cas = current_access_specifier; | |
7863 | current_access_specifier = access_public_node; | |
7864 | finish_member_declaration (value); | |
7865 | current_access_specifier = saved_cas; | |
7866 | } | |
7867 | ||
7868 | /* Returns 1 if TYPE contains only padding bytes. */ | |
7869 | ||
7870 | int | |
94edc4ab | 7871 | is_empty_class (tree type) |
ca36f057 | 7872 | { |
ca36f057 MM |
7873 | if (type == error_mark_node) |
7874 | return 0; | |
7875 | ||
2588c9e9 | 7876 | if (! CLASS_TYPE_P (type)) |
ca36f057 MM |
7877 | return 0; |
7878 | ||
90d84934 | 7879 | return CLASSTYPE_EMPTY_P (type); |
ca36f057 MM |
7880 | } |
7881 | ||
2588c9e9 | 7882 | /* Returns true if TYPE contains no actual data, just various |
0930cc0e | 7883 | possible combinations of empty classes and possibly a vptr. */ |
2588c9e9 JM |
7884 | |
7885 | bool | |
7886 | is_really_empty_class (tree type) | |
7887 | { | |
2588c9e9 JM |
7888 | if (CLASS_TYPE_P (type)) |
7889 | { | |
7890 | tree field; | |
7891 | tree binfo; | |
7892 | tree base_binfo; | |
7893 | int i; | |
7894 | ||
0930cc0e JM |
7895 | /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid |
7896 | out, but we'd like to be able to check this before then. */ | |
7897 | if (COMPLETE_TYPE_P (type) && is_empty_class (type)) | |
7898 | return true; | |
7899 | ||
2588c9e9 JM |
7900 | for (binfo = TYPE_BINFO (type), i = 0; |
7901 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7902 | if (!is_really_empty_class (BINFO_TYPE (base_binfo))) | |
7903 | return false; | |
910ad8de | 7904 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
2588c9e9 JM |
7905 | if (TREE_CODE (field) == FIELD_DECL |
7906 | && !DECL_ARTIFICIAL (field) | |
7907 | && !is_really_empty_class (TREE_TYPE (field))) | |
7908 | return false; | |
7909 | return true; | |
7910 | } | |
7911 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7912 | return is_really_empty_class (TREE_TYPE (type)); | |
7913 | return false; | |
7914 | } | |
7915 | ||
ca36f057 MM |
7916 | /* Note that NAME was looked up while the current class was being |
7917 | defined and that the result of that lookup was DECL. */ | |
7918 | ||
7919 | void | |
94edc4ab | 7920 | maybe_note_name_used_in_class (tree name, tree decl) |
ca36f057 MM |
7921 | { |
7922 | splay_tree names_used; | |
7923 | ||
7924 | /* If we're not defining a class, there's nothing to do. */ | |
39fb05d0 | 7925 | if (!(innermost_scope_kind() == sk_class |
d5f4eddd JM |
7926 | && TYPE_BEING_DEFINED (current_class_type) |
7927 | && !LAMBDA_TYPE_P (current_class_type))) | |
ca36f057 | 7928 | return; |
c8094d83 | 7929 | |
ca36f057 MM |
7930 | /* If there's already a binding for this NAME, then we don't have |
7931 | anything to worry about. */ | |
c8094d83 | 7932 | if (lookup_member (current_class_type, name, |
db422ace | 7933 | /*protect=*/0, /*want_type=*/false, tf_warning_or_error)) |
ca36f057 MM |
7934 | return; |
7935 | ||
7936 | if (!current_class_stack[current_class_depth - 1].names_used) | |
7937 | current_class_stack[current_class_depth - 1].names_used | |
7938 | = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
7939 | names_used = current_class_stack[current_class_depth - 1].names_used; | |
7940 | ||
7941 | splay_tree_insert (names_used, | |
c8094d83 | 7942 | (splay_tree_key) name, |
ca36f057 MM |
7943 | (splay_tree_value) decl); |
7944 | } | |
7945 | ||
7946 | /* Note that NAME was declared (as DECL) in the current class. Check | |
0e339752 | 7947 | to see that the declaration is valid. */ |
ca36f057 MM |
7948 | |
7949 | void | |
94edc4ab | 7950 | note_name_declared_in_class (tree name, tree decl) |
ca36f057 MM |
7951 | { |
7952 | splay_tree names_used; | |
7953 | splay_tree_node n; | |
7954 | ||
7955 | /* Look to see if we ever used this name. */ | |
c8094d83 | 7956 | names_used |
ca36f057 MM |
7957 | = current_class_stack[current_class_depth - 1].names_used; |
7958 | if (!names_used) | |
7959 | return; | |
8ce1235b KT |
7960 | /* The C language allows members to be declared with a type of the same |
7961 | name, and the C++ standard says this diagnostic is not required. So | |
7962 | allow it in extern "C" blocks unless predantic is specified. | |
7963 | Allow it in all cases if -ms-extensions is specified. */ | |
7964 | if ((!pedantic && current_lang_name == lang_name_c) | |
7965 | || flag_ms_extensions) | |
7966 | return; | |
ca36f057 MM |
7967 | n = splay_tree_lookup (names_used, (splay_tree_key) name); |
7968 | if (n) | |
7969 | { | |
7970 | /* [basic.scope.class] | |
c8094d83 | 7971 | |
ca36f057 MM |
7972 | A name N used in a class S shall refer to the same declaration |
7973 | in its context and when re-evaluated in the completed scope of | |
7974 | S. */ | |
cbe5f3b3 MLI |
7975 | permerror (input_location, "declaration of %q#D", decl); |
7976 | permerror (input_location, "changes meaning of %qD from %q+#D", | |
2ae2031e | 7977 | DECL_NAME (OVL_CURRENT (decl)), (tree) n->value); |
ca36f057 MM |
7978 | } |
7979 | } | |
7980 | ||
3461fba7 NS |
7981 | /* Returns the VAR_DECL for the complete vtable associated with BINFO. |
7982 | Secondary vtables are merged with primary vtables; this function | |
7983 | will return the VAR_DECL for the primary vtable. */ | |
ca36f057 | 7984 | |
c35cce41 | 7985 | tree |
94edc4ab | 7986 | get_vtbl_decl_for_binfo (tree binfo) |
c35cce41 MM |
7987 | { |
7988 | tree decl; | |
7989 | ||
7990 | decl = BINFO_VTABLE (binfo); | |
5be014d5 | 7991 | if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR) |
c35cce41 | 7992 | { |
50bc768d | 7993 | gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR); |
c35cce41 MM |
7994 | decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0); |
7995 | } | |
7996 | if (decl) | |
5a6ccc94 | 7997 | gcc_assert (VAR_P (decl)); |
c35cce41 MM |
7998 | return decl; |
7999 | } | |
8000 | ||
911a71a7 | 8001 | |
dbbf88d1 NS |
8002 | /* Returns the binfo for the primary base of BINFO. If the resulting |
8003 | BINFO is a virtual base, and it is inherited elsewhere in the | |
8004 | hierarchy, then the returned binfo might not be the primary base of | |
8005 | BINFO in the complete object. Check BINFO_PRIMARY_P or | |
8006 | BINFO_LOST_PRIMARY_P to be sure. */ | |
911a71a7 | 8007 | |
b5791fdc | 8008 | static tree |
94edc4ab | 8009 | get_primary_binfo (tree binfo) |
911a71a7 MM |
8010 | { |
8011 | tree primary_base; | |
c8094d83 | 8012 | |
911a71a7 MM |
8013 | primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo)); |
8014 | if (!primary_base) | |
8015 | return NULL_TREE; | |
8016 | ||
b5791fdc | 8017 | return copied_binfo (primary_base, binfo); |
911a71a7 MM |
8018 | } |
8019 | ||
838dfd8a | 8020 | /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */ |
b7442fb5 NS |
8021 | |
8022 | static int | |
94edc4ab | 8023 | maybe_indent_hierarchy (FILE * stream, int indent, int indented_p) |
b7442fb5 NS |
8024 | { |
8025 | if (!indented_p) | |
8026 | fprintf (stream, "%*s", indent, ""); | |
8027 | return 1; | |
8028 | } | |
8029 | ||
dbbf88d1 NS |
8030 | /* Dump the offsets of all the bases rooted at BINFO to STREAM. |
8031 | INDENT should be zero when called from the top level; it is | |
8032 | incremented recursively. IGO indicates the next expected BINFO in | |
9bcb9aae | 8033 | inheritance graph ordering. */ |
c35cce41 | 8034 | |
dbbf88d1 NS |
8035 | static tree |
8036 | dump_class_hierarchy_r (FILE *stream, | |
0cbd7506 MS |
8037 | int flags, |
8038 | tree binfo, | |
8039 | tree igo, | |
8040 | int indent) | |
ca36f057 | 8041 | { |
b7442fb5 | 8042 | int indented = 0; |
fa743e8c NS |
8043 | tree base_binfo; |
8044 | int i; | |
c8094d83 | 8045 | |
b7442fb5 | 8046 | indented = maybe_indent_hierarchy (stream, indent, 0); |
6c5bf58a | 8047 | fprintf (stream, "%s (0x" HOST_WIDE_INT_PRINT_HEX ") ", |
fc6633e0 | 8048 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER), |
6c5bf58a | 8049 | (HOST_WIDE_INT) (uintptr_t) binfo); |
dbbf88d1 NS |
8050 | if (binfo != igo) |
8051 | { | |
8052 | fprintf (stream, "alternative-path\n"); | |
8053 | return igo; | |
8054 | } | |
8055 | igo = TREE_CHAIN (binfo); | |
c8094d83 | 8056 | |
9965d119 | 8057 | fprintf (stream, HOST_WIDE_INT_PRINT_DEC, |
9439e9a1 | 8058 | tree_to_shwi (BINFO_OFFSET (binfo))); |
9965d119 NS |
8059 | if (is_empty_class (BINFO_TYPE (binfo))) |
8060 | fprintf (stream, " empty"); | |
8061 | else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo))) | |
8062 | fprintf (stream, " nearly-empty"); | |
809e3e7f | 8063 | if (BINFO_VIRTUAL_P (binfo)) |
dbbf88d1 | 8064 | fprintf (stream, " virtual"); |
9965d119 | 8065 | fprintf (stream, "\n"); |
ca36f057 | 8066 | |
b7442fb5 | 8067 | indented = 0; |
fc6633e0 | 8068 | if (BINFO_PRIMARY_P (binfo)) |
b7442fb5 NS |
8069 | { |
8070 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
6c5bf58a | 8071 | fprintf (stream, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX ")", |
fc6633e0 | 8072 | type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)), |
b7442fb5 | 8073 | TFF_PLAIN_IDENTIFIER), |
6c5bf58a | 8074 | (HOST_WIDE_INT) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo)); |
b7442fb5 NS |
8075 | } |
8076 | if (BINFO_LOST_PRIMARY_P (binfo)) | |
8077 | { | |
8078 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8079 | fprintf (stream, " lost-primary"); | |
8080 | } | |
8081 | if (indented) | |
8082 | fprintf (stream, "\n"); | |
8083 | ||
8084 | if (!(flags & TDF_SLIM)) | |
8085 | { | |
8086 | int indented = 0; | |
c8094d83 | 8087 | |
b7442fb5 NS |
8088 | if (BINFO_SUBVTT_INDEX (binfo)) |
8089 | { | |
8090 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8091 | fprintf (stream, " subvttidx=%s", | |
8092 | expr_as_string (BINFO_SUBVTT_INDEX (binfo), | |
8093 | TFF_PLAIN_IDENTIFIER)); | |
8094 | } | |
8095 | if (BINFO_VPTR_INDEX (binfo)) | |
8096 | { | |
8097 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8098 | fprintf (stream, " vptridx=%s", | |
8099 | expr_as_string (BINFO_VPTR_INDEX (binfo), | |
8100 | TFF_PLAIN_IDENTIFIER)); | |
8101 | } | |
8102 | if (BINFO_VPTR_FIELD (binfo)) | |
8103 | { | |
8104 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8105 | fprintf (stream, " vbaseoffset=%s", | |
8106 | expr_as_string (BINFO_VPTR_FIELD (binfo), | |
8107 | TFF_PLAIN_IDENTIFIER)); | |
8108 | } | |
8109 | if (BINFO_VTABLE (binfo)) | |
8110 | { | |
8111 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
8112 | fprintf (stream, " vptr=%s", | |
8113 | expr_as_string (BINFO_VTABLE (binfo), | |
8114 | TFF_PLAIN_IDENTIFIER)); | |
8115 | } | |
c8094d83 | 8116 | |
b7442fb5 NS |
8117 | if (indented) |
8118 | fprintf (stream, "\n"); | |
8119 | } | |
dbbf88d1 | 8120 | |
fa743e8c NS |
8121 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
8122 | igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2); | |
c8094d83 | 8123 | |
dbbf88d1 | 8124 | return igo; |
c35cce41 MM |
8125 | } |
8126 | ||
8127 | /* Dump the BINFO hierarchy for T. */ | |
8128 | ||
b7442fb5 | 8129 | static void |
bb885938 | 8130 | dump_class_hierarchy_1 (FILE *stream, int flags, tree t) |
c35cce41 | 8131 | { |
b7442fb5 NS |
8132 | fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
8133 | fprintf (stream, " size=%lu align=%lu\n", | |
9439e9a1 | 8134 | (unsigned long)(tree_to_shwi (TYPE_SIZE (t)) / BITS_PER_UNIT), |
b7442fb5 | 8135 | (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT)); |
dbbf88d1 | 8136 | fprintf (stream, " base size=%lu base align=%lu\n", |
9439e9a1 | 8137 | (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t))) |
dbbf88d1 NS |
8138 | / BITS_PER_UNIT), |
8139 | (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t)) | |
8140 | / BITS_PER_UNIT)); | |
8141 | dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0); | |
b7442fb5 | 8142 | fprintf (stream, "\n"); |
bb885938 NS |
8143 | } |
8144 | ||
da1d7781 | 8145 | /* Debug interface to hierarchy dumping. */ |
bb885938 | 8146 | |
ac1f3b7e | 8147 | void |
bb885938 NS |
8148 | debug_class (tree t) |
8149 | { | |
8150 | dump_class_hierarchy_1 (stderr, TDF_SLIM, t); | |
8151 | } | |
8152 | ||
8153 | static void | |
8154 | dump_class_hierarchy (tree t) | |
8155 | { | |
8156 | int flags; | |
f8a36c78 | 8157 | FILE *stream = get_dump_info (TDI_class, &flags); |
bb885938 NS |
8158 | |
8159 | if (stream) | |
8160 | { | |
8161 | dump_class_hierarchy_1 (stream, flags, t); | |
bb885938 | 8162 | } |
b7442fb5 NS |
8163 | } |
8164 | ||
8165 | static void | |
94edc4ab | 8166 | dump_array (FILE * stream, tree decl) |
b7442fb5 | 8167 | { |
4038c495 GB |
8168 | tree value; |
8169 | unsigned HOST_WIDE_INT ix; | |
b7442fb5 NS |
8170 | HOST_WIDE_INT elt; |
8171 | tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl))); | |
8172 | ||
9439e9a1 | 8173 | elt = (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl)))) |
b7442fb5 NS |
8174 | / BITS_PER_UNIT); |
8175 | fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER)); | |
8176 | fprintf (stream, " %s entries", | |
8177 | expr_as_string (size_binop (PLUS_EXPR, size, size_one_node), | |
8178 | TFF_PLAIN_IDENTIFIER)); | |
8179 | fprintf (stream, "\n"); | |
8180 | ||
4038c495 GB |
8181 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)), |
8182 | ix, value) | |
4fdc14ca | 8183 | fprintf (stream, "%-4ld %s\n", (long)(ix * elt), |
4038c495 | 8184 | expr_as_string (value, TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
8185 | } |
8186 | ||
8187 | static void | |
94edc4ab | 8188 | dump_vtable (tree t, tree binfo, tree vtable) |
b7442fb5 NS |
8189 | { |
8190 | int flags; | |
f8a36c78 | 8191 | FILE *stream = get_dump_info (TDI_class, &flags); |
b7442fb5 NS |
8192 | |
8193 | if (!stream) | |
8194 | return; | |
8195 | ||
8196 | if (!(flags & TDF_SLIM)) | |
9965d119 | 8197 | { |
b7442fb5 | 8198 | int ctor_vtbl_p = TYPE_BINFO (t) != binfo; |
c8094d83 | 8199 | |
b7442fb5 NS |
8200 | fprintf (stream, "%s for %s", |
8201 | ctor_vtbl_p ? "Construction vtable" : "Vtable", | |
fc6633e0 | 8202 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
8203 | if (ctor_vtbl_p) |
8204 | { | |
809e3e7f | 8205 | if (!BINFO_VIRTUAL_P (binfo)) |
6c5bf58a KT |
8206 | fprintf (stream, " (0x" HOST_WIDE_INT_PRINT_HEX " instance)", |
8207 | (HOST_WIDE_INT) (uintptr_t) binfo); | |
b7442fb5 NS |
8208 | fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
8209 | } | |
8210 | fprintf (stream, "\n"); | |
8211 | dump_array (stream, vtable); | |
8212 | fprintf (stream, "\n"); | |
9965d119 | 8213 | } |
b7442fb5 NS |
8214 | } |
8215 | ||
8216 | static void | |
94edc4ab | 8217 | dump_vtt (tree t, tree vtt) |
b7442fb5 NS |
8218 | { |
8219 | int flags; | |
f8a36c78 | 8220 | FILE *stream = get_dump_info (TDI_class, &flags); |
b7442fb5 NS |
8221 | |
8222 | if (!stream) | |
8223 | return; | |
8224 | ||
8225 | if (!(flags & TDF_SLIM)) | |
8226 | { | |
8227 | fprintf (stream, "VTT for %s\n", | |
8228 | type_as_string (t, TFF_PLAIN_IDENTIFIER)); | |
8229 | dump_array (stream, vtt); | |
8230 | fprintf (stream, "\n"); | |
8231 | } | |
ca36f057 MM |
8232 | } |
8233 | ||
bb885938 NS |
8234 | /* Dump a function or thunk and its thunkees. */ |
8235 | ||
8236 | static void | |
8237 | dump_thunk (FILE *stream, int indent, tree thunk) | |
8238 | { | |
8239 | static const char spaces[] = " "; | |
8240 | tree name = DECL_NAME (thunk); | |
8241 | tree thunks; | |
c8094d83 | 8242 | |
bb885938 NS |
8243 | fprintf (stream, "%.*s%p %s %s", indent, spaces, |
8244 | (void *)thunk, | |
8245 | !DECL_THUNK_P (thunk) ? "function" | |
8246 | : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk", | |
8247 | name ? IDENTIFIER_POINTER (name) : "<unset>"); | |
e00853fd | 8248 | if (DECL_THUNK_P (thunk)) |
bb885938 NS |
8249 | { |
8250 | HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk); | |
8251 | tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk); | |
8252 | ||
8253 | fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust); | |
8254 | if (!virtual_adjust) | |
8255 | /*NOP*/; | |
8256 | else if (DECL_THIS_THUNK_P (thunk)) | |
8257 | fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC, | |
9439e9a1 | 8258 | tree_to_shwi (virtual_adjust)); |
bb885938 NS |
8259 | else |
8260 | fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)", | |
9439e9a1 | 8261 | tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust)), |
bb885938 | 8262 | type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE)); |
e00853fd NS |
8263 | if (THUNK_ALIAS (thunk)) |
8264 | fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk)); | |
bb885938 NS |
8265 | } |
8266 | fprintf (stream, "\n"); | |
8267 | for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks)) | |
8268 | dump_thunk (stream, indent + 2, thunks); | |
8269 | } | |
8270 | ||
8271 | /* Dump the thunks for FN. */ | |
8272 | ||
ac1f3b7e | 8273 | void |
bb885938 NS |
8274 | debug_thunks (tree fn) |
8275 | { | |
8276 | dump_thunk (stderr, 0, fn); | |
8277 | } | |
8278 | ||
ca36f057 MM |
8279 | /* Virtual function table initialization. */ |
8280 | ||
8281 | /* Create all the necessary vtables for T and its base classes. */ | |
8282 | ||
8283 | static void | |
94edc4ab | 8284 | finish_vtbls (tree t) |
ca36f057 | 8285 | { |
3461fba7 | 8286 | tree vbase; |
9771b263 | 8287 | vec<constructor_elt, va_gc> *v = NULL; |
9d6a019c | 8288 | tree vtable = BINFO_VTABLE (TYPE_BINFO (t)); |
ca36f057 | 8289 | |
3461fba7 NS |
8290 | /* We lay out the primary and secondary vtables in one contiguous |
8291 | vtable. The primary vtable is first, followed by the non-virtual | |
8292 | secondary vtables in inheritance graph order. */ | |
9d6a019c NF |
8293 | accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t), TYPE_BINFO (t), |
8294 | vtable, t, &v); | |
c8094d83 | 8295 | |
3461fba7 NS |
8296 | /* Then come the virtual bases, also in inheritance graph order. */ |
8297 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) | |
8298 | { | |
809e3e7f | 8299 | if (!BINFO_VIRTUAL_P (vbase)) |
3461fba7 | 8300 | continue; |
9d6a019c | 8301 | accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), vtable, t, &v); |
ff668506 JM |
8302 | } |
8303 | ||
604a3205 | 8304 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
9d6a019c | 8305 | initialize_vtable (TYPE_BINFO (t), v); |
ca36f057 MM |
8306 | } |
8307 | ||
8308 | /* Initialize the vtable for BINFO with the INITS. */ | |
8309 | ||
8310 | static void | |
9771b263 | 8311 | initialize_vtable (tree binfo, vec<constructor_elt, va_gc> *inits) |
ca36f057 | 8312 | { |
ca36f057 MM |
8313 | tree decl; |
8314 | ||
9771b263 | 8315 | layout_vtable_decl (binfo, vec_safe_length (inits)); |
c35cce41 | 8316 | decl = get_vtbl_decl_for_binfo (binfo); |
19c29b2f | 8317 | initialize_artificial_var (decl, inits); |
b7442fb5 | 8318 | dump_vtable (BINFO_TYPE (binfo), binfo, decl); |
23656158 MM |
8319 | } |
8320 | ||
9965d119 NS |
8321 | /* Build the VTT (virtual table table) for T. |
8322 | A class requires a VTT if it has virtual bases. | |
c8094d83 | 8323 | |
9965d119 NS |
8324 | This holds |
8325 | 1 - primary virtual pointer for complete object T | |
90ecce3e JM |
8326 | 2 - secondary VTTs for each direct non-virtual base of T which requires a |
8327 | VTT | |
9965d119 NS |
8328 | 3 - secondary virtual pointers for each direct or indirect base of T which |
8329 | has virtual bases or is reachable via a virtual path from T. | |
8330 | 4 - secondary VTTs for each direct or indirect virtual base of T. | |
c8094d83 | 8331 | |
9965d119 | 8332 | Secondary VTTs look like complete object VTTs without part 4. */ |
23656158 MM |
8333 | |
8334 | static void | |
94edc4ab | 8335 | build_vtt (tree t) |
23656158 | 8336 | { |
23656158 MM |
8337 | tree type; |
8338 | tree vtt; | |
3ec6bad3 | 8339 | tree index; |
9771b263 | 8340 | vec<constructor_elt, va_gc> *inits; |
23656158 | 8341 | |
23656158 | 8342 | /* Build up the initializers for the VTT. */ |
9d6a019c | 8343 | inits = NULL; |
3ec6bad3 | 8344 | index = size_zero_node; |
9965d119 | 8345 | build_vtt_inits (TYPE_BINFO (t), t, &inits, &index); |
23656158 MM |
8346 | |
8347 | /* If we didn't need a VTT, we're done. */ | |
8348 | if (!inits) | |
8349 | return; | |
8350 | ||
8351 | /* Figure out the type of the VTT. */ | |
dcedcddb | 8352 | type = build_array_of_n_type (const_ptr_type_node, |
9771b263 | 8353 | inits->length ()); |
c8094d83 | 8354 | |
23656158 | 8355 | /* Now, build the VTT object itself. */ |
3e355d92 | 8356 | vtt = build_vtable (t, mangle_vtt_for_type (t), type); |
19c29b2f | 8357 | initialize_artificial_var (vtt, inits); |
548502d3 | 8358 | /* Add the VTT to the vtables list. */ |
910ad8de NF |
8359 | DECL_CHAIN (vtt) = DECL_CHAIN (CLASSTYPE_VTABLES (t)); |
8360 | DECL_CHAIN (CLASSTYPE_VTABLES (t)) = vtt; | |
b7442fb5 NS |
8361 | |
8362 | dump_vtt (t, vtt); | |
23656158 MM |
8363 | } |
8364 | ||
13de7ec4 JM |
8365 | /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with |
8366 | PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo, | |
8367 | and CHAIN the vtable pointer for this binfo after construction is | |
00a17e31 | 8368 | complete. VALUE can also be another BINFO, in which case we recurse. */ |
13de7ec4 JM |
8369 | |
8370 | static tree | |
94edc4ab | 8371 | binfo_ctor_vtable (tree binfo) |
13de7ec4 JM |
8372 | { |
8373 | tree vt; | |
8374 | ||
8375 | while (1) | |
8376 | { | |
8377 | vt = BINFO_VTABLE (binfo); | |
8378 | if (TREE_CODE (vt) == TREE_LIST) | |
8379 | vt = TREE_VALUE (vt); | |
95b4aca6 | 8380 | if (TREE_CODE (vt) == TREE_BINFO) |
13de7ec4 JM |
8381 | binfo = vt; |
8382 | else | |
8383 | break; | |
8384 | } | |
8385 | ||
8386 | return vt; | |
8387 | } | |
8388 | ||
a3a0fc7f NS |
8389 | /* Data for secondary VTT initialization. */ |
8390 | typedef struct secondary_vptr_vtt_init_data_s | |
8391 | { | |
8392 | /* Is this the primary VTT? */ | |
8393 | bool top_level_p; | |
8394 | ||
8395 | /* Current index into the VTT. */ | |
8396 | tree index; | |
8397 | ||
9d6a019c | 8398 | /* Vector of initializers built up. */ |
9771b263 | 8399 | vec<constructor_elt, va_gc> *inits; |
a3a0fc7f NS |
8400 | |
8401 | /* The type being constructed by this secondary VTT. */ | |
8402 | tree type_being_constructed; | |
8403 | } secondary_vptr_vtt_init_data; | |
8404 | ||
23656158 | 8405 | /* Recursively build the VTT-initializer for BINFO (which is in the |
9965d119 NS |
8406 | hierarchy dominated by T). INITS points to the end of the initializer |
8407 | list to date. INDEX is the VTT index where the next element will be | |
8408 | replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e. | |
8409 | not a subvtt for some base of T). When that is so, we emit the sub-VTTs | |
8410 | for virtual bases of T. When it is not so, we build the constructor | |
8411 | vtables for the BINFO-in-T variant. */ | |
23656158 | 8412 | |
9d6a019c | 8413 | static void |
9771b263 DN |
8414 | build_vtt_inits (tree binfo, tree t, vec<constructor_elt, va_gc> **inits, |
8415 | tree *index) | |
23656158 MM |
8416 | { |
8417 | int i; | |
8418 | tree b; | |
8419 | tree init; | |
a3a0fc7f | 8420 | secondary_vptr_vtt_init_data data; |
539ed333 | 8421 | int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
23656158 MM |
8422 | |
8423 | /* We only need VTTs for subobjects with virtual bases. */ | |
5775a06a | 8424 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
9d6a019c | 8425 | return; |
23656158 MM |
8426 | |
8427 | /* We need to use a construction vtable if this is not the primary | |
8428 | VTT. */ | |
9965d119 | 8429 | if (!top_level_p) |
3ec6bad3 MM |
8430 | { |
8431 | build_ctor_vtbl_group (binfo, t); | |
8432 | ||
8433 | /* Record the offset in the VTT where this sub-VTT can be found. */ | |
8434 | BINFO_SUBVTT_INDEX (binfo) = *index; | |
8435 | } | |
23656158 MM |
8436 | |
8437 | /* Add the address of the primary vtable for the complete object. */ | |
13de7ec4 | 8438 | init = binfo_ctor_vtable (binfo); |
9d6a019c | 8439 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
9965d119 NS |
8440 | if (top_level_p) |
8441 | { | |
50bc768d | 8442 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
9965d119 NS |
8443 | BINFO_VPTR_INDEX (binfo) = *index; |
8444 | } | |
3ec6bad3 | 8445 | *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node)); |
c8094d83 | 8446 | |
23656158 | 8447 | /* Recursively add the secondary VTTs for non-virtual bases. */ |
fa743e8c NS |
8448 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i) |
8449 | if (!BINFO_VIRTUAL_P (b)) | |
9d6a019c | 8450 | build_vtt_inits (b, t, inits, index); |
c8094d83 | 8451 | |
23656158 | 8452 | /* Add secondary virtual pointers for all subobjects of BINFO with |
9965d119 NS |
8453 | either virtual bases or reachable along a virtual path, except |
8454 | subobjects that are non-virtual primary bases. */ | |
a3a0fc7f NS |
8455 | data.top_level_p = top_level_p; |
8456 | data.index = *index; | |
9d6a019c | 8457 | data.inits = *inits; |
a3a0fc7f | 8458 | data.type_being_constructed = BINFO_TYPE (binfo); |
c8094d83 | 8459 | |
5d5a519f | 8460 | dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data); |
9965d119 | 8461 | |
a3a0fc7f | 8462 | *index = data.index; |
23656158 | 8463 | |
9d6a019c NF |
8464 | /* data.inits might have grown as we added secondary virtual pointers. |
8465 | Make sure our caller knows about the new vector. */ | |
8466 | *inits = data.inits; | |
23656158 | 8467 | |
9965d119 | 8468 | if (top_level_p) |
a3a0fc7f NS |
8469 | /* Add the secondary VTTs for virtual bases in inheritance graph |
8470 | order. */ | |
9ccf6541 MM |
8471 | for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b)) |
8472 | { | |
809e3e7f | 8473 | if (!BINFO_VIRTUAL_P (b)) |
9ccf6541 | 8474 | continue; |
c8094d83 | 8475 | |
9d6a019c | 8476 | build_vtt_inits (b, t, inits, index); |
9ccf6541 | 8477 | } |
a3a0fc7f NS |
8478 | else |
8479 | /* Remove the ctor vtables we created. */ | |
5d5a519f | 8480 | dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo); |
23656158 MM |
8481 | } |
8482 | ||
8df83eae | 8483 | /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base |
a3a0fc7f | 8484 | in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */ |
23656158 MM |
8485 | |
8486 | static tree | |
a3a0fc7f | 8487 | dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_) |
23656158 | 8488 | { |
a3a0fc7f | 8489 | secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_; |
23656158 | 8490 | |
23656158 MM |
8491 | /* We don't care about bases that don't have vtables. */ |
8492 | if (!TYPE_VFIELD (BINFO_TYPE (binfo))) | |
5d5a519f | 8493 | return dfs_skip_bases; |
23656158 | 8494 | |
a3a0fc7f NS |
8495 | /* We're only interested in proper subobjects of the type being |
8496 | constructed. */ | |
539ed333 | 8497 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed)) |
23656158 MM |
8498 | return NULL_TREE; |
8499 | ||
a3a0fc7f NS |
8500 | /* We're only interested in bases with virtual bases or reachable |
8501 | via a virtual path from the type being constructed. */ | |
5d5a519f NS |
8502 | if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
8503 | || binfo_via_virtual (binfo, data->type_being_constructed))) | |
8504 | return dfs_skip_bases; | |
c8094d83 | 8505 | |
5d5a519f NS |
8506 | /* We're not interested in non-virtual primary bases. */ |
8507 | if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo)) | |
db3d8cde | 8508 | return NULL_TREE; |
c8094d83 | 8509 | |
3ec6bad3 | 8510 | /* Record the index where this secondary vptr can be found. */ |
a3a0fc7f | 8511 | if (data->top_level_p) |
9965d119 | 8512 | { |
50bc768d | 8513 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
a3a0fc7f | 8514 | BINFO_VPTR_INDEX (binfo) = data->index; |
3ec6bad3 | 8515 | |
a3a0fc7f NS |
8516 | if (BINFO_VIRTUAL_P (binfo)) |
8517 | { | |
0cbd7506 MS |
8518 | /* It's a primary virtual base, and this is not a |
8519 | construction vtable. Find the base this is primary of in | |
8520 | the inheritance graph, and use that base's vtable | |
8521 | now. */ | |
a3a0fc7f NS |
8522 | while (BINFO_PRIMARY_P (binfo)) |
8523 | binfo = BINFO_INHERITANCE_CHAIN (binfo); | |
8524 | } | |
9965d119 | 8525 | } |
c8094d83 | 8526 | |
a3a0fc7f | 8527 | /* Add the initializer for the secondary vptr itself. */ |
9d6a019c | 8528 | CONSTRUCTOR_APPEND_ELT (data->inits, NULL_TREE, binfo_ctor_vtable (binfo)); |
23656158 | 8529 | |
a3a0fc7f NS |
8530 | /* Advance the vtt index. */ |
8531 | data->index = size_binop (PLUS_EXPR, data->index, | |
8532 | TYPE_SIZE_UNIT (ptr_type_node)); | |
9965d119 | 8533 | |
a3a0fc7f | 8534 | return NULL_TREE; |
9965d119 NS |
8535 | } |
8536 | ||
a3a0fc7f NS |
8537 | /* Called from build_vtt_inits via dfs_walk. After building |
8538 | constructor vtables and generating the sub-vtt from them, we need | |
8539 | to restore the BINFO_VTABLES that were scribbled on. DATA is the | |
8540 | binfo of the base whose sub vtt was generated. */ | |
23656158 MM |
8541 | |
8542 | static tree | |
94edc4ab | 8543 | dfs_fixup_binfo_vtbls (tree binfo, void* data) |
23656158 | 8544 | { |
a3a0fc7f | 8545 | tree vtable = BINFO_VTABLE (binfo); |
23656158 | 8546 | |
5d5a519f NS |
8547 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8548 | /* If this class has no vtable, none of its bases do. */ | |
8549 | return dfs_skip_bases; | |
c8094d83 | 8550 | |
5d5a519f NS |
8551 | if (!vtable) |
8552 | /* This might be a primary base, so have no vtable in this | |
8553 | hierarchy. */ | |
8554 | return NULL_TREE; | |
c8094d83 | 8555 | |
23656158 MM |
8556 | /* If we scribbled the construction vtable vptr into BINFO, clear it |
8557 | out now. */ | |
5d5a519f | 8558 | if (TREE_CODE (vtable) == TREE_LIST |
a3a0fc7f NS |
8559 | && (TREE_PURPOSE (vtable) == (tree) data)) |
8560 | BINFO_VTABLE (binfo) = TREE_CHAIN (vtable); | |
23656158 MM |
8561 | |
8562 | return NULL_TREE; | |
8563 | } | |
8564 | ||
8565 | /* Build the construction vtable group for BINFO which is in the | |
8566 | hierarchy dominated by T. */ | |
8567 | ||
8568 | static void | |
94edc4ab | 8569 | build_ctor_vtbl_group (tree binfo, tree t) |
23656158 | 8570 | { |
23656158 MM |
8571 | tree type; |
8572 | tree vtbl; | |
23656158 | 8573 | tree id; |
9ccf6541 | 8574 | tree vbase; |
9771b263 | 8575 | vec<constructor_elt, va_gc> *v; |
23656158 | 8576 | |
7bdcf888 | 8577 | /* See if we've already created this construction vtable group. */ |
1f84ec23 | 8578 | id = mangle_ctor_vtbl_for_type (t, binfo); |
23656158 MM |
8579 | if (IDENTIFIER_GLOBAL_VALUE (id)) |
8580 | return; | |
8581 | ||
539ed333 | 8582 | gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)); |
23656158 MM |
8583 | /* Build a version of VTBL (with the wrong type) for use in |
8584 | constructing the addresses of secondary vtables in the | |
8585 | construction vtable group. */ | |
459c43ad | 8586 | vtbl = build_vtable (t, id, ptr_type_node); |
505970fc | 8587 | DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1; |
2ee8a2d5 JM |
8588 | /* Don't export construction vtables from shared libraries. Even on |
8589 | targets that don't support hidden visibility, this tells | |
8590 | can_refer_decl_in_current_unit_p not to assume that it's safe to | |
8591 | access from a different compilation unit (bz 54314). */ | |
8592 | DECL_VISIBILITY (vtbl) = VISIBILITY_HIDDEN; | |
8593 | DECL_VISIBILITY_SPECIFIED (vtbl) = true; | |
9d6a019c NF |
8594 | |
8595 | v = NULL; | |
23656158 | 8596 | accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)), |
9d6a019c | 8597 | binfo, vtbl, t, &v); |
9965d119 NS |
8598 | |
8599 | /* Add the vtables for each of our virtual bases using the vbase in T | |
8600 | binfo. */ | |
c8094d83 MS |
8601 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); |
8602 | vbase; | |
9ccf6541 MM |
8603 | vbase = TREE_CHAIN (vbase)) |
8604 | { | |
8605 | tree b; | |
8606 | ||
809e3e7f | 8607 | if (!BINFO_VIRTUAL_P (vbase)) |
9ccf6541 | 8608 | continue; |
dbbf88d1 | 8609 | b = copied_binfo (vbase, binfo); |
c8094d83 | 8610 | |
9d6a019c | 8611 | accumulate_vtbl_inits (b, vbase, binfo, vtbl, t, &v); |
9ccf6541 | 8612 | } |
23656158 MM |
8613 | |
8614 | /* Figure out the type of the construction vtable. */ | |
9771b263 | 8615 | type = build_array_of_n_type (vtable_entry_type, v->length ()); |
8208d7dc | 8616 | layout_type (type); |
23656158 | 8617 | TREE_TYPE (vtbl) = type; |
8208d7dc DJ |
8618 | DECL_SIZE (vtbl) = DECL_SIZE_UNIT (vtbl) = NULL_TREE; |
8619 | layout_decl (vtbl, 0); | |
23656158 MM |
8620 | |
8621 | /* Initialize the construction vtable. */ | |
548502d3 | 8622 | CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl); |
9d6a019c | 8623 | initialize_artificial_var (vtbl, v); |
b7442fb5 | 8624 | dump_vtable (t, binfo, vtbl); |
23656158 MM |
8625 | } |
8626 | ||
9965d119 NS |
8627 | /* Add the vtbl initializers for BINFO (and its bases other than |
8628 | non-virtual primaries) to the list of INITS. BINFO is in the | |
8629 | hierarchy dominated by T. RTTI_BINFO is the binfo within T of | |
8630 | the constructor the vtbl inits should be accumulated for. (If this | |
8631 | is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).) | |
8632 | ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO). | |
8633 | BINFO is the active base equivalent of ORIG_BINFO in the inheritance | |
8634 | graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE, | |
8635 | but are not necessarily the same in terms of layout. */ | |
ca36f057 MM |
8636 | |
8637 | static void | |
94edc4ab | 8638 | accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8639 | tree orig_binfo, |
8640 | tree rtti_binfo, | |
9d6a019c | 8641 | tree vtbl, |
0cbd7506 | 8642 | tree t, |
9771b263 | 8643 | vec<constructor_elt, va_gc> **inits) |
ca36f057 | 8644 | { |
23656158 | 8645 | int i; |
fa743e8c | 8646 | tree base_binfo; |
539ed333 | 8647 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
23656158 | 8648 | |
539ed333 | 8649 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo))); |
23656158 | 8650 | |
00a17e31 | 8651 | /* If it doesn't have a vptr, we don't do anything. */ |
623fe76a NS |
8652 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8653 | return; | |
c8094d83 | 8654 | |
23656158 MM |
8655 | /* If we're building a construction vtable, we're not interested in |
8656 | subobjects that don't require construction vtables. */ | |
c8094d83 | 8657 | if (ctor_vtbl_p |
5775a06a | 8658 | && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
9965d119 | 8659 | && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo))) |
23656158 MM |
8660 | return; |
8661 | ||
8662 | /* Build the initializers for the BINFO-in-T vtable. */ | |
9d6a019c | 8663 | dfs_accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, vtbl, t, inits); |
c8094d83 | 8664 | |
c35cce41 MM |
8665 | /* Walk the BINFO and its bases. We walk in preorder so that as we |
8666 | initialize each vtable we can figure out at what offset the | |
23656158 MM |
8667 | secondary vtable lies from the primary vtable. We can't use |
8668 | dfs_walk here because we need to iterate through bases of BINFO | |
8669 | and RTTI_BINFO simultaneously. */ | |
fa743e8c | 8670 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
23656158 | 8671 | { |
23656158 | 8672 | /* Skip virtual bases. */ |
809e3e7f | 8673 | if (BINFO_VIRTUAL_P (base_binfo)) |
23656158 MM |
8674 | continue; |
8675 | accumulate_vtbl_inits (base_binfo, | |
604a3205 | 8676 | BINFO_BASE_BINFO (orig_binfo, i), |
9d6a019c | 8677 | rtti_binfo, vtbl, t, |
23656158 MM |
8678 | inits); |
8679 | } | |
ca36f057 MM |
8680 | } |
8681 | ||
9d6a019c NF |
8682 | /* Called from accumulate_vtbl_inits. Adds the initializers for the |
8683 | BINFO vtable to L. */ | |
ca36f057 | 8684 | |
9d6a019c | 8685 | static void |
94edc4ab | 8686 | dfs_accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8687 | tree orig_binfo, |
8688 | tree rtti_binfo, | |
9d6a019c | 8689 | tree orig_vtbl, |
0cbd7506 | 8690 | tree t, |
9771b263 | 8691 | vec<constructor_elt, va_gc> **l) |
ca36f057 | 8692 | { |
9965d119 | 8693 | tree vtbl = NULL_TREE; |
539ed333 | 8694 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
9d6a019c | 8695 | int n_inits; |
9965d119 | 8696 | |
13de7ec4 | 8697 | if (ctor_vtbl_p |
809e3e7f | 8698 | && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo)) |
9965d119 | 8699 | { |
13de7ec4 JM |
8700 | /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a |
8701 | primary virtual base. If it is not the same primary in | |
8702 | the hierarchy of T, we'll need to generate a ctor vtable | |
8703 | for it, to place at its location in T. If it is the same | |
8704 | primary, we still need a VTT entry for the vtable, but it | |
8705 | should point to the ctor vtable for the base it is a | |
8706 | primary for within the sub-hierarchy of RTTI_BINFO. | |
c8094d83 | 8707 | |
13de7ec4 | 8708 | There are three possible cases: |
c8094d83 | 8709 | |
13de7ec4 JM |
8710 | 1) We are in the same place. |
8711 | 2) We are a primary base within a lost primary virtual base of | |
8712 | RTTI_BINFO. | |
049d2def | 8713 | 3) We are primary to something not a base of RTTI_BINFO. */ |
c8094d83 | 8714 | |
fc6633e0 | 8715 | tree b; |
13de7ec4 | 8716 | tree last = NULL_TREE; |
85a9a0a2 | 8717 | |
13de7ec4 JM |
8718 | /* First, look through the bases we are primary to for RTTI_BINFO |
8719 | or a virtual base. */ | |
fc6633e0 NS |
8720 | b = binfo; |
8721 | while (BINFO_PRIMARY_P (b)) | |
7bdcf888 | 8722 | { |
fc6633e0 | 8723 | b = BINFO_INHERITANCE_CHAIN (b); |
13de7ec4 | 8724 | last = b; |
809e3e7f | 8725 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) |
fc6633e0 | 8726 | goto found; |
7bdcf888 | 8727 | } |
13de7ec4 JM |
8728 | /* If we run out of primary links, keep looking down our |
8729 | inheritance chain; we might be an indirect primary. */ | |
fc6633e0 NS |
8730 | for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b)) |
8731 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) | |
8732 | break; | |
8733 | found: | |
c8094d83 | 8734 | |
13de7ec4 JM |
8735 | /* If we found RTTI_BINFO, this is case 1. If we found a virtual |
8736 | base B and it is a base of RTTI_BINFO, this is case 2. In | |
8737 | either case, we share our vtable with LAST, i.e. the | |
8738 | derived-most base within B of which we are a primary. */ | |
8739 | if (b == rtti_binfo | |
58c42dc2 | 8740 | || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo)))) |
049d2def JM |
8741 | /* Just set our BINFO_VTABLE to point to LAST, as we may not have |
8742 | set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in | |
8743 | binfo_ctor_vtable after everything's been set up. */ | |
8744 | vtbl = last; | |
13de7ec4 | 8745 | |
049d2def | 8746 | /* Otherwise, this is case 3 and we get our own. */ |
9965d119 | 8747 | } |
dbbf88d1 | 8748 | else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo)) |
9d6a019c NF |
8749 | return; |
8750 | ||
9771b263 | 8751 | n_inits = vec_safe_length (*l); |
7bdcf888 | 8752 | |
9965d119 | 8753 | if (!vtbl) |
ca36f057 | 8754 | { |
c35cce41 MM |
8755 | tree index; |
8756 | int non_fn_entries; | |
8757 | ||
9d6a019c NF |
8758 | /* Add the initializer for this vtable. */ |
8759 | build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo, | |
8760 | &non_fn_entries, l); | |
c35cce41 | 8761 | |
23656158 | 8762 | /* Figure out the position to which the VPTR should point. */ |
9d6a019c | 8763 | vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, orig_vtbl); |
23656158 MM |
8764 | index = size_binop (MULT_EXPR, |
8765 | TYPE_SIZE_UNIT (vtable_entry_type), | |
5d49b6a7 RG |
8766 | size_int (non_fn_entries + n_inits)); |
8767 | vtbl = fold_build_pointer_plus (vtbl, index); | |
9965d119 | 8768 | } |
23656158 | 8769 | |
7bdcf888 | 8770 | if (ctor_vtbl_p) |
9965d119 NS |
8771 | /* For a construction vtable, we can't overwrite BINFO_VTABLE. |
8772 | So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will | |
8773 | straighten this out. */ | |
8774 | BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo)); | |
809e3e7f | 8775 | else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo)) |
9d6a019c | 8776 | /* Throw away any unneeded intializers. */ |
9771b263 | 8777 | (*l)->truncate (n_inits); |
7bdcf888 NS |
8778 | else |
8779 | /* For an ordinary vtable, set BINFO_VTABLE. */ | |
8780 | BINFO_VTABLE (binfo) = vtbl; | |
ca36f057 MM |
8781 | } |
8782 | ||
1b746b0f AP |
8783 | static GTY(()) tree abort_fndecl_addr; |
8784 | ||
90ecce3e | 8785 | /* Construct the initializer for BINFO's virtual function table. BINFO |
aabb4cd6 | 8786 | is part of the hierarchy dominated by T. If we're building a |
23656158 | 8787 | construction vtable, the ORIG_BINFO is the binfo we should use to |
9965d119 NS |
8788 | find the actual function pointers to put in the vtable - but they |
8789 | can be overridden on the path to most-derived in the graph that | |
8790 | ORIG_BINFO belongs. Otherwise, | |
911a71a7 | 8791 | ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the |
23656158 MM |
8792 | BINFO that should be indicated by the RTTI information in the |
8793 | vtable; it will be a base class of T, rather than T itself, if we | |
8794 | are building a construction vtable. | |
aabb4cd6 MM |
8795 | |
8796 | The value returned is a TREE_LIST suitable for wrapping in a | |
8797 | CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If | |
8798 | NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the | |
c8094d83 | 8799 | number of non-function entries in the vtable. |
911a71a7 MM |
8800 | |
8801 | It might seem that this function should never be called with a | |
9965d119 | 8802 | BINFO for which BINFO_PRIMARY_P holds, the vtable for such a |
911a71a7 | 8803 | base is always subsumed by a derived class vtable. However, when |
9965d119 | 8804 | we are building construction vtables, we do build vtables for |
911a71a7 MM |
8805 | primary bases; we need these while the primary base is being |
8806 | constructed. */ | |
ca36f057 | 8807 | |
9d6a019c | 8808 | static void |
94edc4ab | 8809 | build_vtbl_initializer (tree binfo, |
0cbd7506 MS |
8810 | tree orig_binfo, |
8811 | tree t, | |
8812 | tree rtti_binfo, | |
9d6a019c | 8813 | int* non_fn_entries_p, |
9771b263 | 8814 | vec<constructor_elt, va_gc> **inits) |
ca36f057 | 8815 | { |
02dea3ff | 8816 | tree v; |
911a71a7 | 8817 | vtbl_init_data vid; |
9d6a019c | 8818 | unsigned ix, jx; |
58c42dc2 | 8819 | tree vbinfo; |
9771b263 | 8820 | vec<tree, va_gc> *vbases; |
9d6a019c | 8821 | constructor_elt *e; |
c8094d83 | 8822 | |
911a71a7 | 8823 | /* Initialize VID. */ |
961192e1 | 8824 | memset (&vid, 0, sizeof (vid)); |
911a71a7 MM |
8825 | vid.binfo = binfo; |
8826 | vid.derived = t; | |
73ea87d7 | 8827 | vid.rtti_binfo = rtti_binfo; |
539ed333 NS |
8828 | vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
8829 | vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); | |
548502d3 | 8830 | vid.generate_vcall_entries = true; |
c35cce41 | 8831 | /* The first vbase or vcall offset is at index -3 in the vtable. */ |
ce552f75 | 8832 | vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE); |
c35cce41 | 8833 | |
9bab6c90 | 8834 | /* Add entries to the vtable for RTTI. */ |
73ea87d7 | 8835 | build_rtti_vtbl_entries (binfo, &vid); |
9bab6c90 | 8836 | |
b485e15b MM |
8837 | /* Create an array for keeping track of the functions we've |
8838 | processed. When we see multiple functions with the same | |
8839 | signature, we share the vcall offsets. */ | |
9771b263 | 8840 | vec_alloc (vid.fns, 32); |
c35cce41 | 8841 | /* Add the vcall and vbase offset entries. */ |
911a71a7 | 8842 | build_vcall_and_vbase_vtbl_entries (binfo, &vid); |
c8094d83 | 8843 | |
79cda2d1 | 8844 | /* Clear BINFO_VTABLE_PATH_MARKED; it's set by |
c35cce41 | 8845 | build_vbase_offset_vtbl_entries. */ |
9ba5ff0f | 8846 | for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0; |
9771b263 | 8847 | vec_safe_iterate (vbases, ix, &vbinfo); ix++) |
58c42dc2 | 8848 | BINFO_VTABLE_PATH_MARKED (vbinfo) = 0; |
ca36f057 | 8849 | |
a6f5e048 RH |
8850 | /* If the target requires padding between data entries, add that now. */ |
8851 | if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1) | |
8852 | { | |
9771b263 | 8853 | int n_entries = vec_safe_length (vid.inits); |
9d6a019c | 8854 | |
9771b263 | 8855 | vec_safe_grow (vid.inits, TARGET_VTABLE_DATA_ENTRY_DISTANCE * n_entries); |
a6f5e048 | 8856 | |
9d6a019c NF |
8857 | /* Move data entries into their new positions and add padding |
8858 | after the new positions. Iterate backwards so we don't | |
8859 | overwrite entries that we would need to process later. */ | |
8860 | for (ix = n_entries - 1; | |
9771b263 | 8861 | vid.inits->iterate (ix, &e); |
9d6a019c | 8862 | ix--) |
a6f5e048 | 8863 | { |
9d6a019c | 8864 | int j; |
25d8a217 NF |
8865 | int new_position = (TARGET_VTABLE_DATA_ENTRY_DISTANCE * ix |
8866 | + (TARGET_VTABLE_DATA_ENTRY_DISTANCE - 1)); | |
9d6a019c | 8867 | |
9771b263 | 8868 | (*vid.inits)[new_position] = *e; |
a6f5e048 | 8869 | |
9d6a019c NF |
8870 | for (j = 1; j < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++j) |
8871 | { | |
9771b263 | 8872 | constructor_elt *f = &(*vid.inits)[new_position - j]; |
9d6a019c NF |
8873 | f->index = NULL_TREE; |
8874 | f->value = build1 (NOP_EXPR, vtable_entry_type, | |
8875 | null_pointer_node); | |
8876 | } | |
a6f5e048 RH |
8877 | } |
8878 | } | |
8879 | ||
c35cce41 | 8880 | if (non_fn_entries_p) |
9771b263 | 8881 | *non_fn_entries_p = vec_safe_length (vid.inits); |
9d6a019c NF |
8882 | |
8883 | /* The initializers for virtual functions were built up in reverse | |
8884 | order. Straighten them out and add them to the running list in one | |
8885 | step. */ | |
9771b263 DN |
8886 | jx = vec_safe_length (*inits); |
8887 | vec_safe_grow (*inits, jx + vid.inits->length ()); | |
9d6a019c | 8888 | |
9771b263 DN |
8889 | for (ix = vid.inits->length () - 1; |
8890 | vid.inits->iterate (ix, &e); | |
9d6a019c | 8891 | ix--, jx++) |
9771b263 | 8892 | (**inits)[jx] = *e; |
ca36f057 MM |
8893 | |
8894 | /* Go through all the ordinary virtual functions, building up | |
8895 | initializers. */ | |
23656158 | 8896 | for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v)) |
ca36f057 MM |
8897 | { |
8898 | tree delta; | |
8899 | tree vcall_index; | |
4977bab6 | 8900 | tree fn, fn_original; |
f11ee281 | 8901 | tree init = NULL_TREE; |
c8094d83 | 8902 | |
ca36f057 | 8903 | fn = BV_FN (v); |
07fa4878 NS |
8904 | fn_original = fn; |
8905 | if (DECL_THUNK_P (fn)) | |
4977bab6 | 8906 | { |
07fa4878 NS |
8907 | if (!DECL_NAME (fn)) |
8908 | finish_thunk (fn); | |
e00853fd | 8909 | if (THUNK_ALIAS (fn)) |
bb885938 NS |
8910 | { |
8911 | fn = THUNK_ALIAS (fn); | |
8912 | BV_FN (v) = fn; | |
8913 | } | |
07fa4878 | 8914 | fn_original = THUNK_TARGET (fn); |
4977bab6 | 8915 | } |
c8094d83 | 8916 | |
d0cd8b44 JM |
8917 | /* If the only definition of this function signature along our |
8918 | primary base chain is from a lost primary, this vtable slot will | |
8919 | never be used, so just zero it out. This is important to avoid | |
8920 | requiring extra thunks which cannot be generated with the function. | |
8921 | ||
f11ee281 JM |
8922 | We first check this in update_vtable_entry_for_fn, so we handle |
8923 | restored primary bases properly; we also need to do it here so we | |
39a13be5 | 8924 | zero out unused slots in ctor vtables, rather than filling them |
f11ee281 JM |
8925 | with erroneous values (though harmless, apart from relocation |
8926 | costs). */ | |
02dea3ff JM |
8927 | if (BV_LOST_PRIMARY (v)) |
8928 | init = size_zero_node; | |
d0cd8b44 | 8929 | |
f11ee281 JM |
8930 | if (! init) |
8931 | { | |
8932 | /* Pull the offset for `this', and the function to call, out of | |
8933 | the list. */ | |
8934 | delta = BV_DELTA (v); | |
548502d3 | 8935 | vcall_index = BV_VCALL_INDEX (v); |
f11ee281 | 8936 | |
50bc768d NS |
8937 | gcc_assert (TREE_CODE (delta) == INTEGER_CST); |
8938 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
f11ee281 JM |
8939 | |
8940 | /* You can't call an abstract virtual function; it's abstract. | |
8941 | So, we replace these functions with __pure_virtual. */ | |
4977bab6 | 8942 | if (DECL_PURE_VIRTUAL_P (fn_original)) |
4977bab6 | 8943 | { |
1b746b0f | 8944 | fn = abort_fndecl; |
21b6aca3 JJ |
8945 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8946 | { | |
8947 | if (abort_fndecl_addr == NULL) | |
8948 | abort_fndecl_addr | |
8949 | = fold_convert (vfunc_ptr_type_node, | |
8950 | build_fold_addr_expr (fn)); | |
8951 | init = abort_fndecl_addr; | |
8952 | } | |
1b746b0f | 8953 | } |
4ce7d589 JM |
8954 | /* Likewise for deleted virtuals. */ |
8955 | else if (DECL_DELETED_FN (fn_original)) | |
8956 | { | |
8957 | fn = get_identifier ("__cxa_deleted_virtual"); | |
8958 | if (!get_global_value_if_present (fn, &fn)) | |
8959 | fn = push_library_fn (fn, (build_function_type_list | |
8960 | (void_type_node, NULL_TREE)), | |
8595a07d | 8961 | NULL_TREE, ECF_NORETURN); |
4ce7d589 JM |
8962 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8963 | init = fold_convert (vfunc_ptr_type_node, | |
8964 | build_fold_addr_expr (fn)); | |
8965 | } | |
1b746b0f AP |
8966 | else |
8967 | { | |
8968 | if (!integer_zerop (delta) || vcall_index) | |
8969 | { | |
8970 | fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index); | |
8971 | if (!DECL_NAME (fn)) | |
8972 | finish_thunk (fn); | |
8973 | } | |
8974 | /* Take the address of the function, considering it to be of an | |
8975 | appropriate generic type. */ | |
21b6aca3 JJ |
8976 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8977 | init = fold_convert (vfunc_ptr_type_node, | |
8978 | build_fold_addr_expr (fn)); | |
d74db8ff JM |
8979 | /* Don't refer to a virtual destructor from a constructor |
8980 | vtable or a vtable for an abstract class, since destroying | |
8981 | an object under construction is undefined behavior and we | |
8982 | don't want it to be considered a candidate for speculative | |
8983 | devirtualization. But do create the thunk for ABI | |
8984 | compliance. */ | |
8985 | if (DECL_DESTRUCTOR_P (fn_original) | |
8986 | && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original)) | |
8987 | || orig_binfo != binfo)) | |
8988 | init = size_zero_node; | |
4977bab6 | 8989 | } |
f11ee281 | 8990 | } |
d0cd8b44 | 8991 | |
ca36f057 | 8992 | /* And add it to the chain of initializers. */ |
67231816 RH |
8993 | if (TARGET_VTABLE_USES_DESCRIPTORS) |
8994 | { | |
8995 | int i; | |
8996 | if (init == size_zero_node) | |
8997 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
9d6a019c | 8998 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
67231816 RH |
8999 | else |
9000 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
9001 | { | |
f293ce4b | 9002 | tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node, |
21b6aca3 | 9003 | fn, build_int_cst (NULL_TREE, i)); |
67231816 RH |
9004 | TREE_CONSTANT (fdesc) = 1; |
9005 | ||
9d6a019c | 9006 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, fdesc); |
67231816 RH |
9007 | } |
9008 | } | |
9009 | else | |
9d6a019c | 9010 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
ca36f057 | 9011 | } |
ca36f057 MM |
9012 | } |
9013 | ||
d0cd8b44 | 9014 | /* Adds to vid->inits the initializers for the vbase and vcall |
c35cce41 | 9015 | offsets in BINFO, which is in the hierarchy dominated by T. */ |
ca36f057 | 9016 | |
c35cce41 | 9017 | static void |
94edc4ab | 9018 | build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 9019 | { |
c35cce41 | 9020 | tree b; |
8d08fdba | 9021 | |
c35cce41 | 9022 | /* If this is a derived class, we must first create entries |
9bab6c90 | 9023 | corresponding to the primary base class. */ |
911a71a7 | 9024 | b = get_primary_binfo (binfo); |
c35cce41 | 9025 | if (b) |
911a71a7 | 9026 | build_vcall_and_vbase_vtbl_entries (b, vid); |
c35cce41 MM |
9027 | |
9028 | /* Add the vbase entries for this base. */ | |
911a71a7 | 9029 | build_vbase_offset_vtbl_entries (binfo, vid); |
c35cce41 | 9030 | /* Add the vcall entries for this base. */ |
911a71a7 | 9031 | build_vcall_offset_vtbl_entries (binfo, vid); |
ca36f057 | 9032 | } |
8d08fdba | 9033 | |
ca36f057 MM |
9034 | /* Returns the initializers for the vbase offset entries in the vtable |
9035 | for BINFO (which is part of the class hierarchy dominated by T), in | |
c35cce41 MM |
9036 | reverse order. VBASE_OFFSET_INDEX gives the vtable index |
9037 | where the next vbase offset will go. */ | |
8d08fdba | 9038 | |
c35cce41 | 9039 | static void |
94edc4ab | 9040 | build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 9041 | { |
c35cce41 MM |
9042 | tree vbase; |
9043 | tree t; | |
90b1ca2f | 9044 | tree non_primary_binfo; |
8d08fdba | 9045 | |
ca36f057 MM |
9046 | /* If there are no virtual baseclasses, then there is nothing to |
9047 | do. */ | |
5775a06a | 9048 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
c35cce41 | 9049 | return; |
ca36f057 | 9050 | |
911a71a7 | 9051 | t = vid->derived; |
c8094d83 | 9052 | |
90b1ca2f NS |
9053 | /* We might be a primary base class. Go up the inheritance hierarchy |
9054 | until we find the most derived class of which we are a primary base: | |
9055 | it is the offset of that which we need to use. */ | |
9056 | non_primary_binfo = binfo; | |
9057 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
9058 | { | |
9059 | tree b; | |
9060 | ||
9061 | /* If we have reached a virtual base, then it must be a primary | |
9062 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
9063 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
9064 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 9065 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
90b1ca2f NS |
9066 | { |
9067 | non_primary_binfo = vid->binfo; | |
9068 | break; | |
9069 | } | |
9070 | ||
9071 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); | |
9072 | if (get_primary_binfo (b) != non_primary_binfo) | |
9073 | break; | |
9074 | non_primary_binfo = b; | |
9075 | } | |
ca36f057 | 9076 | |
c35cce41 MM |
9077 | /* Go through the virtual bases, adding the offsets. */ |
9078 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); | |
9079 | vbase; | |
9080 | vbase = TREE_CHAIN (vbase)) | |
9081 | { | |
9082 | tree b; | |
9083 | tree delta; | |
c8094d83 | 9084 | |
809e3e7f | 9085 | if (!BINFO_VIRTUAL_P (vbase)) |
c35cce41 | 9086 | continue; |
ca36f057 | 9087 | |
c35cce41 MM |
9088 | /* Find the instance of this virtual base in the complete |
9089 | object. */ | |
dbbf88d1 | 9090 | b = copied_binfo (vbase, binfo); |
c35cce41 MM |
9091 | |
9092 | /* If we've already got an offset for this virtual base, we | |
9093 | don't need another one. */ | |
9094 | if (BINFO_VTABLE_PATH_MARKED (b)) | |
9095 | continue; | |
dbbf88d1 | 9096 | BINFO_VTABLE_PATH_MARKED (b) = 1; |
c35cce41 MM |
9097 | |
9098 | /* Figure out where we can find this vbase offset. */ | |
c8094d83 | 9099 | delta = size_binop (MULT_EXPR, |
911a71a7 | 9100 | vid->index, |
c35cce41 MM |
9101 | convert (ssizetype, |
9102 | TYPE_SIZE_UNIT (vtable_entry_type))); | |
911a71a7 | 9103 | if (vid->primary_vtbl_p) |
c35cce41 MM |
9104 | BINFO_VPTR_FIELD (b) = delta; |
9105 | ||
9106 | if (binfo != TYPE_BINFO (t)) | |
50bc768d NS |
9107 | /* The vbase offset had better be the same. */ |
9108 | gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase))); | |
c35cce41 MM |
9109 | |
9110 | /* The next vbase will come at a more negative offset. */ | |
a6f5e048 RH |
9111 | vid->index = size_binop (MINUS_EXPR, vid->index, |
9112 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
c35cce41 MM |
9113 | |
9114 | /* The initializer is the delta from BINFO to this virtual base. | |
4e7512c9 MM |
9115 | The vbase offsets go in reverse inheritance-graph order, and |
9116 | we are walking in inheritance graph order so these end up in | |
9117 | the right order. */ | |
db3927fb AH |
9118 | delta = size_diffop_loc (input_location, |
9119 | BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo)); | |
c8094d83 | 9120 | |
9d6a019c NF |
9121 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, |
9122 | fold_build1_loc (input_location, NOP_EXPR, | |
9123 | vtable_entry_type, delta)); | |
c35cce41 | 9124 | } |
8d08fdba | 9125 | } |
ca36f057 | 9126 | |
b485e15b | 9127 | /* Adds the initializers for the vcall offset entries in the vtable |
d0cd8b44 JM |
9128 | for BINFO (which is part of the class hierarchy dominated by VID->DERIVED) |
9129 | to VID->INITS. */ | |
b485e15b MM |
9130 | |
9131 | static void | |
94edc4ab | 9132 | build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b485e15b | 9133 | { |
548502d3 MM |
9134 | /* We only need these entries if this base is a virtual base. We |
9135 | compute the indices -- but do not add to the vtable -- when | |
9136 | building the main vtable for a class. */ | |
b9302915 MM |
9137 | if (binfo == TYPE_BINFO (vid->derived) |
9138 | || (BINFO_VIRTUAL_P (binfo) | |
9139 | /* If BINFO is RTTI_BINFO, then (since BINFO does not | |
9140 | correspond to VID->DERIVED), we are building a primary | |
9141 | construction virtual table. Since this is a primary | |
9142 | virtual table, we do not need the vcall offsets for | |
9143 | BINFO. */ | |
9144 | && binfo != vid->rtti_binfo)) | |
548502d3 MM |
9145 | { |
9146 | /* We need a vcall offset for each of the virtual functions in this | |
9147 | vtable. For example: | |
b485e15b | 9148 | |
548502d3 MM |
9149 | class A { virtual void f (); }; |
9150 | class B1 : virtual public A { virtual void f (); }; | |
9151 | class B2 : virtual public A { virtual void f (); }; | |
9152 | class C: public B1, public B2 { virtual void f (); }; | |
d0cd8b44 | 9153 | |
548502d3 MM |
9154 | A C object has a primary base of B1, which has a primary base of A. A |
9155 | C also has a secondary base of B2, which no longer has a primary base | |
9156 | of A. So the B2-in-C construction vtable needs a secondary vtable for | |
9157 | A, which will adjust the A* to a B2* to call f. We have no way of | |
9158 | knowing what (or even whether) this offset will be when we define B2, | |
9159 | so we store this "vcall offset" in the A sub-vtable and look it up in | |
9160 | a "virtual thunk" for B2::f. | |
b485e15b | 9161 | |
548502d3 MM |
9162 | We need entries for all the functions in our primary vtable and |
9163 | in our non-virtual bases' secondary vtables. */ | |
9164 | vid->vbase = binfo; | |
9165 | /* If we are just computing the vcall indices -- but do not need | |
9166 | the actual entries -- not that. */ | |
809e3e7f | 9167 | if (!BINFO_VIRTUAL_P (binfo)) |
548502d3 MM |
9168 | vid->generate_vcall_entries = false; |
9169 | /* Now, walk through the non-virtual bases, adding vcall offsets. */ | |
9170 | add_vcall_offset_vtbl_entries_r (binfo, vid); | |
9171 | } | |
b485e15b MM |
9172 | } |
9173 | ||
9174 | /* Build vcall offsets, starting with those for BINFO. */ | |
9175 | ||
9176 | static void | |
94edc4ab | 9177 | add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid) |
b485e15b MM |
9178 | { |
9179 | int i; | |
9180 | tree primary_binfo; | |
fa743e8c | 9181 | tree base_binfo; |
b485e15b MM |
9182 | |
9183 | /* Don't walk into virtual bases -- except, of course, for the | |
d0cd8b44 JM |
9184 | virtual base for which we are building vcall offsets. Any |
9185 | primary virtual base will have already had its offsets generated | |
9186 | through the recursion in build_vcall_and_vbase_vtbl_entries. */ | |
809e3e7f | 9187 | if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo) |
b485e15b | 9188 | return; |
c8094d83 | 9189 | |
b485e15b MM |
9190 | /* If BINFO has a primary base, process it first. */ |
9191 | primary_binfo = get_primary_binfo (binfo); | |
9192 | if (primary_binfo) | |
9193 | add_vcall_offset_vtbl_entries_r (primary_binfo, vid); | |
9194 | ||
9195 | /* Add BINFO itself to the list. */ | |
9196 | add_vcall_offset_vtbl_entries_1 (binfo, vid); | |
9197 | ||
9198 | /* Scan the non-primary bases of BINFO. */ | |
fa743e8c NS |
9199 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
9200 | if (base_binfo != primary_binfo) | |
9201 | add_vcall_offset_vtbl_entries_r (base_binfo, vid); | |
b485e15b MM |
9202 | } |
9203 | ||
9965d119 | 9204 | /* Called from build_vcall_offset_vtbl_entries_r. */ |
e92cc029 | 9205 | |
b485e15b | 9206 | static void |
94edc4ab | 9207 | add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid) |
8d08fdba | 9208 | { |
e6a66567 | 9209 | /* Make entries for the rest of the virtuals. */ |
90d84934 JM |
9210 | tree orig_fn; |
9211 | ||
9212 | /* The ABI requires that the methods be processed in declaration | |
9213 | order. */ | |
9214 | for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo)); | |
9215 | orig_fn; | |
9216 | orig_fn = DECL_CHAIN (orig_fn)) | |
aaf8a23e | 9217 | if (TREE_CODE (orig_fn) == FUNCTION_DECL && DECL_VINDEX (orig_fn)) |
90d84934 | 9218 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 | 9219 | } |
b485e15b | 9220 | |
95675950 | 9221 | /* Add a vcall offset entry for ORIG_FN to the vtable. */ |
b485e15b | 9222 | |
e6a66567 | 9223 | static void |
95675950 | 9224 | add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid) |
e6a66567 MM |
9225 | { |
9226 | size_t i; | |
9227 | tree vcall_offset; | |
1e625046 | 9228 | tree derived_entry; |
9bab6c90 | 9229 | |
e6a66567 MM |
9230 | /* If there is already an entry for a function with the same |
9231 | signature as FN, then we do not need a second vcall offset. | |
9232 | Check the list of functions already present in the derived | |
9233 | class vtable. */ | |
9771b263 | 9234 | FOR_EACH_VEC_SAFE_ELT (vid->fns, i, derived_entry) |
e6a66567 | 9235 | { |
e6a66567 MM |
9236 | if (same_signature_p (derived_entry, orig_fn) |
9237 | /* We only use one vcall offset for virtual destructors, | |
9238 | even though there are two virtual table entries. */ | |
9239 | || (DECL_DESTRUCTOR_P (derived_entry) | |
9240 | && DECL_DESTRUCTOR_P (orig_fn))) | |
9241 | return; | |
9242 | } | |
4e7512c9 | 9243 | |
e6a66567 MM |
9244 | /* If we are building these vcall offsets as part of building |
9245 | the vtable for the most derived class, remember the vcall | |
9246 | offset. */ | |
9247 | if (vid->binfo == TYPE_BINFO (vid->derived)) | |
0871761b | 9248 | { |
f32682ca | 9249 | tree_pair_s elt = {orig_fn, vid->index}; |
9771b263 | 9250 | vec_safe_push (CLASSTYPE_VCALL_INDICES (vid->derived), elt); |
0871761b | 9251 | } |
c8094d83 | 9252 | |
e6a66567 MM |
9253 | /* The next vcall offset will be found at a more negative |
9254 | offset. */ | |
9255 | vid->index = size_binop (MINUS_EXPR, vid->index, | |
9256 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
9257 | ||
9258 | /* Keep track of this function. */ | |
9771b263 | 9259 | vec_safe_push (vid->fns, orig_fn); |
e6a66567 MM |
9260 | |
9261 | if (vid->generate_vcall_entries) | |
9262 | { | |
9263 | tree base; | |
e6a66567 | 9264 | tree fn; |
548502d3 | 9265 | |
e6a66567 | 9266 | /* Find the overriding function. */ |
95675950 | 9267 | fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn); |
e6a66567 | 9268 | if (fn == error_mark_node) |
e8160c9a | 9269 | vcall_offset = build_zero_cst (vtable_entry_type); |
e6a66567 MM |
9270 | else |
9271 | { | |
95675950 MM |
9272 | base = TREE_VALUE (fn); |
9273 | ||
9274 | /* The vbase we're working on is a primary base of | |
9275 | vid->binfo. But it might be a lost primary, so its | |
9276 | BINFO_OFFSET might be wrong, so we just use the | |
9277 | BINFO_OFFSET from vid->binfo. */ | |
db3927fb AH |
9278 | vcall_offset = size_diffop_loc (input_location, |
9279 | BINFO_OFFSET (base), | |
95675950 | 9280 | BINFO_OFFSET (vid->binfo)); |
db3927fb AH |
9281 | vcall_offset = fold_build1_loc (input_location, |
9282 | NOP_EXPR, vtable_entry_type, | |
7866705a | 9283 | vcall_offset); |
548502d3 | 9284 | } |
34cd5ae7 | 9285 | /* Add the initializer to the vtable. */ |
9d6a019c | 9286 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, vcall_offset); |
c35cce41 | 9287 | } |
570221c2 | 9288 | } |
b54ccf71 | 9289 | |
34cd5ae7 | 9290 | /* Return vtbl initializers for the RTTI entries corresponding to the |
aabb4cd6 | 9291 | BINFO's vtable. The RTTI entries should indicate the object given |
73ea87d7 | 9292 | by VID->rtti_binfo. */ |
b54ccf71 | 9293 | |
9bab6c90 | 9294 | static void |
94edc4ab | 9295 | build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b54ccf71 | 9296 | { |
ca36f057 | 9297 | tree b; |
aabb4cd6 | 9298 | tree t; |
ca36f057 MM |
9299 | tree offset; |
9300 | tree decl; | |
9301 | tree init; | |
b54ccf71 | 9302 | |
73ea87d7 | 9303 | t = BINFO_TYPE (vid->rtti_binfo); |
b54ccf71 | 9304 | |
ca36f057 MM |
9305 | /* To find the complete object, we will first convert to our most |
9306 | primary base, and then add the offset in the vtbl to that value. */ | |
9307 | b = binfo; | |
9965d119 | 9308 | while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b)) |
0cbd7506 | 9309 | && !BINFO_LOST_PRIMARY_P (b)) |
b54ccf71 | 9310 | { |
c35cce41 MM |
9311 | tree primary_base; |
9312 | ||
911a71a7 | 9313 | primary_base = get_primary_binfo (b); |
fc6633e0 NS |
9314 | gcc_assert (BINFO_PRIMARY_P (primary_base) |
9315 | && BINFO_INHERITANCE_CHAIN (primary_base) == b); | |
c35cce41 | 9316 | b = primary_base; |
b54ccf71 | 9317 | } |
db3927fb AH |
9318 | offset = size_diffop_loc (input_location, |
9319 | BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b)); | |
8f032717 | 9320 | |
8fa33dfa MM |
9321 | /* The second entry is the address of the typeinfo object. */ |
9322 | if (flag_rtti) | |
7993382e | 9323 | decl = build_address (get_tinfo_decl (t)); |
ca36f057 | 9324 | else |
8fa33dfa | 9325 | decl = integer_zero_node; |
c8094d83 | 9326 | |
8fa33dfa MM |
9327 | /* Convert the declaration to a type that can be stored in the |
9328 | vtable. */ | |
7993382e | 9329 | init = build_nop (vfunc_ptr_type_node, decl); |
9d6a019c | 9330 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 9331 | |
78dcd41a VR |
9332 | /* Add the offset-to-top entry. It comes earlier in the vtable than |
9333 | the typeinfo entry. Convert the offset to look like a | |
c4372ef4 | 9334 | function pointer, so that we can put it in the vtable. */ |
7993382e | 9335 | init = build_nop (vfunc_ptr_type_node, offset); |
9d6a019c | 9336 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 9337 | } |
0f59171d | 9338 | |
22854930 PC |
9339 | /* TRUE iff TYPE is uniquely derived from PARENT. Ignores |
9340 | accessibility. */ | |
9341 | ||
9342 | bool | |
9343 | uniquely_derived_from_p (tree parent, tree type) | |
9344 | { | |
9345 | tree base = lookup_base (type, parent, ba_unique, NULL, tf_none); | |
9346 | return base && base != error_mark_node; | |
9347 | } | |
9348 | ||
9349 | /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */ | |
9350 | ||
9351 | bool | |
9352 | publicly_uniquely_derived_p (tree parent, tree type) | |
9353 | { | |
9354 | tree base = lookup_base (type, parent, ba_ignore_scope | ba_check, | |
9355 | NULL, tf_none); | |
9356 | return base && base != error_mark_node; | |
9357 | } | |
9358 | ||
3a6a88c8 JM |
9359 | /* CTX1 and CTX2 are declaration contexts. Return the innermost common |
9360 | class between them, if any. */ | |
9361 | ||
9362 | tree | |
9363 | common_enclosing_class (tree ctx1, tree ctx2) | |
9364 | { | |
9365 | if (!TYPE_P (ctx1) || !TYPE_P (ctx2)) | |
9366 | return NULL_TREE; | |
9367 | gcc_assert (ctx1 == TYPE_MAIN_VARIANT (ctx1) | |
9368 | && ctx2 == TYPE_MAIN_VARIANT (ctx2)); | |
9369 | if (ctx1 == ctx2) | |
9370 | return ctx1; | |
9371 | for (tree t = ctx1; TYPE_P (t); t = TYPE_CONTEXT (t)) | |
9372 | TYPE_MARKED_P (t) = true; | |
9373 | tree found = NULL_TREE; | |
9374 | for (tree t = ctx2; TYPE_P (t); t = TYPE_CONTEXT (t)) | |
9375 | if (TYPE_MARKED_P (t)) | |
9376 | { | |
9377 | found = t; | |
9378 | break; | |
9379 | } | |
9380 | for (tree t = ctx1; TYPE_P (t); t = TYPE_CONTEXT (t)) | |
9381 | TYPE_MARKED_P (t) = false; | |
9382 | return found; | |
9383 | } | |
9384 | ||
1b746b0f | 9385 | #include "gt-cp-class.h" |