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