]>
Commit | Line | Data |
---|---|---|
8d08fdba | 1 | /* Functions related to building classes and their related objects. |
06ceef4e | 2 | Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
bfcbe068 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010, 2011 |
fc40d49c | 4 | Free Software Foundation, Inc. |
8d08fdba MS |
5 | Contributed by Michael Tiemann (tiemann@cygnus.com) |
6 | ||
f5adbb8d | 7 | This file is part of GCC. |
8d08fdba | 8 | |
f5adbb8d | 9 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 10 | it under the terms of the GNU General Public License as published by |
e77f031d | 11 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
12 | any later version. |
13 | ||
f5adbb8d | 14 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
22 | |
23 | ||
e92cc029 | 24 | /* High-level class interface. */ |
8d08fdba MS |
25 | |
26 | #include "config.h" | |
8d052bc7 | 27 | #include "system.h" |
4977bab6 ZW |
28 | #include "coretypes.h" |
29 | #include "tm.h" | |
e7a587ef | 30 | #include "tree.h" |
8d08fdba MS |
31 | #include "cp-tree.h" |
32 | #include "flags.h" | |
e8abc66f | 33 | #include "output.h" |
54f92bfb | 34 | #include "toplev.h" |
1af6141b | 35 | #include "target.h" |
7b6d72fc | 36 | #include "convert.h" |
8634c649 | 37 | #include "cgraph.h" |
ef330312 | 38 | #include "tree-dump.h" |
245763e3 | 39 | #include "splay-tree.h" |
f732fa7b | 40 | #include "pointer-set.h" |
8d08fdba | 41 | |
61a127b3 MM |
42 | /* The number of nested classes being processed. If we are not in the |
43 | scope of any class, this is zero. */ | |
44 | ||
8d08fdba MS |
45 | int current_class_depth; |
46 | ||
61a127b3 MM |
47 | /* In order to deal with nested classes, we keep a stack of classes. |
48 | The topmost entry is the innermost class, and is the entry at index | |
49 | CURRENT_CLASS_DEPTH */ | |
50 | ||
51 | typedef struct class_stack_node { | |
52 | /* The name of the class. */ | |
53 | tree name; | |
54 | ||
55 | /* The _TYPE node for the class. */ | |
56 | tree type; | |
57 | ||
58 | /* The access specifier pending for new declarations in the scope of | |
59 | this class. */ | |
60 | tree access; | |
8f032717 MM |
61 | |
62 | /* If were defining TYPE, the names used in this class. */ | |
63 | splay_tree names_used; | |
c888c93b MM |
64 | |
65 | /* Nonzero if this class is no longer open, because of a call to | |
66 | push_to_top_level. */ | |
67 | size_t hidden; | |
61a127b3 MM |
68 | }* class_stack_node_t; |
69 | ||
911a71a7 | 70 | typedef struct vtbl_init_data_s |
c35cce41 | 71 | { |
911a71a7 MM |
72 | /* The base for which we're building initializers. */ |
73 | tree binfo; | |
73ea87d7 | 74 | /* The type of the most-derived type. */ |
c35cce41 | 75 | tree derived; |
73ea87d7 NS |
76 | /* The binfo for the dynamic type. This will be TYPE_BINFO (derived), |
77 | unless ctor_vtbl_p is true. */ | |
78 | tree rtti_binfo; | |
9bab6c90 MM |
79 | /* The negative-index vtable initializers built up so far. These |
80 | are in order from least negative index to most negative index. */ | |
9d6a019c | 81 | VEC(constructor_elt,gc) *inits; |
c35cce41 | 82 | /* The binfo for the virtual base for which we're building |
911a71a7 | 83 | vcall offset initializers. */ |
c35cce41 | 84 | tree vbase; |
9bab6c90 MM |
85 | /* The functions in vbase for which we have already provided vcall |
86 | offsets. */ | |
1e625046 | 87 | VEC(tree,gc) *fns; |
c35cce41 MM |
88 | /* The vtable index of the next vcall or vbase offset. */ |
89 | tree index; | |
90 | /* Nonzero if we are building the initializer for the primary | |
91 | vtable. */ | |
911a71a7 MM |
92 | int primary_vtbl_p; |
93 | /* Nonzero if we are building the initializer for a construction | |
94 | vtable. */ | |
95 | int ctor_vtbl_p; | |
548502d3 MM |
96 | /* True when adding vcall offset entries to the vtable. False when |
97 | merely computing the indices. */ | |
98 | bool generate_vcall_entries; | |
911a71a7 | 99 | } vtbl_init_data; |
c35cce41 | 100 | |
c20118a8 | 101 | /* The type of a function passed to walk_subobject_offsets. */ |
94edc4ab | 102 | typedef int (*subobject_offset_fn) (tree, tree, splay_tree); |
c20118a8 | 103 | |
4639c5c6 | 104 | /* The stack itself. This is a dynamically resized array. The |
61a127b3 MM |
105 | number of elements allocated is CURRENT_CLASS_STACK_SIZE. */ |
106 | static int current_class_stack_size; | |
107 | static class_stack_node_t current_class_stack; | |
108 | ||
c5a35c3c MM |
109 | /* The size of the largest empty class seen in this translation unit. */ |
110 | static GTY (()) tree sizeof_biggest_empty_class; | |
111 | ||
1f6e1acc AS |
112 | /* An array of all local classes present in this translation unit, in |
113 | declaration order. */ | |
806aa901 | 114 | VEC(tree,gc) *local_classes; |
1f6e1acc | 115 | |
94edc4ab NN |
116 | static tree get_vfield_name (tree); |
117 | static void finish_struct_anon (tree); | |
118 | static tree get_vtable_name (tree); | |
119 | static tree get_basefndecls (tree, tree); | |
120 | static int build_primary_vtable (tree, tree); | |
dbbf88d1 | 121 | static int build_secondary_vtable (tree); |
94edc4ab NN |
122 | static void finish_vtbls (tree); |
123 | static void modify_vtable_entry (tree, tree, tree, tree, tree *); | |
94edc4ab NN |
124 | static void finish_struct_bits (tree); |
125 | static int alter_access (tree, tree, tree); | |
126 | static void handle_using_decl (tree, tree); | |
94edc4ab NN |
127 | static tree dfs_modify_vtables (tree, void *); |
128 | static tree modify_all_vtables (tree, tree); | |
fc6633e0 | 129 | static void determine_primary_bases (tree); |
94edc4ab NN |
130 | static void finish_struct_methods (tree); |
131 | static void maybe_warn_about_overly_private_class (tree); | |
94edc4ab NN |
132 | static int method_name_cmp (const void *, const void *); |
133 | static int resort_method_name_cmp (const void *, const void *); | |
10746f37 | 134 | static void add_implicitly_declared_members (tree, int, int); |
94edc4ab | 135 | static tree fixed_type_or_null (tree, int *, int *); |
00bfffa4 | 136 | static tree build_simple_base_path (tree expr, tree binfo); |
94edc4ab | 137 | static tree build_vtbl_ref_1 (tree, tree); |
9d6a019c NF |
138 | static void build_vtbl_initializer (tree, tree, tree, tree, int *, |
139 | VEC(constructor_elt,gc) **); | |
94edc4ab | 140 | static int count_fields (tree); |
d07605f5 | 141 | static int add_fields_to_record_type (tree, struct sorted_fields_type*, int); |
e7df0180 | 142 | static bool check_bitfield_decl (tree); |
10746f37 JM |
143 | static void check_field_decl (tree, tree, int *, int *, int *); |
144 | static void check_field_decls (tree, tree *, int *, int *); | |
58731fd1 MM |
145 | static tree *build_base_field (record_layout_info, tree, splay_tree, tree *); |
146 | static void build_base_fields (record_layout_info, splay_tree, tree *); | |
94edc4ab NN |
147 | static void check_methods (tree); |
148 | static void remove_zero_width_bit_fields (tree); | |
10746f37 | 149 | static void check_bases (tree, int *, int *); |
58731fd1 MM |
150 | static void check_bases_and_members (tree); |
151 | static tree create_vtable_ptr (tree, tree *); | |
17bbb839 | 152 | static void include_empty_classes (record_layout_info); |
e93ee644 | 153 | static void layout_class_type (tree, tree *); |
dbbf88d1 | 154 | static void propagate_binfo_offsets (tree, tree); |
17bbb839 | 155 | static void layout_virtual_bases (record_layout_info, splay_tree); |
94edc4ab NN |
156 | static void build_vbase_offset_vtbl_entries (tree, vtbl_init_data *); |
157 | static void add_vcall_offset_vtbl_entries_r (tree, vtbl_init_data *); | |
158 | static void add_vcall_offset_vtbl_entries_1 (tree, vtbl_init_data *); | |
159 | static void build_vcall_offset_vtbl_entries (tree, vtbl_init_data *); | |
e6a66567 | 160 | static void add_vcall_offset (tree, tree, vtbl_init_data *); |
94edc4ab | 161 | static void layout_vtable_decl (tree, int); |
5d5a519f | 162 | static tree dfs_find_final_overrider_pre (tree, void *); |
dbbf88d1 | 163 | static tree dfs_find_final_overrider_post (tree, void *); |
94edc4ab NN |
164 | static tree find_final_overrider (tree, tree, tree); |
165 | static int make_new_vtable (tree, tree); | |
b5791fdc | 166 | static tree get_primary_binfo (tree); |
94edc4ab | 167 | static int maybe_indent_hierarchy (FILE *, int, int); |
dbbf88d1 | 168 | static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int); |
94edc4ab | 169 | static void dump_class_hierarchy (tree); |
bb885938 | 170 | static void dump_class_hierarchy_1 (FILE *, int, tree); |
94edc4ab NN |
171 | static void dump_array (FILE *, tree); |
172 | static void dump_vtable (tree, tree, tree); | |
173 | static void dump_vtt (tree, tree); | |
bb885938 | 174 | static void dump_thunk (FILE *, int, tree); |
94edc4ab | 175 | static tree build_vtable (tree, tree, tree); |
9d6a019c | 176 | static void initialize_vtable (tree, VEC(constructor_elt,gc) *); |
94edc4ab | 177 | static void layout_nonempty_base_or_field (record_layout_info, |
5d5a519f | 178 | tree, tree, splay_tree); |
94edc4ab | 179 | static tree end_of_class (tree, int); |
d9d9dbc0 | 180 | static bool layout_empty_base (record_layout_info, tree, tree, splay_tree); |
9d6a019c NF |
181 | static void accumulate_vtbl_inits (tree, tree, tree, tree, tree, |
182 | VEC(constructor_elt,gc) **); | |
183 | static void dfs_accumulate_vtbl_inits (tree, tree, tree, tree, tree, | |
184 | VEC(constructor_elt,gc) **); | |
94edc4ab | 185 | static void build_rtti_vtbl_entries (tree, vtbl_init_data *); |
5d5a519f | 186 | static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *); |
94edc4ab NN |
187 | static void clone_constructors_and_destructors (tree); |
188 | static tree build_clone (tree, tree); | |
a2ddc397 | 189 | static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned); |
94edc4ab NN |
190 | static void build_ctor_vtbl_group (tree, tree); |
191 | static void build_vtt (tree); | |
192 | static tree binfo_ctor_vtable (tree); | |
9d6a019c | 193 | static void build_vtt_inits (tree, tree, VEC(constructor_elt,gc) **, tree *); |
94edc4ab | 194 | static tree dfs_build_secondary_vptr_vtt_inits (tree, void *); |
94edc4ab | 195 | static tree dfs_fixup_binfo_vtbls (tree, void *); |
94edc4ab NN |
196 | static int record_subobject_offset (tree, tree, splay_tree); |
197 | static int check_subobject_offset (tree, tree, splay_tree); | |
198 | static int walk_subobject_offsets (tree, subobject_offset_fn, | |
5d5a519f | 199 | tree, splay_tree, tree, int); |
c5a35c3c | 200 | static void record_subobject_offsets (tree, tree, splay_tree, bool); |
94edc4ab NN |
201 | static int layout_conflict_p (tree, tree, splay_tree, int); |
202 | static int splay_tree_compare_integer_csts (splay_tree_key k1, | |
5d5a519f | 203 | splay_tree_key k2); |
94edc4ab NN |
204 | static void warn_about_ambiguous_bases (tree); |
205 | static bool type_requires_array_cookie (tree); | |
956d9305 | 206 | static bool contains_empty_class_p (tree); |
9368208b | 207 | static bool base_derived_from (tree, tree); |
7ba539c6 | 208 | static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree); |
ba9a991f | 209 | static tree end_of_base (tree); |
548502d3 | 210 | static tree get_vcall_index (tree, tree); |
9965d119 | 211 | |
51c184be | 212 | /* Variables shared between class.c and call.c. */ |
8d08fdba | 213 | |
5566b478 | 214 | #ifdef GATHER_STATISTICS |
8d08fdba MS |
215 | int n_vtables = 0; |
216 | int n_vtable_entries = 0; | |
217 | int n_vtable_searches = 0; | |
218 | int n_vtable_elems = 0; | |
219 | int n_convert_harshness = 0; | |
220 | int n_compute_conversion_costs = 0; | |
8d08fdba | 221 | int n_inner_fields_searched = 0; |
5566b478 | 222 | #endif |
8d08fdba | 223 | |
338d90b8 NS |
224 | /* Convert to or from a base subobject. EXPR is an expression of type |
225 | `A' or `A*', an expression of type `B' or `B*' is returned. To | |
226 | convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for | |
227 | the B base instance within A. To convert base A to derived B, CODE | |
228 | is MINUS_EXPR and BINFO is the binfo for the A instance within B. | |
229 | In this latter case, A must not be a morally virtual base of B. | |
230 | NONNULL is true if EXPR is known to be non-NULL (this is only | |
231 | needed when EXPR is of pointer type). CV qualifiers are preserved | |
232 | from EXPR. */ | |
ca36f057 MM |
233 | |
234 | tree | |
94edc4ab | 235 | build_base_path (enum tree_code code, |
0cbd7506 MS |
236 | tree expr, |
237 | tree binfo, | |
a271590a PC |
238 | int nonnull, |
239 | tsubst_flags_t complain) | |
1a588ad7 | 240 | { |
338d90b8 | 241 | tree v_binfo = NULL_TREE; |
6bc34b14 | 242 | tree d_binfo = NULL_TREE; |
338d90b8 NS |
243 | tree probe; |
244 | tree offset; | |
245 | tree target_type; | |
246 | tree null_test = NULL; | |
247 | tree ptr_target_type; | |
ca36f057 | 248 | int fixed_type_p; |
338d90b8 | 249 | int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE; |
00bfffa4 | 250 | bool has_empty = false; |
d7981fd9 | 251 | bool virtual_access; |
1a588ad7 | 252 | |
338d90b8 NS |
253 | if (expr == error_mark_node || binfo == error_mark_node || !binfo) |
254 | return error_mark_node; | |
6bc34b14 JM |
255 | |
256 | for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
257 | { | |
258 | d_binfo = probe; | |
00bfffa4 JM |
259 | if (is_empty_class (BINFO_TYPE (probe))) |
260 | has_empty = true; | |
809e3e7f | 261 | if (!v_binfo && BINFO_VIRTUAL_P (probe)) |
6bc34b14 JM |
262 | v_binfo = probe; |
263 | } | |
338d90b8 NS |
264 | |
265 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr)); | |
266 | if (want_pointer) | |
267 | probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe)); | |
00bfffa4 | 268 | |
539ed333 NS |
269 | gcc_assert ((code == MINUS_EXPR |
270 | && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe)) | |
271 | || (code == PLUS_EXPR | |
272 | && SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe))); | |
c8094d83 | 273 | |
00bfffa4 JM |
274 | if (binfo == d_binfo) |
275 | /* Nothing to do. */ | |
276 | return expr; | |
277 | ||
338d90b8 NS |
278 | if (code == MINUS_EXPR && v_binfo) |
279 | { | |
a271590a PC |
280 | if (complain & tf_error) |
281 | error ("cannot convert from base %qT to derived type %qT via " | |
282 | "virtual base %qT", BINFO_TYPE (binfo), BINFO_TYPE (d_binfo), | |
283 | BINFO_TYPE (v_binfo)); | |
338d90b8 NS |
284 | return error_mark_node; |
285 | } | |
1a588ad7 | 286 | |
f576dfc4 JM |
287 | if (!want_pointer) |
288 | /* This must happen before the call to save_expr. */ | |
a271590a | 289 | expr = cp_build_addr_expr (expr, complain); |
7fd7263d | 290 | else |
416f380b | 291 | expr = mark_rvalue_use (expr); |
f576dfc4 | 292 | |
00bfffa4 | 293 | offset = BINFO_OFFSET (binfo); |
ca36f057 | 294 | fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull); |
0e686aa6 | 295 | target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo); |
2bbf86a4 JM |
296 | /* TARGET_TYPE has been extracted from BINFO, and, is therefore always |
297 | cv-unqualified. Extract the cv-qualifiers from EXPR so that the | |
298 | expression returned matches the input. */ | |
299 | target_type = cp_build_qualified_type | |
300 | (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr)))); | |
301 | ptr_target_type = build_pointer_type (target_type); | |
00bfffa4 | 302 | |
d7981fd9 | 303 | /* Do we need to look in the vtable for the real offset? */ |
7a0b47e3 JM |
304 | virtual_access = (v_binfo && fixed_type_p <= 0); |
305 | ||
306 | /* Don't bother with the calculations inside sizeof; they'll ICE if the | |
a8e23778 JM |
307 | source type is incomplete and the pointer value doesn't matter. In a |
308 | template (even in fold_non_dependent_expr), we don't have vtables set | |
309 | up properly yet, and the value doesn't matter there either; we're just | |
310 | interested in the result of overload resolution. */ | |
311 | if (cp_unevaluated_operand != 0 | |
312 | || (current_function_decl | |
313 | && uses_template_parms (current_function_decl))) | |
dc555429 | 314 | { |
2bbf86a4 | 315 | expr = build_nop (ptr_target_type, expr); |
dc555429 | 316 | if (!want_pointer) |
dd865ef6 | 317 | expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL); |
dc555429 JM |
318 | return expr; |
319 | } | |
d7981fd9 JM |
320 | |
321 | /* Do we need to check for a null pointer? */ | |
0e686aa6 MM |
322 | if (want_pointer && !nonnull) |
323 | { | |
324 | /* If we know the conversion will not actually change the value | |
325 | of EXPR, then we can avoid testing the expression for NULL. | |
326 | We have to avoid generating a COMPONENT_REF for a base class | |
327 | field, because other parts of the compiler know that such | |
328 | expressions are always non-NULL. */ | |
329 | if (!virtual_access && integer_zerop (offset)) | |
2bbf86a4 | 330 | return build_nop (ptr_target_type, expr); |
0e686aa6 MM |
331 | null_test = error_mark_node; |
332 | } | |
00bfffa4 | 333 | |
d7981fd9 JM |
334 | /* Protect against multiple evaluation if necessary. */ |
335 | if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access)) | |
ca36f057 | 336 | expr = save_expr (expr); |
f2606a97 | 337 | |
d7981fd9 | 338 | /* Now that we've saved expr, build the real null test. */ |
00bfffa4 | 339 | if (null_test) |
471a58a9 AP |
340 | { |
341 | tree zero = cp_convert (TREE_TYPE (expr), integer_zero_node); | |
db3927fb | 342 | null_test = fold_build2_loc (input_location, NE_EXPR, boolean_type_node, |
7866705a | 343 | expr, zero); |
471a58a9 | 344 | } |
00bfffa4 JM |
345 | |
346 | /* If this is a simple base reference, express it as a COMPONENT_REF. */ | |
d7981fd9 | 347 | if (code == PLUS_EXPR && !virtual_access |
00bfffa4 JM |
348 | /* We don't build base fields for empty bases, and they aren't very |
349 | interesting to the optimizers anyway. */ | |
350 | && !has_empty) | |
351 | { | |
a271590a | 352 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
00bfffa4 JM |
353 | expr = build_simple_base_path (expr, binfo); |
354 | if (want_pointer) | |
442c8e31 | 355 | expr = build_address (expr); |
00bfffa4 JM |
356 | target_type = TREE_TYPE (expr); |
357 | goto out; | |
358 | } | |
359 | ||
d7981fd9 | 360 | if (virtual_access) |
1a588ad7 | 361 | { |
338d90b8 | 362 | /* Going via virtual base V_BINFO. We need the static offset |
0cbd7506 MS |
363 | from V_BINFO to BINFO, and the dynamic offset from D_BINFO to |
364 | V_BINFO. That offset is an entry in D_BINFO's vtable. */ | |
1f5a253a NS |
365 | tree v_offset; |
366 | ||
367 | if (fixed_type_p < 0 && in_base_initializer) | |
368 | { | |
2acb1af9 NS |
369 | /* In a base member initializer, we cannot rely on the |
370 | vtable being set up. We have to indirect via the | |
371 | vtt_parm. */ | |
6de9cd9a DN |
372 | tree t; |
373 | ||
2acb1af9 | 374 | t = TREE_TYPE (TYPE_VFIELD (current_class_type)); |
6de9cd9a DN |
375 | t = build_pointer_type (t); |
376 | v_offset = convert (t, current_vtt_parm); | |
a271590a | 377 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
1f5a253a NS |
378 | } |
379 | else | |
dd865ef6 | 380 | v_offset = build_vfield_ref (cp_build_indirect_ref (expr, RO_NULL, |
a271590a | 381 | complain), |
1f5a253a | 382 | TREE_TYPE (TREE_TYPE (expr))); |
c8094d83 | 383 | |
5d49b6a7 | 384 | v_offset = fold_build_pointer_plus (v_offset, BINFO_VPTR_FIELD (v_binfo)); |
c8094d83 | 385 | v_offset = build1 (NOP_EXPR, |
338d90b8 NS |
386 | build_pointer_type (ptrdiff_type_node), |
387 | v_offset); | |
a271590a | 388 | v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain); |
6de9cd9a | 389 | TREE_CONSTANT (v_offset) = 1; |
f63ab951 | 390 | |
7b6d72fc | 391 | offset = convert_to_integer (ptrdiff_type_node, |
db3927fb | 392 | size_diffop_loc (input_location, offset, |
7b6d72fc | 393 | BINFO_OFFSET (v_binfo))); |
8d08fdba | 394 | |
338d90b8 | 395 | if (!integer_zerop (offset)) |
f293ce4b | 396 | v_offset = build2 (code, ptrdiff_type_node, v_offset, offset); |
f2606a97 JM |
397 | |
398 | if (fixed_type_p < 0) | |
399 | /* Negative fixed_type_p means this is a constructor or destructor; | |
400 | virtual base layout is fixed in in-charge [cd]tors, but not in | |
401 | base [cd]tors. */ | |
f293ce4b RS |
402 | offset = build3 (COND_EXPR, ptrdiff_type_node, |
403 | build2 (EQ_EXPR, boolean_type_node, | |
404 | current_in_charge_parm, integer_zero_node), | |
405 | v_offset, | |
aa8f5c20 AP |
406 | convert_to_integer (ptrdiff_type_node, |
407 | BINFO_OFFSET (binfo))); | |
338d90b8 NS |
408 | else |
409 | offset = v_offset; | |
8d08fdba | 410 | } |
8d08fdba | 411 | |
338d90b8 NS |
412 | if (want_pointer) |
413 | target_type = ptr_target_type; | |
c8094d83 | 414 | |
338d90b8 | 415 | expr = build1 (NOP_EXPR, ptr_target_type, expr); |
fed3cef0 | 416 | |
338d90b8 | 417 | if (!integer_zerop (offset)) |
5be014d5 AP |
418 | { |
419 | offset = fold_convert (sizetype, offset); | |
420 | if (code == MINUS_EXPR) | |
db3927fb | 421 | offset = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, offset); |
5d49b6a7 | 422 | expr = fold_build_pointer_plus (expr, offset); |
5be014d5 | 423 | } |
8d08fdba | 424 | else |
338d90b8 | 425 | null_test = NULL; |
c8094d83 | 426 | |
338d90b8 | 427 | if (!want_pointer) |
a271590a | 428 | expr = cp_build_indirect_ref (expr, RO_NULL, complain); |
8d08fdba | 429 | |
00bfffa4 | 430 | out: |
338d90b8 | 431 | if (null_test) |
db3927fb | 432 | expr = fold_build3_loc (input_location, COND_EXPR, target_type, null_test, expr, |
e8160c9a | 433 | build_zero_cst (target_type)); |
f2606a97 | 434 | |
338d90b8 | 435 | return expr; |
8d08fdba MS |
436 | } |
437 | ||
00bfffa4 JM |
438 | /* Subroutine of build_base_path; EXPR and BINFO are as in that function. |
439 | Perform a derived-to-base conversion by recursively building up a | |
440 | sequence of COMPONENT_REFs to the appropriate base fields. */ | |
441 | ||
442 | static tree | |
443 | build_simple_base_path (tree expr, tree binfo) | |
444 | { | |
445 | tree type = BINFO_TYPE (binfo); | |
fc6633e0 | 446 | tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo); |
00bfffa4 JM |
447 | tree field; |
448 | ||
00bfffa4 JM |
449 | if (d_binfo == NULL_TREE) |
450 | { | |
12a669d1 | 451 | tree temp; |
c8094d83 | 452 | |
8dc2b103 | 453 | gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type); |
c8094d83 | 454 | |
12a669d1 | 455 | /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' |
0cbd7506 | 456 | into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only |
3b426391 KH |
457 | an lvalue in the front end; only _DECLs and _REFs are lvalues |
458 | in the back end. */ | |
12a669d1 NS |
459 | temp = unary_complex_lvalue (ADDR_EXPR, expr); |
460 | if (temp) | |
dd865ef6 | 461 | expr = cp_build_indirect_ref (temp, RO_NULL, tf_warning_or_error); |
12a669d1 | 462 | |
00bfffa4 JM |
463 | return expr; |
464 | } | |
465 | ||
466 | /* Recurse. */ | |
467 | expr = build_simple_base_path (expr, d_binfo); | |
468 | ||
469 | for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo)); | |
910ad8de | 470 | field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
471 | /* Is this the base field created by build_base_field? */ |
472 | if (TREE_CODE (field) == FIELD_DECL | |
642124c6 RH |
473 | && DECL_FIELD_IS_BASE (field) |
474 | && TREE_TYPE (field) == type) | |
12a669d1 NS |
475 | { |
476 | /* We don't use build_class_member_access_expr here, as that | |
477 | has unnecessary checks, and more importantly results in | |
478 | recursive calls to dfs_walk_once. */ | |
479 | int type_quals = cp_type_quals (TREE_TYPE (expr)); | |
480 | ||
481 | expr = build3 (COMPONENT_REF, | |
482 | cp_build_qualified_type (type, type_quals), | |
483 | expr, field, NULL_TREE); | |
484 | expr = fold_if_not_in_template (expr); | |
c8094d83 | 485 | |
12a669d1 NS |
486 | /* Mark the expression const or volatile, as appropriate. |
487 | Even though we've dealt with the type above, we still have | |
488 | to mark the expression itself. */ | |
489 | if (type_quals & TYPE_QUAL_CONST) | |
490 | TREE_READONLY (expr) = 1; | |
491 | if (type_quals & TYPE_QUAL_VOLATILE) | |
492 | TREE_THIS_VOLATILE (expr) = 1; | |
c8094d83 | 493 | |
12a669d1 NS |
494 | return expr; |
495 | } | |
00bfffa4 JM |
496 | |
497 | /* Didn't find the base field?!? */ | |
8dc2b103 | 498 | gcc_unreachable (); |
00bfffa4 JM |
499 | } |
500 | ||
08e17d9d MM |
501 | /* Convert OBJECT to the base TYPE. OBJECT is an expression whose |
502 | type is a class type or a pointer to a class type. In the former | |
503 | case, TYPE is also a class type; in the latter it is another | |
504 | pointer type. If CHECK_ACCESS is true, an error message is emitted | |
505 | if TYPE is inaccessible. If OBJECT has pointer type, the value is | |
506 | assumed to be non-NULL. */ | |
50ad9642 MM |
507 | |
508 | tree | |
798ec807 JM |
509 | convert_to_base (tree object, tree type, bool check_access, bool nonnull, |
510 | tsubst_flags_t complain) | |
50ad9642 MM |
511 | { |
512 | tree binfo; | |
08e17d9d | 513 | tree object_type; |
798ec807 | 514 | base_access access; |
50ad9642 | 515 | |
08e17d9d MM |
516 | if (TYPE_PTR_P (TREE_TYPE (object))) |
517 | { | |
518 | object_type = TREE_TYPE (TREE_TYPE (object)); | |
519 | type = TREE_TYPE (type); | |
520 | } | |
521 | else | |
522 | object_type = TREE_TYPE (object); | |
523 | ||
798ec807 JM |
524 | access = check_access ? ba_check : ba_unique; |
525 | if (!(complain & tf_error)) | |
526 | access |= ba_quiet; | |
08e17d9d | 527 | binfo = lookup_base (object_type, type, |
798ec807 | 528 | access, |
50ad9642 | 529 | NULL); |
5bfc90de | 530 | if (!binfo || binfo == error_mark_node) |
50ad9642 MM |
531 | return error_mark_node; |
532 | ||
a271590a | 533 | return build_base_path (PLUS_EXPR, object, binfo, nonnull, complain); |
50ad9642 MM |
534 | } |
535 | ||
539ed333 NS |
536 | /* EXPR is an expression with unqualified class type. BASE is a base |
537 | binfo of that class type. Returns EXPR, converted to the BASE | |
22ed7e5f MM |
538 | type. This function assumes that EXPR is the most derived class; |
539 | therefore virtual bases can be found at their static offsets. */ | |
540 | ||
541 | tree | |
542 | convert_to_base_statically (tree expr, tree base) | |
543 | { | |
544 | tree expr_type; | |
545 | ||
546 | expr_type = TREE_TYPE (expr); | |
539ed333 | 547 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type)) |
22ed7e5f | 548 | { |
ffd34392 JH |
549 | /* We use fold_build2 and fold_convert below to simplify the trees |
550 | provided to the optimizers. It is not safe to call these functions | |
551 | when processing a template because they do not handle C++-specific | |
552 | trees. */ | |
553 | gcc_assert (!processing_template_decl); | |
93c0e0bb | 554 | expr = cp_build_addr_expr (expr, tf_warning_or_error); |
22ed7e5f | 555 | if (!integer_zerop (BINFO_OFFSET (base))) |
5d49b6a7 RG |
556 | expr = fold_build_pointer_plus_loc (input_location, |
557 | expr, BINFO_OFFSET (base)); | |
ffd34392 | 558 | expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr); |
db3927fb | 559 | expr = build_fold_indirect_ref_loc (input_location, expr); |
22ed7e5f MM |
560 | } |
561 | ||
562 | return expr; | |
563 | } | |
564 | ||
f8361147 | 565 | \f |
981c353e RH |
566 | tree |
567 | build_vfield_ref (tree datum, tree type) | |
568 | { | |
569 | tree vfield, vcontext; | |
570 | ||
571 | if (datum == error_mark_node) | |
572 | return error_mark_node; | |
573 | ||
981c353e RH |
574 | /* First, convert to the requested type. */ |
575 | if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type)) | |
08e17d9d | 576 | datum = convert_to_base (datum, type, /*check_access=*/false, |
798ec807 | 577 | /*nonnull=*/true, tf_warning_or_error); |
981c353e RH |
578 | |
579 | /* Second, the requested type may not be the owner of its own vptr. | |
580 | If not, convert to the base class that owns it. We cannot use | |
581 | convert_to_base here, because VCONTEXT may appear more than once | |
5995ebfb | 582 | in the inheritance hierarchy of TYPE, and thus direct conversion |
981c353e RH |
583 | between the types may be ambiguous. Following the path back up |
584 | one step at a time via primary bases avoids the problem. */ | |
585 | vfield = TYPE_VFIELD (type); | |
586 | vcontext = DECL_CONTEXT (vfield); | |
587 | while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type)) | |
588 | { | |
589 | datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type)); | |
590 | type = TREE_TYPE (datum); | |
591 | } | |
592 | ||
593 | return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE); | |
594 | } | |
595 | ||
8d08fdba | 596 | /* Given an object INSTANCE, return an expression which yields the |
67231816 RH |
597 | vtable element corresponding to INDEX. There are many special |
598 | cases for INSTANCE which we take care of here, mainly to avoid | |
599 | creating extra tree nodes when we don't have to. */ | |
e92cc029 | 600 | |
4a8d0c9c | 601 | static tree |
94edc4ab | 602 | build_vtbl_ref_1 (tree instance, tree idx) |
8d08fdba | 603 | { |
f63ab951 JM |
604 | tree aref; |
605 | tree vtbl = NULL_TREE; | |
8d08fdba | 606 | |
f63ab951 JM |
607 | /* Try to figure out what a reference refers to, and |
608 | access its virtual function table directly. */ | |
609 | ||
610 | int cdtorp = 0; | |
611 | tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp); | |
612 | ||
ee76b931 | 613 | tree basetype = non_reference (TREE_TYPE (instance)); |
8d08fdba | 614 | |
f63ab951 | 615 | if (fixed_type && !cdtorp) |
8d08fdba | 616 | { |
f63ab951 | 617 | tree binfo = lookup_base (fixed_type, basetype, |
18e4be85 | 618 | ba_unique | ba_quiet, NULL); |
f63ab951 | 619 | if (binfo) |
6de9cd9a | 620 | vtbl = unshare_expr (BINFO_VTABLE (binfo)); |
f63ab951 | 621 | } |
8d08fdba | 622 | |
f63ab951 | 623 | if (!vtbl) |
dbbf88d1 | 624 | vtbl = build_vfield_ref (instance, basetype); |
c8094d83 | 625 | |
3a11c665 | 626 | aref = build_array_ref (input_location, vtbl, idx); |
6de9cd9a | 627 | TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx); |
8d08fdba | 628 | |
c4372ef4 | 629 | return aref; |
8d08fdba MS |
630 | } |
631 | ||
4a8d0c9c | 632 | tree |
94edc4ab | 633 | build_vtbl_ref (tree instance, tree idx) |
4a8d0c9c RH |
634 | { |
635 | tree aref = build_vtbl_ref_1 (instance, idx); | |
636 | ||
4a8d0c9c RH |
637 | return aref; |
638 | } | |
639 | ||
0f59171d RH |
640 | /* Given a stable object pointer INSTANCE_PTR, return an expression which |
641 | yields a function pointer corresponding to vtable element INDEX. */ | |
67231816 RH |
642 | |
643 | tree | |
0f59171d | 644 | build_vfn_ref (tree instance_ptr, tree idx) |
67231816 | 645 | { |
0f59171d RH |
646 | tree aref; |
647 | ||
dd865ef6 | 648 | aref = build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr, RO_NULL, |
5ade1ed2 DG |
649 | tf_warning_or_error), |
650 | idx); | |
67231816 RH |
651 | |
652 | /* When using function descriptors, the address of the | |
653 | vtable entry is treated as a function pointer. */ | |
654 | if (TARGET_VTABLE_USES_DESCRIPTORS) | |
4a8d0c9c | 655 | aref = build1 (NOP_EXPR, TREE_TYPE (aref), |
93c0e0bb | 656 | cp_build_addr_expr (aref, tf_warning_or_error)); |
67231816 | 657 | |
0f59171d | 658 | /* Remember this as a method reference, for later devirtualization. */ |
f293ce4b | 659 | aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx); |
0f59171d | 660 | |
67231816 RH |
661 | return aref; |
662 | } | |
663 | ||
669ec2b4 JM |
664 | /* Return the name of the virtual function table (as an IDENTIFIER_NODE) |
665 | for the given TYPE. */ | |
666 | ||
667 | static tree | |
94edc4ab | 668 | get_vtable_name (tree type) |
669ec2b4 | 669 | { |
1f84ec23 | 670 | return mangle_vtbl_for_type (type); |
669ec2b4 JM |
671 | } |
672 | ||
4684cd27 MM |
673 | /* DECL is an entity associated with TYPE, like a virtual table or an |
674 | implicitly generated constructor. Determine whether or not DECL | |
675 | should have external or internal linkage at the object file | |
676 | level. This routine does not deal with COMDAT linkage and other | |
677 | similar complexities; it simply sets TREE_PUBLIC if it possible for | |
678 | entities in other translation units to contain copies of DECL, in | |
679 | the abstract. */ | |
680 | ||
681 | void | |
012d5d25 | 682 | set_linkage_according_to_type (tree type ATTRIBUTE_UNUSED, tree decl) |
4684cd27 | 683 | { |
012d5d25 JM |
684 | TREE_PUBLIC (decl) = 1; |
685 | determine_visibility (decl); | |
4684cd27 MM |
686 | } |
687 | ||
459c43ad MM |
688 | /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE. |
689 | (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.) | |
690 | Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */ | |
b9f39201 MM |
691 | |
692 | static tree | |
94edc4ab | 693 | build_vtable (tree class_type, tree name, tree vtable_type) |
b9f39201 MM |
694 | { |
695 | tree decl; | |
696 | ||
697 | decl = build_lang_decl (VAR_DECL, name, vtable_type); | |
90ecce3e JM |
698 | /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME |
699 | now to avoid confusion in mangle_decl. */ | |
700 | SET_DECL_ASSEMBLER_NAME (decl, name); | |
b9f39201 MM |
701 | DECL_CONTEXT (decl) = class_type; |
702 | DECL_ARTIFICIAL (decl) = 1; | |
703 | TREE_STATIC (decl) = 1; | |
b9f39201 | 704 | TREE_READONLY (decl) = 1; |
b9f39201 | 705 | DECL_VIRTUAL_P (decl) = 1; |
a6f5e048 | 706 | DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN; |
d35543c0 | 707 | DECL_VTABLE_OR_VTT_P (decl) = 1; |
78d55cc8 JM |
708 | /* At one time the vtable info was grabbed 2 words at a time. This |
709 | fails on sparc unless you have 8-byte alignment. (tiemann) */ | |
710 | DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node), | |
711 | DECL_ALIGN (decl)); | |
4684cd27 MM |
712 | set_linkage_according_to_type (class_type, decl); |
713 | /* The vtable has not been defined -- yet. */ | |
714 | DECL_EXTERNAL (decl) = 1; | |
715 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
716 | ||
78e0d62b RH |
717 | /* Mark the VAR_DECL node representing the vtable itself as a |
718 | "gratuitous" one, thereby forcing dwarfout.c to ignore it. It | |
719 | is rather important that such things be ignored because any | |
720 | effort to actually generate DWARF for them will run into | |
721 | trouble when/if we encounter code like: | |
c8094d83 | 722 | |
78e0d62b RH |
723 | #pragma interface |
724 | struct S { virtual void member (); }; | |
c8094d83 | 725 | |
78e0d62b RH |
726 | because the artificial declaration of the vtable itself (as |
727 | manufactured by the g++ front end) will say that the vtable is | |
728 | a static member of `S' but only *after* the debug output for | |
729 | the definition of `S' has already been output. This causes | |
730 | grief because the DWARF entry for the definition of the vtable | |
731 | will try to refer back to an earlier *declaration* of the | |
732 | vtable as a static member of `S' and there won't be one. We | |
733 | might be able to arrange to have the "vtable static member" | |
734 | attached to the member list for `S' before the debug info for | |
735 | `S' get written (which would solve the problem) but that would | |
736 | require more intrusive changes to the g++ front end. */ | |
737 | DECL_IGNORED_P (decl) = 1; | |
78d55cc8 | 738 | |
b9f39201 MM |
739 | return decl; |
740 | } | |
741 | ||
1aa4ccd4 NS |
742 | /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic, |
743 | or even complete. If this does not exist, create it. If COMPLETE is | |
838dfd8a | 744 | nonzero, then complete the definition of it -- that will render it |
1aa4ccd4 NS |
745 | impossible to actually build the vtable, but is useful to get at those |
746 | which are known to exist in the runtime. */ | |
747 | ||
c8094d83 | 748 | tree |
94edc4ab | 749 | get_vtable_decl (tree type, int complete) |
1aa4ccd4 | 750 | { |
548502d3 MM |
751 | tree decl; |
752 | ||
753 | if (CLASSTYPE_VTABLES (type)) | |
754 | return CLASSTYPE_VTABLES (type); | |
c8094d83 | 755 | |
d1a74aa7 | 756 | decl = build_vtable (type, get_vtable_name (type), vtbl_type_node); |
548502d3 MM |
757 | CLASSTYPE_VTABLES (type) = decl; |
758 | ||
1aa4ccd4 | 759 | if (complete) |
217f4eb9 MM |
760 | { |
761 | DECL_EXTERNAL (decl) = 1; | |
3600f678 | 762 | cp_finish_decl (decl, NULL_TREE, false, NULL_TREE, 0); |
217f4eb9 | 763 | } |
1aa4ccd4 | 764 | |
1aa4ccd4 NS |
765 | return decl; |
766 | } | |
767 | ||
28531dd0 MM |
768 | /* Build the primary virtual function table for TYPE. If BINFO is |
769 | non-NULL, build the vtable starting with the initial approximation | |
770 | that it is the same as the one which is the head of the association | |
838dfd8a | 771 | list. Returns a nonzero value if a new vtable is actually |
28531dd0 | 772 | created. */ |
e92cc029 | 773 | |
28531dd0 | 774 | static int |
94edc4ab | 775 | build_primary_vtable (tree binfo, tree type) |
8d08fdba | 776 | { |
31f8e4f3 MM |
777 | tree decl; |
778 | tree virtuals; | |
8d08fdba | 779 | |
1aa4ccd4 | 780 | decl = get_vtable_decl (type, /*complete=*/0); |
c8094d83 | 781 | |
8d08fdba MS |
782 | if (binfo) |
783 | { | |
dbbf88d1 | 784 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
785 | /* We have already created a vtable for this base, so there's |
786 | no need to do it again. */ | |
28531dd0 | 787 | return 0; |
c8094d83 | 788 | |
d1f05f93 | 789 | virtuals = copy_list (BINFO_VIRTUALS (binfo)); |
c35cce41 MM |
790 | TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo)); |
791 | DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl)); | |
792 | DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl)); | |
8d08fdba MS |
793 | } |
794 | else | |
795 | { | |
50bc768d | 796 | gcc_assert (TREE_TYPE (decl) == vtbl_type_node); |
8d08fdba | 797 | virtuals = NULL_TREE; |
8d08fdba MS |
798 | } |
799 | ||
800 | #ifdef GATHER_STATISTICS | |
801 | n_vtables += 1; | |
802 | n_vtable_elems += list_length (virtuals); | |
803 | #endif | |
804 | ||
8d08fdba MS |
805 | /* Initialize the association list for this type, based |
806 | on our first approximation. */ | |
604a3205 NS |
807 | BINFO_VTABLE (TYPE_BINFO (type)) = decl; |
808 | BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals; | |
dbbf88d1 | 809 | SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type)); |
28531dd0 | 810 | return 1; |
8d08fdba MS |
811 | } |
812 | ||
3461fba7 | 813 | /* Give BINFO a new virtual function table which is initialized |
8d08fdba MS |
814 | with a skeleton-copy of its original initialization. The only |
815 | entry that changes is the `delta' entry, so we can really | |
816 | share a lot of structure. | |
817 | ||
3461fba7 | 818 | FOR_TYPE is the most derived type which caused this table to |
8d08fdba MS |
819 | be needed. |
820 | ||
838dfd8a | 821 | Returns nonzero if we haven't met BINFO before. |
2636fde4 JM |
822 | |
823 | The order in which vtables are built (by calling this function) for | |
824 | an object must remain the same, otherwise a binary incompatibility | |
825 | can result. */ | |
e92cc029 | 826 | |
28531dd0 | 827 | static int |
dbbf88d1 | 828 | build_secondary_vtable (tree binfo) |
8d08fdba | 829 | { |
dbbf88d1 | 830 | if (BINFO_NEW_VTABLE_MARKED (binfo)) |
0533d788 MM |
831 | /* We already created a vtable for this base. There's no need to |
832 | do it again. */ | |
28531dd0 | 833 | return 0; |
0533d788 | 834 | |
8d7a5379 MM |
835 | /* Remember that we've created a vtable for this BINFO, so that we |
836 | don't try to do so again. */ | |
dbbf88d1 | 837 | SET_BINFO_NEW_VTABLE_MARKED (binfo); |
c8094d83 | 838 | |
8d7a5379 | 839 | /* Make fresh virtual list, so we can smash it later. */ |
d1f05f93 | 840 | BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo)); |
8d7a5379 | 841 | |
3461fba7 NS |
842 | /* Secondary vtables are laid out as part of the same structure as |
843 | the primary vtable. */ | |
844 | BINFO_VTABLE (binfo) = NULL_TREE; | |
28531dd0 | 845 | return 1; |
8d08fdba MS |
846 | } |
847 | ||
28531dd0 | 848 | /* Create a new vtable for BINFO which is the hierarchy dominated by |
838dfd8a | 849 | T. Return nonzero if we actually created a new vtable. */ |
28531dd0 MM |
850 | |
851 | static int | |
94edc4ab | 852 | make_new_vtable (tree t, tree binfo) |
28531dd0 MM |
853 | { |
854 | if (binfo == TYPE_BINFO (t)) | |
855 | /* In this case, it is *type*'s vtable we are modifying. We start | |
d0cd8b44 | 856 | with the approximation that its vtable is that of the |
28531dd0 | 857 | immediate base class. */ |
981c353e | 858 | return build_primary_vtable (binfo, t); |
28531dd0 MM |
859 | else |
860 | /* This is our very own copy of `basetype' to play with. Later, | |
861 | we will fill in all the virtual functions that override the | |
862 | virtual functions in these base classes which are not defined | |
863 | by the current type. */ | |
dbbf88d1 | 864 | return build_secondary_vtable (binfo); |
28531dd0 MM |
865 | } |
866 | ||
867 | /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO | |
868 | (which is in the hierarchy dominated by T) list FNDECL as its | |
4e7512c9 MM |
869 | BV_FN. DELTA is the required constant adjustment from the `this' |
870 | pointer where the vtable entry appears to the `this' required when | |
871 | the function is actually called. */ | |
8d08fdba MS |
872 | |
873 | static void | |
94edc4ab | 874 | modify_vtable_entry (tree t, |
0cbd7506 MS |
875 | tree binfo, |
876 | tree fndecl, | |
877 | tree delta, | |
878 | tree *virtuals) | |
8d08fdba | 879 | { |
28531dd0 | 880 | tree v; |
c0bbf652 | 881 | |
28531dd0 | 882 | v = *virtuals; |
c0bbf652 | 883 | |
5e19c053 | 884 | if (fndecl != BV_FN (v) |
4e7512c9 | 885 | || !tree_int_cst_equal (delta, BV_DELTA (v))) |
c0bbf652 | 886 | { |
28531dd0 MM |
887 | /* We need a new vtable for BINFO. */ |
888 | if (make_new_vtable (t, binfo)) | |
889 | { | |
890 | /* If we really did make a new vtable, we also made a copy | |
891 | of the BINFO_VIRTUALS list. Now, we have to find the | |
892 | corresponding entry in that list. */ | |
893 | *virtuals = BINFO_VIRTUALS (binfo); | |
5e19c053 | 894 | while (BV_FN (*virtuals) != BV_FN (v)) |
28531dd0 MM |
895 | *virtuals = TREE_CHAIN (*virtuals); |
896 | v = *virtuals; | |
897 | } | |
8d08fdba | 898 | |
5e19c053 | 899 | BV_DELTA (v) = delta; |
aabb4cd6 | 900 | BV_VCALL_INDEX (v) = NULL_TREE; |
5e19c053 | 901 | BV_FN (v) = fndecl; |
8d08fdba | 902 | } |
8d08fdba MS |
903 | } |
904 | ||
8d08fdba | 905 | \f |
b2a9b208 | 906 | /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is |
b77fe7b4 NS |
907 | the USING_DECL naming METHOD. Returns true if the method could be |
908 | added to the method vec. */ | |
e92cc029 | 909 | |
b77fe7b4 | 910 | bool |
b2a9b208 | 911 | add_method (tree type, tree method, tree using_decl) |
8d08fdba | 912 | { |
9ba5ff0f | 913 | unsigned slot; |
90ea9897 | 914 | tree overload; |
b54a07e8 NS |
915 | bool template_conv_p = false; |
916 | bool conv_p; | |
d4e6fecb | 917 | VEC(tree,gc) *method_vec; |
aaaa46d2 | 918 | bool complete_p; |
9ba5ff0f NS |
919 | bool insert_p = false; |
920 | tree current_fns; | |
fc40d49c | 921 | tree fns; |
ac2b3222 AP |
922 | |
923 | if (method == error_mark_node) | |
b77fe7b4 | 924 | return false; |
aaaa46d2 MM |
925 | |
926 | complete_p = COMPLETE_TYPE_P (type); | |
b54a07e8 NS |
927 | conv_p = DECL_CONV_FN_P (method); |
928 | if (conv_p) | |
929 | template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL | |
930 | && DECL_TEMPLATE_CONV_FN_P (method)); | |
452a394b | 931 | |
452a394b | 932 | method_vec = CLASSTYPE_METHOD_VEC (type); |
aaaa46d2 MM |
933 | if (!method_vec) |
934 | { | |
935 | /* Make a new method vector. We start with 8 entries. We must | |
936 | allocate at least two (for constructors and destructors), and | |
937 | we're going to end up with an assignment operator at some | |
938 | point as well. */ | |
d4e6fecb | 939 | method_vec = VEC_alloc (tree, gc, 8); |
aaaa46d2 MM |
940 | /* Create slots for constructors and destructors. */ |
941 | VEC_quick_push (tree, method_vec, NULL_TREE); | |
942 | VEC_quick_push (tree, method_vec, NULL_TREE); | |
943 | CLASSTYPE_METHOD_VEC (type) = method_vec; | |
944 | } | |
945 | ||
0fcedd9c | 946 | /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */ |
7137605e MM |
947 | grok_special_member_properties (method); |
948 | ||
452a394b MM |
949 | /* Constructors and destructors go in special slots. */ |
950 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method)) | |
951 | slot = CLASSTYPE_CONSTRUCTOR_SLOT; | |
952 | else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) | |
4b0d3cbe MM |
953 | { |
954 | slot = CLASSTYPE_DESTRUCTOR_SLOT; | |
c8094d83 | 955 | |
f5c28a15 | 956 | if (TYPE_FOR_JAVA (type)) |
9f4faeae MM |
957 | { |
958 | if (!DECL_ARTIFICIAL (method)) | |
959 | error ("Java class %qT cannot have a destructor", type); | |
960 | else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
961 | error ("Java class %qT cannot have an implicit non-trivial " | |
962 | "destructor", | |
963 | type); | |
964 | } | |
4b0d3cbe | 965 | } |
452a394b | 966 | else |
61a127b3 | 967 | { |
aaaa46d2 MM |
968 | tree m; |
969 | ||
9ba5ff0f | 970 | insert_p = true; |
452a394b | 971 | /* See if we already have an entry with this name. */ |
c8094d83 | 972 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9ba5ff0f | 973 | VEC_iterate (tree, method_vec, slot, m); |
aaaa46d2 | 974 | ++slot) |
5dd236e2 | 975 | { |
5dd236e2 | 976 | m = OVL_CURRENT (m); |
5dd236e2 NS |
977 | if (template_conv_p) |
978 | { | |
aaaa46d2 MM |
979 | if (TREE_CODE (m) == TEMPLATE_DECL |
980 | && DECL_TEMPLATE_CONV_FN_P (m)) | |
981 | insert_p = false; | |
5dd236e2 NS |
982 | break; |
983 | } | |
aaaa46d2 | 984 | if (conv_p && !DECL_CONV_FN_P (m)) |
5dd236e2 | 985 | break; |
aaaa46d2 | 986 | if (DECL_NAME (m) == DECL_NAME (method)) |
452a394b | 987 | { |
aaaa46d2 MM |
988 | insert_p = false; |
989 | break; | |
8d08fdba | 990 | } |
aaaa46d2 MM |
991 | if (complete_p |
992 | && !DECL_CONV_FN_P (m) | |
993 | && DECL_NAME (m) > DECL_NAME (method)) | |
994 | break; | |
61a127b3 | 995 | } |
452a394b | 996 | } |
9ba5ff0f | 997 | current_fns = insert_p ? NULL_TREE : VEC_index (tree, method_vec, slot); |
c8094d83 | 998 | |
fc40d49c LM |
999 | /* Check to see if we've already got this method. */ |
1000 | for (fns = current_fns; fns; fns = OVL_NEXT (fns)) | |
452a394b | 1001 | { |
fc40d49c LM |
1002 | tree fn = OVL_CURRENT (fns); |
1003 | tree fn_type; | |
1004 | tree method_type; | |
1005 | tree parms1; | |
1006 | tree parms2; | |
1007 | ||
1008 | if (TREE_CODE (fn) != TREE_CODE (method)) | |
1009 | continue; | |
1010 | ||
1011 | /* [over.load] Member function declarations with the | |
1012 | same name and the same parameter types cannot be | |
1013 | overloaded if any of them is a static member | |
1014 | function declaration. | |
1015 | ||
1016 | [namespace.udecl] When a using-declaration brings names | |
1017 | from a base class into a derived class scope, member | |
1018 | functions in the derived class override and/or hide member | |
1019 | functions with the same name and parameter types in a base | |
1020 | class (rather than conflicting). */ | |
1021 | fn_type = TREE_TYPE (fn); | |
1022 | method_type = TREE_TYPE (method); | |
1023 | parms1 = TYPE_ARG_TYPES (fn_type); | |
1024 | parms2 = TYPE_ARG_TYPES (method_type); | |
1025 | ||
1026 | /* Compare the quals on the 'this' parm. Don't compare | |
1027 | the whole types, as used functions are treated as | |
1028 | coming from the using class in overload resolution. */ | |
1029 | if (! DECL_STATIC_FUNCTION_P (fn) | |
1030 | && ! DECL_STATIC_FUNCTION_P (method) | |
7b3e2d46 DG |
1031 | && TREE_TYPE (TREE_VALUE (parms1)) != error_mark_node |
1032 | && TREE_TYPE (TREE_VALUE (parms2)) != error_mark_node | |
a3360e77 JM |
1033 | && (cp_type_quals (TREE_TYPE (TREE_VALUE (parms1))) |
1034 | != cp_type_quals (TREE_TYPE (TREE_VALUE (parms2))))) | |
fc40d49c LM |
1035 | continue; |
1036 | ||
1037 | /* For templates, the return type and template parameters | |
1038 | must be identical. */ | |
1039 | if (TREE_CODE (fn) == TEMPLATE_DECL | |
1040 | && (!same_type_p (TREE_TYPE (fn_type), | |
1041 | TREE_TYPE (method_type)) | |
1042 | || !comp_template_parms (DECL_TEMPLATE_PARMS (fn), | |
1043 | DECL_TEMPLATE_PARMS (method)))) | |
1044 | continue; | |
1045 | ||
1046 | if (! DECL_STATIC_FUNCTION_P (fn)) | |
1047 | parms1 = TREE_CHAIN (parms1); | |
1048 | if (! DECL_STATIC_FUNCTION_P (method)) | |
1049 | parms2 = TREE_CHAIN (parms2); | |
1050 | ||
1051 | if (compparms (parms1, parms2) | |
1052 | && (!DECL_CONV_FN_P (fn) | |
1053 | || same_type_p (TREE_TYPE (fn_type), | |
1054 | TREE_TYPE (method_type)))) | |
452a394b | 1055 | { |
fc40d49c | 1056 | if (using_decl) |
452a394b | 1057 | { |
fc40d49c LM |
1058 | if (DECL_CONTEXT (fn) == type) |
1059 | /* Defer to the local function. */ | |
1060 | return false; | |
452a394b | 1061 | } |
fc40d49c LM |
1062 | else |
1063 | { | |
1064 | error ("%q+#D cannot be overloaded", method); | |
1065 | error ("with %q+#D", fn); | |
1066 | } | |
1067 | ||
1068 | /* We don't call duplicate_decls here to merge the | |
1069 | declarations because that will confuse things if the | |
1070 | methods have inline definitions. In particular, we | |
1071 | will crash while processing the definitions. */ | |
1072 | return false; | |
03017874 | 1073 | } |
452a394b | 1074 | } |
03017874 | 1075 | |
3db45ab5 | 1076 | /* A class should never have more than one destructor. */ |
357d956e MM |
1077 | if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method)) |
1078 | return false; | |
1079 | ||
c8094d83 | 1080 | /* Add the new binding. */ |
9ba5ff0f | 1081 | overload = build_overload (method, current_fns); |
c8094d83 | 1082 | |
357d956e MM |
1083 | if (conv_p) |
1084 | TYPE_HAS_CONVERSION (type) = 1; | |
1085 | else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p) | |
90ea9897 MM |
1086 | push_class_level_binding (DECL_NAME (method), overload); |
1087 | ||
9ba5ff0f NS |
1088 | if (insert_p) |
1089 | { | |
efb7e1e0 ILT |
1090 | bool reallocated; |
1091 | ||
9ba5ff0f NS |
1092 | /* We only expect to add few methods in the COMPLETE_P case, so |
1093 | just make room for one more method in that case. */ | |
efb7e1e0 ILT |
1094 | if (complete_p) |
1095 | reallocated = VEC_reserve_exact (tree, gc, method_vec, 1); | |
1096 | else | |
1097 | reallocated = VEC_reserve (tree, gc, method_vec, 1); | |
1098 | if (reallocated) | |
9ba5ff0f NS |
1099 | CLASSTYPE_METHOD_VEC (type) = method_vec; |
1100 | if (slot == VEC_length (tree, method_vec)) | |
1101 | VEC_quick_push (tree, method_vec, overload); | |
1102 | else | |
1103 | VEC_quick_insert (tree, method_vec, slot, overload); | |
1104 | } | |
1105 | else | |
03fd3f84 | 1106 | /* Replace the current slot. */ |
9ba5ff0f | 1107 | VEC_replace (tree, method_vec, slot, overload); |
b77fe7b4 | 1108 | return true; |
8d08fdba MS |
1109 | } |
1110 | ||
1111 | /* Subroutines of finish_struct. */ | |
1112 | ||
aa52c1ff JM |
1113 | /* Change the access of FDECL to ACCESS in T. Return 1 if change was |
1114 | legit, otherwise return 0. */ | |
e92cc029 | 1115 | |
8d08fdba | 1116 | static int |
94edc4ab | 1117 | alter_access (tree t, tree fdecl, tree access) |
8d08fdba | 1118 | { |
721c3b42 MM |
1119 | tree elem; |
1120 | ||
1121 | if (!DECL_LANG_SPECIFIC (fdecl)) | |
1122 | retrofit_lang_decl (fdecl); | |
1123 | ||
50bc768d | 1124 | gcc_assert (!DECL_DISCRIMINATOR_P (fdecl)); |
8e4ce833 | 1125 | |
721c3b42 | 1126 | elem = purpose_member (t, DECL_ACCESS (fdecl)); |
38afd588 | 1127 | if (elem) |
8d08fdba | 1128 | { |
38afd588 | 1129 | if (TREE_VALUE (elem) != access) |
8d08fdba | 1130 | { |
38afd588 | 1131 | if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL) |
dee15844 JM |
1132 | error ("conflicting access specifications for method" |
1133 | " %q+D, ignored", TREE_TYPE (fdecl)); | |
38afd588 | 1134 | else |
1f070f2b | 1135 | error ("conflicting access specifications for field %qE, ignored", |
4460cef2 | 1136 | DECL_NAME (fdecl)); |
8d08fdba MS |
1137 | } |
1138 | else | |
430bb96b JL |
1139 | { |
1140 | /* They're changing the access to the same thing they changed | |
1141 | it to before. That's OK. */ | |
1142 | ; | |
1143 | } | |
db5ae43f | 1144 | } |
38afd588 | 1145 | else |
8d08fdba | 1146 | { |
02022f3a | 1147 | perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl); |
be99da77 | 1148 | DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl)); |
8d08fdba MS |
1149 | return 1; |
1150 | } | |
1151 | return 0; | |
1152 | } | |
1153 | ||
58010b57 | 1154 | /* Process the USING_DECL, which is a member of T. */ |
79ad62b2 | 1155 | |
e9659ab0 | 1156 | static void |
94edc4ab | 1157 | handle_using_decl (tree using_decl, tree t) |
79ad62b2 | 1158 | { |
98ed9dae | 1159 | tree decl = USING_DECL_DECLS (using_decl); |
79ad62b2 MM |
1160 | tree name = DECL_NAME (using_decl); |
1161 | tree access | |
1162 | = TREE_PRIVATE (using_decl) ? access_private_node | |
1163 | : TREE_PROTECTED (using_decl) ? access_protected_node | |
1164 | : access_public_node; | |
79ad62b2 | 1165 | tree flist = NULL_TREE; |
aa52c1ff | 1166 | tree old_value; |
79ad62b2 | 1167 | |
98ed9dae | 1168 | gcc_assert (!processing_template_decl && decl); |
c8094d83 | 1169 | |
db422ace PC |
1170 | old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false, |
1171 | tf_warning_or_error); | |
aa52c1ff | 1172 | if (old_value) |
79ad62b2 | 1173 | { |
aa52c1ff JM |
1174 | if (is_overloaded_fn (old_value)) |
1175 | old_value = OVL_CURRENT (old_value); | |
1176 | ||
1177 | if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t) | |
1178 | /* OK */; | |
1179 | else | |
1180 | old_value = NULL_TREE; | |
79ad62b2 | 1181 | } |
c8094d83 | 1182 | |
6e976965 | 1183 | cp_emit_debug_info_for_using (decl, USING_DECL_SCOPE (using_decl)); |
c8094d83 | 1184 | |
98ed9dae NS |
1185 | if (is_overloaded_fn (decl)) |
1186 | flist = decl; | |
aa52c1ff JM |
1187 | |
1188 | if (! old_value) | |
1189 | ; | |
1190 | else if (is_overloaded_fn (old_value)) | |
79ad62b2 | 1191 | { |
aa52c1ff JM |
1192 | if (flist) |
1193 | /* It's OK to use functions from a base when there are functions with | |
1194 | the same name already present in the current class. */; | |
1195 | else | |
79ad62b2 | 1196 | { |
dee15844 JM |
1197 | error ("%q+D invalid in %q#T", using_decl, t); |
1198 | error (" because of local method %q+#D with same name", | |
1199 | OVL_CURRENT (old_value)); | |
aa52c1ff | 1200 | return; |
79ad62b2 MM |
1201 | } |
1202 | } | |
186c0fbe | 1203 | else if (!DECL_ARTIFICIAL (old_value)) |
aa52c1ff | 1204 | { |
dee15844 JM |
1205 | error ("%q+D invalid in %q#T", using_decl, t); |
1206 | error (" because of local member %q+#D with same name", old_value); | |
aa52c1ff JM |
1207 | return; |
1208 | } | |
c8094d83 | 1209 | |
f4f206f4 | 1210 | /* Make type T see field decl FDECL with access ACCESS. */ |
aa52c1ff JM |
1211 | if (flist) |
1212 | for (; flist; flist = OVL_NEXT (flist)) | |
1213 | { | |
b2a9b208 | 1214 | add_method (t, OVL_CURRENT (flist), using_decl); |
aa52c1ff JM |
1215 | alter_access (t, OVL_CURRENT (flist), access); |
1216 | } | |
1217 | else | |
98ed9dae | 1218 | alter_access (t, decl, access); |
79ad62b2 | 1219 | } |
8d08fdba | 1220 | \f |
e5e459bf AO |
1221 | /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P, |
1222 | and NO_CONST_ASN_REF_P. Also set flag bits in T based on | |
1223 | properties of the bases. */ | |
8d08fdba | 1224 | |
607cf131 | 1225 | static void |
94edc4ab | 1226 | check_bases (tree t, |
0cbd7506 | 1227 | int* cant_have_const_ctor_p, |
10746f37 | 1228 | int* no_const_asn_ref_p) |
8d08fdba | 1229 | { |
607cf131 | 1230 | int i; |
0a35513e AH |
1231 | bool seen_non_virtual_nearly_empty_base_p = 0; |
1232 | int seen_tm_mask = 0; | |
fa743e8c NS |
1233 | tree base_binfo; |
1234 | tree binfo; | |
c32097d8 | 1235 | tree field = NULL_TREE; |
8d08fdba | 1236 | |
c32097d8 | 1237 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) |
910ad8de | 1238 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
c32097d8 JM |
1239 | if (TREE_CODE (field) == FIELD_DECL) |
1240 | break; | |
1241 | ||
fa743e8c NS |
1242 | for (binfo = TYPE_BINFO (t), i = 0; |
1243 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
8d08fdba | 1244 | { |
fa743e8c | 1245 | tree basetype = TREE_TYPE (base_binfo); |
9a71c18b | 1246 | |
50bc768d | 1247 | gcc_assert (COMPLETE_TYPE_P (basetype)); |
c8094d83 | 1248 | |
486d481b VV |
1249 | if (CLASSTYPE_FINAL (basetype)) |
1250 | error ("cannot derive from %<final%> base %qT in derived type %qT", | |
1251 | basetype, t); | |
1252 | ||
3b49d762 GDR |
1253 | /* If any base class is non-literal, so is the derived class. */ |
1254 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
1255 | CLASSTYPE_LITERAL_P (t) = false; | |
1256 | ||
4c6b7393 | 1257 | /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P |
607cf131 MM |
1258 | here because the case of virtual functions but non-virtual |
1259 | dtor is handled in finish_struct_1. */ | |
74fa0285 GDR |
1260 | if (!TYPE_POLYMORPHIC_P (basetype)) |
1261 | warning (OPT_Weffc__, | |
3db45ab5 | 1262 | "base class %q#T has a non-virtual destructor", basetype); |
8d08fdba | 1263 | |
607cf131 MM |
1264 | /* If the base class doesn't have copy constructors or |
1265 | assignment operators that take const references, then the | |
1266 | derived class cannot have such a member automatically | |
1267 | generated. */ | |
d758e847 JM |
1268 | if (TYPE_HAS_COPY_CTOR (basetype) |
1269 | && ! TYPE_HAS_CONST_COPY_CTOR (basetype)) | |
607cf131 | 1270 | *cant_have_const_ctor_p = 1; |
066ec0a4 JM |
1271 | if (TYPE_HAS_COPY_ASSIGN (basetype) |
1272 | && !TYPE_HAS_CONST_COPY_ASSIGN (basetype)) | |
607cf131 | 1273 | *no_const_asn_ref_p = 1; |
8d08fdba | 1274 | |
809e3e7f | 1275 | if (BINFO_VIRTUAL_P (base_binfo)) |
00a17e31 | 1276 | /* A virtual base does not effect nearly emptiness. */ |
0fb3018c | 1277 | ; |
f9c528ea | 1278 | else if (CLASSTYPE_NEARLY_EMPTY_P (basetype)) |
0fb3018c NS |
1279 | { |
1280 | if (seen_non_virtual_nearly_empty_base_p) | |
1281 | /* And if there is more than one nearly empty base, then the | |
1282 | derived class is not nearly empty either. */ | |
1283 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
1284 | else | |
00a17e31 | 1285 | /* Remember we've seen one. */ |
0fb3018c NS |
1286 | seen_non_virtual_nearly_empty_base_p = 1; |
1287 | } | |
1288 | else if (!is_empty_class (basetype)) | |
1289 | /* If the base class is not empty or nearly empty, then this | |
1290 | class cannot be nearly empty. */ | |
1291 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
f9c528ea | 1292 | |
607cf131 MM |
1293 | /* A lot of properties from the bases also apply to the derived |
1294 | class. */ | |
8d08fdba | 1295 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype); |
c8094d83 | 1296 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 1297 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype); |
066ec0a4 | 1298 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
d758e847 JM |
1299 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype) |
1300 | || !TYPE_HAS_COPY_ASSIGN (basetype)); | |
1301 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype) | |
1302 | || !TYPE_HAS_COPY_CTOR (basetype)); | |
ac177431 JM |
1303 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |
1304 | |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype); | |
1305 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype); | |
4c6b7393 | 1306 | TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype); |
c8094d83 | 1307 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) |
5ec1192e | 1308 | |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype); |
ac177431 JM |
1309 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype) |
1310 | || TYPE_HAS_COMPLEX_DFLT (basetype)); | |
c32097d8 JM |
1311 | |
1312 | /* A standard-layout class is a class that: | |
1313 | ... | |
1314 | * has no non-standard-layout base classes, */ | |
1315 | CLASSTYPE_NON_STD_LAYOUT (t) |= CLASSTYPE_NON_STD_LAYOUT (basetype); | |
1316 | if (!CLASSTYPE_NON_STD_LAYOUT (t)) | |
1317 | { | |
1318 | tree basefield; | |
1319 | /* ...has no base classes of the same type as the first non-static | |
1320 | data member... */ | |
1321 | if (field && DECL_CONTEXT (field) == t | |
1322 | && (same_type_ignoring_top_level_qualifiers_p | |
1323 | (TREE_TYPE (field), basetype))) | |
1324 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1325 | else | |
1326 | /* ...either has no non-static data members in the most-derived | |
1327 | class and at most one base class with non-static data | |
1328 | members, or has no base classes with non-static data | |
1329 | members */ | |
1330 | for (basefield = TYPE_FIELDS (basetype); basefield; | |
910ad8de | 1331 | basefield = DECL_CHAIN (basefield)) |
c32097d8 JM |
1332 | if (TREE_CODE (basefield) == FIELD_DECL) |
1333 | { | |
1334 | if (field) | |
1335 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
1336 | else | |
1337 | field = basefield; | |
1338 | break; | |
1339 | } | |
1340 | } | |
0a35513e AH |
1341 | |
1342 | /* Don't bother collecting tm attributes if transactional memory | |
1343 | support is not enabled. */ | |
1344 | if (flag_tm) | |
1345 | { | |
1346 | tree tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (basetype)); | |
1347 | if (tm_attr) | |
1348 | seen_tm_mask |= tm_attr_to_mask (tm_attr); | |
1349 | } | |
1350 | } | |
1351 | ||
1352 | /* If one of the base classes had TM attributes, and the current class | |
1353 | doesn't define its own, then the current class inherits one. */ | |
1354 | if (seen_tm_mask && !find_tm_attribute (TYPE_ATTRIBUTES (t))) | |
1355 | { | |
1356 | tree tm_attr = tm_mask_to_attr (seen_tm_mask & -seen_tm_mask); | |
1357 | TYPE_ATTRIBUTES (t) = tree_cons (tm_attr, NULL, TYPE_ATTRIBUTES (t)); | |
607cf131 MM |
1358 | } |
1359 | } | |
1360 | ||
fc6633e0 NS |
1361 | /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for |
1362 | those that are primaries. Sets BINFO_LOST_PRIMARY_P for those | |
1363 | that have had a nearly-empty virtual primary base stolen by some | |
77880ae4 | 1364 | other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for |
fc6633e0 | 1365 | T. */ |
c35cce41 MM |
1366 | |
1367 | static void | |
fc6633e0 | 1368 | determine_primary_bases (tree t) |
c35cce41 | 1369 | { |
fc6633e0 NS |
1370 | unsigned i; |
1371 | tree primary = NULL_TREE; | |
1372 | tree type_binfo = TYPE_BINFO (t); | |
1373 | tree base_binfo; | |
1374 | ||
1375 | /* Determine the primary bases of our bases. */ | |
1376 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1377 | base_binfo = TREE_CHAIN (base_binfo)) | |
c35cce41 | 1378 | { |
fc6633e0 | 1379 | tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo)); |
c35cce41 | 1380 | |
fc6633e0 NS |
1381 | /* See if we're the non-virtual primary of our inheritance |
1382 | chain. */ | |
1383 | if (!BINFO_VIRTUAL_P (base_binfo)) | |
dbbf88d1 | 1384 | { |
fc6633e0 NS |
1385 | tree parent = BINFO_INHERITANCE_CHAIN (base_binfo); |
1386 | tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent)); | |
c8094d83 | 1387 | |
fc6633e0 | 1388 | if (parent_primary |
539ed333 NS |
1389 | && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo), |
1390 | BINFO_TYPE (parent_primary))) | |
fc6633e0 NS |
1391 | /* We are the primary binfo. */ |
1392 | BINFO_PRIMARY_P (base_binfo) = 1; | |
1393 | } | |
1394 | /* Determine if we have a virtual primary base, and mark it so. | |
1395 | */ | |
1396 | if (primary && BINFO_VIRTUAL_P (primary)) | |
1397 | { | |
1398 | tree this_primary = copied_binfo (primary, base_binfo); | |
1399 | ||
1400 | if (BINFO_PRIMARY_P (this_primary)) | |
1401 | /* Someone already claimed this base. */ | |
1402 | BINFO_LOST_PRIMARY_P (base_binfo) = 1; | |
1403 | else | |
dbbf88d1 | 1404 | { |
fc6633e0 | 1405 | tree delta; |
c8094d83 | 1406 | |
fc6633e0 NS |
1407 | BINFO_PRIMARY_P (this_primary) = 1; |
1408 | BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo; | |
c8094d83 | 1409 | |
fc6633e0 | 1410 | /* A virtual binfo might have been copied from within |
0cbd7506 MS |
1411 | another hierarchy. As we're about to use it as a |
1412 | primary base, make sure the offsets match. */ | |
db3927fb AH |
1413 | delta = size_diffop_loc (input_location, |
1414 | convert (ssizetype, | |
fc6633e0 NS |
1415 | BINFO_OFFSET (base_binfo)), |
1416 | convert (ssizetype, | |
1417 | BINFO_OFFSET (this_primary))); | |
c8094d83 | 1418 | |
fc6633e0 | 1419 | propagate_binfo_offsets (this_primary, delta); |
dbbf88d1 NS |
1420 | } |
1421 | } | |
c35cce41 | 1422 | } |
8026246f | 1423 | |
fc6633e0 | 1424 | /* First look for a dynamic direct non-virtual base. */ |
fa743e8c | 1425 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++) |
607cf131 | 1426 | { |
607cf131 | 1427 | tree basetype = BINFO_TYPE (base_binfo); |
aff08c18 | 1428 | |
fc6633e0 | 1429 | if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo)) |
8d08fdba | 1430 | { |
fc6633e0 NS |
1431 | primary = base_binfo; |
1432 | goto found; | |
911a71a7 MM |
1433 | } |
1434 | } | |
8026246f | 1435 | |
3461fba7 | 1436 | /* A "nearly-empty" virtual base class can be the primary base |
fc6633e0 NS |
1437 | class, if no non-virtual polymorphic base can be found. Look for |
1438 | a nearly-empty virtual dynamic base that is not already a primary | |
77880ae4 | 1439 | base of something in the hierarchy. If there is no such base, |
fc6633e0 NS |
1440 | just pick the first nearly-empty virtual base. */ |
1441 | ||
1442 | for (base_binfo = TREE_CHAIN (type_binfo); base_binfo; | |
1443 | base_binfo = TREE_CHAIN (base_binfo)) | |
1444 | if (BINFO_VIRTUAL_P (base_binfo) | |
1445 | && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo))) | |
1446 | { | |
1447 | if (!BINFO_PRIMARY_P (base_binfo)) | |
1448 | { | |
1449 | /* Found one that is not primary. */ | |
1450 | primary = base_binfo; | |
1451 | goto found; | |
1452 | } | |
1453 | else if (!primary) | |
1454 | /* Remember the first candidate. */ | |
1455 | primary = base_binfo; | |
1456 | } | |
c8094d83 | 1457 | |
fc6633e0 NS |
1458 | found: |
1459 | /* If we've got a primary base, use it. */ | |
1460 | if (primary) | |
7cafdb8b | 1461 | { |
fc6633e0 | 1462 | tree basetype = BINFO_TYPE (primary); |
c8094d83 | 1463 | |
fc6633e0 NS |
1464 | CLASSTYPE_PRIMARY_BINFO (t) = primary; |
1465 | if (BINFO_PRIMARY_P (primary)) | |
1466 | /* We are stealing a primary base. */ | |
1467 | BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1; | |
1468 | BINFO_PRIMARY_P (primary) = 1; | |
1469 | if (BINFO_VIRTUAL_P (primary)) | |
7cafdb8b | 1470 | { |
fc6633e0 | 1471 | tree delta; |
7cafdb8b | 1472 | |
fc6633e0 NS |
1473 | BINFO_INHERITANCE_CHAIN (primary) = type_binfo; |
1474 | /* A virtual binfo might have been copied from within | |
0cbd7506 MS |
1475 | another hierarchy. As we're about to use it as a primary |
1476 | base, make sure the offsets match. */ | |
db3927fb | 1477 | delta = size_diffop_loc (input_location, ssize_int (0), |
fc6633e0 | 1478 | convert (ssizetype, BINFO_OFFSET (primary))); |
c8094d83 | 1479 | |
fc6633e0 | 1480 | propagate_binfo_offsets (primary, delta); |
7cafdb8b | 1481 | } |
c8094d83 | 1482 | |
fc6633e0 | 1483 | primary = TYPE_BINFO (basetype); |
c8094d83 | 1484 | |
fc6633e0 NS |
1485 | TYPE_VFIELD (t) = TYPE_VFIELD (basetype); |
1486 | BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary); | |
1487 | BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary); | |
7cafdb8b | 1488 | } |
8d08fdba | 1489 | } |
e92cc029 | 1490 | |
d0940d56 DS |
1491 | /* Update the variant types of T. */ |
1492 | ||
1493 | void | |
1494 | fixup_type_variants (tree t) | |
8d08fdba | 1495 | { |
090ad434 | 1496 | tree variants; |
c8094d83 | 1497 | |
d0940d56 DS |
1498 | if (!t) |
1499 | return; | |
1500 | ||
090ad434 NS |
1501 | for (variants = TYPE_NEXT_VARIANT (t); |
1502 | variants; | |
1503 | variants = TYPE_NEXT_VARIANT (variants)) | |
8d08fdba MS |
1504 | { |
1505 | /* These fields are in the _TYPE part of the node, not in | |
1506 | the TYPE_LANG_SPECIFIC component, so they are not shared. */ | |
0fcedd9c | 1507 | TYPE_HAS_USER_CONSTRUCTOR (variants) = TYPE_HAS_USER_CONSTRUCTOR (t); |
8d08fdba | 1508 | TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t); |
c8094d83 | 1509 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants) |
834c6dff | 1510 | = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
8d08fdba | 1511 | |
4c6b7393 | 1512 | TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t); |
c8094d83 | 1513 | |
cad7e87b NS |
1514 | TYPE_BINFO (variants) = TYPE_BINFO (t); |
1515 | ||
8d08fdba | 1516 | /* Copy whatever these are holding today. */ |
eb34af89 RK |
1517 | TYPE_VFIELD (variants) = TYPE_VFIELD (t); |
1518 | TYPE_METHODS (variants) = TYPE_METHODS (t); | |
5566b478 | 1519 | TYPE_FIELDS (variants) = TYPE_FIELDS (t); |
8943989d JM |
1520 | } |
1521 | } | |
1522 | ||
1523 | /* Early variant fixups: we apply attributes at the beginning of the class | |
1524 | definition, and we need to fix up any variants that have already been | |
1525 | made via elaborated-type-specifier so that check_qualified_type works. */ | |
1526 | ||
1527 | void | |
1528 | fixup_attribute_variants (tree t) | |
1529 | { | |
1530 | tree variants; | |
5818c8e4 | 1531 | |
8943989d JM |
1532 | if (!t) |
1533 | return; | |
1534 | ||
1535 | for (variants = TYPE_NEXT_VARIANT (t); | |
1536 | variants; | |
1537 | variants = TYPE_NEXT_VARIANT (variants)) | |
1538 | { | |
1539 | /* These are the two fields that check_qualified_type looks at and | |
1540 | are affected by attributes. */ | |
5818c8e4 | 1541 | TYPE_ATTRIBUTES (variants) = TYPE_ATTRIBUTES (t); |
8943989d | 1542 | TYPE_ALIGN (variants) = TYPE_ALIGN (t); |
8d08fdba | 1543 | } |
d0940d56 | 1544 | } |
d0940d56 DS |
1545 | \f |
1546 | /* Set memoizing fields and bits of T (and its variants) for later | |
1547 | use. */ | |
1548 | ||
1549 | static void | |
1550 | finish_struct_bits (tree t) | |
1551 | { | |
1552 | /* Fix up variants (if any). */ | |
1553 | fixup_type_variants (t); | |
8d08fdba | 1554 | |
fa743e8c | 1555 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t)) |
16ae29f1 NS |
1556 | /* For a class w/o baseclasses, 'finish_struct' has set |
1557 | CLASSTYPE_PURE_VIRTUALS correctly (by definition). | |
132c7dd3 NS |
1558 | Similarly for a class whose base classes do not have vtables. |
1559 | When neither of these is true, we might have removed abstract | |
1560 | virtuals (by providing a definition), added some (by declaring | |
1561 | new ones), or redeclared ones from a base class. We need to | |
1562 | recalculate what's really an abstract virtual at this point (by | |
1563 | looking in the vtables). */ | |
1564 | get_pure_virtuals (t); | |
c8094d83 | 1565 | |
132c7dd3 NS |
1566 | /* If this type has a copy constructor or a destructor, force its |
1567 | mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be | |
1568 | nonzero. This will cause it to be passed by invisible reference | |
1569 | and prevent it from being returned in a register. */ | |
d758e847 JM |
1570 | if (type_has_nontrivial_copy_init (t) |
1571 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
8d08fdba | 1572 | { |
e8abc66f | 1573 | tree variants; |
d2e5ee5c | 1574 | DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode; |
e8abc66f | 1575 | for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants)) |
8d08fdba | 1576 | { |
179d2f74 | 1577 | SET_TYPE_MODE (variants, BLKmode); |
8d08fdba | 1578 | TREE_ADDRESSABLE (variants) = 1; |
8d08fdba MS |
1579 | } |
1580 | } | |
1581 | } | |
1582 | ||
b0e0b31f | 1583 | /* Issue warnings about T having private constructors, but no friends, |
c8094d83 | 1584 | and so forth. |
aed7b2a6 | 1585 | |
b0e0b31f MM |
1586 | HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or |
1587 | static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any | |
1588 | non-private static member functions. */ | |
1589 | ||
1590 | static void | |
94edc4ab | 1591 | maybe_warn_about_overly_private_class (tree t) |
aed7b2a6 | 1592 | { |
056a3b12 MM |
1593 | int has_member_fn = 0; |
1594 | int has_nonprivate_method = 0; | |
1595 | tree fn; | |
1596 | ||
1597 | if (!warn_ctor_dtor_privacy | |
b0e0b31f MM |
1598 | /* If the class has friends, those entities might create and |
1599 | access instances, so we should not warn. */ | |
056a3b12 MM |
1600 | || (CLASSTYPE_FRIEND_CLASSES (t) |
1601 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))) | |
b0e0b31f MM |
1602 | /* We will have warned when the template was declared; there's |
1603 | no need to warn on every instantiation. */ | |
056a3b12 | 1604 | || CLASSTYPE_TEMPLATE_INSTANTIATION (t)) |
c8094d83 | 1605 | /* There's no reason to even consider warning about this |
056a3b12 MM |
1606 | class. */ |
1607 | return; | |
c8094d83 | 1608 | |
056a3b12 MM |
1609 | /* We only issue one warning, if more than one applies, because |
1610 | otherwise, on code like: | |
1611 | ||
1612 | class A { | |
1613 | // Oops - forgot `public:' | |
1614 | A(); | |
1615 | A(const A&); | |
1616 | ~A(); | |
1617 | }; | |
1618 | ||
1619 | we warn several times about essentially the same problem. */ | |
1620 | ||
1621 | /* Check to see if all (non-constructor, non-destructor) member | |
1622 | functions are private. (Since there are no friends or | |
1623 | non-private statics, we can't ever call any of the private member | |
1624 | functions.) */ | |
910ad8de | 1625 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
056a3b12 MM |
1626 | /* We're not interested in compiler-generated methods; they don't |
1627 | provide any way to call private members. */ | |
c8094d83 | 1628 | if (!DECL_ARTIFICIAL (fn)) |
056a3b12 MM |
1629 | { |
1630 | if (!TREE_PRIVATE (fn)) | |
b0e0b31f | 1631 | { |
c8094d83 | 1632 | if (DECL_STATIC_FUNCTION_P (fn)) |
056a3b12 MM |
1633 | /* A non-private static member function is just like a |
1634 | friend; it can create and invoke private member | |
1635 | functions, and be accessed without a class | |
1636 | instance. */ | |
1637 | return; | |
c8094d83 | 1638 | |
056a3b12 | 1639 | has_nonprivate_method = 1; |
f576dfc4 | 1640 | /* Keep searching for a static member function. */ |
056a3b12 | 1641 | } |
ce0a5952 | 1642 | else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn)) |
056a3b12 | 1643 | has_member_fn = 1; |
c8094d83 | 1644 | } |
aed7b2a6 | 1645 | |
c8094d83 | 1646 | if (!has_nonprivate_method && has_member_fn) |
056a3b12 | 1647 | { |
ce0a5952 MM |
1648 | /* There are no non-private methods, and there's at least one |
1649 | private member function that isn't a constructor or | |
1650 | destructor. (If all the private members are | |
1651 | constructors/destructors we want to use the code below that | |
1652 | issues error messages specifically referring to | |
1653 | constructors/destructors.) */ | |
fa743e8c | 1654 | unsigned i; |
dbbf88d1 | 1655 | tree binfo = TYPE_BINFO (t); |
c8094d83 | 1656 | |
fa743e8c | 1657 | for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++) |
604a3205 | 1658 | if (BINFO_BASE_ACCESS (binfo, i) != access_private_node) |
056a3b12 MM |
1659 | { |
1660 | has_nonprivate_method = 1; | |
1661 | break; | |
1662 | } | |
c8094d83 | 1663 | if (!has_nonprivate_method) |
b0e0b31f | 1664 | { |
74fa0285 | 1665 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1666 | "all member functions in class %qT are private", t); |
056a3b12 | 1667 | return; |
b0e0b31f | 1668 | } |
056a3b12 | 1669 | } |
aed7b2a6 | 1670 | |
056a3b12 MM |
1671 | /* Even if some of the member functions are non-private, the class |
1672 | won't be useful for much if all the constructors or destructors | |
1673 | are private: such an object can never be created or destroyed. */ | |
9f4faeae MM |
1674 | fn = CLASSTYPE_DESTRUCTORS (t); |
1675 | if (fn && TREE_PRIVATE (fn)) | |
056a3b12 | 1676 | { |
74fa0285 | 1677 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1678 | "%q#T only defines a private destructor and has no friends", |
4b0d3cbe MM |
1679 | t); |
1680 | return; | |
056a3b12 | 1681 | } |
b0e0b31f | 1682 | |
0fcedd9c JM |
1683 | /* Warn about classes that have private constructors and no friends. */ |
1684 | if (TYPE_HAS_USER_CONSTRUCTOR (t) | |
550d1bf4 MM |
1685 | /* Implicitly generated constructors are always public. */ |
1686 | && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t) | |
1687 | || !CLASSTYPE_LAZY_COPY_CTOR (t))) | |
056a3b12 MM |
1688 | { |
1689 | int nonprivate_ctor = 0; | |
c8094d83 | 1690 | |
056a3b12 MM |
1691 | /* If a non-template class does not define a copy |
1692 | constructor, one is defined for it, enabling it to avoid | |
1693 | this warning. For a template class, this does not | |
1694 | happen, and so we would normally get a warning on: | |
b0e0b31f | 1695 | |
c8094d83 MS |
1696 | template <class T> class C { private: C(); }; |
1697 | ||
066ec0a4 | 1698 | To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All |
056a3b12 MM |
1699 | complete non-template or fully instantiated classes have this |
1700 | flag set. */ | |
066ec0a4 | 1701 | if (!TYPE_HAS_COPY_CTOR (t)) |
056a3b12 | 1702 | nonprivate_ctor = 1; |
c8094d83 MS |
1703 | else |
1704 | for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn)) | |
056a3b12 MM |
1705 | { |
1706 | tree ctor = OVL_CURRENT (fn); | |
1707 | /* Ideally, we wouldn't count copy constructors (or, in | |
1708 | fact, any constructor that takes an argument of the | |
1709 | class type as a parameter) because such things cannot | |
1710 | be used to construct an instance of the class unless | |
1711 | you already have one. But, for now at least, we're | |
1712 | more generous. */ | |
1713 | if (! TREE_PRIVATE (ctor)) | |
b0e0b31f | 1714 | { |
056a3b12 MM |
1715 | nonprivate_ctor = 1; |
1716 | break; | |
b0e0b31f | 1717 | } |
056a3b12 | 1718 | } |
aed7b2a6 | 1719 | |
056a3b12 MM |
1720 | if (nonprivate_ctor == 0) |
1721 | { | |
74fa0285 | 1722 | warning (OPT_Wctor_dtor_privacy, |
3db45ab5 | 1723 | "%q#T only defines private constructors and has no friends", |
0cbd7506 | 1724 | t); |
056a3b12 | 1725 | return; |
b0e0b31f MM |
1726 | } |
1727 | } | |
aed7b2a6 MM |
1728 | } |
1729 | ||
17211ab5 GK |
1730 | static struct { |
1731 | gt_pointer_operator new_value; | |
1732 | void *cookie; | |
1733 | } resort_data; | |
1734 | ||
f90cdf34 MT |
1735 | /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */ |
1736 | ||
1737 | static int | |
94edc4ab | 1738 | method_name_cmp (const void* m1_p, const void* m2_p) |
f90cdf34 | 1739 | { |
67f5655f GDR |
1740 | const tree *const m1 = (const tree *) m1_p; |
1741 | const tree *const m2 = (const tree *) m2_p; | |
c8094d83 | 1742 | |
f90cdf34 MT |
1743 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
1744 | return 0; | |
1745 | if (*m1 == NULL_TREE) | |
1746 | return -1; | |
1747 | if (*m2 == NULL_TREE) | |
1748 | return 1; | |
1749 | if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2))) | |
1750 | return -1; | |
1751 | return 1; | |
1752 | } | |
b0e0b31f | 1753 | |
17211ab5 GK |
1754 | /* This routine compares two fields like method_name_cmp but using the |
1755 | pointer operator in resort_field_decl_data. */ | |
1756 | ||
1757 | static int | |
94edc4ab | 1758 | resort_method_name_cmp (const void* m1_p, const void* m2_p) |
17211ab5 | 1759 | { |
67f5655f GDR |
1760 | const tree *const m1 = (const tree *) m1_p; |
1761 | const tree *const m2 = (const tree *) m2_p; | |
17211ab5 GK |
1762 | if (*m1 == NULL_TREE && *m2 == NULL_TREE) |
1763 | return 0; | |
1764 | if (*m1 == NULL_TREE) | |
1765 | return -1; | |
1766 | if (*m2 == NULL_TREE) | |
1767 | return 1; | |
1768 | { | |
1769 | tree d1 = DECL_NAME (OVL_CURRENT (*m1)); | |
1770 | tree d2 = DECL_NAME (OVL_CURRENT (*m2)); | |
1771 | resort_data.new_value (&d1, resort_data.cookie); | |
1772 | resort_data.new_value (&d2, resort_data.cookie); | |
1773 | if (d1 < d2) | |
1774 | return -1; | |
1775 | } | |
1776 | return 1; | |
1777 | } | |
1778 | ||
1779 | /* Resort TYPE_METHOD_VEC because pointers have been reordered. */ | |
1780 | ||
c8094d83 | 1781 | void |
94edc4ab | 1782 | resort_type_method_vec (void* obj, |
0cbd7506 MS |
1783 | void* orig_obj ATTRIBUTE_UNUSED , |
1784 | gt_pointer_operator new_value, | |
1785 | void* cookie) | |
17211ab5 | 1786 | { |
d4e6fecb | 1787 | VEC(tree,gc) *method_vec = (VEC(tree,gc) *) obj; |
aaaa46d2 MM |
1788 | int len = VEC_length (tree, method_vec); |
1789 | size_t slot; | |
1790 | tree fn; | |
17211ab5 GK |
1791 | |
1792 | /* The type conversion ops have to live at the front of the vec, so we | |
1793 | can't sort them. */ | |
aaaa46d2 | 1794 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9ba5ff0f | 1795 | VEC_iterate (tree, method_vec, slot, fn); |
aaaa46d2 MM |
1796 | ++slot) |
1797 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn))) | |
1798 | break; | |
1799 | ||
17211ab5 GK |
1800 | if (len - slot > 1) |
1801 | { | |
1802 | resort_data.new_value = new_value; | |
1803 | resort_data.cookie = cookie; | |
aaaa46d2 | 1804 | qsort (VEC_address (tree, method_vec) + slot, len - slot, sizeof (tree), |
17211ab5 GK |
1805 | resort_method_name_cmp); |
1806 | } | |
1807 | } | |
1808 | ||
c7222c02 | 1809 | /* Warn about duplicate methods in fn_fields. |
8d08fdba | 1810 | |
5b0cec3b MM |
1811 | Sort methods that are not special (i.e., constructors, destructors, |
1812 | and type conversion operators) so that we can find them faster in | |
1813 | search. */ | |
8d08fdba | 1814 | |
b0e0b31f | 1815 | static void |
94edc4ab | 1816 | finish_struct_methods (tree t) |
8d08fdba | 1817 | { |
b0e0b31f | 1818 | tree fn_fields; |
d4e6fecb | 1819 | VEC(tree,gc) *method_vec; |
58010b57 MM |
1820 | int slot, len; |
1821 | ||
58010b57 | 1822 | method_vec = CLASSTYPE_METHOD_VEC (t); |
508a1c9c MM |
1823 | if (!method_vec) |
1824 | return; | |
1825 | ||
aaaa46d2 | 1826 | len = VEC_length (tree, method_vec); |
8d08fdba | 1827 | |
c7222c02 | 1828 | /* Clear DECL_IN_AGGR_P for all functions. */ |
c8094d83 | 1829 | for (fn_fields = TYPE_METHODS (t); fn_fields; |
910ad8de | 1830 | fn_fields = DECL_CHAIN (fn_fields)) |
5b0cec3b | 1831 | DECL_IN_AGGR_P (fn_fields) = 0; |
8d08fdba | 1832 | |
b0e0b31f MM |
1833 | /* Issue warnings about private constructors and such. If there are |
1834 | no methods, then some public defaults are generated. */ | |
f90cdf34 MT |
1835 | maybe_warn_about_overly_private_class (t); |
1836 | ||
f90cdf34 MT |
1837 | /* The type conversion ops have to live at the front of the vec, so we |
1838 | can't sort them. */ | |
9ba5ff0f NS |
1839 | for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT; |
1840 | VEC_iterate (tree, method_vec, slot, fn_fields); | |
aaaa46d2 MM |
1841 | ++slot) |
1842 | if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields))) | |
1843 | break; | |
f90cdf34 | 1844 | if (len - slot > 1) |
aaaa46d2 MM |
1845 | qsort (VEC_address (tree, method_vec) + slot, |
1846 | len-slot, sizeof (tree), method_name_cmp); | |
8d08fdba MS |
1847 | } |
1848 | ||
90ecce3e | 1849 | /* Make BINFO's vtable have N entries, including RTTI entries, |
3b426391 | 1850 | vbase and vcall offsets, etc. Set its type and call the back end |
8d7a5379 | 1851 | to lay it out. */ |
1a588ad7 MM |
1852 | |
1853 | static void | |
94edc4ab | 1854 | layout_vtable_decl (tree binfo, int n) |
1a588ad7 | 1855 | { |
1a588ad7 | 1856 | tree atype; |
c35cce41 | 1857 | tree vtable; |
1a588ad7 | 1858 | |
dcedcddb | 1859 | atype = build_array_of_n_type (vtable_entry_type, n); |
1a588ad7 MM |
1860 | layout_type (atype); |
1861 | ||
1862 | /* We may have to grow the vtable. */ | |
c35cce41 MM |
1863 | vtable = get_vtbl_decl_for_binfo (binfo); |
1864 | if (!same_type_p (TREE_TYPE (vtable), atype)) | |
1a588ad7 | 1865 | { |
06ceef4e | 1866 | TREE_TYPE (vtable) = atype; |
c35cce41 | 1867 | DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE; |
06ceef4e | 1868 | layout_decl (vtable, 0); |
1a588ad7 MM |
1869 | } |
1870 | } | |
1871 | ||
9bab6c90 MM |
1872 | /* True iff FNDECL and BASE_FNDECL (both non-static member functions) |
1873 | have the same signature. */ | |
83f2ccf4 | 1874 | |
e0fff4b3 | 1875 | int |
58f9752a | 1876 | same_signature_p (const_tree fndecl, const_tree base_fndecl) |
83f2ccf4 | 1877 | { |
872f37f9 MM |
1878 | /* One destructor overrides another if they are the same kind of |
1879 | destructor. */ | |
1880 | if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl) | |
1881 | && special_function_p (base_fndecl) == special_function_p (fndecl)) | |
ca36f057 | 1882 | return 1; |
872f37f9 MM |
1883 | /* But a non-destructor never overrides a destructor, nor vice |
1884 | versa, nor do different kinds of destructors override | |
1885 | one-another. For example, a complete object destructor does not | |
1886 | override a deleting destructor. */ | |
0d9eb3ba | 1887 | if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl)) |
ca36f057 | 1888 | return 0; |
872f37f9 | 1889 | |
a6c0d772 MM |
1890 | if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl) |
1891 | || (DECL_CONV_FN_P (fndecl) | |
1892 | && DECL_CONV_FN_P (base_fndecl) | |
1893 | && same_type_p (DECL_CONV_FN_TYPE (fndecl), | |
1894 | DECL_CONV_FN_TYPE (base_fndecl)))) | |
83f2ccf4 | 1895 | { |
ca36f057 | 1896 | tree types, base_types; |
ca36f057 MM |
1897 | types = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); |
1898 | base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl)); | |
a3360e77 JM |
1899 | if ((cp_type_quals (TREE_TYPE (TREE_VALUE (base_types))) |
1900 | == cp_type_quals (TREE_TYPE (TREE_VALUE (types)))) | |
ca36f057 MM |
1901 | && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types))) |
1902 | return 1; | |
83f2ccf4 | 1903 | } |
ca36f057 | 1904 | return 0; |
83f2ccf4 MM |
1905 | } |
1906 | ||
9368208b MM |
1907 | /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a |
1908 | subobject. */ | |
c8094d83 | 1909 | |
9368208b MM |
1910 | static bool |
1911 | base_derived_from (tree derived, tree base) | |
1912 | { | |
dbbf88d1 NS |
1913 | tree probe; |
1914 | ||
1915 | for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe)) | |
1916 | { | |
1917 | if (probe == derived) | |
1918 | return true; | |
809e3e7f | 1919 | else if (BINFO_VIRTUAL_P (probe)) |
dbbf88d1 NS |
1920 | /* If we meet a virtual base, we can't follow the inheritance |
1921 | any more. See if the complete type of DERIVED contains | |
1922 | such a virtual base. */ | |
58c42dc2 NS |
1923 | return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived)) |
1924 | != NULL_TREE); | |
dbbf88d1 NS |
1925 | } |
1926 | return false; | |
9368208b MM |
1927 | } |
1928 | ||
ca36f057 MM |
1929 | typedef struct find_final_overrider_data_s { |
1930 | /* The function for which we are trying to find a final overrider. */ | |
1931 | tree fn; | |
1932 | /* The base class in which the function was declared. */ | |
1933 | tree declaring_base; | |
9368208b | 1934 | /* The candidate overriders. */ |
78b45a24 | 1935 | tree candidates; |
5d5a519f | 1936 | /* Path to most derived. */ |
d4e6fecb | 1937 | VEC(tree,heap) *path; |
ca36f057 | 1938 | } find_final_overrider_data; |
8d7a5379 | 1939 | |
f7a8132a MM |
1940 | /* Add the overrider along the current path to FFOD->CANDIDATES. |
1941 | Returns true if an overrider was found; false otherwise. */ | |
8d7a5379 | 1942 | |
f7a8132a | 1943 | static bool |
c8094d83 | 1944 | dfs_find_final_overrider_1 (tree binfo, |
5d5a519f NS |
1945 | find_final_overrider_data *ffod, |
1946 | unsigned depth) | |
7177d104 | 1947 | { |
741d8ca3 MM |
1948 | tree method; |
1949 | ||
f7a8132a MM |
1950 | /* If BINFO is not the most derived type, try a more derived class. |
1951 | A definition there will overrider a definition here. */ | |
5d5a519f | 1952 | if (depth) |
dbbf88d1 | 1953 | { |
5d5a519f NS |
1954 | depth--; |
1955 | if (dfs_find_final_overrider_1 | |
1956 | (VEC_index (tree, ffod->path, depth), ffod, depth)) | |
f7a8132a MM |
1957 | return true; |
1958 | } | |
dbbf88d1 | 1959 | |
741d8ca3 | 1960 | method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn); |
f7a8132a MM |
1961 | if (method) |
1962 | { | |
1963 | tree *candidate = &ffod->candidates; | |
c8094d83 | 1964 | |
f7a8132a MM |
1965 | /* Remove any candidates overridden by this new function. */ |
1966 | while (*candidate) | |
8d7a5379 | 1967 | { |
f7a8132a MM |
1968 | /* If *CANDIDATE overrides METHOD, then METHOD |
1969 | cannot override anything else on the list. */ | |
1970 | if (base_derived_from (TREE_VALUE (*candidate), binfo)) | |
1971 | return true; | |
1972 | /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */ | |
1973 | if (base_derived_from (binfo, TREE_VALUE (*candidate))) | |
1974 | *candidate = TREE_CHAIN (*candidate); | |
dbbf88d1 | 1975 | else |
f7a8132a | 1976 | candidate = &TREE_CHAIN (*candidate); |
5e19c053 | 1977 | } |
c8094d83 | 1978 | |
f7a8132a MM |
1979 | /* Add the new function. */ |
1980 | ffod->candidates = tree_cons (method, binfo, ffod->candidates); | |
1981 | return true; | |
dbbf88d1 | 1982 | } |
5e19c053 | 1983 | |
f7a8132a MM |
1984 | return false; |
1985 | } | |
1986 | ||
1987 | /* Called from find_final_overrider via dfs_walk. */ | |
1988 | ||
1989 | static tree | |
5d5a519f | 1990 | dfs_find_final_overrider_pre (tree binfo, void *data) |
f7a8132a MM |
1991 | { |
1992 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; | |
1993 | ||
1994 | if (binfo == ffod->declaring_base) | |
5d5a519f | 1995 | dfs_find_final_overrider_1 (binfo, ffod, VEC_length (tree, ffod->path)); |
d4e6fecb | 1996 | VEC_safe_push (tree, heap, ffod->path, binfo); |
f7a8132a | 1997 | |
dbbf88d1 NS |
1998 | return NULL_TREE; |
1999 | } | |
db3d8cde | 2000 | |
dbbf88d1 | 2001 | static tree |
5d5a519f | 2002 | dfs_find_final_overrider_post (tree binfo ATTRIBUTE_UNUSED, void *data) |
dbbf88d1 | 2003 | { |
dbbf88d1 | 2004 | find_final_overrider_data *ffod = (find_final_overrider_data *) data; |
5d5a519f | 2005 | VEC_pop (tree, ffod->path); |
78b45a24 | 2006 | |
dd42e135 MM |
2007 | return NULL_TREE; |
2008 | } | |
2009 | ||
5e19c053 MM |
2010 | /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for |
2011 | FN and whose TREE_VALUE is the binfo for the base where the | |
95675950 MM |
2012 | overriding occurs. BINFO (in the hierarchy dominated by the binfo |
2013 | DERIVED) is the base object in which FN is declared. */ | |
e92cc029 | 2014 | |
a292b002 | 2015 | static tree |
94edc4ab | 2016 | find_final_overrider (tree derived, tree binfo, tree fn) |
a292b002 | 2017 | { |
5e19c053 | 2018 | find_final_overrider_data ffod; |
a292b002 | 2019 | |
0e339752 | 2020 | /* Getting this right is a little tricky. This is valid: |
a292b002 | 2021 | |
5e19c053 MM |
2022 | struct S { virtual void f (); }; |
2023 | struct T { virtual void f (); }; | |
2024 | struct U : public S, public T { }; | |
a292b002 | 2025 | |
c8094d83 | 2026 | even though calling `f' in `U' is ambiguous. But, |
a292b002 | 2027 | |
5e19c053 MM |
2028 | struct R { virtual void f(); }; |
2029 | struct S : virtual public R { virtual void f (); }; | |
2030 | struct T : virtual public R { virtual void f (); }; | |
2031 | struct U : public S, public T { }; | |
dd42e135 | 2032 | |
d0cd8b44 | 2033 | is not -- there's no way to decide whether to put `S::f' or |
c8094d83 MS |
2034 | `T::f' in the vtable for `R'. |
2035 | ||
5e19c053 MM |
2036 | The solution is to look at all paths to BINFO. If we find |
2037 | different overriders along any two, then there is a problem. */ | |
07fa4878 NS |
2038 | if (DECL_THUNK_P (fn)) |
2039 | fn = THUNK_TARGET (fn); | |
f7a8132a MM |
2040 | |
2041 | /* Determine the depth of the hierarchy. */ | |
5e19c053 MM |
2042 | ffod.fn = fn; |
2043 | ffod.declaring_base = binfo; | |
78b45a24 | 2044 | ffod.candidates = NULL_TREE; |
d4e6fecb | 2045 | ffod.path = VEC_alloc (tree, heap, 30); |
5e19c053 | 2046 | |
5d5a519f NS |
2047 | dfs_walk_all (derived, dfs_find_final_overrider_pre, |
2048 | dfs_find_final_overrider_post, &ffod); | |
f7a8132a | 2049 | |
d4e6fecb | 2050 | VEC_free (tree, heap, ffod.path); |
c8094d83 | 2051 | |
78b45a24 | 2052 | /* If there was no winner, issue an error message. */ |
9368208b | 2053 | if (!ffod.candidates || TREE_CHAIN (ffod.candidates)) |
16a1369e | 2054 | return error_mark_node; |
dd42e135 | 2055 | |
9368208b | 2056 | return ffod.candidates; |
a292b002 MS |
2057 | } |
2058 | ||
548502d3 MM |
2059 | /* Return the index of the vcall offset for FN when TYPE is used as a |
2060 | virtual base. */ | |
d0cd8b44 | 2061 | |
d0cd8b44 | 2062 | static tree |
548502d3 | 2063 | get_vcall_index (tree fn, tree type) |
d0cd8b44 | 2064 | { |
d4e6fecb | 2065 | VEC(tree_pair_s,gc) *indices = CLASSTYPE_VCALL_INDICES (type); |
0871761b NS |
2066 | tree_pair_p p; |
2067 | unsigned ix; | |
d0cd8b44 | 2068 | |
ac47786e | 2069 | FOR_EACH_VEC_ELT (tree_pair_s, indices, ix, p) |
0871761b NS |
2070 | if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose)) |
2071 | || same_signature_p (fn, p->purpose)) | |
2072 | return p->value; | |
548502d3 MM |
2073 | |
2074 | /* There should always be an appropriate index. */ | |
8dc2b103 | 2075 | gcc_unreachable (); |
d0cd8b44 | 2076 | } |
d0cd8b44 JM |
2077 | |
2078 | /* Update an entry in the vtable for BINFO, which is in the hierarchy | |
bf1cb49e JM |
2079 | dominated by T. FN is the old function; VIRTUALS points to the |
2080 | corresponding position in the new BINFO_VIRTUALS list. IX is the index | |
2081 | of that entry in the list. */ | |
4e7512c9 MM |
2082 | |
2083 | static void | |
a2ddc397 NS |
2084 | update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals, |
2085 | unsigned ix) | |
4e7512c9 MM |
2086 | { |
2087 | tree b; | |
2088 | tree overrider; | |
4e7512c9 | 2089 | tree delta; |
31f8e4f3 | 2090 | tree virtual_base; |
d0cd8b44 | 2091 | tree first_defn; |
3cfabe60 NS |
2092 | tree overrider_fn, overrider_target; |
2093 | tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn; | |
2094 | tree over_return, base_return; | |
f11ee281 | 2095 | bool lost = false; |
4e7512c9 | 2096 | |
d0cd8b44 JM |
2097 | /* Find the nearest primary base (possibly binfo itself) which defines |
2098 | this function; this is the class the caller will convert to when | |
2099 | calling FN through BINFO. */ | |
2100 | for (b = binfo; ; b = get_primary_binfo (b)) | |
4e7512c9 | 2101 | { |
50bc768d | 2102 | gcc_assert (b); |
3cfabe60 | 2103 | if (look_for_overrides_here (BINFO_TYPE (b), target_fn)) |
31f8e4f3 | 2104 | break; |
f11ee281 JM |
2105 | |
2106 | /* The nearest definition is from a lost primary. */ | |
2107 | if (BINFO_LOST_PRIMARY_P (b)) | |
2108 | lost = true; | |
4e7512c9 | 2109 | } |
d0cd8b44 | 2110 | first_defn = b; |
4e7512c9 | 2111 | |
31f8e4f3 | 2112 | /* Find the final overrider. */ |
3cfabe60 | 2113 | overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn); |
4e7512c9 | 2114 | if (overrider == error_mark_node) |
16a1369e JJ |
2115 | { |
2116 | error ("no unique final overrider for %qD in %qT", target_fn, t); | |
2117 | return; | |
2118 | } | |
3cfabe60 | 2119 | overrider_target = overrider_fn = TREE_PURPOSE (overrider); |
c8094d83 | 2120 | |
9bcb9aae | 2121 | /* Check for adjusting covariant return types. */ |
3cfabe60 NS |
2122 | over_return = TREE_TYPE (TREE_TYPE (overrider_target)); |
2123 | base_return = TREE_TYPE (TREE_TYPE (target_fn)); | |
c8094d83 | 2124 | |
3cfabe60 NS |
2125 | if (POINTER_TYPE_P (over_return) |
2126 | && TREE_CODE (over_return) == TREE_CODE (base_return) | |
2127 | && CLASS_TYPE_P (TREE_TYPE (over_return)) | |
b77fe7b4 NS |
2128 | && CLASS_TYPE_P (TREE_TYPE (base_return)) |
2129 | /* If the overrider is invalid, don't even try. */ | |
2130 | && !DECL_INVALID_OVERRIDER_P (overrider_target)) | |
3cfabe60 NS |
2131 | { |
2132 | /* If FN is a covariant thunk, we must figure out the adjustment | |
0cbd7506 MS |
2133 | to the final base FN was converting to. As OVERRIDER_TARGET might |
2134 | also be converting to the return type of FN, we have to | |
2135 | combine the two conversions here. */ | |
3cfabe60 | 2136 | tree fixed_offset, virtual_offset; |
12a669d1 NS |
2137 | |
2138 | over_return = TREE_TYPE (over_return); | |
2139 | base_return = TREE_TYPE (base_return); | |
c8094d83 | 2140 | |
3cfabe60 NS |
2141 | if (DECL_THUNK_P (fn)) |
2142 | { | |
50bc768d | 2143 | gcc_assert (DECL_RESULT_THUNK_P (fn)); |
3cfabe60 NS |
2144 | fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn)); |
2145 | virtual_offset = THUNK_VIRTUAL_OFFSET (fn); | |
3cfabe60 NS |
2146 | } |
2147 | else | |
2148 | fixed_offset = virtual_offset = NULL_TREE; | |
4977bab6 | 2149 | |
e00853fd NS |
2150 | if (virtual_offset) |
2151 | /* Find the equivalent binfo within the return type of the | |
2152 | overriding function. We will want the vbase offset from | |
2153 | there. */ | |
58c42dc2 | 2154 | virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset), |
12a669d1 NS |
2155 | over_return); |
2156 | else if (!same_type_ignoring_top_level_qualifiers_p | |
2157 | (over_return, base_return)) | |
3cfabe60 NS |
2158 | { |
2159 | /* There was no existing virtual thunk (which takes | |
12a669d1 NS |
2160 | precedence). So find the binfo of the base function's |
2161 | return type within the overriding function's return type. | |
2162 | We cannot call lookup base here, because we're inside a | |
2163 | dfs_walk, and will therefore clobber the BINFO_MARKED | |
2164 | flags. Fortunately we know the covariancy is valid (it | |
2165 | has already been checked), so we can just iterate along | |
2166 | the binfos, which have been chained in inheritance graph | |
2167 | order. Of course it is lame that we have to repeat the | |
2168 | search here anyway -- we should really be caching pieces | |
2169 | of the vtable and avoiding this repeated work. */ | |
2170 | tree thunk_binfo, base_binfo; | |
2171 | ||
2172 | /* Find the base binfo within the overriding function's | |
742f25b3 NS |
2173 | return type. We will always find a thunk_binfo, except |
2174 | when the covariancy is invalid (which we will have | |
2175 | already diagnosed). */ | |
12a669d1 NS |
2176 | for (base_binfo = TYPE_BINFO (base_return), |
2177 | thunk_binfo = TYPE_BINFO (over_return); | |
742f25b3 | 2178 | thunk_binfo; |
12a669d1 | 2179 | thunk_binfo = TREE_CHAIN (thunk_binfo)) |
742f25b3 NS |
2180 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo), |
2181 | BINFO_TYPE (base_binfo))) | |
2182 | break; | |
c8094d83 | 2183 | |
12a669d1 NS |
2184 | /* See if virtual inheritance is involved. */ |
2185 | for (virtual_offset = thunk_binfo; | |
2186 | virtual_offset; | |
2187 | virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset)) | |
2188 | if (BINFO_VIRTUAL_P (virtual_offset)) | |
2189 | break; | |
c8094d83 | 2190 | |
742f25b3 NS |
2191 | if (virtual_offset |
2192 | || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo))) | |
3cfabe60 | 2193 | { |
bb885938 | 2194 | tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo)); |
8d1f0f67 | 2195 | |
12a669d1 | 2196 | if (virtual_offset) |
3cfabe60 | 2197 | { |
12a669d1 NS |
2198 | /* We convert via virtual base. Adjust the fixed |
2199 | offset to be from there. */ | |
db3927fb AH |
2200 | offset = |
2201 | size_diffop (offset, | |
2202 | convert (ssizetype, | |
2203 | BINFO_OFFSET (virtual_offset))); | |
3cfabe60 NS |
2204 | } |
2205 | if (fixed_offset) | |
2206 | /* There was an existing fixed offset, this must be | |
2207 | from the base just converted to, and the base the | |
2208 | FN was thunking to. */ | |
2209 | fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset); | |
2210 | else | |
2211 | fixed_offset = offset; | |
2212 | } | |
2213 | } | |
c8094d83 | 2214 | |
3cfabe60 NS |
2215 | if (fixed_offset || virtual_offset) |
2216 | /* Replace the overriding function with a covariant thunk. We | |
2217 | will emit the overriding function in its own slot as | |
9bcb9aae | 2218 | well. */ |
3cfabe60 NS |
2219 | overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0, |
2220 | fixed_offset, virtual_offset); | |
2221 | } | |
2222 | else | |
49fedf5a SM |
2223 | gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) || |
2224 | !DECL_THUNK_P (fn)); | |
c8094d83 | 2225 | |
02dea3ff JM |
2226 | /* If we need a covariant thunk, then we may need to adjust first_defn. |
2227 | The ABI specifies that the thunks emitted with a function are | |
2228 | determined by which bases the function overrides, so we need to be | |
2229 | sure that we're using a thunk for some overridden base; even if we | |
2230 | know that the necessary this adjustment is zero, there may not be an | |
2231 | appropriate zero-this-adjusment thunk for us to use since thunks for | |
2232 | overriding virtual bases always use the vcall offset. | |
2233 | ||
2234 | Furthermore, just choosing any base that overrides this function isn't | |
2235 | quite right, as this slot won't be used for calls through a type that | |
2236 | puts a covariant thunk here. Calling the function through such a type | |
2237 | will use a different slot, and that slot is the one that determines | |
2238 | the thunk emitted for that base. | |
2239 | ||
2240 | So, keep looking until we find the base that we're really overriding | |
2241 | in this slot: the nearest primary base that doesn't use a covariant | |
2242 | thunk in this slot. */ | |
2243 | if (overrider_target != overrider_fn) | |
2244 | { | |
2245 | if (BINFO_TYPE (b) == DECL_CONTEXT (overrider_target)) | |
2246 | /* We already know that the overrider needs a covariant thunk. */ | |
2247 | b = get_primary_binfo (b); | |
2248 | for (; ; b = get_primary_binfo (b)) | |
2249 | { | |
2250 | tree main_binfo = TYPE_BINFO (BINFO_TYPE (b)); | |
2251 | tree bv = chain_index (ix, BINFO_VIRTUALS (main_binfo)); | |
02dea3ff JM |
2252 | if (!DECL_THUNK_P (TREE_VALUE (bv))) |
2253 | break; | |
2c1fb3ee JM |
2254 | if (BINFO_LOST_PRIMARY_P (b)) |
2255 | lost = true; | |
02dea3ff JM |
2256 | } |
2257 | first_defn = b; | |
2258 | } | |
2259 | ||
31f8e4f3 MM |
2260 | /* Assume that we will produce a thunk that convert all the way to |
2261 | the final overrider, and not to an intermediate virtual base. */ | |
9ccf6541 | 2262 | virtual_base = NULL_TREE; |
31f8e4f3 | 2263 | |
f11ee281 | 2264 | /* See if we can convert to an intermediate virtual base first, and then |
3461fba7 | 2265 | use the vcall offset located there to finish the conversion. */ |
f11ee281 | 2266 | for (; b; b = BINFO_INHERITANCE_CHAIN (b)) |
4e7512c9 | 2267 | { |
d0cd8b44 JM |
2268 | /* If we find the final overrider, then we can stop |
2269 | walking. */ | |
539ed333 NS |
2270 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (b), |
2271 | BINFO_TYPE (TREE_VALUE (overrider)))) | |
1f84ec23 | 2272 | break; |
31f8e4f3 | 2273 | |
d0cd8b44 JM |
2274 | /* If we find a virtual base, and we haven't yet found the |
2275 | overrider, then there is a virtual base between the | |
2276 | declaring base (first_defn) and the final overrider. */ | |
809e3e7f | 2277 | if (BINFO_VIRTUAL_P (b)) |
dbbf88d1 NS |
2278 | { |
2279 | virtual_base = b; | |
2280 | break; | |
2281 | } | |
4e7512c9 | 2282 | } |
4e7512c9 | 2283 | |
d0cd8b44 JM |
2284 | /* Compute the constant adjustment to the `this' pointer. The |
2285 | `this' pointer, when this function is called, will point at BINFO | |
2286 | (or one of its primary bases, which are at the same offset). */ | |
31f8e4f3 | 2287 | if (virtual_base) |
20dde49d NS |
2288 | /* The `this' pointer needs to be adjusted from the declaration to |
2289 | the nearest virtual base. */ | |
db3927fb AH |
2290 | delta = size_diffop_loc (input_location, |
2291 | convert (ssizetype, BINFO_OFFSET (virtual_base)), | |
bb885938 | 2292 | convert (ssizetype, BINFO_OFFSET (first_defn))); |
f11ee281 JM |
2293 | else if (lost) |
2294 | /* If the nearest definition is in a lost primary, we don't need an | |
2295 | entry in our vtable. Except possibly in a constructor vtable, | |
2296 | if we happen to get our primary back. In that case, the offset | |
2297 | will be zero, as it will be a primary base. */ | |
2298 | delta = size_zero_node; | |
4e7512c9 | 2299 | else |
548502d3 MM |
2300 | /* The `this' pointer needs to be adjusted from pointing to |
2301 | BINFO to pointing at the base where the final overrider | |
2302 | appears. */ | |
db3927fb AH |
2303 | delta = size_diffop_loc (input_location, |
2304 | convert (ssizetype, | |
bb885938 NS |
2305 | BINFO_OFFSET (TREE_VALUE (overrider))), |
2306 | convert (ssizetype, BINFO_OFFSET (binfo))); | |
4e7512c9 | 2307 | |
3cfabe60 | 2308 | modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals); |
31f8e4f3 MM |
2309 | |
2310 | if (virtual_base) | |
c8094d83 | 2311 | BV_VCALL_INDEX (*virtuals) |
3cfabe60 | 2312 | = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base)); |
d1f05f93 NS |
2313 | else |
2314 | BV_VCALL_INDEX (*virtuals) = NULL_TREE; | |
02dea3ff | 2315 | |
8434c305 | 2316 | BV_LOST_PRIMARY (*virtuals) = lost; |
4e7512c9 MM |
2317 | } |
2318 | ||
8026246f | 2319 | /* Called from modify_all_vtables via dfs_walk. */ |
e92cc029 | 2320 | |
8026246f | 2321 | static tree |
94edc4ab | 2322 | dfs_modify_vtables (tree binfo, void* data) |
8026246f | 2323 | { |
bcb1079e | 2324 | tree t = (tree) data; |
5b94d9dd NS |
2325 | tree virtuals; |
2326 | tree old_virtuals; | |
2327 | unsigned ix; | |
2328 | ||
2329 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2330 | /* A base without a vtable needs no modification, and its bases | |
2331 | are uninteresting. */ | |
2332 | return dfs_skip_bases; | |
c8094d83 | 2333 | |
5b94d9dd NS |
2334 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t) |
2335 | && !CLASSTYPE_HAS_PRIMARY_BASE_P (t)) | |
2336 | /* Don't do the primary vtable, if it's new. */ | |
2337 | return NULL_TREE; | |
2338 | ||
2339 | if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo)) | |
2340 | /* There's no need to modify the vtable for a non-virtual primary | |
2341 | base; we're not going to use that vtable anyhow. We do still | |
2342 | need to do this for virtual primary bases, as they could become | |
2343 | non-primary in a construction vtable. */ | |
2344 | return NULL_TREE; | |
2345 | ||
2346 | make_new_vtable (t, binfo); | |
c8094d83 | 2347 | |
5b94d9dd NS |
2348 | /* Now, go through each of the virtual functions in the virtual |
2349 | function table for BINFO. Find the final overrider, and update | |
2350 | the BINFO_VIRTUALS list appropriately. */ | |
2351 | for (ix = 0, virtuals = BINFO_VIRTUALS (binfo), | |
2352 | old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
2353 | virtuals; | |
2354 | ix++, virtuals = TREE_CHAIN (virtuals), | |
2355 | old_virtuals = TREE_CHAIN (old_virtuals)) | |
c8094d83 MS |
2356 | update_vtable_entry_for_fn (t, |
2357 | binfo, | |
5b94d9dd NS |
2358 | BV_FN (old_virtuals), |
2359 | &virtuals, ix); | |
8026246f | 2360 | |
8026246f MM |
2361 | return NULL_TREE; |
2362 | } | |
2363 | ||
a68ad5bd MM |
2364 | /* Update all of the primary and secondary vtables for T. Create new |
2365 | vtables as required, and initialize their RTTI information. Each | |
e6858a84 NS |
2366 | of the functions in VIRTUALS is declared in T and may override a |
2367 | virtual function from a base class; find and modify the appropriate | |
2368 | entries to point to the overriding functions. Returns a list, in | |
2369 | declaration order, of the virtual functions that are declared in T, | |
2370 | but do not appear in the primary base class vtable, and which | |
2371 | should therefore be appended to the end of the vtable for T. */ | |
a68ad5bd MM |
2372 | |
2373 | static tree | |
94edc4ab | 2374 | modify_all_vtables (tree t, tree virtuals) |
8026246f | 2375 | { |
3461fba7 NS |
2376 | tree binfo = TYPE_BINFO (t); |
2377 | tree *fnsp; | |
a68ad5bd | 2378 | |
5e19c053 | 2379 | /* Update all of the vtables. */ |
5b94d9dd | 2380 | dfs_walk_once (binfo, dfs_modify_vtables, NULL, t); |
a68ad5bd | 2381 | |
e6858a84 NS |
2382 | /* Add virtual functions not already in our primary vtable. These |
2383 | will be both those introduced by this class, and those overridden | |
2384 | from secondary bases. It does not include virtuals merely | |
2385 | inherited from secondary bases. */ | |
2386 | for (fnsp = &virtuals; *fnsp; ) | |
a68ad5bd | 2387 | { |
3461fba7 | 2388 | tree fn = TREE_VALUE (*fnsp); |
a68ad5bd | 2389 | |
e6858a84 NS |
2390 | if (!value_member (fn, BINFO_VIRTUALS (binfo)) |
2391 | || DECL_VINDEX (fn) == error_mark_node) | |
a68ad5bd | 2392 | { |
3461fba7 NS |
2393 | /* We don't need to adjust the `this' pointer when |
2394 | calling this function. */ | |
2395 | BV_DELTA (*fnsp) = integer_zero_node; | |
2396 | BV_VCALL_INDEX (*fnsp) = NULL_TREE; | |
2397 | ||
e6858a84 | 2398 | /* This is a function not already in our vtable. Keep it. */ |
3461fba7 | 2399 | fnsp = &TREE_CHAIN (*fnsp); |
a68ad5bd | 2400 | } |
3461fba7 NS |
2401 | else |
2402 | /* We've already got an entry for this function. Skip it. */ | |
2403 | *fnsp = TREE_CHAIN (*fnsp); | |
a68ad5bd | 2404 | } |
e93ee644 | 2405 | |
e6858a84 | 2406 | return virtuals; |
7177d104 MS |
2407 | } |
2408 | ||
7d5b8b11 MM |
2409 | /* Get the base virtual function declarations in T that have the |
2410 | indicated NAME. */ | |
e92cc029 | 2411 | |
5ddc28a5 | 2412 | static tree |
94edc4ab | 2413 | get_basefndecls (tree name, tree t) |
9e9ff709 | 2414 | { |
7d5b8b11 | 2415 | tree methods; |
9e9ff709 | 2416 | tree base_fndecls = NULL_TREE; |
604a3205 | 2417 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
7d5b8b11 | 2418 | int i; |
9e9ff709 | 2419 | |
3d1df1fa MM |
2420 | /* Find virtual functions in T with the indicated NAME. */ |
2421 | i = lookup_fnfields_1 (t, name); | |
2422 | if (i != -1) | |
aaaa46d2 | 2423 | for (methods = VEC_index (tree, CLASSTYPE_METHOD_VEC (t), i); |
3d1df1fa MM |
2424 | methods; |
2425 | methods = OVL_NEXT (methods)) | |
2426 | { | |
2427 | tree method = OVL_CURRENT (methods); | |
2428 | ||
2429 | if (TREE_CODE (method) == FUNCTION_DECL | |
2430 | && DECL_VINDEX (method)) | |
2431 | base_fndecls = tree_cons (NULL_TREE, method, base_fndecls); | |
2432 | } | |
9e9ff709 MS |
2433 | |
2434 | if (base_fndecls) | |
2435 | return base_fndecls; | |
2436 | ||
2437 | for (i = 0; i < n_baseclasses; i++) | |
2438 | { | |
604a3205 | 2439 | tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i)); |
7d5b8b11 | 2440 | base_fndecls = chainon (get_basefndecls (name, basetype), |
9e9ff709 MS |
2441 | base_fndecls); |
2442 | } | |
2443 | ||
2444 | return base_fndecls; | |
2445 | } | |
2446 | ||
2ee887f2 MS |
2447 | /* If this declaration supersedes the declaration of |
2448 | a method declared virtual in the base class, then | |
2449 | mark this field as being virtual as well. */ | |
2450 | ||
9f4faeae | 2451 | void |
94edc4ab | 2452 | check_for_override (tree decl, tree ctype) |
2ee887f2 | 2453 | { |
7506ab1d | 2454 | bool overrides_found = false; |
cbb40945 NS |
2455 | if (TREE_CODE (decl) == TEMPLATE_DECL) |
2456 | /* In [temp.mem] we have: | |
2ee887f2 | 2457 | |
0cbd7506 MS |
2458 | A specialization of a member function template does not |
2459 | override a virtual function from a base class. */ | |
cbb40945 NS |
2460 | return; |
2461 | if ((DECL_DESTRUCTOR_P (decl) | |
a6c0d772 MM |
2462 | || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) |
2463 | || DECL_CONV_FN_P (decl)) | |
cbb40945 NS |
2464 | && look_for_overrides (ctype, decl) |
2465 | && !DECL_STATIC_FUNCTION_P (decl)) | |
e6858a84 NS |
2466 | /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor |
2467 | the error_mark_node so that we know it is an overriding | |
2468 | function. */ | |
7506ab1d VV |
2469 | { |
2470 | DECL_VINDEX (decl) = decl; | |
2471 | overrides_found = true; | |
2472 | } | |
e6858a84 | 2473 | |
cbb40945 | 2474 | if (DECL_VIRTUAL_P (decl)) |
2ee887f2 | 2475 | { |
e6858a84 | 2476 | if (!DECL_VINDEX (decl)) |
2ee887f2 MS |
2477 | DECL_VINDEX (decl) = error_mark_node; |
2478 | IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1; | |
5ade176d JM |
2479 | if (DECL_DESTRUCTOR_P (decl)) |
2480 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype) = true; | |
2ee887f2 | 2481 | } |
7506ab1d VV |
2482 | else if (DECL_FINAL_P (decl)) |
2483 | error ("%q+#D marked final, but is not virtual", decl); | |
2484 | if (DECL_OVERRIDE_P (decl) && !overrides_found) | |
2485 | error ("%q+#D marked override, but does not override", decl); | |
2ee887f2 MS |
2486 | } |
2487 | ||
fc378698 MS |
2488 | /* Warn about hidden virtual functions that are not overridden in t. |
2489 | We know that constructors and destructors don't apply. */ | |
e92cc029 | 2490 | |
b23e103b | 2491 | static void |
94edc4ab | 2492 | warn_hidden (tree t) |
9e9ff709 | 2493 | { |
d4e6fecb | 2494 | VEC(tree,gc) *method_vec = CLASSTYPE_METHOD_VEC (t); |
aaaa46d2 MM |
2495 | tree fns; |
2496 | size_t i; | |
9e9ff709 MS |
2497 | |
2498 | /* We go through each separately named virtual function. */ | |
c8094d83 | 2499 | for (i = CLASSTYPE_FIRST_CONVERSION_SLOT; |
9ba5ff0f | 2500 | VEC_iterate (tree, method_vec, i, fns); |
aaaa46d2 | 2501 | ++i) |
9e9ff709 | 2502 | { |
aaaa46d2 | 2503 | tree fn; |
7d5b8b11 MM |
2504 | tree name; |
2505 | tree fndecl; | |
2506 | tree base_fndecls; | |
fa743e8c NS |
2507 | tree base_binfo; |
2508 | tree binfo; | |
7d5b8b11 MM |
2509 | int j; |
2510 | ||
2511 | /* All functions in this slot in the CLASSTYPE_METHOD_VEC will | |
2512 | have the same name. Figure out what name that is. */ | |
aaaa46d2 | 2513 | name = DECL_NAME (OVL_CURRENT (fns)); |
7d5b8b11 MM |
2514 | /* There are no possibly hidden functions yet. */ |
2515 | base_fndecls = NULL_TREE; | |
2516 | /* Iterate through all of the base classes looking for possibly | |
2517 | hidden functions. */ | |
fa743e8c NS |
2518 | for (binfo = TYPE_BINFO (t), j = 0; |
2519 | BINFO_BASE_ITERATE (binfo, j, base_binfo); j++) | |
a4832853 | 2520 | { |
fa743e8c | 2521 | tree basetype = BINFO_TYPE (base_binfo); |
7d5b8b11 MM |
2522 | base_fndecls = chainon (get_basefndecls (name, basetype), |
2523 | base_fndecls); | |
a4832853 JM |
2524 | } |
2525 | ||
00a17e31 | 2526 | /* If there are no functions to hide, continue. */ |
7d5b8b11 | 2527 | if (!base_fndecls) |
9e9ff709 MS |
2528 | continue; |
2529 | ||
00a17e31 | 2530 | /* Remove any overridden functions. */ |
aaaa46d2 | 2531 | for (fn = fns; fn; fn = OVL_NEXT (fn)) |
9e9ff709 | 2532 | { |
aaaa46d2 | 2533 | fndecl = OVL_CURRENT (fn); |
7d5b8b11 MM |
2534 | if (DECL_VINDEX (fndecl)) |
2535 | { | |
2536 | tree *prev = &base_fndecls; | |
c8094d83 MS |
2537 | |
2538 | while (*prev) | |
7d5b8b11 MM |
2539 | /* If the method from the base class has the same |
2540 | signature as the method from the derived class, it | |
2541 | has been overridden. */ | |
2542 | if (same_signature_p (fndecl, TREE_VALUE (*prev))) | |
2543 | *prev = TREE_CHAIN (*prev); | |
2544 | else | |
2545 | prev = &TREE_CHAIN (*prev); | |
2546 | } | |
9e9ff709 MS |
2547 | } |
2548 | ||
9e9ff709 MS |
2549 | /* Now give a warning for all base functions without overriders, |
2550 | as they are hidden. */ | |
c8094d83 | 2551 | while (base_fndecls) |
7d5b8b11 MM |
2552 | { |
2553 | /* Here we know it is a hider, and no overrider exists. */ | |
286d12f9 MLI |
2554 | warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls)); |
2555 | warning (OPT_Woverloaded_virtual, " by %q+D", fns); | |
7d5b8b11 MM |
2556 | base_fndecls = TREE_CHAIN (base_fndecls); |
2557 | } | |
9e9ff709 MS |
2558 | } |
2559 | } | |
2560 | ||
2561 | /* Check for things that are invalid. There are probably plenty of other | |
2562 | things we should check for also. */ | |
e92cc029 | 2563 | |
9e9ff709 | 2564 | static void |
94edc4ab | 2565 | finish_struct_anon (tree t) |
9e9ff709 MS |
2566 | { |
2567 | tree field; | |
f90cdf34 | 2568 | |
910ad8de | 2569 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
9e9ff709 MS |
2570 | { |
2571 | if (TREE_STATIC (field)) | |
2572 | continue; | |
2573 | if (TREE_CODE (field) != FIELD_DECL) | |
2574 | continue; | |
2575 | ||
2576 | if (DECL_NAME (field) == NULL_TREE | |
6bdb8141 | 2577 | && ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
9e9ff709 | 2578 | { |
61fdc9d7 | 2579 | bool is_union = TREE_CODE (TREE_TYPE (field)) == UNION_TYPE; |
f90cdf34 | 2580 | tree elt = TYPE_FIELDS (TREE_TYPE (field)); |
910ad8de | 2581 | for (; elt; elt = DECL_CHAIN (elt)) |
9e9ff709 | 2582 | { |
b7076960 MM |
2583 | /* We're generally only interested in entities the user |
2584 | declared, but we also find nested classes by noticing | |
2585 | the TYPE_DECL that we create implicitly. You're | |
2586 | allowed to put one anonymous union inside another, | |
6f32162a JM |
2587 | though, so we explicitly tolerate that. We use |
2588 | TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that | |
2589 | we also allow unnamed types used for defining fields. */ | |
c8094d83 | 2590 | if (DECL_ARTIFICIAL (elt) |
b7076960 | 2591 | && (!DECL_IMPLICIT_TYPEDEF_P (elt) |
6f32162a | 2592 | || TYPE_ANONYMOUS_P (TREE_TYPE (elt)))) |
9e9ff709 MS |
2593 | continue; |
2594 | ||
f90cdf34 | 2595 | if (TREE_CODE (elt) != FIELD_DECL) |
8ebeee52 | 2596 | { |
61fdc9d7 | 2597 | if (is_union) |
cbe5f3b3 | 2598 | permerror (input_location, "%q+#D invalid; an anonymous union can " |
393eda6a | 2599 | "only have non-static data members", elt); |
61fdc9d7 | 2600 | else |
cbe5f3b3 | 2601 | permerror (input_location, "%q+#D invalid; an anonymous struct can " |
393eda6a | 2602 | "only have non-static data members", elt); |
8ebeee52 JM |
2603 | continue; |
2604 | } | |
2605 | ||
f90cdf34 | 2606 | if (TREE_PRIVATE (elt)) |
61fdc9d7 PC |
2607 | { |
2608 | if (is_union) | |
cbe5f3b3 | 2609 | permerror (input_location, "private member %q+#D in anonymous union", elt); |
61fdc9d7 | 2610 | else |
cbe5f3b3 | 2611 | permerror (input_location, "private member %q+#D in anonymous struct", elt); |
61fdc9d7 | 2612 | } |
f90cdf34 | 2613 | else if (TREE_PROTECTED (elt)) |
61fdc9d7 PC |
2614 | { |
2615 | if (is_union) | |
cbe5f3b3 | 2616 | permerror (input_location, "protected member %q+#D in anonymous union", elt); |
61fdc9d7 | 2617 | else |
cbe5f3b3 | 2618 | permerror (input_location, "protected member %q+#D in anonymous struct", elt); |
61fdc9d7 | 2619 | } |
fc378698 | 2620 | |
f90cdf34 MT |
2621 | TREE_PRIVATE (elt) = TREE_PRIVATE (field); |
2622 | TREE_PROTECTED (elt) = TREE_PROTECTED (field); | |
9e9ff709 MS |
2623 | } |
2624 | } | |
2625 | } | |
2626 | } | |
2627 | ||
7088fca9 KL |
2628 | /* Add T to CLASSTYPE_DECL_LIST of current_class_type which |
2629 | will be used later during class template instantiation. | |
2630 | When FRIEND_P is zero, T can be a static member data (VAR_DECL), | |
2631 | a non-static member data (FIELD_DECL), a member function | |
c8094d83 | 2632 | (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE), |
7088fca9 KL |
2633 | a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL) |
2634 | When FRIEND_P is nonzero, T is either a friend class | |
2635 | (RECORD_TYPE, TEMPLATE_DECL) or a friend function | |
2636 | (FUNCTION_DECL, TEMPLATE_DECL). */ | |
2637 | ||
2638 | void | |
94edc4ab | 2639 | maybe_add_class_template_decl_list (tree type, tree t, int friend_p) |
7088fca9 KL |
2640 | { |
2641 | /* Save some memory by not creating TREE_LIST if TYPE is not template. */ | |
2642 | if (CLASSTYPE_TEMPLATE_INFO (type)) | |
2643 | CLASSTYPE_DECL_LIST (type) | |
2644 | = tree_cons (friend_p ? NULL_TREE : type, | |
2645 | t, CLASSTYPE_DECL_LIST (type)); | |
2646 | } | |
2647 | ||
ca2409f9 DS |
2648 | /* This function is called from declare_virt_assop_and_dtor via |
2649 | dfs_walk_all. | |
2650 | ||
2651 | DATA is a type that direcly or indirectly inherits the base | |
2652 | represented by BINFO. If BINFO contains a virtual assignment [copy | |
2653 | assignment or move assigment] operator or a virtual constructor, | |
2654 | declare that function in DATA if it hasn't been already declared. */ | |
2655 | ||
2656 | static tree | |
2657 | dfs_declare_virt_assop_and_dtor (tree binfo, void *data) | |
2658 | { | |
2659 | tree bv, fn, t = (tree)data; | |
2660 | tree opname = ansi_assopname (NOP_EXPR); | |
2661 | ||
2662 | gcc_assert (t && CLASS_TYPE_P (t)); | |
2663 | gcc_assert (binfo && TREE_CODE (binfo) == TREE_BINFO); | |
2664 | ||
2665 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) | |
2666 | /* A base without a vtable needs no modification, and its bases | |
2667 | are uninteresting. */ | |
2668 | return dfs_skip_bases; | |
2669 | ||
2670 | if (BINFO_PRIMARY_P (binfo)) | |
2671 | /* If this is a primary base, then we have already looked at the | |
2672 | virtual functions of its vtable. */ | |
2673 | return NULL_TREE; | |
2674 | ||
2675 | for (bv = BINFO_VIRTUALS (binfo); bv; bv = TREE_CHAIN (bv)) | |
2676 | { | |
2677 | fn = BV_FN (bv); | |
2678 | ||
2679 | if (DECL_NAME (fn) == opname) | |
2680 | { | |
2681 | if (CLASSTYPE_LAZY_COPY_ASSIGN (t)) | |
2682 | lazily_declare_fn (sfk_copy_assignment, t); | |
2683 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
2684 | lazily_declare_fn (sfk_move_assignment, t); | |
2685 | } | |
2686 | else if (DECL_DESTRUCTOR_P (fn) | |
2687 | && CLASSTYPE_LAZY_DESTRUCTOR (t)) | |
2688 | lazily_declare_fn (sfk_destructor, t); | |
2689 | } | |
2690 | ||
2691 | return NULL_TREE; | |
2692 | } | |
2693 | ||
2694 | /* If the class type T has a direct or indirect base that contains a | |
2695 | virtual assignment operator or a virtual destructor, declare that | |
2696 | function in T if it hasn't been already declared. */ | |
2697 | ||
2698 | static void | |
2699 | declare_virt_assop_and_dtor (tree t) | |
2700 | { | |
2701 | if (!(TYPE_POLYMORPHIC_P (t) | |
2702 | && (CLASSTYPE_LAZY_COPY_ASSIGN (t) | |
2703 | || CLASSTYPE_LAZY_MOVE_ASSIGN (t) | |
2704 | || CLASSTYPE_LAZY_DESTRUCTOR (t)))) | |
2705 | return; | |
2706 | ||
2707 | dfs_walk_all (TYPE_BINFO (t), | |
2708 | dfs_declare_virt_assop_and_dtor, | |
2709 | NULL, t); | |
2710 | } | |
2711 | ||
61a127b3 | 2712 | /* Create default constructors, assignment operators, and so forth for |
e5e459bf AO |
2713 | the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR, |
2714 | and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason, | |
2715 | the class cannot have a default constructor, copy constructor | |
2716 | taking a const reference argument, or an assignment operator taking | |
2717 | a const reference, respectively. */ | |
61a127b3 | 2718 | |
f72ab53b | 2719 | static void |
c8094d83 | 2720 | add_implicitly_declared_members (tree t, |
94edc4ab | 2721 | int cant_have_const_cctor, |
10746f37 | 2722 | int cant_have_const_assignment) |
61a127b3 | 2723 | { |
61a127b3 | 2724 | /* Destructor. */ |
9f4faeae | 2725 | if (!CLASSTYPE_DESTRUCTORS (t)) |
61a127b3 | 2726 | { |
9f4faeae MM |
2727 | /* In general, we create destructors lazily. */ |
2728 | CLASSTYPE_LAZY_DESTRUCTOR (t) = 1; | |
9f4faeae | 2729 | |
d1a115f8 JM |
2730 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
2731 | && TYPE_FOR_JAVA (t)) | |
2732 | /* But if this is a Java class, any non-trivial destructor is | |
2733 | invalid, even if compiler-generated. Therefore, if the | |
2734 | destructor is non-trivial we create it now. */ | |
2735 | lazily_declare_fn (sfk_destructor, t); | |
61a127b3 | 2736 | } |
61a127b3 | 2737 | |
0fcedd9c JM |
2738 | /* [class.ctor] |
2739 | ||
2740 | If there is no user-declared constructor for a class, a default | |
2741 | constructor is implicitly declared. */ | |
2742 | if (! TYPE_HAS_USER_CONSTRUCTOR (t)) | |
61a127b3 | 2743 | { |
508a1c9c | 2744 | TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1; |
0930cc0e JM |
2745 | CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1; |
2746 | if (cxx_dialect >= cxx0x) | |
2747 | TYPE_HAS_CONSTEXPR_CTOR (t) | |
fd3faf2b JM |
2748 | /* This might force the declaration. */ |
2749 | = type_has_constexpr_default_constructor (t); | |
61a127b3 MM |
2750 | } |
2751 | ||
0fcedd9c JM |
2752 | /* [class.ctor] |
2753 | ||
2754 | If a class definition does not explicitly declare a copy | |
2755 | constructor, one is declared implicitly. */ | |
a2e70335 | 2756 | if (! TYPE_HAS_COPY_CTOR (t) && ! TYPE_FOR_JAVA (t)) |
61a127b3 | 2757 | { |
066ec0a4 JM |
2758 | TYPE_HAS_COPY_CTOR (t) = 1; |
2759 | TYPE_HAS_CONST_COPY_CTOR (t) = !cant_have_const_cctor; | |
508a1c9c | 2760 | CLASSTYPE_LAZY_COPY_CTOR (t) = 1; |
a2e70335 | 2761 | if (cxx_dialect >= cxx0x && !type_has_move_constructor (t)) |
d758e847 | 2762 | CLASSTYPE_LAZY_MOVE_CTOR (t) = 1; |
61a127b3 MM |
2763 | } |
2764 | ||
aaaa46d2 MM |
2765 | /* If there is no assignment operator, one will be created if and |
2766 | when it is needed. For now, just record whether or not the type | |
2767 | of the parameter to the assignment operator will be a const or | |
2768 | non-const reference. */ | |
a2e70335 | 2769 | if (!TYPE_HAS_COPY_ASSIGN (t) && !TYPE_FOR_JAVA (t)) |
fb232476 | 2770 | { |
066ec0a4 JM |
2771 | TYPE_HAS_COPY_ASSIGN (t) = 1; |
2772 | TYPE_HAS_CONST_COPY_ASSIGN (t) = !cant_have_const_assignment; | |
2773 | CLASSTYPE_LAZY_COPY_ASSIGN (t) = 1; | |
a2e70335 | 2774 | if (cxx_dialect >= cxx0x && !type_has_move_assign (t)) |
d758e847 | 2775 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 1; |
fb232476 | 2776 | } |
d1a115f8 JM |
2777 | |
2778 | /* We can't be lazy about declaring functions that might override | |
2779 | a virtual function from a base class. */ | |
ca2409f9 | 2780 | declare_virt_assop_and_dtor (t); |
61a127b3 MM |
2781 | } |
2782 | ||
f90cdf34 MT |
2783 | /* Subroutine of finish_struct_1. Recursively count the number of fields |
2784 | in TYPE, including anonymous union members. */ | |
2785 | ||
2786 | static int | |
94edc4ab | 2787 | count_fields (tree fields) |
f90cdf34 MT |
2788 | { |
2789 | tree x; | |
2790 | int n_fields = 0; | |
910ad8de | 2791 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
2792 | { |
2793 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
2794 | n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x))); | |
2795 | else | |
2796 | n_fields += 1; | |
2797 | } | |
2798 | return n_fields; | |
2799 | } | |
2800 | ||
2801 | /* Subroutine of finish_struct_1. Recursively add all the fields in the | |
d07605f5 | 2802 | TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */ |
f90cdf34 MT |
2803 | |
2804 | static int | |
d07605f5 | 2805 | add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx) |
f90cdf34 MT |
2806 | { |
2807 | tree x; | |
910ad8de | 2808 | for (x = fields; x; x = DECL_CHAIN (x)) |
f90cdf34 MT |
2809 | { |
2810 | if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x))) | |
d07605f5 | 2811 | idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx); |
f90cdf34 | 2812 | else |
d07605f5 | 2813 | field_vec->elts[idx++] = x; |
f90cdf34 MT |
2814 | } |
2815 | return idx; | |
2816 | } | |
2817 | ||
1e30f9b4 MM |
2818 | /* FIELD is a bit-field. We are finishing the processing for its |
2819 | enclosing type. Issue any appropriate messages and set appropriate | |
e7df0180 | 2820 | flags. Returns false if an error has been diagnosed. */ |
1e30f9b4 | 2821 | |
e7df0180 | 2822 | static bool |
94edc4ab | 2823 | check_bitfield_decl (tree field) |
1e30f9b4 MM |
2824 | { |
2825 | tree type = TREE_TYPE (field); | |
606791f6 MM |
2826 | tree w; |
2827 | ||
2828 | /* Extract the declared width of the bitfield, which has been | |
2829 | temporarily stashed in DECL_INITIAL. */ | |
2830 | w = DECL_INITIAL (field); | |
3db45ab5 | 2831 | gcc_assert (w != NULL_TREE); |
606791f6 MM |
2832 | /* Remove the bit-field width indicator so that the rest of the |
2833 | compiler does not treat that value as an initializer. */ | |
2834 | DECL_INITIAL (field) = NULL_TREE; | |
1e30f9b4 | 2835 | |
cd8ed629 | 2836 | /* Detect invalid bit-field type. */ |
550a799d | 2837 | if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type)) |
1e30f9b4 | 2838 | { |
dee15844 | 2839 | error ("bit-field %q+#D with non-integral type", field); |
cd8ed629 | 2840 | w = error_mark_node; |
1e30f9b4 | 2841 | } |
606791f6 | 2842 | else |
1e30f9b4 | 2843 | { |
9e115cec | 2844 | location_t loc = input_location; |
1e30f9b4 MM |
2845 | /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */ |
2846 | STRIP_NOPS (w); | |
2847 | ||
2848 | /* detect invalid field size. */ | |
9e115cec | 2849 | input_location = DECL_SOURCE_LOCATION (field); |
fa2200cb | 2850 | w = cxx_constant_value (w); |
9e115cec | 2851 | input_location = loc; |
1e30f9b4 MM |
2852 | |
2853 | if (TREE_CODE (w) != INTEGER_CST) | |
2854 | { | |
dee15844 | 2855 | error ("bit-field %q+D width not an integer constant", field); |
cd8ed629 | 2856 | w = error_mark_node; |
1e30f9b4 | 2857 | } |
05bccae2 | 2858 | else if (tree_int_cst_sgn (w) < 0) |
1e30f9b4 | 2859 | { |
dee15844 | 2860 | error ("negative width in bit-field %q+D", field); |
cd8ed629 | 2861 | w = error_mark_node; |
1e30f9b4 | 2862 | } |
05bccae2 | 2863 | else if (integer_zerop (w) && DECL_NAME (field) != 0) |
1e30f9b4 | 2864 | { |
dee15844 | 2865 | error ("zero width for bit-field %q+D", field); |
cd8ed629 | 2866 | w = error_mark_node; |
1e30f9b4 | 2867 | } |
05bccae2 | 2868 | else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0 |
1e30f9b4 MM |
2869 | && TREE_CODE (type) != ENUMERAL_TYPE |
2870 | && TREE_CODE (type) != BOOLEAN_TYPE) | |
dee15844 | 2871 | warning (0, "width of %q+D exceeds its type", field); |
1e30f9b4 | 2872 | else if (TREE_CODE (type) == ENUMERAL_TYPE |
cbb4feb3 JM |
2873 | && (0 > (compare_tree_int |
2874 | (w, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type)))))) | |
dee15844 | 2875 | warning (0, "%q+D is too small to hold all values of %q#T", field, type); |
cd8ed629 | 2876 | } |
c8094d83 | 2877 | |
cd8ed629 MM |
2878 | if (w != error_mark_node) |
2879 | { | |
2880 | DECL_SIZE (field) = convert (bitsizetype, w); | |
2881 | DECL_BIT_FIELD (field) = 1; | |
e7df0180 | 2882 | return true; |
1e30f9b4 MM |
2883 | } |
2884 | else | |
cd8ed629 MM |
2885 | { |
2886 | /* Non-bit-fields are aligned for their type. */ | |
2887 | DECL_BIT_FIELD (field) = 0; | |
2888 | CLEAR_DECL_C_BIT_FIELD (field); | |
e7df0180 | 2889 | return false; |
cd8ed629 | 2890 | } |
1e30f9b4 MM |
2891 | } |
2892 | ||
2893 | /* FIELD is a non bit-field. We are finishing the processing for its | |
2894 | enclosing type T. Issue any appropriate messages and set appropriate | |
2895 | flags. */ | |
2896 | ||
2897 | static void | |
94edc4ab | 2898 | check_field_decl (tree field, |
0cbd7506 MS |
2899 | tree t, |
2900 | int* cant_have_const_ctor, | |
2901 | int* no_const_asn_ref, | |
10746f37 | 2902 | int* any_default_members) |
1e30f9b4 MM |
2903 | { |
2904 | tree type = strip_array_types (TREE_TYPE (field)); | |
2905 | ||
57ece258 | 2906 | /* In C++98 an anonymous union cannot contain any fields which would change |
1e30f9b4 | 2907 | the settings of CANT_HAVE_CONST_CTOR and friends. */ |
57ece258 | 2908 | if (ANON_UNION_TYPE_P (type) && cxx_dialect < cxx0x) |
1e30f9b4 | 2909 | ; |
066ec0a4 | 2910 | /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous |
1e30f9b4 MM |
2911 | structs. So, we recurse through their fields here. */ |
2912 | else if (ANON_AGGR_TYPE_P (type)) | |
2913 | { | |
2914 | tree fields; | |
2915 | ||
910ad8de | 2916 | for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields)) |
17aec3eb | 2917 | if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field)) |
1e30f9b4 | 2918 | check_field_decl (fields, t, cant_have_const_ctor, |
10746f37 | 2919 | no_const_asn_ref, any_default_members); |
1e30f9b4 MM |
2920 | } |
2921 | /* Check members with class type for constructors, destructors, | |
2922 | etc. */ | |
2923 | else if (CLASS_TYPE_P (type)) | |
2924 | { | |
2925 | /* Never let anything with uninheritable virtuals | |
2926 | make it through without complaint. */ | |
2927 | abstract_virtuals_error (field, type); | |
c8094d83 | 2928 | |
57ece258 | 2929 | if (TREE_CODE (t) == UNION_TYPE && cxx_dialect < cxx0x) |
1e30f9b4 | 2930 | { |
57ece258 JM |
2931 | static bool warned; |
2932 | int oldcount = errorcount; | |
1e30f9b4 | 2933 | if (TYPE_NEEDS_CONSTRUCTING (type)) |
dee15844 JM |
2934 | error ("member %q+#D with constructor not allowed in union", |
2935 | field); | |
834c6dff | 2936 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) |
dee15844 | 2937 | error ("member %q+#D with destructor not allowed in union", field); |
066ec0a4 | 2938 | if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type)) |
dee15844 JM |
2939 | error ("member %q+#D with copy assignment operator not allowed in union", |
2940 | field); | |
57ece258 JM |
2941 | if (!warned && errorcount > oldcount) |
2942 | { | |
2943 | inform (DECL_SOURCE_LOCATION (field), "unrestricted unions " | |
97e3ad20 | 2944 | "only available with -std=c++11 or -std=gnu++11"); |
57ece258 JM |
2945 | warned = true; |
2946 | } | |
1e30f9b4 MM |
2947 | } |
2948 | else | |
2949 | { | |
2950 | TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type); | |
c8094d83 | 2951 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
834c6dff | 2952 | |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type); |
d758e847 JM |
2953 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |
2954 | |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type) | |
2955 | || !TYPE_HAS_COPY_ASSIGN (type)); | |
2956 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type) | |
2957 | || !TYPE_HAS_COPY_CTOR (type)); | |
ac177431 JM |
2958 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type); |
2959 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type); | |
2960 | TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type) | |
2961 | || TYPE_HAS_COMPLEX_DFLT (type)); | |
1e30f9b4 MM |
2962 | } |
2963 | ||
d758e847 JM |
2964 | if (TYPE_HAS_COPY_CTOR (type) |
2965 | && !TYPE_HAS_CONST_COPY_CTOR (type)) | |
1e30f9b4 MM |
2966 | *cant_have_const_ctor = 1; |
2967 | ||
d758e847 JM |
2968 | if (TYPE_HAS_COPY_ASSIGN (type) |
2969 | && !TYPE_HAS_CONST_COPY_ASSIGN (type)) | |
1e30f9b4 | 2970 | *no_const_asn_ref = 1; |
1e30f9b4 MM |
2971 | } |
2972 | if (DECL_INITIAL (field) != NULL_TREE) | |
2973 | { | |
2974 | /* `build_class_init_list' does not recognize | |
2975 | non-FIELD_DECLs. */ | |
0e5f8a59 | 2976 | if (TREE_CODE (t) == UNION_TYPE && *any_default_members != 0) |
1f070f2b | 2977 | error ("multiple fields in union %qT initialized", t); |
1e30f9b4 MM |
2978 | *any_default_members = 1; |
2979 | } | |
6bb88f3b | 2980 | } |
1e30f9b4 | 2981 | |
08b962b0 MM |
2982 | /* Check the data members (both static and non-static), class-scoped |
2983 | typedefs, etc., appearing in the declaration of T. Issue | |
2984 | appropriate diagnostics. Sets ACCESS_DECLS to a list (in | |
2985 | declaration order) of access declarations; each TREE_VALUE in this | |
2986 | list is a USING_DECL. | |
8d08fdba | 2987 | |
08b962b0 | 2988 | In addition, set the following flags: |
8d08fdba | 2989 | |
08b962b0 MM |
2990 | EMPTY_P |
2991 | The class is empty, i.e., contains no non-static data members. | |
8d08fdba | 2992 | |
08b962b0 MM |
2993 | CANT_HAVE_CONST_CTOR_P |
2994 | This class cannot have an implicitly generated copy constructor | |
2995 | taking a const reference. | |
8d08fdba | 2996 | |
08b962b0 MM |
2997 | CANT_HAVE_CONST_ASN_REF |
2998 | This class cannot have an implicitly generated assignment | |
2999 | operator taking a const reference. | |
8d08fdba | 3000 | |
08b962b0 MM |
3001 | All of these flags should be initialized before calling this |
3002 | function. | |
8d08fdba | 3003 | |
08b962b0 MM |
3004 | Returns a pointer to the end of the TYPE_FIELDs chain; additional |
3005 | fields can be added by adding to this chain. */ | |
8d08fdba | 3006 | |
607cf131 | 3007 | static void |
58731fd1 | 3008 | check_field_decls (tree t, tree *access_decls, |
58731fd1 | 3009 | int *cant_have_const_ctor_p, |
10746f37 | 3010 | int *no_const_asn_ref_p) |
08b962b0 MM |
3011 | { |
3012 | tree *field; | |
3013 | tree *next; | |
dd29d26b | 3014 | bool has_pointers; |
08b962b0 | 3015 | int any_default_members; |
22002050 | 3016 | int cant_pack = 0; |
c32097d8 | 3017 | int field_access = -1; |
08b962b0 MM |
3018 | |
3019 | /* Assume there are no access declarations. */ | |
3020 | *access_decls = NULL_TREE; | |
3021 | /* Assume this class has no pointer members. */ | |
dd29d26b | 3022 | has_pointers = false; |
08b962b0 MM |
3023 | /* Assume none of the members of this class have default |
3024 | initializations. */ | |
3025 | any_default_members = 0; | |
3026 | ||
3027 | for (field = &TYPE_FIELDS (t); *field; field = next) | |
8d08fdba | 3028 | { |
08b962b0 MM |
3029 | tree x = *field; |
3030 | tree type = TREE_TYPE (x); | |
c32097d8 | 3031 | int this_field_access; |
8d08fdba | 3032 | |
910ad8de | 3033 | next = &DECL_CHAIN (x); |
8d08fdba | 3034 | |
cffa8729 | 3035 | if (TREE_CODE (x) == USING_DECL) |
f30432d7 | 3036 | { |
08b962b0 MM |
3037 | /* Save the access declarations for our caller. */ |
3038 | *access_decls = tree_cons (NULL_TREE, x, *access_decls); | |
f30432d7 MS |
3039 | continue; |
3040 | } | |
8d08fdba | 3041 | |
050367a3 MM |
3042 | if (TREE_CODE (x) == TYPE_DECL |
3043 | || TREE_CODE (x) == TEMPLATE_DECL) | |
f30432d7 | 3044 | continue; |
8d08fdba | 3045 | |
f30432d7 | 3046 | /* If we've gotten this far, it's a data member, possibly static, |
e92cc029 | 3047 | or an enumerator. */ |
17aec3eb | 3048 | DECL_CONTEXT (x) = t; |
8d08fdba | 3049 | |
58ec3cc5 MM |
3050 | /* When this goes into scope, it will be a non-local reference. */ |
3051 | DECL_NONLOCAL (x) = 1; | |
3052 | ||
3053 | if (TREE_CODE (t) == UNION_TYPE) | |
3054 | { | |
3055 | /* [class.union] | |
3056 | ||
3057 | If a union contains a static data member, or a member of | |
324f9dfb | 3058 | reference type, the program is ill-formed. */ |
58ec3cc5 MM |
3059 | if (TREE_CODE (x) == VAR_DECL) |
3060 | { | |
dee15844 | 3061 | error ("%q+D may not be static because it is a member of a union", x); |
58ec3cc5 MM |
3062 | continue; |
3063 | } | |
3064 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
3065 | { | |
dee15844 JM |
3066 | error ("%q+D may not have reference type %qT because" |
3067 | " it is a member of a union", | |
3068 | x, type); | |
58ec3cc5 MM |
3069 | continue; |
3070 | } | |
3071 | } | |
3072 | ||
f30432d7 MS |
3073 | /* Perform error checking that did not get done in |
3074 | grokdeclarator. */ | |
52fb2769 | 3075 | if (TREE_CODE (type) == FUNCTION_TYPE) |
f30432d7 | 3076 | { |
dee15844 | 3077 | error ("field %q+D invalidly declared function type", x); |
52fb2769 NS |
3078 | type = build_pointer_type (type); |
3079 | TREE_TYPE (x) = type; | |
f30432d7 | 3080 | } |
52fb2769 | 3081 | else if (TREE_CODE (type) == METHOD_TYPE) |
f30432d7 | 3082 | { |
dee15844 | 3083 | error ("field %q+D invalidly declared method type", x); |
52fb2769 NS |
3084 | type = build_pointer_type (type); |
3085 | TREE_TYPE (x) = type; | |
f30432d7 | 3086 | } |
8d08fdba | 3087 | |
52fb2769 | 3088 | if (type == error_mark_node) |
f30432d7 | 3089 | continue; |
c8094d83 | 3090 | |
58ec3cc5 | 3091 | if (TREE_CODE (x) == CONST_DECL || TREE_CODE (x) == VAR_DECL) |
73a8adb6 | 3092 | continue; |
8d08fdba | 3093 | |
f30432d7 | 3094 | /* Now it can only be a FIELD_DECL. */ |
8d08fdba | 3095 | |
f30432d7 | 3096 | if (TREE_PRIVATE (x) || TREE_PROTECTED (x)) |
08b962b0 | 3097 | CLASSTYPE_NON_AGGREGATE (t) = 1; |
8d08fdba | 3098 | |
3b49d762 GDR |
3099 | /* If at least one non-static data member is non-literal, the whole |
3100 | class becomes non-literal. */ | |
3101 | if (!literal_type_p (type)) | |
3102 | CLASSTYPE_LITERAL_P (t) = false; | |
3103 | ||
c32097d8 JM |
3104 | /* A standard-layout class is a class that: |
3105 | ... | |
3106 | has the same access control (Clause 11) for all non-static data members, | |
3107 | ... */ | |
3108 | this_field_access = TREE_PROTECTED (x) ? 1 : TREE_PRIVATE (x) ? 2 : 0; | |
3109 | if (field_access == -1) | |
3110 | field_access = this_field_access; | |
3111 | else if (this_field_access != field_access) | |
3112 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
3113 | ||
0fcedd9c | 3114 | /* If this is of reference type, check if it needs an init. */ |
52fb2769 | 3115 | if (TREE_CODE (type) == REFERENCE_TYPE) |
0cbd7506 | 3116 | { |
c32097d8 JM |
3117 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3118 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
f30432d7 | 3119 | if (DECL_INITIAL (x) == NULL_TREE) |
6eb35968 | 3120 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); |
8d08fdba | 3121 | |
f30432d7 MS |
3122 | /* ARM $12.6.2: [A member initializer list] (or, for an |
3123 | aggregate, initialization by a brace-enclosed list) is the | |
3124 | only way to initialize nonstatic const and reference | |
3125 | members. */ | |
066ec0a4 | 3126 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3127 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3128 | } |
8d08fdba | 3129 | |
1e30f9b4 | 3130 | type = strip_array_types (type); |
dd29d26b | 3131 | |
1937f939 JM |
3132 | if (TYPE_PACKED (t)) |
3133 | { | |
c32097d8 | 3134 | if (!layout_pod_type_p (type) && !TYPE_PACKED (type)) |
4666cd04 JM |
3135 | { |
3136 | warning | |
3137 | (0, | |
3138 | "ignoring packed attribute because of unpacked non-POD field %q+#D", | |
3139 | x); | |
22002050 | 3140 | cant_pack = 1; |
4666cd04 | 3141 | } |
2cd36c22 AN |
3142 | else if (DECL_C_BIT_FIELD (x) |
3143 | || TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT) | |
1937f939 JM |
3144 | DECL_PACKED (x) = 1; |
3145 | } | |
3146 | ||
3147 | if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x))) | |
3148 | /* We don't treat zero-width bitfields as making a class | |
3149 | non-empty. */ | |
3150 | ; | |
3151 | else | |
3152 | { | |
3153 | /* The class is non-empty. */ | |
3154 | CLASSTYPE_EMPTY_P (t) = 0; | |
3155 | /* The class is not even nearly empty. */ | |
3156 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
3157 | /* If one of the data members contains an empty class, | |
3158 | so does T. */ | |
3159 | if (CLASS_TYPE_P (type) | |
3160 | && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3161 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
3162 | } | |
3163 | ||
dd29d26b GB |
3164 | /* This is used by -Weffc++ (see below). Warn only for pointers |
3165 | to members which might hold dynamic memory. So do not warn | |
3166 | for pointers to functions or pointers to members. */ | |
3167 | if (TYPE_PTR_P (type) | |
3168 | && !TYPE_PTRFN_P (type) | |
3169 | && !TYPE_PTR_TO_MEMBER_P (type)) | |
3170 | has_pointers = true; | |
824b9a4c | 3171 | |
58ec3cc5 MM |
3172 | if (CLASS_TYPE_P (type)) |
3173 | { | |
3174 | if (CLASSTYPE_REF_FIELDS_NEED_INIT (type)) | |
3175 | SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1); | |
3176 | if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)) | |
3177 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); | |
3178 | } | |
3179 | ||
52fb2769 | 3180 | if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type)) |
08b962b0 | 3181 | CLASSTYPE_HAS_MUTABLE (t) = 1; |
a7a7710d | 3182 | |
c32097d8 | 3183 | if (! layout_pod_type_p (type)) |
0cbd7506 MS |
3184 | /* DR 148 now allows pointers to members (which are POD themselves), |
3185 | to be allowed in POD structs. */ | |
c32097d8 JM |
3186 | CLASSTYPE_NON_LAYOUT_POD_P (t) = 1; |
3187 | ||
3188 | if (!std_layout_type_p (type)) | |
3189 | CLASSTYPE_NON_STD_LAYOUT (t) = 1; | |
52fb2769 | 3190 | |
94e6e4c4 AO |
3191 | if (! zero_init_p (type)) |
3192 | CLASSTYPE_NON_ZERO_INIT_P (t) = 1; | |
3193 | ||
640c2adf FC |
3194 | /* We set DECL_C_BIT_FIELD in grokbitfield. |
3195 | If the type and width are valid, we'll also set DECL_BIT_FIELD. */ | |
3196 | if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x)) | |
3197 | check_field_decl (x, t, | |
3198 | cant_have_const_ctor_p, | |
3199 | no_const_asn_ref_p, | |
10746f37 | 3200 | &any_default_members); |
640c2adf | 3201 | |
ec3ebf45 OG |
3202 | /* Now that we've removed bit-field widths from DECL_INITIAL, |
3203 | anything left in DECL_INITIAL is an NSDMI that makes the class | |
3204 | non-aggregate. */ | |
3205 | if (DECL_INITIAL (x)) | |
3206 | CLASSTYPE_NON_AGGREGATE (t) = true; | |
3207 | ||
f30432d7 | 3208 | /* If any field is const, the structure type is pseudo-const. */ |
52fb2769 | 3209 | if (CP_TYPE_CONST_P (type)) |
f30432d7 MS |
3210 | { |
3211 | C_TYPE_FIELDS_READONLY (t) = 1; | |
3212 | if (DECL_INITIAL (x) == NULL_TREE) | |
6eb35968 | 3213 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1); |
f30432d7 MS |
3214 | |
3215 | /* ARM $12.6.2: [A member initializer list] (or, for an | |
3216 | aggregate, initialization by a brace-enclosed list) is the | |
3217 | only way to initialize nonstatic const and reference | |
3218 | members. */ | |
066ec0a4 | 3219 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; |
ac177431 | 3220 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1; |
f30432d7 | 3221 | } |
08b962b0 | 3222 | /* A field that is pseudo-const makes the structure likewise. */ |
5552b43c | 3223 | else if (CLASS_TYPE_P (type)) |
f30432d7 | 3224 | { |
08b962b0 | 3225 | C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type); |
6eb35968 DE |
3226 | SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, |
3227 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (t) | |
3228 | | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type)); | |
f30432d7 | 3229 | } |
8d08fdba | 3230 | |
c10bffd0 JM |
3231 | /* Core issue 80: A nonstatic data member is required to have a |
3232 | different name from the class iff the class has a | |
b87d79e6 | 3233 | user-declared constructor. */ |
0fcedd9c JM |
3234 | if (constructor_name_p (DECL_NAME (x), t) |
3235 | && TYPE_HAS_USER_CONSTRUCTOR (t)) | |
cbe5f3b3 | 3236 | permerror (input_location, "field %q+#D with same name as class", x); |
8d08fdba MS |
3237 | } |
3238 | ||
dd29d26b GB |
3239 | /* Effective C++ rule 11: if a class has dynamic memory held by pointers, |
3240 | it should also define a copy constructor and an assignment operator to | |
3241 | implement the correct copy semantic (deep vs shallow, etc.). As it is | |
3242 | not feasible to check whether the constructors do allocate dynamic memory | |
3243 | and store it within members, we approximate the warning like this: | |
3244 | ||
3245 | -- Warn only if there are members which are pointers | |
3246 | -- Warn only if there is a non-trivial constructor (otherwise, | |
3247 | there cannot be memory allocated). | |
3248 | -- Warn only if there is a non-trivial destructor. We assume that the | |
3249 | user at least implemented the cleanup correctly, and a destructor | |
3250 | is needed to free dynamic memory. | |
c8094d83 | 3251 | |
77880ae4 | 3252 | This seems enough for practical purposes. */ |
22002050 JM |
3253 | if (warn_ecpp |
3254 | && has_pointers | |
0fcedd9c | 3255 | && TYPE_HAS_USER_CONSTRUCTOR (t) |
22002050 | 3256 | && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) |
066ec0a4 | 3257 | && !(TYPE_HAS_COPY_CTOR (t) && TYPE_HAS_COPY_ASSIGN (t))) |
824b9a4c | 3258 | { |
b323323f | 3259 | warning (OPT_Weffc__, "%q#T has pointer data members", t); |
c8094d83 | 3260 | |
066ec0a4 | 3261 | if (! TYPE_HAS_COPY_CTOR (t)) |
824b9a4c | 3262 | { |
74fa0285 | 3263 | warning (OPT_Weffc__, |
3db45ab5 | 3264 | " but does not override %<%T(const %T&)%>", t, t); |
066ec0a4 | 3265 | if (!TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3266 | warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t); |
824b9a4c | 3267 | } |
066ec0a4 | 3268 | else if (! TYPE_HAS_COPY_ASSIGN (t)) |
74fa0285 | 3269 | warning (OPT_Weffc__, |
3db45ab5 | 3270 | " but does not override %<operator=(const %T&)%>", t); |
824b9a4c | 3271 | } |
08b962b0 | 3272 | |
0e5f8a59 JM |
3273 | /* Non-static data member initializers make the default constructor |
3274 | non-trivial. */ | |
3275 | if (any_default_members) | |
3276 | { | |
3277 | TYPE_NEEDS_CONSTRUCTING (t) = true; | |
3278 | TYPE_HAS_COMPLEX_DFLT (t) = true; | |
3279 | } | |
3280 | ||
22002050 JM |
3281 | /* If any of the fields couldn't be packed, unset TYPE_PACKED. */ |
3282 | if (cant_pack) | |
3283 | TYPE_PACKED (t) = 0; | |
607cf131 MM |
3284 | |
3285 | /* Check anonymous struct/anonymous union fields. */ | |
3286 | finish_struct_anon (t); | |
3287 | ||
08b962b0 MM |
3288 | /* We've built up the list of access declarations in reverse order. |
3289 | Fix that now. */ | |
3290 | *access_decls = nreverse (*access_decls); | |
08b962b0 MM |
3291 | } |
3292 | ||
c20118a8 MM |
3293 | /* If TYPE is an empty class type, records its OFFSET in the table of |
3294 | OFFSETS. */ | |
607cf131 | 3295 | |
c20118a8 | 3296 | static int |
94edc4ab | 3297 | record_subobject_offset (tree type, tree offset, splay_tree offsets) |
5c24fba6 | 3298 | { |
c20118a8 | 3299 | splay_tree_node n; |
5c24fba6 | 3300 | |
c20118a8 MM |
3301 | if (!is_empty_class (type)) |
3302 | return 0; | |
5c24fba6 | 3303 | |
c20118a8 MM |
3304 | /* Record the location of this empty object in OFFSETS. */ |
3305 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3306 | if (!n) | |
c8094d83 | 3307 | n = splay_tree_insert (offsets, |
c20118a8 MM |
3308 | (splay_tree_key) offset, |
3309 | (splay_tree_value) NULL_TREE); | |
c8094d83 | 3310 | n->value = ((splay_tree_value) |
c20118a8 MM |
3311 | tree_cons (NULL_TREE, |
3312 | type, | |
3313 | (tree) n->value)); | |
3314 | ||
3315 | return 0; | |
607cf131 MM |
3316 | } |
3317 | ||
838dfd8a | 3318 | /* Returns nonzero if TYPE is an empty class type and there is |
c20118a8 | 3319 | already an entry in OFFSETS for the same TYPE as the same OFFSET. */ |
9785e4b1 | 3320 | |
c20118a8 | 3321 | static int |
94edc4ab | 3322 | check_subobject_offset (tree type, tree offset, splay_tree offsets) |
9785e4b1 | 3323 | { |
c20118a8 MM |
3324 | splay_tree_node n; |
3325 | tree t; | |
3326 | ||
3327 | if (!is_empty_class (type)) | |
3328 | return 0; | |
3329 | ||
3330 | /* Record the location of this empty object in OFFSETS. */ | |
3331 | n = splay_tree_lookup (offsets, (splay_tree_key) offset); | |
3332 | if (!n) | |
3333 | return 0; | |
3334 | ||
3335 | for (t = (tree) n->value; t; t = TREE_CHAIN (t)) | |
3336 | if (same_type_p (TREE_VALUE (t), type)) | |
3337 | return 1; | |
3338 | ||
3339 | return 0; | |
9785e4b1 MM |
3340 | } |
3341 | ||
c20118a8 MM |
3342 | /* Walk through all the subobjects of TYPE (located at OFFSET). Call |
3343 | F for every subobject, passing it the type, offset, and table of | |
2003cd37 MM |
3344 | OFFSETS. If VBASES_P is one, then virtual non-primary bases should |
3345 | be traversed. | |
5cdba4ff MM |
3346 | |
3347 | If MAX_OFFSET is non-NULL, then subobjects with an offset greater | |
3348 | than MAX_OFFSET will not be walked. | |
3349 | ||
838dfd8a | 3350 | If F returns a nonzero value, the traversal ceases, and that value |
5cdba4ff | 3351 | is returned. Otherwise, returns zero. */ |
d77249e7 | 3352 | |
c20118a8 | 3353 | static int |
c8094d83 | 3354 | walk_subobject_offsets (tree type, |
0cbd7506 MS |
3355 | subobject_offset_fn f, |
3356 | tree offset, | |
3357 | splay_tree offsets, | |
3358 | tree max_offset, | |
3359 | int vbases_p) | |
5c24fba6 | 3360 | { |
c20118a8 | 3361 | int r = 0; |
ff944b49 | 3362 | tree type_binfo = NULL_TREE; |
c20118a8 | 3363 | |
5cdba4ff MM |
3364 | /* If this OFFSET is bigger than the MAX_OFFSET, then we should |
3365 | stop. */ | |
3366 | if (max_offset && INT_CST_LT (max_offset, offset)) | |
3367 | return 0; | |
3368 | ||
dbe91deb NS |
3369 | if (type == error_mark_node) |
3370 | return 0; | |
3db45ab5 | 3371 | |
c8094d83 | 3372 | if (!TYPE_P (type)) |
ff944b49 MM |
3373 | { |
3374 | if (abi_version_at_least (2)) | |
3375 | type_binfo = type; | |
3376 | type = BINFO_TYPE (type); | |
3377 | } | |
3378 | ||
c20118a8 | 3379 | if (CLASS_TYPE_P (type)) |
5c24fba6 | 3380 | { |
c20118a8 | 3381 | tree field; |
17bbb839 | 3382 | tree binfo; |
c20118a8 MM |
3383 | int i; |
3384 | ||
5ec1192e MM |
3385 | /* Avoid recursing into objects that are not interesting. */ |
3386 | if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type)) | |
3387 | return 0; | |
3388 | ||
c20118a8 MM |
3389 | /* Record the location of TYPE. */ |
3390 | r = (*f) (type, offset, offsets); | |
3391 | if (r) | |
3392 | return r; | |
3393 | ||
3394 | /* Iterate through the direct base classes of TYPE. */ | |
ff944b49 MM |
3395 | if (!type_binfo) |
3396 | type_binfo = TYPE_BINFO (type); | |
fa743e8c | 3397 | for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++) |
c20118a8 | 3398 | { |
ff944b49 MM |
3399 | tree binfo_offset; |
3400 | ||
c8094d83 | 3401 | if (abi_version_at_least (2) |
809e3e7f | 3402 | && BINFO_VIRTUAL_P (binfo)) |
17bbb839 | 3403 | continue; |
5c24fba6 | 3404 | |
c8094d83 MS |
3405 | if (!vbases_p |
3406 | && BINFO_VIRTUAL_P (binfo) | |
9965d119 | 3407 | && !BINFO_PRIMARY_P (binfo)) |
c20118a8 MM |
3408 | continue; |
3409 | ||
ff944b49 MM |
3410 | if (!abi_version_at_least (2)) |
3411 | binfo_offset = size_binop (PLUS_EXPR, | |
3412 | offset, | |
3413 | BINFO_OFFSET (binfo)); | |
3414 | else | |
3415 | { | |
3416 | tree orig_binfo; | |
3417 | /* We cannot rely on BINFO_OFFSET being set for the base | |
3418 | class yet, but the offsets for direct non-virtual | |
3419 | bases can be calculated by going back to the TYPE. */ | |
604a3205 | 3420 | orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i); |
c8094d83 | 3421 | binfo_offset = size_binop (PLUS_EXPR, |
ff944b49 MM |
3422 | offset, |
3423 | BINFO_OFFSET (orig_binfo)); | |
3424 | } | |
3425 | ||
3426 | r = walk_subobject_offsets (binfo, | |
c20118a8 | 3427 | f, |
ff944b49 | 3428 | binfo_offset, |
c20118a8 | 3429 | offsets, |
5cdba4ff | 3430 | max_offset, |
c8094d83 | 3431 | (abi_version_at_least (2) |
17bbb839 | 3432 | ? /*vbases_p=*/0 : vbases_p)); |
c20118a8 MM |
3433 | if (r) |
3434 | return r; | |
3435 | } | |
3436 | ||
58c42dc2 | 3437 | if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type)) |
17bbb839 | 3438 | { |
58c42dc2 | 3439 | unsigned ix; |
d4e6fecb | 3440 | VEC(tree,gc) *vbases; |
17bbb839 | 3441 | |
ff944b49 MM |
3442 | /* Iterate through the virtual base classes of TYPE. In G++ |
3443 | 3.2, we included virtual bases in the direct base class | |
3444 | loop above, which results in incorrect results; the | |
3445 | correct offsets for virtual bases are only known when | |
3446 | working with the most derived type. */ | |
3447 | if (vbases_p) | |
9ba5ff0f NS |
3448 | for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0; |
3449 | VEC_iterate (tree, vbases, ix, binfo); ix++) | |
ff944b49 | 3450 | { |
ff944b49 MM |
3451 | r = walk_subobject_offsets (binfo, |
3452 | f, | |
3453 | size_binop (PLUS_EXPR, | |
3454 | offset, | |
3455 | BINFO_OFFSET (binfo)), | |
3456 | offsets, | |
3457 | max_offset, | |
3458 | /*vbases_p=*/0); | |
3459 | if (r) | |
3460 | return r; | |
3461 | } | |
3462 | else | |
17bbb839 | 3463 | { |
ff944b49 MM |
3464 | /* We still have to walk the primary base, if it is |
3465 | virtual. (If it is non-virtual, then it was walked | |
3466 | above.) */ | |
58c42dc2 | 3467 | tree vbase = get_primary_binfo (type_binfo); |
c8094d83 | 3468 | |
809e3e7f | 3469 | if (vbase && BINFO_VIRTUAL_P (vbase) |
fc6633e0 NS |
3470 | && BINFO_PRIMARY_P (vbase) |
3471 | && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo) | |
ff944b49 | 3472 | { |
c8094d83 | 3473 | r = (walk_subobject_offsets |
dbbf88d1 NS |
3474 | (vbase, f, offset, |
3475 | offsets, max_offset, /*vbases_p=*/0)); | |
3476 | if (r) | |
3477 | return r; | |
ff944b49 | 3478 | } |
17bbb839 MM |
3479 | } |
3480 | } | |
3481 | ||
c20118a8 | 3482 | /* Iterate through the fields of TYPE. */ |
910ad8de | 3483 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
17bbb839 | 3484 | if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field)) |
c20118a8 | 3485 | { |
956d9305 MM |
3486 | tree field_offset; |
3487 | ||
3488 | if (abi_version_at_least (2)) | |
3489 | field_offset = byte_position (field); | |
3490 | else | |
3491 | /* In G++ 3.2, DECL_FIELD_OFFSET was used. */ | |
3492 | field_offset = DECL_FIELD_OFFSET (field); | |
3493 | ||
c20118a8 MM |
3494 | r = walk_subobject_offsets (TREE_TYPE (field), |
3495 | f, | |
3496 | size_binop (PLUS_EXPR, | |
3497 | offset, | |
956d9305 | 3498 | field_offset), |
c20118a8 | 3499 | offsets, |
5cdba4ff | 3500 | max_offset, |
c20118a8 MM |
3501 | /*vbases_p=*/1); |
3502 | if (r) | |
3503 | return r; | |
3504 | } | |
5c24fba6 | 3505 | } |
c20118a8 MM |
3506 | else if (TREE_CODE (type) == ARRAY_TYPE) |
3507 | { | |
5ec1192e | 3508 | tree element_type = strip_array_types (type); |
c20118a8 MM |
3509 | tree domain = TYPE_DOMAIN (type); |
3510 | tree index; | |
5c24fba6 | 3511 | |
5ec1192e MM |
3512 | /* Avoid recursing into objects that are not interesting. */ |
3513 | if (!CLASS_TYPE_P (element_type) | |
3514 | || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type)) | |
3515 | return 0; | |
3516 | ||
c20118a8 | 3517 | /* Step through each of the elements in the array. */ |
17bbb839 MM |
3518 | for (index = size_zero_node; |
3519 | /* G++ 3.2 had an off-by-one error here. */ | |
c8094d83 | 3520 | (abi_version_at_least (2) |
17bbb839 MM |
3521 | ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index) |
3522 | : INT_CST_LT (index, TYPE_MAX_VALUE (domain))); | |
c20118a8 MM |
3523 | index = size_binop (PLUS_EXPR, index, size_one_node)) |
3524 | { | |
3525 | r = walk_subobject_offsets (TREE_TYPE (type), | |
3526 | f, | |
3527 | offset, | |
3528 | offsets, | |
5cdba4ff | 3529 | max_offset, |
c20118a8 MM |
3530 | /*vbases_p=*/1); |
3531 | if (r) | |
3532 | return r; | |
c8094d83 | 3533 | offset = size_binop (PLUS_EXPR, offset, |
c20118a8 | 3534 | TYPE_SIZE_UNIT (TREE_TYPE (type))); |
5cdba4ff MM |
3535 | /* If this new OFFSET is bigger than the MAX_OFFSET, then |
3536 | there's no point in iterating through the remaining | |
3537 | elements of the array. */ | |
3538 | if (max_offset && INT_CST_LT (max_offset, offset)) | |
3539 | break; | |
c20118a8 MM |
3540 | } |
3541 | } | |
3542 | ||
3543 | return 0; | |
3544 | } | |
3545 | ||
c0572427 MM |
3546 | /* Record all of the empty subobjects of TYPE (either a type or a |
3547 | binfo). If IS_DATA_MEMBER is true, then a non-static data member | |
c5a35c3c MM |
3548 | is being placed at OFFSET; otherwise, it is a base class that is |
3549 | being placed at OFFSET. */ | |
c20118a8 MM |
3550 | |
3551 | static void | |
c8094d83 | 3552 | record_subobject_offsets (tree type, |
0cbd7506 MS |
3553 | tree offset, |
3554 | splay_tree offsets, | |
c5a35c3c | 3555 | bool is_data_member) |
c20118a8 | 3556 | { |
c5a35c3c | 3557 | tree max_offset; |
c0572427 MM |
3558 | /* If recording subobjects for a non-static data member or a |
3559 | non-empty base class , we do not need to record offsets beyond | |
3560 | the size of the biggest empty class. Additional data members | |
3561 | will go at the end of the class. Additional base classes will go | |
3562 | either at offset zero (if empty, in which case they cannot | |
3563 | overlap with offsets past the size of the biggest empty class) or | |
3564 | at the end of the class. | |
3565 | ||
3566 | However, if we are placing an empty base class, then we must record | |
c5a35c3c MM |
3567 | all offsets, as either the empty class is at offset zero (where |
3568 | other empty classes might later be placed) or at the end of the | |
3569 | class (where other objects might then be placed, so other empty | |
3570 | subobjects might later overlap). */ | |
3db45ab5 | 3571 | if (is_data_member |
c0572427 | 3572 | || !is_empty_class (BINFO_TYPE (type))) |
c5a35c3c MM |
3573 | max_offset = sizeof_biggest_empty_class; |
3574 | else | |
3575 | max_offset = NULL_TREE; | |
c20118a8 | 3576 | walk_subobject_offsets (type, record_subobject_offset, offset, |
c5a35c3c | 3577 | offsets, max_offset, is_data_member); |
5c24fba6 MM |
3578 | } |
3579 | ||
838dfd8a KH |
3580 | /* Returns nonzero if any of the empty subobjects of TYPE (located at |
3581 | OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero, | |
c20118a8 | 3582 | virtual bases of TYPE are examined. */ |
9785e4b1 MM |
3583 | |
3584 | static int | |
94edc4ab | 3585 | layout_conflict_p (tree type, |
0cbd7506 MS |
3586 | tree offset, |
3587 | splay_tree offsets, | |
3588 | int vbases_p) | |
9785e4b1 | 3589 | { |
5cdba4ff MM |
3590 | splay_tree_node max_node; |
3591 | ||
3592 | /* Get the node in OFFSETS that indicates the maximum offset where | |
3593 | an empty subobject is located. */ | |
3594 | max_node = splay_tree_max (offsets); | |
3595 | /* If there aren't any empty subobjects, then there's no point in | |
3596 | performing this check. */ | |
3597 | if (!max_node) | |
3598 | return 0; | |
3599 | ||
c20118a8 | 3600 | return walk_subobject_offsets (type, check_subobject_offset, offset, |
5cdba4ff MM |
3601 | offsets, (tree) (max_node->key), |
3602 | vbases_p); | |
9785e4b1 MM |
3603 | } |
3604 | ||
5c24fba6 MM |
3605 | /* DECL is a FIELD_DECL corresponding either to a base subobject of a |
3606 | non-static data member of the type indicated by RLI. BINFO is the | |
c20118a8 | 3607 | binfo corresponding to the base subobject, OFFSETS maps offsets to |
17bbb839 MM |
3608 | types already located at those offsets. This function determines |
3609 | the position of the DECL. */ | |
5c24fba6 MM |
3610 | |
3611 | static void | |
c8094d83 MS |
3612 | layout_nonempty_base_or_field (record_layout_info rli, |
3613 | tree decl, | |
3614 | tree binfo, | |
17bbb839 | 3615 | splay_tree offsets) |
5c24fba6 | 3616 | { |
c20118a8 | 3617 | tree offset = NULL_TREE; |
17bbb839 MM |
3618 | bool field_p; |
3619 | tree type; | |
c8094d83 | 3620 | |
17bbb839 MM |
3621 | if (binfo) |
3622 | { | |
3623 | /* For the purposes of determining layout conflicts, we want to | |
3624 | use the class type of BINFO; TREE_TYPE (DECL) will be the | |
3625 | CLASSTYPE_AS_BASE version, which does not contain entries for | |
3626 | zero-sized bases. */ | |
3627 | type = TREE_TYPE (binfo); | |
3628 | field_p = false; | |
3629 | } | |
3630 | else | |
3631 | { | |
3632 | type = TREE_TYPE (decl); | |
3633 | field_p = true; | |
3634 | } | |
c20118a8 | 3635 | |
5c24fba6 MM |
3636 | /* Try to place the field. It may take more than one try if we have |
3637 | a hard time placing the field without putting two objects of the | |
3638 | same type at the same address. */ | |
3639 | while (1) | |
3640 | { | |
defd0dea | 3641 | struct record_layout_info_s old_rli = *rli; |
5c24fba6 | 3642 | |
770ae6cc RK |
3643 | /* Place this field. */ |
3644 | place_field (rli, decl); | |
da3d4dfa | 3645 | offset = byte_position (decl); |
1e2e9f54 | 3646 | |
5c24fba6 MM |
3647 | /* We have to check to see whether or not there is already |
3648 | something of the same type at the offset we're about to use. | |
1e2e9f54 | 3649 | For example, consider: |
c8094d83 | 3650 | |
1e2e9f54 MM |
3651 | struct S {}; |
3652 | struct T : public S { int i; }; | |
3653 | struct U : public S, public T {}; | |
c8094d83 | 3654 | |
5c24fba6 MM |
3655 | Here, we put S at offset zero in U. Then, we can't put T at |
3656 | offset zero -- its S component would be at the same address | |
3657 | as the S we already allocated. So, we have to skip ahead. | |
3658 | Since all data members, including those whose type is an | |
838dfd8a | 3659 | empty class, have nonzero size, any overlap can happen only |
5c24fba6 MM |
3660 | with a direct or indirect base-class -- it can't happen with |
3661 | a data member. */ | |
1e2e9f54 MM |
3662 | /* In a union, overlap is permitted; all members are placed at |
3663 | offset zero. */ | |
3664 | if (TREE_CODE (rli->t) == UNION_TYPE) | |
3665 | break; | |
7ba539c6 MM |
3666 | /* G++ 3.2 did not check for overlaps when placing a non-empty |
3667 | virtual base. */ | |
809e3e7f | 3668 | if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo)) |
7ba539c6 | 3669 | break; |
c8094d83 | 3670 | if (layout_conflict_p (field_p ? type : binfo, offset, |
ff944b49 | 3671 | offsets, field_p)) |
5c24fba6 | 3672 | { |
5c24fba6 MM |
3673 | /* Strip off the size allocated to this field. That puts us |
3674 | at the first place we could have put the field with | |
3675 | proper alignment. */ | |
770ae6cc RK |
3676 | *rli = old_rli; |
3677 | ||
c20118a8 | 3678 | /* Bump up by the alignment required for the type. */ |
770ae6cc | 3679 | rli->bitpos |
c8094d83 MS |
3680 | = size_binop (PLUS_EXPR, rli->bitpos, |
3681 | bitsize_int (binfo | |
c20118a8 MM |
3682 | ? CLASSTYPE_ALIGN (type) |
3683 | : TYPE_ALIGN (type))); | |
770ae6cc | 3684 | normalize_rli (rli); |
5c24fba6 MM |
3685 | } |
3686 | else | |
3687 | /* There was no conflict. We're done laying out this field. */ | |
3688 | break; | |
3689 | } | |
c20118a8 | 3690 | |
623fe76a | 3691 | /* Now that we know where it will be placed, update its |
c20118a8 MM |
3692 | BINFO_OFFSET. */ |
3693 | if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo))) | |
90024bdc | 3694 | /* Indirect virtual bases may have a nonzero BINFO_OFFSET at |
17bbb839 MM |
3695 | this point because their BINFO_OFFSET is copied from another |
3696 | hierarchy. Therefore, we may not need to add the entire | |
3697 | OFFSET. */ | |
c8094d83 | 3698 | propagate_binfo_offsets (binfo, |
db3927fb AH |
3699 | size_diffop_loc (input_location, |
3700 | convert (ssizetype, offset), | |
c8094d83 | 3701 | convert (ssizetype, |
dbbf88d1 | 3702 | BINFO_OFFSET (binfo)))); |
5c24fba6 MM |
3703 | } |
3704 | ||
90024bdc | 3705 | /* Returns true if TYPE is empty and OFFSET is nonzero. */ |
7ba539c6 MM |
3706 | |
3707 | static int | |
3708 | empty_base_at_nonzero_offset_p (tree type, | |
3709 | tree offset, | |
3710 | splay_tree offsets ATTRIBUTE_UNUSED) | |
3711 | { | |
3712 | return is_empty_class (type) && !integer_zerop (offset); | |
3713 | } | |
3714 | ||
9785e4b1 | 3715 | /* Layout the empty base BINFO. EOC indicates the byte currently just |
ec386958 | 3716 | past the end of the class, and should be correctly aligned for a |
c20118a8 | 3717 | class of the type indicated by BINFO; OFFSETS gives the offsets of |
623fe76a | 3718 | the empty bases allocated so far. T is the most derived |
838dfd8a | 3719 | type. Return nonzero iff we added it at the end. */ |
9785e4b1 | 3720 | |
06d9f09f | 3721 | static bool |
d9d9dbc0 JM |
3722 | layout_empty_base (record_layout_info rli, tree binfo, |
3723 | tree eoc, splay_tree offsets) | |
9785e4b1 | 3724 | { |
ec386958 | 3725 | tree alignment; |
9785e4b1 | 3726 | tree basetype = BINFO_TYPE (binfo); |
06d9f09f | 3727 | bool atend = false; |
956d9305 | 3728 | |
9785e4b1 | 3729 | /* This routine should only be used for empty classes. */ |
50bc768d | 3730 | gcc_assert (is_empty_class (basetype)); |
1b50716d | 3731 | alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype)); |
9785e4b1 | 3732 | |
3075b327 NS |
3733 | if (!integer_zerop (BINFO_OFFSET (binfo))) |
3734 | { | |
3735 | if (abi_version_at_least (2)) | |
3736 | propagate_binfo_offsets | |
db3927fb AH |
3737 | (binfo, size_diffop_loc (input_location, |
3738 | size_zero_node, BINFO_OFFSET (binfo))); | |
74fa0285 GDR |
3739 | else |
3740 | warning (OPT_Wabi, | |
3db45ab5 | 3741 | "offset of empty base %qT may not be ABI-compliant and may" |
3075b327 NS |
3742 | "change in a future version of GCC", |
3743 | BINFO_TYPE (binfo)); | |
3744 | } | |
c8094d83 | 3745 | |
9785e4b1 MM |
3746 | /* This is an empty base class. We first try to put it at offset |
3747 | zero. */ | |
ff944b49 | 3748 | if (layout_conflict_p (binfo, |
c20118a8 | 3749 | BINFO_OFFSET (binfo), |
c8094d83 | 3750 | offsets, |
c20118a8 | 3751 | /*vbases_p=*/0)) |
9785e4b1 MM |
3752 | { |
3753 | /* That didn't work. Now, we move forward from the next | |
3754 | available spot in the class. */ | |
06d9f09f | 3755 | atend = true; |
dbbf88d1 | 3756 | propagate_binfo_offsets (binfo, convert (ssizetype, eoc)); |
c8094d83 | 3757 | while (1) |
9785e4b1 | 3758 | { |
ff944b49 | 3759 | if (!layout_conflict_p (binfo, |
c8094d83 | 3760 | BINFO_OFFSET (binfo), |
c20118a8 MM |
3761 | offsets, |
3762 | /*vbases_p=*/0)) | |
9785e4b1 MM |
3763 | /* We finally found a spot where there's no overlap. */ |
3764 | break; | |
3765 | ||
3766 | /* There's overlap here, too. Bump along to the next spot. */ | |
dbbf88d1 | 3767 | propagate_binfo_offsets (binfo, alignment); |
9785e4b1 MM |
3768 | } |
3769 | } | |
d9d9dbc0 JM |
3770 | |
3771 | if (CLASSTYPE_USER_ALIGN (basetype)) | |
3772 | { | |
3773 | rli->record_align = MAX (rli->record_align, CLASSTYPE_ALIGN (basetype)); | |
3774 | if (warn_packed) | |
3775 | rli->unpacked_align = MAX (rli->unpacked_align, CLASSTYPE_ALIGN (basetype)); | |
3776 | TYPE_USER_ALIGN (rli->t) = 1; | |
3777 | } | |
3778 | ||
06d9f09f | 3779 | return atend; |
9785e4b1 MM |
3780 | } |
3781 | ||
78dcd41a | 3782 | /* Layout the base given by BINFO in the class indicated by RLI. |
58731fd1 | 3783 | *BASE_ALIGN is a running maximum of the alignments of |
17bbb839 MM |
3784 | any base class. OFFSETS gives the location of empty base |
3785 | subobjects. T is the most derived type. Return nonzero if the new | |
3786 | object cannot be nearly-empty. A new FIELD_DECL is inserted at | |
c8094d83 | 3787 | *NEXT_FIELD, unless BINFO is for an empty base class. |
5c24fba6 | 3788 | |
17bbb839 MM |
3789 | Returns the location at which the next field should be inserted. */ |
3790 | ||
3791 | static tree * | |
58731fd1 | 3792 | build_base_field (record_layout_info rli, tree binfo, |
17bbb839 | 3793 | splay_tree offsets, tree *next_field) |
d77249e7 | 3794 | { |
17bbb839 | 3795 | tree t = rli->t; |
d77249e7 | 3796 | tree basetype = BINFO_TYPE (binfo); |
d77249e7 | 3797 | |
d0f062fb | 3798 | if (!COMPLETE_TYPE_P (basetype)) |
d77249e7 MM |
3799 | /* This error is now reported in xref_tag, thus giving better |
3800 | location information. */ | |
17bbb839 | 3801 | return next_field; |
c8094d83 | 3802 | |
17bbb839 MM |
3803 | /* Place the base class. */ |
3804 | if (!is_empty_class (basetype)) | |
5c24fba6 | 3805 | { |
17bbb839 MM |
3806 | tree decl; |
3807 | ||
5c24fba6 MM |
3808 | /* The containing class is non-empty because it has a non-empty |
3809 | base class. */ | |
58731fd1 | 3810 | CLASSTYPE_EMPTY_P (t) = 0; |
c8094d83 | 3811 | |
17bbb839 | 3812 | /* Create the FIELD_DECL. */ |
c2255bc4 AH |
3813 | decl = build_decl (input_location, |
3814 | FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype)); | |
17bbb839 | 3815 | DECL_ARTIFICIAL (decl) = 1; |
78e0d62b | 3816 | DECL_IGNORED_P (decl) = 1; |
17bbb839 | 3817 | DECL_FIELD_CONTEXT (decl) = t; |
1ad8aeeb DG |
3818 | if (CLASSTYPE_AS_BASE (basetype)) |
3819 | { | |
3820 | DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype); | |
3821 | DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype); | |
3822 | DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype); | |
3823 | DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype); | |
3824 | DECL_MODE (decl) = TYPE_MODE (basetype); | |
3825 | DECL_FIELD_IS_BASE (decl) = 1; | |
3826 | ||
3827 | /* Try to place the field. It may take more than one try if we | |
3828 | have a hard time placing the field without putting two | |
3829 | objects of the same type at the same address. */ | |
3830 | layout_nonempty_base_or_field (rli, decl, binfo, offsets); | |
3831 | /* Add the new FIELD_DECL to the list of fields for T. */ | |
910ad8de | 3832 | DECL_CHAIN (decl) = *next_field; |
1ad8aeeb | 3833 | *next_field = decl; |
910ad8de | 3834 | next_field = &DECL_CHAIN (decl); |
1ad8aeeb | 3835 | } |
5c24fba6 MM |
3836 | } |
3837 | else | |
ec386958 | 3838 | { |
17bbb839 | 3839 | tree eoc; |
7ba539c6 | 3840 | bool atend; |
ec386958 MM |
3841 | |
3842 | /* On some platforms (ARM), even empty classes will not be | |
3843 | byte-aligned. */ | |
db3927fb AH |
3844 | eoc = round_up_loc (input_location, |
3845 | rli_size_unit_so_far (rli), | |
17bbb839 | 3846 | CLASSTYPE_ALIGN_UNIT (basetype)); |
d9d9dbc0 | 3847 | atend = layout_empty_base (rli, binfo, eoc, offsets); |
7ba539c6 MM |
3848 | /* A nearly-empty class "has no proper base class that is empty, |
3849 | not morally virtual, and at an offset other than zero." */ | |
809e3e7f | 3850 | if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t)) |
7ba539c6 MM |
3851 | { |
3852 | if (atend) | |
3853 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
c5a35c3c | 3854 | /* The check above (used in G++ 3.2) is insufficient because |
7ba539c6 | 3855 | an empty class placed at offset zero might itself have an |
90024bdc | 3856 | empty base at a nonzero offset. */ |
c8094d83 | 3857 | else if (walk_subobject_offsets (basetype, |
7ba539c6 MM |
3858 | empty_base_at_nonzero_offset_p, |
3859 | size_zero_node, | |
3860 | /*offsets=*/NULL, | |
3861 | /*max_offset=*/NULL_TREE, | |
3862 | /*vbases_p=*/true)) | |
3863 | { | |
3864 | if (abi_version_at_least (2)) | |
3865 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; | |
74fa0285 GDR |
3866 | else |
3867 | warning (OPT_Wabi, | |
3db45ab5 | 3868 | "class %qT will be considered nearly empty in a " |
7ba539c6 MM |
3869 | "future version of GCC", t); |
3870 | } | |
3871 | } | |
c8094d83 | 3872 | |
17bbb839 MM |
3873 | /* We do not create a FIELD_DECL for empty base classes because |
3874 | it might overlap some other field. We want to be able to | |
3875 | create CONSTRUCTORs for the class by iterating over the | |
3876 | FIELD_DECLs, and the back end does not handle overlapping | |
3877 | FIELD_DECLs. */ | |
58731fd1 MM |
3878 | |
3879 | /* An empty virtual base causes a class to be non-empty | |
3880 | -- but in that case we do not need to clear CLASSTYPE_EMPTY_P | |
3881 | here because that was already done when the virtual table | |
3882 | pointer was created. */ | |
ec386958 | 3883 | } |
5c24fba6 | 3884 | |
5c24fba6 | 3885 | /* Record the offsets of BINFO and its base subobjects. */ |
ff944b49 | 3886 | record_subobject_offsets (binfo, |
c20118a8 | 3887 | BINFO_OFFSET (binfo), |
c8094d83 | 3888 | offsets, |
c5a35c3c | 3889 | /*is_data_member=*/false); |
17bbb839 MM |
3890 | |
3891 | return next_field; | |
d77249e7 MM |
3892 | } |
3893 | ||
c20118a8 | 3894 | /* Layout all of the non-virtual base classes. Record empty |
17bbb839 MM |
3895 | subobjects in OFFSETS. T is the most derived type. Return nonzero |
3896 | if the type cannot be nearly empty. The fields created | |
3897 | corresponding to the base classes will be inserted at | |
3898 | *NEXT_FIELD. */ | |
607cf131 | 3899 | |
17bbb839 | 3900 | static void |
58731fd1 | 3901 | build_base_fields (record_layout_info rli, |
17bbb839 | 3902 | splay_tree offsets, tree *next_field) |
607cf131 MM |
3903 | { |
3904 | /* Chain to hold all the new FIELD_DECLs which stand in for base class | |
3905 | subobjects. */ | |
17bbb839 | 3906 | tree t = rli->t; |
604a3205 | 3907 | int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t)); |
5c24fba6 | 3908 | int i; |
607cf131 | 3909 | |
3461fba7 | 3910 | /* The primary base class is always allocated first. */ |
17bbb839 MM |
3911 | if (CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
3912 | next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t), | |
58731fd1 | 3913 | offsets, next_field); |
d77249e7 MM |
3914 | |
3915 | /* Now allocate the rest of the bases. */ | |
607cf131 MM |
3916 | for (i = 0; i < n_baseclasses; ++i) |
3917 | { | |
d77249e7 | 3918 | tree base_binfo; |
607cf131 | 3919 | |
604a3205 | 3920 | base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i); |
911a71a7 | 3921 | |
3461fba7 NS |
3922 | /* The primary base was already allocated above, so we don't |
3923 | need to allocate it again here. */ | |
17bbb839 | 3924 | if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t)) |
607cf131 MM |
3925 | continue; |
3926 | ||
dbbf88d1 NS |
3927 | /* Virtual bases are added at the end (a primary virtual base |
3928 | will have already been added). */ | |
809e3e7f | 3929 | if (BINFO_VIRTUAL_P (base_binfo)) |
607cf131 MM |
3930 | continue; |
3931 | ||
58731fd1 | 3932 | next_field = build_base_field (rli, base_binfo, |
17bbb839 | 3933 | offsets, next_field); |
607cf131 | 3934 | } |
607cf131 MM |
3935 | } |
3936 | ||
58010b57 MM |
3937 | /* Go through the TYPE_METHODS of T issuing any appropriate |
3938 | diagnostics, figuring out which methods override which other | |
3ef397c1 | 3939 | methods, and so forth. */ |
58010b57 MM |
3940 | |
3941 | static void | |
94edc4ab | 3942 | check_methods (tree t) |
58010b57 MM |
3943 | { |
3944 | tree x; | |
58010b57 | 3945 | |
910ad8de | 3946 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
58010b57 | 3947 | { |
58010b57 | 3948 | check_for_override (x, t); |
fee7654e | 3949 | if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x)) |
dee15844 | 3950 | error ("initializer specified for non-virtual method %q+D", x); |
58010b57 MM |
3951 | /* The name of the field is the original field name |
3952 | Save this in auxiliary field for later overloading. */ | |
3953 | if (DECL_VINDEX (x)) | |
3954 | { | |
3ef397c1 | 3955 | TYPE_POLYMORPHIC_P (t) = 1; |
fee7654e | 3956 | if (DECL_PURE_VIRTUAL_P (x)) |
d4e6fecb | 3957 | VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x); |
58010b57 | 3958 | } |
46408846 JM |
3959 | /* All user-provided destructors are non-trivial. |
3960 | Constructors and assignment ops are handled in | |
3961 | grok_special_member_properties. */ | |
20f2653e | 3962 | if (DECL_DESTRUCTOR_P (x) && user_provided_p (x)) |
9f4faeae | 3963 | TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1; |
58010b57 | 3964 | } |
58010b57 MM |
3965 | } |
3966 | ||
db9b2174 MM |
3967 | /* FN is a constructor or destructor. Clone the declaration to create |
3968 | a specialized in-charge or not-in-charge version, as indicated by | |
3969 | NAME. */ | |
3970 | ||
3971 | static tree | |
94edc4ab | 3972 | build_clone (tree fn, tree name) |
db9b2174 MM |
3973 | { |
3974 | tree parms; | |
3975 | tree clone; | |
3976 | ||
3977 | /* Copy the function. */ | |
3978 | clone = copy_decl (fn); | |
db9b2174 MM |
3979 | /* Reset the function name. */ |
3980 | DECL_NAME (clone) = name; | |
71cb9286 | 3981 | SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE); |
b97e8a14 JM |
3982 | /* Remember where this function came from. */ |
3983 | DECL_ABSTRACT_ORIGIN (clone) = fn; | |
3984 | /* Make it easy to find the CLONE given the FN. */ | |
910ad8de NF |
3985 | DECL_CHAIN (clone) = DECL_CHAIN (fn); |
3986 | DECL_CHAIN (fn) = clone; | |
b97e8a14 JM |
3987 | |
3988 | /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */ | |
3989 | if (TREE_CODE (clone) == TEMPLATE_DECL) | |
3990 | { | |
3991 | tree result = build_clone (DECL_TEMPLATE_RESULT (clone), name); | |
3992 | DECL_TEMPLATE_RESULT (clone) = result; | |
3993 | DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result)); | |
3994 | DECL_TI_TEMPLATE (result) = clone; | |
3995 | TREE_TYPE (clone) = TREE_TYPE (result); | |
3996 | return clone; | |
3997 | } | |
3998 | ||
3999 | DECL_CLONED_FUNCTION (clone) = fn; | |
db9b2174 MM |
4000 | /* There's no pending inline data for this function. */ |
4001 | DECL_PENDING_INLINE_INFO (clone) = NULL; | |
4002 | DECL_PENDING_INLINE_P (clone) = 0; | |
db9b2174 | 4003 | |
298d6f60 MM |
4004 | /* The base-class destructor is not virtual. */ |
4005 | if (name == base_dtor_identifier) | |
4006 | { | |
4007 | DECL_VIRTUAL_P (clone) = 0; | |
4008 | if (TREE_CODE (clone) != TEMPLATE_DECL) | |
4009 | DECL_VINDEX (clone) = NULL_TREE; | |
4010 | } | |
4011 | ||
4e7512c9 | 4012 | /* If there was an in-charge parameter, drop it from the function |
db9b2174 MM |
4013 | type. */ |
4014 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4015 | { | |
4016 | tree basetype; | |
4017 | tree parmtypes; | |
4018 | tree exceptions; | |
4019 | ||
4020 | exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); | |
4021 | basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); | |
4022 | parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4023 | /* Skip the `this' parameter. */ | |
4024 | parmtypes = TREE_CHAIN (parmtypes); | |
4025 | /* Skip the in-charge parameter. */ | |
4026 | parmtypes = TREE_CHAIN (parmtypes); | |
e0fff4b3 JM |
4027 | /* And the VTT parm, in a complete [cd]tor. */ |
4028 | if (DECL_HAS_VTT_PARM_P (fn) | |
4029 | && ! DECL_NEEDS_VTT_PARM_P (clone)) | |
4030 | parmtypes = TREE_CHAIN (parmtypes); | |
3ec6bad3 MM |
4031 | /* If this is subobject constructor or destructor, add the vtt |
4032 | parameter. */ | |
c8094d83 | 4033 | TREE_TYPE (clone) |
43dc123f MM |
4034 | = build_method_type_directly (basetype, |
4035 | TREE_TYPE (TREE_TYPE (clone)), | |
4036 | parmtypes); | |
db9b2174 MM |
4037 | if (exceptions) |
4038 | TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone), | |
4039 | exceptions); | |
c8094d83 | 4040 | TREE_TYPE (clone) |
e9525111 MM |
4041 | = cp_build_type_attribute_variant (TREE_TYPE (clone), |
4042 | TYPE_ATTRIBUTES (TREE_TYPE (fn))); | |
db9b2174 MM |
4043 | } |
4044 | ||
b97e8a14 JM |
4045 | /* Copy the function parameters. */ |
4046 | DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone)); | |
4047 | /* Remove the in-charge parameter. */ | |
4048 | if (DECL_HAS_IN_CHARGE_PARM_P (clone)) | |
4049 | { | |
910ad8de NF |
4050 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4051 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 JM |
4052 | DECL_HAS_IN_CHARGE_PARM_P (clone) = 0; |
4053 | } | |
4054 | /* And the VTT parm, in a complete [cd]tor. */ | |
4055 | if (DECL_HAS_VTT_PARM_P (fn)) | |
db9b2174 | 4056 | { |
b97e8a14 JM |
4057 | if (DECL_NEEDS_VTT_PARM_P (clone)) |
4058 | DECL_HAS_VTT_PARM_P (clone) = 1; | |
4059 | else | |
db9b2174 | 4060 | { |
910ad8de NF |
4061 | DECL_CHAIN (DECL_ARGUMENTS (clone)) |
4062 | = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone))); | |
b97e8a14 | 4063 | DECL_HAS_VTT_PARM_P (clone) = 0; |
3ec6bad3 | 4064 | } |
b97e8a14 | 4065 | } |
3ec6bad3 | 4066 | |
910ad8de | 4067 | for (parms = DECL_ARGUMENTS (clone); parms; parms = DECL_CHAIN (parms)) |
b97e8a14 JM |
4068 | { |
4069 | DECL_CONTEXT (parms) = clone; | |
4070 | cxx_dup_lang_specific_decl (parms); | |
db9b2174 MM |
4071 | } |
4072 | ||
db9b2174 | 4073 | /* Create the RTL for this function. */ |
245763e3 | 4074 | SET_DECL_RTL (clone, NULL); |
0e6df31e | 4075 | rest_of_decl_compilation (clone, /*top_level=*/1, at_eof); |
c8094d83 | 4076 | |
b97e8a14 JM |
4077 | if (pch_file) |
4078 | note_decl_for_pch (clone); | |
db9b2174 | 4079 | |
b97e8a14 JM |
4080 | return clone; |
4081 | } | |
db9b2174 | 4082 | |
b97e8a14 JM |
4083 | /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do |
4084 | not invoke this function directly. | |
4085 | ||
4086 | For a non-thunk function, returns the address of the slot for storing | |
4087 | the function it is a clone of. Otherwise returns NULL_TREE. | |
4088 | ||
4089 | If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if | |
4090 | cloned_function is unset. This is to support the separate | |
4091 | DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter | |
4092 | on a template makes sense, but not the former. */ | |
4093 | ||
4094 | tree * | |
4095 | decl_cloned_function_p (const_tree decl, bool just_testing) | |
4096 | { | |
4097 | tree *ptr; | |
4098 | if (just_testing) | |
4099 | decl = STRIP_TEMPLATE (decl); | |
4100 | ||
4101 | if (TREE_CODE (decl) != FUNCTION_DECL | |
4102 | || !DECL_LANG_SPECIFIC (decl) | |
4103 | || DECL_LANG_SPECIFIC (decl)->u.fn.thunk_p) | |
4104 | { | |
4105 | #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007) | |
4106 | if (!just_testing) | |
4107 | lang_check_failed (__FILE__, __LINE__, __FUNCTION__); | |
4108 | else | |
4109 | #endif | |
4110 | return NULL; | |
db9b2174 MM |
4111 | } |
4112 | ||
b97e8a14 JM |
4113 | ptr = &DECL_LANG_SPECIFIC (decl)->u.fn.u5.cloned_function; |
4114 | if (just_testing && *ptr == NULL_TREE) | |
4115 | return NULL; | |
4116 | else | |
4117 | return ptr; | |
db9b2174 MM |
4118 | } |
4119 | ||
4120 | /* Produce declarations for all appropriate clones of FN. If | |
838dfd8a | 4121 | UPDATE_METHOD_VEC_P is nonzero, the clones are added to the |
db9b2174 MM |
4122 | CLASTYPE_METHOD_VEC as well. */ |
4123 | ||
4124 | void | |
94edc4ab | 4125 | clone_function_decl (tree fn, int update_method_vec_p) |
db9b2174 MM |
4126 | { |
4127 | tree clone; | |
4128 | ||
c00996a3 | 4129 | /* Avoid inappropriate cloning. */ |
910ad8de NF |
4130 | if (DECL_CHAIN (fn) |
4131 | && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn))) | |
c00996a3 JM |
4132 | return; |
4133 | ||
298d6f60 | 4134 | if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn)) |
db9b2174 | 4135 | { |
298d6f60 MM |
4136 | /* For each constructor, we need two variants: an in-charge version |
4137 | and a not-in-charge version. */ | |
db9b2174 MM |
4138 | clone = build_clone (fn, complete_ctor_identifier); |
4139 | if (update_method_vec_p) | |
b2a9b208 | 4140 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4141 | clone = build_clone (fn, base_ctor_identifier); |
4142 | if (update_method_vec_p) | |
b2a9b208 | 4143 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
db9b2174 MM |
4144 | } |
4145 | else | |
298d6f60 | 4146 | { |
50bc768d | 4147 | gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)); |
298d6f60 | 4148 | |
3ec6bad3 | 4149 | /* For each destructor, we need three variants: an in-charge |
298d6f60 | 4150 | version, a not-in-charge version, and an in-charge deleting |
4e7512c9 MM |
4151 | version. We clone the deleting version first because that |
4152 | means it will go second on the TYPE_METHODS list -- and that | |
4153 | corresponds to the correct layout order in the virtual | |
c8094d83 | 4154 | function table. |
52682a1b | 4155 | |
0cbd7506 | 4156 | For a non-virtual destructor, we do not build a deleting |
52682a1b MM |
4157 | destructor. */ |
4158 | if (DECL_VIRTUAL_P (fn)) | |
4159 | { | |
4160 | clone = build_clone (fn, deleting_dtor_identifier); | |
4161 | if (update_method_vec_p) | |
b2a9b208 | 4162 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
52682a1b | 4163 | } |
4e7512c9 | 4164 | clone = build_clone (fn, complete_dtor_identifier); |
298d6f60 | 4165 | if (update_method_vec_p) |
b2a9b208 | 4166 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 MM |
4167 | clone = build_clone (fn, base_dtor_identifier); |
4168 | if (update_method_vec_p) | |
b2a9b208 | 4169 | add_method (DECL_CONTEXT (clone), clone, NULL_TREE); |
298d6f60 | 4170 | } |
5daf7c0a JM |
4171 | |
4172 | /* Note that this is an abstract function that is never emitted. */ | |
4173 | DECL_ABSTRACT (fn) = 1; | |
db9b2174 MM |
4174 | } |
4175 | ||
5f6eeeb3 NS |
4176 | /* DECL is an in charge constructor, which is being defined. This will |
4177 | have had an in class declaration, from whence clones were | |
4178 | declared. An out-of-class definition can specify additional default | |
4179 | arguments. As it is the clones that are involved in overload | |
4180 | resolution, we must propagate the information from the DECL to its | |
00a17e31 | 4181 | clones. */ |
5f6eeeb3 NS |
4182 | |
4183 | void | |
94edc4ab | 4184 | adjust_clone_args (tree decl) |
5f6eeeb3 NS |
4185 | { |
4186 | tree clone; | |
c8094d83 | 4187 | |
910ad8de NF |
4188 | for (clone = DECL_CHAIN (decl); clone && DECL_CLONED_FUNCTION_P (clone); |
4189 | clone = DECL_CHAIN (clone)) | |
5f6eeeb3 NS |
4190 | { |
4191 | tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone)); | |
4192 | tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl)); | |
4193 | tree decl_parms, clone_parms; | |
4194 | ||
4195 | clone_parms = orig_clone_parms; | |
c8094d83 | 4196 | |
00a17e31 | 4197 | /* Skip the 'this' parameter. */ |
5f6eeeb3 NS |
4198 | orig_clone_parms = TREE_CHAIN (orig_clone_parms); |
4199 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4200 | ||
4201 | if (DECL_HAS_IN_CHARGE_PARM_P (decl)) | |
4202 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
4203 | if (DECL_HAS_VTT_PARM_P (decl)) | |
4204 | orig_decl_parms = TREE_CHAIN (orig_decl_parms); | |
c8094d83 | 4205 | |
5f6eeeb3 NS |
4206 | clone_parms = orig_clone_parms; |
4207 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4208 | clone_parms = TREE_CHAIN (clone_parms); | |
c8094d83 | 4209 | |
5f6eeeb3 NS |
4210 | for (decl_parms = orig_decl_parms; decl_parms; |
4211 | decl_parms = TREE_CHAIN (decl_parms), | |
4212 | clone_parms = TREE_CHAIN (clone_parms)) | |
4213 | { | |
50bc768d NS |
4214 | gcc_assert (same_type_p (TREE_TYPE (decl_parms), |
4215 | TREE_TYPE (clone_parms))); | |
c8094d83 | 4216 | |
5f6eeeb3 NS |
4217 | if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms)) |
4218 | { | |
4219 | /* A default parameter has been added. Adjust the | |
00a17e31 | 4220 | clone's parameters. */ |
5f6eeeb3 | 4221 | tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone)); |
3c3905fc | 4222 | tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (clone)); |
5f6eeeb3 NS |
4223 | tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone)); |
4224 | tree type; | |
4225 | ||
4226 | clone_parms = orig_decl_parms; | |
4227 | ||
4228 | if (DECL_HAS_VTT_PARM_P (clone)) | |
4229 | { | |
4230 | clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms), | |
4231 | TREE_VALUE (orig_clone_parms), | |
4232 | clone_parms); | |
4233 | TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms); | |
4234 | } | |
43dc123f MM |
4235 | type = build_method_type_directly (basetype, |
4236 | TREE_TYPE (TREE_TYPE (clone)), | |
4237 | clone_parms); | |
5f6eeeb3 NS |
4238 | if (exceptions) |
4239 | type = build_exception_variant (type, exceptions); | |
3c3905fc JM |
4240 | if (attrs) |
4241 | type = cp_build_type_attribute_variant (type, attrs); | |
5f6eeeb3 | 4242 | TREE_TYPE (clone) = type; |
c8094d83 | 4243 | |
5f6eeeb3 NS |
4244 | clone_parms = NULL_TREE; |
4245 | break; | |
4246 | } | |
4247 | } | |
50bc768d | 4248 | gcc_assert (!clone_parms); |
5f6eeeb3 NS |
4249 | } |
4250 | } | |
4251 | ||
db9b2174 MM |
4252 | /* For each of the constructors and destructors in T, create an |
4253 | in-charge and not-in-charge variant. */ | |
4254 | ||
4255 | static void | |
94edc4ab | 4256 | clone_constructors_and_destructors (tree t) |
db9b2174 MM |
4257 | { |
4258 | tree fns; | |
4259 | ||
db9b2174 MM |
4260 | /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail |
4261 | out now. */ | |
4262 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4263 | return; | |
4264 | ||
db9b2174 MM |
4265 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4266 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
298d6f60 MM |
4267 | for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns)) |
4268 | clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1); | |
db9b2174 MM |
4269 | } |
4270 | ||
0a35513e AH |
4271 | /* Subroutine of set_one_vmethod_tm_attributes. Search base classes |
4272 | of TYPE for virtual functions which FNDECL overrides. Return a | |
4273 | mask of the tm attributes found therein. */ | |
4274 | ||
4275 | static int | |
4276 | look_for_tm_attr_overrides (tree type, tree fndecl) | |
4277 | { | |
4278 | tree binfo = TYPE_BINFO (type); | |
4279 | tree base_binfo; | |
4280 | int ix, found = 0; | |
4281 | ||
4282 | for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ++ix) | |
4283 | { | |
4284 | tree o, basetype = BINFO_TYPE (base_binfo); | |
4285 | ||
4286 | if (!TYPE_POLYMORPHIC_P (basetype)) | |
4287 | continue; | |
4288 | ||
4289 | o = look_for_overrides_here (basetype, fndecl); | |
4290 | if (o) | |
4291 | found |= tm_attr_to_mask (find_tm_attribute | |
4292 | (TYPE_ATTRIBUTES (TREE_TYPE (o)))); | |
4293 | else | |
4294 | found |= look_for_tm_attr_overrides (basetype, fndecl); | |
4295 | } | |
4296 | ||
4297 | return found; | |
4298 | } | |
4299 | ||
4300 | /* Subroutine of set_method_tm_attributes. Handle the checks and | |
4301 | inheritance for one virtual method FNDECL. */ | |
4302 | ||
4303 | static void | |
4304 | set_one_vmethod_tm_attributes (tree type, tree fndecl) | |
4305 | { | |
4306 | tree tm_attr; | |
4307 | int found, have; | |
4308 | ||
4309 | found = look_for_tm_attr_overrides (type, fndecl); | |
4310 | ||
4311 | /* If FNDECL doesn't actually override anything (i.e. T is the | |
4312 | class that first declares FNDECL virtual), then we're done. */ | |
4313 | if (found == 0) | |
4314 | return; | |
4315 | ||
4316 | tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl))); | |
4317 | have = tm_attr_to_mask (tm_attr); | |
4318 | ||
4319 | /* Intel STM Language Extension 3.0, Section 4.2 table 4: | |
4320 | tm_pure must match exactly, otherwise no weakening of | |
4321 | tm_safe > tm_callable > nothing. */ | |
4322 | /* ??? The tm_pure attribute didn't make the transition to the | |
4323 | multivendor language spec. */ | |
4324 | if (have == TM_ATTR_PURE) | |
4325 | { | |
4326 | if (found != TM_ATTR_PURE) | |
4327 | { | |
4328 | found &= -found; | |
4329 | goto err_override; | |
4330 | } | |
4331 | } | |
4332 | /* If the overridden function is tm_pure, then FNDECL must be. */ | |
4333 | else if (found == TM_ATTR_PURE && tm_attr) | |
4334 | goto err_override; | |
4335 | /* Look for base class combinations that cannot be satisfied. */ | |
4336 | else if (found != TM_ATTR_PURE && (found & TM_ATTR_PURE)) | |
4337 | { | |
4338 | found &= ~TM_ATTR_PURE; | |
4339 | found &= -found; | |
4340 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4341 | "method overrides both %<transaction_pure%> and %qE methods", | |
4342 | tm_mask_to_attr (found)); | |
4343 | } | |
4344 | /* If FNDECL did not declare an attribute, then inherit the most | |
4345 | restrictive one. */ | |
4346 | else if (tm_attr == NULL) | |
4347 | { | |
4348 | apply_tm_attr (fndecl, tm_mask_to_attr (found & -found)); | |
4349 | } | |
4350 | /* Otherwise validate that we're not weaker than a function | |
4351 | that is being overridden. */ | |
4352 | else | |
4353 | { | |
4354 | found &= -found; | |
4355 | if (found <= TM_ATTR_CALLABLE && have > found) | |
4356 | goto err_override; | |
4357 | } | |
4358 | return; | |
4359 | ||
4360 | err_override: | |
4361 | error_at (DECL_SOURCE_LOCATION (fndecl), | |
4362 | "method declared %qE overriding %qE method", | |
4363 | tm_attr, tm_mask_to_attr (found)); | |
4364 | } | |
4365 | ||
4366 | /* For each of the methods in T, propagate a class-level tm attribute. */ | |
4367 | ||
4368 | static void | |
4369 | set_method_tm_attributes (tree t) | |
4370 | { | |
4371 | tree class_tm_attr, fndecl; | |
4372 | ||
4373 | /* Don't bother collecting tm attributes if transactional memory | |
4374 | support is not enabled. */ | |
4375 | if (!flag_tm) | |
4376 | return; | |
4377 | ||
4378 | /* Process virtual methods first, as they inherit directly from the | |
4379 | base virtual function and also require validation of new attributes. */ | |
4380 | if (TYPE_CONTAINS_VPTR_P (t)) | |
4381 | { | |
4382 | tree vchain; | |
4383 | for (vchain = BINFO_VIRTUALS (TYPE_BINFO (t)); vchain; | |
4384 | vchain = TREE_CHAIN (vchain)) | |
4385 | set_one_vmethod_tm_attributes (t, BV_FN (vchain)); | |
4386 | } | |
4387 | ||
4388 | /* If the class doesn't have an attribute, nothing more to do. */ | |
4389 | class_tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (t)); | |
4390 | if (class_tm_attr == NULL) | |
4391 | return; | |
4392 | ||
4393 | /* Any method that does not yet have a tm attribute inherits | |
4394 | the one from the class. */ | |
4395 | for (fndecl = TYPE_METHODS (t); fndecl; fndecl = TREE_CHAIN (fndecl)) | |
4396 | { | |
4397 | if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl)))) | |
4398 | apply_tm_attr (fndecl, class_tm_attr); | |
4399 | } | |
4400 | } | |
4401 | ||
8c95264b MLI |
4402 | /* Returns true iff class T has a user-defined constructor other than |
4403 | the default constructor. */ | |
4404 | ||
4405 | bool | |
4406 | type_has_user_nondefault_constructor (tree t) | |
4407 | { | |
4408 | tree fns; | |
4409 | ||
4410 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4411 | return false; | |
4412 | ||
4413 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4414 | { | |
4415 | tree fn = OVL_CURRENT (fns); | |
4416 | if (!DECL_ARTIFICIAL (fn) | |
c2b58ba2 JM |
4417 | && (TREE_CODE (fn) == TEMPLATE_DECL |
4418 | || (skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn)) | |
4419 | != NULL_TREE))) | |
8c95264b MLI |
4420 | return true; |
4421 | } | |
4422 | ||
4423 | return false; | |
4424 | } | |
4425 | ||
6ad86a5b FC |
4426 | /* Returns the defaulted constructor if T has one. Otherwise, returns |
4427 | NULL_TREE. */ | |
4428 | ||
4429 | tree | |
4430 | in_class_defaulted_default_constructor (tree t) | |
4431 | { | |
4432 | tree fns, args; | |
4433 | ||
4434 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4435 | return NULL_TREE; | |
4436 | ||
4437 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4438 | { | |
4439 | tree fn = OVL_CURRENT (fns); | |
4440 | ||
4441 | if (DECL_DEFAULTED_IN_CLASS_P (fn)) | |
4442 | { | |
4443 | args = FUNCTION_FIRST_USER_PARMTYPE (fn); | |
4444 | while (args && TREE_PURPOSE (args)) | |
4445 | args = TREE_CHAIN (args); | |
4446 | if (!args || args == void_list_node) | |
4447 | return fn; | |
4448 | } | |
4449 | } | |
4450 | ||
4451 | return NULL_TREE; | |
4452 | } | |
4453 | ||
b87d79e6 | 4454 | /* Returns true iff FN is a user-provided function, i.e. user-declared |
20f2653e JM |
4455 | and not defaulted at its first declaration; or explicit, private, |
4456 | protected, or non-const. */ | |
b87d79e6 | 4457 | |
20f2653e | 4458 | bool |
b87d79e6 JM |
4459 | user_provided_p (tree fn) |
4460 | { | |
4461 | if (TREE_CODE (fn) == TEMPLATE_DECL) | |
4462 | return true; | |
4463 | else | |
4464 | return (!DECL_ARTIFICIAL (fn) | |
20f2653e | 4465 | && !DECL_DEFAULTED_IN_CLASS_P (fn)); |
b87d79e6 JM |
4466 | } |
4467 | ||
4468 | /* Returns true iff class T has a user-provided constructor. */ | |
4469 | ||
4470 | bool | |
4471 | type_has_user_provided_constructor (tree t) | |
4472 | { | |
4473 | tree fns; | |
4474 | ||
fd97a96a JM |
4475 | if (!CLASS_TYPE_P (t)) |
4476 | return false; | |
4477 | ||
b87d79e6 JM |
4478 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) |
4479 | return false; | |
4480 | ||
4481 | /* This can happen in error cases; avoid crashing. */ | |
4482 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4483 | return false; | |
4484 | ||
4485 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4486 | if (user_provided_p (OVL_CURRENT (fns))) | |
4487 | return true; | |
4488 | ||
4489 | return false; | |
4490 | } | |
4491 | ||
4492 | /* Returns true iff class T has a user-provided default constructor. */ | |
4493 | ||
4494 | bool | |
4495 | type_has_user_provided_default_constructor (tree t) | |
4496 | { | |
71b8cb01 | 4497 | tree fns; |
b87d79e6 JM |
4498 | |
4499 | if (!TYPE_HAS_USER_CONSTRUCTOR (t)) | |
4500 | return false; | |
4501 | ||
4502 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4503 | { | |
4504 | tree fn = OVL_CURRENT (fns); | |
7ad8d488 | 4505 | if (TREE_CODE (fn) == FUNCTION_DECL |
71b8cb01 JM |
4506 | && user_provided_p (fn) |
4507 | && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn))) | |
4508 | return true; | |
b87d79e6 JM |
4509 | } |
4510 | ||
4511 | return false; | |
4512 | } | |
4513 | ||
6132bdd7 JM |
4514 | /* If default-initialization leaves part of TYPE uninitialized, returns |
4515 | a DECL for the field or TYPE itself (DR 253). */ | |
4516 | ||
4517 | tree | |
4518 | default_init_uninitialized_part (tree type) | |
4519 | { | |
4520 | tree t, r, binfo; | |
4521 | int i; | |
4522 | ||
4523 | type = strip_array_types (type); | |
4524 | if (!CLASS_TYPE_P (type)) | |
4525 | return type; | |
4526 | if (type_has_user_provided_default_constructor (type)) | |
4527 | return NULL_TREE; | |
4528 | for (binfo = TYPE_BINFO (type), i = 0; | |
4529 | BINFO_BASE_ITERATE (binfo, i, t); ++i) | |
4530 | { | |
4531 | r = default_init_uninitialized_part (BINFO_TYPE (t)); | |
4532 | if (r) | |
4533 | return r; | |
4534 | } | |
4535 | for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t)) | |
4536 | if (TREE_CODE (t) == FIELD_DECL | |
4537 | && !DECL_ARTIFICIAL (t) | |
4538 | && !DECL_INITIAL (t)) | |
4539 | { | |
4540 | r = default_init_uninitialized_part (TREE_TYPE (t)); | |
4541 | if (r) | |
4542 | return DECL_P (r) ? r : t; | |
4543 | } | |
4544 | ||
4545 | return NULL_TREE; | |
4546 | } | |
4547 | ||
fd3faf2b | 4548 | /* Returns true iff for class T, a trivial synthesized default constructor |
0930cc0e JM |
4549 | would be constexpr. */ |
4550 | ||
4551 | bool | |
fd3faf2b | 4552 | trivial_default_constructor_is_constexpr (tree t) |
0930cc0e | 4553 | { |
fd3faf2b | 4554 | /* A defaulted trivial default constructor is constexpr |
0930cc0e | 4555 | if there is nothing to initialize. */ |
fd3faf2b | 4556 | gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t)); |
0930cc0e JM |
4557 | return is_really_empty_class (t); |
4558 | } | |
4559 | ||
91ea6df3 GDR |
4560 | /* Returns true iff class T has a constexpr default constructor. */ |
4561 | ||
4562 | bool | |
4563 | type_has_constexpr_default_constructor (tree t) | |
4564 | { | |
4565 | tree fns; | |
4566 | ||
4567 | if (!CLASS_TYPE_P (t)) | |
69f36ba6 JM |
4568 | { |
4569 | /* The caller should have stripped an enclosing array. */ | |
4570 | gcc_assert (TREE_CODE (t) != ARRAY_TYPE); | |
4571 | return false; | |
4572 | } | |
0930cc0e | 4573 | if (CLASSTYPE_LAZY_DEFAULT_CTOR (t)) |
fd3faf2b JM |
4574 | { |
4575 | if (!TYPE_HAS_COMPLEX_DFLT (t)) | |
4576 | return trivial_default_constructor_is_constexpr (t); | |
4577 | /* Non-trivial, we need to check subobject constructors. */ | |
4578 | lazily_declare_fn (sfk_constructor, t); | |
4579 | } | |
f7d042e2 | 4580 | fns = locate_ctor (t); |
91ea6df3 GDR |
4581 | return (fns && DECL_DECLARED_CONSTEXPR_P (fns)); |
4582 | } | |
4583 | ||
46408846 JM |
4584 | /* Returns true iff class TYPE has a virtual destructor. */ |
4585 | ||
4586 | bool | |
4587 | type_has_virtual_destructor (tree type) | |
4588 | { | |
4589 | tree dtor; | |
4590 | ||
4591 | if (!CLASS_TYPE_P (type)) | |
4592 | return false; | |
4593 | ||
4594 | gcc_assert (COMPLETE_TYPE_P (type)); | |
4595 | dtor = CLASSTYPE_DESTRUCTORS (type); | |
4596 | return (dtor && DECL_VIRTUAL_P (dtor)); | |
4597 | } | |
4598 | ||
ac177431 JM |
4599 | /* Returns true iff class T has a move constructor. */ |
4600 | ||
4601 | bool | |
4602 | type_has_move_constructor (tree t) | |
4603 | { | |
4604 | tree fns; | |
4605 | ||
4606 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
4607 | { | |
4608 | gcc_assert (COMPLETE_TYPE_P (t)); | |
4609 | lazily_declare_fn (sfk_move_constructor, t); | |
4610 | } | |
4611 | ||
4612 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4613 | return false; | |
4614 | ||
4615 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4616 | if (move_fn_p (OVL_CURRENT (fns))) | |
4617 | return true; | |
4618 | ||
4619 | return false; | |
4620 | } | |
4621 | ||
4622 | /* Returns true iff class T has a move assignment operator. */ | |
4623 | ||
4624 | bool | |
4625 | type_has_move_assign (tree t) | |
4626 | { | |
4627 | tree fns; | |
4628 | ||
4629 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
4630 | { | |
4631 | gcc_assert (COMPLETE_TYPE_P (t)); | |
4632 | lazily_declare_fn (sfk_move_assignment, t); | |
4633 | } | |
4634 | ||
fa4ba4af | 4635 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
ac177431 JM |
4636 | fns; fns = OVL_NEXT (fns)) |
4637 | if (move_fn_p (OVL_CURRENT (fns))) | |
4638 | return true; | |
4639 | ||
4640 | return false; | |
4641 | } | |
4642 | ||
a2e70335 JM |
4643 | /* Returns true iff class T has a move constructor that was explicitly |
4644 | declared in the class body. Note that this is different from | |
4645 | "user-provided", which doesn't include functions that are defaulted in | |
4646 | the class. */ | |
4647 | ||
4648 | bool | |
4649 | type_has_user_declared_move_constructor (tree t) | |
4650 | { | |
4651 | tree fns; | |
4652 | ||
4653 | if (CLASSTYPE_LAZY_MOVE_CTOR (t)) | |
4654 | return false; | |
4655 | ||
4656 | if (!CLASSTYPE_METHOD_VEC (t)) | |
4657 | return false; | |
4658 | ||
4659 | for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns)) | |
4660 | { | |
4661 | tree fn = OVL_CURRENT (fns); | |
4662 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
4663 | return true; | |
4664 | } | |
4665 | ||
4666 | return false; | |
4667 | } | |
4668 | ||
4669 | /* Returns true iff class T has a move assignment operator that was | |
4670 | explicitly declared in the class body. */ | |
4671 | ||
4672 | bool | |
4673 | type_has_user_declared_move_assign (tree t) | |
4674 | { | |
4675 | tree fns; | |
4676 | ||
4677 | if (CLASSTYPE_LAZY_MOVE_ASSIGN (t)) | |
4678 | return false; | |
4679 | ||
fa4ba4af | 4680 | for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR)); |
a2e70335 JM |
4681 | fns; fns = OVL_NEXT (fns)) |
4682 | { | |
4683 | tree fn = OVL_CURRENT (fns); | |
4684 | if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn)) | |
4685 | return true; | |
4686 | } | |
4687 | ||
4688 | return false; | |
4689 | } | |
4690 | ||
95552437 JM |
4691 | /* Nonzero if we need to build up a constructor call when initializing an |
4692 | object of this class, either because it has a user-provided constructor | |
4693 | or because it doesn't have a default constructor (so we need to give an | |
4694 | error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when | |
4695 | what you care about is whether or not an object can be produced by a | |
4696 | constructor (e.g. so we don't set TREE_READONLY on const variables of | |
4697 | such type); use this function when what you care about is whether or not | |
4698 | to try to call a constructor to create an object. The latter case is | |
4699 | the former plus some cases of constructors that cannot be called. */ | |
4700 | ||
4701 | bool | |
4702 | type_build_ctor_call (tree t) | |
4703 | { | |
4704 | tree inner; | |
4705 | if (TYPE_NEEDS_CONSTRUCTING (t)) | |
4706 | return true; | |
4707 | inner = strip_array_types (t); | |
4708 | return (CLASS_TYPE_P (inner) && !TYPE_HAS_DEFAULT_CONSTRUCTOR (inner) | |
4709 | && !ANON_AGGR_TYPE_P (inner)); | |
4710 | } | |
4711 | ||
58010b57 MM |
4712 | /* Remove all zero-width bit-fields from T. */ |
4713 | ||
4714 | static void | |
94edc4ab | 4715 | remove_zero_width_bit_fields (tree t) |
58010b57 MM |
4716 | { |
4717 | tree *fieldsp; | |
4718 | ||
c8094d83 | 4719 | fieldsp = &TYPE_FIELDS (t); |
58010b57 MM |
4720 | while (*fieldsp) |
4721 | { | |
4722 | if (TREE_CODE (*fieldsp) == FIELD_DECL | |
c8094d83 | 4723 | && DECL_C_BIT_FIELD (*fieldsp) |
84894f85 DS |
4724 | /* We should not be confused by the fact that grokbitfield |
4725 | temporarily sets the width of the bit field into | |
4726 | DECL_INITIAL (*fieldsp). | |
4727 | check_bitfield_decl eventually sets DECL_SIZE (*fieldsp) | |
4728 | to that width. */ | |
4729 | && integer_zerop (DECL_SIZE (*fieldsp))) | |
910ad8de | 4730 | *fieldsp = DECL_CHAIN (*fieldsp); |
58010b57 | 4731 | else |
910ad8de | 4732 | fieldsp = &DECL_CHAIN (*fieldsp); |
58010b57 MM |
4733 | } |
4734 | } | |
4735 | ||
dbc957f1 MM |
4736 | /* Returns TRUE iff we need a cookie when dynamically allocating an |
4737 | array whose elements have the indicated class TYPE. */ | |
4738 | ||
4739 | static bool | |
94edc4ab | 4740 | type_requires_array_cookie (tree type) |
dbc957f1 MM |
4741 | { |
4742 | tree fns; | |
18fee3ee | 4743 | bool has_two_argument_delete_p = false; |
dbc957f1 | 4744 | |
50bc768d | 4745 | gcc_assert (CLASS_TYPE_P (type)); |
dbc957f1 MM |
4746 | |
4747 | /* If there's a non-trivial destructor, we need a cookie. In order | |
4748 | to iterate through the array calling the destructor for each | |
4749 | element, we'll have to know how many elements there are. */ | |
4750 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) | |
4751 | return true; | |
4752 | ||
4753 | /* If the usual deallocation function is a two-argument whose second | |
4754 | argument is of type `size_t', then we have to pass the size of | |
4755 | the array to the deallocation function, so we will need to store | |
4756 | a cookie. */ | |
c8094d83 | 4757 | fns = lookup_fnfields (TYPE_BINFO (type), |
dbc957f1 MM |
4758 | ansi_opname (VEC_DELETE_EXPR), |
4759 | /*protect=*/0); | |
4760 | /* If there are no `operator []' members, or the lookup is | |
4761 | ambiguous, then we don't need a cookie. */ | |
4762 | if (!fns || fns == error_mark_node) | |
4763 | return false; | |
4764 | /* Loop through all of the functions. */ | |
50ad9642 | 4765 | for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns)) |
dbc957f1 MM |
4766 | { |
4767 | tree fn; | |
4768 | tree second_parm; | |
4769 | ||
4770 | /* Select the current function. */ | |
4771 | fn = OVL_CURRENT (fns); | |
4772 | /* See if this function is a one-argument delete function. If | |
4773 | it is, then it will be the usual deallocation function. */ | |
4774 | second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))); | |
4775 | if (second_parm == void_list_node) | |
4776 | return false; | |
4b8cb94c SM |
4777 | /* Do not consider this function if its second argument is an |
4778 | ellipsis. */ | |
4779 | if (!second_parm) | |
4780 | continue; | |
dbc957f1 MM |
4781 | /* Otherwise, if we have a two-argument function and the second |
4782 | argument is `size_t', it will be the usual deallocation | |
4783 | function -- unless there is one-argument function, too. */ | |
4784 | if (TREE_CHAIN (second_parm) == void_list_node | |
c79154c4 | 4785 | && same_type_p (TREE_VALUE (second_parm), size_type_node)) |
dbc957f1 MM |
4786 | has_two_argument_delete_p = true; |
4787 | } | |
4788 | ||
4789 | return has_two_argument_delete_p; | |
4790 | } | |
4791 | ||
3b49d762 GDR |
4792 | /* Finish computing the `literal type' property of class type T. |
4793 | ||
4794 | At this point, we have already processed base classes and | |
4795 | non-static data members. We need to check whether the copy | |
4796 | constructor is trivial, the destructor is trivial, and there | |
4797 | is a trivial default constructor or at least one constexpr | |
4798 | constructor other than the copy constructor. */ | |
4799 | ||
4800 | static void | |
4801 | finalize_literal_type_property (tree t) | |
4802 | { | |
0515f4d2 JM |
4803 | tree fn; |
4804 | ||
3b49d762 | 4805 | if (cxx_dialect < cxx0x |
b198484e | 4806 | || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) |
3b49d762 GDR |
4807 | CLASSTYPE_LITERAL_P (t) = false; |
4808 | else if (CLASSTYPE_LITERAL_P (t) && !TYPE_HAS_TRIVIAL_DFLT (t) | |
b198484e | 4809 | && CLASSTYPE_NON_AGGREGATE (t) |
3b49d762 GDR |
4810 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) |
4811 | CLASSTYPE_LITERAL_P (t) = false; | |
0515f4d2 JM |
4812 | |
4813 | if (!CLASSTYPE_LITERAL_P (t)) | |
4814 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) | |
4815 | if (DECL_DECLARED_CONSTEXPR_P (fn) | |
4816 | && TREE_CODE (fn) != TEMPLATE_DECL | |
4817 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) | |
4818 | && !DECL_CONSTRUCTOR_P (fn)) | |
4819 | { | |
4820 | DECL_DECLARED_CONSTEXPR_P (fn) = false; | |
b432106b | 4821 | if (!DECL_GENERATED_P (fn)) |
f732fa7b JM |
4822 | { |
4823 | error ("enclosing class of constexpr non-static member " | |
4824 | "function %q+#D is not a literal type", fn); | |
4825 | explain_non_literal_class (t); | |
4826 | } | |
0515f4d2 | 4827 | } |
3b49d762 GDR |
4828 | } |
4829 | ||
f732fa7b JM |
4830 | /* T is a non-literal type used in a context which requires a constant |
4831 | expression. Explain why it isn't literal. */ | |
4832 | ||
4833 | void | |
4834 | explain_non_literal_class (tree t) | |
4835 | { | |
4836 | static struct pointer_set_t *diagnosed; | |
4837 | ||
4838 | if (!CLASS_TYPE_P (t)) | |
4839 | return; | |
4840 | t = TYPE_MAIN_VARIANT (t); | |
4841 | ||
4842 | if (diagnosed == NULL) | |
4843 | diagnosed = pointer_set_create (); | |
4844 | if (pointer_set_insert (diagnosed, t) != 0) | |
4845 | /* Already explained. */ | |
4846 | return; | |
4847 | ||
4848 | inform (0, "%q+T is not literal because:", t); | |
4849 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)) | |
4850 | inform (0, " %q+T has a non-trivial destructor", t); | |
4851 | else if (CLASSTYPE_NON_AGGREGATE (t) | |
4852 | && !TYPE_HAS_TRIVIAL_DFLT (t) | |
4853 | && !TYPE_HAS_CONSTEXPR_CTOR (t)) | |
fd3faf2b JM |
4854 | { |
4855 | inform (0, " %q+T is not an aggregate, does not have a trivial " | |
4856 | "default constructor, and has no constexpr constructor that " | |
4857 | "is not a copy or move constructor", t); | |
4858 | if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t) | |
4859 | && !type_has_user_provided_default_constructor (t)) | |
4860 | explain_invalid_constexpr_fn (locate_ctor (t)); | |
4861 | } | |
f732fa7b JM |
4862 | else |
4863 | { | |
4864 | tree binfo, base_binfo, field; int i; | |
4865 | for (binfo = TYPE_BINFO (t), i = 0; | |
4866 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
4867 | { | |
4868 | tree basetype = TREE_TYPE (base_binfo); | |
4869 | if (!CLASSTYPE_LITERAL_P (basetype)) | |
4870 | { | |
4871 | inform (0, " base class %qT of %q+T is non-literal", | |
4872 | basetype, t); | |
4873 | explain_non_literal_class (basetype); | |
4874 | return; | |
4875 | } | |
4876 | } | |
4877 | for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field)) | |
4878 | { | |
4879 | tree ftype; | |
4880 | if (TREE_CODE (field) != FIELD_DECL) | |
4881 | continue; | |
4882 | ftype = TREE_TYPE (field); | |
4883 | if (!literal_type_p (ftype)) | |
4884 | { | |
4885 | inform (0, " non-static data member %q+D has " | |
4886 | "non-literal type", field); | |
4887 | if (CLASS_TYPE_P (ftype)) | |
4888 | explain_non_literal_class (ftype); | |
4889 | } | |
4890 | } | |
4891 | } | |
4892 | } | |
4893 | ||
607cf131 MM |
4894 | /* Check the validity of the bases and members declared in T. Add any |
4895 | implicitly-generated functions (like copy-constructors and | |
4896 | assignment operators). Compute various flag bits (like | |
c32097d8 | 4897 | CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++ |
607cf131 MM |
4898 | level: i.e., independently of the ABI in use. */ |
4899 | ||
4900 | static void | |
58731fd1 | 4901 | check_bases_and_members (tree t) |
607cf131 | 4902 | { |
607cf131 MM |
4903 | /* Nonzero if the implicitly generated copy constructor should take |
4904 | a non-const reference argument. */ | |
4905 | int cant_have_const_ctor; | |
78dcd41a | 4906 | /* Nonzero if the implicitly generated assignment operator |
607cf131 MM |
4907 | should take a non-const reference argument. */ |
4908 | int no_const_asn_ref; | |
4909 | tree access_decls; | |
b87d79e6 JM |
4910 | bool saved_complex_asn_ref; |
4911 | bool saved_nontrivial_dtor; | |
20f2653e | 4912 | tree fn; |
607cf131 MM |
4913 | |
4914 | /* By default, we use const reference arguments and generate default | |
4915 | constructors. */ | |
607cf131 MM |
4916 | cant_have_const_ctor = 0; |
4917 | no_const_asn_ref = 0; | |
4918 | ||
00a17e31 | 4919 | /* Check all the base-classes. */ |
e5e459bf | 4920 | check_bases (t, &cant_have_const_ctor, |
10746f37 | 4921 | &no_const_asn_ref); |
607cf131 | 4922 | |
9f4faeae MM |
4923 | /* Check all the method declarations. */ |
4924 | check_methods (t); | |
4925 | ||
b87d79e6 JM |
4926 | /* Save the initial values of these flags which only indicate whether |
4927 | or not the class has user-provided functions. As we analyze the | |
4928 | bases and members we can set these flags for other reasons. */ | |
066ec0a4 | 4929 | saved_complex_asn_ref = TYPE_HAS_COMPLEX_COPY_ASSIGN (t); |
b87d79e6 JM |
4930 | saved_nontrivial_dtor = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t); |
4931 | ||
9f4faeae MM |
4932 | /* Check all the data member declarations. We cannot call |
4933 | check_field_decls until we have called check_bases check_methods, | |
4934 | as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR | |
4935 | being set appropriately. */ | |
58731fd1 | 4936 | check_field_decls (t, &access_decls, |
607cf131 | 4937 | &cant_have_const_ctor, |
10746f37 | 4938 | &no_const_asn_ref); |
607cf131 | 4939 | |
bbd15aac MM |
4940 | /* A nearly-empty class has to be vptr-containing; a nearly empty |
4941 | class contains just a vptr. */ | |
4942 | if (!TYPE_CONTAINS_VPTR_P (t)) | |
f9c528ea MM |
4943 | CLASSTYPE_NEARLY_EMPTY_P (t) = 0; |
4944 | ||
607cf131 MM |
4945 | /* Do some bookkeeping that will guide the generation of implicitly |
4946 | declared member functions. */ | |
066ec0a4 | 4947 | TYPE_HAS_COMPLEX_COPY_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 4948 | TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t); |
0fcedd9c | 4949 | /* We need to call a constructor for this class if it has a |
b87d79e6 | 4950 | user-provided constructor, or if the default constructor is going |
0fcedd9c JM |
4951 | to initialize the vptr. (This is not an if-and-only-if; |
4952 | TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members | |
4953 | themselves need constructing.) */ | |
607cf131 | 4954 | TYPE_NEEDS_CONSTRUCTING (t) |
b87d79e6 | 4955 | |= (type_has_user_provided_constructor (t) || TYPE_CONTAINS_VPTR_P (t)); |
0fcedd9c JM |
4956 | /* [dcl.init.aggr] |
4957 | ||
b87d79e6 | 4958 | An aggregate is an array or a class with no user-provided |
0fcedd9c JM |
4959 | constructors ... and no virtual functions. |
4960 | ||
4961 | Again, other conditions for being an aggregate are checked | |
4962 | elsewhere. */ | |
5775a06a | 4963 | CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 4964 | |= (type_has_user_provided_constructor (t) || TYPE_POLYMORPHIC_P (t)); |
c32097d8 JM |
4965 | /* This is the C++98/03 definition of POD; it changed in C++0x, but we |
4966 | retain the old definition internally for ABI reasons. */ | |
4967 | CLASSTYPE_NON_LAYOUT_POD_P (t) | |
c8094d83 | 4968 | |= (CLASSTYPE_NON_AGGREGATE (t) |
b87d79e6 | 4969 | || saved_nontrivial_dtor || saved_complex_asn_ref); |
c32097d8 | 4970 | CLASSTYPE_NON_STD_LAYOUT (t) |= TYPE_CONTAINS_VPTR_P (t); |
066ec0a4 | 4971 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
ac177431 | 4972 | TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t); |
f782c65c | 4973 | TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_CONTAINS_VPTR_P (t); |
607cf131 | 4974 | |
0fcedd9c JM |
4975 | /* If the class has no user-declared constructor, but does have |
4976 | non-static const or reference data members that can never be | |
4977 | initialized, issue a warning. */ | |
c73d5dd9 | 4978 | if (warn_uninitialized |
0fcedd9c JM |
4979 | /* Classes with user-declared constructors are presumed to |
4980 | initialize these members. */ | |
4981 | && !TYPE_HAS_USER_CONSTRUCTOR (t) | |
4982 | /* Aggregates can be initialized with brace-enclosed | |
4983 | initializers. */ | |
4984 | && CLASSTYPE_NON_AGGREGATE (t)) | |
4985 | { | |
4986 | tree field; | |
4987 | ||
910ad8de | 4988 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
0fcedd9c JM |
4989 | { |
4990 | tree type; | |
4991 | ||
4992 | if (TREE_CODE (field) != FIELD_DECL) | |
4993 | continue; | |
4994 | ||
4995 | type = TREE_TYPE (field); | |
4996 | if (TREE_CODE (type) == REFERENCE_TYPE) | |
c73d5dd9 MLI |
4997 | warning (OPT_Wuninitialized, "non-static reference %q+#D " |
4998 | "in class without a constructor", field); | |
0fcedd9c JM |
4999 | else if (CP_TYPE_CONST_P (type) |
5000 | && (!CLASS_TYPE_P (type) | |
5001 | || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type))) | |
c73d5dd9 MLI |
5002 | warning (OPT_Wuninitialized, "non-static const member %q+#D " |
5003 | "in class without a constructor", field); | |
0fcedd9c JM |
5004 | } |
5005 | } | |
5006 | ||
03fd3f84 | 5007 | /* Synthesize any needed methods. */ |
e5e459bf | 5008 | add_implicitly_declared_members (t, |
607cf131 | 5009 | cant_have_const_ctor, |
10746f37 | 5010 | no_const_asn_ref); |
607cf131 | 5011 | |
20f2653e JM |
5012 | /* Check defaulted declarations here so we have cant_have_const_ctor |
5013 | and don't need to worry about clones. */ | |
910ad8de | 5014 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
20f2653e JM |
5015 | if (DECL_DEFAULTED_IN_CLASS_P (fn)) |
5016 | { | |
5017 | int copy = copy_fn_p (fn); | |
5018 | if (copy > 0) | |
5019 | { | |
5020 | bool imp_const_p | |
5021 | = (DECL_CONSTRUCTOR_P (fn) ? !cant_have_const_ctor | |
5022 | : !no_const_asn_ref); | |
5023 | bool fn_const_p = (copy == 2); | |
5024 | ||
5025 | if (fn_const_p && !imp_const_p) | |
5026 | /* If the function is defaulted outside the class, we just | |
5027 | give the synthesis error. */ | |
5028 | error ("%q+D declared to take const reference, but implicit " | |
5029 | "declaration would take non-const", fn); | |
5030 | else if (imp_const_p && !fn_const_p) | |
5031 | error ("%q+D declared to take non-const reference cannot be " | |
5032 | "defaulted in the class body", fn); | |
5033 | } | |
5034 | defaulted_late_check (fn); | |
5035 | } | |
5036 | ||
d5f4eddd JM |
5037 | if (LAMBDA_TYPE_P (t)) |
5038 | { | |
5039 | /* "The closure type associated with a lambda-expression has a deleted | |
5040 | default constructor and a deleted copy assignment operator." */ | |
5041 | TYPE_NEEDS_CONSTRUCTING (t) = 1; | |
54ca9930 JM |
5042 | TYPE_HAS_COMPLEX_DFLT (t) = 1; |
5043 | TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1; | |
5044 | CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 0; | |
d5f4eddd JM |
5045 | |
5046 | /* "This class type is not an aggregate." */ | |
5047 | CLASSTYPE_NON_AGGREGATE (t) = 1; | |
5048 | } | |
5049 | ||
3b49d762 GDR |
5050 | /* Compute the 'literal type' property before we |
5051 | do anything with non-static member functions. */ | |
5052 | finalize_literal_type_property (t); | |
5053 | ||
db9b2174 MM |
5054 | /* Create the in-charge and not-in-charge variants of constructors |
5055 | and destructors. */ | |
5056 | clone_constructors_and_destructors (t); | |
5057 | ||
aa52c1ff JM |
5058 | /* Process the using-declarations. */ |
5059 | for (; access_decls; access_decls = TREE_CHAIN (access_decls)) | |
5060 | handle_using_decl (TREE_VALUE (access_decls), t); | |
5061 | ||
607cf131 MM |
5062 | /* Build and sort the CLASSTYPE_METHOD_VEC. */ |
5063 | finish_struct_methods (t); | |
dbc957f1 MM |
5064 | |
5065 | /* Figure out whether or not we will need a cookie when dynamically | |
5066 | allocating an array of this type. */ | |
e2500fed | 5067 | TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie |
dbc957f1 | 5068 | = type_requires_array_cookie (t); |
607cf131 MM |
5069 | } |
5070 | ||
3ef397c1 | 5071 | /* If T needs a pointer to its virtual function table, set TYPE_VFIELD |
5c24fba6 MM |
5072 | accordingly. If a new vfield was created (because T doesn't have a |
5073 | primary base class), then the newly created field is returned. It | |
c35cce41 | 5074 | is not added to the TYPE_FIELDS list; it is the caller's |
e6858a84 NS |
5075 | responsibility to do that. Accumulate declared virtual functions |
5076 | on VIRTUALS_P. */ | |
3ef397c1 | 5077 | |
5c24fba6 | 5078 | static tree |
94edc4ab | 5079 | create_vtable_ptr (tree t, tree* virtuals_p) |
3ef397c1 MM |
5080 | { |
5081 | tree fn; | |
5082 | ||
e6858a84 | 5083 | /* Collect the virtual functions declared in T. */ |
910ad8de | 5084 | for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn)) |
e6858a84 NS |
5085 | if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn) |
5086 | && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST) | |
5087 | { | |
5088 | tree new_virtual = make_node (TREE_LIST); | |
c8094d83 | 5089 | |
e6858a84 NS |
5090 | BV_FN (new_virtual) = fn; |
5091 | BV_DELTA (new_virtual) = integer_zero_node; | |
d1f05f93 | 5092 | BV_VCALL_INDEX (new_virtual) = NULL_TREE; |
3ef397c1 | 5093 | |
e6858a84 NS |
5094 | TREE_CHAIN (new_virtual) = *virtuals_p; |
5095 | *virtuals_p = new_virtual; | |
5096 | } | |
c8094d83 | 5097 | |
da3d4dfa MM |
5098 | /* If we couldn't find an appropriate base class, create a new field |
5099 | here. Even if there weren't any new virtual functions, we might need a | |
bbd15aac MM |
5100 | new virtual function table if we're supposed to include vptrs in |
5101 | all classes that need them. */ | |
e6858a84 | 5102 | if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t))) |
3ef397c1 MM |
5103 | { |
5104 | /* We build this decl with vtbl_ptr_type_node, which is a | |
5105 | `vtable_entry_type*'. It might seem more precise to use | |
a692ad2e | 5106 | `vtable_entry_type (*)[N]' where N is the number of virtual |
3ef397c1 MM |
5107 | functions. However, that would require the vtable pointer in |
5108 | base classes to have a different type than the vtable pointer | |
5109 | in derived classes. We could make that happen, but that | |
5110 | still wouldn't solve all the problems. In particular, the | |
5111 | type-based alias analysis code would decide that assignments | |
5112 | to the base class vtable pointer can't alias assignments to | |
5113 | the derived class vtable pointer, since they have different | |
4639c5c6 | 5114 | types. Thus, in a derived class destructor, where the base |
3ef397c1 | 5115 | class constructor was inlined, we could generate bad code for |
c8094d83 | 5116 | setting up the vtable pointer. |
3ef397c1 | 5117 | |
0cbd7506 | 5118 | Therefore, we use one type for all vtable pointers. We still |
3ef397c1 MM |
5119 | use a type-correct type; it's just doesn't indicate the array |
5120 | bounds. That's better than using `void*' or some such; it's | |
5121 | cleaner, and it let's the alias analysis code know that these | |
5122 | stores cannot alias stores to void*! */ | |
0abe00c5 NS |
5123 | tree field; |
5124 | ||
c2255bc4 AH |
5125 | field = build_decl (input_location, |
5126 | FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node); | |
0abe00c5 NS |
5127 | DECL_VIRTUAL_P (field) = 1; |
5128 | DECL_ARTIFICIAL (field) = 1; | |
5129 | DECL_FIELD_CONTEXT (field) = t; | |
5130 | DECL_FCONTEXT (field) = t; | |
7c08df6c JM |
5131 | if (TYPE_PACKED (t)) |
5132 | DECL_PACKED (field) = 1; | |
c8094d83 | 5133 | |
0abe00c5 | 5134 | TYPE_VFIELD (t) = field; |
c8094d83 | 5135 | |
0abe00c5 | 5136 | /* This class is non-empty. */ |
58731fd1 | 5137 | CLASSTYPE_EMPTY_P (t) = 0; |
3ef397c1 | 5138 | |
0abe00c5 | 5139 | return field; |
3ef397c1 | 5140 | } |
5c24fba6 MM |
5141 | |
5142 | return NULL_TREE; | |
3ef397c1 MM |
5143 | } |
5144 | ||
9d4c0187 MM |
5145 | /* Add OFFSET to all base types of BINFO which is a base in the |
5146 | hierarchy dominated by T. | |
80fd5f48 | 5147 | |
911a71a7 | 5148 | OFFSET, which is a type offset, is number of bytes. */ |
80fd5f48 MM |
5149 | |
5150 | static void | |
dbbf88d1 | 5151 | propagate_binfo_offsets (tree binfo, tree offset) |
80fd5f48 | 5152 | { |
911a71a7 MM |
5153 | int i; |
5154 | tree primary_binfo; | |
fa743e8c | 5155 | tree base_binfo; |
80fd5f48 | 5156 | |
911a71a7 MM |
5157 | /* Update BINFO's offset. */ |
5158 | BINFO_OFFSET (binfo) | |
c8094d83 | 5159 | = convert (sizetype, |
911a71a7 MM |
5160 | size_binop (PLUS_EXPR, |
5161 | convert (ssizetype, BINFO_OFFSET (binfo)), | |
5162 | offset)); | |
80fd5f48 | 5163 | |
911a71a7 MM |
5164 | /* Find the primary base class. */ |
5165 | primary_binfo = get_primary_binfo (binfo); | |
5166 | ||
fc6633e0 | 5167 | if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo) |
090ad434 | 5168 | propagate_binfo_offsets (primary_binfo, offset); |
c8094d83 | 5169 | |
911a71a7 MM |
5170 | /* Scan all of the bases, pushing the BINFO_OFFSET adjust |
5171 | downwards. */ | |
fa743e8c | 5172 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
80fd5f48 | 5173 | { |
090ad434 NS |
5174 | /* Don't do the primary base twice. */ |
5175 | if (base_binfo == primary_binfo) | |
5176 | continue; | |
911a71a7 | 5177 | |
090ad434 | 5178 | if (BINFO_VIRTUAL_P (base_binfo)) |
911a71a7 MM |
5179 | continue; |
5180 | ||
dbbf88d1 | 5181 | propagate_binfo_offsets (base_binfo, offset); |
911a71a7 | 5182 | } |
9d4c0187 MM |
5183 | } |
5184 | ||
17bbb839 | 5185 | /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update |
c20118a8 MM |
5186 | TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of |
5187 | empty subobjects of T. */ | |
80fd5f48 | 5188 | |
d2c5305b | 5189 | static void |
17bbb839 | 5190 | layout_virtual_bases (record_layout_info rli, splay_tree offsets) |
80fd5f48 | 5191 | { |
dbbf88d1 | 5192 | tree vbase; |
17bbb839 | 5193 | tree t = rli->t; |
eca7f13c | 5194 | bool first_vbase = true; |
17bbb839 | 5195 | tree *next_field; |
9785e4b1 | 5196 | |
604a3205 | 5197 | if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0) |
9785e4b1 MM |
5198 | return; |
5199 | ||
17bbb839 MM |
5200 | if (!abi_version_at_least(2)) |
5201 | { | |
5202 | /* In G++ 3.2, we incorrectly rounded the size before laying out | |
5203 | the virtual bases. */ | |
5204 | finish_record_layout (rli, /*free_p=*/false); | |
9785e4b1 | 5205 | #ifdef STRUCTURE_SIZE_BOUNDARY |
17bbb839 MM |
5206 | /* Packed structures don't need to have minimum size. */ |
5207 | if (! TYPE_PACKED (t)) | |
fc555370 | 5208 | TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY); |
9785e4b1 | 5209 | #endif |
17bbb839 MM |
5210 | rli->offset = TYPE_SIZE_UNIT (t); |
5211 | rli->bitpos = bitsize_zero_node; | |
5212 | rli->record_align = TYPE_ALIGN (t); | |
5213 | } | |
80fd5f48 | 5214 | |
17bbb839 MM |
5215 | /* Find the last field. The artificial fields created for virtual |
5216 | bases will go after the last extant field to date. */ | |
5217 | next_field = &TYPE_FIELDS (t); | |
5218 | while (*next_field) | |
910ad8de | 5219 | next_field = &DECL_CHAIN (*next_field); |
80fd5f48 | 5220 | |
9d4c0187 | 5221 | /* Go through the virtual bases, allocating space for each virtual |
3461fba7 NS |
5222 | base that is not already a primary base class. These are |
5223 | allocated in inheritance graph order. */ | |
dbbf88d1 | 5224 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) |
c35cce41 | 5225 | { |
809e3e7f | 5226 | if (!BINFO_VIRTUAL_P (vbase)) |
1f84ec23 | 5227 | continue; |
eca7f13c | 5228 | |
9965d119 | 5229 | if (!BINFO_PRIMARY_P (vbase)) |
c35cce41 | 5230 | { |
17bbb839 MM |
5231 | tree basetype = TREE_TYPE (vbase); |
5232 | ||
c35cce41 MM |
5233 | /* This virtual base is not a primary base of any class in the |
5234 | hierarchy, so we have to add space for it. */ | |
58731fd1 | 5235 | next_field = build_base_field (rli, vbase, |
17bbb839 | 5236 | offsets, next_field); |
9785e4b1 | 5237 | |
eca7f13c MM |
5238 | /* If the first virtual base might have been placed at a |
5239 | lower address, had we started from CLASSTYPE_SIZE, rather | |
5240 | than TYPE_SIZE, issue a warning. There can be both false | |
5241 | positives and false negatives from this warning in rare | |
5242 | cases; to deal with all the possibilities would probably | |
5243 | require performing both layout algorithms and comparing | |
5244 | the results which is not particularly tractable. */ | |
5245 | if (warn_abi | |
5246 | && first_vbase | |
c8094d83 | 5247 | && (tree_int_cst_lt |
17bbb839 | 5248 | (size_binop (CEIL_DIV_EXPR, |
db3927fb AH |
5249 | round_up_loc (input_location, |
5250 | CLASSTYPE_SIZE (t), | |
17bbb839 MM |
5251 | CLASSTYPE_ALIGN (basetype)), |
5252 | bitsize_unit_node), | |
5253 | BINFO_OFFSET (vbase)))) | |
74fa0285 | 5254 | warning (OPT_Wabi, |
3db45ab5 | 5255 | "offset of virtual base %qT is not ABI-compliant and " |
0cbd7506 | 5256 | "may change in a future version of GCC", |
eca7f13c MM |
5257 | basetype); |
5258 | ||
eca7f13c | 5259 | first_vbase = false; |
c35cce41 MM |
5260 | } |
5261 | } | |
80fd5f48 MM |
5262 | } |
5263 | ||
ba9a991f MM |
5264 | /* Returns the offset of the byte just past the end of the base class |
5265 | BINFO. */ | |
5266 | ||
5267 | static tree | |
5268 | end_of_base (tree binfo) | |
5269 | { | |
5270 | tree size; | |
5271 | ||
1ad8aeeb DG |
5272 | if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo))) |
5273 | size = TYPE_SIZE_UNIT (char_type_node); | |
5274 | else if (is_empty_class (BINFO_TYPE (binfo))) | |
ba9a991f MM |
5275 | /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to |
5276 | allocate some space for it. It cannot have virtual bases, so | |
5277 | TYPE_SIZE_UNIT is fine. */ | |
5278 | size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5279 | else | |
5280 | size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo)); | |
5281 | ||
5282 | return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size); | |
5283 | } | |
5284 | ||
9785e4b1 MM |
5285 | /* Returns the offset of the byte just past the end of the base class |
5286 | with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then | |
5287 | only non-virtual bases are included. */ | |
80fd5f48 | 5288 | |
17bbb839 | 5289 | static tree |
94edc4ab | 5290 | end_of_class (tree t, int include_virtuals_p) |
80fd5f48 | 5291 | { |
17bbb839 | 5292 | tree result = size_zero_node; |
d4e6fecb | 5293 | VEC(tree,gc) *vbases; |
ba9a991f | 5294 | tree binfo; |
9ba5ff0f | 5295 | tree base_binfo; |
ba9a991f | 5296 | tree offset; |
9785e4b1 | 5297 | int i; |
80fd5f48 | 5298 | |
fa743e8c NS |
5299 | for (binfo = TYPE_BINFO (t), i = 0; |
5300 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
9785e4b1 | 5301 | { |
9785e4b1 | 5302 | if (!include_virtuals_p |
fc6633e0 NS |
5303 | && BINFO_VIRTUAL_P (base_binfo) |
5304 | && (!BINFO_PRIMARY_P (base_binfo) | |
5305 | || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t))) | |
9785e4b1 | 5306 | continue; |
80fd5f48 | 5307 | |
fa743e8c | 5308 | offset = end_of_base (base_binfo); |
17bbb839 MM |
5309 | if (INT_CST_LT_UNSIGNED (result, offset)) |
5310 | result = offset; | |
9785e4b1 | 5311 | } |
80fd5f48 | 5312 | |
ba9a991f MM |
5313 | /* G++ 3.2 did not check indirect virtual bases. */ |
5314 | if (abi_version_at_least (2) && include_virtuals_p) | |
9ba5ff0f NS |
5315 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
5316 | VEC_iterate (tree, vbases, i, base_binfo); i++) | |
ba9a991f | 5317 | { |
9ba5ff0f | 5318 | offset = end_of_base (base_binfo); |
ba9a991f MM |
5319 | if (INT_CST_LT_UNSIGNED (result, offset)) |
5320 | result = offset; | |
5321 | } | |
5322 | ||
9785e4b1 | 5323 | return result; |
80fd5f48 MM |
5324 | } |
5325 | ||
17bbb839 | 5326 | /* Warn about bases of T that are inaccessible because they are |
78b45a24 MM |
5327 | ambiguous. For example: |
5328 | ||
5329 | struct S {}; | |
5330 | struct T : public S {}; | |
5331 | struct U : public S, public T {}; | |
5332 | ||
5333 | Here, `(S*) new U' is not allowed because there are two `S' | |
5334 | subobjects of U. */ | |
5335 | ||
5336 | static void | |
94edc4ab | 5337 | warn_about_ambiguous_bases (tree t) |
78b45a24 MM |
5338 | { |
5339 | int i; | |
d4e6fecb | 5340 | VEC(tree,gc) *vbases; |
17bbb839 | 5341 | tree basetype; |
58c42dc2 | 5342 | tree binfo; |
fa743e8c | 5343 | tree base_binfo; |
78b45a24 | 5344 | |
18e4be85 NS |
5345 | /* If there are no repeated bases, nothing can be ambiguous. */ |
5346 | if (!CLASSTYPE_REPEATED_BASE_P (t)) | |
5347 | return; | |
c8094d83 | 5348 | |
17bbb839 | 5349 | /* Check direct bases. */ |
fa743e8c NS |
5350 | for (binfo = TYPE_BINFO (t), i = 0; |
5351 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
78b45a24 | 5352 | { |
fa743e8c | 5353 | basetype = BINFO_TYPE (base_binfo); |
78b45a24 | 5354 | |
18e4be85 | 5355 | if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL)) |
d4ee4d25 | 5356 | warning (0, "direct base %qT inaccessible in %qT due to ambiguity", |
17bbb839 | 5357 | basetype, t); |
78b45a24 | 5358 | } |
17bbb839 MM |
5359 | |
5360 | /* Check for ambiguous virtual bases. */ | |
5361 | if (extra_warnings) | |
9ba5ff0f NS |
5362 | for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; |
5363 | VEC_iterate (tree, vbases, i, binfo); i++) | |
17bbb839 | 5364 | { |
58c42dc2 | 5365 | basetype = BINFO_TYPE (binfo); |
c8094d83 | 5366 | |
18e4be85 | 5367 | if (!lookup_base (t, basetype, ba_unique | ba_quiet, NULL)) |
b323323f | 5368 | warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due to ambiguity", |
17bbb839 MM |
5369 | basetype, t); |
5370 | } | |
78b45a24 MM |
5371 | } |
5372 | ||
c20118a8 MM |
5373 | /* Compare two INTEGER_CSTs K1 and K2. */ |
5374 | ||
5375 | static int | |
94edc4ab | 5376 | splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2) |
c20118a8 MM |
5377 | { |
5378 | return tree_int_cst_compare ((tree) k1, (tree) k2); | |
5379 | } | |
5380 | ||
17bbb839 MM |
5381 | /* Increase the size indicated in RLI to account for empty classes |
5382 | that are "off the end" of the class. */ | |
5383 | ||
5384 | static void | |
5385 | include_empty_classes (record_layout_info rli) | |
5386 | { | |
5387 | tree eoc; | |
e3ccdd50 | 5388 | tree rli_size; |
17bbb839 MM |
5389 | |
5390 | /* It might be the case that we grew the class to allocate a | |
5391 | zero-sized base class. That won't be reflected in RLI, yet, | |
5392 | because we are willing to overlay multiple bases at the same | |
5393 | offset. However, now we need to make sure that RLI is big enough | |
5394 | to reflect the entire class. */ | |
c8094d83 | 5395 | eoc = end_of_class (rli->t, |
17bbb839 | 5396 | CLASSTYPE_AS_BASE (rli->t) != NULL_TREE); |
e3ccdd50 MM |
5397 | rli_size = rli_size_unit_so_far (rli); |
5398 | if (TREE_CODE (rli_size) == INTEGER_CST | |
5399 | && INT_CST_LT_UNSIGNED (rli_size, eoc)) | |
17bbb839 | 5400 | { |
43fe31f6 MM |
5401 | if (!abi_version_at_least (2)) |
5402 | /* In version 1 of the ABI, the size of a class that ends with | |
5403 | a bitfield was not rounded up to a whole multiple of a | |
5404 | byte. Because rli_size_unit_so_far returns only the number | |
5405 | of fully allocated bytes, any extra bits were not included | |
5406 | in the size. */ | |
5407 | rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT); | |
5408 | else | |
5409 | /* The size should have been rounded to a whole byte. */ | |
50bc768d NS |
5410 | gcc_assert (tree_int_cst_equal |
5411 | (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT))); | |
c8094d83 MS |
5412 | rli->bitpos |
5413 | = size_binop (PLUS_EXPR, | |
e3ccdd50 MM |
5414 | rli->bitpos, |
5415 | size_binop (MULT_EXPR, | |
5416 | convert (bitsizetype, | |
5417 | size_binop (MINUS_EXPR, | |
5418 | eoc, rli_size)), | |
5419 | bitsize_int (BITS_PER_UNIT))); | |
5420 | normalize_rli (rli); | |
17bbb839 MM |
5421 | } |
5422 | } | |
5423 | ||
2ef16140 MM |
5424 | /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate |
5425 | BINFO_OFFSETs for all of the base-classes. Position the vtable | |
00a17e31 | 5426 | pointer. Accumulate declared virtual functions on VIRTUALS_P. */ |
607cf131 | 5427 | |
2ef16140 | 5428 | static void |
e93ee644 | 5429 | layout_class_type (tree t, tree *virtuals_p) |
2ef16140 | 5430 | { |
5c24fba6 MM |
5431 | tree non_static_data_members; |
5432 | tree field; | |
5433 | tree vptr; | |
5434 | record_layout_info rli; | |
c20118a8 MM |
5435 | /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of |
5436 | types that appear at that offset. */ | |
5437 | splay_tree empty_base_offsets; | |
eca7f13c MM |
5438 | /* True if the last field layed out was a bit-field. */ |
5439 | bool last_field_was_bitfield = false; | |
17bbb839 MM |
5440 | /* The location at which the next field should be inserted. */ |
5441 | tree *next_field; | |
5442 | /* T, as a base class. */ | |
5443 | tree base_t; | |
5c24fba6 MM |
5444 | |
5445 | /* Keep track of the first non-static data member. */ | |
5446 | non_static_data_members = TYPE_FIELDS (t); | |
5447 | ||
770ae6cc RK |
5448 | /* Start laying out the record. */ |
5449 | rli = start_record_layout (t); | |
534170eb | 5450 | |
fc6633e0 NS |
5451 | /* Mark all the primary bases in the hierarchy. */ |
5452 | determine_primary_bases (t); | |
8026246f | 5453 | |
5c24fba6 | 5454 | /* Create a pointer to our virtual function table. */ |
58731fd1 | 5455 | vptr = create_vtable_ptr (t, virtuals_p); |
5c24fba6 | 5456 | |
3461fba7 | 5457 | /* The vptr is always the first thing in the class. */ |
1f84ec23 | 5458 | if (vptr) |
5c24fba6 | 5459 | { |
910ad8de | 5460 | DECL_CHAIN (vptr) = TYPE_FIELDS (t); |
17bbb839 | 5461 | TYPE_FIELDS (t) = vptr; |
910ad8de | 5462 | next_field = &DECL_CHAIN (vptr); |
770ae6cc | 5463 | place_field (rli, vptr); |
5c24fba6 | 5464 | } |
17bbb839 MM |
5465 | else |
5466 | next_field = &TYPE_FIELDS (t); | |
5c24fba6 | 5467 | |
72a50ab0 | 5468 | /* Build FIELD_DECLs for all of the non-virtual base-types. */ |
c8094d83 | 5469 | empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts, |
c20118a8 | 5470 | NULL, NULL); |
58731fd1 | 5471 | build_base_fields (rli, empty_base_offsets, next_field); |
c8094d83 | 5472 | |
5c24fba6 | 5473 | /* Layout the non-static data members. */ |
910ad8de | 5474 | for (field = non_static_data_members; field; field = DECL_CHAIN (field)) |
5c24fba6 | 5475 | { |
01955e96 MM |
5476 | tree type; |
5477 | tree padding; | |
5c24fba6 MM |
5478 | |
5479 | /* We still pass things that aren't non-static data members to | |
3b426391 | 5480 | the back end, in case it wants to do something with them. */ |
5c24fba6 MM |
5481 | if (TREE_CODE (field) != FIELD_DECL) |
5482 | { | |
770ae6cc | 5483 | place_field (rli, field); |
0154eaa8 | 5484 | /* If the static data member has incomplete type, keep track |
c8094d83 | 5485 | of it so that it can be completed later. (The handling |
0154eaa8 MM |
5486 | of pending statics in finish_record_layout is |
5487 | insufficient; consider: | |
5488 | ||
5489 | struct S1; | |
5490 | struct S2 { static S1 s1; }; | |
c8094d83 | 5491 | |
0cbd7506 | 5492 | At this point, finish_record_layout will be called, but |
0154eaa8 MM |
5493 | S1 is still incomplete.) */ |
5494 | if (TREE_CODE (field) == VAR_DECL) | |
532b37d9 MM |
5495 | { |
5496 | maybe_register_incomplete_var (field); | |
5497 | /* The visibility of static data members is determined | |
5498 | at their point of declaration, not their point of | |
5499 | definition. */ | |
5500 | determine_visibility (field); | |
5501 | } | |
5c24fba6 MM |
5502 | continue; |
5503 | } | |
5504 | ||
01955e96 | 5505 | type = TREE_TYPE (field); |
4e3bd7d5 VR |
5506 | if (type == error_mark_node) |
5507 | continue; | |
c8094d83 | 5508 | |
1e099144 | 5509 | padding = NULL_TREE; |
01955e96 MM |
5510 | |
5511 | /* If this field is a bit-field whose width is greater than its | |
3461fba7 NS |
5512 | type, then there are some special rules for allocating |
5513 | it. */ | |
01955e96 | 5514 | if (DECL_C_BIT_FIELD (field) |
1f84ec23 | 5515 | && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field))) |
01955e96 | 5516 | { |
09639a83 | 5517 | unsigned int itk; |
01955e96 | 5518 | tree integer_type; |
555456b1 | 5519 | bool was_unnamed_p = false; |
01955e96 MM |
5520 | /* We must allocate the bits as if suitably aligned for the |
5521 | longest integer type that fits in this many bits. type | |
5522 | of the field. Then, we are supposed to use the left over | |
5523 | bits as additional padding. */ | |
5524 | for (itk = itk_char; itk != itk_none; ++itk) | |
64c31785 | 5525 | if (integer_types[itk] != NULL_TREE |
1c314335 L |
5526 | && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE), |
5527 | TYPE_SIZE (integer_types[itk])) | |
5528 | || INT_CST_LT (DECL_SIZE (field), | |
5529 | TYPE_SIZE (integer_types[itk])))) | |
01955e96 MM |
5530 | break; |
5531 | ||
5532 | /* ITK now indicates a type that is too large for the | |
5533 | field. We have to back up by one to find the largest | |
5534 | type that fits. */ | |
64c31785 KT |
5535 | do |
5536 | { | |
5537 | --itk; | |
5538 | integer_type = integer_types[itk]; | |
5539 | } while (itk > 0 && integer_type == NULL_TREE); | |
2d3e278d | 5540 | |
1e099144 MM |
5541 | /* Figure out how much additional padding is required. GCC |
5542 | 3.2 always created a padding field, even if it had zero | |
5543 | width. */ | |
5544 | if (!abi_version_at_least (2) | |
5545 | || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field))) | |
2d3e278d | 5546 | { |
1e099144 MM |
5547 | if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE) |
5548 | /* In a union, the padding field must have the full width | |
5549 | of the bit-field; all fields start at offset zero. */ | |
5550 | padding = DECL_SIZE (field); | |
5551 | else | |
5552 | { | |
74fa0285 GDR |
5553 | if (TREE_CODE (t) == UNION_TYPE) |
5554 | warning (OPT_Wabi, "size assigned to %qT may not be " | |
1e099144 | 5555 | "ABI-compliant and may change in a future " |
c8094d83 | 5556 | "version of GCC", |
1e099144 MM |
5557 | t); |
5558 | padding = size_binop (MINUS_EXPR, DECL_SIZE (field), | |
5559 | TYPE_SIZE (integer_type)); | |
5560 | } | |
2d3e278d | 5561 | } |
c9372112 | 5562 | #ifdef PCC_BITFIELD_TYPE_MATTERS |
63e5f567 MM |
5563 | /* An unnamed bitfield does not normally affect the |
5564 | alignment of the containing class on a target where | |
5565 | PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not | |
5566 | make any exceptions for unnamed bitfields when the | |
5567 | bitfields are longer than their types. Therefore, we | |
5568 | temporarily give the field a name. */ | |
5569 | if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field)) | |
5570 | { | |
5571 | was_unnamed_p = true; | |
5572 | DECL_NAME (field) = make_anon_name (); | |
5573 | } | |
c9372112 | 5574 | #endif |
01955e96 MM |
5575 | DECL_SIZE (field) = TYPE_SIZE (integer_type); |
5576 | DECL_ALIGN (field) = TYPE_ALIGN (integer_type); | |
11cf4d18 | 5577 | DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type); |
555456b1 MM |
5578 | layout_nonempty_base_or_field (rli, field, NULL_TREE, |
5579 | empty_base_offsets); | |
5580 | if (was_unnamed_p) | |
5581 | DECL_NAME (field) = NULL_TREE; | |
5582 | /* Now that layout has been performed, set the size of the | |
5583 | field to the size of its declared type; the rest of the | |
5584 | field is effectively invisible. */ | |
5585 | DECL_SIZE (field) = TYPE_SIZE (type); | |
29edb15c MM |
5586 | /* We must also reset the DECL_MODE of the field. */ |
5587 | if (abi_version_at_least (2)) | |
5588 | DECL_MODE (field) = TYPE_MODE (type); | |
5589 | else if (warn_abi | |
5590 | && DECL_MODE (field) != TYPE_MODE (type)) | |
5591 | /* Versions of G++ before G++ 3.4 did not reset the | |
5592 | DECL_MODE. */ | |
74fa0285 | 5593 | warning (OPT_Wabi, |
3db45ab5 | 5594 | "the offset of %qD may not be ABI-compliant and may " |
29edb15c | 5595 | "change in a future version of GCC", field); |
01955e96 | 5596 | } |
555456b1 MM |
5597 | else |
5598 | layout_nonempty_base_or_field (rli, field, NULL_TREE, | |
5599 | empty_base_offsets); | |
01955e96 | 5600 | |
2003cd37 MM |
5601 | /* Remember the location of any empty classes in FIELD. */ |
5602 | if (abi_version_at_least (2)) | |
c8094d83 | 5603 | record_subobject_offsets (TREE_TYPE (field), |
2003cd37 MM |
5604 | byte_position(field), |
5605 | empty_base_offsets, | |
c5a35c3c | 5606 | /*is_data_member=*/true); |
2003cd37 | 5607 | |
eca7f13c MM |
5608 | /* If a bit-field does not immediately follow another bit-field, |
5609 | and yet it starts in the middle of a byte, we have failed to | |
5610 | comply with the ABI. */ | |
5611 | if (warn_abi | |
c8094d83 | 5612 | && DECL_C_BIT_FIELD (field) |
660845bf ZL |
5613 | /* The TREE_NO_WARNING flag gets set by Objective-C when |
5614 | laying out an Objective-C class. The ObjC ABI differs | |
5615 | from the C++ ABI, and so we do not want a warning | |
5616 | here. */ | |
5617 | && !TREE_NO_WARNING (field) | |
eca7f13c MM |
5618 | && !last_field_was_bitfield |
5619 | && !integer_zerop (size_binop (TRUNC_MOD_EXPR, | |
5620 | DECL_FIELD_BIT_OFFSET (field), | |
5621 | bitsize_unit_node))) | |
74fa0285 | 5622 | warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may " |
dee15844 | 5623 | "change in a future version of GCC", field); |
eca7f13c | 5624 | |
956d9305 MM |
5625 | /* G++ used to use DECL_FIELD_OFFSET as if it were the byte |
5626 | offset of the field. */ | |
c8094d83 | 5627 | if (warn_abi |
254d1a5a | 5628 | && !abi_version_at_least (2) |
956d9305 MM |
5629 | && !tree_int_cst_equal (DECL_FIELD_OFFSET (field), |
5630 | byte_position (field)) | |
5631 | && contains_empty_class_p (TREE_TYPE (field))) | |
74fa0285 | 5632 | warning (OPT_Wabi, "%q+D contains empty classes which may cause base " |
dee15844 JM |
5633 | "classes to be placed at different locations in a " |
5634 | "future version of GCC", field); | |
956d9305 | 5635 | |
38a4afee MM |
5636 | /* The middle end uses the type of expressions to determine the |
5637 | possible range of expression values. In order to optimize | |
5638 | "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end | |
3db45ab5 | 5639 | must be made aware of the width of "i", via its type. |
38a4afee | 5640 | |
3db45ab5 | 5641 | Because C++ does not have integer types of arbitrary width, |
38a4afee MM |
5642 | we must (for the purposes of the front end) convert from the |
5643 | type assigned here to the declared type of the bitfield | |
5644 | whenever a bitfield expression is used as an rvalue. | |
5645 | Similarly, when assigning a value to a bitfield, the value | |
5646 | must be converted to the type given the bitfield here. */ | |
5647 | if (DECL_C_BIT_FIELD (field)) | |
5648 | { | |
38a4afee | 5649 | unsigned HOST_WIDE_INT width; |
24030e4c | 5650 | tree ftype = TREE_TYPE (field); |
38a4afee MM |
5651 | width = tree_low_cst (DECL_SIZE (field), /*unsignedp=*/1); |
5652 | if (width != TYPE_PRECISION (ftype)) | |
24030e4c JJ |
5653 | { |
5654 | TREE_TYPE (field) | |
5655 | = c_build_bitfield_integer_type (width, | |
5656 | TYPE_UNSIGNED (ftype)); | |
5657 | TREE_TYPE (field) | |
5658 | = cp_build_qualified_type (TREE_TYPE (field), | |
a3360e77 | 5659 | cp_type_quals (ftype)); |
24030e4c | 5660 | } |
38a4afee MM |
5661 | } |
5662 | ||
01955e96 MM |
5663 | /* If we needed additional padding after this field, add it |
5664 | now. */ | |
5665 | if (padding) | |
5666 | { | |
5667 | tree padding_field; | |
5668 | ||
c2255bc4 AH |
5669 | padding_field = build_decl (input_location, |
5670 | FIELD_DECL, | |
01955e96 | 5671 | NULL_TREE, |
c8094d83 | 5672 | char_type_node); |
01955e96 MM |
5673 | DECL_BIT_FIELD (padding_field) = 1; |
5674 | DECL_SIZE (padding_field) = padding; | |
1e099144 | 5675 | DECL_CONTEXT (padding_field) = t; |
ea258926 | 5676 | DECL_ARTIFICIAL (padding_field) = 1; |
78e0d62b | 5677 | DECL_IGNORED_P (padding_field) = 1; |
c20118a8 | 5678 | layout_nonempty_base_or_field (rli, padding_field, |
c8094d83 | 5679 | NULL_TREE, |
17bbb839 | 5680 | empty_base_offsets); |
01955e96 | 5681 | } |
eca7f13c MM |
5682 | |
5683 | last_field_was_bitfield = DECL_C_BIT_FIELD (field); | |
5c24fba6 MM |
5684 | } |
5685 | ||
17bbb839 | 5686 | if (abi_version_at_least (2) && !integer_zerop (rli->bitpos)) |
e3ccdd50 MM |
5687 | { |
5688 | /* Make sure that we are on a byte boundary so that the size of | |
5689 | the class without virtual bases will always be a round number | |
5690 | of bytes. */ | |
db3927fb | 5691 | rli->bitpos = round_up_loc (input_location, rli->bitpos, BITS_PER_UNIT); |
e3ccdd50 MM |
5692 | normalize_rli (rli); |
5693 | } | |
17bbb839 | 5694 | |
8a874cb4 MM |
5695 | /* G++ 3.2 does not allow virtual bases to be overlaid with tail |
5696 | padding. */ | |
5697 | if (!abi_version_at_least (2)) | |
5698 | include_empty_classes(rli); | |
58010b57 | 5699 | |
3ef397c1 MM |
5700 | /* Delete all zero-width bit-fields from the list of fields. Now |
5701 | that the type is laid out they are no longer important. */ | |
5702 | remove_zero_width_bit_fields (t); | |
5703 | ||
17bbb839 | 5704 | /* Create the version of T used for virtual bases. We do not use |
9e1e64ec | 5705 | make_class_type for this version; this is an artificial type. For |
17bbb839 | 5706 | a POD type, we just reuse T. */ |
c32097d8 | 5707 | if (CLASSTYPE_NON_LAYOUT_POD_P (t) || CLASSTYPE_EMPTY_P (t)) |
06ceef4e | 5708 | { |
17bbb839 | 5709 | base_t = make_node (TREE_CODE (t)); |
c8094d83 | 5710 | |
58731fd1 MM |
5711 | /* Set the size and alignment for the new type. In G++ 3.2, all |
5712 | empty classes were considered to have size zero when used as | |
5713 | base classes. */ | |
5714 | if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t)) | |
5715 | { | |
5716 | TYPE_SIZE (base_t) = bitsize_zero_node; | |
5717 | TYPE_SIZE_UNIT (base_t) = size_zero_node; | |
5718 | if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli))) | |
74fa0285 | 5719 | warning (OPT_Wabi, |
3db45ab5 | 5720 | "layout of classes derived from empty class %qT " |
58731fd1 MM |
5721 | "may change in a future version of GCC", |
5722 | t); | |
5723 | } | |
5724 | else | |
5725 | { | |
6b99d1c0 MM |
5726 | tree eoc; |
5727 | ||
5728 | /* If the ABI version is not at least two, and the last | |
5729 | field was a bit-field, RLI may not be on a byte | |
5730 | boundary. In particular, rli_size_unit_so_far might | |
5731 | indicate the last complete byte, while rli_size_so_far | |
5732 | indicates the total number of bits used. Therefore, | |
5733 | rli_size_so_far, rather than rli_size_unit_so_far, is | |
5734 | used to compute TYPE_SIZE_UNIT. */ | |
5735 | eoc = end_of_class (t, /*include_virtuals_p=*/0); | |
c8094d83 | 5736 | TYPE_SIZE_UNIT (base_t) |
8a874cb4 | 5737 | = size_binop (MAX_EXPR, |
6b99d1c0 MM |
5738 | convert (sizetype, |
5739 | size_binop (CEIL_DIV_EXPR, | |
5740 | rli_size_so_far (rli), | |
5741 | bitsize_int (BITS_PER_UNIT))), | |
5742 | eoc); | |
c8094d83 | 5743 | TYPE_SIZE (base_t) |
8a874cb4 MM |
5744 | = size_binop (MAX_EXPR, |
5745 | rli_size_so_far (rli), | |
5746 | size_binop (MULT_EXPR, | |
6b99d1c0 | 5747 | convert (bitsizetype, eoc), |
8a874cb4 | 5748 | bitsize_int (BITS_PER_UNIT))); |
58731fd1 | 5749 | } |
17bbb839 MM |
5750 | TYPE_ALIGN (base_t) = rli->record_align; |
5751 | TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t); | |
5752 | ||
5753 | /* Copy the fields from T. */ | |
5754 | next_field = &TYPE_FIELDS (base_t); | |
910ad8de | 5755 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
17bbb839 MM |
5756 | if (TREE_CODE (field) == FIELD_DECL) |
5757 | { | |
c2255bc4 AH |
5758 | *next_field = build_decl (input_location, |
5759 | FIELD_DECL, | |
c8094d83 | 5760 | DECL_NAME (field), |
17bbb839 MM |
5761 | TREE_TYPE (field)); |
5762 | DECL_CONTEXT (*next_field) = base_t; | |
5763 | DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field); | |
5764 | DECL_FIELD_BIT_OFFSET (*next_field) | |
5765 | = DECL_FIELD_BIT_OFFSET (field); | |
4f0a2b81 MM |
5766 | DECL_SIZE (*next_field) = DECL_SIZE (field); |
5767 | DECL_MODE (*next_field) = DECL_MODE (field); | |
910ad8de | 5768 | next_field = &DECL_CHAIN (*next_field); |
17bbb839 MM |
5769 | } |
5770 | ||
5771 | /* Record the base version of the type. */ | |
5772 | CLASSTYPE_AS_BASE (t) = base_t; | |
5a5cccaa | 5773 | TYPE_CONTEXT (base_t) = t; |
83b14b88 | 5774 | } |
1f84ec23 | 5775 | else |
17bbb839 | 5776 | CLASSTYPE_AS_BASE (t) = t; |
0b41abe6 | 5777 | |
5ec1192e MM |
5778 | /* Every empty class contains an empty class. */ |
5779 | if (CLASSTYPE_EMPTY_P (t)) | |
5780 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1; | |
5781 | ||
8d08fdba MS |
5782 | /* Set the TYPE_DECL for this type to contain the right |
5783 | value for DECL_OFFSET, so that we can use it as part | |
5784 | of a COMPONENT_REF for multiple inheritance. */ | |
d2e5ee5c | 5785 | layout_decl (TYPE_MAIN_DECL (t), 0); |
8d08fdba | 5786 | |
7177d104 MS |
5787 | /* Now fix up any virtual base class types that we left lying |
5788 | around. We must get these done before we try to lay out the | |
5c24fba6 MM |
5789 | virtual function table. As a side-effect, this will remove the |
5790 | base subobject fields. */ | |
17bbb839 MM |
5791 | layout_virtual_bases (rli, empty_base_offsets); |
5792 | ||
c8094d83 | 5793 | /* Make sure that empty classes are reflected in RLI at this |
17bbb839 MM |
5794 | point. */ |
5795 | include_empty_classes(rli); | |
5796 | ||
5797 | /* Make sure not to create any structures with zero size. */ | |
58731fd1 | 5798 | if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t)) |
c8094d83 | 5799 | place_field (rli, |
c2255bc4 AH |
5800 | build_decl (input_location, |
5801 | FIELD_DECL, NULL_TREE, char_type_node)); | |
17bbb839 | 5802 | |
a402c1b1 JM |
5803 | /* If this is a non-POD, declaring it packed makes a difference to how it |
5804 | can be used as a field; don't let finalize_record_size undo it. */ | |
5805 | if (TYPE_PACKED (t) && !layout_pod_type_p (t)) | |
5806 | rli->packed_maybe_necessary = true; | |
5807 | ||
3b426391 | 5808 | /* Let the back end lay out the type. */ |
17bbb839 | 5809 | finish_record_layout (rli, /*free_p=*/true); |
9785e4b1 | 5810 | |
17bbb839 MM |
5811 | /* Warn about bases that can't be talked about due to ambiguity. */ |
5812 | warn_about_ambiguous_bases (t); | |
78b45a24 | 5813 | |
00bfffa4 | 5814 | /* Now that we're done with layout, give the base fields the real types. */ |
910ad8de | 5815 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) |
00bfffa4 JM |
5816 | if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field))) |
5817 | TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field)); | |
5818 | ||
9785e4b1 | 5819 | /* Clean up. */ |
c20118a8 | 5820 | splay_tree_delete (empty_base_offsets); |
c5a35c3c MM |
5821 | |
5822 | if (CLASSTYPE_EMPTY_P (t) | |
3db45ab5 | 5823 | && tree_int_cst_lt (sizeof_biggest_empty_class, |
c0572427 MM |
5824 | TYPE_SIZE_UNIT (t))) |
5825 | sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t); | |
2ef16140 | 5826 | } |
c35cce41 | 5827 | |
af287697 MM |
5828 | /* Determine the "key method" for the class type indicated by TYPE, |
5829 | and set CLASSTYPE_KEY_METHOD accordingly. */ | |
9aad8f83 | 5830 | |
af287697 MM |
5831 | void |
5832 | determine_key_method (tree type) | |
9aad8f83 MA |
5833 | { |
5834 | tree method; | |
5835 | ||
5836 | if (TYPE_FOR_JAVA (type) | |
5837 | || processing_template_decl | |
5838 | || CLASSTYPE_TEMPLATE_INSTANTIATION (type) | |
5839 | || CLASSTYPE_INTERFACE_KNOWN (type)) | |
af287697 | 5840 | return; |
9aad8f83 | 5841 | |
af287697 MM |
5842 | /* The key method is the first non-pure virtual function that is not |
5843 | inline at the point of class definition. On some targets the | |
5844 | key function may not be inline; those targets should not call | |
5845 | this function until the end of the translation unit. */ | |
9aad8f83 | 5846 | for (method = TYPE_METHODS (type); method != NULL_TREE; |
910ad8de | 5847 | method = DECL_CHAIN (method)) |
9aad8f83 MA |
5848 | if (DECL_VINDEX (method) != NULL_TREE |
5849 | && ! DECL_DECLARED_INLINE_P (method) | |
5850 | && ! DECL_PURE_VIRTUAL_P (method)) | |
af287697 MM |
5851 | { |
5852 | CLASSTYPE_KEY_METHOD (type) = method; | |
5853 | break; | |
5854 | } | |
9aad8f83 | 5855 | |
af287697 | 5856 | return; |
9aad8f83 MA |
5857 | } |
5858 | ||
385b73ab DN |
5859 | |
5860 | /* Allocate and return an instance of struct sorted_fields_type with | |
5861 | N fields. */ | |
5862 | ||
5863 | static struct sorted_fields_type * | |
5864 | sorted_fields_type_new (int n) | |
5865 | { | |
5866 | struct sorted_fields_type *sft; | |
5867 | sft = ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type) | |
5868 | + n * sizeof (tree)); | |
5869 | sft->len = n; | |
5870 | ||
5871 | return sft; | |
5872 | } | |
5873 | ||
5874 | ||
548502d3 MM |
5875 | /* Perform processing required when the definition of T (a class type) |
5876 | is complete. */ | |
2ef16140 MM |
5877 | |
5878 | void | |
94edc4ab | 5879 | finish_struct_1 (tree t) |
2ef16140 MM |
5880 | { |
5881 | tree x; | |
00a17e31 | 5882 | /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */ |
e6858a84 | 5883 | tree virtuals = NULL_TREE; |
2ef16140 | 5884 | int n_fields = 0; |
2ef16140 | 5885 | |
d0f062fb | 5886 | if (COMPLETE_TYPE_P (t)) |
2ef16140 | 5887 | { |
9e1e64ec | 5888 | gcc_assert (MAYBE_CLASS_TYPE_P (t)); |
1f070f2b | 5889 | error ("redefinition of %q#T", t); |
2ef16140 MM |
5890 | popclass (); |
5891 | return; | |
5892 | } | |
5893 | ||
2ef16140 MM |
5894 | /* If this type was previously laid out as a forward reference, |
5895 | make sure we lay it out again. */ | |
2ef16140 | 5896 | TYPE_SIZE (t) = NULL_TREE; |
911a71a7 | 5897 | CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE; |
2ef16140 | 5898 | |
5ec1192e MM |
5899 | /* Make assumptions about the class; we'll reset the flags if |
5900 | necessary. */ | |
58731fd1 MM |
5901 | CLASSTYPE_EMPTY_P (t) = 1; |
5902 | CLASSTYPE_NEARLY_EMPTY_P (t) = 1; | |
5ec1192e | 5903 | CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0; |
3b49d762 | 5904 | CLASSTYPE_LITERAL_P (t) = true; |
58731fd1 | 5905 | |
2ef16140 | 5906 | /* Do end-of-class semantic processing: checking the validity of the |
03702748 | 5907 | bases and members and add implicitly generated methods. */ |
58731fd1 | 5908 | check_bases_and_members (t); |
2ef16140 | 5909 | |
f4f206f4 | 5910 | /* Find the key method. */ |
a63996f1 | 5911 | if (TYPE_CONTAINS_VPTR_P (t)) |
9aad8f83 | 5912 | { |
af287697 MM |
5913 | /* The Itanium C++ ABI permits the key method to be chosen when |
5914 | the class is defined -- even though the key method so | |
5915 | selected may later turn out to be an inline function. On | |
5916 | some systems (such as ARM Symbian OS) the key method cannot | |
5917 | be determined until the end of the translation unit. On such | |
5918 | systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which | |
5919 | will cause the class to be added to KEYED_CLASSES. Then, in | |
5920 | finish_file we will determine the key method. */ | |
5921 | if (targetm.cxx.key_method_may_be_inline ()) | |
5922 | determine_key_method (t); | |
9aad8f83 MA |
5923 | |
5924 | /* If a polymorphic class has no key method, we may emit the vtable | |
9bcb9aae | 5925 | in every translation unit where the class definition appears. */ |
9aad8f83 MA |
5926 | if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE) |
5927 | keyed_classes = tree_cons (NULL_TREE, t, keyed_classes); | |
5928 | } | |
5929 | ||
2ef16140 | 5930 | /* Layout the class itself. */ |
e93ee644 | 5931 | layout_class_type (t, &virtuals); |
a0c68737 NS |
5932 | if (CLASSTYPE_AS_BASE (t) != t) |
5933 | /* We use the base type for trivial assignments, and hence it | |
5934 | needs a mode. */ | |
5935 | compute_record_mode (CLASSTYPE_AS_BASE (t)); | |
8ebeee52 | 5936 | |
e93ee644 | 5937 | virtuals = modify_all_vtables (t, nreverse (virtuals)); |
db5ae43f | 5938 | |
5e19c053 | 5939 | /* If necessary, create the primary vtable for this class. */ |
e6858a84 | 5940 | if (virtuals || TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 5941 | { |
8d08fdba | 5942 | /* We must enter these virtuals into the table. */ |
3ef397c1 | 5943 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
da3d4dfa | 5944 | build_primary_vtable (NULL_TREE, t); |
dbbf88d1 | 5945 | else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t))) |
0533d788 MM |
5946 | /* Here we know enough to change the type of our virtual |
5947 | function table, but we will wait until later this function. */ | |
28531dd0 | 5948 | build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t); |
8d08fdba MS |
5949 | } |
5950 | ||
bbd15aac | 5951 | if (TYPE_CONTAINS_VPTR_P (t)) |
8d08fdba | 5952 | { |
e93ee644 MM |
5953 | int vindex; |
5954 | tree fn; | |
5955 | ||
604a3205 | 5956 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
50bc768d | 5957 | gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t)))); |
1eb4bea9 | 5958 | if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t)) |
50bc768d | 5959 | gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE); |
1eb4bea9 | 5960 | |
e6858a84 | 5961 | /* Add entries for virtual functions introduced by this class. */ |
604a3205 NS |
5962 | BINFO_VIRTUALS (TYPE_BINFO (t)) |
5963 | = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals); | |
e93ee644 MM |
5964 | |
5965 | /* Set DECL_VINDEX for all functions declared in this class. */ | |
c8094d83 MS |
5966 | for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t)); |
5967 | fn; | |
5968 | fn = TREE_CHAIN (fn), | |
e93ee644 MM |
5969 | vindex += (TARGET_VTABLE_USES_DESCRIPTORS |
5970 | ? TARGET_VTABLE_USES_DESCRIPTORS : 1)) | |
4977bab6 ZW |
5971 | { |
5972 | tree fndecl = BV_FN (fn); | |
5973 | ||
5974 | if (DECL_THUNK_P (fndecl)) | |
5975 | /* A thunk. We should never be calling this entry directly | |
5976 | from this vtable -- we'd use the entry for the non | |
5977 | thunk base function. */ | |
5978 | DECL_VINDEX (fndecl) = NULL_TREE; | |
5979 | else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST) | |
7d60be94 | 5980 | DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex); |
4977bab6 | 5981 | } |
8d08fdba MS |
5982 | } |
5983 | ||
d2c5305b | 5984 | finish_struct_bits (t); |
0a35513e | 5985 | set_method_tm_attributes (t); |
8d08fdba | 5986 | |
f30432d7 MS |
5987 | /* Complete the rtl for any static member objects of the type we're |
5988 | working on. */ | |
910ad8de | 5989 | for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x)) |
19e7881c | 5990 | if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x) |
650fcd07 | 5991 | && TREE_TYPE (x) != error_mark_node |
c7f4981a | 5992 | && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t)) |
19e7881c | 5993 | DECL_MODE (x) = TYPE_MODE (t); |
8d08fdba | 5994 | |
f90cdf34 | 5995 | /* Done with FIELDS...now decide whether to sort these for |
58010b57 | 5996 | faster lookups later. |
f90cdf34 | 5997 | |
6c73ad72 | 5998 | We use a small number because most searches fail (succeeding |
f90cdf34 MT |
5999 | ultimately as the search bores through the inheritance |
6000 | hierarchy), and we want this failure to occur quickly. */ | |
6001 | ||
58010b57 MM |
6002 | n_fields = count_fields (TYPE_FIELDS (t)); |
6003 | if (n_fields > 7) | |
f90cdf34 | 6004 | { |
385b73ab | 6005 | struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields); |
d07605f5 AP |
6006 | add_fields_to_record_type (TYPE_FIELDS (t), field_vec, 0); |
6007 | qsort (field_vec->elts, n_fields, sizeof (tree), | |
17211ab5 | 6008 | field_decl_cmp); |
b97e8a14 | 6009 | CLASSTYPE_SORTED_FIELDS (t) = field_vec; |
f90cdf34 MT |
6010 | } |
6011 | ||
b9e75696 JM |
6012 | /* Complain if one of the field types requires lower visibility. */ |
6013 | constrain_class_visibility (t); | |
6014 | ||
8d7a5379 MM |
6015 | /* Make the rtl for any new vtables we have created, and unmark |
6016 | the base types we marked. */ | |
6017 | finish_vtbls (t); | |
c8094d83 | 6018 | |
23656158 MM |
6019 | /* Build the VTT for T. */ |
6020 | build_vtt (t); | |
8d7a5379 | 6021 | |
f03e8526 MM |
6022 | /* This warning does not make sense for Java classes, since they |
6023 | cannot have destructors. */ | |
6024 | if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t)) | |
9fd8f60d | 6025 | { |
9f4faeae MM |
6026 | tree dtor; |
6027 | ||
6028 | dtor = CLASSTYPE_DESTRUCTORS (t); | |
9f4faeae MM |
6029 | if (/* An implicitly declared destructor is always public. And, |
6030 | if it were virtual, we would have created it by now. */ | |
6031 | !dtor | |
6032 | || (!DECL_VINDEX (dtor) | |
43f14744 PS |
6033 | && (/* public non-virtual */ |
6034 | (!TREE_PRIVATE (dtor) && !TREE_PROTECTED (dtor)) | |
6035 | || (/* non-public non-virtual with friends */ | |
6036 | (TREE_PRIVATE (dtor) || TREE_PROTECTED (dtor)) | |
6037 | && (CLASSTYPE_FRIEND_CLASSES (t) | |
6038 | || DECL_FRIENDLIST (TYPE_MAIN_DECL (t))))))) | |
6039 | warning (OPT_Wnon_virtual_dtor, | |
6040 | "%q#T has virtual functions and accessible" | |
6041 | " non-virtual destructor", t); | |
9fd8f60d | 6042 | } |
8d08fdba | 6043 | |
0154eaa8 | 6044 | complete_vars (t); |
8d08fdba | 6045 | |
9e9ff709 MS |
6046 | if (warn_overloaded_virtual) |
6047 | warn_hidden (t); | |
8d08fdba | 6048 | |
43d9ad1d DS |
6049 | /* Class layout, assignment of virtual table slots, etc., is now |
6050 | complete. Give the back end a chance to tweak the visibility of | |
6051 | the class or perform any other required target modifications. */ | |
6052 | targetm.cxx.adjust_class_at_definition (t); | |
6053 | ||
ae673f14 | 6054 | maybe_suppress_debug_info (t); |
8d08fdba | 6055 | |
b7442fb5 | 6056 | dump_class_hierarchy (t); |
c8094d83 | 6057 | |
d2e5ee5c | 6058 | /* Finish debugging output for this type. */ |
881c6935 | 6059 | rest_of_type_compilation (t, ! LOCAL_CLASS_P (t)); |
bfcbe068 | 6060 | |
e7b6bcf3 | 6061 | if (TYPE_TRANSPARENT_AGGR (t)) |
bfcbe068 | 6062 | { |
e7b6bcf3 JJ |
6063 | tree field = first_field (t); |
6064 | if (field == NULL_TREE || error_operand_p (field)) | |
6065 | { | |
6066 | error ("type transparent class %qT does not have any fields", t); | |
6067 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6068 | } | |
6069 | else if (DECL_ARTIFICIAL (field)) | |
6070 | { | |
6071 | if (DECL_FIELD_IS_BASE (field)) | |
6072 | error ("type transparent class %qT has base classes", t); | |
6073 | else | |
6074 | { | |
6075 | gcc_checking_assert (DECL_VIRTUAL_P (field)); | |
6076 | error ("type transparent class %qT has virtual functions", t); | |
6077 | } | |
6078 | TYPE_TRANSPARENT_AGGR (t) = 0; | |
6079 | } | |
bfcbe068 | 6080 | } |
8d08fdba | 6081 | } |
f30432d7 | 6082 | |
61a127b3 MM |
6083 | /* When T was built up, the member declarations were added in reverse |
6084 | order. Rearrange them to declaration order. */ | |
6085 | ||
6086 | void | |
94edc4ab | 6087 | unreverse_member_declarations (tree t) |
61a127b3 MM |
6088 | { |
6089 | tree next; | |
6090 | tree prev; | |
6091 | tree x; | |
6092 | ||
7088fca9 KL |
6093 | /* The following lists are all in reverse order. Put them in |
6094 | declaration order now. */ | |
61a127b3 | 6095 | TYPE_METHODS (t) = nreverse (TYPE_METHODS (t)); |
7088fca9 | 6096 | CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t)); |
61a127b3 MM |
6097 | |
6098 | /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in | |
6099 | reverse order, so we can't just use nreverse. */ | |
6100 | prev = NULL_TREE; | |
c8094d83 MS |
6101 | for (x = TYPE_FIELDS (t); |
6102 | x && TREE_CODE (x) != TYPE_DECL; | |
61a127b3 MM |
6103 | x = next) |
6104 | { | |
910ad8de NF |
6105 | next = DECL_CHAIN (x); |
6106 | DECL_CHAIN (x) = prev; | |
61a127b3 MM |
6107 | prev = x; |
6108 | } | |
6109 | if (prev) | |
6110 | { | |
910ad8de | 6111 | DECL_CHAIN (TYPE_FIELDS (t)) = x; |
61a127b3 MM |
6112 | if (prev) |
6113 | TYPE_FIELDS (t) = prev; | |
6114 | } | |
6115 | } | |
6116 | ||
f30432d7 | 6117 | tree |
94edc4ab | 6118 | finish_struct (tree t, tree attributes) |
f30432d7 | 6119 | { |
82a98427 | 6120 | location_t saved_loc = input_location; |
1f0d71c5 | 6121 | |
61a127b3 MM |
6122 | /* Now that we've got all the field declarations, reverse everything |
6123 | as necessary. */ | |
6124 | unreverse_member_declarations (t); | |
f30432d7 | 6125 | |
91d231cb | 6126 | cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); |
6467930b | 6127 | |
1f0d71c5 NS |
6128 | /* Nadger the current location so that diagnostics point to the start of |
6129 | the struct, not the end. */ | |
f31686a3 | 6130 | input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t)); |
1f0d71c5 | 6131 | |
5566b478 | 6132 | if (processing_template_decl) |
f30432d7 | 6133 | { |
7fb213d8 GB |
6134 | tree x; |
6135 | ||
b0e0b31f | 6136 | finish_struct_methods (t); |
867580ce | 6137 | TYPE_SIZE (t) = bitsize_zero_node; |
ae54ec16 | 6138 | TYPE_SIZE_UNIT (t) = size_zero_node; |
7fb213d8 GB |
6139 | |
6140 | /* We need to emit an error message if this type was used as a parameter | |
6141 | and it is an abstract type, even if it is a template. We construct | |
6142 | a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into | |
6143 | account and we call complete_vars with this type, which will check | |
6144 | the PARM_DECLS. Note that while the type is being defined, | |
6145 | CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends | |
6146 | (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */ | |
585b44d3 | 6147 | CLASSTYPE_PURE_VIRTUALS (t) = NULL; |
910ad8de | 6148 | for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x)) |
7fb213d8 | 6149 | if (DECL_PURE_VIRTUAL_P (x)) |
d4e6fecb | 6150 | VEC_safe_push (tree, gc, CLASSTYPE_PURE_VIRTUALS (t), x); |
7fb213d8 | 6151 | complete_vars (t); |
040ca4b3 JM |
6152 | |
6153 | /* Remember current #pragma pack value. */ | |
6154 | TYPE_PRECISION (t) = maximum_field_alignment; | |
6f1b4c42 | 6155 | } |
f30432d7 | 6156 | else |
9f33663b | 6157 | finish_struct_1 (t); |
5566b478 | 6158 | |
82a98427 | 6159 | input_location = saved_loc; |
1f0d71c5 | 6160 | |
5566b478 | 6161 | TYPE_BEING_DEFINED (t) = 0; |
8f032717 | 6162 | |
5566b478 | 6163 | if (current_class_type) |
b74a0560 | 6164 | popclass (); |
5566b478 | 6165 | else |
357351e5 | 6166 | error ("trying to finish struct, but kicked out due to previous parse errors"); |
5566b478 | 6167 | |
5f261ba9 MM |
6168 | if (processing_template_decl && at_function_scope_p ()) |
6169 | add_stmt (build_min (TAG_DEFN, t)); | |
ae673f14 | 6170 | |
5566b478 | 6171 | return t; |
f30432d7 | 6172 | } |
8d08fdba | 6173 | \f |
51ddb82e | 6174 | /* Return the dynamic type of INSTANCE, if known. |
8d08fdba MS |
6175 | Used to determine whether the virtual function table is needed |
6176 | or not. | |
6177 | ||
6178 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6179 | of our knowledge of its type. *NONNULL should be initialized |
6180 | before this function is called. */ | |
e92cc029 | 6181 | |
d8e178a0 | 6182 | static tree |
555551c2 | 6183 | fixed_type_or_null (tree instance, int *nonnull, int *cdtorp) |
8d08fdba | 6184 | { |
555551c2 MM |
6185 | #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp) |
6186 | ||
8d08fdba MS |
6187 | switch (TREE_CODE (instance)) |
6188 | { | |
6189 | case INDIRECT_REF: | |
608afcc5 | 6190 | if (POINTER_TYPE_P (TREE_TYPE (instance))) |
a0de9d20 JM |
6191 | return NULL_TREE; |
6192 | else | |
555551c2 | 6193 | return RECUR (TREE_OPERAND (instance, 0)); |
a0de9d20 | 6194 | |
8d08fdba MS |
6195 | case CALL_EXPR: |
6196 | /* This is a call to a constructor, hence it's never zero. */ | |
6197 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6198 | { | |
6199 | if (nonnull) | |
6200 | *nonnull = 1; | |
51ddb82e | 6201 | return TREE_TYPE (instance); |
8d08fdba | 6202 | } |
51ddb82e | 6203 | return NULL_TREE; |
8d08fdba MS |
6204 | |
6205 | case SAVE_EXPR: | |
6206 | /* This is a call to a constructor, hence it's never zero. */ | |
6207 | if (TREE_HAS_CONSTRUCTOR (instance)) | |
6208 | { | |
6209 | if (nonnull) | |
6210 | *nonnull = 1; | |
51ddb82e | 6211 | return TREE_TYPE (instance); |
8d08fdba | 6212 | } |
555551c2 | 6213 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba | 6214 | |
5be014d5 | 6215 | case POINTER_PLUS_EXPR: |
8d08fdba MS |
6216 | case PLUS_EXPR: |
6217 | case MINUS_EXPR: | |
394fd776 | 6218 | if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR) |
555551c2 | 6219 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6220 | if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST) |
6221 | /* Propagate nonnull. */ | |
555551c2 MM |
6222 | return RECUR (TREE_OPERAND (instance, 0)); |
6223 | ||
51ddb82e | 6224 | return NULL_TREE; |
8d08fdba | 6225 | |
63a906f0 | 6226 | CASE_CONVERT: |
555551c2 | 6227 | return RECUR (TREE_OPERAND (instance, 0)); |
8d08fdba MS |
6228 | |
6229 | case ADDR_EXPR: | |
88f19756 | 6230 | instance = TREE_OPERAND (instance, 0); |
8d08fdba | 6231 | if (nonnull) |
88f19756 RH |
6232 | { |
6233 | /* Just because we see an ADDR_EXPR doesn't mean we're dealing | |
6234 | with a real object -- given &p->f, p can still be null. */ | |
6235 | tree t = get_base_address (instance); | |
6236 | /* ??? Probably should check DECL_WEAK here. */ | |
6237 | if (t && DECL_P (t)) | |
6238 | *nonnull = 1; | |
6239 | } | |
555551c2 | 6240 | return RECUR (instance); |
8d08fdba MS |
6241 | |
6242 | case COMPONENT_REF: | |
642124c6 RH |
6243 | /* If this component is really a base class reference, then the field |
6244 | itself isn't definitive. */ | |
6245 | if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1))) | |
555551c2 MM |
6246 | return RECUR (TREE_OPERAND (instance, 0)); |
6247 | return RECUR (TREE_OPERAND (instance, 1)); | |
8d08fdba | 6248 | |
8d08fdba MS |
6249 | case VAR_DECL: |
6250 | case FIELD_DECL: | |
6251 | if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE | |
9e1e64ec | 6252 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance)))) |
8d08fdba MS |
6253 | { |
6254 | if (nonnull) | |
6255 | *nonnull = 1; | |
51ddb82e | 6256 | return TREE_TYPE (TREE_TYPE (instance)); |
8d08fdba | 6257 | } |
e92cc029 | 6258 | /* fall through... */ |
8d08fdba MS |
6259 | case TARGET_EXPR: |
6260 | case PARM_DECL: | |
f63ab951 | 6261 | case RESULT_DECL: |
9e1e64ec | 6262 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance))) |
8d08fdba MS |
6263 | { |
6264 | if (nonnull) | |
6265 | *nonnull = 1; | |
51ddb82e | 6266 | return TREE_TYPE (instance); |
8d08fdba | 6267 | } |
394fd776 | 6268 | else if (instance == current_class_ptr) |
0cbd7506 MS |
6269 | { |
6270 | if (nonnull) | |
6271 | *nonnull = 1; | |
6272 | ||
f10eaa2d JM |
6273 | /* if we're in a ctor or dtor, we know our type. If |
6274 | current_class_ptr is set but we aren't in a function, we're in | |
6275 | an NSDMI (and therefore a constructor). */ | |
6276 | if (current_scope () != current_function_decl | |
6277 | || (DECL_LANG_SPECIFIC (current_function_decl) | |
6278 | && (DECL_CONSTRUCTOR_P (current_function_decl) | |
6279 | || DECL_DESTRUCTOR_P (current_function_decl)))) | |
0cbd7506 MS |
6280 | { |
6281 | if (cdtorp) | |
6282 | *cdtorp = 1; | |
6283 | return TREE_TYPE (TREE_TYPE (instance)); | |
6284 | } | |
6285 | } | |
394fd776 | 6286 | else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE) |
0cbd7506 | 6287 | { |
555551c2 MM |
6288 | /* We only need one hash table because it is always left empty. */ |
6289 | static htab_t ht; | |
6290 | if (!ht) | |
6291 | ht = htab_create (37, | |
6292 | htab_hash_pointer, | |
6293 | htab_eq_pointer, | |
6294 | /*htab_del=*/NULL); | |
6295 | ||
0cbd7506 MS |
6296 | /* Reference variables should be references to objects. */ |
6297 | if (nonnull) | |
8d08fdba | 6298 | *nonnull = 1; |
c8094d83 | 6299 | |
555551c2 | 6300 | /* Enter the INSTANCE in a table to prevent recursion; a |
772f8889 MM |
6301 | variable's initializer may refer to the variable |
6302 | itself. */ | |
c8094d83 | 6303 | if (TREE_CODE (instance) == VAR_DECL |
772f8889 | 6304 | && DECL_INITIAL (instance) |
bae14a37 | 6305 | && !type_dependent_expression_p_push (DECL_INITIAL (instance)) |
555551c2 | 6306 | && !htab_find (ht, instance)) |
772f8889 MM |
6307 | { |
6308 | tree type; | |
555551c2 MM |
6309 | void **slot; |
6310 | ||
6311 | slot = htab_find_slot (ht, instance, INSERT); | |
6312 | *slot = instance; | |
6313 | type = RECUR (DECL_INITIAL (instance)); | |
e656a465 | 6314 | htab_remove_elt (ht, instance); |
555551c2 | 6315 | |
772f8889 MM |
6316 | return type; |
6317 | } | |
8d08fdba | 6318 | } |
51ddb82e | 6319 | return NULL_TREE; |
8d08fdba MS |
6320 | |
6321 | default: | |
51ddb82e | 6322 | return NULL_TREE; |
8d08fdba | 6323 | } |
555551c2 | 6324 | #undef RECUR |
8d08fdba | 6325 | } |
51ddb82e | 6326 | |
838dfd8a | 6327 | /* Return nonzero if the dynamic type of INSTANCE is known, and |
338d90b8 NS |
6328 | equivalent to the static type. We also handle the case where |
6329 | INSTANCE is really a pointer. Return negative if this is a | |
6330 | ctor/dtor. There the dynamic type is known, but this might not be | |
6331 | the most derived base of the original object, and hence virtual | |
6332 | bases may not be layed out according to this type. | |
51ddb82e JM |
6333 | |
6334 | Used to determine whether the virtual function table is needed | |
6335 | or not. | |
6336 | ||
6337 | *NONNULL is set iff INSTANCE can be known to be nonnull, regardless | |
97d953bb MM |
6338 | of our knowledge of its type. *NONNULL should be initialized |
6339 | before this function is called. */ | |
51ddb82e JM |
6340 | |
6341 | int | |
94edc4ab | 6342 | resolves_to_fixed_type_p (tree instance, int* nonnull) |
51ddb82e JM |
6343 | { |
6344 | tree t = TREE_TYPE (instance); | |
394fd776 | 6345 | int cdtorp = 0; |
4d3baecc JM |
6346 | tree fixed; |
6347 | ||
6348 | if (processing_template_decl) | |
6349 | { | |
6350 | /* In a template we only care about the type of the result. */ | |
6351 | if (nonnull) | |
6352 | *nonnull = true; | |
6353 | return true; | |
6354 | } | |
6355 | ||
6356 | fixed = fixed_type_or_null (instance, nonnull, &cdtorp); | |
51ddb82e JM |
6357 | if (fixed == NULL_TREE) |
6358 | return 0; | |
6359 | if (POINTER_TYPE_P (t)) | |
6360 | t = TREE_TYPE (t); | |
394fd776 NS |
6361 | if (!same_type_ignoring_top_level_qualifiers_p (t, fixed)) |
6362 | return 0; | |
6363 | return cdtorp ? -1 : 1; | |
51ddb82e JM |
6364 | } |
6365 | ||
8d08fdba MS |
6366 | \f |
6367 | void | |
94edc4ab | 6368 | init_class_processing (void) |
8d08fdba MS |
6369 | { |
6370 | current_class_depth = 0; | |
61a127b3 | 6371 | current_class_stack_size = 10; |
c8094d83 | 6372 | current_class_stack |
0ac1b889 | 6373 | = XNEWVEC (struct class_stack_node, current_class_stack_size); |
806aa901 | 6374 | local_classes = VEC_alloc (tree, gc, 8); |
c5a35c3c | 6375 | sizeof_biggest_empty_class = size_zero_node; |
8d08fdba | 6376 | |
0e5921e8 ZW |
6377 | ridpointers[(int) RID_PUBLIC] = access_public_node; |
6378 | ridpointers[(int) RID_PRIVATE] = access_private_node; | |
6379 | ridpointers[(int) RID_PROTECTED] = access_protected_node; | |
8d08fdba MS |
6380 | } |
6381 | ||
39fb05d0 MM |
6382 | /* Restore the cached PREVIOUS_CLASS_LEVEL. */ |
6383 | ||
6384 | static void | |
6385 | restore_class_cache (void) | |
6386 | { | |
39fb05d0 | 6387 | tree type; |
39fb05d0 MM |
6388 | |
6389 | /* We are re-entering the same class we just left, so we don't | |
6390 | have to search the whole inheritance matrix to find all the | |
6391 | decls to bind again. Instead, we install the cached | |
6392 | class_shadowed list and walk through it binding names. */ | |
6393 | push_binding_level (previous_class_level); | |
6394 | class_binding_level = previous_class_level; | |
39fb05d0 | 6395 | /* Restore IDENTIFIER_TYPE_VALUE. */ |
c8094d83 MS |
6396 | for (type = class_binding_level->type_shadowed; |
6397 | type; | |
39fb05d0 MM |
6398 | type = TREE_CHAIN (type)) |
6399 | SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type)); | |
6400 | } | |
6401 | ||
a723baf1 MM |
6402 | /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as |
6403 | appropriate for TYPE. | |
8d08fdba | 6404 | |
8d08fdba MS |
6405 | So that we may avoid calls to lookup_name, we cache the _TYPE |
6406 | nodes of local TYPE_DECLs in the TREE_TYPE field of the name. | |
6407 | ||
6408 | For multiple inheritance, we perform a two-pass depth-first search | |
39fb05d0 | 6409 | of the type lattice. */ |
8d08fdba MS |
6410 | |
6411 | void | |
29370796 | 6412 | pushclass (tree type) |
8d08fdba | 6413 | { |
c888c93b MM |
6414 | class_stack_node_t csn; |
6415 | ||
0771d9d7 JM |
6416 | type = TYPE_MAIN_VARIANT (type); |
6417 | ||
61a127b3 | 6418 | /* Make sure there is enough room for the new entry on the stack. */ |
c8094d83 | 6419 | if (current_class_depth + 1 >= current_class_stack_size) |
8d08fdba | 6420 | { |
61a127b3 MM |
6421 | current_class_stack_size *= 2; |
6422 | current_class_stack | |
7767580e | 6423 | = XRESIZEVEC (struct class_stack_node, current_class_stack, |
3db45ab5 | 6424 | current_class_stack_size); |
8d08fdba MS |
6425 | } |
6426 | ||
61a127b3 | 6427 | /* Insert a new entry on the class stack. */ |
c888c93b MM |
6428 | csn = current_class_stack + current_class_depth; |
6429 | csn->name = current_class_name; | |
6430 | csn->type = current_class_type; | |
6431 | csn->access = current_access_specifier; | |
6432 | csn->names_used = 0; | |
6433 | csn->hidden = 0; | |
61a127b3 MM |
6434 | current_class_depth++; |
6435 | ||
6436 | /* Now set up the new type. */ | |
8d08fdba MS |
6437 | current_class_name = TYPE_NAME (type); |
6438 | if (TREE_CODE (current_class_name) == TYPE_DECL) | |
6439 | current_class_name = DECL_NAME (current_class_name); | |
6440 | current_class_type = type; | |
6441 | ||
61a127b3 MM |
6442 | /* By default, things in classes are private, while things in |
6443 | structures or unions are public. */ | |
c8094d83 MS |
6444 | current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type) |
6445 | ? access_private_node | |
61a127b3 MM |
6446 | : access_public_node); |
6447 | ||
89b578be MM |
6448 | if (previous_class_level |
6449 | && type != previous_class_level->this_entity | |
8d08fdba MS |
6450 | && current_class_depth == 1) |
6451 | { | |
6452 | /* Forcibly remove any old class remnants. */ | |
8f032717 | 6453 | invalidate_class_lookup_cache (); |
8d08fdba MS |
6454 | } |
6455 | ||
c8094d83 | 6456 | if (!previous_class_level |
89b578be MM |
6457 | || type != previous_class_level->this_entity |
6458 | || current_class_depth > 1) | |
90ea9897 | 6459 | pushlevel_class (); |
29370796 | 6460 | else |
39fb05d0 | 6461 | restore_class_cache (); |
8f032717 MM |
6462 | } |
6463 | ||
39fb05d0 MM |
6464 | /* When we exit a toplevel class scope, we save its binding level so |
6465 | that we can restore it quickly. Here, we've entered some other | |
6466 | class, so we must invalidate our cache. */ | |
8d08fdba | 6467 | |
8f032717 | 6468 | void |
94edc4ab | 6469 | invalidate_class_lookup_cache (void) |
8f032717 | 6470 | { |
89b578be | 6471 | previous_class_level = NULL; |
8d08fdba | 6472 | } |
c8094d83 | 6473 | |
8d08fdba | 6474 | /* Get out of the current class scope. If we were in a class scope |
b74a0560 | 6475 | previously, that is the one popped to. */ |
e92cc029 | 6476 | |
8d08fdba | 6477 | void |
94edc4ab | 6478 | popclass (void) |
8d08fdba | 6479 | { |
0771d9d7 | 6480 | poplevel_class (); |
8d08fdba MS |
6481 | |
6482 | current_class_depth--; | |
61a127b3 MM |
6483 | current_class_name = current_class_stack[current_class_depth].name; |
6484 | current_class_type = current_class_stack[current_class_depth].type; | |
6485 | current_access_specifier = current_class_stack[current_class_depth].access; | |
8f032717 MM |
6486 | if (current_class_stack[current_class_depth].names_used) |
6487 | splay_tree_delete (current_class_stack[current_class_depth].names_used); | |
8d08fdba MS |
6488 | } |
6489 | ||
c888c93b MM |
6490 | /* Mark the top of the class stack as hidden. */ |
6491 | ||
6492 | void | |
6493 | push_class_stack (void) | |
6494 | { | |
6495 | if (current_class_depth) | |
6496 | ++current_class_stack[current_class_depth - 1].hidden; | |
6497 | } | |
6498 | ||
6499 | /* Mark the top of the class stack as un-hidden. */ | |
6500 | ||
6501 | void | |
6502 | pop_class_stack (void) | |
6503 | { | |
6504 | if (current_class_depth) | |
6505 | --current_class_stack[current_class_depth - 1].hidden; | |
6506 | } | |
6507 | ||
fa6098f8 MM |
6508 | /* Returns 1 if the class type currently being defined is either T or |
6509 | a nested type of T. */ | |
b9082e8a | 6510 | |
fa6098f8 | 6511 | bool |
94edc4ab | 6512 | currently_open_class (tree t) |
b9082e8a JM |
6513 | { |
6514 | int i; | |
fa6098f8 | 6515 | |
1cb801bc JM |
6516 | if (!CLASS_TYPE_P (t)) |
6517 | return false; | |
6518 | ||
3e5e84be JM |
6519 | t = TYPE_MAIN_VARIANT (t); |
6520 | ||
fa6098f8 MM |
6521 | /* We start looking from 1 because entry 0 is from global scope, |
6522 | and has no type. */ | |
6523 | for (i = current_class_depth; i > 0; --i) | |
c888c93b | 6524 | { |
fa6098f8 MM |
6525 | tree c; |
6526 | if (i == current_class_depth) | |
6527 | c = current_class_type; | |
6528 | else | |
6529 | { | |
6530 | if (current_class_stack[i].hidden) | |
6531 | break; | |
6532 | c = current_class_stack[i].type; | |
6533 | } | |
6534 | if (!c) | |
6535 | continue; | |
6536 | if (same_type_p (c, t)) | |
6537 | return true; | |
c888c93b | 6538 | } |
fa6098f8 | 6539 | return false; |
b9082e8a JM |
6540 | } |
6541 | ||
70adf8a9 JM |
6542 | /* If either current_class_type or one of its enclosing classes are derived |
6543 | from T, return the appropriate type. Used to determine how we found | |
6544 | something via unqualified lookup. */ | |
6545 | ||
6546 | tree | |
94edc4ab | 6547 | currently_open_derived_class (tree t) |
70adf8a9 JM |
6548 | { |
6549 | int i; | |
6550 | ||
9bcb9aae | 6551 | /* The bases of a dependent type are unknown. */ |
1fb3244a MM |
6552 | if (dependent_type_p (t)) |
6553 | return NULL_TREE; | |
6554 | ||
c44e68a5 KL |
6555 | if (!current_class_type) |
6556 | return NULL_TREE; | |
6557 | ||
70adf8a9 JM |
6558 | if (DERIVED_FROM_P (t, current_class_type)) |
6559 | return current_class_type; | |
6560 | ||
6561 | for (i = current_class_depth - 1; i > 0; --i) | |
c888c93b MM |
6562 | { |
6563 | if (current_class_stack[i].hidden) | |
6564 | break; | |
6565 | if (DERIVED_FROM_P (t, current_class_stack[i].type)) | |
6566 | return current_class_stack[i].type; | |
6567 | } | |
70adf8a9 JM |
6568 | |
6569 | return NULL_TREE; | |
6570 | } | |
6571 | ||
a6846853 JM |
6572 | /* Returns the innermost class type which is not a lambda closure type. */ |
6573 | ||
6574 | tree | |
6575 | current_nonlambda_class_type (void) | |
6576 | { | |
6577 | int i; | |
6578 | ||
6579 | /* We start looking from 1 because entry 0 is from global scope, | |
6580 | and has no type. */ | |
6581 | for (i = current_class_depth; i > 0; --i) | |
6582 | { | |
6583 | tree c; | |
6584 | if (i == current_class_depth) | |
6585 | c = current_class_type; | |
6586 | else | |
6587 | { | |
6588 | if (current_class_stack[i].hidden) | |
6589 | break; | |
6590 | c = current_class_stack[i].type; | |
6591 | } | |
6592 | if (!c) | |
6593 | continue; | |
6594 | if (!LAMBDA_TYPE_P (c)) | |
6595 | return c; | |
6596 | } | |
6597 | return NULL_TREE; | |
6598 | } | |
6599 | ||
8d08fdba | 6600 | /* When entering a class scope, all enclosing class scopes' names with |
14d22dd6 MM |
6601 | static meaning (static variables, static functions, types and |
6602 | enumerators) have to be visible. This recursive function calls | |
6603 | pushclass for all enclosing class contexts until global or a local | |
6604 | scope is reached. TYPE is the enclosed class. */ | |
8d08fdba MS |
6605 | |
6606 | void | |
14d22dd6 | 6607 | push_nested_class (tree type) |
8d08fdba | 6608 | { |
b262d64c | 6609 | /* A namespace might be passed in error cases, like A::B:C. */ |
c8094d83 | 6610 | if (type == NULL_TREE |
56d0c6e3 | 6611 | || !CLASS_TYPE_P (type)) |
a28e3c7f | 6612 | return; |
c8094d83 | 6613 | |
56d0c6e3 | 6614 | push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type))); |
8d08fdba | 6615 | |
29370796 | 6616 | pushclass (type); |
8d08fdba MS |
6617 | } |
6618 | ||
a723baf1 | 6619 | /* Undoes a push_nested_class call. */ |
8d08fdba MS |
6620 | |
6621 | void | |
94edc4ab | 6622 | pop_nested_class (void) |
8d08fdba | 6623 | { |
d2e5ee5c | 6624 | tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type)); |
8d08fdba | 6625 | |
b74a0560 | 6626 | popclass (); |
6b400b21 | 6627 | if (context && CLASS_TYPE_P (context)) |
b74a0560 | 6628 | pop_nested_class (); |
8d08fdba MS |
6629 | } |
6630 | ||
46ccf50a JM |
6631 | /* Returns the number of extern "LANG" blocks we are nested within. */ |
6632 | ||
6633 | int | |
94edc4ab | 6634 | current_lang_depth (void) |
46ccf50a | 6635 | { |
aff44741 | 6636 | return VEC_length (tree, current_lang_base); |
46ccf50a JM |
6637 | } |
6638 | ||
8d08fdba MS |
6639 | /* Set global variables CURRENT_LANG_NAME to appropriate value |
6640 | so that behavior of name-mangling machinery is correct. */ | |
6641 | ||
6642 | void | |
94edc4ab | 6643 | push_lang_context (tree name) |
8d08fdba | 6644 | { |
aff44741 | 6645 | VEC_safe_push (tree, gc, current_lang_base, current_lang_name); |
8d08fdba | 6646 | |
e229f2cd | 6647 | if (name == lang_name_cplusplus) |
8d08fdba | 6648 | { |
8d08fdba MS |
6649 | current_lang_name = name; |
6650 | } | |
e229f2cd PB |
6651 | else if (name == lang_name_java) |
6652 | { | |
e229f2cd PB |
6653 | current_lang_name = name; |
6654 | /* DECL_IGNORED_P is initially set for these types, to avoid clutter. | |
6655 | (See record_builtin_java_type in decl.c.) However, that causes | |
6656 | incorrect debug entries if these types are actually used. | |
00a17e31 | 6657 | So we re-enable debug output after extern "Java". */ |
e3cd9945 APB |
6658 | DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0; |
6659 | DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0; | |
6660 | DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0; | |
6661 | DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0; | |
6662 | DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0; | |
6663 | DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0; | |
6664 | DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0; | |
6665 | DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0; | |
e229f2cd | 6666 | } |
8d08fdba MS |
6667 | else if (name == lang_name_c) |
6668 | { | |
8d08fdba MS |
6669 | current_lang_name = name; |
6670 | } | |
6671 | else | |
9e637a26 | 6672 | error ("language string %<\"%E\"%> not recognized", name); |
8d08fdba | 6673 | } |
c8094d83 | 6674 | |
8d08fdba | 6675 | /* Get out of the current language scope. */ |
e92cc029 | 6676 | |
8d08fdba | 6677 | void |
94edc4ab | 6678 | pop_lang_context (void) |
8d08fdba | 6679 | { |
aff44741 | 6680 | current_lang_name = VEC_pop (tree, current_lang_base); |
8d08fdba | 6681 | } |
8d08fdba MS |
6682 | \f |
6683 | /* Type instantiation routines. */ | |
6684 | ||
104bf76a MM |
6685 | /* Given an OVERLOAD and a TARGET_TYPE, return the function that |
6686 | matches the TARGET_TYPE. If there is no satisfactory match, return | |
eff3a276 MM |
6687 | error_mark_node, and issue an error & warning messages under |
6688 | control of FLAGS. Permit pointers to member function if FLAGS | |
6689 | permits. If TEMPLATE_ONLY, the name of the overloaded function was | |
6690 | a template-id, and EXPLICIT_TARGS are the explicitly provided | |
248e1b22 MM |
6691 | template arguments. |
6692 | ||
6693 | If OVERLOAD is for one or more member functions, then ACCESS_PATH | |
6694 | is the base path used to reference those member functions. If | |
6695 | TF_NO_ACCESS_CONTROL is not set in FLAGS, and the address is | |
6696 | resolved to a member function, access checks will be performed and | |
6697 | errors issued if appropriate. */ | |
104bf76a | 6698 | |
2c73f9f5 | 6699 | static tree |
c8094d83 | 6700 | resolve_address_of_overloaded_function (tree target_type, |
94edc4ab | 6701 | tree overload, |
92af500d NS |
6702 | tsubst_flags_t flags, |
6703 | bool template_only, | |
eff3a276 MM |
6704 | tree explicit_targs, |
6705 | tree access_path) | |
2c73f9f5 | 6706 | { |
104bf76a | 6707 | /* Here's what the standard says: |
c8094d83 | 6708 | |
104bf76a MM |
6709 | [over.over] |
6710 | ||
6711 | If the name is a function template, template argument deduction | |
6712 | is done, and if the argument deduction succeeds, the deduced | |
6713 | arguments are used to generate a single template function, which | |
6714 | is added to the set of overloaded functions considered. | |
6715 | ||
6716 | Non-member functions and static member functions match targets of | |
6717 | type "pointer-to-function" or "reference-to-function." Nonstatic | |
6718 | member functions match targets of type "pointer-to-member | |
6719 | function;" the function type of the pointer to member is used to | |
6720 | select the member function from the set of overloaded member | |
6721 | functions. If a nonstatic member function is selected, the | |
6722 | reference to the overloaded function name is required to have the | |
6723 | form of a pointer to member as described in 5.3.1. | |
6724 | ||
6725 | If more than one function is selected, any template functions in | |
6726 | the set are eliminated if the set also contains a non-template | |
6727 | function, and any given template function is eliminated if the | |
6728 | set contains a second template function that is more specialized | |
6729 | than the first according to the partial ordering rules 14.5.5.2. | |
6730 | After such eliminations, if any, there shall remain exactly one | |
6731 | selected function. */ | |
6732 | ||
6733 | int is_ptrmem = 0; | |
104bf76a MM |
6734 | /* We store the matches in a TREE_LIST rooted here. The functions |
6735 | are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy | |
6736 | interoperability with most_specialized_instantiation. */ | |
6737 | tree matches = NULL_TREE; | |
50714e79 | 6738 | tree fn; |
7bead48f | 6739 | tree target_fn_type; |
104bf76a | 6740 | |
d8f8dca1 MM |
6741 | /* By the time we get here, we should be seeing only real |
6742 | pointer-to-member types, not the internal POINTER_TYPE to | |
6743 | METHOD_TYPE representation. */ | |
50bc768d NS |
6744 | gcc_assert (TREE_CODE (target_type) != POINTER_TYPE |
6745 | || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE); | |
104bf76a | 6746 | |
50bc768d | 6747 | gcc_assert (is_overloaded_fn (overload)); |
c8094d83 | 6748 | |
104bf76a MM |
6749 | /* Check that the TARGET_TYPE is reasonable. */ |
6750 | if (TYPE_PTRFN_P (target_type)) | |
381ddaa6 | 6751 | /* This is OK. */; |
104bf76a MM |
6752 | else if (TYPE_PTRMEMFUNC_P (target_type)) |
6753 | /* This is OK, too. */ | |
6754 | is_ptrmem = 1; | |
6755 | else if (TREE_CODE (target_type) == FUNCTION_TYPE) | |
db80e34e JJ |
6756 | /* This is OK, too. This comes from a conversion to reference |
6757 | type. */ | |
6758 | target_type = build_reference_type (target_type); | |
c8094d83 | 6759 | else |
104bf76a | 6760 | { |
92af500d | 6761 | if (flags & tf_error) |
c4f73174 | 6762 | error ("cannot resolve overloaded function %qD based on" |
0cbd7506 MS |
6763 | " conversion to type %qT", |
6764 | DECL_NAME (OVL_FUNCTION (overload)), target_type); | |
104bf76a MM |
6765 | return error_mark_node; |
6766 | } | |
c8094d83 | 6767 | |
7bead48f JM |
6768 | /* Non-member functions and static member functions match targets of type |
6769 | "pointer-to-function" or "reference-to-function." Nonstatic member | |
6770 | functions match targets of type "pointer-to-member-function;" the | |
6771 | function type of the pointer to member is used to select the member | |
6772 | function from the set of overloaded member functions. | |
6773 | ||
6774 | So figure out the FUNCTION_TYPE that we want to match against. */ | |
6775 | target_fn_type = static_fn_type (target_type); | |
6776 | ||
104bf76a MM |
6777 | /* If we can find a non-template function that matches, we can just |
6778 | use it. There's no point in generating template instantiations | |
6779 | if we're just going to throw them out anyhow. But, of course, we | |
6780 | can only do this when we don't *need* a template function. */ | |
6781 | if (!template_only) | |
6782 | { | |
6783 | tree fns; | |
6784 | ||
a723baf1 | 6785 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 6786 | { |
a723baf1 | 6787 | tree fn = OVL_CURRENT (fns); |
2c73f9f5 | 6788 | |
104bf76a MM |
6789 | if (TREE_CODE (fn) == TEMPLATE_DECL) |
6790 | /* We're not looking for templates just yet. */ | |
6791 | continue; | |
6792 | ||
6793 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
6794 | != is_ptrmem) | |
6795 | /* We're looking for a non-static member, and this isn't | |
6796 | one, or vice versa. */ | |
6797 | continue; | |
34ff2673 | 6798 | |
d63d5d0c ILT |
6799 | /* Ignore functions which haven't been explicitly |
6800 | declared. */ | |
34ff2673 RS |
6801 | if (DECL_ANTICIPATED (fn)) |
6802 | continue; | |
6803 | ||
104bf76a | 6804 | /* See if there's a match. */ |
7bead48f | 6805 | if (same_type_p (target_fn_type, static_fn_type (fn))) |
e1b3e07d | 6806 | matches = tree_cons (fn, NULL_TREE, matches); |
104bf76a MM |
6807 | } |
6808 | } | |
6809 | ||
6810 | /* Now, if we've already got a match (or matches), there's no need | |
6811 | to proceed to the template functions. But, if we don't have a | |
6812 | match we need to look at them, too. */ | |
c8094d83 | 6813 | if (!matches) |
2c73f9f5 | 6814 | { |
104bf76a | 6815 | tree target_arg_types; |
8d3631f8 | 6816 | tree target_ret_type; |
104bf76a | 6817 | tree fns; |
c166b898 ILT |
6818 | tree *args; |
6819 | unsigned int nargs, ia; | |
6820 | tree arg; | |
104bf76a | 6821 | |
4393e105 | 6822 | target_arg_types = TYPE_ARG_TYPES (target_fn_type); |
8d3631f8 | 6823 | target_ret_type = TREE_TYPE (target_fn_type); |
e5214479 | 6824 | |
c166b898 ILT |
6825 | nargs = list_length (target_arg_types); |
6826 | args = XALLOCAVEC (tree, nargs); | |
6827 | for (arg = target_arg_types, ia = 0; | |
6828 | arg != NULL_TREE && arg != void_list_node; | |
6829 | arg = TREE_CHAIN (arg), ++ia) | |
6830 | args[ia] = TREE_VALUE (arg); | |
6831 | nargs = ia; | |
6832 | ||
a723baf1 | 6833 | for (fns = overload; fns; fns = OVL_NEXT (fns)) |
104bf76a | 6834 | { |
a723baf1 | 6835 | tree fn = OVL_CURRENT (fns); |
104bf76a | 6836 | tree instantiation; |
104bf76a MM |
6837 | tree targs; |
6838 | ||
6839 | if (TREE_CODE (fn) != TEMPLATE_DECL) | |
6840 | /* We're only looking for templates. */ | |
6841 | continue; | |
6842 | ||
6843 | if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
6844 | != is_ptrmem) | |
4393e105 | 6845 | /* We're not looking for a non-static member, and this is |
104bf76a MM |
6846 | one, or vice versa. */ |
6847 | continue; | |
6848 | ||
104bf76a | 6849 | /* Try to do argument deduction. */ |
f31c0a32 | 6850 | targs = make_tree_vec (DECL_NTPARMS (fn)); |
c166b898 ILT |
6851 | if (fn_type_unification (fn, explicit_targs, targs, args, nargs, |
6852 | target_ret_type, DEDUCE_EXACT, | |
3d2f6864 | 6853 | LOOKUP_NORMAL, false)) |
104bf76a MM |
6854 | /* Argument deduction failed. */ |
6855 | continue; | |
6856 | ||
6857 | /* Instantiate the template. */ | |
92af500d | 6858 | instantiation = instantiate_template (fn, targs, flags); |
104bf76a MM |
6859 | if (instantiation == error_mark_node) |
6860 | /* Instantiation failed. */ | |
6861 | continue; | |
6862 | ||
6863 | /* See if there's a match. */ | |
7bead48f | 6864 | if (same_type_p (target_fn_type, static_fn_type (instantiation))) |
e1b3e07d | 6865 | matches = tree_cons (instantiation, fn, matches); |
104bf76a MM |
6866 | } |
6867 | ||
6868 | /* Now, remove all but the most specialized of the matches. */ | |
6869 | if (matches) | |
6870 | { | |
e5214479 | 6871 | tree match = most_specialized_instantiation (matches); |
104bf76a MM |
6872 | |
6873 | if (match != error_mark_node) | |
3db45ab5 MS |
6874 | matches = tree_cons (TREE_PURPOSE (match), |
6875 | NULL_TREE, | |
7ca383e6 | 6876 | NULL_TREE); |
104bf76a MM |
6877 | } |
6878 | } | |
6879 | ||
6880 | /* Now we should have exactly one function in MATCHES. */ | |
6881 | if (matches == NULL_TREE) | |
6882 | { | |
6883 | /* There were *no* matches. */ | |
92af500d | 6884 | if (flags & tf_error) |
104bf76a | 6885 | { |
0cbd7506 | 6886 | error ("no matches converting function %qD to type %q#T", |
95e20768 | 6887 | DECL_NAME (OVL_CURRENT (overload)), |
0cbd7506 | 6888 | target_type); |
6b9b6b15 | 6889 | |
c224bdc1 | 6890 | print_candidates (overload); |
104bf76a MM |
6891 | } |
6892 | return error_mark_node; | |
2c73f9f5 | 6893 | } |
104bf76a MM |
6894 | else if (TREE_CHAIN (matches)) |
6895 | { | |
e04c614e JM |
6896 | /* There were too many matches. First check if they're all |
6897 | the same function. */ | |
6898 | tree match; | |
104bf76a | 6899 | |
e04c614e JM |
6900 | fn = TREE_PURPOSE (matches); |
6901 | for (match = TREE_CHAIN (matches); match; match = TREE_CHAIN (match)) | |
c4bcc71f | 6902 | if (!decls_match (fn, TREE_PURPOSE (match))) |
e04c614e JM |
6903 | break; |
6904 | ||
6905 | if (match) | |
104bf76a | 6906 | { |
e04c614e JM |
6907 | if (flags & tf_error) |
6908 | { | |
6909 | error ("converting overloaded function %qD to type %q#T is ambiguous", | |
6910 | DECL_NAME (OVL_FUNCTION (overload)), | |
6911 | target_type); | |
104bf76a | 6912 | |
e04c614e JM |
6913 | /* Since print_candidates expects the functions in the |
6914 | TREE_VALUE slot, we flip them here. */ | |
6915 | for (match = matches; match; match = TREE_CHAIN (match)) | |
6916 | TREE_VALUE (match) = TREE_PURPOSE (match); | |
104bf76a | 6917 | |
e04c614e JM |
6918 | print_candidates (matches); |
6919 | } | |
104bf76a | 6920 | |
e04c614e | 6921 | return error_mark_node; |
104bf76a | 6922 | } |
104bf76a MM |
6923 | } |
6924 | ||
50714e79 MM |
6925 | /* Good, exactly one match. Now, convert it to the correct type. */ |
6926 | fn = TREE_PURPOSE (matches); | |
6927 | ||
b1ce3eb2 | 6928 | if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn) |
92af500d | 6929 | && !(flags & tf_ptrmem_ok) && !flag_ms_extensions) |
19420d00 | 6930 | { |
b1ce3eb2 | 6931 | static int explained; |
c8094d83 | 6932 | |
92af500d | 6933 | if (!(flags & tf_error)) |
0cbd7506 | 6934 | return error_mark_node; |
19420d00 | 6935 | |
cbe5f3b3 | 6936 | permerror (input_location, "assuming pointer to member %qD", fn); |
b1ce3eb2 | 6937 | if (!explained) |
0cbd7506 | 6938 | { |
1f5b3869 | 6939 | inform (input_location, "(a pointer to member can only be formed with %<&%E%>)", fn); |
0cbd7506 MS |
6940 | explained = 1; |
6941 | } | |
19420d00 | 6942 | } |
84583208 MM |
6943 | |
6944 | /* If we're doing overload resolution purely for the purpose of | |
6945 | determining conversion sequences, we should not consider the | |
6946 | function used. If this conversion sequence is selected, the | |
6947 | function will be marked as used at this point. */ | |
6948 | if (!(flags & tf_conv)) | |
eff3a276 | 6949 | { |
4ad610c9 JM |
6950 | /* Make =delete work with SFINAE. */ |
6951 | if (DECL_DELETED_FN (fn) && !(flags & tf_error)) | |
6952 | return error_mark_node; | |
6953 | ||
eff3a276 | 6954 | mark_used (fn); |
248e1b22 MM |
6955 | } |
6956 | ||
6957 | /* We could not check access to member functions when this | |
6958 | expression was originally created since we did not know at that | |
6959 | time to which function the expression referred. */ | |
6960 | if (!(flags & tf_no_access_control) | |
6961 | && DECL_FUNCTION_MEMBER_P (fn)) | |
6962 | { | |
6963 | gcc_assert (access_path); | |
6964 | perform_or_defer_access_check (access_path, fn, fn); | |
eff3a276 | 6965 | } |
a6ecf8b6 | 6966 | |
50714e79 | 6967 | if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type)) |
93c0e0bb | 6968 | return cp_build_addr_expr (fn, flags); |
50714e79 MM |
6969 | else |
6970 | { | |
5ade1ed2 | 6971 | /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op |
50714e79 MM |
6972 | will mark the function as addressed, but here we must do it |
6973 | explicitly. */ | |
dffd7eb6 | 6974 | cxx_mark_addressable (fn); |
50714e79 MM |
6975 | |
6976 | return fn; | |
6977 | } | |
2c73f9f5 ML |
6978 | } |
6979 | ||
ec255269 MS |
6980 | /* This function will instantiate the type of the expression given in |
6981 | RHS to match the type of LHSTYPE. If errors exist, then return | |
92af500d | 6982 | error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then |
5e76004e NS |
6983 | we complain on errors. If we are not complaining, never modify rhs, |
6984 | as overload resolution wants to try many possible instantiations, in | |
6985 | the hope that at least one will work. | |
c8094d83 | 6986 | |
e6e174e5 JM |
6987 | For non-recursive calls, LHSTYPE should be a function, pointer to |
6988 | function, or a pointer to member function. */ | |
e92cc029 | 6989 | |
8d08fdba | 6990 | tree |
94edc4ab | 6991 | instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags) |
8d08fdba | 6992 | { |
92af500d | 6993 | tsubst_flags_t flags_in = flags; |
eff3a276 | 6994 | tree access_path = NULL_TREE; |
c8094d83 | 6995 | |
c2ea3a40 | 6996 | flags &= ~tf_ptrmem_ok; |
c8094d83 | 6997 | |
fbfc8363 | 6998 | if (lhstype == unknown_type_node) |
8d08fdba | 6999 | { |
92af500d | 7000 | if (flags & tf_error) |
8251199e | 7001 | error ("not enough type information"); |
8d08fdba MS |
7002 | return error_mark_node; |
7003 | } | |
7004 | ||
7005 | if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs))) | |
abff8e06 | 7006 | { |
8f4b394d | 7007 | if (same_type_p (lhstype, TREE_TYPE (rhs))) |
abff8e06 | 7008 | return rhs; |
c8094d83 | 7009 | if (flag_ms_extensions |
a723baf1 MM |
7010 | && TYPE_PTRMEMFUNC_P (lhstype) |
7011 | && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs))) | |
7012 | /* Microsoft allows `A::f' to be resolved to a | |
7013 | pointer-to-member. */ | |
7014 | ; | |
7015 | else | |
7016 | { | |
92af500d | 7017 | if (flags & tf_error) |
c3c1f2b7 PC |
7018 | error ("cannot convert %qE from type %qT to type %qT", |
7019 | rhs, TREE_TYPE (rhs), lhstype); | |
a723baf1 MM |
7020 | return error_mark_node; |
7021 | } | |
abff8e06 | 7022 | } |
8d08fdba | 7023 | |
c5ce25ce | 7024 | if (BASELINK_P (rhs)) |
eff3a276 MM |
7025 | { |
7026 | access_path = BASELINK_ACCESS_BINFO (rhs); | |
7027 | rhs = BASELINK_FUNCTIONS (rhs); | |
7028 | } | |
50ad9642 | 7029 | |
5ae9ba3e MM |
7030 | /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot |
7031 | deduce any type information. */ | |
7032 | if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR) | |
7033 | { | |
7034 | if (flags & tf_error) | |
7035 | error ("not enough type information"); | |
7036 | return error_mark_node; | |
7037 | } | |
7038 | ||
eff3a276 MM |
7039 | /* There only a few kinds of expressions that may have a type |
7040 | dependent on overload resolution. */ | |
7041 | gcc_assert (TREE_CODE (rhs) == ADDR_EXPR | |
7042 | || TREE_CODE (rhs) == COMPONENT_REF | |
95e20768 NS |
7043 | || really_overloaded_fn (rhs) |
7044 | || (flag_ms_extensions && TREE_CODE (rhs) == FUNCTION_DECL)); | |
c73964b2 | 7045 | |
8d08fdba MS |
7046 | /* This should really only be used when attempting to distinguish |
7047 | what sort of a pointer to function we have. For now, any | |
7048 | arithmetic operation which is not supported on pointers | |
7049 | is rejected as an error. */ | |
7050 | ||
7051 | switch (TREE_CODE (rhs)) | |
7052 | { | |
8d08fdba | 7053 | case COMPONENT_REF: |
92af500d | 7054 | { |
5ae9ba3e | 7055 | tree member = TREE_OPERAND (rhs, 1); |
92af500d | 7056 | |
5ae9ba3e MM |
7057 | member = instantiate_type (lhstype, member, flags); |
7058 | if (member != error_mark_node | |
92af500d | 7059 | && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0))) |
04c06002 | 7060 | /* Do not lose object's side effects. */ |
5ae9ba3e MM |
7061 | return build2 (COMPOUND_EXPR, TREE_TYPE (member), |
7062 | TREE_OPERAND (rhs, 0), member); | |
7063 | return member; | |
92af500d | 7064 | } |
8d08fdba | 7065 | |
2a238a97 | 7066 | case OFFSET_REF: |
05e0b2f4 JM |
7067 | rhs = TREE_OPERAND (rhs, 1); |
7068 | if (BASELINK_P (rhs)) | |
eff3a276 | 7069 | return instantiate_type (lhstype, rhs, flags_in); |
05e0b2f4 | 7070 | |
2a238a97 MM |
7071 | /* This can happen if we are forming a pointer-to-member for a |
7072 | member template. */ | |
50bc768d | 7073 | gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR); |
05e0b2f4 | 7074 | |
2a238a97 | 7075 | /* Fall through. */ |
874503bc | 7076 | |
386b8a85 | 7077 | case TEMPLATE_ID_EXPR: |
2bdb0643 JM |
7078 | { |
7079 | tree fns = TREE_OPERAND (rhs, 0); | |
7080 | tree args = TREE_OPERAND (rhs, 1); | |
7081 | ||
19420d00 | 7082 | return |
92af500d NS |
7083 | resolve_address_of_overloaded_function (lhstype, fns, flags_in, |
7084 | /*template_only=*/true, | |
eff3a276 | 7085 | args, access_path); |
2bdb0643 | 7086 | } |
386b8a85 | 7087 | |
2c73f9f5 | 7088 | case OVERLOAD: |
a723baf1 | 7089 | case FUNCTION_DECL: |
c8094d83 | 7090 | return |
92af500d NS |
7091 | resolve_address_of_overloaded_function (lhstype, rhs, flags_in, |
7092 | /*template_only=*/false, | |
eff3a276 MM |
7093 | /*explicit_targs=*/NULL_TREE, |
7094 | access_path); | |
2c73f9f5 | 7095 | |
ca36f057 | 7096 | case ADDR_EXPR: |
19420d00 NS |
7097 | { |
7098 | if (PTRMEM_OK_P (rhs)) | |
0cbd7506 | 7099 | flags |= tf_ptrmem_ok; |
c8094d83 | 7100 | |
ca36f057 | 7101 | return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags); |
19420d00 | 7102 | } |
ca36f057 MM |
7103 | |
7104 | case ERROR_MARK: | |
7105 | return error_mark_node; | |
7106 | ||
7107 | default: | |
8dc2b103 | 7108 | gcc_unreachable (); |
ca36f057 | 7109 | } |
8dc2b103 | 7110 | return error_mark_node; |
ca36f057 MM |
7111 | } |
7112 | \f | |
7113 | /* Return the name of the virtual function pointer field | |
7114 | (as an IDENTIFIER_NODE) for the given TYPE. Note that | |
7115 | this may have to look back through base types to find the | |
7116 | ultimate field name. (For single inheritance, these could | |
7117 | all be the same name. Who knows for multiple inheritance). */ | |
7118 | ||
7119 | static tree | |
94edc4ab | 7120 | get_vfield_name (tree type) |
ca36f057 | 7121 | { |
37a247a0 | 7122 | tree binfo, base_binfo; |
ca36f057 MM |
7123 | char *buf; |
7124 | ||
37a247a0 | 7125 | for (binfo = TYPE_BINFO (type); |
fa743e8c | 7126 | BINFO_N_BASE_BINFOS (binfo); |
37a247a0 NS |
7127 | binfo = base_binfo) |
7128 | { | |
7129 | base_binfo = BINFO_BASE_BINFO (binfo, 0); | |
ca36f057 | 7130 | |
37a247a0 NS |
7131 | if (BINFO_VIRTUAL_P (base_binfo) |
7132 | || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo))) | |
7133 | break; | |
7134 | } | |
c8094d83 | 7135 | |
ca36f057 | 7136 | type = BINFO_TYPE (binfo); |
67f5655f | 7137 | buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT) |
3db45ab5 | 7138 | + TYPE_NAME_LENGTH (type) + 2); |
ea122333 JM |
7139 | sprintf (buf, VFIELD_NAME_FORMAT, |
7140 | IDENTIFIER_POINTER (constructor_name (type))); | |
ca36f057 MM |
7141 | return get_identifier (buf); |
7142 | } | |
7143 | ||
7144 | void | |
94edc4ab | 7145 | print_class_statistics (void) |
ca36f057 MM |
7146 | { |
7147 | #ifdef GATHER_STATISTICS | |
7148 | fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness); | |
7149 | fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs); | |
ca36f057 MM |
7150 | if (n_vtables) |
7151 | { | |
7152 | fprintf (stderr, "vtables = %d; vtable searches = %d\n", | |
7153 | n_vtables, n_vtable_searches); | |
7154 | fprintf (stderr, "vtable entries = %d; vtable elems = %d\n", | |
7155 | n_vtable_entries, n_vtable_elems); | |
7156 | } | |
7157 | #endif | |
7158 | } | |
7159 | ||
7160 | /* Build a dummy reference to ourselves so Derived::Base (and A::A) works, | |
7161 | according to [class]: | |
0cbd7506 | 7162 | The class-name is also inserted |
ca36f057 MM |
7163 | into the scope of the class itself. For purposes of access checking, |
7164 | the inserted class name is treated as if it were a public member name. */ | |
7165 | ||
7166 | void | |
94edc4ab | 7167 | build_self_reference (void) |
ca36f057 MM |
7168 | { |
7169 | tree name = constructor_name (current_class_type); | |
7170 | tree value = build_lang_decl (TYPE_DECL, name, current_class_type); | |
7171 | tree saved_cas; | |
7172 | ||
7173 | DECL_NONLOCAL (value) = 1; | |
7174 | DECL_CONTEXT (value) = current_class_type; | |
7175 | DECL_ARTIFICIAL (value) = 1; | |
a3d87771 | 7176 | SET_DECL_SELF_REFERENCE_P (value); |
6f1abb06 | 7177 | set_underlying_type (value); |
ca36f057 MM |
7178 | |
7179 | if (processing_template_decl) | |
7180 | value = push_template_decl (value); | |
7181 | ||
7182 | saved_cas = current_access_specifier; | |
7183 | current_access_specifier = access_public_node; | |
7184 | finish_member_declaration (value); | |
7185 | current_access_specifier = saved_cas; | |
7186 | } | |
7187 | ||
7188 | /* Returns 1 if TYPE contains only padding bytes. */ | |
7189 | ||
7190 | int | |
94edc4ab | 7191 | is_empty_class (tree type) |
ca36f057 | 7192 | { |
ca36f057 MM |
7193 | if (type == error_mark_node) |
7194 | return 0; | |
7195 | ||
2588c9e9 | 7196 | if (! CLASS_TYPE_P (type)) |
ca36f057 MM |
7197 | return 0; |
7198 | ||
58731fd1 MM |
7199 | /* In G++ 3.2, whether or not a class was empty was determined by |
7200 | looking at its size. */ | |
7201 | if (abi_version_at_least (2)) | |
7202 | return CLASSTYPE_EMPTY_P (type); | |
7203 | else | |
7204 | return integer_zerop (CLASSTYPE_SIZE (type)); | |
ca36f057 MM |
7205 | } |
7206 | ||
956d9305 MM |
7207 | /* Returns true if TYPE contains an empty class. */ |
7208 | ||
7209 | static bool | |
7210 | contains_empty_class_p (tree type) | |
7211 | { | |
7212 | if (is_empty_class (type)) | |
7213 | return true; | |
7214 | if (CLASS_TYPE_P (type)) | |
7215 | { | |
7216 | tree field; | |
fa743e8c NS |
7217 | tree binfo; |
7218 | tree base_binfo; | |
956d9305 MM |
7219 | int i; |
7220 | ||
fa743e8c NS |
7221 | for (binfo = TYPE_BINFO (type), i = 0; |
7222 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7223 | if (contains_empty_class_p (BINFO_TYPE (base_binfo))) | |
956d9305 MM |
7224 | return true; |
7225 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
17bbb839 MM |
7226 | if (TREE_CODE (field) == FIELD_DECL |
7227 | && !DECL_ARTIFICIAL (field) | |
7228 | && is_empty_class (TREE_TYPE (field))) | |
956d9305 MM |
7229 | return true; |
7230 | } | |
7231 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7232 | return contains_empty_class_p (TREE_TYPE (type)); | |
7233 | return false; | |
7234 | } | |
7235 | ||
2588c9e9 | 7236 | /* Returns true if TYPE contains no actual data, just various |
0930cc0e | 7237 | possible combinations of empty classes and possibly a vptr. */ |
2588c9e9 JM |
7238 | |
7239 | bool | |
7240 | is_really_empty_class (tree type) | |
7241 | { | |
2588c9e9 JM |
7242 | if (CLASS_TYPE_P (type)) |
7243 | { | |
7244 | tree field; | |
7245 | tree binfo; | |
7246 | tree base_binfo; | |
7247 | int i; | |
7248 | ||
0930cc0e JM |
7249 | /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid |
7250 | out, but we'd like to be able to check this before then. */ | |
7251 | if (COMPLETE_TYPE_P (type) && is_empty_class (type)) | |
7252 | return true; | |
7253 | ||
2588c9e9 JM |
7254 | for (binfo = TYPE_BINFO (type), i = 0; |
7255 | BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) | |
7256 | if (!is_really_empty_class (BINFO_TYPE (base_binfo))) | |
7257 | return false; | |
910ad8de | 7258 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) |
2588c9e9 JM |
7259 | if (TREE_CODE (field) == FIELD_DECL |
7260 | && !DECL_ARTIFICIAL (field) | |
7261 | && !is_really_empty_class (TREE_TYPE (field))) | |
7262 | return false; | |
7263 | return true; | |
7264 | } | |
7265 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
7266 | return is_really_empty_class (TREE_TYPE (type)); | |
7267 | return false; | |
7268 | } | |
7269 | ||
ca36f057 MM |
7270 | /* Note that NAME was looked up while the current class was being |
7271 | defined and that the result of that lookup was DECL. */ | |
7272 | ||
7273 | void | |
94edc4ab | 7274 | maybe_note_name_used_in_class (tree name, tree decl) |
ca36f057 MM |
7275 | { |
7276 | splay_tree names_used; | |
7277 | ||
7278 | /* If we're not defining a class, there's nothing to do. */ | |
39fb05d0 | 7279 | if (!(innermost_scope_kind() == sk_class |
d5f4eddd JM |
7280 | && TYPE_BEING_DEFINED (current_class_type) |
7281 | && !LAMBDA_TYPE_P (current_class_type))) | |
ca36f057 | 7282 | return; |
c8094d83 | 7283 | |
ca36f057 MM |
7284 | /* If there's already a binding for this NAME, then we don't have |
7285 | anything to worry about. */ | |
c8094d83 | 7286 | if (lookup_member (current_class_type, name, |
db422ace | 7287 | /*protect=*/0, /*want_type=*/false, tf_warning_or_error)) |
ca36f057 MM |
7288 | return; |
7289 | ||
7290 | if (!current_class_stack[current_class_depth - 1].names_used) | |
7291 | current_class_stack[current_class_depth - 1].names_used | |
7292 | = splay_tree_new (splay_tree_compare_pointers, 0, 0); | |
7293 | names_used = current_class_stack[current_class_depth - 1].names_used; | |
7294 | ||
7295 | splay_tree_insert (names_used, | |
c8094d83 | 7296 | (splay_tree_key) name, |
ca36f057 MM |
7297 | (splay_tree_value) decl); |
7298 | } | |
7299 | ||
7300 | /* Note that NAME was declared (as DECL) in the current class. Check | |
0e339752 | 7301 | to see that the declaration is valid. */ |
ca36f057 MM |
7302 | |
7303 | void | |
94edc4ab | 7304 | note_name_declared_in_class (tree name, tree decl) |
ca36f057 MM |
7305 | { |
7306 | splay_tree names_used; | |
7307 | splay_tree_node n; | |
7308 | ||
7309 | /* Look to see if we ever used this name. */ | |
c8094d83 | 7310 | names_used |
ca36f057 MM |
7311 | = current_class_stack[current_class_depth - 1].names_used; |
7312 | if (!names_used) | |
7313 | return; | |
8ce1235b KT |
7314 | /* The C language allows members to be declared with a type of the same |
7315 | name, and the C++ standard says this diagnostic is not required. So | |
7316 | allow it in extern "C" blocks unless predantic is specified. | |
7317 | Allow it in all cases if -ms-extensions is specified. */ | |
7318 | if ((!pedantic && current_lang_name == lang_name_c) | |
7319 | || flag_ms_extensions) | |
7320 | return; | |
ca36f057 MM |
7321 | n = splay_tree_lookup (names_used, (splay_tree_key) name); |
7322 | if (n) | |
7323 | { | |
7324 | /* [basic.scope.class] | |
c8094d83 | 7325 | |
ca36f057 MM |
7326 | A name N used in a class S shall refer to the same declaration |
7327 | in its context and when re-evaluated in the completed scope of | |
7328 | S. */ | |
cbe5f3b3 MLI |
7329 | permerror (input_location, "declaration of %q#D", decl); |
7330 | permerror (input_location, "changes meaning of %qD from %q+#D", | |
2ae2031e | 7331 | DECL_NAME (OVL_CURRENT (decl)), (tree) n->value); |
ca36f057 MM |
7332 | } |
7333 | } | |
7334 | ||
3461fba7 NS |
7335 | /* Returns the VAR_DECL for the complete vtable associated with BINFO. |
7336 | Secondary vtables are merged with primary vtables; this function | |
7337 | will return the VAR_DECL for the primary vtable. */ | |
ca36f057 | 7338 | |
c35cce41 | 7339 | tree |
94edc4ab | 7340 | get_vtbl_decl_for_binfo (tree binfo) |
c35cce41 MM |
7341 | { |
7342 | tree decl; | |
7343 | ||
7344 | decl = BINFO_VTABLE (binfo); | |
5be014d5 | 7345 | if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR) |
c35cce41 | 7346 | { |
50bc768d | 7347 | gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR); |
c35cce41 MM |
7348 | decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0); |
7349 | } | |
7350 | if (decl) | |
50bc768d | 7351 | gcc_assert (TREE_CODE (decl) == VAR_DECL); |
c35cce41 MM |
7352 | return decl; |
7353 | } | |
7354 | ||
911a71a7 | 7355 | |
dbbf88d1 NS |
7356 | /* Returns the binfo for the primary base of BINFO. If the resulting |
7357 | BINFO is a virtual base, and it is inherited elsewhere in the | |
7358 | hierarchy, then the returned binfo might not be the primary base of | |
7359 | BINFO in the complete object. Check BINFO_PRIMARY_P or | |
7360 | BINFO_LOST_PRIMARY_P to be sure. */ | |
911a71a7 | 7361 | |
b5791fdc | 7362 | static tree |
94edc4ab | 7363 | get_primary_binfo (tree binfo) |
911a71a7 MM |
7364 | { |
7365 | tree primary_base; | |
c8094d83 | 7366 | |
911a71a7 MM |
7367 | primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo)); |
7368 | if (!primary_base) | |
7369 | return NULL_TREE; | |
7370 | ||
b5791fdc | 7371 | return copied_binfo (primary_base, binfo); |
911a71a7 MM |
7372 | } |
7373 | ||
838dfd8a | 7374 | /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */ |
b7442fb5 NS |
7375 | |
7376 | static int | |
94edc4ab | 7377 | maybe_indent_hierarchy (FILE * stream, int indent, int indented_p) |
b7442fb5 NS |
7378 | { |
7379 | if (!indented_p) | |
7380 | fprintf (stream, "%*s", indent, ""); | |
7381 | return 1; | |
7382 | } | |
7383 | ||
dbbf88d1 NS |
7384 | /* Dump the offsets of all the bases rooted at BINFO to STREAM. |
7385 | INDENT should be zero when called from the top level; it is | |
7386 | incremented recursively. IGO indicates the next expected BINFO in | |
9bcb9aae | 7387 | inheritance graph ordering. */ |
c35cce41 | 7388 | |
dbbf88d1 NS |
7389 | static tree |
7390 | dump_class_hierarchy_r (FILE *stream, | |
0cbd7506 MS |
7391 | int flags, |
7392 | tree binfo, | |
7393 | tree igo, | |
7394 | int indent) | |
ca36f057 | 7395 | { |
b7442fb5 | 7396 | int indented = 0; |
fa743e8c NS |
7397 | tree base_binfo; |
7398 | int i; | |
c8094d83 | 7399 | |
b7442fb5 NS |
7400 | indented = maybe_indent_hierarchy (stream, indent, 0); |
7401 | fprintf (stream, "%s (0x%lx) ", | |
fc6633e0 | 7402 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER), |
b7442fb5 | 7403 | (unsigned long) binfo); |
dbbf88d1 NS |
7404 | if (binfo != igo) |
7405 | { | |
7406 | fprintf (stream, "alternative-path\n"); | |
7407 | return igo; | |
7408 | } | |
7409 | igo = TREE_CHAIN (binfo); | |
c8094d83 | 7410 | |
9965d119 | 7411 | fprintf (stream, HOST_WIDE_INT_PRINT_DEC, |
ca36f057 | 7412 | tree_low_cst (BINFO_OFFSET (binfo), 0)); |
9965d119 NS |
7413 | if (is_empty_class (BINFO_TYPE (binfo))) |
7414 | fprintf (stream, " empty"); | |
7415 | else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo))) | |
7416 | fprintf (stream, " nearly-empty"); | |
809e3e7f | 7417 | if (BINFO_VIRTUAL_P (binfo)) |
dbbf88d1 | 7418 | fprintf (stream, " virtual"); |
9965d119 | 7419 | fprintf (stream, "\n"); |
ca36f057 | 7420 | |
b7442fb5 | 7421 | indented = 0; |
fc6633e0 | 7422 | if (BINFO_PRIMARY_P (binfo)) |
b7442fb5 NS |
7423 | { |
7424 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7425 | fprintf (stream, " primary-for %s (0x%lx)", | |
fc6633e0 | 7426 | type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)), |
b7442fb5 | 7427 | TFF_PLAIN_IDENTIFIER), |
fc6633e0 | 7428 | (unsigned long)BINFO_INHERITANCE_CHAIN (binfo)); |
b7442fb5 NS |
7429 | } |
7430 | if (BINFO_LOST_PRIMARY_P (binfo)) | |
7431 | { | |
7432 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7433 | fprintf (stream, " lost-primary"); | |
7434 | } | |
7435 | if (indented) | |
7436 | fprintf (stream, "\n"); | |
7437 | ||
7438 | if (!(flags & TDF_SLIM)) | |
7439 | { | |
7440 | int indented = 0; | |
c8094d83 | 7441 | |
b7442fb5 NS |
7442 | if (BINFO_SUBVTT_INDEX (binfo)) |
7443 | { | |
7444 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7445 | fprintf (stream, " subvttidx=%s", | |
7446 | expr_as_string (BINFO_SUBVTT_INDEX (binfo), | |
7447 | TFF_PLAIN_IDENTIFIER)); | |
7448 | } | |
7449 | if (BINFO_VPTR_INDEX (binfo)) | |
7450 | { | |
7451 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7452 | fprintf (stream, " vptridx=%s", | |
7453 | expr_as_string (BINFO_VPTR_INDEX (binfo), | |
7454 | TFF_PLAIN_IDENTIFIER)); | |
7455 | } | |
7456 | if (BINFO_VPTR_FIELD (binfo)) | |
7457 | { | |
7458 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7459 | fprintf (stream, " vbaseoffset=%s", | |
7460 | expr_as_string (BINFO_VPTR_FIELD (binfo), | |
7461 | TFF_PLAIN_IDENTIFIER)); | |
7462 | } | |
7463 | if (BINFO_VTABLE (binfo)) | |
7464 | { | |
7465 | indented = maybe_indent_hierarchy (stream, indent + 3, indented); | |
7466 | fprintf (stream, " vptr=%s", | |
7467 | expr_as_string (BINFO_VTABLE (binfo), | |
7468 | TFF_PLAIN_IDENTIFIER)); | |
7469 | } | |
c8094d83 | 7470 | |
b7442fb5 NS |
7471 | if (indented) |
7472 | fprintf (stream, "\n"); | |
7473 | } | |
dbbf88d1 | 7474 | |
fa743e8c NS |
7475 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) |
7476 | igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2); | |
c8094d83 | 7477 | |
dbbf88d1 | 7478 | return igo; |
c35cce41 MM |
7479 | } |
7480 | ||
7481 | /* Dump the BINFO hierarchy for T. */ | |
7482 | ||
b7442fb5 | 7483 | static void |
bb885938 | 7484 | dump_class_hierarchy_1 (FILE *stream, int flags, tree t) |
c35cce41 | 7485 | { |
b7442fb5 NS |
7486 | fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER)); |
7487 | fprintf (stream, " size=%lu align=%lu\n", | |
7488 | (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT), | |
7489 | (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT)); | |
dbbf88d1 NS |
7490 | fprintf (stream, " base size=%lu base align=%lu\n", |
7491 | (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0) | |
7492 | / BITS_PER_UNIT), | |
7493 | (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t)) | |
7494 | / BITS_PER_UNIT)); | |
7495 | dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0); | |
b7442fb5 | 7496 | fprintf (stream, "\n"); |
bb885938 NS |
7497 | } |
7498 | ||
da1d7781 | 7499 | /* Debug interface to hierarchy dumping. */ |
bb885938 | 7500 | |
ac1f3b7e | 7501 | void |
bb885938 NS |
7502 | debug_class (tree t) |
7503 | { | |
7504 | dump_class_hierarchy_1 (stderr, TDF_SLIM, t); | |
7505 | } | |
7506 | ||
7507 | static void | |
7508 | dump_class_hierarchy (tree t) | |
7509 | { | |
7510 | int flags; | |
7511 | FILE *stream = dump_begin (TDI_class, &flags); | |
7512 | ||
7513 | if (stream) | |
7514 | { | |
7515 | dump_class_hierarchy_1 (stream, flags, t); | |
7516 | dump_end (TDI_class, stream); | |
7517 | } | |
b7442fb5 NS |
7518 | } |
7519 | ||
7520 | static void | |
94edc4ab | 7521 | dump_array (FILE * stream, tree decl) |
b7442fb5 | 7522 | { |
4038c495 GB |
7523 | tree value; |
7524 | unsigned HOST_WIDE_INT ix; | |
b7442fb5 NS |
7525 | HOST_WIDE_INT elt; |
7526 | tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl))); | |
7527 | ||
7528 | elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0) | |
7529 | / BITS_PER_UNIT); | |
7530 | fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER)); | |
7531 | fprintf (stream, " %s entries", | |
7532 | expr_as_string (size_binop (PLUS_EXPR, size, size_one_node), | |
7533 | TFF_PLAIN_IDENTIFIER)); | |
7534 | fprintf (stream, "\n"); | |
7535 | ||
4038c495 GB |
7536 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)), |
7537 | ix, value) | |
4fdc14ca | 7538 | fprintf (stream, "%-4ld %s\n", (long)(ix * elt), |
4038c495 | 7539 | expr_as_string (value, TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
7540 | } |
7541 | ||
7542 | static void | |
94edc4ab | 7543 | dump_vtable (tree t, tree binfo, tree vtable) |
b7442fb5 NS |
7544 | { |
7545 | int flags; | |
7546 | FILE *stream = dump_begin (TDI_class, &flags); | |
7547 | ||
7548 | if (!stream) | |
7549 | return; | |
7550 | ||
7551 | if (!(flags & TDF_SLIM)) | |
9965d119 | 7552 | { |
b7442fb5 | 7553 | int ctor_vtbl_p = TYPE_BINFO (t) != binfo; |
c8094d83 | 7554 | |
b7442fb5 NS |
7555 | fprintf (stream, "%s for %s", |
7556 | ctor_vtbl_p ? "Construction vtable" : "Vtable", | |
fc6633e0 | 7557 | type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER)); |
b7442fb5 NS |
7558 | if (ctor_vtbl_p) |
7559 | { | |
809e3e7f | 7560 | if (!BINFO_VIRTUAL_P (binfo)) |
b7442fb5 NS |
7561 | fprintf (stream, " (0x%lx instance)", (unsigned long)binfo); |
7562 | fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER)); | |
7563 | } | |
7564 | fprintf (stream, "\n"); | |
7565 | dump_array (stream, vtable); | |
7566 | fprintf (stream, "\n"); | |
9965d119 | 7567 | } |
c8094d83 | 7568 | |
b7442fb5 NS |
7569 | dump_end (TDI_class, stream); |
7570 | } | |
7571 | ||
7572 | static void | |
94edc4ab | 7573 | dump_vtt (tree t, tree vtt) |
b7442fb5 NS |
7574 | { |
7575 | int flags; | |
7576 | FILE *stream = dump_begin (TDI_class, &flags); | |
7577 | ||
7578 | if (!stream) | |
7579 | return; | |
7580 | ||
7581 | if (!(flags & TDF_SLIM)) | |
7582 | { | |
7583 | fprintf (stream, "VTT for %s\n", | |
7584 | type_as_string (t, TFF_PLAIN_IDENTIFIER)); | |
7585 | dump_array (stream, vtt); | |
7586 | fprintf (stream, "\n"); | |
7587 | } | |
c8094d83 | 7588 | |
b7442fb5 | 7589 | dump_end (TDI_class, stream); |
ca36f057 MM |
7590 | } |
7591 | ||
bb885938 NS |
7592 | /* Dump a function or thunk and its thunkees. */ |
7593 | ||
7594 | static void | |
7595 | dump_thunk (FILE *stream, int indent, tree thunk) | |
7596 | { | |
7597 | static const char spaces[] = " "; | |
7598 | tree name = DECL_NAME (thunk); | |
7599 | tree thunks; | |
c8094d83 | 7600 | |
bb885938 NS |
7601 | fprintf (stream, "%.*s%p %s %s", indent, spaces, |
7602 | (void *)thunk, | |
7603 | !DECL_THUNK_P (thunk) ? "function" | |
7604 | : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk", | |
7605 | name ? IDENTIFIER_POINTER (name) : "<unset>"); | |
e00853fd | 7606 | if (DECL_THUNK_P (thunk)) |
bb885938 NS |
7607 | { |
7608 | HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk); | |
7609 | tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk); | |
7610 | ||
7611 | fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust); | |
7612 | if (!virtual_adjust) | |
7613 | /*NOP*/; | |
7614 | else if (DECL_THIS_THUNK_P (thunk)) | |
7615 | fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC, | |
7616 | tree_low_cst (virtual_adjust, 0)); | |
7617 | else | |
7618 | fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)", | |
7619 | tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0), | |
7620 | type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE)); | |
e00853fd NS |
7621 | if (THUNK_ALIAS (thunk)) |
7622 | fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk)); | |
bb885938 NS |
7623 | } |
7624 | fprintf (stream, "\n"); | |
7625 | for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks)) | |
7626 | dump_thunk (stream, indent + 2, thunks); | |
7627 | } | |
7628 | ||
7629 | /* Dump the thunks for FN. */ | |
7630 | ||
ac1f3b7e | 7631 | void |
bb885938 NS |
7632 | debug_thunks (tree fn) |
7633 | { | |
7634 | dump_thunk (stderr, 0, fn); | |
7635 | } | |
7636 | ||
ca36f057 MM |
7637 | /* Virtual function table initialization. */ |
7638 | ||
7639 | /* Create all the necessary vtables for T and its base classes. */ | |
7640 | ||
7641 | static void | |
94edc4ab | 7642 | finish_vtbls (tree t) |
ca36f057 | 7643 | { |
3461fba7 | 7644 | tree vbase; |
9d6a019c NF |
7645 | VEC(constructor_elt,gc) *v = NULL; |
7646 | tree vtable = BINFO_VTABLE (TYPE_BINFO (t)); | |
ca36f057 | 7647 | |
3461fba7 NS |
7648 | /* We lay out the primary and secondary vtables in one contiguous |
7649 | vtable. The primary vtable is first, followed by the non-virtual | |
7650 | secondary vtables in inheritance graph order. */ | |
9d6a019c NF |
7651 | accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t), TYPE_BINFO (t), |
7652 | vtable, t, &v); | |
c8094d83 | 7653 | |
3461fba7 NS |
7654 | /* Then come the virtual bases, also in inheritance graph order. */ |
7655 | for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase)) | |
7656 | { | |
809e3e7f | 7657 | if (!BINFO_VIRTUAL_P (vbase)) |
3461fba7 | 7658 | continue; |
9d6a019c | 7659 | accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), vtable, t, &v); |
ff668506 JM |
7660 | } |
7661 | ||
604a3205 | 7662 | if (BINFO_VTABLE (TYPE_BINFO (t))) |
9d6a019c | 7663 | initialize_vtable (TYPE_BINFO (t), v); |
ca36f057 MM |
7664 | } |
7665 | ||
7666 | /* Initialize the vtable for BINFO with the INITS. */ | |
7667 | ||
7668 | static void | |
9d6a019c | 7669 | initialize_vtable (tree binfo, VEC(constructor_elt,gc) *inits) |
ca36f057 | 7670 | { |
ca36f057 MM |
7671 | tree decl; |
7672 | ||
9d6a019c | 7673 | layout_vtable_decl (binfo, VEC_length (constructor_elt, inits)); |
c35cce41 | 7674 | decl = get_vtbl_decl_for_binfo (binfo); |
19c29b2f | 7675 | initialize_artificial_var (decl, inits); |
b7442fb5 | 7676 | dump_vtable (BINFO_TYPE (binfo), binfo, decl); |
23656158 MM |
7677 | } |
7678 | ||
9965d119 NS |
7679 | /* Build the VTT (virtual table table) for T. |
7680 | A class requires a VTT if it has virtual bases. | |
c8094d83 | 7681 | |
9965d119 NS |
7682 | This holds |
7683 | 1 - primary virtual pointer for complete object T | |
90ecce3e JM |
7684 | 2 - secondary VTTs for each direct non-virtual base of T which requires a |
7685 | VTT | |
9965d119 NS |
7686 | 3 - secondary virtual pointers for each direct or indirect base of T which |
7687 | has virtual bases or is reachable via a virtual path from T. | |
7688 | 4 - secondary VTTs for each direct or indirect virtual base of T. | |
c8094d83 | 7689 | |
9965d119 | 7690 | Secondary VTTs look like complete object VTTs without part 4. */ |
23656158 MM |
7691 | |
7692 | static void | |
94edc4ab | 7693 | build_vtt (tree t) |
23656158 | 7694 | { |
23656158 MM |
7695 | tree type; |
7696 | tree vtt; | |
3ec6bad3 | 7697 | tree index; |
9d6a019c | 7698 | VEC(constructor_elt,gc) *inits; |
23656158 | 7699 | |
23656158 | 7700 | /* Build up the initializers for the VTT. */ |
9d6a019c | 7701 | inits = NULL; |
3ec6bad3 | 7702 | index = size_zero_node; |
9965d119 | 7703 | build_vtt_inits (TYPE_BINFO (t), t, &inits, &index); |
23656158 MM |
7704 | |
7705 | /* If we didn't need a VTT, we're done. */ | |
7706 | if (!inits) | |
7707 | return; | |
7708 | ||
7709 | /* Figure out the type of the VTT. */ | |
dcedcddb NF |
7710 | type = build_array_of_n_type (const_ptr_type_node, |
7711 | VEC_length (constructor_elt, inits)); | |
c8094d83 | 7712 | |
23656158 | 7713 | /* Now, build the VTT object itself. */ |
3e355d92 | 7714 | vtt = build_vtable (t, mangle_vtt_for_type (t), type); |
19c29b2f | 7715 | initialize_artificial_var (vtt, inits); |
548502d3 | 7716 | /* Add the VTT to the vtables list. */ |
910ad8de NF |
7717 | DECL_CHAIN (vtt) = DECL_CHAIN (CLASSTYPE_VTABLES (t)); |
7718 | DECL_CHAIN (CLASSTYPE_VTABLES (t)) = vtt; | |
b7442fb5 NS |
7719 | |
7720 | dump_vtt (t, vtt); | |
23656158 MM |
7721 | } |
7722 | ||
13de7ec4 JM |
7723 | /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with |
7724 | PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo, | |
7725 | and CHAIN the vtable pointer for this binfo after construction is | |
00a17e31 | 7726 | complete. VALUE can also be another BINFO, in which case we recurse. */ |
13de7ec4 JM |
7727 | |
7728 | static tree | |
94edc4ab | 7729 | binfo_ctor_vtable (tree binfo) |
13de7ec4 JM |
7730 | { |
7731 | tree vt; | |
7732 | ||
7733 | while (1) | |
7734 | { | |
7735 | vt = BINFO_VTABLE (binfo); | |
7736 | if (TREE_CODE (vt) == TREE_LIST) | |
7737 | vt = TREE_VALUE (vt); | |
95b4aca6 | 7738 | if (TREE_CODE (vt) == TREE_BINFO) |
13de7ec4 JM |
7739 | binfo = vt; |
7740 | else | |
7741 | break; | |
7742 | } | |
7743 | ||
7744 | return vt; | |
7745 | } | |
7746 | ||
a3a0fc7f NS |
7747 | /* Data for secondary VTT initialization. */ |
7748 | typedef struct secondary_vptr_vtt_init_data_s | |
7749 | { | |
7750 | /* Is this the primary VTT? */ | |
7751 | bool top_level_p; | |
7752 | ||
7753 | /* Current index into the VTT. */ | |
7754 | tree index; | |
7755 | ||
9d6a019c NF |
7756 | /* Vector of initializers built up. */ |
7757 | VEC(constructor_elt,gc) *inits; | |
a3a0fc7f NS |
7758 | |
7759 | /* The type being constructed by this secondary VTT. */ | |
7760 | tree type_being_constructed; | |
7761 | } secondary_vptr_vtt_init_data; | |
7762 | ||
23656158 | 7763 | /* Recursively build the VTT-initializer for BINFO (which is in the |
9965d119 NS |
7764 | hierarchy dominated by T). INITS points to the end of the initializer |
7765 | list to date. INDEX is the VTT index where the next element will be | |
7766 | replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e. | |
7767 | not a subvtt for some base of T). When that is so, we emit the sub-VTTs | |
7768 | for virtual bases of T. When it is not so, we build the constructor | |
7769 | vtables for the BINFO-in-T variant. */ | |
23656158 | 7770 | |
9d6a019c NF |
7771 | static void |
7772 | build_vtt_inits (tree binfo, tree t, VEC(constructor_elt,gc) **inits, tree *index) | |
23656158 MM |
7773 | { |
7774 | int i; | |
7775 | tree b; | |
7776 | tree init; | |
a3a0fc7f | 7777 | secondary_vptr_vtt_init_data data; |
539ed333 | 7778 | int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
23656158 MM |
7779 | |
7780 | /* We only need VTTs for subobjects with virtual bases. */ | |
5775a06a | 7781 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
9d6a019c | 7782 | return; |
23656158 MM |
7783 | |
7784 | /* We need to use a construction vtable if this is not the primary | |
7785 | VTT. */ | |
9965d119 | 7786 | if (!top_level_p) |
3ec6bad3 MM |
7787 | { |
7788 | build_ctor_vtbl_group (binfo, t); | |
7789 | ||
7790 | /* Record the offset in the VTT where this sub-VTT can be found. */ | |
7791 | BINFO_SUBVTT_INDEX (binfo) = *index; | |
7792 | } | |
23656158 MM |
7793 | |
7794 | /* Add the address of the primary vtable for the complete object. */ | |
13de7ec4 | 7795 | init = binfo_ctor_vtable (binfo); |
9d6a019c | 7796 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
9965d119 NS |
7797 | if (top_level_p) |
7798 | { | |
50bc768d | 7799 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
9965d119 NS |
7800 | BINFO_VPTR_INDEX (binfo) = *index; |
7801 | } | |
3ec6bad3 | 7802 | *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node)); |
c8094d83 | 7803 | |
23656158 | 7804 | /* Recursively add the secondary VTTs for non-virtual bases. */ |
fa743e8c NS |
7805 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i) |
7806 | if (!BINFO_VIRTUAL_P (b)) | |
9d6a019c | 7807 | build_vtt_inits (b, t, inits, index); |
c8094d83 | 7808 | |
23656158 | 7809 | /* Add secondary virtual pointers for all subobjects of BINFO with |
9965d119 NS |
7810 | either virtual bases or reachable along a virtual path, except |
7811 | subobjects that are non-virtual primary bases. */ | |
a3a0fc7f NS |
7812 | data.top_level_p = top_level_p; |
7813 | data.index = *index; | |
9d6a019c | 7814 | data.inits = *inits; |
a3a0fc7f | 7815 | data.type_being_constructed = BINFO_TYPE (binfo); |
c8094d83 | 7816 | |
5d5a519f | 7817 | dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data); |
9965d119 | 7818 | |
a3a0fc7f | 7819 | *index = data.index; |
23656158 | 7820 | |
9d6a019c NF |
7821 | /* data.inits might have grown as we added secondary virtual pointers. |
7822 | Make sure our caller knows about the new vector. */ | |
7823 | *inits = data.inits; | |
23656158 | 7824 | |
9965d119 | 7825 | if (top_level_p) |
a3a0fc7f NS |
7826 | /* Add the secondary VTTs for virtual bases in inheritance graph |
7827 | order. */ | |
9ccf6541 MM |
7828 | for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b)) |
7829 | { | |
809e3e7f | 7830 | if (!BINFO_VIRTUAL_P (b)) |
9ccf6541 | 7831 | continue; |
c8094d83 | 7832 | |
9d6a019c | 7833 | build_vtt_inits (b, t, inits, index); |
9ccf6541 | 7834 | } |
a3a0fc7f NS |
7835 | else |
7836 | /* Remove the ctor vtables we created. */ | |
5d5a519f | 7837 | dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo); |
23656158 MM |
7838 | } |
7839 | ||
8df83eae | 7840 | /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base |
a3a0fc7f | 7841 | in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */ |
23656158 MM |
7842 | |
7843 | static tree | |
a3a0fc7f | 7844 | dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_) |
23656158 | 7845 | { |
a3a0fc7f | 7846 | secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_; |
23656158 | 7847 | |
23656158 MM |
7848 | /* We don't care about bases that don't have vtables. */ |
7849 | if (!TYPE_VFIELD (BINFO_TYPE (binfo))) | |
5d5a519f | 7850 | return dfs_skip_bases; |
23656158 | 7851 | |
a3a0fc7f NS |
7852 | /* We're only interested in proper subobjects of the type being |
7853 | constructed. */ | |
539ed333 | 7854 | if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed)) |
23656158 MM |
7855 | return NULL_TREE; |
7856 | ||
a3a0fc7f NS |
7857 | /* We're only interested in bases with virtual bases or reachable |
7858 | via a virtual path from the type being constructed. */ | |
5d5a519f NS |
7859 | if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
7860 | || binfo_via_virtual (binfo, data->type_being_constructed))) | |
7861 | return dfs_skip_bases; | |
c8094d83 | 7862 | |
5d5a519f NS |
7863 | /* We're not interested in non-virtual primary bases. */ |
7864 | if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo)) | |
db3d8cde | 7865 | return NULL_TREE; |
c8094d83 | 7866 | |
3ec6bad3 | 7867 | /* Record the index where this secondary vptr can be found. */ |
a3a0fc7f | 7868 | if (data->top_level_p) |
9965d119 | 7869 | { |
50bc768d | 7870 | gcc_assert (!BINFO_VPTR_INDEX (binfo)); |
a3a0fc7f | 7871 | BINFO_VPTR_INDEX (binfo) = data->index; |
3ec6bad3 | 7872 | |
a3a0fc7f NS |
7873 | if (BINFO_VIRTUAL_P (binfo)) |
7874 | { | |
0cbd7506 MS |
7875 | /* It's a primary virtual base, and this is not a |
7876 | construction vtable. Find the base this is primary of in | |
7877 | the inheritance graph, and use that base's vtable | |
7878 | now. */ | |
a3a0fc7f NS |
7879 | while (BINFO_PRIMARY_P (binfo)) |
7880 | binfo = BINFO_INHERITANCE_CHAIN (binfo); | |
7881 | } | |
9965d119 | 7882 | } |
c8094d83 | 7883 | |
a3a0fc7f | 7884 | /* Add the initializer for the secondary vptr itself. */ |
9d6a019c | 7885 | CONSTRUCTOR_APPEND_ELT (data->inits, NULL_TREE, binfo_ctor_vtable (binfo)); |
23656158 | 7886 | |
a3a0fc7f NS |
7887 | /* Advance the vtt index. */ |
7888 | data->index = size_binop (PLUS_EXPR, data->index, | |
7889 | TYPE_SIZE_UNIT (ptr_type_node)); | |
9965d119 | 7890 | |
a3a0fc7f | 7891 | return NULL_TREE; |
9965d119 NS |
7892 | } |
7893 | ||
a3a0fc7f NS |
7894 | /* Called from build_vtt_inits via dfs_walk. After building |
7895 | constructor vtables and generating the sub-vtt from them, we need | |
7896 | to restore the BINFO_VTABLES that were scribbled on. DATA is the | |
7897 | binfo of the base whose sub vtt was generated. */ | |
23656158 MM |
7898 | |
7899 | static tree | |
94edc4ab | 7900 | dfs_fixup_binfo_vtbls (tree binfo, void* data) |
23656158 | 7901 | { |
a3a0fc7f | 7902 | tree vtable = BINFO_VTABLE (binfo); |
23656158 | 7903 | |
5d5a519f NS |
7904 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
7905 | /* If this class has no vtable, none of its bases do. */ | |
7906 | return dfs_skip_bases; | |
c8094d83 | 7907 | |
5d5a519f NS |
7908 | if (!vtable) |
7909 | /* This might be a primary base, so have no vtable in this | |
7910 | hierarchy. */ | |
7911 | return NULL_TREE; | |
c8094d83 | 7912 | |
23656158 MM |
7913 | /* If we scribbled the construction vtable vptr into BINFO, clear it |
7914 | out now. */ | |
5d5a519f | 7915 | if (TREE_CODE (vtable) == TREE_LIST |
a3a0fc7f NS |
7916 | && (TREE_PURPOSE (vtable) == (tree) data)) |
7917 | BINFO_VTABLE (binfo) = TREE_CHAIN (vtable); | |
23656158 MM |
7918 | |
7919 | return NULL_TREE; | |
7920 | } | |
7921 | ||
7922 | /* Build the construction vtable group for BINFO which is in the | |
7923 | hierarchy dominated by T. */ | |
7924 | ||
7925 | static void | |
94edc4ab | 7926 | build_ctor_vtbl_group (tree binfo, tree t) |
23656158 | 7927 | { |
23656158 MM |
7928 | tree type; |
7929 | tree vtbl; | |
23656158 | 7930 | tree id; |
9ccf6541 | 7931 | tree vbase; |
9d6a019c | 7932 | VEC(constructor_elt,gc) *v; |
23656158 | 7933 | |
7bdcf888 | 7934 | /* See if we've already created this construction vtable group. */ |
1f84ec23 | 7935 | id = mangle_ctor_vtbl_for_type (t, binfo); |
23656158 MM |
7936 | if (IDENTIFIER_GLOBAL_VALUE (id)) |
7937 | return; | |
7938 | ||
539ed333 | 7939 | gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)); |
23656158 MM |
7940 | /* Build a version of VTBL (with the wrong type) for use in |
7941 | constructing the addresses of secondary vtables in the | |
7942 | construction vtable group. */ | |
459c43ad | 7943 | vtbl = build_vtable (t, id, ptr_type_node); |
505970fc | 7944 | DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1; |
9d6a019c NF |
7945 | |
7946 | v = NULL; | |
23656158 | 7947 | accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)), |
9d6a019c | 7948 | binfo, vtbl, t, &v); |
9965d119 NS |
7949 | |
7950 | /* Add the vtables for each of our virtual bases using the vbase in T | |
7951 | binfo. */ | |
c8094d83 MS |
7952 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); |
7953 | vbase; | |
9ccf6541 MM |
7954 | vbase = TREE_CHAIN (vbase)) |
7955 | { | |
7956 | tree b; | |
7957 | ||
809e3e7f | 7958 | if (!BINFO_VIRTUAL_P (vbase)) |
9ccf6541 | 7959 | continue; |
dbbf88d1 | 7960 | b = copied_binfo (vbase, binfo); |
c8094d83 | 7961 | |
9d6a019c | 7962 | accumulate_vtbl_inits (b, vbase, binfo, vtbl, t, &v); |
9ccf6541 | 7963 | } |
23656158 MM |
7964 | |
7965 | /* Figure out the type of the construction vtable. */ | |
dcedcddb NF |
7966 | type = build_array_of_n_type (vtable_entry_type, |
7967 | VEC_length (constructor_elt, v)); | |
8208d7dc | 7968 | layout_type (type); |
23656158 | 7969 | TREE_TYPE (vtbl) = type; |
8208d7dc DJ |
7970 | DECL_SIZE (vtbl) = DECL_SIZE_UNIT (vtbl) = NULL_TREE; |
7971 | layout_decl (vtbl, 0); | |
23656158 MM |
7972 | |
7973 | /* Initialize the construction vtable. */ | |
548502d3 | 7974 | CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl); |
9d6a019c | 7975 | initialize_artificial_var (vtbl, v); |
b7442fb5 | 7976 | dump_vtable (t, binfo, vtbl); |
23656158 MM |
7977 | } |
7978 | ||
9965d119 NS |
7979 | /* Add the vtbl initializers for BINFO (and its bases other than |
7980 | non-virtual primaries) to the list of INITS. BINFO is in the | |
7981 | hierarchy dominated by T. RTTI_BINFO is the binfo within T of | |
7982 | the constructor the vtbl inits should be accumulated for. (If this | |
7983 | is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).) | |
7984 | ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO). | |
7985 | BINFO is the active base equivalent of ORIG_BINFO in the inheritance | |
7986 | graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE, | |
7987 | but are not necessarily the same in terms of layout. */ | |
ca36f057 MM |
7988 | |
7989 | static void | |
94edc4ab | 7990 | accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
7991 | tree orig_binfo, |
7992 | tree rtti_binfo, | |
9d6a019c | 7993 | tree vtbl, |
0cbd7506 | 7994 | tree t, |
9d6a019c | 7995 | VEC(constructor_elt,gc) **inits) |
ca36f057 | 7996 | { |
23656158 | 7997 | int i; |
fa743e8c | 7998 | tree base_binfo; |
539ed333 | 7999 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
23656158 | 8000 | |
539ed333 | 8001 | gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo))); |
23656158 | 8002 | |
00a17e31 | 8003 | /* If it doesn't have a vptr, we don't do anything. */ |
623fe76a NS |
8004 | if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) |
8005 | return; | |
c8094d83 | 8006 | |
23656158 MM |
8007 | /* If we're building a construction vtable, we're not interested in |
8008 | subobjects that don't require construction vtables. */ | |
c8094d83 | 8009 | if (ctor_vtbl_p |
5775a06a | 8010 | && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)) |
9965d119 | 8011 | && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo))) |
23656158 MM |
8012 | return; |
8013 | ||
8014 | /* Build the initializers for the BINFO-in-T vtable. */ | |
9d6a019c | 8015 | dfs_accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, vtbl, t, inits); |
c8094d83 | 8016 | |
c35cce41 MM |
8017 | /* Walk the BINFO and its bases. We walk in preorder so that as we |
8018 | initialize each vtable we can figure out at what offset the | |
23656158 MM |
8019 | secondary vtable lies from the primary vtable. We can't use |
8020 | dfs_walk here because we need to iterate through bases of BINFO | |
8021 | and RTTI_BINFO simultaneously. */ | |
fa743e8c | 8022 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
23656158 | 8023 | { |
23656158 | 8024 | /* Skip virtual bases. */ |
809e3e7f | 8025 | if (BINFO_VIRTUAL_P (base_binfo)) |
23656158 MM |
8026 | continue; |
8027 | accumulate_vtbl_inits (base_binfo, | |
604a3205 | 8028 | BINFO_BASE_BINFO (orig_binfo, i), |
9d6a019c | 8029 | rtti_binfo, vtbl, t, |
23656158 MM |
8030 | inits); |
8031 | } | |
ca36f057 MM |
8032 | } |
8033 | ||
9d6a019c NF |
8034 | /* Called from accumulate_vtbl_inits. Adds the initializers for the |
8035 | BINFO vtable to L. */ | |
ca36f057 | 8036 | |
9d6a019c | 8037 | static void |
94edc4ab | 8038 | dfs_accumulate_vtbl_inits (tree binfo, |
0cbd7506 MS |
8039 | tree orig_binfo, |
8040 | tree rtti_binfo, | |
9d6a019c | 8041 | tree orig_vtbl, |
0cbd7506 | 8042 | tree t, |
9d6a019c | 8043 | VEC(constructor_elt,gc) **l) |
ca36f057 | 8044 | { |
9965d119 | 8045 | tree vtbl = NULL_TREE; |
539ed333 | 8046 | int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); |
9d6a019c | 8047 | int n_inits; |
9965d119 | 8048 | |
13de7ec4 | 8049 | if (ctor_vtbl_p |
809e3e7f | 8050 | && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo)) |
9965d119 | 8051 | { |
13de7ec4 JM |
8052 | /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a |
8053 | primary virtual base. If it is not the same primary in | |
8054 | the hierarchy of T, we'll need to generate a ctor vtable | |
8055 | for it, to place at its location in T. If it is the same | |
8056 | primary, we still need a VTT entry for the vtable, but it | |
8057 | should point to the ctor vtable for the base it is a | |
8058 | primary for within the sub-hierarchy of RTTI_BINFO. | |
c8094d83 | 8059 | |
13de7ec4 | 8060 | There are three possible cases: |
c8094d83 | 8061 | |
13de7ec4 JM |
8062 | 1) We are in the same place. |
8063 | 2) We are a primary base within a lost primary virtual base of | |
8064 | RTTI_BINFO. | |
049d2def | 8065 | 3) We are primary to something not a base of RTTI_BINFO. */ |
c8094d83 | 8066 | |
fc6633e0 | 8067 | tree b; |
13de7ec4 | 8068 | tree last = NULL_TREE; |
85a9a0a2 | 8069 | |
13de7ec4 JM |
8070 | /* First, look through the bases we are primary to for RTTI_BINFO |
8071 | or a virtual base. */ | |
fc6633e0 NS |
8072 | b = binfo; |
8073 | while (BINFO_PRIMARY_P (b)) | |
7bdcf888 | 8074 | { |
fc6633e0 | 8075 | b = BINFO_INHERITANCE_CHAIN (b); |
13de7ec4 | 8076 | last = b; |
809e3e7f | 8077 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) |
fc6633e0 | 8078 | goto found; |
7bdcf888 | 8079 | } |
13de7ec4 JM |
8080 | /* If we run out of primary links, keep looking down our |
8081 | inheritance chain; we might be an indirect primary. */ | |
fc6633e0 NS |
8082 | for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b)) |
8083 | if (BINFO_VIRTUAL_P (b) || b == rtti_binfo) | |
8084 | break; | |
8085 | found: | |
c8094d83 | 8086 | |
13de7ec4 JM |
8087 | /* If we found RTTI_BINFO, this is case 1. If we found a virtual |
8088 | base B and it is a base of RTTI_BINFO, this is case 2. In | |
8089 | either case, we share our vtable with LAST, i.e. the | |
8090 | derived-most base within B of which we are a primary. */ | |
8091 | if (b == rtti_binfo | |
58c42dc2 | 8092 | || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo)))) |
049d2def JM |
8093 | /* Just set our BINFO_VTABLE to point to LAST, as we may not have |
8094 | set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in | |
8095 | binfo_ctor_vtable after everything's been set up. */ | |
8096 | vtbl = last; | |
13de7ec4 | 8097 | |
049d2def | 8098 | /* Otherwise, this is case 3 and we get our own. */ |
9965d119 | 8099 | } |
dbbf88d1 | 8100 | else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo)) |
9d6a019c NF |
8101 | return; |
8102 | ||
8103 | n_inits = VEC_length (constructor_elt, *l); | |
7bdcf888 | 8104 | |
9965d119 | 8105 | if (!vtbl) |
ca36f057 | 8106 | { |
c35cce41 MM |
8107 | tree index; |
8108 | int non_fn_entries; | |
8109 | ||
9d6a019c NF |
8110 | /* Add the initializer for this vtable. */ |
8111 | build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo, | |
8112 | &non_fn_entries, l); | |
c35cce41 | 8113 | |
23656158 | 8114 | /* Figure out the position to which the VPTR should point. */ |
9d6a019c | 8115 | vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, orig_vtbl); |
23656158 MM |
8116 | index = size_binop (MULT_EXPR, |
8117 | TYPE_SIZE_UNIT (vtable_entry_type), | |
5d49b6a7 RG |
8118 | size_int (non_fn_entries + n_inits)); |
8119 | vtbl = fold_build_pointer_plus (vtbl, index); | |
9965d119 | 8120 | } |
23656158 | 8121 | |
7bdcf888 | 8122 | if (ctor_vtbl_p) |
9965d119 NS |
8123 | /* For a construction vtable, we can't overwrite BINFO_VTABLE. |
8124 | So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will | |
8125 | straighten this out. */ | |
8126 | BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo)); | |
809e3e7f | 8127 | else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo)) |
9d6a019c NF |
8128 | /* Throw away any unneeded intializers. */ |
8129 | VEC_truncate (constructor_elt, *l, n_inits); | |
7bdcf888 NS |
8130 | else |
8131 | /* For an ordinary vtable, set BINFO_VTABLE. */ | |
8132 | BINFO_VTABLE (binfo) = vtbl; | |
ca36f057 MM |
8133 | } |
8134 | ||
1b746b0f AP |
8135 | static GTY(()) tree abort_fndecl_addr; |
8136 | ||
90ecce3e | 8137 | /* Construct the initializer for BINFO's virtual function table. BINFO |
aabb4cd6 | 8138 | is part of the hierarchy dominated by T. If we're building a |
23656158 | 8139 | construction vtable, the ORIG_BINFO is the binfo we should use to |
9965d119 NS |
8140 | find the actual function pointers to put in the vtable - but they |
8141 | can be overridden on the path to most-derived in the graph that | |
8142 | ORIG_BINFO belongs. Otherwise, | |
911a71a7 | 8143 | ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the |
23656158 MM |
8144 | BINFO that should be indicated by the RTTI information in the |
8145 | vtable; it will be a base class of T, rather than T itself, if we | |
8146 | are building a construction vtable. | |
aabb4cd6 MM |
8147 | |
8148 | The value returned is a TREE_LIST suitable for wrapping in a | |
8149 | CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If | |
8150 | NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the | |
c8094d83 | 8151 | number of non-function entries in the vtable. |
911a71a7 MM |
8152 | |
8153 | It might seem that this function should never be called with a | |
9965d119 | 8154 | BINFO for which BINFO_PRIMARY_P holds, the vtable for such a |
911a71a7 | 8155 | base is always subsumed by a derived class vtable. However, when |
9965d119 | 8156 | we are building construction vtables, we do build vtables for |
911a71a7 MM |
8157 | primary bases; we need these while the primary base is being |
8158 | constructed. */ | |
ca36f057 | 8159 | |
9d6a019c | 8160 | static void |
94edc4ab | 8161 | build_vtbl_initializer (tree binfo, |
0cbd7506 MS |
8162 | tree orig_binfo, |
8163 | tree t, | |
8164 | tree rtti_binfo, | |
9d6a019c NF |
8165 | int* non_fn_entries_p, |
8166 | VEC(constructor_elt,gc) **inits) | |
ca36f057 | 8167 | { |
02dea3ff | 8168 | tree v; |
911a71a7 | 8169 | vtbl_init_data vid; |
9d6a019c | 8170 | unsigned ix, jx; |
58c42dc2 | 8171 | tree vbinfo; |
d4e6fecb | 8172 | VEC(tree,gc) *vbases; |
9d6a019c | 8173 | constructor_elt *e; |
c8094d83 | 8174 | |
911a71a7 | 8175 | /* Initialize VID. */ |
961192e1 | 8176 | memset (&vid, 0, sizeof (vid)); |
911a71a7 MM |
8177 | vid.binfo = binfo; |
8178 | vid.derived = t; | |
73ea87d7 | 8179 | vid.rtti_binfo = rtti_binfo; |
539ed333 NS |
8180 | vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t); |
8181 | vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t); | |
548502d3 | 8182 | vid.generate_vcall_entries = true; |
c35cce41 | 8183 | /* The first vbase or vcall offset is at index -3 in the vtable. */ |
ce552f75 | 8184 | vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE); |
c35cce41 | 8185 | |
9bab6c90 | 8186 | /* Add entries to the vtable for RTTI. */ |
73ea87d7 | 8187 | build_rtti_vtbl_entries (binfo, &vid); |
9bab6c90 | 8188 | |
b485e15b MM |
8189 | /* Create an array for keeping track of the functions we've |
8190 | processed. When we see multiple functions with the same | |
8191 | signature, we share the vcall offsets. */ | |
1e625046 | 8192 | vid.fns = VEC_alloc (tree, gc, 32); |
c35cce41 | 8193 | /* Add the vcall and vbase offset entries. */ |
911a71a7 | 8194 | build_vcall_and_vbase_vtbl_entries (binfo, &vid); |
c8094d83 | 8195 | |
79cda2d1 | 8196 | /* Clear BINFO_VTABLE_PATH_MARKED; it's set by |
c35cce41 | 8197 | build_vbase_offset_vtbl_entries. */ |
9ba5ff0f NS |
8198 | for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0; |
8199 | VEC_iterate (tree, vbases, ix, vbinfo); ix++) | |
58c42dc2 | 8200 | BINFO_VTABLE_PATH_MARKED (vbinfo) = 0; |
ca36f057 | 8201 | |
a6f5e048 RH |
8202 | /* If the target requires padding between data entries, add that now. */ |
8203 | if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1) | |
8204 | { | |
9d6a019c NF |
8205 | int n_entries = VEC_length (constructor_elt, vid.inits); |
8206 | ||
8207 | VEC_safe_grow (constructor_elt, gc, vid.inits, | |
8208 | TARGET_VTABLE_DATA_ENTRY_DISTANCE * n_entries); | |
a6f5e048 | 8209 | |
9d6a019c NF |
8210 | /* Move data entries into their new positions and add padding |
8211 | after the new positions. Iterate backwards so we don't | |
8212 | overwrite entries that we would need to process later. */ | |
8213 | for (ix = n_entries - 1; | |
8214 | VEC_iterate (constructor_elt, vid.inits, ix, e); | |
8215 | ix--) | |
a6f5e048 | 8216 | { |
9d6a019c | 8217 | int j; |
25d8a217 NF |
8218 | int new_position = (TARGET_VTABLE_DATA_ENTRY_DISTANCE * ix |
8219 | + (TARGET_VTABLE_DATA_ENTRY_DISTANCE - 1)); | |
9d6a019c NF |
8220 | |
8221 | VEC_replace (constructor_elt, vid.inits, new_position, e); | |
a6f5e048 | 8222 | |
9d6a019c NF |
8223 | for (j = 1; j < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++j) |
8224 | { | |
25d8a217 NF |
8225 | constructor_elt *f = VEC_index (constructor_elt, vid.inits, |
8226 | new_position - j); | |
9d6a019c NF |
8227 | f->index = NULL_TREE; |
8228 | f->value = build1 (NOP_EXPR, vtable_entry_type, | |
8229 | null_pointer_node); | |
8230 | } | |
a6f5e048 RH |
8231 | } |
8232 | } | |
8233 | ||
c35cce41 | 8234 | if (non_fn_entries_p) |
9d6a019c NF |
8235 | *non_fn_entries_p = VEC_length (constructor_elt, vid.inits); |
8236 | ||
8237 | /* The initializers for virtual functions were built up in reverse | |
8238 | order. Straighten them out and add them to the running list in one | |
8239 | step. */ | |
8240 | jx = VEC_length (constructor_elt, *inits); | |
8241 | VEC_safe_grow (constructor_elt, gc, *inits, | |
8242 | (jx + VEC_length (constructor_elt, vid.inits))); | |
8243 | ||
8244 | for (ix = VEC_length (constructor_elt, vid.inits) - 1; | |
8245 | VEC_iterate (constructor_elt, vid.inits, ix, e); | |
8246 | ix--, jx++) | |
8247 | VEC_replace (constructor_elt, *inits, jx, e); | |
ca36f057 MM |
8248 | |
8249 | /* Go through all the ordinary virtual functions, building up | |
8250 | initializers. */ | |
23656158 | 8251 | for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v)) |
ca36f057 MM |
8252 | { |
8253 | tree delta; | |
8254 | tree vcall_index; | |
4977bab6 | 8255 | tree fn, fn_original; |
f11ee281 | 8256 | tree init = NULL_TREE; |
c8094d83 | 8257 | |
ca36f057 | 8258 | fn = BV_FN (v); |
07fa4878 NS |
8259 | fn_original = fn; |
8260 | if (DECL_THUNK_P (fn)) | |
4977bab6 | 8261 | { |
07fa4878 NS |
8262 | if (!DECL_NAME (fn)) |
8263 | finish_thunk (fn); | |
e00853fd | 8264 | if (THUNK_ALIAS (fn)) |
bb885938 NS |
8265 | { |
8266 | fn = THUNK_ALIAS (fn); | |
8267 | BV_FN (v) = fn; | |
8268 | } | |
07fa4878 | 8269 | fn_original = THUNK_TARGET (fn); |
4977bab6 | 8270 | } |
c8094d83 | 8271 | |
d0cd8b44 JM |
8272 | /* If the only definition of this function signature along our |
8273 | primary base chain is from a lost primary, this vtable slot will | |
8274 | never be used, so just zero it out. This is important to avoid | |
8275 | requiring extra thunks which cannot be generated with the function. | |
8276 | ||
f11ee281 JM |
8277 | We first check this in update_vtable_entry_for_fn, so we handle |
8278 | restored primary bases properly; we also need to do it here so we | |
39a13be5 | 8279 | zero out unused slots in ctor vtables, rather than filling them |
f11ee281 JM |
8280 | with erroneous values (though harmless, apart from relocation |
8281 | costs). */ | |
02dea3ff JM |
8282 | if (BV_LOST_PRIMARY (v)) |
8283 | init = size_zero_node; | |
d0cd8b44 | 8284 | |
f11ee281 JM |
8285 | if (! init) |
8286 | { | |
8287 | /* Pull the offset for `this', and the function to call, out of | |
8288 | the list. */ | |
8289 | delta = BV_DELTA (v); | |
548502d3 | 8290 | vcall_index = BV_VCALL_INDEX (v); |
f11ee281 | 8291 | |
50bc768d NS |
8292 | gcc_assert (TREE_CODE (delta) == INTEGER_CST); |
8293 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
f11ee281 JM |
8294 | |
8295 | /* You can't call an abstract virtual function; it's abstract. | |
8296 | So, we replace these functions with __pure_virtual. */ | |
4977bab6 | 8297 | if (DECL_PURE_VIRTUAL_P (fn_original)) |
4977bab6 | 8298 | { |
1b746b0f | 8299 | fn = abort_fndecl; |
21b6aca3 JJ |
8300 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8301 | { | |
8302 | if (abort_fndecl_addr == NULL) | |
8303 | abort_fndecl_addr | |
8304 | = fold_convert (vfunc_ptr_type_node, | |
8305 | build_fold_addr_expr (fn)); | |
8306 | init = abort_fndecl_addr; | |
8307 | } | |
1b746b0f AP |
8308 | } |
8309 | else | |
8310 | { | |
8311 | if (!integer_zerop (delta) || vcall_index) | |
8312 | { | |
8313 | fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index); | |
8314 | if (!DECL_NAME (fn)) | |
8315 | finish_thunk (fn); | |
8316 | } | |
8317 | /* Take the address of the function, considering it to be of an | |
8318 | appropriate generic type. */ | |
21b6aca3 JJ |
8319 | if (!TARGET_VTABLE_USES_DESCRIPTORS) |
8320 | init = fold_convert (vfunc_ptr_type_node, | |
8321 | build_fold_addr_expr (fn)); | |
4977bab6 | 8322 | } |
f11ee281 | 8323 | } |
d0cd8b44 | 8324 | |
ca36f057 | 8325 | /* And add it to the chain of initializers. */ |
67231816 RH |
8326 | if (TARGET_VTABLE_USES_DESCRIPTORS) |
8327 | { | |
8328 | int i; | |
8329 | if (init == size_zero_node) | |
8330 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
9d6a019c | 8331 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
67231816 RH |
8332 | else |
8333 | for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i) | |
8334 | { | |
f293ce4b | 8335 | tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node, |
21b6aca3 | 8336 | fn, build_int_cst (NULL_TREE, i)); |
67231816 RH |
8337 | TREE_CONSTANT (fdesc) = 1; |
8338 | ||
9d6a019c | 8339 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, fdesc); |
67231816 RH |
8340 | } |
8341 | } | |
8342 | else | |
9d6a019c | 8343 | CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init); |
ca36f057 | 8344 | } |
ca36f057 MM |
8345 | } |
8346 | ||
d0cd8b44 | 8347 | /* Adds to vid->inits the initializers for the vbase and vcall |
c35cce41 | 8348 | offsets in BINFO, which is in the hierarchy dominated by T. */ |
ca36f057 | 8349 | |
c35cce41 | 8350 | static void |
94edc4ab | 8351 | build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 8352 | { |
c35cce41 | 8353 | tree b; |
8d08fdba | 8354 | |
c35cce41 | 8355 | /* If this is a derived class, we must first create entries |
9bab6c90 | 8356 | corresponding to the primary base class. */ |
911a71a7 | 8357 | b = get_primary_binfo (binfo); |
c35cce41 | 8358 | if (b) |
911a71a7 | 8359 | build_vcall_and_vbase_vtbl_entries (b, vid); |
c35cce41 MM |
8360 | |
8361 | /* Add the vbase entries for this base. */ | |
911a71a7 | 8362 | build_vbase_offset_vtbl_entries (binfo, vid); |
c35cce41 | 8363 | /* Add the vcall entries for this base. */ |
911a71a7 | 8364 | build_vcall_offset_vtbl_entries (binfo, vid); |
ca36f057 | 8365 | } |
8d08fdba | 8366 | |
ca36f057 MM |
8367 | /* Returns the initializers for the vbase offset entries in the vtable |
8368 | for BINFO (which is part of the class hierarchy dominated by T), in | |
c35cce41 MM |
8369 | reverse order. VBASE_OFFSET_INDEX gives the vtable index |
8370 | where the next vbase offset will go. */ | |
8d08fdba | 8371 | |
c35cce41 | 8372 | static void |
94edc4ab | 8373 | build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
ca36f057 | 8374 | { |
c35cce41 MM |
8375 | tree vbase; |
8376 | tree t; | |
90b1ca2f | 8377 | tree non_primary_binfo; |
8d08fdba | 8378 | |
ca36f057 MM |
8379 | /* If there are no virtual baseclasses, then there is nothing to |
8380 | do. */ | |
5775a06a | 8381 | if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))) |
c35cce41 | 8382 | return; |
ca36f057 | 8383 | |
911a71a7 | 8384 | t = vid->derived; |
c8094d83 | 8385 | |
90b1ca2f NS |
8386 | /* We might be a primary base class. Go up the inheritance hierarchy |
8387 | until we find the most derived class of which we are a primary base: | |
8388 | it is the offset of that which we need to use. */ | |
8389 | non_primary_binfo = binfo; | |
8390 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
8391 | { | |
8392 | tree b; | |
8393 | ||
8394 | /* If we have reached a virtual base, then it must be a primary | |
8395 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
8396 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
8397 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 8398 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
90b1ca2f NS |
8399 | { |
8400 | non_primary_binfo = vid->binfo; | |
8401 | break; | |
8402 | } | |
8403 | ||
8404 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); | |
8405 | if (get_primary_binfo (b) != non_primary_binfo) | |
8406 | break; | |
8407 | non_primary_binfo = b; | |
8408 | } | |
ca36f057 | 8409 | |
c35cce41 MM |
8410 | /* Go through the virtual bases, adding the offsets. */ |
8411 | for (vbase = TYPE_BINFO (BINFO_TYPE (binfo)); | |
8412 | vbase; | |
8413 | vbase = TREE_CHAIN (vbase)) | |
8414 | { | |
8415 | tree b; | |
8416 | tree delta; | |
c8094d83 | 8417 | |
809e3e7f | 8418 | if (!BINFO_VIRTUAL_P (vbase)) |
c35cce41 | 8419 | continue; |
ca36f057 | 8420 | |
c35cce41 MM |
8421 | /* Find the instance of this virtual base in the complete |
8422 | object. */ | |
dbbf88d1 | 8423 | b = copied_binfo (vbase, binfo); |
c35cce41 MM |
8424 | |
8425 | /* If we've already got an offset for this virtual base, we | |
8426 | don't need another one. */ | |
8427 | if (BINFO_VTABLE_PATH_MARKED (b)) | |
8428 | continue; | |
dbbf88d1 | 8429 | BINFO_VTABLE_PATH_MARKED (b) = 1; |
c35cce41 MM |
8430 | |
8431 | /* Figure out where we can find this vbase offset. */ | |
c8094d83 | 8432 | delta = size_binop (MULT_EXPR, |
911a71a7 | 8433 | vid->index, |
c35cce41 MM |
8434 | convert (ssizetype, |
8435 | TYPE_SIZE_UNIT (vtable_entry_type))); | |
911a71a7 | 8436 | if (vid->primary_vtbl_p) |
c35cce41 MM |
8437 | BINFO_VPTR_FIELD (b) = delta; |
8438 | ||
8439 | if (binfo != TYPE_BINFO (t)) | |
50bc768d NS |
8440 | /* The vbase offset had better be the same. */ |
8441 | gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase))); | |
c35cce41 MM |
8442 | |
8443 | /* The next vbase will come at a more negative offset. */ | |
a6f5e048 RH |
8444 | vid->index = size_binop (MINUS_EXPR, vid->index, |
8445 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
c35cce41 MM |
8446 | |
8447 | /* The initializer is the delta from BINFO to this virtual base. | |
4e7512c9 MM |
8448 | The vbase offsets go in reverse inheritance-graph order, and |
8449 | we are walking in inheritance graph order so these end up in | |
8450 | the right order. */ | |
db3927fb AH |
8451 | delta = size_diffop_loc (input_location, |
8452 | BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo)); | |
c8094d83 | 8453 | |
9d6a019c NF |
8454 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, |
8455 | fold_build1_loc (input_location, NOP_EXPR, | |
8456 | vtable_entry_type, delta)); | |
c35cce41 | 8457 | } |
8d08fdba | 8458 | } |
ca36f057 | 8459 | |
b485e15b | 8460 | /* Adds the initializers for the vcall offset entries in the vtable |
d0cd8b44 JM |
8461 | for BINFO (which is part of the class hierarchy dominated by VID->DERIVED) |
8462 | to VID->INITS. */ | |
b485e15b MM |
8463 | |
8464 | static void | |
94edc4ab | 8465 | build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b485e15b | 8466 | { |
548502d3 MM |
8467 | /* We only need these entries if this base is a virtual base. We |
8468 | compute the indices -- but do not add to the vtable -- when | |
8469 | building the main vtable for a class. */ | |
b9302915 MM |
8470 | if (binfo == TYPE_BINFO (vid->derived) |
8471 | || (BINFO_VIRTUAL_P (binfo) | |
8472 | /* If BINFO is RTTI_BINFO, then (since BINFO does not | |
8473 | correspond to VID->DERIVED), we are building a primary | |
8474 | construction virtual table. Since this is a primary | |
8475 | virtual table, we do not need the vcall offsets for | |
8476 | BINFO. */ | |
8477 | && binfo != vid->rtti_binfo)) | |
548502d3 MM |
8478 | { |
8479 | /* We need a vcall offset for each of the virtual functions in this | |
8480 | vtable. For example: | |
b485e15b | 8481 | |
548502d3 MM |
8482 | class A { virtual void f (); }; |
8483 | class B1 : virtual public A { virtual void f (); }; | |
8484 | class B2 : virtual public A { virtual void f (); }; | |
8485 | class C: public B1, public B2 { virtual void f (); }; | |
d0cd8b44 | 8486 | |
548502d3 MM |
8487 | A C object has a primary base of B1, which has a primary base of A. A |
8488 | C also has a secondary base of B2, which no longer has a primary base | |
8489 | of A. So the B2-in-C construction vtable needs a secondary vtable for | |
8490 | A, which will adjust the A* to a B2* to call f. We have no way of | |
8491 | knowing what (or even whether) this offset will be when we define B2, | |
8492 | so we store this "vcall offset" in the A sub-vtable and look it up in | |
8493 | a "virtual thunk" for B2::f. | |
b485e15b | 8494 | |
548502d3 MM |
8495 | We need entries for all the functions in our primary vtable and |
8496 | in our non-virtual bases' secondary vtables. */ | |
8497 | vid->vbase = binfo; | |
8498 | /* If we are just computing the vcall indices -- but do not need | |
8499 | the actual entries -- not that. */ | |
809e3e7f | 8500 | if (!BINFO_VIRTUAL_P (binfo)) |
548502d3 MM |
8501 | vid->generate_vcall_entries = false; |
8502 | /* Now, walk through the non-virtual bases, adding vcall offsets. */ | |
8503 | add_vcall_offset_vtbl_entries_r (binfo, vid); | |
8504 | } | |
b485e15b MM |
8505 | } |
8506 | ||
8507 | /* Build vcall offsets, starting with those for BINFO. */ | |
8508 | ||
8509 | static void | |
94edc4ab | 8510 | add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid) |
b485e15b MM |
8511 | { |
8512 | int i; | |
8513 | tree primary_binfo; | |
fa743e8c | 8514 | tree base_binfo; |
b485e15b MM |
8515 | |
8516 | /* Don't walk into virtual bases -- except, of course, for the | |
d0cd8b44 JM |
8517 | virtual base for which we are building vcall offsets. Any |
8518 | primary virtual base will have already had its offsets generated | |
8519 | through the recursion in build_vcall_and_vbase_vtbl_entries. */ | |
809e3e7f | 8520 | if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo) |
b485e15b | 8521 | return; |
c8094d83 | 8522 | |
b485e15b MM |
8523 | /* If BINFO has a primary base, process it first. */ |
8524 | primary_binfo = get_primary_binfo (binfo); | |
8525 | if (primary_binfo) | |
8526 | add_vcall_offset_vtbl_entries_r (primary_binfo, vid); | |
8527 | ||
8528 | /* Add BINFO itself to the list. */ | |
8529 | add_vcall_offset_vtbl_entries_1 (binfo, vid); | |
8530 | ||
8531 | /* Scan the non-primary bases of BINFO. */ | |
fa743e8c NS |
8532 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) |
8533 | if (base_binfo != primary_binfo) | |
8534 | add_vcall_offset_vtbl_entries_r (base_binfo, vid); | |
b485e15b MM |
8535 | } |
8536 | ||
9965d119 | 8537 | /* Called from build_vcall_offset_vtbl_entries_r. */ |
e92cc029 | 8538 | |
b485e15b | 8539 | static void |
94edc4ab | 8540 | add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid) |
8d08fdba | 8541 | { |
e6a66567 MM |
8542 | /* Make entries for the rest of the virtuals. */ |
8543 | if (abi_version_at_least (2)) | |
31f8e4f3 | 8544 | { |
e6a66567 | 8545 | tree orig_fn; |
911a71a7 | 8546 | |
e6a66567 MM |
8547 | /* The ABI requires that the methods be processed in declaration |
8548 | order. G++ 3.2 used the order in the vtable. */ | |
8549 | for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo)); | |
8550 | orig_fn; | |
910ad8de | 8551 | orig_fn = DECL_CHAIN (orig_fn)) |
e6a66567 | 8552 | if (DECL_VINDEX (orig_fn)) |
95675950 | 8553 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 MM |
8554 | } |
8555 | else | |
8556 | { | |
8557 | tree derived_virtuals; | |
8558 | tree base_virtuals; | |
8559 | tree orig_virtuals; | |
8560 | /* If BINFO is a primary base, the most derived class which has | |
8561 | BINFO as a primary base; otherwise, just BINFO. */ | |
8562 | tree non_primary_binfo; | |
8563 | ||
8564 | /* We might be a primary base class. Go up the inheritance hierarchy | |
8565 | until we find the most derived class of which we are a primary base: | |
8566 | it is the BINFO_VIRTUALS there that we need to consider. */ | |
8567 | non_primary_binfo = binfo; | |
8568 | while (BINFO_INHERITANCE_CHAIN (non_primary_binfo)) | |
911a71a7 | 8569 | { |
e6a66567 MM |
8570 | tree b; |
8571 | ||
8572 | /* If we have reached a virtual base, then it must be vid->vbase, | |
8573 | because we ignore other virtual bases in | |
8574 | add_vcall_offset_vtbl_entries_r. In turn, it must be a primary | |
8575 | base (possibly multi-level) of vid->binfo, or we wouldn't | |
8576 | have called build_vcall_and_vbase_vtbl_entries for it. But it | |
8577 | might be a lost primary, so just skip down to vid->binfo. */ | |
809e3e7f | 8578 | if (BINFO_VIRTUAL_P (non_primary_binfo)) |
e6a66567 | 8579 | { |
8dc2b103 | 8580 | gcc_assert (non_primary_binfo == vid->vbase); |
e6a66567 MM |
8581 | non_primary_binfo = vid->binfo; |
8582 | break; | |
8583 | } | |
911a71a7 | 8584 | |
e6a66567 MM |
8585 | b = BINFO_INHERITANCE_CHAIN (non_primary_binfo); |
8586 | if (get_primary_binfo (b) != non_primary_binfo) | |
8587 | break; | |
8588 | non_primary_binfo = b; | |
8589 | } | |
4e7512c9 | 8590 | |
e6a66567 MM |
8591 | if (vid->ctor_vtbl_p) |
8592 | /* For a ctor vtable we need the equivalent binfo within the hierarchy | |
8593 | where rtti_binfo is the most derived type. */ | |
dbbf88d1 NS |
8594 | non_primary_binfo |
8595 | = original_binfo (non_primary_binfo, vid->rtti_binfo); | |
c8094d83 | 8596 | |
e6a66567 MM |
8597 | for (base_virtuals = BINFO_VIRTUALS (binfo), |
8598 | derived_virtuals = BINFO_VIRTUALS (non_primary_binfo), | |
8599 | orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo))); | |
8600 | base_virtuals; | |
8601 | base_virtuals = TREE_CHAIN (base_virtuals), | |
8602 | derived_virtuals = TREE_CHAIN (derived_virtuals), | |
8603 | orig_virtuals = TREE_CHAIN (orig_virtuals)) | |
8604 | { | |
8605 | tree orig_fn; | |
73ea87d7 | 8606 | |
e6a66567 MM |
8607 | /* Find the declaration that originally caused this function to |
8608 | be present in BINFO_TYPE (binfo). */ | |
8609 | orig_fn = BV_FN (orig_virtuals); | |
9bab6c90 | 8610 | |
e6a66567 MM |
8611 | /* When processing BINFO, we only want to generate vcall slots for |
8612 | function slots introduced in BINFO. So don't try to generate | |
8613 | one if the function isn't even defined in BINFO. */ | |
539ed333 | 8614 | if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn))) |
e6a66567 | 8615 | continue; |
b485e15b | 8616 | |
95675950 | 8617 | add_vcall_offset (orig_fn, binfo, vid); |
e6a66567 MM |
8618 | } |
8619 | } | |
8620 | } | |
b485e15b | 8621 | |
95675950 | 8622 | /* Add a vcall offset entry for ORIG_FN to the vtable. */ |
b485e15b | 8623 | |
e6a66567 | 8624 | static void |
95675950 | 8625 | add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid) |
e6a66567 MM |
8626 | { |
8627 | size_t i; | |
8628 | tree vcall_offset; | |
1e625046 | 8629 | tree derived_entry; |
9bab6c90 | 8630 | |
e6a66567 MM |
8631 | /* If there is already an entry for a function with the same |
8632 | signature as FN, then we do not need a second vcall offset. | |
8633 | Check the list of functions already present in the derived | |
8634 | class vtable. */ | |
ac47786e | 8635 | FOR_EACH_VEC_ELT (tree, vid->fns, i, derived_entry) |
e6a66567 | 8636 | { |
e6a66567 MM |
8637 | if (same_signature_p (derived_entry, orig_fn) |
8638 | /* We only use one vcall offset for virtual destructors, | |
8639 | even though there are two virtual table entries. */ | |
8640 | || (DECL_DESTRUCTOR_P (derived_entry) | |
8641 | && DECL_DESTRUCTOR_P (orig_fn))) | |
8642 | return; | |
8643 | } | |
4e7512c9 | 8644 | |
e6a66567 MM |
8645 | /* If we are building these vcall offsets as part of building |
8646 | the vtable for the most derived class, remember the vcall | |
8647 | offset. */ | |
8648 | if (vid->binfo == TYPE_BINFO (vid->derived)) | |
0871761b | 8649 | { |
d4e6fecb | 8650 | tree_pair_p elt = VEC_safe_push (tree_pair_s, gc, |
0871761b NS |
8651 | CLASSTYPE_VCALL_INDICES (vid->derived), |
8652 | NULL); | |
8653 | elt->purpose = orig_fn; | |
8654 | elt->value = vid->index; | |
8655 | } | |
c8094d83 | 8656 | |
e6a66567 MM |
8657 | /* The next vcall offset will be found at a more negative |
8658 | offset. */ | |
8659 | vid->index = size_binop (MINUS_EXPR, vid->index, | |
8660 | ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE)); | |
8661 | ||
8662 | /* Keep track of this function. */ | |
1e625046 | 8663 | VEC_safe_push (tree, gc, vid->fns, orig_fn); |
e6a66567 MM |
8664 | |
8665 | if (vid->generate_vcall_entries) | |
8666 | { | |
8667 | tree base; | |
e6a66567 | 8668 | tree fn; |
548502d3 | 8669 | |
e6a66567 | 8670 | /* Find the overriding function. */ |
95675950 | 8671 | fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn); |
e6a66567 | 8672 | if (fn == error_mark_node) |
e8160c9a | 8673 | vcall_offset = build_zero_cst (vtable_entry_type); |
e6a66567 MM |
8674 | else |
8675 | { | |
95675950 MM |
8676 | base = TREE_VALUE (fn); |
8677 | ||
8678 | /* The vbase we're working on is a primary base of | |
8679 | vid->binfo. But it might be a lost primary, so its | |
8680 | BINFO_OFFSET might be wrong, so we just use the | |
8681 | BINFO_OFFSET from vid->binfo. */ | |
db3927fb AH |
8682 | vcall_offset = size_diffop_loc (input_location, |
8683 | BINFO_OFFSET (base), | |
95675950 | 8684 | BINFO_OFFSET (vid->binfo)); |
db3927fb AH |
8685 | vcall_offset = fold_build1_loc (input_location, |
8686 | NOP_EXPR, vtable_entry_type, | |
7866705a | 8687 | vcall_offset); |
548502d3 | 8688 | } |
34cd5ae7 | 8689 | /* Add the initializer to the vtable. */ |
9d6a019c | 8690 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, vcall_offset); |
c35cce41 | 8691 | } |
570221c2 | 8692 | } |
b54ccf71 | 8693 | |
34cd5ae7 | 8694 | /* Return vtbl initializers for the RTTI entries corresponding to the |
aabb4cd6 | 8695 | BINFO's vtable. The RTTI entries should indicate the object given |
73ea87d7 | 8696 | by VID->rtti_binfo. */ |
b54ccf71 | 8697 | |
9bab6c90 | 8698 | static void |
94edc4ab | 8699 | build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid) |
b54ccf71 | 8700 | { |
ca36f057 | 8701 | tree b; |
aabb4cd6 | 8702 | tree t; |
ca36f057 MM |
8703 | tree offset; |
8704 | tree decl; | |
8705 | tree init; | |
b54ccf71 | 8706 | |
73ea87d7 | 8707 | t = BINFO_TYPE (vid->rtti_binfo); |
b54ccf71 | 8708 | |
ca36f057 MM |
8709 | /* To find the complete object, we will first convert to our most |
8710 | primary base, and then add the offset in the vtbl to that value. */ | |
8711 | b = binfo; | |
9965d119 | 8712 | while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b)) |
0cbd7506 | 8713 | && !BINFO_LOST_PRIMARY_P (b)) |
b54ccf71 | 8714 | { |
c35cce41 MM |
8715 | tree primary_base; |
8716 | ||
911a71a7 | 8717 | primary_base = get_primary_binfo (b); |
fc6633e0 NS |
8718 | gcc_assert (BINFO_PRIMARY_P (primary_base) |
8719 | && BINFO_INHERITANCE_CHAIN (primary_base) == b); | |
c35cce41 | 8720 | b = primary_base; |
b54ccf71 | 8721 | } |
db3927fb AH |
8722 | offset = size_diffop_loc (input_location, |
8723 | BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b)); | |
8f032717 | 8724 | |
8fa33dfa MM |
8725 | /* The second entry is the address of the typeinfo object. */ |
8726 | if (flag_rtti) | |
7993382e | 8727 | decl = build_address (get_tinfo_decl (t)); |
ca36f057 | 8728 | else |
8fa33dfa | 8729 | decl = integer_zero_node; |
c8094d83 | 8730 | |
8fa33dfa MM |
8731 | /* Convert the declaration to a type that can be stored in the |
8732 | vtable. */ | |
7993382e | 8733 | init = build_nop (vfunc_ptr_type_node, decl); |
9d6a019c | 8734 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 8735 | |
78dcd41a VR |
8736 | /* Add the offset-to-top entry. It comes earlier in the vtable than |
8737 | the typeinfo entry. Convert the offset to look like a | |
c4372ef4 | 8738 | function pointer, so that we can put it in the vtable. */ |
7993382e | 8739 | init = build_nop (vfunc_ptr_type_node, offset); |
9d6a019c | 8740 | CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init); |
8f032717 | 8741 | } |
0f59171d | 8742 | |
1b746b0f | 8743 | #include "gt-cp-class.h" |