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