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