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