1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
26 #include "coretypes.h"
36 #include "splay-tree.h"
37 #include "pointer-set.h"
38 #include "hash-table.h"
40 /* The number of nested classes being processed. If we are not in the
41 scope of any class, this is zero. */
43 int current_class_depth;
45 /* In order to deal with nested classes, we keep a stack of classes.
46 The topmost entry is the innermost class, and is the entry at index
47 CURRENT_CLASS_DEPTH */
49 typedef struct class_stack_node {
50 /* The name of the class. */
53 /* The _TYPE node for the class. */
56 /* The access specifier pending for new declarations in the scope of
60 /* If were defining TYPE, the names used in this class. */
61 splay_tree names_used;
63 /* Nonzero if this class is no longer open, because of a call to
66 }* class_stack_node_t;
68 typedef struct vtbl_init_data_s
70 /* The base for which we're building initializers. */
72 /* The type of the most-derived type. */
74 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
75 unless ctor_vtbl_p is true. */
77 /* The negative-index vtable initializers built up so far. These
78 are in order from least negative index to most negative index. */
79 vec<constructor_elt, va_gc> *inits;
80 /* The binfo for the virtual base for which we're building
81 vcall offset initializers. */
83 /* The functions in vbase for which we have already provided vcall
85 vec<tree, va_gc> *fns;
86 /* The vtable index of the next vcall or vbase offset. */
88 /* Nonzero if we are building the initializer for the primary
91 /* Nonzero if we are building the initializer for a construction
94 /* True when adding vcall offset entries to the vtable. False when
95 merely computing the indices. */
96 bool generate_vcall_entries;
99 /* The type of a function passed to walk_subobject_offsets. */
100 typedef int (*subobject_offset_fn) (tree, tree, splay_tree);
102 /* The stack itself. This is a dynamically resized array. The
103 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
104 static int current_class_stack_size;
105 static class_stack_node_t current_class_stack;
107 /* The size of the largest empty class seen in this translation unit. */
108 static GTY (()) tree sizeof_biggest_empty_class;
110 /* An array of all local classes present in this translation unit, in
111 declaration order. */
112 vec<tree, va_gc> *local_classes;
114 static tree get_vfield_name (tree);
115 static void finish_struct_anon (tree);
116 static tree get_vtable_name (tree);
117 static tree get_basefndecls (tree, tree);
118 static int build_primary_vtable (tree, tree);
119 static int build_secondary_vtable (tree);
120 static void finish_vtbls (tree);
121 static void modify_vtable_entry (tree, tree, tree, tree, tree *);
122 static void finish_struct_bits (tree);
123 static int alter_access (tree, tree, tree);
124 static void handle_using_decl (tree, tree);
125 static tree dfs_modify_vtables (tree, void *);
126 static tree modify_all_vtables (tree, tree);
127 static void determine_primary_bases (tree);
128 static void finish_struct_methods (tree);
129 static void maybe_warn_about_overly_private_class (tree);
130 static int method_name_cmp (const void *, const void *);
131 static int resort_method_name_cmp (const void *, const void *);
132 static void add_implicitly_declared_members (tree, tree*, int, int);
133 static tree fixed_type_or_null (tree, int *, int *);
134 static tree build_simple_base_path (tree expr, tree binfo);
135 static tree build_vtbl_ref_1 (tree, tree);
136 static void build_vtbl_initializer (tree, tree, tree, tree, int *,
137 vec<constructor_elt, va_gc> **);
138 static int count_fields (tree);
139 static int add_fields_to_record_type (tree, struct sorted_fields_type*, int);
140 static void insert_into_classtype_sorted_fields (tree, tree, int);
141 static bool check_bitfield_decl (tree);
142 static void check_field_decl (tree, tree, int *, int *, int *);
143 static void check_field_decls (tree, tree *, int *, int *);
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 *);
146 static void check_methods (tree);
147 static void remove_zero_width_bit_fields (tree);
148 static void check_bases (tree, int *, int *);
149 static void check_bases_and_members (tree);
150 static tree create_vtable_ptr (tree, tree *);
151 static void include_empty_classes (record_layout_info);
152 static void layout_class_type (tree, tree *);
153 static void propagate_binfo_offsets (tree, tree);
154 static void layout_virtual_bases (record_layout_info, splay_tree);
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 *);
159 static void add_vcall_offset (tree, tree, vtbl_init_data *);
160 static void layout_vtable_decl (tree, int);
161 static tree dfs_find_final_overrider_pre (tree, void *);
162 static tree dfs_find_final_overrider_post (tree, void *);
163 static tree find_final_overrider (tree, tree, tree);
164 static int make_new_vtable (tree, tree);
165 static tree get_primary_binfo (tree);
166 static int maybe_indent_hierarchy (FILE *, int, int);
167 static tree dump_class_hierarchy_r (FILE *, int, tree, tree, int);
168 static void dump_class_hierarchy (tree);
169 static void dump_class_hierarchy_1 (FILE *, int, tree);
170 static void dump_array (FILE *, tree);
171 static void dump_vtable (tree, tree, tree);
172 static void dump_vtt (tree, tree);
173 static void dump_thunk (FILE *, int, tree);
174 static tree build_vtable (tree, tree, tree);
175 static void initialize_vtable (tree, vec<constructor_elt, va_gc> *);
176 static void layout_nonempty_base_or_field (record_layout_info,
177 tree, tree, splay_tree);
178 static tree end_of_class (tree, int);
179 static bool layout_empty_base (record_layout_info, tree, tree, splay_tree);
180 static void accumulate_vtbl_inits (tree, tree, tree, tree, tree,
181 vec<constructor_elt, va_gc> **);
182 static void dfs_accumulate_vtbl_inits (tree, tree, tree, tree, tree,
183 vec<constructor_elt, va_gc> **);
184 static void build_rtti_vtbl_entries (tree, vtbl_init_data *);
185 static void build_vcall_and_vbase_vtbl_entries (tree, vtbl_init_data *);
186 static void clone_constructors_and_destructors (tree);
187 static tree build_clone (tree, tree);
188 static void update_vtable_entry_for_fn (tree, tree, tree, tree *, unsigned);
189 static void build_ctor_vtbl_group (tree, tree);
190 static void build_vtt (tree);
191 static tree binfo_ctor_vtable (tree);
192 static void build_vtt_inits (tree, tree, vec<constructor_elt, va_gc> **,
194 static tree dfs_build_secondary_vptr_vtt_inits (tree, void *);
195 static tree dfs_fixup_binfo_vtbls (tree, void *);
196 static int record_subobject_offset (tree, tree, splay_tree);
197 static int check_subobject_offset (tree, tree, splay_tree);
198 static int walk_subobject_offsets (tree, subobject_offset_fn,
199 tree, splay_tree, tree, int);
200 static void record_subobject_offsets (tree, tree, splay_tree, bool);
201 static int layout_conflict_p (tree, tree, splay_tree, int);
202 static int splay_tree_compare_integer_csts (splay_tree_key k1,
204 static void warn_about_ambiguous_bases (tree);
205 static bool type_requires_array_cookie (tree);
206 static bool contains_empty_class_p (tree);
207 static bool base_derived_from (tree, tree);
208 static int empty_base_at_nonzero_offset_p (tree, tree, splay_tree);
209 static tree end_of_base (tree);
210 static tree get_vcall_index (tree, tree);
212 /* Variables shared between class.c and call.c. */
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;
220 int n_inner_fields_searched = 0;
222 /* Convert to or from a base subobject. EXPR is an expression of type
223 `A' or `A*', an expression of type `B' or `B*' is returned. To
224 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
225 the B base instance within A. To convert base A to derived B, CODE
226 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
227 In this latter case, A must not be a morally virtual base of B.
228 NONNULL is true if EXPR is known to be non-NULL (this is only
229 needed when EXPR is of pointer type). CV qualifiers are preserved
233 build_base_path (enum tree_code code,
237 tsubst_flags_t complain)
239 tree v_binfo = NULL_TREE;
240 tree d_binfo = NULL_TREE;
244 tree null_test = NULL;
245 tree ptr_target_type;
247 int want_pointer = TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE;
248 bool has_empty = false;
251 if (expr == error_mark_node || binfo == error_mark_node || !binfo)
252 return error_mark_node;
254 for (probe = binfo; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
257 if (is_empty_class (BINFO_TYPE (probe)))
259 if (!v_binfo && BINFO_VIRTUAL_P (probe))
263 probe = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
265 probe = TYPE_MAIN_VARIANT (TREE_TYPE (probe));
267 if (code == PLUS_EXPR
268 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo), probe))
270 /* This can happen when adjust_result_of_qualified_name_lookup can't
271 find a unique base binfo in a call to a member function. We
272 couldn't give the diagnostic then since we might have been calling
273 a static member function, so we do it now. */
274 if (complain & tf_error)
276 tree base = lookup_base (probe, BINFO_TYPE (d_binfo),
277 ba_unique, NULL, complain);
278 gcc_assert (base == error_mark_node);
280 return error_mark_node;
283 gcc_assert ((code == MINUS_EXPR
284 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), probe))
285 || code == PLUS_EXPR);
287 if (binfo == d_binfo)
291 if (code == MINUS_EXPR && v_binfo)
293 if (complain & tf_error)
294 error ("cannot convert from base %qT to derived type %qT via "
295 "virtual base %qT", BINFO_TYPE (binfo), BINFO_TYPE (d_binfo),
296 BINFO_TYPE (v_binfo));
297 return error_mark_node;
301 /* This must happen before the call to save_expr. */
302 expr = cp_build_addr_expr (expr, complain);
304 expr = mark_rvalue_use (expr);
306 offset = BINFO_OFFSET (binfo);
307 fixed_type_p = resolves_to_fixed_type_p (expr, &nonnull);
308 target_type = code == PLUS_EXPR ? BINFO_TYPE (binfo) : BINFO_TYPE (d_binfo);
309 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
310 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
311 expression returned matches the input. */
312 target_type = cp_build_qualified_type
313 (target_type, cp_type_quals (TREE_TYPE (TREE_TYPE (expr))));
314 ptr_target_type = build_pointer_type (target_type);
316 /* Do we need to look in the vtable for the real offset? */
317 virtual_access = (v_binfo && fixed_type_p <= 0);
319 /* Don't bother with the calculations inside sizeof; they'll ICE if the
320 source type is incomplete and the pointer value doesn't matter. In a
321 template (even in fold_non_dependent_expr), we don't have vtables set
322 up properly yet, and the value doesn't matter there either; we're just
323 interested in the result of overload resolution. */
324 if (cp_unevaluated_operand != 0
325 || in_template_function ())
327 expr = build_nop (ptr_target_type, expr);
329 expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL);
333 /* If we're in an NSDMI, we don't have the full constructor context yet
334 that we need for converting to a virtual base, so just build a stub
335 CONVERT_EXPR and expand it later in bot_replace. */
336 if (virtual_access && fixed_type_p < 0
337 && current_scope () != current_function_decl)
339 expr = build1 (CONVERT_EXPR, ptr_target_type, expr);
340 CONVERT_EXPR_VBASE_PATH (expr) = true;
342 expr = build_indirect_ref (EXPR_LOCATION (expr), expr, RO_NULL);
346 /* Do we need to check for a null pointer? */
347 if (want_pointer && !nonnull)
349 /* If we know the conversion will not actually change the value
350 of EXPR, then we can avoid testing the expression for NULL.
351 We have to avoid generating a COMPONENT_REF for a base class
352 field, because other parts of the compiler know that such
353 expressions are always non-NULL. */
354 if (!virtual_access && integer_zerop (offset))
355 return build_nop (ptr_target_type, expr);
356 null_test = error_mark_node;
359 /* Protect against multiple evaluation if necessary. */
360 if (TREE_SIDE_EFFECTS (expr) && (null_test || virtual_access))
361 expr = save_expr (expr);
363 /* Now that we've saved expr, build the real null test. */
366 tree zero = cp_convert (TREE_TYPE (expr), nullptr_node, complain);
367 null_test = fold_build2_loc (input_location, NE_EXPR, boolean_type_node,
371 /* If this is a simple base reference, express it as a COMPONENT_REF. */
372 if (code == PLUS_EXPR && !virtual_access
373 /* We don't build base fields for empty bases, and they aren't very
374 interesting to the optimizers anyway. */
377 expr = cp_build_indirect_ref (expr, RO_NULL, complain);
378 expr = build_simple_base_path (expr, binfo);
380 expr = build_address (expr);
381 target_type = TREE_TYPE (expr);
387 /* Going via virtual base V_BINFO. We need the static offset
388 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
389 V_BINFO. That offset is an entry in D_BINFO's vtable. */
392 if (fixed_type_p < 0 && in_base_initializer)
394 /* In a base member initializer, we cannot rely on the
395 vtable being set up. We have to indirect via the
399 t = TREE_TYPE (TYPE_VFIELD (current_class_type));
400 t = build_pointer_type (t);
401 v_offset = convert (t, current_vtt_parm);
402 v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain);
405 v_offset = build_vfield_ref (cp_build_indirect_ref (expr, RO_NULL,
407 TREE_TYPE (TREE_TYPE (expr)));
409 v_offset = fold_build_pointer_plus (v_offset, BINFO_VPTR_FIELD (v_binfo));
410 v_offset = build1 (NOP_EXPR,
411 build_pointer_type (ptrdiff_type_node),
413 v_offset = cp_build_indirect_ref (v_offset, RO_NULL, complain);
414 TREE_CONSTANT (v_offset) = 1;
416 offset = convert_to_integer (ptrdiff_type_node,
417 size_diffop_loc (input_location, offset,
418 BINFO_OFFSET (v_binfo)));
420 if (!integer_zerop (offset))
421 v_offset = build2 (code, ptrdiff_type_node, v_offset, offset);
423 if (fixed_type_p < 0)
424 /* Negative fixed_type_p means this is a constructor or destructor;
425 virtual base layout is fixed in in-charge [cd]tors, but not in
427 offset = build3 (COND_EXPR, ptrdiff_type_node,
428 build2 (EQ_EXPR, boolean_type_node,
429 current_in_charge_parm, integer_zero_node),
431 convert_to_integer (ptrdiff_type_node,
432 BINFO_OFFSET (binfo)));
438 target_type = ptr_target_type;
440 expr = build1 (NOP_EXPR, ptr_target_type, expr);
442 if (!integer_zerop (offset))
444 offset = fold_convert (sizetype, offset);
445 if (code == MINUS_EXPR)
446 offset = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, offset);
447 expr = fold_build_pointer_plus (expr, offset);
453 expr = cp_build_indirect_ref (expr, RO_NULL, complain);
457 expr = fold_build3_loc (input_location, COND_EXPR, target_type, null_test, expr,
458 build_zero_cst (target_type));
463 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
464 Perform a derived-to-base conversion by recursively building up a
465 sequence of COMPONENT_REFs to the appropriate base fields. */
468 build_simple_base_path (tree expr, tree binfo)
470 tree type = BINFO_TYPE (binfo);
471 tree d_binfo = BINFO_INHERITANCE_CHAIN (binfo);
474 if (d_binfo == NULL_TREE)
478 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr)) == type);
480 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
481 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
482 an lvalue in the front end; only _DECLs and _REFs are lvalues
484 temp = unary_complex_lvalue (ADDR_EXPR, expr);
486 expr = cp_build_indirect_ref (temp, RO_NULL, tf_warning_or_error);
492 expr = build_simple_base_path (expr, d_binfo);
494 for (field = TYPE_FIELDS (BINFO_TYPE (d_binfo));
495 field; field = DECL_CHAIN (field))
496 /* Is this the base field created by build_base_field? */
497 if (TREE_CODE (field) == FIELD_DECL
498 && DECL_FIELD_IS_BASE (field)
499 && TREE_TYPE (field) == type
500 /* If we're looking for a field in the most-derived class,
501 also check the field offset; we can have two base fields
502 of the same type if one is an indirect virtual base and one
503 is a direct non-virtual base. */
504 && (BINFO_INHERITANCE_CHAIN (d_binfo)
505 || tree_int_cst_equal (byte_position (field),
506 BINFO_OFFSET (binfo))))
508 /* We don't use build_class_member_access_expr here, as that
509 has unnecessary checks, and more importantly results in
510 recursive calls to dfs_walk_once. */
511 int type_quals = cp_type_quals (TREE_TYPE (expr));
513 expr = build3 (COMPONENT_REF,
514 cp_build_qualified_type (type, type_quals),
515 expr, field, NULL_TREE);
516 expr = fold_if_not_in_template (expr);
518 /* Mark the expression const or volatile, as appropriate.
519 Even though we've dealt with the type above, we still have
520 to mark the expression itself. */
521 if (type_quals & TYPE_QUAL_CONST)
522 TREE_READONLY (expr) = 1;
523 if (type_quals & TYPE_QUAL_VOLATILE)
524 TREE_THIS_VOLATILE (expr) = 1;
529 /* Didn't find the base field?!? */
533 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
534 type is a class type or a pointer to a class type. In the former
535 case, TYPE is also a class type; in the latter it is another
536 pointer type. If CHECK_ACCESS is true, an error message is emitted
537 if TYPE is inaccessible. If OBJECT has pointer type, the value is
538 assumed to be non-NULL. */
541 convert_to_base (tree object, tree type, bool check_access, bool nonnull,
542 tsubst_flags_t complain)
547 if (TYPE_PTR_P (TREE_TYPE (object)))
549 object_type = TREE_TYPE (TREE_TYPE (object));
550 type = TREE_TYPE (type);
553 object_type = TREE_TYPE (object);
555 binfo = lookup_base (object_type, type, check_access ? ba_check : ba_unique,
557 if (!binfo || binfo == error_mark_node)
558 return error_mark_node;
560 return build_base_path (PLUS_EXPR, object, binfo, nonnull, complain);
563 /* EXPR is an expression with unqualified class type. BASE is a base
564 binfo of that class type. Returns EXPR, converted to the BASE
565 type. This function assumes that EXPR is the most derived class;
566 therefore virtual bases can be found at their static offsets. */
569 convert_to_base_statically (tree expr, tree base)
573 expr_type = TREE_TYPE (expr);
574 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base), expr_type))
576 /* If this is a non-empty base, use a COMPONENT_REF. */
577 if (!is_empty_class (BINFO_TYPE (base)))
578 return build_simple_base_path (expr, base);
580 /* We use fold_build2 and fold_convert below to simplify the trees
581 provided to the optimizers. It is not safe to call these functions
582 when processing a template because they do not handle C++-specific
584 gcc_assert (!processing_template_decl);
585 expr = cp_build_addr_expr (expr, tf_warning_or_error);
586 if (!integer_zerop (BINFO_OFFSET (base)))
587 expr = fold_build_pointer_plus_loc (input_location,
588 expr, BINFO_OFFSET (base));
589 expr = fold_convert (build_pointer_type (BINFO_TYPE (base)), expr);
590 expr = build_fold_indirect_ref_loc (input_location, expr);
598 build_vfield_ref (tree datum, tree type)
600 tree vfield, vcontext;
602 if (datum == error_mark_node)
603 return error_mark_node;
605 /* First, convert to the requested type. */
606 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum), type))
607 datum = convert_to_base (datum, type, /*check_access=*/false,
608 /*nonnull=*/true, tf_warning_or_error);
610 /* Second, the requested type may not be the owner of its own vptr.
611 If not, convert to the base class that owns it. We cannot use
612 convert_to_base here, because VCONTEXT may appear more than once
613 in the inheritance hierarchy of TYPE, and thus direct conversion
614 between the types may be ambiguous. Following the path back up
615 one step at a time via primary bases avoids the problem. */
616 vfield = TYPE_VFIELD (type);
617 vcontext = DECL_CONTEXT (vfield);
618 while (!same_type_ignoring_top_level_qualifiers_p (vcontext, type))
620 datum = build_simple_base_path (datum, CLASSTYPE_PRIMARY_BINFO (type));
621 type = TREE_TYPE (datum);
624 return build3 (COMPONENT_REF, TREE_TYPE (vfield), datum, vfield, NULL_TREE);
627 /* Given an object INSTANCE, return an expression which yields the
628 vtable element corresponding to INDEX. There are many special
629 cases for INSTANCE which we take care of here, mainly to avoid
630 creating extra tree nodes when we don't have to. */
633 build_vtbl_ref_1 (tree instance, tree idx)
636 tree vtbl = NULL_TREE;
638 /* Try to figure out what a reference refers to, and
639 access its virtual function table directly. */
642 tree fixed_type = fixed_type_or_null (instance, NULL, &cdtorp);
644 tree basetype = non_reference (TREE_TYPE (instance));
646 if (fixed_type && !cdtorp)
648 tree binfo = lookup_base (fixed_type, basetype,
649 ba_unique, NULL, tf_none);
650 if (binfo && binfo != error_mark_node)
651 vtbl = unshare_expr (BINFO_VTABLE (binfo));
655 vtbl = build_vfield_ref (instance, basetype);
657 aref = build_array_ref (input_location, vtbl, idx);
658 TREE_CONSTANT (aref) |= TREE_CONSTANT (vtbl) && TREE_CONSTANT (idx);
664 build_vtbl_ref (tree instance, tree idx)
666 tree aref = build_vtbl_ref_1 (instance, idx);
671 /* Given a stable object pointer INSTANCE_PTR, return an expression which
672 yields a function pointer corresponding to vtable element INDEX. */
675 build_vfn_ref (tree instance_ptr, tree idx)
679 aref = build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr, RO_NULL,
680 tf_warning_or_error),
683 /* When using function descriptors, the address of the
684 vtable entry is treated as a function pointer. */
685 if (TARGET_VTABLE_USES_DESCRIPTORS)
686 aref = build1 (NOP_EXPR, TREE_TYPE (aref),
687 cp_build_addr_expr (aref, tf_warning_or_error));
689 /* Remember this as a method reference, for later devirtualization. */
690 aref = build3 (OBJ_TYPE_REF, TREE_TYPE (aref), aref, instance_ptr, idx);
695 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
696 for the given TYPE. */
699 get_vtable_name (tree type)
701 return mangle_vtbl_for_type (type);
704 /* DECL is an entity associated with TYPE, like a virtual table or an
705 implicitly generated constructor. Determine whether or not DECL
706 should have external or internal linkage at the object file
707 level. This routine does not deal with COMDAT linkage and other
708 similar complexities; it simply sets TREE_PUBLIC if it possible for
709 entities in other translation units to contain copies of DECL, in
713 set_linkage_according_to_type (tree /*type*/, tree decl)
715 TREE_PUBLIC (decl) = 1;
716 determine_visibility (decl);
719 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
720 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
721 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
724 build_vtable (tree class_type, tree name, tree vtable_type)
728 decl = build_lang_decl (VAR_DECL, name, vtable_type);
729 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
730 now to avoid confusion in mangle_decl. */
731 SET_DECL_ASSEMBLER_NAME (decl, name);
732 DECL_CONTEXT (decl) = class_type;
733 DECL_ARTIFICIAL (decl) = 1;
734 TREE_STATIC (decl) = 1;
735 TREE_READONLY (decl) = 1;
736 DECL_VIRTUAL_P (decl) = 1;
737 DECL_ALIGN (decl) = TARGET_VTABLE_ENTRY_ALIGN;
738 DECL_VTABLE_OR_VTT_P (decl) = 1;
739 /* At one time the vtable info was grabbed 2 words at a time. This
740 fails on sparc unless you have 8-byte alignment. (tiemann) */
741 DECL_ALIGN (decl) = MAX (TYPE_ALIGN (double_type_node),
743 set_linkage_according_to_type (class_type, decl);
744 /* The vtable has not been defined -- yet. */
745 DECL_EXTERNAL (decl) = 1;
746 DECL_NOT_REALLY_EXTERN (decl) = 1;
748 /* Mark the VAR_DECL node representing the vtable itself as a
749 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
750 is rather important that such things be ignored because any
751 effort to actually generate DWARF for them will run into
752 trouble when/if we encounter code like:
755 struct S { virtual void member (); };
757 because the artificial declaration of the vtable itself (as
758 manufactured by the g++ front end) will say that the vtable is
759 a static member of `S' but only *after* the debug output for
760 the definition of `S' has already been output. This causes
761 grief because the DWARF entry for the definition of the vtable
762 will try to refer back to an earlier *declaration* of the
763 vtable as a static member of `S' and there won't be one. We
764 might be able to arrange to have the "vtable static member"
765 attached to the member list for `S' before the debug info for
766 `S' get written (which would solve the problem) but that would
767 require more intrusive changes to the g++ front end. */
768 DECL_IGNORED_P (decl) = 1;
773 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
774 or even complete. If this does not exist, create it. If COMPLETE is
775 nonzero, then complete the definition of it -- that will render it
776 impossible to actually build the vtable, but is useful to get at those
777 which are known to exist in the runtime. */
780 get_vtable_decl (tree type, int complete)
784 if (CLASSTYPE_VTABLES (type))
785 return CLASSTYPE_VTABLES (type);
787 decl = build_vtable (type, get_vtable_name (type), vtbl_type_node);
788 CLASSTYPE_VTABLES (type) = decl;
792 DECL_EXTERNAL (decl) = 1;
793 cp_finish_decl (decl, NULL_TREE, false, NULL_TREE, 0);
799 /* Build the primary virtual function table for TYPE. If BINFO is
800 non-NULL, build the vtable starting with the initial approximation
801 that it is the same as the one which is the head of the association
802 list. Returns a nonzero value if a new vtable is actually
806 build_primary_vtable (tree binfo, tree type)
811 decl = get_vtable_decl (type, /*complete=*/0);
815 if (BINFO_NEW_VTABLE_MARKED (binfo))
816 /* We have already created a vtable for this base, so there's
817 no need to do it again. */
820 virtuals = copy_list (BINFO_VIRTUALS (binfo));
821 TREE_TYPE (decl) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo));
822 DECL_SIZE (decl) = TYPE_SIZE (TREE_TYPE (decl));
823 DECL_SIZE_UNIT (decl) = TYPE_SIZE_UNIT (TREE_TYPE (decl));
827 gcc_assert (TREE_TYPE (decl) == vtbl_type_node);
828 virtuals = NULL_TREE;
831 if (GATHER_STATISTICS)
834 n_vtable_elems += list_length (virtuals);
837 /* Initialize the association list for this type, based
838 on our first approximation. */
839 BINFO_VTABLE (TYPE_BINFO (type)) = decl;
840 BINFO_VIRTUALS (TYPE_BINFO (type)) = virtuals;
841 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type));
845 /* Give BINFO a new virtual function table which is initialized
846 with a skeleton-copy of its original initialization. The only
847 entry that changes is the `delta' entry, so we can really
848 share a lot of structure.
850 FOR_TYPE is the most derived type which caused this table to
853 Returns nonzero if we haven't met BINFO before.
855 The order in which vtables are built (by calling this function) for
856 an object must remain the same, otherwise a binary incompatibility
860 build_secondary_vtable (tree binfo)
862 if (BINFO_NEW_VTABLE_MARKED (binfo))
863 /* We already created a vtable for this base. There's no need to
867 /* Remember that we've created a vtable for this BINFO, so that we
868 don't try to do so again. */
869 SET_BINFO_NEW_VTABLE_MARKED (binfo);
871 /* Make fresh virtual list, so we can smash it later. */
872 BINFO_VIRTUALS (binfo) = copy_list (BINFO_VIRTUALS (binfo));
874 /* Secondary vtables are laid out as part of the same structure as
875 the primary vtable. */
876 BINFO_VTABLE (binfo) = NULL_TREE;
880 /* Create a new vtable for BINFO which is the hierarchy dominated by
881 T. Return nonzero if we actually created a new vtable. */
884 make_new_vtable (tree t, tree binfo)
886 if (binfo == TYPE_BINFO (t))
887 /* In this case, it is *type*'s vtable we are modifying. We start
888 with the approximation that its vtable is that of the
889 immediate base class. */
890 return build_primary_vtable (binfo, t);
892 /* This is our very own copy of `basetype' to play with. Later,
893 we will fill in all the virtual functions that override the
894 virtual functions in these base classes which are not defined
895 by the current type. */
896 return build_secondary_vtable (binfo);
899 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
900 (which is in the hierarchy dominated by T) list FNDECL as its
901 BV_FN. DELTA is the required constant adjustment from the `this'
902 pointer where the vtable entry appears to the `this' required when
903 the function is actually called. */
906 modify_vtable_entry (tree t,
916 if (fndecl != BV_FN (v)
917 || !tree_int_cst_equal (delta, BV_DELTA (v)))
919 /* We need a new vtable for BINFO. */
920 if (make_new_vtable (t, binfo))
922 /* If we really did make a new vtable, we also made a copy
923 of the BINFO_VIRTUALS list. Now, we have to find the
924 corresponding entry in that list. */
925 *virtuals = BINFO_VIRTUALS (binfo);
926 while (BV_FN (*virtuals) != BV_FN (v))
927 *virtuals = TREE_CHAIN (*virtuals);
931 BV_DELTA (v) = delta;
932 BV_VCALL_INDEX (v) = NULL_TREE;
938 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
939 the USING_DECL naming METHOD. Returns true if the method could be
940 added to the method vec. */
943 add_method (tree type, tree method, tree using_decl)
947 bool template_conv_p = false;
949 vec<tree, va_gc> *method_vec;
951 bool insert_p = false;
955 if (method == error_mark_node)
958 complete_p = COMPLETE_TYPE_P (type);
959 conv_p = DECL_CONV_FN_P (method);
961 template_conv_p = (TREE_CODE (method) == TEMPLATE_DECL
962 && DECL_TEMPLATE_CONV_FN_P (method));
964 method_vec = CLASSTYPE_METHOD_VEC (type);
967 /* Make a new method vector. We start with 8 entries. We must
968 allocate at least two (for constructors and destructors), and
969 we're going to end up with an assignment operator at some
971 vec_alloc (method_vec, 8);
972 /* Create slots for constructors and destructors. */
973 method_vec->quick_push (NULL_TREE);
974 method_vec->quick_push (NULL_TREE);
975 CLASSTYPE_METHOD_VEC (type) = method_vec;
978 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
979 grok_special_member_properties (method);
981 /* Constructors and destructors go in special slots. */
982 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method))
983 slot = CLASSTYPE_CONSTRUCTOR_SLOT;
984 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
986 slot = CLASSTYPE_DESTRUCTOR_SLOT;
988 if (TYPE_FOR_JAVA (type))
990 if (!DECL_ARTIFICIAL (method))
991 error ("Java class %qT cannot have a destructor", type);
992 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
993 error ("Java class %qT cannot have an implicit non-trivial "
1003 /* See if we already have an entry with this name. */
1004 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1005 vec_safe_iterate (method_vec, slot, &m);
1008 m = OVL_CURRENT (m);
1009 if (template_conv_p)
1011 if (TREE_CODE (m) == TEMPLATE_DECL
1012 && DECL_TEMPLATE_CONV_FN_P (m))
1016 if (conv_p && !DECL_CONV_FN_P (m))
1018 if (DECL_NAME (m) == DECL_NAME (method))
1024 && !DECL_CONV_FN_P (m)
1025 && DECL_NAME (m) > DECL_NAME (method))
1029 current_fns = insert_p ? NULL_TREE : (*method_vec)[slot];
1031 /* Check to see if we've already got this method. */
1032 for (fns = current_fns; fns; fns = OVL_NEXT (fns))
1034 tree fn = OVL_CURRENT (fns);
1040 if (TREE_CODE (fn) != TREE_CODE (method))
1043 /* [over.load] Member function declarations with the
1044 same name and the same parameter types cannot be
1045 overloaded if any of them is a static member
1046 function declaration.
1048 [over.load] Member function declarations with the same name and
1049 the same parameter-type-list as well as member function template
1050 declarations with the same name, the same parameter-type-list, and
1051 the same template parameter lists cannot be overloaded if any of
1052 them, but not all, have a ref-qualifier.
1054 [namespace.udecl] When a using-declaration brings names
1055 from a base class into a derived class scope, member
1056 functions in the derived class override and/or hide member
1057 functions with the same name and parameter types in a base
1058 class (rather than conflicting). */
1059 fn_type = TREE_TYPE (fn);
1060 method_type = TREE_TYPE (method);
1061 parms1 = TYPE_ARG_TYPES (fn_type);
1062 parms2 = TYPE_ARG_TYPES (method_type);
1064 /* Compare the quals on the 'this' parm. Don't compare
1065 the whole types, as used functions are treated as
1066 coming from the using class in overload resolution. */
1067 if (! DECL_STATIC_FUNCTION_P (fn)
1068 && ! DECL_STATIC_FUNCTION_P (method)
1069 /* Either both or neither need to be ref-qualified for
1070 differing quals to allow overloading. */
1071 && (FUNCTION_REF_QUALIFIED (fn_type)
1072 == FUNCTION_REF_QUALIFIED (method_type))
1073 && (type_memfn_quals (fn_type) != type_memfn_quals (method_type)
1074 || type_memfn_rqual (fn_type) != type_memfn_rqual (method_type)))
1077 /* For templates, the return type and template parameters
1078 must be identical. */
1079 if (TREE_CODE (fn) == TEMPLATE_DECL
1080 && (!same_type_p (TREE_TYPE (fn_type),
1081 TREE_TYPE (method_type))
1082 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn),
1083 DECL_TEMPLATE_PARMS (method))))
1086 if (! DECL_STATIC_FUNCTION_P (fn))
1087 parms1 = TREE_CHAIN (parms1);
1088 if (! DECL_STATIC_FUNCTION_P (method))
1089 parms2 = TREE_CHAIN (parms2);
1091 if (compparms (parms1, parms2)
1092 && (!DECL_CONV_FN_P (fn)
1093 || same_type_p (TREE_TYPE (fn_type),
1094 TREE_TYPE (method_type))))
1096 /* For function versions, their parms and types match
1097 but they are not duplicates. Record function versions
1098 as and when they are found. extern "C" functions are
1099 not treated as versions. */
1100 if (TREE_CODE (fn) == FUNCTION_DECL
1101 && TREE_CODE (method) == FUNCTION_DECL
1102 && !DECL_EXTERN_C_P (fn)
1103 && !DECL_EXTERN_C_P (method)
1104 && targetm.target_option.function_versions (fn, method))
1106 /* Mark functions as versions if necessary. Modify the mangled
1107 decl name if necessary. */
1108 if (!DECL_FUNCTION_VERSIONED (fn))
1110 DECL_FUNCTION_VERSIONED (fn) = 1;
1111 if (DECL_ASSEMBLER_NAME_SET_P (fn))
1114 if (!DECL_FUNCTION_VERSIONED (method))
1116 DECL_FUNCTION_VERSIONED (method) = 1;
1117 if (DECL_ASSEMBLER_NAME_SET_P (method))
1118 mangle_decl (method);
1120 record_function_versions (fn, method);
1123 if (DECL_INHERITED_CTOR_BASE (method))
1125 if (DECL_INHERITED_CTOR_BASE (fn))
1127 error_at (DECL_SOURCE_LOCATION (method),
1128 "%q#D inherited from %qT", method,
1129 DECL_INHERITED_CTOR_BASE (method));
1130 error_at (DECL_SOURCE_LOCATION (fn),
1131 "conflicts with version inherited from %qT",
1132 DECL_INHERITED_CTOR_BASE (fn));
1134 /* Otherwise defer to the other function. */
1139 if (DECL_CONTEXT (fn) == type)
1140 /* Defer to the local function. */
1145 error ("%q+#D cannot be overloaded", method);
1146 error ("with %q+#D", fn);
1149 /* We don't call duplicate_decls here to merge the
1150 declarations because that will confuse things if the
1151 methods have inline definitions. In particular, we
1152 will crash while processing the definitions. */
1157 /* A class should never have more than one destructor. */
1158 if (current_fns && DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method))
1161 /* Add the new binding. */
1164 overload = ovl_cons (method, current_fns);
1165 OVL_USED (overload) = true;
1168 overload = build_overload (method, current_fns);
1171 TYPE_HAS_CONVERSION (type) = 1;
1172 else if (slot >= CLASSTYPE_FIRST_CONVERSION_SLOT && !complete_p)
1173 push_class_level_binding (DECL_NAME (method), overload);
1179 /* We only expect to add few methods in the COMPLETE_P case, so
1180 just make room for one more method in that case. */
1182 reallocated = vec_safe_reserve_exact (method_vec, 1);
1184 reallocated = vec_safe_reserve (method_vec, 1);
1186 CLASSTYPE_METHOD_VEC (type) = method_vec;
1187 if (slot == method_vec->length ())
1188 method_vec->quick_push (overload);
1190 method_vec->quick_insert (slot, overload);
1193 /* Replace the current slot. */
1194 (*method_vec)[slot] = overload;
1198 /* Subroutines of finish_struct. */
1200 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1201 legit, otherwise return 0. */
1204 alter_access (tree t, tree fdecl, tree access)
1208 if (!DECL_LANG_SPECIFIC (fdecl))
1209 retrofit_lang_decl (fdecl);
1211 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl));
1213 elem = purpose_member (t, DECL_ACCESS (fdecl));
1216 if (TREE_VALUE (elem) != access)
1218 if (TREE_CODE (TREE_TYPE (fdecl)) == FUNCTION_DECL)
1219 error ("conflicting access specifications for method"
1220 " %q+D, ignored", TREE_TYPE (fdecl));
1222 error ("conflicting access specifications for field %qE, ignored",
1227 /* They're changing the access to the same thing they changed
1228 it to before. That's OK. */
1234 perform_or_defer_access_check (TYPE_BINFO (t), fdecl, fdecl,
1235 tf_warning_or_error);
1236 DECL_ACCESS (fdecl) = tree_cons (t, access, DECL_ACCESS (fdecl));
1242 /* Process the USING_DECL, which is a member of T. */
1245 handle_using_decl (tree using_decl, tree t)
1247 tree decl = USING_DECL_DECLS (using_decl);
1248 tree name = DECL_NAME (using_decl);
1250 = TREE_PRIVATE (using_decl) ? access_private_node
1251 : TREE_PROTECTED (using_decl) ? access_protected_node
1252 : access_public_node;
1253 tree flist = NULL_TREE;
1256 gcc_assert (!processing_template_decl && decl);
1258 old_value = lookup_member (t, name, /*protect=*/0, /*want_type=*/false,
1259 tf_warning_or_error);
1262 if (is_overloaded_fn (old_value))
1263 old_value = OVL_CURRENT (old_value);
1265 if (DECL_P (old_value) && DECL_CONTEXT (old_value) == t)
1268 old_value = NULL_TREE;
1271 cp_emit_debug_info_for_using (decl, USING_DECL_SCOPE (using_decl));
1273 if (is_overloaded_fn (decl))
1278 else if (is_overloaded_fn (old_value))
1281 /* It's OK to use functions from a base when there are functions with
1282 the same name already present in the current class. */;
1285 error ("%q+D invalid in %q#T", using_decl, t);
1286 error (" because of local method %q+#D with same name",
1287 OVL_CURRENT (old_value));
1291 else if (!DECL_ARTIFICIAL (old_value))
1293 error ("%q+D invalid in %q#T", using_decl, t);
1294 error (" because of local member %q+#D with same name", old_value);
1298 /* Make type T see field decl FDECL with access ACCESS. */
1300 for (; flist; flist = OVL_NEXT (flist))
1302 add_method (t, OVL_CURRENT (flist), using_decl);
1303 alter_access (t, OVL_CURRENT (flist), access);
1306 alter_access (t, decl, access);
1309 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1310 types with abi tags, add the corresponding identifiers to the VEC in
1311 *DATA and set IDENTIFIER_MARKED. */
1320 find_abi_tags_r (tree *tp, int */*walk_subtrees*/, void *data)
1322 if (!TAGGED_TYPE_P (*tp))
1325 if (tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp)))
1327 struct abi_tag_data *p = static_cast<struct abi_tag_data*>(data);
1328 for (tree list = TREE_VALUE (attributes); list;
1329 list = TREE_CHAIN (list))
1331 tree tag = TREE_VALUE (list);
1332 tree id = get_identifier (TREE_STRING_POINTER (tag));
1333 if (!IDENTIFIER_MARKED (id))
1335 if (TYPE_P (p->subob))
1337 warning (OPT_Wabi_tag, "%qT does not have the %E abi tag "
1338 "that base %qT has", p->t, tag, p->subob);
1339 inform (location_of (p->subob), "%qT declared here",
1344 warning (OPT_Wabi_tag, "%qT does not have the %E abi tag "
1345 "that %qT (used in the type of %qD) has",
1346 p->t, tag, *tp, p->subob);
1347 inform (location_of (p->subob), "%qD declared here",
1349 inform (location_of (*tp), "%qT declared here", *tp);
1357 /* Check that class T has all the abi tags that subobject SUBOB has, or
1361 check_abi_tags (tree t, tree subob)
1363 tree attributes = lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t));
1366 for (tree list = TREE_VALUE (attributes); list;
1367 list = TREE_CHAIN (list))
1369 tree tag = TREE_VALUE (list);
1370 tree id = get_identifier (TREE_STRING_POINTER (tag));
1371 IDENTIFIER_MARKED (id) = true;
1375 tree subtype = TYPE_P (subob) ? subob : TREE_TYPE (subob);
1376 struct abi_tag_data data = { t, subob };
1378 cp_walk_tree_without_duplicates (&subtype, find_abi_tags_r, &data);
1382 for (tree list = TREE_VALUE (attributes); list;
1383 list = TREE_CHAIN (list))
1385 tree tag = TREE_VALUE (list);
1386 tree id = get_identifier (TREE_STRING_POINTER (tag));
1387 IDENTIFIER_MARKED (id) = false;
1392 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1393 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1394 properties of the bases. */
1397 check_bases (tree t,
1398 int* cant_have_const_ctor_p,
1399 int* no_const_asn_ref_p)
1402 bool seen_non_virtual_nearly_empty_base_p = 0;
1403 int seen_tm_mask = 0;
1406 tree field = NULL_TREE;
1408 if (!CLASSTYPE_NON_STD_LAYOUT (t))
1409 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
1410 if (TREE_CODE (field) == FIELD_DECL)
1413 for (binfo = TYPE_BINFO (t), i = 0;
1414 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
1416 tree basetype = TREE_TYPE (base_binfo);
1418 gcc_assert (COMPLETE_TYPE_P (basetype));
1420 if (CLASSTYPE_FINAL (basetype))
1421 error ("cannot derive from %<final%> base %qT in derived type %qT",
1424 /* If any base class is non-literal, so is the derived class. */
1425 if (!CLASSTYPE_LITERAL_P (basetype))
1426 CLASSTYPE_LITERAL_P (t) = false;
1428 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1429 here because the case of virtual functions but non-virtual
1430 dtor is handled in finish_struct_1. */
1431 if (!TYPE_POLYMORPHIC_P (basetype))
1432 warning (OPT_Weffc__,
1433 "base class %q#T has a non-virtual destructor", basetype);
1435 /* If the base class doesn't have copy constructors or
1436 assignment operators that take const references, then the
1437 derived class cannot have such a member automatically
1439 if (TYPE_HAS_COPY_CTOR (basetype)
1440 && ! TYPE_HAS_CONST_COPY_CTOR (basetype))
1441 *cant_have_const_ctor_p = 1;
1442 if (TYPE_HAS_COPY_ASSIGN (basetype)
1443 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype))
1444 *no_const_asn_ref_p = 1;
1446 if (BINFO_VIRTUAL_P (base_binfo))
1447 /* A virtual base does not effect nearly emptiness. */
1449 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype))
1451 if (seen_non_virtual_nearly_empty_base_p)
1452 /* And if there is more than one nearly empty base, then the
1453 derived class is not nearly empty either. */
1454 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1456 /* Remember we've seen one. */
1457 seen_non_virtual_nearly_empty_base_p = 1;
1459 else if (!is_empty_class (basetype))
1460 /* If the base class is not empty or nearly empty, then this
1461 class cannot be nearly empty. */
1462 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
1464 /* A lot of properties from the bases also apply to the derived
1466 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (basetype);
1467 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
1468 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype);
1469 TYPE_HAS_COMPLEX_COPY_ASSIGN (t)
1470 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype)
1471 || !TYPE_HAS_COPY_ASSIGN (basetype));
1472 TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype)
1473 || !TYPE_HAS_COPY_CTOR (basetype));
1474 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t)
1475 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype);
1476 TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype);
1477 TYPE_POLYMORPHIC_P (t) |= TYPE_POLYMORPHIC_P (basetype);
1478 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t)
1479 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype);
1480 TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype)
1481 || TYPE_HAS_COMPLEX_DFLT (basetype));
1483 /* A standard-layout class is a class that:
1485 * has no non-standard-layout base classes, */
1486 CLASSTYPE_NON_STD_LAYOUT (t) |= CLASSTYPE_NON_STD_LAYOUT (basetype);
1487 if (!CLASSTYPE_NON_STD_LAYOUT (t))
1490 /* ...has no base classes of the same type as the first non-static
1492 if (field && DECL_CONTEXT (field) == t
1493 && (same_type_ignoring_top_level_qualifiers_p
1494 (TREE_TYPE (field), basetype)))
1495 CLASSTYPE_NON_STD_LAYOUT (t) = 1;
1497 /* ...either has no non-static data members in the most-derived
1498 class and at most one base class with non-static data
1499 members, or has no base classes with non-static data
1501 for (basefield = TYPE_FIELDS (basetype); basefield;
1502 basefield = DECL_CHAIN (basefield))
1503 if (TREE_CODE (basefield) == FIELD_DECL)
1506 CLASSTYPE_NON_STD_LAYOUT (t) = 1;
1513 /* Don't bother collecting tm attributes if transactional memory
1514 support is not enabled. */
1517 tree tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (basetype));
1519 seen_tm_mask |= tm_attr_to_mask (tm_attr);
1522 check_abi_tags (t, basetype);
1525 /* If one of the base classes had TM attributes, and the current class
1526 doesn't define its own, then the current class inherits one. */
1527 if (seen_tm_mask && !find_tm_attribute (TYPE_ATTRIBUTES (t)))
1529 tree tm_attr = tm_mask_to_attr (seen_tm_mask & -seen_tm_mask);
1530 TYPE_ATTRIBUTES (t) = tree_cons (tm_attr, NULL, TYPE_ATTRIBUTES (t));
1534 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1535 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1536 that have had a nearly-empty virtual primary base stolen by some
1537 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1541 determine_primary_bases (tree t)
1544 tree primary = NULL_TREE;
1545 tree type_binfo = TYPE_BINFO (t);
1548 /* Determine the primary bases of our bases. */
1549 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1550 base_binfo = TREE_CHAIN (base_binfo))
1552 tree primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo));
1554 /* See if we're the non-virtual primary of our inheritance
1556 if (!BINFO_VIRTUAL_P (base_binfo))
1558 tree parent = BINFO_INHERITANCE_CHAIN (base_binfo);
1559 tree parent_primary = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent));
1562 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo),
1563 BINFO_TYPE (parent_primary)))
1564 /* We are the primary binfo. */
1565 BINFO_PRIMARY_P (base_binfo) = 1;
1567 /* Determine if we have a virtual primary base, and mark it so.
1569 if (primary && BINFO_VIRTUAL_P (primary))
1571 tree this_primary = copied_binfo (primary, base_binfo);
1573 if (BINFO_PRIMARY_P (this_primary))
1574 /* Someone already claimed this base. */
1575 BINFO_LOST_PRIMARY_P (base_binfo) = 1;
1580 BINFO_PRIMARY_P (this_primary) = 1;
1581 BINFO_INHERITANCE_CHAIN (this_primary) = base_binfo;
1583 /* A virtual binfo might have been copied from within
1584 another hierarchy. As we're about to use it as a
1585 primary base, make sure the offsets match. */
1586 delta = size_diffop_loc (input_location,
1588 BINFO_OFFSET (base_binfo)),
1590 BINFO_OFFSET (this_primary)));
1592 propagate_binfo_offsets (this_primary, delta);
1597 /* First look for a dynamic direct non-virtual base. */
1598 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, base_binfo); i++)
1600 tree basetype = BINFO_TYPE (base_binfo);
1602 if (TYPE_CONTAINS_VPTR_P (basetype) && !BINFO_VIRTUAL_P (base_binfo))
1604 primary = base_binfo;
1609 /* A "nearly-empty" virtual base class can be the primary base
1610 class, if no non-virtual polymorphic base can be found. Look for
1611 a nearly-empty virtual dynamic base that is not already a primary
1612 base of something in the hierarchy. If there is no such base,
1613 just pick the first nearly-empty virtual base. */
1615 for (base_binfo = TREE_CHAIN (type_binfo); base_binfo;
1616 base_binfo = TREE_CHAIN (base_binfo))
1617 if (BINFO_VIRTUAL_P (base_binfo)
1618 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo)))
1620 if (!BINFO_PRIMARY_P (base_binfo))
1622 /* Found one that is not primary. */
1623 primary = base_binfo;
1627 /* Remember the first candidate. */
1628 primary = base_binfo;
1632 /* If we've got a primary base, use it. */
1635 tree basetype = BINFO_TYPE (primary);
1637 CLASSTYPE_PRIMARY_BINFO (t) = primary;
1638 if (BINFO_PRIMARY_P (primary))
1639 /* We are stealing a primary base. */
1640 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary)) = 1;
1641 BINFO_PRIMARY_P (primary) = 1;
1642 if (BINFO_VIRTUAL_P (primary))
1646 BINFO_INHERITANCE_CHAIN (primary) = type_binfo;
1647 /* A virtual binfo might have been copied from within
1648 another hierarchy. As we're about to use it as a primary
1649 base, make sure the offsets match. */
1650 delta = size_diffop_loc (input_location, ssize_int (0),
1651 convert (ssizetype, BINFO_OFFSET (primary)));
1653 propagate_binfo_offsets (primary, delta);
1656 primary = TYPE_BINFO (basetype);
1658 TYPE_VFIELD (t) = TYPE_VFIELD (basetype);
1659 BINFO_VTABLE (type_binfo) = BINFO_VTABLE (primary);
1660 BINFO_VIRTUALS (type_binfo) = BINFO_VIRTUALS (primary);
1664 /* Update the variant types of T. */
1667 fixup_type_variants (tree t)
1674 for (variants = TYPE_NEXT_VARIANT (t);
1676 variants = TYPE_NEXT_VARIANT (variants))
1678 /* These fields are in the _TYPE part of the node, not in
1679 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1680 TYPE_HAS_USER_CONSTRUCTOR (variants) = TYPE_HAS_USER_CONSTRUCTOR (t);
1681 TYPE_NEEDS_CONSTRUCTING (variants) = TYPE_NEEDS_CONSTRUCTING (t);
1682 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants)
1683 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
1685 TYPE_POLYMORPHIC_P (variants) = TYPE_POLYMORPHIC_P (t);
1687 TYPE_BINFO (variants) = TYPE_BINFO (t);
1689 /* Copy whatever these are holding today. */
1690 TYPE_VFIELD (variants) = TYPE_VFIELD (t);
1691 TYPE_METHODS (variants) = TYPE_METHODS (t);
1692 TYPE_FIELDS (variants) = TYPE_FIELDS (t);
1696 /* Early variant fixups: we apply attributes at the beginning of the class
1697 definition, and we need to fix up any variants that have already been
1698 made via elaborated-type-specifier so that check_qualified_type works. */
1701 fixup_attribute_variants (tree t)
1708 for (variants = TYPE_NEXT_VARIANT (t);
1710 variants = TYPE_NEXT_VARIANT (variants))
1712 /* These are the two fields that check_qualified_type looks at and
1713 are affected by attributes. */
1714 TYPE_ATTRIBUTES (variants) = TYPE_ATTRIBUTES (t);
1715 TYPE_ALIGN (variants) = TYPE_ALIGN (t);
1719 /* Set memoizing fields and bits of T (and its variants) for later
1723 finish_struct_bits (tree t)
1725 /* Fix up variants (if any). */
1726 fixup_type_variants (t);
1728 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) && TYPE_POLYMORPHIC_P (t))
1729 /* For a class w/o baseclasses, 'finish_struct' has set
1730 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1731 Similarly for a class whose base classes do not have vtables.
1732 When neither of these is true, we might have removed abstract
1733 virtuals (by providing a definition), added some (by declaring
1734 new ones), or redeclared ones from a base class. We need to
1735 recalculate what's really an abstract virtual at this point (by
1736 looking in the vtables). */
1737 get_pure_virtuals (t);
1739 /* If this type has a copy constructor or a destructor, force its
1740 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1741 nonzero. This will cause it to be passed by invisible reference
1742 and prevent it from being returned in a register. */
1743 if (type_has_nontrivial_copy_init (t)
1744 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
1747 DECL_MODE (TYPE_MAIN_DECL (t)) = BLKmode;
1748 for (variants = t; variants; variants = TYPE_NEXT_VARIANT (variants))
1750 SET_TYPE_MODE (variants, BLKmode);
1751 TREE_ADDRESSABLE (variants) = 1;
1756 /* Issue warnings about T having private constructors, but no friends,
1759 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1760 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1761 non-private static member functions. */
1764 maybe_warn_about_overly_private_class (tree t)
1766 int has_member_fn = 0;
1767 int has_nonprivate_method = 0;
1770 if (!warn_ctor_dtor_privacy
1771 /* If the class has friends, those entities might create and
1772 access instances, so we should not warn. */
1773 || (CLASSTYPE_FRIEND_CLASSES (t)
1774 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))
1775 /* We will have warned when the template was declared; there's
1776 no need to warn on every instantiation. */
1777 || CLASSTYPE_TEMPLATE_INSTANTIATION (t))
1778 /* There's no reason to even consider warning about this
1782 /* We only issue one warning, if more than one applies, because
1783 otherwise, on code like:
1786 // Oops - forgot `public:'
1792 we warn several times about essentially the same problem. */
1794 /* Check to see if all (non-constructor, non-destructor) member
1795 functions are private. (Since there are no friends or
1796 non-private statics, we can't ever call any of the private member
1798 for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn))
1799 /* We're not interested in compiler-generated methods; they don't
1800 provide any way to call private members. */
1801 if (!DECL_ARTIFICIAL (fn))
1803 if (!TREE_PRIVATE (fn))
1805 if (DECL_STATIC_FUNCTION_P (fn))
1806 /* A non-private static member function is just like a
1807 friend; it can create and invoke private member
1808 functions, and be accessed without a class
1812 has_nonprivate_method = 1;
1813 /* Keep searching for a static member function. */
1815 else if (!DECL_CONSTRUCTOR_P (fn) && !DECL_DESTRUCTOR_P (fn))
1819 if (!has_nonprivate_method && has_member_fn)
1821 /* There are no non-private methods, and there's at least one
1822 private member function that isn't a constructor or
1823 destructor. (If all the private members are
1824 constructors/destructors we want to use the code below that
1825 issues error messages specifically referring to
1826 constructors/destructors.) */
1828 tree binfo = TYPE_BINFO (t);
1830 for (i = 0; i != BINFO_N_BASE_BINFOS (binfo); i++)
1831 if (BINFO_BASE_ACCESS (binfo, i) != access_private_node)
1833 has_nonprivate_method = 1;
1836 if (!has_nonprivate_method)
1838 warning (OPT_Wctor_dtor_privacy,
1839 "all member functions in class %qT are private", t);
1844 /* Even if some of the member functions are non-private, the class
1845 won't be useful for much if all the constructors or destructors
1846 are private: such an object can never be created or destroyed. */
1847 fn = CLASSTYPE_DESTRUCTORS (t);
1848 if (fn && TREE_PRIVATE (fn))
1850 warning (OPT_Wctor_dtor_privacy,
1851 "%q#T only defines a private destructor and has no friends",
1856 /* Warn about classes that have private constructors and no friends. */
1857 if (TYPE_HAS_USER_CONSTRUCTOR (t)
1858 /* Implicitly generated constructors are always public. */
1859 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t)
1860 || !CLASSTYPE_LAZY_COPY_CTOR (t)))
1862 int nonprivate_ctor = 0;
1864 /* If a non-template class does not define a copy
1865 constructor, one is defined for it, enabling it to avoid
1866 this warning. For a template class, this does not
1867 happen, and so we would normally get a warning on:
1869 template <class T> class C { private: C(); };
1871 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1872 complete non-template or fully instantiated classes have this
1874 if (!TYPE_HAS_COPY_CTOR (t))
1875 nonprivate_ctor = 1;
1877 for (fn = CLASSTYPE_CONSTRUCTORS (t); fn; fn = OVL_NEXT (fn))
1879 tree ctor = OVL_CURRENT (fn);
1880 /* Ideally, we wouldn't count copy constructors (or, in
1881 fact, any constructor that takes an argument of the
1882 class type as a parameter) because such things cannot
1883 be used to construct an instance of the class unless
1884 you already have one. But, for now at least, we're
1886 if (! TREE_PRIVATE (ctor))
1888 nonprivate_ctor = 1;
1893 if (nonprivate_ctor == 0)
1895 warning (OPT_Wctor_dtor_privacy,
1896 "%q#T only defines private constructors and has no friends",
1904 gt_pointer_operator new_value;
1908 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1911 method_name_cmp (const void* m1_p, const void* m2_p)
1913 const tree *const m1 = (const tree *) m1_p;
1914 const tree *const m2 = (const tree *) m2_p;
1916 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1918 if (*m1 == NULL_TREE)
1920 if (*m2 == NULL_TREE)
1922 if (DECL_NAME (OVL_CURRENT (*m1)) < DECL_NAME (OVL_CURRENT (*m2)))
1927 /* This routine compares two fields like method_name_cmp but using the
1928 pointer operator in resort_field_decl_data. */
1931 resort_method_name_cmp (const void* m1_p, const void* m2_p)
1933 const tree *const m1 = (const tree *) m1_p;
1934 const tree *const m2 = (const tree *) m2_p;
1935 if (*m1 == NULL_TREE && *m2 == NULL_TREE)
1937 if (*m1 == NULL_TREE)
1939 if (*m2 == NULL_TREE)
1942 tree d1 = DECL_NAME (OVL_CURRENT (*m1));
1943 tree d2 = DECL_NAME (OVL_CURRENT (*m2));
1944 resort_data.new_value (&d1, resort_data.cookie);
1945 resort_data.new_value (&d2, resort_data.cookie);
1952 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1955 resort_type_method_vec (void* obj,
1957 gt_pointer_operator new_value,
1960 vec<tree, va_gc> *method_vec = (vec<tree, va_gc> *) obj;
1961 int len = vec_safe_length (method_vec);
1965 /* The type conversion ops have to live at the front of the vec, so we
1967 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
1968 vec_safe_iterate (method_vec, slot, &fn);
1970 if (!DECL_CONV_FN_P (OVL_CURRENT (fn)))
1975 resort_data.new_value = new_value;
1976 resort_data.cookie = cookie;
1977 qsort (method_vec->address () + slot, len - slot, sizeof (tree),
1978 resort_method_name_cmp);
1982 /* Warn about duplicate methods in fn_fields.
1984 Sort methods that are not special (i.e., constructors, destructors,
1985 and type conversion operators) so that we can find them faster in
1989 finish_struct_methods (tree t)
1992 vec<tree, va_gc> *method_vec;
1995 method_vec = CLASSTYPE_METHOD_VEC (t);
1999 len = method_vec->length ();
2001 /* Clear DECL_IN_AGGR_P for all functions. */
2002 for (fn_fields = TYPE_METHODS (t); fn_fields;
2003 fn_fields = DECL_CHAIN (fn_fields))
2004 DECL_IN_AGGR_P (fn_fields) = 0;
2006 /* Issue warnings about private constructors and such. If there are
2007 no methods, then some public defaults are generated. */
2008 maybe_warn_about_overly_private_class (t);
2010 /* The type conversion ops have to live at the front of the vec, so we
2012 for (slot = CLASSTYPE_FIRST_CONVERSION_SLOT;
2013 method_vec->iterate (slot, &fn_fields);
2015 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields)))
2018 qsort (method_vec->address () + slot,
2019 len-slot, sizeof (tree), method_name_cmp);
2022 /* Make BINFO's vtable have N entries, including RTTI entries,
2023 vbase and vcall offsets, etc. Set its type and call the back end
2027 layout_vtable_decl (tree binfo, int n)
2032 atype = build_array_of_n_type (vtable_entry_type, n);
2033 layout_type (atype);
2035 /* We may have to grow the vtable. */
2036 vtable = get_vtbl_decl_for_binfo (binfo);
2037 if (!same_type_p (TREE_TYPE (vtable), atype))
2039 TREE_TYPE (vtable) = atype;
2040 DECL_SIZE (vtable) = DECL_SIZE_UNIT (vtable) = NULL_TREE;
2041 layout_decl (vtable, 0);
2045 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2046 have the same signature. */
2049 same_signature_p (const_tree fndecl, const_tree base_fndecl)
2051 /* One destructor overrides another if they are the same kind of
2053 if (DECL_DESTRUCTOR_P (base_fndecl) && DECL_DESTRUCTOR_P (fndecl)
2054 && special_function_p (base_fndecl) == special_function_p (fndecl))
2056 /* But a non-destructor never overrides a destructor, nor vice
2057 versa, nor do different kinds of destructors override
2058 one-another. For example, a complete object destructor does not
2059 override a deleting destructor. */
2060 if (DECL_DESTRUCTOR_P (base_fndecl) || DECL_DESTRUCTOR_P (fndecl))
2063 if (DECL_NAME (fndecl) == DECL_NAME (base_fndecl)
2064 || (DECL_CONV_FN_P (fndecl)
2065 && DECL_CONV_FN_P (base_fndecl)
2066 && same_type_p (DECL_CONV_FN_TYPE (fndecl),
2067 DECL_CONV_FN_TYPE (base_fndecl))))
2069 tree types, base_types;
2070 types = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
2071 base_types = TYPE_ARG_TYPES (TREE_TYPE (base_fndecl));
2072 if ((cp_type_quals (TREE_TYPE (TREE_VALUE (base_types)))
2073 == cp_type_quals (TREE_TYPE (TREE_VALUE (types))))
2074 && (type_memfn_rqual (TREE_TYPE (fndecl))
2075 == type_memfn_rqual (TREE_TYPE (base_fndecl)))
2076 && compparms (TREE_CHAIN (base_types), TREE_CHAIN (types)))
2082 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2086 base_derived_from (tree derived, tree base)
2090 for (probe = base; probe; probe = BINFO_INHERITANCE_CHAIN (probe))
2092 if (probe == derived)
2094 else if (BINFO_VIRTUAL_P (probe))
2095 /* If we meet a virtual base, we can't follow the inheritance
2096 any more. See if the complete type of DERIVED contains
2097 such a virtual base. */
2098 return (binfo_for_vbase (BINFO_TYPE (probe), BINFO_TYPE (derived))
2104 typedef struct find_final_overrider_data_s {
2105 /* The function for which we are trying to find a final overrider. */
2107 /* The base class in which the function was declared. */
2108 tree declaring_base;
2109 /* The candidate overriders. */
2111 /* Path to most derived. */
2113 } find_final_overrider_data;
2115 /* Add the overrider along the current path to FFOD->CANDIDATES.
2116 Returns true if an overrider was found; false otherwise. */
2119 dfs_find_final_overrider_1 (tree binfo,
2120 find_final_overrider_data *ffod,
2125 /* If BINFO is not the most derived type, try a more derived class.
2126 A definition there will overrider a definition here. */
2130 if (dfs_find_final_overrider_1
2131 (ffod->path[depth], ffod, depth))
2135 method = look_for_overrides_here (BINFO_TYPE (binfo), ffod->fn);
2138 tree *candidate = &ffod->candidates;
2140 /* Remove any candidates overridden by this new function. */
2143 /* If *CANDIDATE overrides METHOD, then METHOD
2144 cannot override anything else on the list. */
2145 if (base_derived_from (TREE_VALUE (*candidate), binfo))
2147 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2148 if (base_derived_from (binfo, TREE_VALUE (*candidate)))
2149 *candidate = TREE_CHAIN (*candidate);
2151 candidate = &TREE_CHAIN (*candidate);
2154 /* Add the new function. */
2155 ffod->candidates = tree_cons (method, binfo, ffod->candidates);
2162 /* Called from find_final_overrider via dfs_walk. */
2165 dfs_find_final_overrider_pre (tree binfo, void *data)
2167 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
2169 if (binfo == ffod->declaring_base)
2170 dfs_find_final_overrider_1 (binfo, ffod, ffod->path.length ());
2171 ffod->path.safe_push (binfo);
2177 dfs_find_final_overrider_post (tree /*binfo*/, void *data)
2179 find_final_overrider_data *ffod = (find_final_overrider_data *) data;
2185 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2186 FN and whose TREE_VALUE is the binfo for the base where the
2187 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2188 DERIVED) is the base object in which FN is declared. */
2191 find_final_overrider (tree derived, tree binfo, tree fn)
2193 find_final_overrider_data ffod;
2195 /* Getting this right is a little tricky. This is valid:
2197 struct S { virtual void f (); };
2198 struct T { virtual void f (); };
2199 struct U : public S, public T { };
2201 even though calling `f' in `U' is ambiguous. But,
2203 struct R { virtual void f(); };
2204 struct S : virtual public R { virtual void f (); };
2205 struct T : virtual public R { virtual void f (); };
2206 struct U : public S, public T { };
2208 is not -- there's no way to decide whether to put `S::f' or
2209 `T::f' in the vtable for `R'.
2211 The solution is to look at all paths to BINFO. If we find
2212 different overriders along any two, then there is a problem. */
2213 if (DECL_THUNK_P (fn))
2214 fn = THUNK_TARGET (fn);
2216 /* Determine the depth of the hierarchy. */
2218 ffod.declaring_base = binfo;
2219 ffod.candidates = NULL_TREE;
2220 ffod.path.create (30);
2222 dfs_walk_all (derived, dfs_find_final_overrider_pre,
2223 dfs_find_final_overrider_post, &ffod);
2225 ffod.path.release ();
2227 /* If there was no winner, issue an error message. */
2228 if (!ffod.candidates || TREE_CHAIN (ffod.candidates))
2229 return error_mark_node;
2231 return ffod.candidates;
2234 /* Return the index of the vcall offset for FN when TYPE is used as a
2238 get_vcall_index (tree fn, tree type)
2240 vec<tree_pair_s, va_gc> *indices = CLASSTYPE_VCALL_INDICES (type);
2244 FOR_EACH_VEC_SAFE_ELT (indices, ix, p)
2245 if ((DECL_DESTRUCTOR_P (fn) && DECL_DESTRUCTOR_P (p->purpose))
2246 || same_signature_p (fn, p->purpose))
2249 /* There should always be an appropriate index. */
2253 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2254 dominated by T. FN is the old function; VIRTUALS points to the
2255 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2256 of that entry in the list. */
2259 update_vtable_entry_for_fn (tree t, tree binfo, tree fn, tree* virtuals,
2267 tree overrider_fn, overrider_target;
2268 tree target_fn = DECL_THUNK_P (fn) ? THUNK_TARGET (fn) : fn;
2269 tree over_return, base_return;
2272 /* Find the nearest primary base (possibly binfo itself) which defines
2273 this function; this is the class the caller will convert to when
2274 calling FN through BINFO. */
2275 for (b = binfo; ; b = get_primary_binfo (b))
2278 if (look_for_overrides_here (BINFO_TYPE (b), target_fn))
2281 /* The nearest definition is from a lost primary. */
2282 if (BINFO_LOST_PRIMARY_P (b))
2287 /* Find the final overrider. */
2288 overrider = find_final_overrider (TYPE_BINFO (t), b, target_fn);
2289 if (overrider == error_mark_node)
2291 error ("no unique final overrider for %qD in %qT", target_fn, t);
2294 overrider_target = overrider_fn = TREE_PURPOSE (overrider);
2296 /* Check for adjusting covariant return types. */
2297 over_return = TREE_TYPE (TREE_TYPE (overrider_target));
2298 base_return = TREE_TYPE (TREE_TYPE (target_fn));
2300 if (POINTER_TYPE_P (over_return)
2301 && TREE_CODE (over_return) == TREE_CODE (base_return)
2302 && CLASS_TYPE_P (TREE_TYPE (over_return))
2303 && CLASS_TYPE_P (TREE_TYPE (base_return))
2304 /* If the overrider is invalid, don't even try. */
2305 && !DECL_INVALID_OVERRIDER_P (overrider_target))
2307 /* If FN is a covariant thunk, we must figure out the adjustment
2308 to the final base FN was converting to. As OVERRIDER_TARGET might
2309 also be converting to the return type of FN, we have to
2310 combine the two conversions here. */
2311 tree fixed_offset, virtual_offset;
2313 over_return = TREE_TYPE (over_return);
2314 base_return = TREE_TYPE (base_return);
2316 if (DECL_THUNK_P (fn))
2318 gcc_assert (DECL_RESULT_THUNK_P (fn));
2319 fixed_offset = ssize_int (THUNK_FIXED_OFFSET (fn));
2320 virtual_offset = THUNK_VIRTUAL_OFFSET (fn);
2323 fixed_offset = virtual_offset = NULL_TREE;
2326 /* Find the equivalent binfo within the return type of the
2327 overriding function. We will want the vbase offset from
2329 virtual_offset = binfo_for_vbase (BINFO_TYPE (virtual_offset),
2331 else if (!same_type_ignoring_top_level_qualifiers_p
2332 (over_return, base_return))
2334 /* There was no existing virtual thunk (which takes
2335 precedence). So find the binfo of the base function's
2336 return type within the overriding function's return type.
2337 We cannot call lookup base here, because we're inside a
2338 dfs_walk, and will therefore clobber the BINFO_MARKED
2339 flags. Fortunately we know the covariancy is valid (it
2340 has already been checked), so we can just iterate along
2341 the binfos, which have been chained in inheritance graph
2342 order. Of course it is lame that we have to repeat the
2343 search here anyway -- we should really be caching pieces
2344 of the vtable and avoiding this repeated work. */
2345 tree thunk_binfo, base_binfo;
2347 /* Find the base binfo within the overriding function's
2348 return type. We will always find a thunk_binfo, except
2349 when the covariancy is invalid (which we will have
2350 already diagnosed). */
2351 for (base_binfo = TYPE_BINFO (base_return),
2352 thunk_binfo = TYPE_BINFO (over_return);
2354 thunk_binfo = TREE_CHAIN (thunk_binfo))
2355 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo),
2356 BINFO_TYPE (base_binfo)))
2359 /* See if virtual inheritance is involved. */
2360 for (virtual_offset = thunk_binfo;
2362 virtual_offset = BINFO_INHERITANCE_CHAIN (virtual_offset))
2363 if (BINFO_VIRTUAL_P (virtual_offset))
2367 || (thunk_binfo && !BINFO_OFFSET_ZEROP (thunk_binfo)))
2369 tree offset = convert (ssizetype, BINFO_OFFSET (thunk_binfo));
2373 /* We convert via virtual base. Adjust the fixed
2374 offset to be from there. */
2376 size_diffop (offset,
2378 BINFO_OFFSET (virtual_offset)));
2381 /* There was an existing fixed offset, this must be
2382 from the base just converted to, and the base the
2383 FN was thunking to. */
2384 fixed_offset = size_binop (PLUS_EXPR, fixed_offset, offset);
2386 fixed_offset = offset;
2390 if (fixed_offset || virtual_offset)
2391 /* Replace the overriding function with a covariant thunk. We
2392 will emit the overriding function in its own slot as
2394 overrider_fn = make_thunk (overrider_target, /*this_adjusting=*/0,
2395 fixed_offset, virtual_offset);
2398 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target) ||
2399 !DECL_THUNK_P (fn));
2401 /* If we need a covariant thunk, then we may need to adjust first_defn.
2402 The ABI specifies that the thunks emitted with a function are
2403 determined by which bases the function overrides, so we need to be
2404 sure that we're using a thunk for some overridden base; even if we
2405 know that the necessary this adjustment is zero, there may not be an
2406 appropriate zero-this-adjusment thunk for us to use since thunks for
2407 overriding virtual bases always use the vcall offset.
2409 Furthermore, just choosing any base that overrides this function isn't
2410 quite right, as this slot won't be used for calls through a type that
2411 puts a covariant thunk here. Calling the function through such a type
2412 will use a different slot, and that slot is the one that determines
2413 the thunk emitted for that base.
2415 So, keep looking until we find the base that we're really overriding
2416 in this slot: the nearest primary base that doesn't use a covariant
2417 thunk in this slot. */
2418 if (overrider_target != overrider_fn)
2420 if (BINFO_TYPE (b) == DECL_CONTEXT (overrider_target))
2421 /* We already know that the overrider needs a covariant thunk. */
2422 b = get_primary_binfo (b);
2423 for (; ; b = get_primary_binfo (b))
2425 tree main_binfo = TYPE_BINFO (BINFO_TYPE (b));
2426 tree bv = chain_index (ix, BINFO_VIRTUALS (main_binfo));
2427 if (!DECL_THUNK_P (TREE_VALUE (bv)))
2429 if (BINFO_LOST_PRIMARY_P (b))
2435 /* Assume that we will produce a thunk that convert all the way to
2436 the final overrider, and not to an intermediate virtual base. */
2437 virtual_base = NULL_TREE;
2439 /* See if we can convert to an intermediate virtual base first, and then
2440 use the vcall offset located there to finish the conversion. */
2441 for (; b; b = BINFO_INHERITANCE_CHAIN (b))
2443 /* If we find the final overrider, then we can stop
2445 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b),
2446 BINFO_TYPE (TREE_VALUE (overrider))))
2449 /* If we find a virtual base, and we haven't yet found the
2450 overrider, then there is a virtual base between the
2451 declaring base (first_defn) and the final overrider. */
2452 if (BINFO_VIRTUAL_P (b))
2459 /* Compute the constant adjustment to the `this' pointer. The
2460 `this' pointer, when this function is called, will point at BINFO
2461 (or one of its primary bases, which are at the same offset). */
2463 /* The `this' pointer needs to be adjusted from the declaration to
2464 the nearest virtual base. */
2465 delta = size_diffop_loc (input_location,
2466 convert (ssizetype, BINFO_OFFSET (virtual_base)),
2467 convert (ssizetype, BINFO_OFFSET (first_defn)));
2469 /* If the nearest definition is in a lost primary, we don't need an
2470 entry in our vtable. Except possibly in a constructor vtable,
2471 if we happen to get our primary back. In that case, the offset
2472 will be zero, as it will be a primary base. */
2473 delta = size_zero_node;
2475 /* The `this' pointer needs to be adjusted from pointing to
2476 BINFO to pointing at the base where the final overrider
2478 delta = size_diffop_loc (input_location,
2480 BINFO_OFFSET (TREE_VALUE (overrider))),
2481 convert (ssizetype, BINFO_OFFSET (binfo)));
2483 modify_vtable_entry (t, binfo, overrider_fn, delta, virtuals);
2486 BV_VCALL_INDEX (*virtuals)
2487 = get_vcall_index (overrider_target, BINFO_TYPE (virtual_base));
2489 BV_VCALL_INDEX (*virtuals) = NULL_TREE;
2491 BV_LOST_PRIMARY (*virtuals) = lost;
2494 /* Called from modify_all_vtables via dfs_walk. */
2497 dfs_modify_vtables (tree binfo, void* data)
2499 tree t = (tree) data;
2504 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
2505 /* A base without a vtable needs no modification, and its bases
2506 are uninteresting. */
2507 return dfs_skip_bases;
2509 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t)
2510 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t))
2511 /* Don't do the primary vtable, if it's new. */
2514 if (BINFO_PRIMARY_P (binfo) && !BINFO_VIRTUAL_P (binfo))
2515 /* There's no need to modify the vtable for a non-virtual primary
2516 base; we're not going to use that vtable anyhow. We do still
2517 need to do this for virtual primary bases, as they could become
2518 non-primary in a construction vtable. */
2521 make_new_vtable (t, binfo);
2523 /* Now, go through each of the virtual functions in the virtual
2524 function table for BINFO. Find the final overrider, and update
2525 the BINFO_VIRTUALS list appropriately. */
2526 for (ix = 0, virtuals = BINFO_VIRTUALS (binfo),
2527 old_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
2529 ix++, virtuals = TREE_CHAIN (virtuals),
2530 old_virtuals = TREE_CHAIN (old_virtuals))
2531 update_vtable_entry_for_fn (t,
2533 BV_FN (old_virtuals),
2539 /* Update all of the primary and secondary vtables for T. Create new
2540 vtables as required, and initialize their RTTI information. Each
2541 of the functions in VIRTUALS is declared in T and may override a
2542 virtual function from a base class; find and modify the appropriate
2543 entries to point to the overriding functions. Returns a list, in
2544 declaration order, of the virtual functions that are declared in T,
2545 but do not appear in the primary base class vtable, and which
2546 should therefore be appended to the end of the vtable for T. */
2549 modify_all_vtables (tree t, tree virtuals)
2551 tree binfo = TYPE_BINFO (t);
2554 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2555 if (TYPE_CONTAINS_VPTR_P (t))
2556 get_vtable_decl (t, false);
2558 /* Update all of the vtables. */
2559 dfs_walk_once (binfo, dfs_modify_vtables, NULL, t);
2561 /* Add virtual functions not already in our primary vtable. These
2562 will be both those introduced by this class, and those overridden
2563 from secondary bases. It does not include virtuals merely
2564 inherited from secondary bases. */
2565 for (fnsp = &virtuals; *fnsp; )
2567 tree fn = TREE_VALUE (*fnsp);
2569 if (!value_member (fn, BINFO_VIRTUALS (binfo))
2570 || DECL_VINDEX (fn) == error_mark_node)
2572 /* We don't need to adjust the `this' pointer when
2573 calling this function. */
2574 BV_DELTA (*fnsp) = integer_zero_node;
2575 BV_VCALL_INDEX (*fnsp) = NULL_TREE;
2577 /* This is a function not already in our vtable. Keep it. */
2578 fnsp = &TREE_CHAIN (*fnsp);
2581 /* We've already got an entry for this function. Skip it. */
2582 *fnsp = TREE_CHAIN (*fnsp);
2588 /* Get the base virtual function declarations in T that have the
2592 get_basefndecls (tree name, tree t)
2595 tree base_fndecls = NULL_TREE;
2596 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
2599 /* Find virtual functions in T with the indicated NAME. */
2600 i = lookup_fnfields_1 (t, name);
2602 for (methods = (*CLASSTYPE_METHOD_VEC (t))[i];
2604 methods = OVL_NEXT (methods))
2606 tree method = OVL_CURRENT (methods);
2608 if (TREE_CODE (method) == FUNCTION_DECL
2609 && DECL_VINDEX (method))
2610 base_fndecls = tree_cons (NULL_TREE, method, base_fndecls);
2614 return base_fndecls;
2616 for (i = 0; i < n_baseclasses; i++)
2618 tree basetype = BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t), i));
2619 base_fndecls = chainon (get_basefndecls (name, basetype),
2623 return base_fndecls;
2626 /* If this declaration supersedes the declaration of
2627 a method declared virtual in the base class, then
2628 mark this field as being virtual as well. */
2631 check_for_override (tree decl, tree ctype)
2633 bool overrides_found = false;
2634 if (TREE_CODE (decl) == TEMPLATE_DECL)
2635 /* In [temp.mem] we have:
2637 A specialization of a member function template does not
2638 override a virtual function from a base class. */
2640 if ((DECL_DESTRUCTOR_P (decl)
2641 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl))
2642 || DECL_CONV_FN_P (decl))
2643 && look_for_overrides (ctype, decl)
2644 && !DECL_STATIC_FUNCTION_P (decl))
2645 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2646 the error_mark_node so that we know it is an overriding
2649 DECL_VINDEX (decl) = decl;
2650 overrides_found = true;
2653 if (DECL_VIRTUAL_P (decl))
2655 if (!DECL_VINDEX (decl))
2656 DECL_VINDEX (decl) = error_mark_node;
2657 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl)) = 1;
2658 if (DECL_DESTRUCTOR_P (decl))
2659 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype) = true;
2661 else if (DECL_FINAL_P (decl))
2662 error ("%q+#D marked final, but is not virtual", decl);
2663 if (DECL_OVERRIDE_P (decl) && !overrides_found)
2664 error ("%q+#D marked override, but does not override", decl);
2667 /* Warn about hidden virtual functions that are not overridden in t.
2668 We know that constructors and destructors don't apply. */
2671 warn_hidden (tree t)
2673 vec<tree, va_gc> *method_vec = CLASSTYPE_METHOD_VEC (t);
2677 /* We go through each separately named virtual function. */
2678 for (i = CLASSTYPE_FIRST_CONVERSION_SLOT;
2679 vec_safe_iterate (method_vec, i, &fns);
2690 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2691 have the same name. Figure out what name that is. */
2692 name = DECL_NAME (OVL_CURRENT (fns));
2693 /* There are no possibly hidden functions yet. */
2694 base_fndecls = NULL_TREE;
2695 /* Iterate through all of the base classes looking for possibly
2696 hidden functions. */
2697 for (binfo = TYPE_BINFO (t), j = 0;
2698 BINFO_BASE_ITERATE (binfo, j, base_binfo); j++)
2700 tree basetype = BINFO_TYPE (base_binfo);
2701 base_fndecls = chainon (get_basefndecls (name, basetype),
2705 /* If there are no functions to hide, continue. */
2709 /* Remove any overridden functions. */
2710 for (fn = fns; fn; fn = OVL_NEXT (fn))
2712 fndecl = OVL_CURRENT (fn);
2713 if (DECL_VINDEX (fndecl))
2715 tree *prev = &base_fndecls;
2718 /* If the method from the base class has the same
2719 signature as the method from the derived class, it
2720 has been overridden. */
2721 if (same_signature_p (fndecl, TREE_VALUE (*prev)))
2722 *prev = TREE_CHAIN (*prev);
2724 prev = &TREE_CHAIN (*prev);
2728 /* Now give a warning for all base functions without overriders,
2729 as they are hidden. */
2730 while (base_fndecls)
2732 /* Here we know it is a hider, and no overrider exists. */
2733 warning (OPT_Woverloaded_virtual, "%q+D was hidden", TREE_VALUE (base_fndecls));
2734 warning (OPT_Woverloaded_virtual, " by %q+D", fns);
2735 base_fndecls = TREE_CHAIN (base_fndecls);
2740 /* Check for things that are invalid. There are probably plenty of other
2741 things we should check for also. */
2744 finish_struct_anon (tree t)
2748 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2750 if (TREE_STATIC (field))
2752 if (TREE_CODE (field) != FIELD_DECL)
2755 if (DECL_NAME (field) == NULL_TREE
2756 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2758 bool is_union = TREE_CODE (TREE_TYPE (field)) == UNION_TYPE;
2759 tree elt = TYPE_FIELDS (TREE_TYPE (field));
2760 for (; elt; elt = DECL_CHAIN (elt))
2762 /* We're generally only interested in entities the user
2763 declared, but we also find nested classes by noticing
2764 the TYPE_DECL that we create implicitly. You're
2765 allowed to put one anonymous union inside another,
2766 though, so we explicitly tolerate that. We use
2767 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2768 we also allow unnamed types used for defining fields. */
2769 if (DECL_ARTIFICIAL (elt)
2770 && (!DECL_IMPLICIT_TYPEDEF_P (elt)
2771 || TYPE_ANONYMOUS_P (TREE_TYPE (elt))))
2774 if (TREE_CODE (elt) != FIELD_DECL)
2777 permerror (input_location, "%q+#D invalid; an anonymous union can "
2778 "only have non-static data members", elt);
2780 permerror (input_location, "%q+#D invalid; an anonymous struct can "
2781 "only have non-static data members", elt);
2785 if (TREE_PRIVATE (elt))
2788 permerror (input_location, "private member %q+#D in anonymous union", elt);
2790 permerror (input_location, "private member %q+#D in anonymous struct", elt);
2792 else if (TREE_PROTECTED (elt))
2795 permerror (input_location, "protected member %q+#D in anonymous union", elt);
2797 permerror (input_location, "protected member %q+#D in anonymous struct", elt);
2800 TREE_PRIVATE (elt) = TREE_PRIVATE (field);
2801 TREE_PROTECTED (elt) = TREE_PROTECTED (field);
2807 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2808 will be used later during class template instantiation.
2809 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2810 a non-static member data (FIELD_DECL), a member function
2811 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2812 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2813 When FRIEND_P is nonzero, T is either a friend class
2814 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2815 (FUNCTION_DECL, TEMPLATE_DECL). */
2818 maybe_add_class_template_decl_list (tree type, tree t, int friend_p)
2820 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2821 if (CLASSTYPE_TEMPLATE_INFO (type))
2822 CLASSTYPE_DECL_LIST (type)
2823 = tree_cons (friend_p ? NULL_TREE : type,
2824 t, CLASSTYPE_DECL_LIST (type));
2827 /* This function is called from declare_virt_assop_and_dtor via
2830 DATA is a type that direcly or indirectly inherits the base
2831 represented by BINFO. If BINFO contains a virtual assignment [copy
2832 assignment or move assigment] operator or a virtual constructor,
2833 declare that function in DATA if it hasn't been already declared. */
2836 dfs_declare_virt_assop_and_dtor (tree binfo, void *data)
2838 tree bv, fn, t = (tree)data;
2839 tree opname = ansi_assopname (NOP_EXPR);
2841 gcc_assert (t && CLASS_TYPE_P (t));
2842 gcc_assert (binfo && TREE_CODE (binfo) == TREE_BINFO);
2844 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
2845 /* A base without a vtable needs no modification, and its bases
2846 are uninteresting. */
2847 return dfs_skip_bases;
2849 if (BINFO_PRIMARY_P (binfo))
2850 /* If this is a primary base, then we have already looked at the
2851 virtual functions of its vtable. */
2854 for (bv = BINFO_VIRTUALS (binfo); bv; bv = TREE_CHAIN (bv))
2858 if (DECL_NAME (fn) == opname)
2860 if (CLASSTYPE_LAZY_COPY_ASSIGN (t))
2861 lazily_declare_fn (sfk_copy_assignment, t);
2862 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t))
2863 lazily_declare_fn (sfk_move_assignment, t);
2865 else if (DECL_DESTRUCTOR_P (fn)
2866 && CLASSTYPE_LAZY_DESTRUCTOR (t))
2867 lazily_declare_fn (sfk_destructor, t);
2873 /* If the class type T has a direct or indirect base that contains a
2874 virtual assignment operator or a virtual destructor, declare that
2875 function in T if it hasn't been already declared. */
2878 declare_virt_assop_and_dtor (tree t)
2880 if (!(TYPE_POLYMORPHIC_P (t)
2881 && (CLASSTYPE_LAZY_COPY_ASSIGN (t)
2882 || CLASSTYPE_LAZY_MOVE_ASSIGN (t)
2883 || CLASSTYPE_LAZY_DESTRUCTOR (t))))
2886 dfs_walk_all (TYPE_BINFO (t),
2887 dfs_declare_virt_assop_and_dtor,
2891 /* Declare the inheriting constructor for class T inherited from base
2892 constructor CTOR with the parameter array PARMS of size NPARMS. */
2895 one_inheriting_sig (tree t, tree ctor, tree *parms, int nparms)
2897 /* We don't declare an inheriting ctor that would be a default,
2898 copy or move ctor for derived or base. */
2902 && TREE_CODE (parms[0]) == REFERENCE_TYPE)
2904 tree parm = TYPE_MAIN_VARIANT (TREE_TYPE (parms[0]));
2905 if (parm == t || parm == DECL_CONTEXT (ctor))
2909 tree parmlist = void_list_node;
2910 for (int i = nparms - 1; i >= 0; i--)
2911 parmlist = tree_cons (NULL_TREE, parms[i], parmlist);
2912 tree fn = implicitly_declare_fn (sfk_inheriting_constructor,
2913 t, false, ctor, parmlist);
2914 if (add_method (t, fn, NULL_TREE))
2916 DECL_CHAIN (fn) = TYPE_METHODS (t);
2917 TYPE_METHODS (t) = fn;
2921 /* Declare all the inheriting constructors for class T inherited from base
2922 constructor CTOR. */
2925 one_inherited_ctor (tree ctor, tree t)
2927 tree parms = FUNCTION_FIRST_USER_PARMTYPE (ctor);
2929 tree *new_parms = XALLOCAVEC (tree, list_length (parms));
2931 for (; parms && parms != void_list_node; parms = TREE_CHAIN (parms))
2933 if (TREE_PURPOSE (parms))
2934 one_inheriting_sig (t, ctor, new_parms, i);
2935 new_parms[i++] = TREE_VALUE (parms);
2937 one_inheriting_sig (t, ctor, new_parms, i);
2938 if (parms == NULL_TREE)
2940 warning (OPT_Winherited_variadic_ctor,
2941 "the ellipsis in %qD is not inherited", ctor);
2942 inform (DECL_SOURCE_LOCATION (ctor), "%qD declared here", ctor);
2946 /* Create default constructors, assignment operators, and so forth for
2947 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2948 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2949 the class cannot have a default constructor, copy constructor
2950 taking a const reference argument, or an assignment operator taking
2951 a const reference, respectively. */
2954 add_implicitly_declared_members (tree t, tree* access_decls,
2955 int cant_have_const_cctor,
2956 int cant_have_const_assignment)
2958 bool move_ok = false;
2960 if (cxx_dialect >= cxx0x && !CLASSTYPE_DESTRUCTORS (t)
2961 && !TYPE_HAS_COPY_CTOR (t) && !TYPE_HAS_COPY_ASSIGN (t)
2962 && !type_has_move_constructor (t) && !type_has_move_assign (t))
2966 if (!CLASSTYPE_DESTRUCTORS (t))
2968 /* In general, we create destructors lazily. */
2969 CLASSTYPE_LAZY_DESTRUCTOR (t) = 1;
2971 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
2972 && TYPE_FOR_JAVA (t))
2973 /* But if this is a Java class, any non-trivial destructor is
2974 invalid, even if compiler-generated. Therefore, if the
2975 destructor is non-trivial we create it now. */
2976 lazily_declare_fn (sfk_destructor, t);
2981 If there is no user-declared constructor for a class, a default
2982 constructor is implicitly declared. */
2983 if (! TYPE_HAS_USER_CONSTRUCTOR (t))
2985 TYPE_HAS_DEFAULT_CONSTRUCTOR (t) = 1;
2986 CLASSTYPE_LAZY_DEFAULT_CTOR (t) = 1;
2987 if (cxx_dialect >= cxx0x)
2988 TYPE_HAS_CONSTEXPR_CTOR (t)
2989 /* This might force the declaration. */
2990 = type_has_constexpr_default_constructor (t);
2995 If a class definition does not explicitly declare a copy
2996 constructor, one is declared implicitly. */
2997 if (! TYPE_HAS_COPY_CTOR (t) && ! TYPE_FOR_JAVA (t))
2999 TYPE_HAS_COPY_CTOR (t) = 1;
3000 TYPE_HAS_CONST_COPY_CTOR (t) = !cant_have_const_cctor;
3001 CLASSTYPE_LAZY_COPY_CTOR (t) = 1;
3003 CLASSTYPE_LAZY_MOVE_CTOR (t) = 1;
3006 /* If there is no assignment operator, one will be created if and
3007 when it is needed. For now, just record whether or not the type
3008 of the parameter to the assignment operator will be a const or
3009 non-const reference. */
3010 if (!TYPE_HAS_COPY_ASSIGN (t) && !TYPE_FOR_JAVA (t))
3012 TYPE_HAS_COPY_ASSIGN (t) = 1;
3013 TYPE_HAS_CONST_COPY_ASSIGN (t) = !cant_have_const_assignment;
3014 CLASSTYPE_LAZY_COPY_ASSIGN (t) = 1;
3016 CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 1;
3019 /* We can't be lazy about declaring functions that might override
3020 a virtual function from a base class. */
3021 declare_virt_assop_and_dtor (t);
3023 while (*access_decls)
3025 tree using_decl = TREE_VALUE (*access_decls);
3026 tree decl = USING_DECL_DECLS (using_decl);
3027 if (DECL_NAME (using_decl) == ctor_identifier)
3029 /* declare, then remove the decl */
3030 tree ctor_list = decl;
3031 location_t loc = input_location;
3032 input_location = DECL_SOURCE_LOCATION (using_decl);
3034 for (; ctor_list; ctor_list = OVL_NEXT (ctor_list))
3035 one_inherited_ctor (OVL_CURRENT (ctor_list), t);
3036 *access_decls = TREE_CHAIN (*access_decls);
3037 input_location = loc;
3040 access_decls = &TREE_CHAIN (*access_decls);
3044 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3045 count the number of fields in TYPE, including anonymous union
3049 count_fields (tree fields)
3053 for (x = fields; x; x = DECL_CHAIN (x))
3055 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
3056 n_fields += count_fields (TYPE_FIELDS (TREE_TYPE (x)));
3063 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3064 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3065 elts, starting at offset IDX. */
3068 add_fields_to_record_type (tree fields, struct sorted_fields_type *field_vec, int idx)
3071 for (x = fields; x; x = DECL_CHAIN (x))
3073 if (TREE_CODE (x) == FIELD_DECL && ANON_AGGR_TYPE_P (TREE_TYPE (x)))
3074 idx = add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x)), field_vec, idx);
3076 field_vec->elts[idx++] = x;
3081 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3082 starting at offset IDX. */
3085 add_enum_fields_to_record_type (tree enumtype,
3086 struct sorted_fields_type *field_vec,
3090 for (values = TYPE_VALUES (enumtype); values; values = TREE_CHAIN (values))
3091 field_vec->elts[idx++] = TREE_VALUE (values);
3095 /* FIELD is a bit-field. We are finishing the processing for its
3096 enclosing type. Issue any appropriate messages and set appropriate
3097 flags. Returns false if an error has been diagnosed. */
3100 check_bitfield_decl (tree field)
3102 tree type = TREE_TYPE (field);
3105 /* Extract the declared width of the bitfield, which has been
3106 temporarily stashed in DECL_INITIAL. */
3107 w = DECL_INITIAL (field);
3108 gcc_assert (w != NULL_TREE);
3109 /* Remove the bit-field width indicator so that the rest of the
3110 compiler does not treat that value as an initializer. */
3111 DECL_INITIAL (field) = NULL_TREE;
3113 /* Detect invalid bit-field type. */
3114 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type))
3116 error ("bit-field %q+#D with non-integral type", field);
3117 w = error_mark_node;
3121 location_t loc = input_location;
3122 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3125 /* detect invalid field size. */
3126 input_location = DECL_SOURCE_LOCATION (field);
3127 w = cxx_constant_value (w);
3128 input_location = loc;
3130 if (TREE_CODE (w) != INTEGER_CST)
3132 error ("bit-field %q+D width not an integer constant", field);
3133 w = error_mark_node;
3135 else if (tree_int_cst_sgn (w) < 0)
3137 error ("negative width in bit-field %q+D", field);
3138 w = error_mark_node;
3140 else if (integer_zerop (w) && DECL_NAME (field) != 0)
3142 error ("zero width for bit-field %q+D", field);
3143 w = error_mark_node;
3145 else if (compare_tree_int (w, TYPE_PRECISION (type)) > 0
3146 && TREE_CODE (type) != ENUMERAL_TYPE
3147 && TREE_CODE (type) != BOOLEAN_TYPE)
3148 warning (0, "width of %q+D exceeds its type", field);
3149 else if (TREE_CODE (type) == ENUMERAL_TYPE
3150 && (0 > (compare_tree_int
3151 (w, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type))))))
3152 warning (0, "%q+D is too small to hold all values of %q#T", field, type);
3155 if (w != error_mark_node)
3157 DECL_SIZE (field) = convert (bitsizetype, w);
3158 DECL_BIT_FIELD (field) = 1;
3163 /* Non-bit-fields are aligned for their type. */
3164 DECL_BIT_FIELD (field) = 0;
3165 CLEAR_DECL_C_BIT_FIELD (field);
3170 /* FIELD is a non bit-field. We are finishing the processing for its
3171 enclosing type T. Issue any appropriate messages and set appropriate
3175 check_field_decl (tree field,
3177 int* cant_have_const_ctor,
3178 int* no_const_asn_ref,
3179 int* any_default_members)
3181 tree type = strip_array_types (TREE_TYPE (field));
3183 /* In C++98 an anonymous union cannot contain any fields which would change
3184 the settings of CANT_HAVE_CONST_CTOR and friends. */
3185 if (ANON_UNION_TYPE_P (type) && cxx_dialect < cxx0x)
3187 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3188 structs. So, we recurse through their fields here. */
3189 else if (ANON_AGGR_TYPE_P (type))
3193 for (fields = TYPE_FIELDS (type); fields; fields = DECL_CHAIN (fields))
3194 if (TREE_CODE (fields) == FIELD_DECL && !DECL_C_BIT_FIELD (field))
3195 check_field_decl (fields, t, cant_have_const_ctor,
3196 no_const_asn_ref, any_default_members);
3198 /* Check members with class type for constructors, destructors,
3200 else if (CLASS_TYPE_P (type))
3202 /* Never let anything with uninheritable virtuals
3203 make it through without complaint. */
3204 abstract_virtuals_error (field, type);
3206 if (TREE_CODE (t) == UNION_TYPE && cxx_dialect < cxx0x)
3209 int oldcount = errorcount;
3210 if (TYPE_NEEDS_CONSTRUCTING (type))
3211 error ("member %q+#D with constructor not allowed in union",
3213 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3214 error ("member %q+#D with destructor not allowed in union", field);
3215 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type))
3216 error ("member %q+#D with copy assignment operator not allowed in union",
3218 if (!warned && errorcount > oldcount)
3220 inform (DECL_SOURCE_LOCATION (field), "unrestricted unions "
3221 "only available with -std=c++11 or -std=gnu++11");
3227 TYPE_NEEDS_CONSTRUCTING (t) |= TYPE_NEEDS_CONSTRUCTING (type);
3228 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3229 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type);
3230 TYPE_HAS_COMPLEX_COPY_ASSIGN (t)
3231 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type)
3232 || !TYPE_HAS_COPY_ASSIGN (type));
3233 TYPE_HAS_COMPLEX_COPY_CTOR (t) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type)
3234 || !TYPE_HAS_COPY_CTOR (type));
3235 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type);
3236 TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type);
3237 TYPE_HAS_COMPLEX_DFLT (t) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type)
3238 || TYPE_HAS_COMPLEX_DFLT (type));
3241 if (TYPE_HAS_COPY_CTOR (type)
3242 && !TYPE_HAS_CONST_COPY_CTOR (type))
3243 *cant_have_const_ctor = 1;
3245 if (TYPE_HAS_COPY_ASSIGN (type)
3246 && !TYPE_HAS_CONST_COPY_ASSIGN (type))
3247 *no_const_asn_ref = 1;
3250 check_abi_tags (t, field);
3252 if (DECL_INITIAL (field) != NULL_TREE)
3254 /* `build_class_init_list' does not recognize
3256 if (TREE_CODE (t) == UNION_TYPE && *any_default_members != 0)
3257 error ("multiple fields in union %qT initialized", t);
3258 *any_default_members = 1;
3262 /* Check the data members (both static and non-static), class-scoped
3263 typedefs, etc., appearing in the declaration of T. Issue
3264 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3265 declaration order) of access declarations; each TREE_VALUE in this
3266 list is a USING_DECL.
3268 In addition, set the following flags:
3271 The class is empty, i.e., contains no non-static data members.
3273 CANT_HAVE_CONST_CTOR_P
3274 This class cannot have an implicitly generated copy constructor
3275 taking a const reference.
3277 CANT_HAVE_CONST_ASN_REF
3278 This class cannot have an implicitly generated assignment
3279 operator taking a const reference.
3281 All of these flags should be initialized before calling this
3284 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3285 fields can be added by adding to this chain. */
3288 check_field_decls (tree t, tree *access_decls,
3289 int *cant_have_const_ctor_p,
3290 int *no_const_asn_ref_p)
3295 int any_default_members;
3297 int field_access = -1;
3299 /* Assume there are no access declarations. */
3300 *access_decls = NULL_TREE;
3301 /* Assume this class has no pointer members. */
3302 has_pointers = false;
3303 /* Assume none of the members of this class have default
3305 any_default_members = 0;
3307 for (field = &TYPE_FIELDS (t); *field; field = next)
3310 tree type = TREE_TYPE (x);
3311 int this_field_access;
3313 next = &DECL_CHAIN (x);
3315 if (TREE_CODE (x) == USING_DECL)
3317 /* Save the access declarations for our caller. */
3318 *access_decls = tree_cons (NULL_TREE, x, *access_decls);
3322 if (TREE_CODE (x) == TYPE_DECL
3323 || TREE_CODE (x) == TEMPLATE_DECL)
3326 /* If we've gotten this far, it's a data member, possibly static,
3327 or an enumerator. */
3328 if (TREE_CODE (x) != CONST_DECL)
3329 DECL_CONTEXT (x) = t;
3331 /* When this goes into scope, it will be a non-local reference. */
3332 DECL_NONLOCAL (x) = 1;
3334 if (TREE_CODE (t) == UNION_TYPE)
3338 If a union contains a static data member, or a member of
3339 reference type, the program is ill-formed. */
3340 if (TREE_CODE (x) == VAR_DECL)
3342 error ("%q+D may not be static because it is a member of a union", x);
3345 if (TREE_CODE (type) == REFERENCE_TYPE)
3347 error ("%q+D may not have reference type %qT because"
3348 " it is a member of a union",
3354 /* Perform error checking that did not get done in
3356 if (TREE_CODE (type) == FUNCTION_TYPE)
3358 error ("field %q+D invalidly declared function type", x);
3359 type = build_pointer_type (type);
3360 TREE_TYPE (x) = type;
3362 else if (TREE_CODE (type) == METHOD_TYPE)
3364 error ("field %q+D invalidly declared method type", x);
3365 type = build_pointer_type (type);
3366 TREE_TYPE (x) = type;
3369 if (type == error_mark_node)
3372 if (TREE_CODE (x) == CONST_DECL || TREE_CODE (x) == VAR_DECL)
3375 /* Now it can only be a FIELD_DECL. */
3377 if (TREE_PRIVATE (x) || TREE_PROTECTED (x))
3378 CLASSTYPE_NON_AGGREGATE (t) = 1;
3380 /* If at least one non-static data member is non-literal, the whole
3381 class becomes non-literal. Note: if the type is incomplete we
3382 will complain later on. */
3383 if (COMPLETE_TYPE_P (type) && !literal_type_p (type))
3384 CLASSTYPE_LITERAL_P (t) = false;
3386 /* A standard-layout class is a class that:
3388 has the same access control (Clause 11) for all non-static data members,
3390 this_field_access = TREE_PROTECTED (x) ? 1 : TREE_PRIVATE (x) ? 2 : 0;
3391 if (field_access == -1)
3392 field_access = this_field_access;
3393 else if (this_field_access != field_access)
3394 CLASSTYPE_NON_STD_LAYOUT (t) = 1;
3396 /* If this is of reference type, check if it needs an init. */
3397 if (TREE_CODE (type) == REFERENCE_TYPE)
3399 CLASSTYPE_NON_LAYOUT_POD_P (t) = 1;
3400 CLASSTYPE_NON_STD_LAYOUT (t) = 1;
3401 if (DECL_INITIAL (x) == NULL_TREE)
3402 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
3404 /* ARM $12.6.2: [A member initializer list] (or, for an
3405 aggregate, initialization by a brace-enclosed list) is the
3406 only way to initialize nonstatic const and reference
3408 TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1;
3409 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1;
3412 type = strip_array_types (type);
3414 if (TYPE_PACKED (t))
3416 if (!layout_pod_type_p (type) && !TYPE_PACKED (type))
3420 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3424 else if (DECL_C_BIT_FIELD (x)
3425 || TYPE_ALIGN (TREE_TYPE (x)) > BITS_PER_UNIT)
3426 DECL_PACKED (x) = 1;
3429 if (DECL_C_BIT_FIELD (x) && integer_zerop (DECL_INITIAL (x)))
3430 /* We don't treat zero-width bitfields as making a class
3435 /* The class is non-empty. */
3436 CLASSTYPE_EMPTY_P (t) = 0;
3437 /* The class is not even nearly empty. */
3438 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
3439 /* If one of the data members contains an empty class,
3441 if (CLASS_TYPE_P (type)
3442 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3443 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
3446 /* This is used by -Weffc++ (see below). Warn only for pointers
3447 to members which might hold dynamic memory. So do not warn
3448 for pointers to functions or pointers to members. */
3449 if (TYPE_PTR_P (type)
3450 && !TYPE_PTRFN_P (type))
3451 has_pointers = true;
3453 if (CLASS_TYPE_P (type))
3455 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type))
3456 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t, 1);
3457 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type))
3458 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
3461 if (DECL_MUTABLE_P (x) || TYPE_HAS_MUTABLE_P (type))
3462 CLASSTYPE_HAS_MUTABLE (t) = 1;
3464 if (! layout_pod_type_p (type))
3465 /* DR 148 now allows pointers to members (which are POD themselves),
3466 to be allowed in POD structs. */
3467 CLASSTYPE_NON_LAYOUT_POD_P (t) = 1;
3469 if (!std_layout_type_p (type))
3470 CLASSTYPE_NON_STD_LAYOUT (t) = 1;
3472 if (! zero_init_p (type))
3473 CLASSTYPE_NON_ZERO_INIT_P (t) = 1;
3475 /* We set DECL_C_BIT_FIELD in grokbitfield.
3476 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3477 if (! DECL_C_BIT_FIELD (x) || ! check_bitfield_decl (x))
3478 check_field_decl (x, t,
3479 cant_have_const_ctor_p,
3481 &any_default_members);
3483 /* Now that we've removed bit-field widths from DECL_INITIAL,
3484 anything left in DECL_INITIAL is an NSDMI that makes the class
3486 if (DECL_INITIAL (x))
3487 CLASSTYPE_NON_AGGREGATE (t) = true;
3489 /* If any field is const, the structure type is pseudo-const. */
3490 if (CP_TYPE_CONST_P (type))
3492 C_TYPE_FIELDS_READONLY (t) = 1;
3493 if (DECL_INITIAL (x) == NULL_TREE)
3494 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t, 1);
3496 /* ARM $12.6.2: [A member initializer list] (or, for an
3497 aggregate, initialization by a brace-enclosed list) is the
3498 only way to initialize nonstatic const and reference
3500 TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1;
3501 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) = 1;
3503 /* A field that is pseudo-const makes the structure likewise. */
3504 else if (CLASS_TYPE_P (type))
3506 C_TYPE_FIELDS_READONLY (t) |= C_TYPE_FIELDS_READONLY (type);
3507 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t,
3508 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t)
3509 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type));
3512 /* Core issue 80: A nonstatic data member is required to have a
3513 different name from the class iff the class has a
3514 user-declared constructor. */
3515 if (constructor_name_p (DECL_NAME (x), t)
3516 && TYPE_HAS_USER_CONSTRUCTOR (t))
3517 permerror (input_location, "field %q+#D with same name as class", x);
3520 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3521 it should also define a copy constructor and an assignment operator to
3522 implement the correct copy semantic (deep vs shallow, etc.). As it is
3523 not feasible to check whether the constructors do allocate dynamic memory
3524 and store it within members, we approximate the warning like this:
3526 -- Warn only if there are members which are pointers
3527 -- Warn only if there is a non-trivial constructor (otherwise,
3528 there cannot be memory allocated).
3529 -- Warn only if there is a non-trivial destructor. We assume that the
3530 user at least implemented the cleanup correctly, and a destructor
3531 is needed to free dynamic memory.
3533 This seems enough for practical purposes. */
3536 && TYPE_HAS_USER_CONSTRUCTOR (t)
3537 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t)
3538 && !(TYPE_HAS_COPY_CTOR (t) && TYPE_HAS_COPY_ASSIGN (t)))
3540 warning (OPT_Weffc__, "%q#T has pointer data members", t);
3542 if (! TYPE_HAS_COPY_CTOR (t))
3544 warning (OPT_Weffc__,
3545 " but does not override %<%T(const %T&)%>", t, t);
3546 if (!TYPE_HAS_COPY_ASSIGN (t))
3547 warning (OPT_Weffc__, " or %<operator=(const %T&)%>", t);
3549 else if (! TYPE_HAS_COPY_ASSIGN (t))
3550 warning (OPT_Weffc__,
3551 " but does not override %<operator=(const %T&)%>", t);
3554 /* Non-static data member initializers make the default constructor
3556 if (any_default_members)
3558 TYPE_NEEDS_CONSTRUCTING (t) = true;
3559 TYPE_HAS_COMPLEX_DFLT (t) = true;
3562 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3564 TYPE_PACKED (t) = 0;
3566 /* Check anonymous struct/anonymous union fields. */
3567 finish_struct_anon (t);
3569 /* We've built up the list of access declarations in reverse order.
3571 *access_decls = nreverse (*access_decls);
3574 /* If TYPE is an empty class type, records its OFFSET in the table of
3578 record_subobject_offset (tree type, tree offset, splay_tree offsets)
3582 if (!is_empty_class (type))
3585 /* Record the location of this empty object in OFFSETS. */
3586 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3588 n = splay_tree_insert (offsets,
3589 (splay_tree_key) offset,
3590 (splay_tree_value) NULL_TREE);
3591 n->value = ((splay_tree_value)
3592 tree_cons (NULL_TREE,
3599 /* Returns nonzero if TYPE is an empty class type and there is
3600 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3603 check_subobject_offset (tree type, tree offset, splay_tree offsets)
3608 if (!is_empty_class (type))
3611 /* Record the location of this empty object in OFFSETS. */
3612 n = splay_tree_lookup (offsets, (splay_tree_key) offset);
3616 for (t = (tree) n->value; t; t = TREE_CHAIN (t))
3617 if (same_type_p (TREE_VALUE (t), type))
3623 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3624 F for every subobject, passing it the type, offset, and table of
3625 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3628 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3629 than MAX_OFFSET will not be walked.
3631 If F returns a nonzero value, the traversal ceases, and that value
3632 is returned. Otherwise, returns zero. */
3635 walk_subobject_offsets (tree type,
3636 subobject_offset_fn f,
3643 tree type_binfo = NULL_TREE;
3645 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3647 if (max_offset && INT_CST_LT (max_offset, offset))
3650 if (type == error_mark_node)
3655 if (abi_version_at_least (2))
3657 type = BINFO_TYPE (type);
3660 if (CLASS_TYPE_P (type))
3666 /* Avoid recursing into objects that are not interesting. */
3667 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type))
3670 /* Record the location of TYPE. */
3671 r = (*f) (type, offset, offsets);
3675 /* Iterate through the direct base classes of TYPE. */
3677 type_binfo = TYPE_BINFO (type);
3678 for (i = 0; BINFO_BASE_ITERATE (type_binfo, i, binfo); i++)
3682 if (abi_version_at_least (2)
3683 && BINFO_VIRTUAL_P (binfo))
3687 && BINFO_VIRTUAL_P (binfo)
3688 && !BINFO_PRIMARY_P (binfo))
3691 if (!abi_version_at_least (2))
3692 binfo_offset = size_binop (PLUS_EXPR,
3694 BINFO_OFFSET (binfo));
3698 /* We cannot rely on BINFO_OFFSET being set for the base
3699 class yet, but the offsets for direct non-virtual
3700 bases can be calculated by going back to the TYPE. */
3701 orig_binfo = BINFO_BASE_BINFO (TYPE_BINFO (type), i);
3702 binfo_offset = size_binop (PLUS_EXPR,
3704 BINFO_OFFSET (orig_binfo));
3707 r = walk_subobject_offsets (binfo,
3712 (abi_version_at_least (2)
3713 ? /*vbases_p=*/0 : vbases_p));
3718 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type))
3721 vec<tree, va_gc> *vbases;
3723 /* Iterate through the virtual base classes of TYPE. In G++
3724 3.2, we included virtual bases in the direct base class
3725 loop above, which results in incorrect results; the
3726 correct offsets for virtual bases are only known when
3727 working with the most derived type. */
3729 for (vbases = CLASSTYPE_VBASECLASSES (type), ix = 0;
3730 vec_safe_iterate (vbases, ix, &binfo); ix++)
3732 r = walk_subobject_offsets (binfo,
3734 size_binop (PLUS_EXPR,
3736 BINFO_OFFSET (binfo)),
3745 /* We still have to walk the primary base, if it is
3746 virtual. (If it is non-virtual, then it was walked
3748 tree vbase = get_primary_binfo (type_binfo);
3750 if (vbase && BINFO_VIRTUAL_P (vbase)
3751 && BINFO_PRIMARY_P (vbase)
3752 && BINFO_INHERITANCE_CHAIN (vbase) == type_binfo)
3754 r = (walk_subobject_offsets
3756 offsets, max_offset, /*vbases_p=*/0));
3763 /* Iterate through the fields of TYPE. */
3764 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
3765 if (TREE_CODE (field) == FIELD_DECL && !DECL_ARTIFICIAL (field))
3769 if (abi_version_at_least (2))
3770 field_offset = byte_position (field);
3772 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3773 field_offset = DECL_FIELD_OFFSET (field);
3775 r = walk_subobject_offsets (TREE_TYPE (field),
3777 size_binop (PLUS_EXPR,
3787 else if (TREE_CODE (type) == ARRAY_TYPE)
3789 tree element_type = strip_array_types (type);
3790 tree domain = TYPE_DOMAIN (type);
3793 /* Avoid recursing into objects that are not interesting. */
3794 if (!CLASS_TYPE_P (element_type)
3795 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type))
3798 /* Step through each of the elements in the array. */
3799 for (index = size_zero_node;
3800 /* G++ 3.2 had an off-by-one error here. */
3801 (abi_version_at_least (2)
3802 ? !INT_CST_LT (TYPE_MAX_VALUE (domain), index)
3803 : INT_CST_LT (index, TYPE_MAX_VALUE (domain)));
3804 index = size_binop (PLUS_EXPR, index, size_one_node))
3806 r = walk_subobject_offsets (TREE_TYPE (type),
3814 offset = size_binop (PLUS_EXPR, offset,
3815 TYPE_SIZE_UNIT (TREE_TYPE (type)));
3816 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3817 there's no point in iterating through the remaining
3818 elements of the array. */
3819 if (max_offset && INT_CST_LT (max_offset, offset))
3827 /* Record all of the empty subobjects of TYPE (either a type or a
3828 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3829 is being placed at OFFSET; otherwise, it is a base class that is
3830 being placed at OFFSET. */
3833 record_subobject_offsets (tree type,
3836 bool is_data_member)
3839 /* If recording subobjects for a non-static data member or a
3840 non-empty base class , we do not need to record offsets beyond
3841 the size of the biggest empty class. Additional data members
3842 will go at the end of the class. Additional base classes will go
3843 either at offset zero (if empty, in which case they cannot
3844 overlap with offsets past the size of the biggest empty class) or
3845 at the end of the class.
3847 However, if we are placing an empty base class, then we must record
3848 all offsets, as either the empty class is at offset zero (where
3849 other empty classes might later be placed) or at the end of the
3850 class (where other objects might then be placed, so other empty
3851 subobjects might later overlap). */
3853 || !is_empty_class (BINFO_TYPE (type)))
3854 max_offset = sizeof_biggest_empty_class;
3856 max_offset = NULL_TREE;
3857 walk_subobject_offsets (type, record_subobject_offset, offset,
3858 offsets, max_offset, is_data_member);
3861 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3862 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3863 virtual bases of TYPE are examined. */
3866 layout_conflict_p (tree type,
3871 splay_tree_node max_node;
3873 /* Get the node in OFFSETS that indicates the maximum offset where
3874 an empty subobject is located. */
3875 max_node = splay_tree_max (offsets);
3876 /* If there aren't any empty subobjects, then there's no point in
3877 performing this check. */
3881 return walk_subobject_offsets (type, check_subobject_offset, offset,
3882 offsets, (tree) (max_node->key),
3886 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3887 non-static data member of the type indicated by RLI. BINFO is the
3888 binfo corresponding to the base subobject, OFFSETS maps offsets to
3889 types already located at those offsets. This function determines
3890 the position of the DECL. */
3893 layout_nonempty_base_or_field (record_layout_info rli,
3898 tree offset = NULL_TREE;
3904 /* For the purposes of determining layout conflicts, we want to
3905 use the class type of BINFO; TREE_TYPE (DECL) will be the
3906 CLASSTYPE_AS_BASE version, which does not contain entries for
3907 zero-sized bases. */
3908 type = TREE_TYPE (binfo);
3913 type = TREE_TYPE (decl);
3917 /* Try to place the field. It may take more than one try if we have
3918 a hard time placing the field without putting two objects of the
3919 same type at the same address. */
3922 struct record_layout_info_s old_rli = *rli;
3924 /* Place this field. */
3925 place_field (rli, decl);
3926 offset = byte_position (decl);
3928 /* We have to check to see whether or not there is already
3929 something of the same type at the offset we're about to use.
3930 For example, consider:
3933 struct T : public S { int i; };
3934 struct U : public S, public T {};
3936 Here, we put S at offset zero in U. Then, we can't put T at
3937 offset zero -- its S component would be at the same address
3938 as the S we already allocated. So, we have to skip ahead.
3939 Since all data members, including those whose type is an
3940 empty class, have nonzero size, any overlap can happen only
3941 with a direct or indirect base-class -- it can't happen with
3943 /* In a union, overlap is permitted; all members are placed at
3945 if (TREE_CODE (rli->t) == UNION_TYPE)
3947 /* G++ 3.2 did not check for overlaps when placing a non-empty
3949 if (!abi_version_at_least (2) && binfo && BINFO_VIRTUAL_P (binfo))
3951 if (layout_conflict_p (field_p ? type : binfo, offset,
3954 /* Strip off the size allocated to this field. That puts us
3955 at the first place we could have put the field with
3956 proper alignment. */
3959 /* Bump up by the alignment required for the type. */
3961 = size_binop (PLUS_EXPR, rli->bitpos,
3963 ? CLASSTYPE_ALIGN (type)
3964 : TYPE_ALIGN (type)));
3965 normalize_rli (rli);
3968 /* There was no conflict. We're done laying out this field. */
3972 /* Now that we know where it will be placed, update its
3974 if (binfo && CLASS_TYPE_P (BINFO_TYPE (binfo)))
3975 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3976 this point because their BINFO_OFFSET is copied from another
3977 hierarchy. Therefore, we may not need to add the entire
3979 propagate_binfo_offsets (binfo,
3980 size_diffop_loc (input_location,
3981 convert (ssizetype, offset),
3983 BINFO_OFFSET (binfo))));
3986 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3989 empty_base_at_nonzero_offset_p (tree type,
3991 splay_tree /*offsets*/)
3993 return is_empty_class (type) && !integer_zerop (offset);
3996 /* Layout the empty base BINFO. EOC indicates the byte currently just
3997 past the end of the class, and should be correctly aligned for a
3998 class of the type indicated by BINFO; OFFSETS gives the offsets of
3999 the empty bases allocated so far. T is the most derived
4000 type. Return nonzero iff we added it at the end. */
4003 layout_empty_base (record_layout_info rli, tree binfo,
4004 tree eoc, splay_tree offsets)
4007 tree basetype = BINFO_TYPE (binfo);
4010 /* This routine should only be used for empty classes. */
4011 gcc_assert (is_empty_class (basetype));
4012 alignment = ssize_int (CLASSTYPE_ALIGN_UNIT (basetype));
4014 if (!integer_zerop (BINFO_OFFSET (binfo)))
4016 if (abi_version_at_least (2))
4017 propagate_binfo_offsets
4018 (binfo, size_diffop_loc (input_location,
4019 size_zero_node, BINFO_OFFSET (binfo)));
4022 "offset of empty base %qT may not be ABI-compliant and may"
4023 "change in a future version of GCC",
4024 BINFO_TYPE (binfo));
4027 /* This is an empty base class. We first try to put it at offset
4029 if (layout_conflict_p (binfo,
4030 BINFO_OFFSET (binfo),
4034 /* That didn't work. Now, we move forward from the next
4035 available spot in the class. */
4037 propagate_binfo_offsets (binfo, convert (ssizetype, eoc));
4040 if (!layout_conflict_p (binfo,
4041 BINFO_OFFSET (binfo),
4044 /* We finally found a spot where there's no overlap. */
4047 /* There's overlap here, too. Bump along to the next spot. */
4048 propagate_binfo_offsets (binfo, alignment);
4052 if (CLASSTYPE_USER_ALIGN (basetype))
4054 rli->record_align = MAX (rli->record_align, CLASSTYPE_ALIGN (basetype));
4056 rli->unpacked_align = MAX (rli->unpacked_align, CLASSTYPE_ALIGN (basetype));
4057 TYPE_USER_ALIGN (rli->t) = 1;
4063 /* Layout the base given by BINFO in the class indicated by RLI.
4064 *BASE_ALIGN is a running maximum of the alignments of
4065 any base class. OFFSETS gives the location of empty base
4066 subobjects. T is the most derived type. Return nonzero if the new
4067 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4068 *NEXT_FIELD, unless BINFO is for an empty base class.
4070 Returns the location at which the next field should be inserted. */
4073 build_base_field (record_layout_info rli, tree binfo,
4074 splay_tree offsets, tree *next_field)
4077 tree basetype = BINFO_TYPE (binfo);
4079 if (!COMPLETE_TYPE_P (basetype))
4080 /* This error is now reported in xref_tag, thus giving better
4081 location information. */
4084 /* Place the base class. */
4085 if (!is_empty_class (basetype))
4089 /* The containing class is non-empty because it has a non-empty
4091 CLASSTYPE_EMPTY_P (t) = 0;
4093 /* Create the FIELD_DECL. */
4094 decl = build_decl (input_location,
4095 FIELD_DECL, NULL_TREE, CLASSTYPE_AS_BASE (basetype));
4096 DECL_ARTIFICIAL (decl) = 1;
4097 DECL_IGNORED_P (decl) = 1;
4098 DECL_FIELD_CONTEXT (decl) = t;
4099 if (CLASSTYPE_AS_BASE (basetype))
4101 DECL_SIZE (decl) = CLASSTYPE_SIZE (basetype);
4102 DECL_SIZE_UNIT (decl) = CLASSTYPE_SIZE_UNIT (basetype);
4103 DECL_ALIGN (decl) = CLASSTYPE_ALIGN (basetype);
4104 DECL_USER_ALIGN (decl) = CLASSTYPE_USER_ALIGN (basetype);
4105 DECL_MODE (decl) = TYPE_MODE (basetype);
4106 DECL_FIELD_IS_BASE (decl) = 1;
4108 /* Try to place the field. It may take more than one try if we
4109 have a hard time placing the field without putting two
4110 objects of the same type at the same address. */
4111 layout_nonempty_base_or_field (rli, decl, binfo, offsets);
4112 /* Add the new FIELD_DECL to the list of fields for T. */
4113 DECL_CHAIN (decl) = *next_field;
4115 next_field = &DECL_CHAIN (decl);
4123 /* On some platforms (ARM), even empty classes will not be
4125 eoc = round_up_loc (input_location,
4126 rli_size_unit_so_far (rli),
4127 CLASSTYPE_ALIGN_UNIT (basetype));
4128 atend = layout_empty_base (rli, binfo, eoc, offsets);
4129 /* A nearly-empty class "has no proper base class that is empty,
4130 not morally virtual, and at an offset other than zero." */
4131 if (!BINFO_VIRTUAL_P (binfo) && CLASSTYPE_NEARLY_EMPTY_P (t))
4134 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4135 /* The check above (used in G++ 3.2) is insufficient because
4136 an empty class placed at offset zero might itself have an
4137 empty base at a nonzero offset. */
4138 else if (walk_subobject_offsets (basetype,
4139 empty_base_at_nonzero_offset_p,
4142 /*max_offset=*/NULL_TREE,
4145 if (abi_version_at_least (2))
4146 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
4149 "class %qT will be considered nearly empty in a "
4150 "future version of GCC", t);
4154 /* We do not create a FIELD_DECL for empty base classes because
4155 it might overlap some other field. We want to be able to
4156 create CONSTRUCTORs for the class by iterating over the
4157 FIELD_DECLs, and the back end does not handle overlapping
4160 /* An empty virtual base causes a class to be non-empty
4161 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4162 here because that was already done when the virtual table
4163 pointer was created. */
4166 /* Record the offsets of BINFO and its base subobjects. */
4167 record_subobject_offsets (binfo,
4168 BINFO_OFFSET (binfo),
4170 /*is_data_member=*/false);
4175 /* Layout all of the non-virtual base classes. Record empty
4176 subobjects in OFFSETS. T is the most derived type. Return nonzero
4177 if the type cannot be nearly empty. The fields created
4178 corresponding to the base classes will be inserted at
4182 build_base_fields (record_layout_info rli,
4183 splay_tree offsets, tree *next_field)
4185 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4188 int n_baseclasses = BINFO_N_BASE_BINFOS (TYPE_BINFO (t));
4191 /* The primary base class is always allocated first. */
4192 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t))
4193 next_field = build_base_field (rli, CLASSTYPE_PRIMARY_BINFO (t),
4194 offsets, next_field);
4196 /* Now allocate the rest of the bases. */
4197 for (i = 0; i < n_baseclasses; ++i)
4201 base_binfo = BINFO_BASE_BINFO (TYPE_BINFO (t), i);
4203 /* The primary base was already allocated above, so we don't
4204 need to allocate it again here. */
4205 if (base_binfo == CLASSTYPE_PRIMARY_BINFO (t))
4208 /* Virtual bases are added at the end (a primary virtual base
4209 will have already been added). */
4210 if (BINFO_VIRTUAL_P (base_binfo))
4213 next_field = build_base_field (rli, base_binfo,
4214 offsets, next_field);
4218 /* Go through the TYPE_METHODS of T issuing any appropriate
4219 diagnostics, figuring out which methods override which other
4220 methods, and so forth. */
4223 check_methods (tree t)
4227 for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x))
4229 check_for_override (x, t);
4230 if (DECL_PURE_VIRTUAL_P (x) && ! DECL_VINDEX (x))
4231 error ("initializer specified for non-virtual method %q+D", x);
4232 /* The name of the field is the original field name
4233 Save this in auxiliary field for later overloading. */
4234 if (DECL_VINDEX (x))
4236 TYPE_POLYMORPHIC_P (t) = 1;
4237 if (DECL_PURE_VIRTUAL_P (x))
4238 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x);
4240 /* All user-provided destructors are non-trivial.
4241 Constructors and assignment ops are handled in
4242 grok_special_member_properties. */
4243 if (DECL_DESTRUCTOR_P (x) && user_provided_p (x))
4244 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = 1;
4248 /* FN is a constructor or destructor. Clone the declaration to create
4249 a specialized in-charge or not-in-charge version, as indicated by
4253 build_clone (tree fn, tree name)
4258 /* Copy the function. */
4259 clone = copy_decl (fn);
4260 /* Reset the function name. */
4261 DECL_NAME (clone) = name;
4262 SET_DECL_ASSEMBLER_NAME (clone, NULL_TREE);
4263 /* Remember where this function came from. */
4264 DECL_ABSTRACT_ORIGIN (clone) = fn;
4265 /* Make it easy to find the CLONE given the FN. */
4266 DECL_CHAIN (clone) = DECL_CHAIN (fn);
4267 DECL_CHAIN (fn) = clone;
4269 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4270 if (TREE_CODE (clone) == TEMPLATE_DECL)
4272 tree result = build_clone (DECL_TEMPLATE_RESULT (clone), name);
4273 DECL_TEMPLATE_RESULT (clone) = result;
4274 DECL_TEMPLATE_INFO (result) = copy_node (DECL_TEMPLATE_INFO (result));
4275 DECL_TI_TEMPLATE (result) = clone;
4276 TREE_TYPE (clone) = TREE_TYPE (result);
4280 DECL_CLONED_FUNCTION (clone) = fn;
4281 /* There's no pending inline data for this function. */
4282 DECL_PENDING_INLINE_INFO (clone) = NULL;
4283 DECL_PENDING_INLINE_P (clone) = 0;
4285 /* The base-class destructor is not virtual. */
4286 if (name == base_dtor_identifier)
4288 DECL_VIRTUAL_P (clone) = 0;
4289 if (TREE_CODE (clone) != TEMPLATE_DECL)
4290 DECL_VINDEX (clone) = NULL_TREE;
4293 /* If there was an in-charge parameter, drop it from the function
4295 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
4301 exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
4302 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
4303 parmtypes = TYPE_ARG_TYPES (TREE_TYPE (clone));
4304 /* Skip the `this' parameter. */
4305 parmtypes = TREE_CHAIN (parmtypes);
4306 /* Skip the in-charge parameter. */
4307 parmtypes = TREE_CHAIN (parmtypes);
4308 /* And the VTT parm, in a complete [cd]tor. */
4309 if (DECL_HAS_VTT_PARM_P (fn)
4310 && ! DECL_NEEDS_VTT_PARM_P (clone))
4311 parmtypes = TREE_CHAIN (parmtypes);
4312 /* If this is subobject constructor or destructor, add the vtt
4315 = build_method_type_directly (basetype,
4316 TREE_TYPE (TREE_TYPE (clone)),
4319 TREE_TYPE (clone) = build_exception_variant (TREE_TYPE (clone),
4322 = cp_build_type_attribute_variant (TREE_TYPE (clone),
4323 TYPE_ATTRIBUTES (TREE_TYPE (fn)));
4326 /* Copy the function parameters. */
4327 DECL_ARGUMENTS (clone) = copy_list (DECL_ARGUMENTS (clone));
4328 /* Remove the in-charge parameter. */
4329 if (DECL_HAS_IN_CHARGE_PARM_P (clone))
4331 DECL_CHAIN (DECL_ARGUMENTS (clone))
4332 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone)));
4333 DECL_HAS_IN_CHARGE_PARM_P (clone) = 0;
4335 /* And the VTT parm, in a complete [cd]tor. */
4336 if (DECL_HAS_VTT_PARM_P (fn))
4338 if (DECL_NEEDS_VTT_PARM_P (clone))
4339 DECL_HAS_VTT_PARM_P (clone) = 1;
4342 DECL_CHAIN (DECL_ARGUMENTS (clone))
4343 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone)));
4344 DECL_HAS_VTT_PARM_P (clone) = 0;
4348 for (parms = DECL_ARGUMENTS (clone); parms; parms = DECL_CHAIN (parms))
4350 DECL_CONTEXT (parms) = clone;
4351 cxx_dup_lang_specific_decl (parms);
4354 /* Create the RTL for this function. */
4355 SET_DECL_RTL (clone, NULL);
4356 rest_of_decl_compilation (clone, /*top_level=*/1, at_eof);
4359 note_decl_for_pch (clone);
4364 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4365 not invoke this function directly.
4367 For a non-thunk function, returns the address of the slot for storing
4368 the function it is a clone of. Otherwise returns NULL_TREE.
4370 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4371 cloned_function is unset. This is to support the separate
4372 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4373 on a template makes sense, but not the former. */
4376 decl_cloned_function_p (const_tree decl, bool just_testing)
4380 decl = STRIP_TEMPLATE (decl);
4382 if (TREE_CODE (decl) != FUNCTION_DECL
4383 || !DECL_LANG_SPECIFIC (decl)
4384 || DECL_LANG_SPECIFIC (decl)->u.fn.thunk_p)
4386 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4388 lang_check_failed (__FILE__, __LINE__, __FUNCTION__);
4394 ptr = &DECL_LANG_SPECIFIC (decl)->u.fn.u5.cloned_function;
4395 if (just_testing && *ptr == NULL_TREE)
4401 /* Produce declarations for all appropriate clones of FN. If
4402 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4403 CLASTYPE_METHOD_VEC as well. */
4406 clone_function_decl (tree fn, int update_method_vec_p)
4410 /* Avoid inappropriate cloning. */
4412 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn)))
4415 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn))
4417 /* For each constructor, we need two variants: an in-charge version
4418 and a not-in-charge version. */
4419 clone = build_clone (fn, complete_ctor_identifier);
4420 if (update_method_vec_p)
4421 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
4422 clone = build_clone (fn, base_ctor_identifier);
4423 if (update_method_vec_p)
4424 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
4428 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn));
4430 /* For each destructor, we need three variants: an in-charge
4431 version, a not-in-charge version, and an in-charge deleting
4432 version. We clone the deleting version first because that
4433 means it will go second on the TYPE_METHODS list -- and that
4434 corresponds to the correct layout order in the virtual
4437 For a non-virtual destructor, we do not build a deleting
4439 if (DECL_VIRTUAL_P (fn))
4441 clone = build_clone (fn, deleting_dtor_identifier);
4442 if (update_method_vec_p)
4443 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
4445 clone = build_clone (fn, complete_dtor_identifier);
4446 if (update_method_vec_p)
4447 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
4448 clone = build_clone (fn, base_dtor_identifier);
4449 if (update_method_vec_p)
4450 add_method (DECL_CONTEXT (clone), clone, NULL_TREE);
4453 /* Note that this is an abstract function that is never emitted. */
4454 DECL_ABSTRACT (fn) = 1;
4457 /* DECL is an in charge constructor, which is being defined. This will
4458 have had an in class declaration, from whence clones were
4459 declared. An out-of-class definition can specify additional default
4460 arguments. As it is the clones that are involved in overload
4461 resolution, we must propagate the information from the DECL to its
4465 adjust_clone_args (tree decl)
4469 for (clone = DECL_CHAIN (decl); clone && DECL_CLONED_FUNCTION_P (clone);
4470 clone = DECL_CHAIN (clone))
4472 tree orig_clone_parms = TYPE_ARG_TYPES (TREE_TYPE (clone));
4473 tree orig_decl_parms = TYPE_ARG_TYPES (TREE_TYPE (decl));
4474 tree decl_parms, clone_parms;
4476 clone_parms = orig_clone_parms;
4478 /* Skip the 'this' parameter. */
4479 orig_clone_parms = TREE_CHAIN (orig_clone_parms);
4480 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
4482 if (DECL_HAS_IN_CHARGE_PARM_P (decl))
4483 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
4484 if (DECL_HAS_VTT_PARM_P (decl))
4485 orig_decl_parms = TREE_CHAIN (orig_decl_parms);
4487 clone_parms = orig_clone_parms;
4488 if (DECL_HAS_VTT_PARM_P (clone))
4489 clone_parms = TREE_CHAIN (clone_parms);
4491 for (decl_parms = orig_decl_parms; decl_parms;
4492 decl_parms = TREE_CHAIN (decl_parms),
4493 clone_parms = TREE_CHAIN (clone_parms))
4495 gcc_assert (same_type_p (TREE_TYPE (decl_parms),
4496 TREE_TYPE (clone_parms)));
4498 if (TREE_PURPOSE (decl_parms) && !TREE_PURPOSE (clone_parms))
4500 /* A default parameter has been added. Adjust the
4501 clone's parameters. */
4502 tree exceptions = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone));
4503 tree attrs = TYPE_ATTRIBUTES (TREE_TYPE (clone));
4504 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (clone));
4507 clone_parms = orig_decl_parms;
4509 if (DECL_HAS_VTT_PARM_P (clone))
4511 clone_parms = tree_cons (TREE_PURPOSE (orig_clone_parms),
4512 TREE_VALUE (orig_clone_parms),
4514 TREE_TYPE (clone_parms) = TREE_TYPE (orig_clone_parms);
4516 type = build_method_type_directly (basetype,
4517 TREE_TYPE (TREE_TYPE (clone)),
4520 type = build_exception_variant (type, exceptions);
4522 type = cp_build_type_attribute_variant (type, attrs);
4523 TREE_TYPE (clone) = type;
4525 clone_parms = NULL_TREE;
4529 gcc_assert (!clone_parms);
4533 /* For each of the constructors and destructors in T, create an
4534 in-charge and not-in-charge variant. */
4537 clone_constructors_and_destructors (tree t)
4541 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4543 if (!CLASSTYPE_METHOD_VEC (t))
4546 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4547 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4548 for (fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4549 clone_function_decl (OVL_CURRENT (fns), /*update_method_vec_p=*/1);
4552 /* Deduce noexcept for a destructor DTOR. */
4555 deduce_noexcept_on_destructor (tree dtor)
4557 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor)))
4559 tree ctx = DECL_CONTEXT (dtor);
4560 tree implicit_fn = implicitly_declare_fn (sfk_destructor, ctx,
4563 tree eh_spec = TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn));
4564 TREE_TYPE (dtor) = build_exception_variant (TREE_TYPE (dtor), eh_spec);
4568 /* For each destructor in T, deduce noexcept:
4570 12.4/3: A declaration of a destructor that does not have an
4571 exception-specification is implicitly considered to have the
4572 same exception-specification as an implicit declaration (15.4). */
4575 deduce_noexcept_on_destructors (tree t)
4577 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4579 if (!CLASSTYPE_METHOD_VEC (t))
4582 bool saved_nontrivial_dtor = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
4584 /* Avoid early exit from synthesized_method_walk (c++/57645). */
4585 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = true;
4587 for (tree fns = CLASSTYPE_DESTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4588 deduce_noexcept_on_destructor (OVL_CURRENT (fns));
4590 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = saved_nontrivial_dtor;
4593 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4594 of TYPE for virtual functions which FNDECL overrides. Return a
4595 mask of the tm attributes found therein. */
4598 look_for_tm_attr_overrides (tree type, tree fndecl)
4600 tree binfo = TYPE_BINFO (type);
4604 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ++ix)
4606 tree o, basetype = BINFO_TYPE (base_binfo);
4608 if (!TYPE_POLYMORPHIC_P (basetype))
4611 o = look_for_overrides_here (basetype, fndecl);
4613 found |= tm_attr_to_mask (find_tm_attribute
4614 (TYPE_ATTRIBUTES (TREE_TYPE (o))));
4616 found |= look_for_tm_attr_overrides (basetype, fndecl);
4622 /* Subroutine of set_method_tm_attributes. Handle the checks and
4623 inheritance for one virtual method FNDECL. */
4626 set_one_vmethod_tm_attributes (tree type, tree fndecl)
4631 found = look_for_tm_attr_overrides (type, fndecl);
4633 /* If FNDECL doesn't actually override anything (i.e. T is the
4634 class that first declares FNDECL virtual), then we're done. */
4638 tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl)));
4639 have = tm_attr_to_mask (tm_attr);
4641 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4642 tm_pure must match exactly, otherwise no weakening of
4643 tm_safe > tm_callable > nothing. */
4644 /* ??? The tm_pure attribute didn't make the transition to the
4645 multivendor language spec. */
4646 if (have == TM_ATTR_PURE)
4648 if (found != TM_ATTR_PURE)
4654 /* If the overridden function is tm_pure, then FNDECL must be. */
4655 else if (found == TM_ATTR_PURE && tm_attr)
4657 /* Look for base class combinations that cannot be satisfied. */
4658 else if (found != TM_ATTR_PURE && (found & TM_ATTR_PURE))
4660 found &= ~TM_ATTR_PURE;
4662 error_at (DECL_SOURCE_LOCATION (fndecl),
4663 "method overrides both %<transaction_pure%> and %qE methods",
4664 tm_mask_to_attr (found));
4666 /* If FNDECL did not declare an attribute, then inherit the most
4668 else if (tm_attr == NULL)
4670 apply_tm_attr (fndecl, tm_mask_to_attr (found & -found));
4672 /* Otherwise validate that we're not weaker than a function
4673 that is being overridden. */
4677 if (found <= TM_ATTR_CALLABLE && have > found)
4683 error_at (DECL_SOURCE_LOCATION (fndecl),
4684 "method declared %qE overriding %qE method",
4685 tm_attr, tm_mask_to_attr (found));
4688 /* For each of the methods in T, propagate a class-level tm attribute. */
4691 set_method_tm_attributes (tree t)
4693 tree class_tm_attr, fndecl;
4695 /* Don't bother collecting tm attributes if transactional memory
4696 support is not enabled. */
4700 /* Process virtual methods first, as they inherit directly from the
4701 base virtual function and also require validation of new attributes. */
4702 if (TYPE_CONTAINS_VPTR_P (t))
4705 for (vchain = BINFO_VIRTUALS (TYPE_BINFO (t)); vchain;
4706 vchain = TREE_CHAIN (vchain))
4708 fndecl = BV_FN (vchain);
4709 if (DECL_THUNK_P (fndecl))
4710 fndecl = THUNK_TARGET (fndecl);
4711 set_one_vmethod_tm_attributes (t, fndecl);
4715 /* If the class doesn't have an attribute, nothing more to do. */
4716 class_tm_attr = find_tm_attribute (TYPE_ATTRIBUTES (t));
4717 if (class_tm_attr == NULL)
4720 /* Any method that does not yet have a tm attribute inherits
4721 the one from the class. */
4722 for (fndecl = TYPE_METHODS (t); fndecl; fndecl = TREE_CHAIN (fndecl))
4724 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl))))
4725 apply_tm_attr (fndecl, class_tm_attr);
4729 /* Returns true iff class T has a user-defined constructor other than
4730 the default constructor. */
4733 type_has_user_nondefault_constructor (tree t)
4737 if (!TYPE_HAS_USER_CONSTRUCTOR (t))
4740 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4742 tree fn = OVL_CURRENT (fns);
4743 if (!DECL_ARTIFICIAL (fn)
4744 && (TREE_CODE (fn) == TEMPLATE_DECL
4745 || (skip_artificial_parms_for (fn, DECL_ARGUMENTS (fn))
4753 /* Returns the defaulted constructor if T has one. Otherwise, returns
4757 in_class_defaulted_default_constructor (tree t)
4761 if (!TYPE_HAS_USER_CONSTRUCTOR (t))
4764 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4766 tree fn = OVL_CURRENT (fns);
4768 if (DECL_DEFAULTED_IN_CLASS_P (fn))
4770 args = FUNCTION_FIRST_USER_PARMTYPE (fn);
4771 while (args && TREE_PURPOSE (args))
4772 args = TREE_CHAIN (args);
4773 if (!args || args == void_list_node)
4781 /* Returns true iff FN is a user-provided function, i.e. user-declared
4782 and not defaulted at its first declaration; or explicit, private,
4783 protected, or non-const. */
4786 user_provided_p (tree fn)
4788 if (TREE_CODE (fn) == TEMPLATE_DECL)
4791 return (!DECL_ARTIFICIAL (fn)
4792 && !DECL_DEFAULTED_IN_CLASS_P (fn));
4795 /* Returns true iff class T has a user-provided constructor. */
4798 type_has_user_provided_constructor (tree t)
4802 if (!CLASS_TYPE_P (t))
4805 if (!TYPE_HAS_USER_CONSTRUCTOR (t))
4808 /* This can happen in error cases; avoid crashing. */
4809 if (!CLASSTYPE_METHOD_VEC (t))
4812 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4813 if (user_provided_p (OVL_CURRENT (fns)))
4819 /* Returns true iff class T has a user-provided default constructor. */
4822 type_has_user_provided_default_constructor (tree t)
4826 if (!TYPE_HAS_USER_CONSTRUCTOR (t))
4829 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4831 tree fn = OVL_CURRENT (fns);
4832 if (TREE_CODE (fn) == FUNCTION_DECL
4833 && user_provided_p (fn)
4834 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn)))
4841 /* TYPE is being used as a virtual base, and has a non-trivial move
4842 assignment. Return true if this is due to there being a user-provided
4843 move assignment in TYPE or one of its subobjects; if there isn't, then
4844 multiple move assignment can't cause any harm. */
4847 vbase_has_user_provided_move_assign (tree type)
4849 /* Does the type itself have a user-provided move assignment operator? */
4851 = lookup_fnfields_slot_nolazy (type, ansi_assopname (NOP_EXPR));
4852 fns; fns = OVL_NEXT (fns))
4854 tree fn = OVL_CURRENT (fns);
4855 if (move_fn_p (fn) && user_provided_p (fn))
4859 /* Do any of its bases? */
4860 tree binfo = TYPE_BINFO (type);
4862 for (int i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
4863 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo)))
4866 /* Or non-static data members? */
4867 for (tree field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
4869 if (TREE_CODE (field) == FIELD_DECL
4870 && CLASS_TYPE_P (TREE_TYPE (field))
4871 && vbase_has_user_provided_move_assign (TREE_TYPE (field)))
4879 /* If default-initialization leaves part of TYPE uninitialized, returns
4880 a DECL for the field or TYPE itself (DR 253). */
4883 default_init_uninitialized_part (tree type)
4888 type = strip_array_types (type);
4889 if (!CLASS_TYPE_P (type))
4891 if (type_has_user_provided_default_constructor (type))
4893 for (binfo = TYPE_BINFO (type), i = 0;
4894 BINFO_BASE_ITERATE (binfo, i, t); ++i)
4896 r = default_init_uninitialized_part (BINFO_TYPE (t));
4900 for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t))
4901 if (TREE_CODE (t) == FIELD_DECL
4902 && !DECL_ARTIFICIAL (t)
4903 && !DECL_INITIAL (t))
4905 r = default_init_uninitialized_part (TREE_TYPE (t));
4907 return DECL_P (r) ? r : t;
4913 /* Returns true iff for class T, a trivial synthesized default constructor
4914 would be constexpr. */
4917 trivial_default_constructor_is_constexpr (tree t)
4919 /* A defaulted trivial default constructor is constexpr
4920 if there is nothing to initialize. */
4921 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t));
4922 return is_really_empty_class (t);
4925 /* Returns true iff class T has a constexpr default constructor. */
4928 type_has_constexpr_default_constructor (tree t)
4932 if (!CLASS_TYPE_P (t))
4934 /* The caller should have stripped an enclosing array. */
4935 gcc_assert (TREE_CODE (t) != ARRAY_TYPE);
4938 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t))
4940 if (!TYPE_HAS_COMPLEX_DFLT (t))
4941 return trivial_default_constructor_is_constexpr (t);
4942 /* Non-trivial, we need to check subobject constructors. */
4943 lazily_declare_fn (sfk_constructor, t);
4945 fns = locate_ctor (t);
4946 return (fns && DECL_DECLARED_CONSTEXPR_P (fns));
4949 /* Returns true iff class TYPE has a virtual destructor. */
4952 type_has_virtual_destructor (tree type)
4956 if (!CLASS_TYPE_P (type))
4959 gcc_assert (COMPLETE_TYPE_P (type));
4960 dtor = CLASSTYPE_DESTRUCTORS (type);
4961 return (dtor && DECL_VIRTUAL_P (dtor));
4964 /* Returns true iff class T has a move constructor. */
4967 type_has_move_constructor (tree t)
4971 if (CLASSTYPE_LAZY_MOVE_CTOR (t))
4973 gcc_assert (COMPLETE_TYPE_P (t));
4974 lazily_declare_fn (sfk_move_constructor, t);
4977 if (!CLASSTYPE_METHOD_VEC (t))
4980 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
4981 if (move_fn_p (OVL_CURRENT (fns)))
4987 /* Returns true iff class T has a move assignment operator. */
4990 type_has_move_assign (tree t)
4994 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t))
4996 gcc_assert (COMPLETE_TYPE_P (t));
4997 lazily_declare_fn (sfk_move_assignment, t);
5000 for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR));
5001 fns; fns = OVL_NEXT (fns))
5002 if (move_fn_p (OVL_CURRENT (fns)))
5008 /* Returns true iff class T has a move constructor that was explicitly
5009 declared in the class body. Note that this is different from
5010 "user-provided", which doesn't include functions that are defaulted in
5014 type_has_user_declared_move_constructor (tree t)
5018 if (CLASSTYPE_LAZY_MOVE_CTOR (t))
5021 if (!CLASSTYPE_METHOD_VEC (t))
5024 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
5026 tree fn = OVL_CURRENT (fns);
5027 if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn))
5034 /* Returns true iff class T has a move assignment operator that was
5035 explicitly declared in the class body. */
5038 type_has_user_declared_move_assign (tree t)
5042 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t))
5045 for (fns = lookup_fnfields_slot_nolazy (t, ansi_assopname (NOP_EXPR));
5046 fns; fns = OVL_NEXT (fns))
5048 tree fn = OVL_CURRENT (fns);
5049 if (move_fn_p (fn) && !DECL_ARTIFICIAL (fn))
5056 /* Nonzero if we need to build up a constructor call when initializing an
5057 object of this class, either because it has a user-provided constructor
5058 or because it doesn't have a default constructor (so we need to give an
5059 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5060 what you care about is whether or not an object can be produced by a
5061 constructor (e.g. so we don't set TREE_READONLY on const variables of
5062 such type); use this function when what you care about is whether or not
5063 to try to call a constructor to create an object. The latter case is
5064 the former plus some cases of constructors that cannot be called. */
5067 type_build_ctor_call (tree t)
5070 if (TYPE_NEEDS_CONSTRUCTING (t))
5072 inner = strip_array_types (t);
5073 return (CLASS_TYPE_P (inner) && !TYPE_HAS_DEFAULT_CONSTRUCTOR (inner)
5074 && !ANON_AGGR_TYPE_P (inner));
5077 /* Remove all zero-width bit-fields from T. */
5080 remove_zero_width_bit_fields (tree t)
5084 fieldsp = &TYPE_FIELDS (t);
5087 if (TREE_CODE (*fieldsp) == FIELD_DECL
5088 && DECL_C_BIT_FIELD (*fieldsp)
5089 /* We should not be confused by the fact that grokbitfield
5090 temporarily sets the width of the bit field into
5091 DECL_INITIAL (*fieldsp).
5092 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5094 && integer_zerop (DECL_SIZE (*fieldsp)))
5095 *fieldsp = DECL_CHAIN (*fieldsp);
5097 fieldsp = &DECL_CHAIN (*fieldsp);
5101 /* Returns TRUE iff we need a cookie when dynamically allocating an
5102 array whose elements have the indicated class TYPE. */
5105 type_requires_array_cookie (tree type)
5108 bool has_two_argument_delete_p = false;
5110 gcc_assert (CLASS_TYPE_P (type));
5112 /* If there's a non-trivial destructor, we need a cookie. In order
5113 to iterate through the array calling the destructor for each
5114 element, we'll have to know how many elements there are. */
5115 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
5118 /* If the usual deallocation function is a two-argument whose second
5119 argument is of type `size_t', then we have to pass the size of
5120 the array to the deallocation function, so we will need to store
5122 fns = lookup_fnfields (TYPE_BINFO (type),
5123 ansi_opname (VEC_DELETE_EXPR),
5125 /* If there are no `operator []' members, or the lookup is
5126 ambiguous, then we don't need a cookie. */
5127 if (!fns || fns == error_mark_node)
5129 /* Loop through all of the functions. */
5130 for (fns = BASELINK_FUNCTIONS (fns); fns; fns = OVL_NEXT (fns))
5135 /* Select the current function. */
5136 fn = OVL_CURRENT (fns);
5137 /* See if this function is a one-argument delete function. If
5138 it is, then it will be the usual deallocation function. */
5139 second_parm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
5140 if (second_parm == void_list_node)
5142 /* Do not consider this function if its second argument is an
5146 /* Otherwise, if we have a two-argument function and the second
5147 argument is `size_t', it will be the usual deallocation
5148 function -- unless there is one-argument function, too. */
5149 if (TREE_CHAIN (second_parm) == void_list_node
5150 && same_type_p (TREE_VALUE (second_parm), size_type_node))
5151 has_two_argument_delete_p = true;
5154 return has_two_argument_delete_p;
5157 /* Finish computing the `literal type' property of class type T.
5159 At this point, we have already processed base classes and
5160 non-static data members. We need to check whether the copy
5161 constructor is trivial, the destructor is trivial, and there
5162 is a trivial default constructor or at least one constexpr
5163 constructor other than the copy constructor. */
5166 finalize_literal_type_property (tree t)
5170 if (cxx_dialect < cxx0x
5171 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
5172 CLASSTYPE_LITERAL_P (t) = false;
5173 else if (CLASSTYPE_LITERAL_P (t) && !TYPE_HAS_TRIVIAL_DFLT (t)
5174 && CLASSTYPE_NON_AGGREGATE (t)
5175 && !TYPE_HAS_CONSTEXPR_CTOR (t))
5176 CLASSTYPE_LITERAL_P (t) = false;
5178 if (!CLASSTYPE_LITERAL_P (t))
5179 for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn))
5180 if (DECL_DECLARED_CONSTEXPR_P (fn)
5181 && TREE_CODE (fn) != TEMPLATE_DECL
5182 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
5183 && !DECL_CONSTRUCTOR_P (fn))
5185 DECL_DECLARED_CONSTEXPR_P (fn) = false;
5186 if (!DECL_GENERATED_P (fn))
5188 error ("enclosing class of constexpr non-static member "
5189 "function %q+#D is not a literal type", fn);
5190 explain_non_literal_class (t);
5195 /* T is a non-literal type used in a context which requires a constant
5196 expression. Explain why it isn't literal. */
5199 explain_non_literal_class (tree t)
5201 static struct pointer_set_t *diagnosed;
5203 if (!CLASS_TYPE_P (t))
5205 t = TYPE_MAIN_VARIANT (t);
5207 if (diagnosed == NULL)
5208 diagnosed = pointer_set_create ();
5209 if (pointer_set_insert (diagnosed, t) != 0)
5210 /* Already explained. */
5213 inform (0, "%q+T is not literal because:", t);
5214 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t))
5215 inform (0, " %q+T has a non-trivial destructor", t);
5216 else if (CLASSTYPE_NON_AGGREGATE (t)
5217 && !TYPE_HAS_TRIVIAL_DFLT (t)
5218 && !TYPE_HAS_CONSTEXPR_CTOR (t))
5220 inform (0, " %q+T is not an aggregate, does not have a trivial "
5221 "default constructor, and has no constexpr constructor that "
5222 "is not a copy or move constructor", t);
5223 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t)
5224 && !type_has_user_provided_default_constructor (t))
5226 /* Note that we can't simply call locate_ctor because when the
5227 constructor is deleted it just returns NULL_TREE. */
5229 for (fns = CLASSTYPE_CONSTRUCTORS (t); fns; fns = OVL_NEXT (fns))
5231 tree fn = OVL_CURRENT (fns);
5232 tree parms = TYPE_ARG_TYPES (TREE_TYPE (fn));
5234 parms = skip_artificial_parms_for (fn, parms);
5236 if (sufficient_parms_p (parms))
5238 if (DECL_DELETED_FN (fn))
5239 maybe_explain_implicit_delete (fn);
5241 explain_invalid_constexpr_fn (fn);
5249 tree binfo, base_binfo, field; int i;
5250 for (binfo = TYPE_BINFO (t), i = 0;
5251 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
5253 tree basetype = TREE_TYPE (base_binfo);
5254 if (!CLASSTYPE_LITERAL_P (basetype))
5256 inform (0, " base class %qT of %q+T is non-literal",
5258 explain_non_literal_class (basetype);
5262 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
5265 if (TREE_CODE (field) != FIELD_DECL)
5267 ftype = TREE_TYPE (field);
5268 if (!literal_type_p (ftype))
5270 inform (0, " non-static data member %q+D has "
5271 "non-literal type", field);
5272 if (CLASS_TYPE_P (ftype))
5273 explain_non_literal_class (ftype);
5279 /* Check the validity of the bases and members declared in T. Add any
5280 implicitly-generated functions (like copy-constructors and
5281 assignment operators). Compute various flag bits (like
5282 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5283 level: i.e., independently of the ABI in use. */
5286 check_bases_and_members (tree t)
5288 /* Nonzero if the implicitly generated copy constructor should take
5289 a non-const reference argument. */
5290 int cant_have_const_ctor;
5291 /* Nonzero if the implicitly generated assignment operator
5292 should take a non-const reference argument. */
5293 int no_const_asn_ref;
5295 bool saved_complex_asn_ref;
5296 bool saved_nontrivial_dtor;
5299 /* By default, we use const reference arguments and generate default
5301 cant_have_const_ctor = 0;
5302 no_const_asn_ref = 0;
5304 /* Check all the base-classes. */
5305 check_bases (t, &cant_have_const_ctor,
5308 /* Deduce noexcept on destructors. This needs to happen after we've set
5309 triviality flags appropriately for our bases. */
5310 if (cxx_dialect >= cxx0x)
5311 deduce_noexcept_on_destructors (t);
5313 /* Check all the method declarations. */
5316 /* Save the initial values of these flags which only indicate whether
5317 or not the class has user-provided functions. As we analyze the
5318 bases and members we can set these flags for other reasons. */
5319 saved_complex_asn_ref = TYPE_HAS_COMPLEX_COPY_ASSIGN (t);
5320 saved_nontrivial_dtor = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t);
5322 /* Check all the data member declarations. We cannot call
5323 check_field_decls until we have called check_bases check_methods,
5324 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5325 being set appropriately. */
5326 check_field_decls (t, &access_decls,
5327 &cant_have_const_ctor,
5330 /* A nearly-empty class has to be vptr-containing; a nearly empty
5331 class contains just a vptr. */
5332 if (!TYPE_CONTAINS_VPTR_P (t))
5333 CLASSTYPE_NEARLY_EMPTY_P (t) = 0;
5335 /* Do some bookkeeping that will guide the generation of implicitly
5336 declared member functions. */
5337 TYPE_HAS_COMPLEX_COPY_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t);
5338 TYPE_HAS_COMPLEX_MOVE_CTOR (t) |= TYPE_CONTAINS_VPTR_P (t);
5339 /* We need to call a constructor for this class if it has a
5340 user-provided constructor, or if the default constructor is going
5341 to initialize the vptr. (This is not an if-and-only-if;
5342 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5343 themselves need constructing.) */
5344 TYPE_NEEDS_CONSTRUCTING (t)
5345 |= (type_has_user_provided_constructor (t) || TYPE_CONTAINS_VPTR_P (t));
5348 An aggregate is an array or a class with no user-provided
5349 constructors ... and no virtual functions.
5351 Again, other conditions for being an aggregate are checked
5353 CLASSTYPE_NON_AGGREGATE (t)
5354 |= (type_has_user_provided_constructor (t) || TYPE_POLYMORPHIC_P (t));
5355 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5356 retain the old definition internally for ABI reasons. */
5357 CLASSTYPE_NON_LAYOUT_POD_P (t)
5358 |= (CLASSTYPE_NON_AGGREGATE (t)
5359 || saved_nontrivial_dtor || saved_complex_asn_ref);
5360 CLASSTYPE_NON_STD_LAYOUT (t) |= TYPE_CONTAINS_VPTR_P (t);
5361 TYPE_HAS_COMPLEX_COPY_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t);
5362 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t) |= TYPE_CONTAINS_VPTR_P (t);
5363 TYPE_HAS_COMPLEX_DFLT (t) |= TYPE_CONTAINS_VPTR_P (t);
5365 /* If the class has no user-declared constructor, but does have
5366 non-static const or reference data members that can never be
5367 initialized, issue a warning. */
5368 if (warn_uninitialized
5369 /* Classes with user-declared constructors are presumed to
5370 initialize these members. */
5371 && !TYPE_HAS_USER_CONSTRUCTOR (t)
5372 /* Aggregates can be initialized with brace-enclosed
5374 && CLASSTYPE_NON_AGGREGATE (t))
5378 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
5382 if (TREE_CODE (field) != FIELD_DECL
5383 || DECL_INITIAL (field) != NULL_TREE)
5386 type = TREE_TYPE (field);
5387 if (TREE_CODE (type) == REFERENCE_TYPE)
5388 warning (OPT_Wuninitialized, "non-static reference %q+#D "
5389 "in class without a constructor", field);
5390 else if (CP_TYPE_CONST_P (type)
5391 && (!CLASS_TYPE_P (type)
5392 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type)))
5393 warning (OPT_Wuninitialized, "non-static const member %q+#D "
5394 "in class without a constructor", field);
5398 /* Synthesize any needed methods. */
5399 add_implicitly_declared_members (t, &access_decls,
5400 cant_have_const_ctor,
5403 /* Check defaulted declarations here so we have cant_have_const_ctor
5404 and don't need to worry about clones. */
5405 for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn))
5406 if (!DECL_ARTIFICIAL (fn) && DECL_DEFAULTED_IN_CLASS_P (fn))
5408 int copy = copy_fn_p (fn);
5412 = (DECL_CONSTRUCTOR_P (fn) ? !cant_have_const_ctor
5413 : !no_const_asn_ref);
5414 bool fn_const_p = (copy == 2);
5416 if (fn_const_p && !imp_const_p)
5417 /* If the function is defaulted outside the class, we just
5418 give the synthesis error. */
5419 error ("%q+D declared to take const reference, but implicit "
5420 "declaration would take non-const", fn);
5422 defaulted_late_check (fn);
5425 if (LAMBDA_TYPE_P (t))
5427 /* "The closure type associated with a lambda-expression has a deleted
5428 default constructor and a deleted copy assignment operator." */
5429 TYPE_NEEDS_CONSTRUCTING (t) = 1;
5430 TYPE_HAS_COMPLEX_DFLT (t) = 1;
5431 TYPE_HAS_COMPLEX_COPY_ASSIGN (t) = 1;
5432 CLASSTYPE_LAZY_MOVE_ASSIGN (t) = 0;
5434 /* "This class type is not an aggregate." */
5435 CLASSTYPE_NON_AGGREGATE (t) = 1;
5438 /* Compute the 'literal type' property before we
5439 do anything with non-static member functions. */
5440 finalize_literal_type_property (t);
5442 /* Create the in-charge and not-in-charge variants of constructors
5444 clone_constructors_and_destructors (t);
5446 /* Process the using-declarations. */
5447 for (; access_decls; access_decls = TREE_CHAIN (access_decls))
5448 handle_using_decl (TREE_VALUE (access_decls), t);
5450 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5451 finish_struct_methods (t);
5453 /* Figure out whether or not we will need a cookie when dynamically
5454 allocating an array of this type. */
5455 TYPE_LANG_SPECIFIC (t)->u.c.vec_new_uses_cookie
5456 = type_requires_array_cookie (t);
5459 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5460 accordingly. If a new vfield was created (because T doesn't have a
5461 primary base class), then the newly created field is returned. It
5462 is not added to the TYPE_FIELDS list; it is the caller's
5463 responsibility to do that. Accumulate declared virtual functions
5467 create_vtable_ptr (tree t, tree* virtuals_p)
5471 /* Collect the virtual functions declared in T. */
5472 for (fn = TYPE_METHODS (t); fn; fn = DECL_CHAIN (fn))
5473 if (DECL_VINDEX (fn) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn)
5474 && TREE_CODE (DECL_VINDEX (fn)) != INTEGER_CST)
5476 tree new_virtual = make_node (TREE_LIST);
5478 BV_FN (new_virtual) = fn;
5479 BV_DELTA (new_virtual) = integer_zero_node;
5480 BV_VCALL_INDEX (new_virtual) = NULL_TREE;
5482 TREE_CHAIN (new_virtual) = *virtuals_p;
5483 *virtuals_p = new_virtual;
5486 /* If we couldn't find an appropriate base class, create a new field
5487 here. Even if there weren't any new virtual functions, we might need a
5488 new virtual function table if we're supposed to include vptrs in
5489 all classes that need them. */
5490 if (!TYPE_VFIELD (t) && (*virtuals_p || TYPE_CONTAINS_VPTR_P (t)))
5492 /* We build this decl with vtbl_ptr_type_node, which is a
5493 `vtable_entry_type*'. It might seem more precise to use
5494 `vtable_entry_type (*)[N]' where N is the number of virtual
5495 functions. However, that would require the vtable pointer in
5496 base classes to have a different type than the vtable pointer
5497 in derived classes. We could make that happen, but that
5498 still wouldn't solve all the problems. In particular, the
5499 type-based alias analysis code would decide that assignments
5500 to the base class vtable pointer can't alias assignments to
5501 the derived class vtable pointer, since they have different
5502 types. Thus, in a derived class destructor, where the base
5503 class constructor was inlined, we could generate bad code for
5504 setting up the vtable pointer.
5506 Therefore, we use one type for all vtable pointers. We still
5507 use a type-correct type; it's just doesn't indicate the array
5508 bounds. That's better than using `void*' or some such; it's
5509 cleaner, and it let's the alias analysis code know that these
5510 stores cannot alias stores to void*! */
5513 field = build_decl (input_location,
5514 FIELD_DECL, get_vfield_name (t), vtbl_ptr_type_node);
5515 DECL_VIRTUAL_P (field) = 1;
5516 DECL_ARTIFICIAL (field) = 1;
5517 DECL_FIELD_CONTEXT (field) = t;
5518 DECL_FCONTEXT (field) = t;
5519 if (TYPE_PACKED (t))
5520 DECL_PACKED (field) = 1;
5522 TYPE_VFIELD (t) = field;
5524 /* This class is non-empty. */
5525 CLASSTYPE_EMPTY_P (t) = 0;
5533 /* Add OFFSET to all base types of BINFO which is a base in the
5534 hierarchy dominated by T.
5536 OFFSET, which is a type offset, is number of bytes. */
5539 propagate_binfo_offsets (tree binfo, tree offset)
5545 /* Update BINFO's offset. */
5546 BINFO_OFFSET (binfo)
5547 = convert (sizetype,
5548 size_binop (PLUS_EXPR,
5549 convert (ssizetype, BINFO_OFFSET (binfo)),
5552 /* Find the primary base class. */
5553 primary_binfo = get_primary_binfo (binfo);
5555 if (primary_binfo && BINFO_INHERITANCE_CHAIN (primary_binfo) == binfo)
5556 propagate_binfo_offsets (primary_binfo, offset);
5558 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5560 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
5562 /* Don't do the primary base twice. */
5563 if (base_binfo == primary_binfo)
5566 if (BINFO_VIRTUAL_P (base_binfo))
5569 propagate_binfo_offsets (base_binfo, offset);
5573 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5574 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5575 empty subobjects of T. */
5578 layout_virtual_bases (record_layout_info rli, splay_tree offsets)
5582 bool first_vbase = true;
5585 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t)) == 0)
5588 if (!abi_version_at_least(2))
5590 /* In G++ 3.2, we incorrectly rounded the size before laying out
5591 the virtual bases. */
5592 finish_record_layout (rli, /*free_p=*/false);
5593 #ifdef STRUCTURE_SIZE_BOUNDARY
5594 /* Packed structures don't need to have minimum size. */
5595 if (! TYPE_PACKED (t))
5596 TYPE_ALIGN (t) = MAX (TYPE_ALIGN (t), (unsigned) STRUCTURE_SIZE_BOUNDARY);
5598 rli->offset = TYPE_SIZE_UNIT (t);
5599 rli->bitpos = bitsize_zero_node;
5600 rli->record_align = TYPE_ALIGN (t);
5603 /* Find the last field. The artificial fields created for virtual
5604 bases will go after the last extant field to date. */
5605 next_field = &TYPE_FIELDS (t);
5607 next_field = &DECL_CHAIN (*next_field);
5609 /* Go through the virtual bases, allocating space for each virtual
5610 base that is not already a primary base class. These are
5611 allocated in inheritance graph order. */
5612 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
5614 if (!BINFO_VIRTUAL_P (vbase))
5617 if (!BINFO_PRIMARY_P (vbase))
5619 tree basetype = TREE_TYPE (vbase);
5621 /* This virtual base is not a primary base of any class in the
5622 hierarchy, so we have to add space for it. */
5623 next_field = build_base_field (rli, vbase,
5624 offsets, next_field);
5626 /* If the first virtual base might have been placed at a
5627 lower address, had we started from CLASSTYPE_SIZE, rather
5628 than TYPE_SIZE, issue a warning. There can be both false
5629 positives and false negatives from this warning in rare
5630 cases; to deal with all the possibilities would probably
5631 require performing both layout algorithms and comparing
5632 the results which is not particularly tractable. */
5636 (size_binop (CEIL_DIV_EXPR,
5637 round_up_loc (input_location,
5639 CLASSTYPE_ALIGN (basetype)),
5641 BINFO_OFFSET (vbase))))
5643 "offset of virtual base %qT is not ABI-compliant and "
5644 "may change in a future version of GCC",
5647 first_vbase = false;
5652 /* Returns the offset of the byte just past the end of the base class
5656 end_of_base (tree binfo)
5660 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo)))
5661 size = TYPE_SIZE_UNIT (char_type_node);
5662 else if (is_empty_class (BINFO_TYPE (binfo)))
5663 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5664 allocate some space for it. It cannot have virtual bases, so
5665 TYPE_SIZE_UNIT is fine. */
5666 size = TYPE_SIZE_UNIT (BINFO_TYPE (binfo));
5668 size = CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo));
5670 return size_binop (PLUS_EXPR, BINFO_OFFSET (binfo), size);
5673 /* Returns the offset of the byte just past the end of the base class
5674 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5675 only non-virtual bases are included. */
5678 end_of_class (tree t, int include_virtuals_p)
5680 tree result = size_zero_node;
5681 vec<tree, va_gc> *vbases;
5687 for (binfo = TYPE_BINFO (t), i = 0;
5688 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
5690 if (!include_virtuals_p
5691 && BINFO_VIRTUAL_P (base_binfo)
5692 && (!BINFO_PRIMARY_P (base_binfo)
5693 || BINFO_INHERITANCE_CHAIN (base_binfo) != TYPE_BINFO (t)))
5696 offset = end_of_base (base_binfo);
5697 if (INT_CST_LT_UNSIGNED (result, offset))
5701 /* G++ 3.2 did not check indirect virtual bases. */
5702 if (abi_version_at_least (2) && include_virtuals_p)
5703 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
5704 vec_safe_iterate (vbases, i, &base_binfo); i++)
5706 offset = end_of_base (base_binfo);
5707 if (INT_CST_LT_UNSIGNED (result, offset))
5714 /* Warn about bases of T that are inaccessible because they are
5715 ambiguous. For example:
5718 struct T : public S {};
5719 struct U : public S, public T {};
5721 Here, `(S*) new U' is not allowed because there are two `S'
5725 warn_about_ambiguous_bases (tree t)
5728 vec<tree, va_gc> *vbases;
5733 /* If there are no repeated bases, nothing can be ambiguous. */
5734 if (!CLASSTYPE_REPEATED_BASE_P (t))
5737 /* Check direct bases. */
5738 for (binfo = TYPE_BINFO (t), i = 0;
5739 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
5741 basetype = BINFO_TYPE (base_binfo);
5743 if (!uniquely_derived_from_p (basetype, t))
5744 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5748 /* Check for ambiguous virtual bases. */
5750 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0;
5751 vec_safe_iterate (vbases, i, &binfo); i++)
5753 basetype = BINFO_TYPE (binfo);
5755 if (!uniquely_derived_from_p (basetype, t))
5756 warning (OPT_Wextra, "virtual base %qT inaccessible in %qT due "
5757 "to ambiguity", basetype, t);
5761 /* Compare two INTEGER_CSTs K1 and K2. */
5764 splay_tree_compare_integer_csts (splay_tree_key k1, splay_tree_key k2)
5766 return tree_int_cst_compare ((tree) k1, (tree) k2);
5769 /* Increase the size indicated in RLI to account for empty classes
5770 that are "off the end" of the class. */
5773 include_empty_classes (record_layout_info rli)
5778 /* It might be the case that we grew the class to allocate a
5779 zero-sized base class. That won't be reflected in RLI, yet,
5780 because we are willing to overlay multiple bases at the same
5781 offset. However, now we need to make sure that RLI is big enough
5782 to reflect the entire class. */
5783 eoc = end_of_class (rli->t,
5784 CLASSTYPE_AS_BASE (rli->t) != NULL_TREE);
5785 rli_size = rli_size_unit_so_far (rli);
5786 if (TREE_CODE (rli_size) == INTEGER_CST
5787 && INT_CST_LT_UNSIGNED (rli_size, eoc))
5789 if (!abi_version_at_least (2))
5790 /* In version 1 of the ABI, the size of a class that ends with
5791 a bitfield was not rounded up to a whole multiple of a
5792 byte. Because rli_size_unit_so_far returns only the number
5793 of fully allocated bytes, any extra bits were not included
5795 rli->bitpos = round_down (rli->bitpos, BITS_PER_UNIT);
5797 /* The size should have been rounded to a whole byte. */
5798 gcc_assert (tree_int_cst_equal
5799 (rli->bitpos, round_down (rli->bitpos, BITS_PER_UNIT)));
5801 = size_binop (PLUS_EXPR,
5803 size_binop (MULT_EXPR,
5804 convert (bitsizetype,
5805 size_binop (MINUS_EXPR,
5807 bitsize_int (BITS_PER_UNIT)));
5808 normalize_rli (rli);
5812 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5813 BINFO_OFFSETs for all of the base-classes. Position the vtable
5814 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5817 layout_class_type (tree t, tree *virtuals_p)
5819 tree non_static_data_members;
5822 record_layout_info rli;
5823 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5824 types that appear at that offset. */
5825 splay_tree empty_base_offsets;
5826 /* True if the last field layed out was a bit-field. */
5827 bool last_field_was_bitfield = false;
5828 /* The location at which the next field should be inserted. */
5830 /* T, as a base class. */
5833 /* Keep track of the first non-static data member. */
5834 non_static_data_members = TYPE_FIELDS (t);
5836 /* Start laying out the record. */
5837 rli = start_record_layout (t);
5839 /* Mark all the primary bases in the hierarchy. */
5840 determine_primary_bases (t);
5842 /* Create a pointer to our virtual function table. */
5843 vptr = create_vtable_ptr (t, virtuals_p);
5845 /* The vptr is always the first thing in the class. */
5848 DECL_CHAIN (vptr) = TYPE_FIELDS (t);
5849 TYPE_FIELDS (t) = vptr;
5850 next_field = &DECL_CHAIN (vptr);
5851 place_field (rli, vptr);
5854 next_field = &TYPE_FIELDS (t);
5856 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5857 empty_base_offsets = splay_tree_new (splay_tree_compare_integer_csts,
5859 build_base_fields (rli, empty_base_offsets, next_field);
5861 /* Layout the non-static data members. */
5862 for (field = non_static_data_members; field; field = DECL_CHAIN (field))
5867 /* We still pass things that aren't non-static data members to
5868 the back end, in case it wants to do something with them. */
5869 if (TREE_CODE (field) != FIELD_DECL)
5871 place_field (rli, field);
5872 /* If the static data member has incomplete type, keep track
5873 of it so that it can be completed later. (The handling
5874 of pending statics in finish_record_layout is
5875 insufficient; consider:
5878 struct S2 { static S1 s1; };
5880 At this point, finish_record_layout will be called, but
5881 S1 is still incomplete.) */
5882 if (TREE_CODE (field) == VAR_DECL)
5884 maybe_register_incomplete_var (field);
5885 /* The visibility of static data members is determined
5886 at their point of declaration, not their point of
5888 determine_visibility (field);
5893 type = TREE_TYPE (field);
5894 if (type == error_mark_node)
5897 padding = NULL_TREE;
5899 /* If this field is a bit-field whose width is greater than its
5900 type, then there are some special rules for allocating
5902 if (DECL_C_BIT_FIELD (field)
5903 && INT_CST_LT (TYPE_SIZE (type), DECL_SIZE (field)))
5907 bool was_unnamed_p = false;
5908 /* We must allocate the bits as if suitably aligned for the
5909 longest integer type that fits in this many bits. type
5910 of the field. Then, we are supposed to use the left over
5911 bits as additional padding. */
5912 for (itk = itk_char; itk != itk_none; ++itk)
5913 if (integer_types[itk] != NULL_TREE
5914 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE),
5915 TYPE_SIZE (integer_types[itk]))
5916 || INT_CST_LT (DECL_SIZE (field),
5917 TYPE_SIZE (integer_types[itk]))))
5920 /* ITK now indicates a type that is too large for the
5921 field. We have to back up by one to find the largest
5926 integer_type = integer_types[itk];
5927 } while (itk > 0 && integer_type == NULL_TREE);
5929 /* Figure out how much additional padding is required. GCC
5930 3.2 always created a padding field, even if it had zero
5932 if (!abi_version_at_least (2)
5933 || INT_CST_LT (TYPE_SIZE (integer_type), DECL_SIZE (field)))
5935 if (abi_version_at_least (2) && TREE_CODE (t) == UNION_TYPE)
5936 /* In a union, the padding field must have the full width
5937 of the bit-field; all fields start at offset zero. */
5938 padding = DECL_SIZE (field);
5941 if (TREE_CODE (t) == UNION_TYPE)
5942 warning (OPT_Wabi, "size assigned to %qT may not be "
5943 "ABI-compliant and may change in a future "
5946 padding = size_binop (MINUS_EXPR, DECL_SIZE (field),
5947 TYPE_SIZE (integer_type));
5950 #ifdef PCC_BITFIELD_TYPE_MATTERS
5951 /* An unnamed bitfield does not normally affect the
5952 alignment of the containing class on a target where
5953 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
5954 make any exceptions for unnamed bitfields when the
5955 bitfields are longer than their types. Therefore, we
5956 temporarily give the field a name. */
5957 if (PCC_BITFIELD_TYPE_MATTERS && !DECL_NAME (field))
5959 was_unnamed_p = true;
5960 DECL_NAME (field) = make_anon_name ();
5963 DECL_SIZE (field) = TYPE_SIZE (integer_type);
5964 DECL_ALIGN (field) = TYPE_ALIGN (integer_type);
5965 DECL_USER_ALIGN (field) = TYPE_USER_ALIGN (integer_type);
5966 layout_nonempty_base_or_field (rli, field, NULL_TREE,
5967 empty_base_offsets);
5969 DECL_NAME (field) = NULL_TREE;
5970 /* Now that layout has been performed, set the size of the
5971 field to the size of its declared type; the rest of the
5972 field is effectively invisible. */
5973 DECL_SIZE (field) = TYPE_SIZE (type);
5974 /* We must also reset the DECL_MODE of the field. */
5975 if (abi_version_at_least (2))
5976 DECL_MODE (field) = TYPE_MODE (type);
5978 && DECL_MODE (field) != TYPE_MODE (type))
5979 /* Versions of G++ before G++ 3.4 did not reset the
5982 "the offset of %qD may not be ABI-compliant and may "
5983 "change in a future version of GCC", field);
5986 layout_nonempty_base_or_field (rli, field, NULL_TREE,
5987 empty_base_offsets);
5989 /* Remember the location of any empty classes in FIELD. */
5990 if (abi_version_at_least (2))
5991 record_subobject_offsets (TREE_TYPE (field),
5992 byte_position(field),
5994 /*is_data_member=*/true);
5996 /* If a bit-field does not immediately follow another bit-field,
5997 and yet it starts in the middle of a byte, we have failed to
5998 comply with the ABI. */
6000 && DECL_C_BIT_FIELD (field)
6001 /* The TREE_NO_WARNING flag gets set by Objective-C when
6002 laying out an Objective-C class. The ObjC ABI differs
6003 from the C++ ABI, and so we do not want a warning
6005 && !TREE_NO_WARNING (field)
6006 && !last_field_was_bitfield
6007 && !integer_zerop (size_binop (TRUNC_MOD_EXPR,
6008 DECL_FIELD_BIT_OFFSET (field),
6009 bitsize_unit_node)))
6010 warning (OPT_Wabi, "offset of %q+D is not ABI-compliant and may "
6011 "change in a future version of GCC", field);
6013 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6014 offset of the field. */
6016 && !abi_version_at_least (2)
6017 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field),
6018 byte_position (field))
6019 && contains_empty_class_p (TREE_TYPE (field)))
6020 warning (OPT_Wabi, "%q+D contains empty classes which may cause base "
6021 "classes to be placed at different locations in a "
6022 "future version of GCC", field);
6024 /* The middle end uses the type of expressions to determine the
6025 possible range of expression values. In order to optimize
6026 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6027 must be made aware of the width of "i", via its type.
6029 Because C++ does not have integer types of arbitrary width,
6030 we must (for the purposes of the front end) convert from the
6031 type assigned here to the declared type of the bitfield
6032 whenever a bitfield expression is used as an rvalue.
6033 Similarly, when assigning a value to a bitfield, the value
6034 must be converted to the type given the bitfield here. */
6035 if (DECL_C_BIT_FIELD (field))
6037 unsigned HOST_WIDE_INT width;
6038 tree ftype = TREE_TYPE (field);
6039 width = tree_low_cst (DECL_SIZE (field), /*unsignedp=*/1);
6040 if (width != TYPE_PRECISION (ftype))
6043 = c_build_bitfield_integer_type (width,
6044 TYPE_UNSIGNED (ftype));
6046 = cp_build_qualified_type (TREE_TYPE (field),
6047 cp_type_quals (ftype));
6051 /* If we needed additional padding after this field, add it
6057 padding_field = build_decl (input_location,
6061 DECL_BIT_FIELD (padding_field) = 1;
6062 DECL_SIZE (padding_field) = padding;
6063 DECL_CONTEXT (padding_field) = t;
6064 DECL_ARTIFICIAL (padding_field) = 1;
6065 DECL_IGNORED_P (padding_field) = 1;
6066 layout_nonempty_base_or_field (rli, padding_field,
6068 empty_base_offsets);
6071 last_field_was_bitfield = DECL_C_BIT_FIELD (field);
6074 if (abi_version_at_least (2) && !integer_zerop (rli->bitpos))
6076 /* Make sure that we are on a byte boundary so that the size of
6077 the class without virtual bases will always be a round number
6079 rli->bitpos = round_up_loc (input_location, rli->bitpos, BITS_PER_UNIT);
6080 normalize_rli (rli);
6083 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6085 if (!abi_version_at_least (2))
6086 include_empty_classes(rli);
6088 /* Delete all zero-width bit-fields from the list of fields. Now
6089 that the type is laid out they are no longer important. */
6090 remove_zero_width_bit_fields (t);
6092 /* Create the version of T used for virtual bases. We do not use
6093 make_class_type for this version; this is an artificial type. For
6094 a POD type, we just reuse T. */
6095 if (CLASSTYPE_NON_LAYOUT_POD_P (t) || CLASSTYPE_EMPTY_P (t))
6097 base_t = make_node (TREE_CODE (t));
6099 /* Set the size and alignment for the new type. In G++ 3.2, all
6100 empty classes were considered to have size zero when used as
6102 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t))
6104 TYPE_SIZE (base_t) = bitsize_zero_node;
6105 TYPE_SIZE_UNIT (base_t) = size_zero_node;
6106 if (warn_abi && !integer_zerop (rli_size_unit_so_far (rli)))
6108 "layout of classes derived from empty class %qT "
6109 "may change in a future version of GCC",
6116 /* If the ABI version is not at least two, and the last
6117 field was a bit-field, RLI may not be on a byte
6118 boundary. In particular, rli_size_unit_so_far might
6119 indicate the last complete byte, while rli_size_so_far
6120 indicates the total number of bits used. Therefore,
6121 rli_size_so_far, rather than rli_size_unit_so_far, is
6122 used to compute TYPE_SIZE_UNIT. */
6123 eoc = end_of_class (t, /*include_virtuals_p=*/0);
6124 TYPE_SIZE_UNIT (base_t)
6125 = size_binop (MAX_EXPR,
6127 size_binop (CEIL_DIV_EXPR,
6128 rli_size_so_far (rli),
6129 bitsize_int (BITS_PER_UNIT))),
6132 = size_binop (MAX_EXPR,
6133 rli_size_so_far (rli),
6134 size_binop (MULT_EXPR,
6135 convert (bitsizetype, eoc),
6136 bitsize_int (BITS_PER_UNIT)));
6138 TYPE_ALIGN (base_t) = rli->record_align;
6139 TYPE_USER_ALIGN (base_t) = TYPE_USER_ALIGN (t);
6141 /* Copy the fields from T. */
6142 next_field = &TYPE_FIELDS (base_t);
6143 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
6144 if (TREE_CODE (field) == FIELD_DECL)
6146 *next_field = build_decl (input_location,
6150 DECL_CONTEXT (*next_field) = base_t;
6151 DECL_FIELD_OFFSET (*next_field) = DECL_FIELD_OFFSET (field);
6152 DECL_FIELD_BIT_OFFSET (*next_field)
6153 = DECL_FIELD_BIT_OFFSET (field);
6154 DECL_SIZE (*next_field) = DECL_SIZE (field);
6155 DECL_MODE (*next_field) = DECL_MODE (field);
6156 next_field = &DECL_CHAIN (*next_field);
6159 /* Record the base version of the type. */
6160 CLASSTYPE_AS_BASE (t) = base_t;
6161 TYPE_CONTEXT (base_t) = t;
6164 CLASSTYPE_AS_BASE (t) = t;
6166 /* Every empty class contains an empty class. */
6167 if (CLASSTYPE_EMPTY_P (t))
6168 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 1;
6170 /* Set the TYPE_DECL for this type to contain the right
6171 value for DECL_OFFSET, so that we can use it as part
6172 of a COMPONENT_REF for multiple inheritance. */
6173 layout_decl (TYPE_MAIN_DECL (t), 0);
6175 /* Now fix up any virtual base class types that we left lying
6176 around. We must get these done before we try to lay out the
6177 virtual function table. As a side-effect, this will remove the
6178 base subobject fields. */
6179 layout_virtual_bases (rli, empty_base_offsets);
6181 /* Make sure that empty classes are reflected in RLI at this
6183 include_empty_classes(rli);
6185 /* Make sure not to create any structures with zero size. */
6186 if (integer_zerop (rli_size_unit_so_far (rli)) && CLASSTYPE_EMPTY_P (t))
6188 build_decl (input_location,
6189 FIELD_DECL, NULL_TREE, char_type_node));
6191 /* If this is a non-POD, declaring it packed makes a difference to how it
6192 can be used as a field; don't let finalize_record_size undo it. */
6193 if (TYPE_PACKED (t) && !layout_pod_type_p (t))
6194 rli->packed_maybe_necessary = true;
6196 /* Let the back end lay out the type. */
6197 finish_record_layout (rli, /*free_p=*/true);
6199 /* Warn about bases that can't be talked about due to ambiguity. */
6200 warn_about_ambiguous_bases (t);
6202 /* Now that we're done with layout, give the base fields the real types. */
6203 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
6204 if (DECL_ARTIFICIAL (field) && IS_FAKE_BASE_TYPE (TREE_TYPE (field)))
6205 TREE_TYPE (field) = TYPE_CONTEXT (TREE_TYPE (field));
6208 splay_tree_delete (empty_base_offsets);
6210 if (CLASSTYPE_EMPTY_P (t)
6211 && tree_int_cst_lt (sizeof_biggest_empty_class,
6212 TYPE_SIZE_UNIT (t)))
6213 sizeof_biggest_empty_class = TYPE_SIZE_UNIT (t);
6216 /* Determine the "key method" for the class type indicated by TYPE,
6217 and set CLASSTYPE_KEY_METHOD accordingly. */
6220 determine_key_method (tree type)
6224 if (TYPE_FOR_JAVA (type)
6225 || processing_template_decl
6226 || CLASSTYPE_TEMPLATE_INSTANTIATION (type)
6227 || CLASSTYPE_INTERFACE_KNOWN (type))
6230 /* The key method is the first non-pure virtual function that is not
6231 inline at the point of class definition. On some targets the
6232 key function may not be inline; those targets should not call
6233 this function until the end of the translation unit. */
6234 for (method = TYPE_METHODS (type); method != NULL_TREE;
6235 method = DECL_CHAIN (method))
6236 if (DECL_VINDEX (method) != NULL_TREE
6237 && ! DECL_DECLARED_INLINE_P (method)
6238 && ! DECL_PURE_VIRTUAL_P (method))
6240 CLASSTYPE_KEY_METHOD (type) = method;
6248 /* Allocate and return an instance of struct sorted_fields_type with
6251 static struct sorted_fields_type *
6252 sorted_fields_type_new (int n)
6254 struct sorted_fields_type *sft;
6255 sft = ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type)
6256 + n * sizeof (tree));
6263 /* Perform processing required when the definition of T (a class type)
6267 finish_struct_1 (tree t)
6270 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6271 tree virtuals = NULL_TREE;
6273 if (COMPLETE_TYPE_P (t))
6275 gcc_assert (MAYBE_CLASS_TYPE_P (t));
6276 error ("redefinition of %q#T", t);
6281 /* If this type was previously laid out as a forward reference,
6282 make sure we lay it out again. */
6283 TYPE_SIZE (t) = NULL_TREE;
6284 CLASSTYPE_PRIMARY_BINFO (t) = NULL_TREE;
6286 /* Make assumptions about the class; we'll reset the flags if
6288 CLASSTYPE_EMPTY_P (t) = 1;
6289 CLASSTYPE_NEARLY_EMPTY_P (t) = 1;
6290 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t) = 0;
6291 CLASSTYPE_LITERAL_P (t) = true;
6293 /* Do end-of-class semantic processing: checking the validity of the
6294 bases and members and add implicitly generated methods. */
6295 check_bases_and_members (t);
6297 /* Find the key method. */
6298 if (TYPE_CONTAINS_VPTR_P (t))
6300 /* The Itanium C++ ABI permits the key method to be chosen when
6301 the class is defined -- even though the key method so
6302 selected may later turn out to be an inline function. On
6303 some systems (such as ARM Symbian OS) the key method cannot
6304 be determined until the end of the translation unit. On such
6305 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6306 will cause the class to be added to KEYED_CLASSES. Then, in
6307 finish_file we will determine the key method. */
6308 if (targetm.cxx.key_method_may_be_inline ())
6309 determine_key_method (t);
6311 /* If a polymorphic class has no key method, we may emit the vtable
6312 in every translation unit where the class definition appears. */
6313 if (CLASSTYPE_KEY_METHOD (t) == NULL_TREE)
6314 keyed_classes = tree_cons (NULL_TREE, t, keyed_classes);
6317 /* Layout the class itself. */
6318 layout_class_type (t, &virtuals);
6319 if (CLASSTYPE_AS_BASE (t) != t)
6320 /* We use the base type for trivial assignments, and hence it
6322 compute_record_mode (CLASSTYPE_AS_BASE (t));
6324 virtuals = modify_all_vtables (t, nreverse (virtuals));
6326 /* If necessary, create the primary vtable for this class. */
6327 if (virtuals || TYPE_CONTAINS_VPTR_P (t))
6329 /* We must enter these virtuals into the table. */
6330 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
6331 build_primary_vtable (NULL_TREE, t);
6332 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t)))
6333 /* Here we know enough to change the type of our virtual
6334 function table, but we will wait until later this function. */
6335 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t), t);
6337 /* If we're warning about ABI tags, check the types of the new
6338 virtual functions. */
6340 for (tree v = virtuals; v; v = TREE_CHAIN (v))
6341 check_abi_tags (t, TREE_VALUE (v));
6344 if (TYPE_CONTAINS_VPTR_P (t))
6349 if (BINFO_VTABLE (TYPE_BINFO (t)))
6350 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t))));
6351 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t))
6352 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t)) == NULL_TREE);
6354 /* Add entries for virtual functions introduced by this class. */
6355 BINFO_VIRTUALS (TYPE_BINFO (t))
6356 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t)), virtuals);
6358 /* Set DECL_VINDEX for all functions declared in this class. */
6359 for (vindex = 0, fn = BINFO_VIRTUALS (TYPE_BINFO (t));
6361 fn = TREE_CHAIN (fn),
6362 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6363 ? TARGET_VTABLE_USES_DESCRIPTORS : 1))
6365 tree fndecl = BV_FN (fn);
6367 if (DECL_THUNK_P (fndecl))
6368 /* A thunk. We should never be calling this entry directly
6369 from this vtable -- we'd use the entry for the non
6370 thunk base function. */
6371 DECL_VINDEX (fndecl) = NULL_TREE;
6372 else if (TREE_CODE (DECL_VINDEX (fndecl)) != INTEGER_CST)
6373 DECL_VINDEX (fndecl) = build_int_cst (NULL_TREE, vindex);
6377 finish_struct_bits (t);
6378 set_method_tm_attributes (t);
6380 /* Complete the rtl for any static member objects of the type we're
6382 for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x))
6383 if (TREE_CODE (x) == VAR_DECL && TREE_STATIC (x)
6384 && TREE_TYPE (x) != error_mark_node
6385 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x)), t))
6386 DECL_MODE (x) = TYPE_MODE (t);
6388 /* Done with FIELDS...now decide whether to sort these for
6389 faster lookups later.
6391 We use a small number because most searches fail (succeeding
6392 ultimately as the search bores through the inheritance
6393 hierarchy), and we want this failure to occur quickly. */
6395 insert_into_classtype_sorted_fields (TYPE_FIELDS (t), t, 8);
6397 /* Complain if one of the field types requires lower visibility. */
6398 constrain_class_visibility (t);
6400 /* Make the rtl for any new vtables we have created, and unmark
6401 the base types we marked. */
6404 /* Build the VTT for T. */
6407 /* This warning does not make sense for Java classes, since they
6408 cannot have destructors. */
6409 if (!TYPE_FOR_JAVA (t) && warn_nonvdtor && TYPE_POLYMORPHIC_P (t))
6413 dtor = CLASSTYPE_DESTRUCTORS (t);
6414 if (/* An implicitly declared destructor is always public. And,
6415 if it were virtual, we would have created it by now. */
6417 || (!DECL_VINDEX (dtor)
6418 && (/* public non-virtual */
6419 (!TREE_PRIVATE (dtor) && !TREE_PROTECTED (dtor))
6420 || (/* non-public non-virtual with friends */
6421 (TREE_PRIVATE (dtor) || TREE_PROTECTED (dtor))
6422 && (CLASSTYPE_FRIEND_CLASSES (t)
6423 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t)))))))
6424 warning (OPT_Wnon_virtual_dtor,
6425 "%q#T has virtual functions and accessible"
6426 " non-virtual destructor", t);
6431 if (warn_overloaded_virtual)
6434 /* Class layout, assignment of virtual table slots, etc., is now
6435 complete. Give the back end a chance to tweak the visibility of
6436 the class or perform any other required target modifications. */
6437 targetm.cxx.adjust_class_at_definition (t);
6439 maybe_suppress_debug_info (t);
6441 dump_class_hierarchy (t);
6443 /* Finish debugging output for this type. */
6444 rest_of_type_compilation (t, ! LOCAL_CLASS_P (t));
6446 if (TYPE_TRANSPARENT_AGGR (t))
6448 tree field = first_field (t);
6449 if (field == NULL_TREE || error_operand_p (field))
6451 error ("type transparent %q#T does not have any fields", t);
6452 TYPE_TRANSPARENT_AGGR (t) = 0;
6454 else if (DECL_ARTIFICIAL (field))
6456 if (DECL_FIELD_IS_BASE (field))
6457 error ("type transparent class %qT has base classes", t);
6460 gcc_checking_assert (DECL_VIRTUAL_P (field));
6461 error ("type transparent class %qT has virtual functions", t);
6463 TYPE_TRANSPARENT_AGGR (t) = 0;
6465 else if (TYPE_MODE (t) != DECL_MODE (field))
6467 error ("type transparent %q#T cannot be made transparent because "
6468 "the type of the first field has a different ABI from the "
6469 "class overall", t);
6470 TYPE_TRANSPARENT_AGGR (t) = 0;
6475 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6476 equal to THRESHOLD or greater than THRESHOLD. */
6479 insert_into_classtype_sorted_fields (tree fields, tree t, int threshold)
6481 int n_fields = count_fields (fields);
6482 if (n_fields >= threshold)
6484 struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields);
6485 add_fields_to_record_type (fields, field_vec, 0);
6486 qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp);
6487 CLASSTYPE_SORTED_FIELDS (t) = field_vec;
6491 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6494 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype, tree t)
6496 struct sorted_fields_type *sorted_fields = CLASSTYPE_SORTED_FIELDS (t);
6501 = list_length (TYPE_VALUES (enumtype)) + sorted_fields->len;
6502 struct sorted_fields_type *field_vec = sorted_fields_type_new (n_fields);
6504 for (i = 0; i < sorted_fields->len; ++i)
6505 field_vec->elts[i] = sorted_fields->elts[i];
6507 add_enum_fields_to_record_type (enumtype, field_vec,
6508 sorted_fields->len);
6509 qsort (field_vec->elts, n_fields, sizeof (tree), field_decl_cmp);
6510 CLASSTYPE_SORTED_FIELDS (t) = field_vec;
6514 /* When T was built up, the member declarations were added in reverse
6515 order. Rearrange them to declaration order. */
6518 unreverse_member_declarations (tree t)
6524 /* The following lists are all in reverse order. Put them in
6525 declaration order now. */
6526 TYPE_METHODS (t) = nreverse (TYPE_METHODS (t));
6527 CLASSTYPE_DECL_LIST (t) = nreverse (CLASSTYPE_DECL_LIST (t));
6529 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6530 reverse order, so we can't just use nreverse. */
6532 for (x = TYPE_FIELDS (t);
6533 x && TREE_CODE (x) != TYPE_DECL;
6536 next = DECL_CHAIN (x);
6537 DECL_CHAIN (x) = prev;
6542 DECL_CHAIN (TYPE_FIELDS (t)) = x;
6544 TYPE_FIELDS (t) = prev;
6549 finish_struct (tree t, tree attributes)
6551 location_t saved_loc = input_location;
6553 /* Now that we've got all the field declarations, reverse everything
6555 unreverse_member_declarations (t);
6557 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
6559 /* Nadger the current location so that diagnostics point to the start of
6560 the struct, not the end. */
6561 input_location = DECL_SOURCE_LOCATION (TYPE_NAME (t));
6563 if (processing_template_decl)
6567 finish_struct_methods (t);
6568 TYPE_SIZE (t) = bitsize_zero_node;
6569 TYPE_SIZE_UNIT (t) = size_zero_node;
6571 /* We need to emit an error message if this type was used as a parameter
6572 and it is an abstract type, even if it is a template. We construct
6573 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6574 account and we call complete_vars with this type, which will check
6575 the PARM_DECLS. Note that while the type is being defined,
6576 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6577 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6578 CLASSTYPE_PURE_VIRTUALS (t) = NULL;
6579 for (x = TYPE_METHODS (t); x; x = DECL_CHAIN (x))
6580 if (DECL_PURE_VIRTUAL_P (x))
6581 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t), x);
6583 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6584 an enclosing scope is a template class, so that this function be
6585 found by lookup_fnfields_1 when the using declaration is not
6586 instantiated yet. */
6587 for (x = TYPE_FIELDS (t); x; x = DECL_CHAIN (x))
6588 if (TREE_CODE (x) == USING_DECL)
6590 tree fn = strip_using_decl (x);
6591 if (is_overloaded_fn (fn))
6592 for (; fn; fn = OVL_NEXT (fn))
6593 add_method (t, OVL_CURRENT (fn), x);
6596 /* Remember current #pragma pack value. */
6597 TYPE_PRECISION (t) = maximum_field_alignment;
6599 /* Fix up any variants we've already built. */
6600 for (x = TYPE_NEXT_VARIANT (t); x; x = TYPE_NEXT_VARIANT (x))
6602 TYPE_SIZE (x) = TYPE_SIZE (t);
6603 TYPE_SIZE_UNIT (x) = TYPE_SIZE_UNIT (t);
6604 TYPE_FIELDS (x) = TYPE_FIELDS (t);
6605 TYPE_METHODS (x) = TYPE_METHODS (t);
6609 finish_struct_1 (t);
6611 input_location = saved_loc;
6613 TYPE_BEING_DEFINED (t) = 0;
6615 if (current_class_type)
6618 error ("trying to finish struct, but kicked out due to previous parse errors");
6620 if (processing_template_decl && at_function_scope_p ()
6621 /* Lambdas are defined by the LAMBDA_EXPR. */
6622 && !LAMBDA_TYPE_P (t))
6623 add_stmt (build_min (TAG_DEFN, t));
6628 /* Hash table to avoid endless recursion when handling references. */
6629 static hash_table <pointer_hash <tree_node> > fixed_type_or_null_ref_ht;
6631 /* Return the dynamic type of INSTANCE, if known.
6632 Used to determine whether the virtual function table is needed
6635 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6636 of our knowledge of its type. *NONNULL should be initialized
6637 before this function is called. */
6640 fixed_type_or_null (tree instance, int *nonnull, int *cdtorp)
6642 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6644 switch (TREE_CODE (instance))
6647 if (POINTER_TYPE_P (TREE_TYPE (instance)))
6650 return RECUR (TREE_OPERAND (instance, 0));
6653 /* This is a call to a constructor, hence it's never zero. */
6654 if (TREE_HAS_CONSTRUCTOR (instance))
6658 return TREE_TYPE (instance);
6663 /* This is a call to a constructor, hence it's never zero. */
6664 if (TREE_HAS_CONSTRUCTOR (instance))
6668 return TREE_TYPE (instance);
6670 return RECUR (TREE_OPERAND (instance, 0));
6672 case POINTER_PLUS_EXPR:
6675 if (TREE_CODE (TREE_OPERAND (instance, 0)) == ADDR_EXPR)
6676 return RECUR (TREE_OPERAND (instance, 0));
6677 if (TREE_CODE (TREE_OPERAND (instance, 1)) == INTEGER_CST)
6678 /* Propagate nonnull. */
6679 return RECUR (TREE_OPERAND (instance, 0));
6684 return RECUR (TREE_OPERAND (instance, 0));
6687 instance = TREE_OPERAND (instance, 0);
6690 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6691 with a real object -- given &p->f, p can still be null. */
6692 tree t = get_base_address (instance);
6693 /* ??? Probably should check DECL_WEAK here. */
6694 if (t && DECL_P (t))
6697 return RECUR (instance);
6700 /* If this component is really a base class reference, then the field
6701 itself isn't definitive. */
6702 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance, 1)))
6703 return RECUR (TREE_OPERAND (instance, 0));
6704 return RECUR (TREE_OPERAND (instance, 1));
6708 if (TREE_CODE (TREE_TYPE (instance)) == ARRAY_TYPE
6709 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance))))
6713 return TREE_TYPE (TREE_TYPE (instance));
6715 /* fall through... */
6719 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance)))
6723 return TREE_TYPE (instance);
6725 else if (instance == current_class_ptr)
6730 /* if we're in a ctor or dtor, we know our type. If
6731 current_class_ptr is set but we aren't in a function, we're in
6732 an NSDMI (and therefore a constructor). */
6733 if (current_scope () != current_function_decl
6734 || (DECL_LANG_SPECIFIC (current_function_decl)
6735 && (DECL_CONSTRUCTOR_P (current_function_decl)
6736 || DECL_DESTRUCTOR_P (current_function_decl))))
6740 return TREE_TYPE (TREE_TYPE (instance));
6743 else if (TREE_CODE (TREE_TYPE (instance)) == REFERENCE_TYPE)
6745 /* We only need one hash table because it is always left empty. */
6746 if (!fixed_type_or_null_ref_ht.is_created ())
6747 fixed_type_or_null_ref_ht.create (37);
6749 /* Reference variables should be references to objects. */
6753 /* Enter the INSTANCE in a table to prevent recursion; a
6754 variable's initializer may refer to the variable
6756 if (TREE_CODE (instance) == VAR_DECL
6757 && DECL_INITIAL (instance)
6758 && !type_dependent_expression_p_push (DECL_INITIAL (instance))
6759 && !fixed_type_or_null_ref_ht.find (instance))
6764 slot = fixed_type_or_null_ref_ht.find_slot (instance, INSERT);
6766 type = RECUR (DECL_INITIAL (instance));
6767 fixed_type_or_null_ref_ht.remove_elt (instance);
6780 /* Return nonzero if the dynamic type of INSTANCE is known, and
6781 equivalent to the static type. We also handle the case where
6782 INSTANCE is really a pointer. Return negative if this is a
6783 ctor/dtor. There the dynamic type is known, but this might not be
6784 the most derived base of the original object, and hence virtual
6785 bases may not be layed out according to this type.
6787 Used to determine whether the virtual function table is needed
6790 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6791 of our knowledge of its type. *NONNULL should be initialized
6792 before this function is called. */
6795 resolves_to_fixed_type_p (tree instance, int* nonnull)
6797 tree t = TREE_TYPE (instance);
6801 /* processing_template_decl can be false in a template if we're in
6802 fold_non_dependent_expr, but we still want to suppress this check. */
6803 if (in_template_function ())
6805 /* In a template we only care about the type of the result. */
6811 fixed = fixed_type_or_null (instance, nonnull, &cdtorp);
6812 if (fixed == NULL_TREE)
6814 if (POINTER_TYPE_P (t))
6816 if (!same_type_ignoring_top_level_qualifiers_p (t, fixed))
6818 return cdtorp ? -1 : 1;
6823 init_class_processing (void)
6825 current_class_depth = 0;
6826 current_class_stack_size = 10;
6828 = XNEWVEC (struct class_stack_node, current_class_stack_size);
6829 vec_alloc (local_classes, 8);
6830 sizeof_biggest_empty_class = size_zero_node;
6832 ridpointers[(int) RID_PUBLIC] = access_public_node;
6833 ridpointers[(int) RID_PRIVATE] = access_private_node;
6834 ridpointers[(int) RID_PROTECTED] = access_protected_node;
6837 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6840 restore_class_cache (void)
6844 /* We are re-entering the same class we just left, so we don't
6845 have to search the whole inheritance matrix to find all the
6846 decls to bind again. Instead, we install the cached
6847 class_shadowed list and walk through it binding names. */
6848 push_binding_level (previous_class_level);
6849 class_binding_level = previous_class_level;
6850 /* Restore IDENTIFIER_TYPE_VALUE. */
6851 for (type = class_binding_level->type_shadowed;
6853 type = TREE_CHAIN (type))
6854 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type), TREE_TYPE (type));
6857 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6858 appropriate for TYPE.
6860 So that we may avoid calls to lookup_name, we cache the _TYPE
6861 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6863 For multiple inheritance, we perform a two-pass depth-first search
6864 of the type lattice. */
6867 pushclass (tree type)
6869 class_stack_node_t csn;
6871 type = TYPE_MAIN_VARIANT (type);
6873 /* Make sure there is enough room for the new entry on the stack. */
6874 if (current_class_depth + 1 >= current_class_stack_size)
6876 current_class_stack_size *= 2;
6878 = XRESIZEVEC (struct class_stack_node, current_class_stack,
6879 current_class_stack_size);
6882 /* Insert a new entry on the class stack. */
6883 csn = current_class_stack + current_class_depth;
6884 csn->name = current_class_name;
6885 csn->type = current_class_type;
6886 csn->access = current_access_specifier;
6887 csn->names_used = 0;
6889 current_class_depth++;
6891 /* Now set up the new type. */
6892 current_class_name = TYPE_NAME (type);
6893 if (TREE_CODE (current_class_name) == TYPE_DECL)
6894 current_class_name = DECL_NAME (current_class_name);
6895 current_class_type = type;
6897 /* By default, things in classes are private, while things in
6898 structures or unions are public. */
6899 current_access_specifier = (CLASSTYPE_DECLARED_CLASS (type)
6900 ? access_private_node
6901 : access_public_node);
6903 if (previous_class_level
6904 && type != previous_class_level->this_entity
6905 && current_class_depth == 1)
6907 /* Forcibly remove any old class remnants. */
6908 invalidate_class_lookup_cache ();
6911 if (!previous_class_level
6912 || type != previous_class_level->this_entity
6913 || current_class_depth > 1)
6916 restore_class_cache ();
6919 /* When we exit a toplevel class scope, we save its binding level so
6920 that we can restore it quickly. Here, we've entered some other
6921 class, so we must invalidate our cache. */
6924 invalidate_class_lookup_cache (void)
6926 previous_class_level = NULL;
6929 /* Get out of the current class scope. If we were in a class scope
6930 previously, that is the one popped to. */
6937 current_class_depth--;
6938 current_class_name = current_class_stack[current_class_depth].name;
6939 current_class_type = current_class_stack[current_class_depth].type;
6940 current_access_specifier = current_class_stack[current_class_depth].access;
6941 if (current_class_stack[current_class_depth].names_used)
6942 splay_tree_delete (current_class_stack[current_class_depth].names_used);
6945 /* Mark the top of the class stack as hidden. */
6948 push_class_stack (void)
6950 if (current_class_depth)
6951 ++current_class_stack[current_class_depth - 1].hidden;
6954 /* Mark the top of the class stack as un-hidden. */
6957 pop_class_stack (void)
6959 if (current_class_depth)
6960 --current_class_stack[current_class_depth - 1].hidden;
6963 /* Returns 1 if the class type currently being defined is either T or
6964 a nested type of T. */
6967 currently_open_class (tree t)
6971 if (!CLASS_TYPE_P (t))
6974 t = TYPE_MAIN_VARIANT (t);
6976 /* We start looking from 1 because entry 0 is from global scope,
6978 for (i = current_class_depth; i > 0; --i)
6981 if (i == current_class_depth)
6982 c = current_class_type;
6985 if (current_class_stack[i].hidden)
6987 c = current_class_stack[i].type;
6991 if (same_type_p (c, t))
6997 /* If either current_class_type or one of its enclosing classes are derived
6998 from T, return the appropriate type. Used to determine how we found
6999 something via unqualified lookup. */
7002 currently_open_derived_class (tree t)
7006 /* The bases of a dependent type are unknown. */
7007 if (dependent_type_p (t))
7010 if (!current_class_type)
7013 if (DERIVED_FROM_P (t, current_class_type))
7014 return current_class_type;
7016 for (i = current_class_depth - 1; i > 0; --i)
7018 if (current_class_stack[i].hidden)
7020 if (DERIVED_FROM_P (t, current_class_stack[i].type))
7021 return current_class_stack[i].type;
7027 /* Returns the innermost class type which is not a lambda closure type. */
7030 current_nonlambda_class_type (void)
7034 /* We start looking from 1 because entry 0 is from global scope,
7036 for (i = current_class_depth; i > 0; --i)
7039 if (i == current_class_depth)
7040 c = current_class_type;
7043 if (current_class_stack[i].hidden)
7045 c = current_class_stack[i].type;
7049 if (!LAMBDA_TYPE_P (c))
7055 /* When entering a class scope, all enclosing class scopes' names with
7056 static meaning (static variables, static functions, types and
7057 enumerators) have to be visible. This recursive function calls
7058 pushclass for all enclosing class contexts until global or a local
7059 scope is reached. TYPE is the enclosed class. */
7062 push_nested_class (tree type)
7064 /* A namespace might be passed in error cases, like A::B:C. */
7065 if (type == NULL_TREE
7066 || !CLASS_TYPE_P (type))
7069 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type)));
7074 /* Undoes a push_nested_class call. */
7077 pop_nested_class (void)
7079 tree context = DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type));
7082 if (context && CLASS_TYPE_P (context))
7083 pop_nested_class ();
7086 /* Returns the number of extern "LANG" blocks we are nested within. */
7089 current_lang_depth (void)
7091 return vec_safe_length (current_lang_base);
7094 /* Set global variables CURRENT_LANG_NAME to appropriate value
7095 so that behavior of name-mangling machinery is correct. */
7098 push_lang_context (tree name)
7100 vec_safe_push (current_lang_base, current_lang_name);
7102 if (name == lang_name_cplusplus)
7104 current_lang_name = name;
7106 else if (name == lang_name_java)
7108 current_lang_name = name;
7109 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7110 (See record_builtin_java_type in decl.c.) However, that causes
7111 incorrect debug entries if these types are actually used.
7112 So we re-enable debug output after extern "Java". */
7113 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node)) = 0;
7114 DECL_IGNORED_P (TYPE_NAME (java_short_type_node)) = 0;
7115 DECL_IGNORED_P (TYPE_NAME (java_int_type_node)) = 0;
7116 DECL_IGNORED_P (TYPE_NAME (java_long_type_node)) = 0;
7117 DECL_IGNORED_P (TYPE_NAME (java_float_type_node)) = 0;
7118 DECL_IGNORED_P (TYPE_NAME (java_double_type_node)) = 0;
7119 DECL_IGNORED_P (TYPE_NAME (java_char_type_node)) = 0;
7120 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node)) = 0;
7122 else if (name == lang_name_c)
7124 current_lang_name = name;
7127 error ("language string %<\"%E\"%> not recognized", name);
7130 /* Get out of the current language scope. */
7133 pop_lang_context (void)
7135 current_lang_name = current_lang_base->pop ();
7138 /* Type instantiation routines. */
7140 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7141 matches the TARGET_TYPE. If there is no satisfactory match, return
7142 error_mark_node, and issue an error & warning messages under
7143 control of FLAGS. Permit pointers to member function if FLAGS
7144 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7145 a template-id, and EXPLICIT_TARGS are the explicitly provided
7148 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7149 is the base path used to reference those member functions. If
7150 the address is resolved to a member function, access checks will be
7151 performed and errors issued if appropriate. */
7154 resolve_address_of_overloaded_function (tree target_type,
7156 tsubst_flags_t flags,
7158 tree explicit_targs,
7161 /* Here's what the standard says:
7165 If the name is a function template, template argument deduction
7166 is done, and if the argument deduction succeeds, the deduced
7167 arguments are used to generate a single template function, which
7168 is added to the set of overloaded functions considered.
7170 Non-member functions and static member functions match targets of
7171 type "pointer-to-function" or "reference-to-function." Nonstatic
7172 member functions match targets of type "pointer-to-member
7173 function;" the function type of the pointer to member is used to
7174 select the member function from the set of overloaded member
7175 functions. If a nonstatic member function is selected, the
7176 reference to the overloaded function name is required to have the
7177 form of a pointer to member as described in 5.3.1.
7179 If more than one function is selected, any template functions in
7180 the set are eliminated if the set also contains a non-template
7181 function, and any given template function is eliminated if the
7182 set contains a second template function that is more specialized
7183 than the first according to the partial ordering rules 14.5.5.2.
7184 After such eliminations, if any, there shall remain exactly one
7185 selected function. */
7188 /* We store the matches in a TREE_LIST rooted here. The functions
7189 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7190 interoperability with most_specialized_instantiation. */
7191 tree matches = NULL_TREE;
7193 tree target_fn_type;
7195 /* By the time we get here, we should be seeing only real
7196 pointer-to-member types, not the internal POINTER_TYPE to
7197 METHOD_TYPE representation. */
7198 gcc_assert (TREE_CODE (target_type) != POINTER_TYPE
7199 || TREE_CODE (TREE_TYPE (target_type)) != METHOD_TYPE);
7201 gcc_assert (is_overloaded_fn (overload));
7203 /* Check that the TARGET_TYPE is reasonable. */
7204 if (TYPE_PTRFN_P (target_type))
7206 else if (TYPE_PTRMEMFUNC_P (target_type))
7207 /* This is OK, too. */
7209 else if (TREE_CODE (target_type) == FUNCTION_TYPE)
7210 /* This is OK, too. This comes from a conversion to reference
7212 target_type = build_reference_type (target_type);
7215 if (flags & tf_error)
7216 error ("cannot resolve overloaded function %qD based on"
7217 " conversion to type %qT",
7218 DECL_NAME (OVL_FUNCTION (overload)), target_type);
7219 return error_mark_node;
7222 /* Non-member functions and static member functions match targets of type
7223 "pointer-to-function" or "reference-to-function." Nonstatic member
7224 functions match targets of type "pointer-to-member-function;" the
7225 function type of the pointer to member is used to select the member
7226 function from the set of overloaded member functions.
7228 So figure out the FUNCTION_TYPE that we want to match against. */
7229 target_fn_type = static_fn_type (target_type);
7231 /* If we can find a non-template function that matches, we can just
7232 use it. There's no point in generating template instantiations
7233 if we're just going to throw them out anyhow. But, of course, we
7234 can only do this when we don't *need* a template function. */
7239 for (fns = overload; fns; fns = OVL_NEXT (fns))
7241 tree fn = OVL_CURRENT (fns);
7243 if (TREE_CODE (fn) == TEMPLATE_DECL)
7244 /* We're not looking for templates just yet. */
7247 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7249 /* We're looking for a non-static member, and this isn't
7250 one, or vice versa. */
7253 /* Ignore functions which haven't been explicitly
7255 if (DECL_ANTICIPATED (fn))
7258 /* See if there's a match. */
7259 if (same_type_p (target_fn_type, static_fn_type (fn)))
7260 matches = tree_cons (fn, NULL_TREE, matches);
7264 /* Now, if we've already got a match (or matches), there's no need
7265 to proceed to the template functions. But, if we don't have a
7266 match we need to look at them, too. */
7269 tree target_arg_types;
7270 tree target_ret_type;
7273 unsigned int nargs, ia;
7276 target_arg_types = TYPE_ARG_TYPES (target_fn_type);
7277 target_ret_type = TREE_TYPE (target_fn_type);
7279 nargs = list_length (target_arg_types);
7280 args = XALLOCAVEC (tree, nargs);
7281 for (arg = target_arg_types, ia = 0;
7282 arg != NULL_TREE && arg != void_list_node;
7283 arg = TREE_CHAIN (arg), ++ia)
7284 args[ia] = TREE_VALUE (arg);
7287 for (fns = overload; fns; fns = OVL_NEXT (fns))
7289 tree fn = OVL_CURRENT (fns);
7293 if (TREE_CODE (fn) != TEMPLATE_DECL)
7294 /* We're only looking for templates. */
7297 if ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
7299 /* We're not looking for a non-static member, and this is
7300 one, or vice versa. */
7303 /* Try to do argument deduction. */
7304 targs = make_tree_vec (DECL_NTPARMS (fn));
7305 instantiation = fn_type_unification (fn, explicit_targs, targs, args,
7306 nargs, target_ret_type,
7307 DEDUCE_EXACT, LOOKUP_NORMAL,
7309 if (instantiation == error_mark_node)
7310 /* Instantiation failed. */
7313 /* See if there's a match. */
7314 if (same_type_p (target_fn_type, static_fn_type (instantiation)))
7315 matches = tree_cons (instantiation, fn, matches);
7318 /* Now, remove all but the most specialized of the matches. */
7321 tree match = most_specialized_instantiation (matches);
7323 if (match != error_mark_node)
7324 matches = tree_cons (TREE_PURPOSE (match),
7330 /* Now we should have exactly one function in MATCHES. */
7331 if (matches == NULL_TREE)
7333 /* There were *no* matches. */
7334 if (flags & tf_error)
7336 error ("no matches converting function %qD to type %q#T",
7337 DECL_NAME (OVL_CURRENT (overload)),
7340 print_candidates (overload);
7342 return error_mark_node;
7344 else if (TREE_CHAIN (matches))
7346 /* There were too many matches. First check if they're all
7347 the same function. */
7348 tree match = NULL_TREE;
7350 fn = TREE_PURPOSE (matches);
7352 /* For multi-versioned functions, more than one match is just fine and
7353 decls_match will return false as they are different. */
7354 for (match = TREE_CHAIN (matches); match; match = TREE_CHAIN (match))
7355 if (!decls_match (fn, TREE_PURPOSE (match))
7356 && !targetm.target_option.function_versions
7357 (fn, TREE_PURPOSE (match)))
7362 if (flags & tf_error)
7364 error ("converting overloaded function %qD to type %q#T is ambiguous",
7365 DECL_NAME (OVL_FUNCTION (overload)),
7368 /* Since print_candidates expects the functions in the
7369 TREE_VALUE slot, we flip them here. */
7370 for (match = matches; match; match = TREE_CHAIN (match))
7371 TREE_VALUE (match) = TREE_PURPOSE (match);
7373 print_candidates (matches);
7376 return error_mark_node;
7380 /* Good, exactly one match. Now, convert it to the correct type. */
7381 fn = TREE_PURPOSE (matches);
7383 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn)
7384 && !(flags & tf_ptrmem_ok) && !flag_ms_extensions)
7386 static int explained;
7388 if (!(flags & tf_error))
7389 return error_mark_node;
7391 permerror (input_location, "assuming pointer to member %qD", fn);
7394 inform (input_location, "(a pointer to member can only be formed with %<&%E%>)", fn);
7399 /* If a pointer to a function that is multi-versioned is requested, the
7400 pointer to the dispatcher function is returned instead. This works
7401 well because indirectly calling the function will dispatch the right
7402 function version at run-time. */
7403 if (DECL_FUNCTION_VERSIONED (fn))
7405 fn = get_function_version_dispatcher (fn);
7407 return error_mark_node;
7408 /* Mark all the versions corresponding to the dispatcher as used. */
7409 if (!(flags & tf_conv))
7410 mark_versions_used (fn);
7413 /* If we're doing overload resolution purely for the purpose of
7414 determining conversion sequences, we should not consider the
7415 function used. If this conversion sequence is selected, the
7416 function will be marked as used at this point. */
7417 if (!(flags & tf_conv))
7419 /* Make =delete work with SFINAE. */
7420 if (DECL_DELETED_FN (fn) && !(flags & tf_error))
7421 return error_mark_node;
7426 /* We could not check access to member functions when this
7427 expression was originally created since we did not know at that
7428 time to which function the expression referred. */
7429 if (DECL_FUNCTION_MEMBER_P (fn))
7431 gcc_assert (access_path);
7432 perform_or_defer_access_check (access_path, fn, fn, flags);
7435 if (TYPE_PTRFN_P (target_type) || TYPE_PTRMEMFUNC_P (target_type))
7436 return cp_build_addr_expr (fn, flags);
7439 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7440 will mark the function as addressed, but here we must do it
7442 cxx_mark_addressable (fn);
7448 /* This function will instantiate the type of the expression given in
7449 RHS to match the type of LHSTYPE. If errors exist, then return
7450 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7451 we complain on errors. If we are not complaining, never modify rhs,
7452 as overload resolution wants to try many possible instantiations, in
7453 the hope that at least one will work.
7455 For non-recursive calls, LHSTYPE should be a function, pointer to
7456 function, or a pointer to member function. */
7459 instantiate_type (tree lhstype, tree rhs, tsubst_flags_t flags)
7461 tsubst_flags_t flags_in = flags;
7462 tree access_path = NULL_TREE;
7464 flags &= ~tf_ptrmem_ok;
7466 if (lhstype == unknown_type_node)
7468 if (flags & tf_error)
7469 error ("not enough type information");
7470 return error_mark_node;
7473 if (TREE_TYPE (rhs) != NULL_TREE && ! (type_unknown_p (rhs)))
7475 if (same_type_p (lhstype, TREE_TYPE (rhs)))
7477 if (flag_ms_extensions
7478 && TYPE_PTRMEMFUNC_P (lhstype)
7479 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs)))
7480 /* Microsoft allows `A::f' to be resolved to a
7481 pointer-to-member. */
7485 if (flags & tf_error)
7486 error ("cannot convert %qE from type %qT to type %qT",
7487 rhs, TREE_TYPE (rhs), lhstype);
7488 return error_mark_node;
7492 if (BASELINK_P (rhs))
7494 access_path = BASELINK_ACCESS_BINFO (rhs);
7495 rhs = BASELINK_FUNCTIONS (rhs);
7498 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7499 deduce any type information. */
7500 if (TREE_CODE (rhs) == NON_DEPENDENT_EXPR)
7502 if (flags & tf_error)
7503 error ("not enough type information");
7504 return error_mark_node;
7507 /* There only a few kinds of expressions that may have a type
7508 dependent on overload resolution. */
7509 gcc_assert (TREE_CODE (rhs) == ADDR_EXPR
7510 || TREE_CODE (rhs) == COMPONENT_REF
7511 || is_overloaded_fn (rhs)
7512 || (flag_ms_extensions && TREE_CODE (rhs) == FUNCTION_DECL));
7514 /* This should really only be used when attempting to distinguish
7515 what sort of a pointer to function we have. For now, any
7516 arithmetic operation which is not supported on pointers
7517 is rejected as an error. */
7519 switch (TREE_CODE (rhs))
7523 tree member = TREE_OPERAND (rhs, 1);
7525 member = instantiate_type (lhstype, member, flags);
7526 if (member != error_mark_node
7527 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs, 0)))
7528 /* Do not lose object's side effects. */
7529 return build2 (COMPOUND_EXPR, TREE_TYPE (member),
7530 TREE_OPERAND (rhs, 0), member);
7535 rhs = TREE_OPERAND (rhs, 1);
7536 if (BASELINK_P (rhs))
7537 return instantiate_type (lhstype, rhs, flags_in);
7539 /* This can happen if we are forming a pointer-to-member for a
7541 gcc_assert (TREE_CODE (rhs) == TEMPLATE_ID_EXPR);
7545 case TEMPLATE_ID_EXPR:
7547 tree fns = TREE_OPERAND (rhs, 0);
7548 tree args = TREE_OPERAND (rhs, 1);
7551 resolve_address_of_overloaded_function (lhstype, fns, flags_in,
7552 /*template_only=*/true,
7559 resolve_address_of_overloaded_function (lhstype, rhs, flags_in,
7560 /*template_only=*/false,
7561 /*explicit_targs=*/NULL_TREE,
7566 if (PTRMEM_OK_P (rhs))
7567 flags |= tf_ptrmem_ok;
7569 return instantiate_type (lhstype, TREE_OPERAND (rhs, 0), flags);
7573 return error_mark_node;
7578 return error_mark_node;
7581 /* Return the name of the virtual function pointer field
7582 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7583 this may have to look back through base types to find the
7584 ultimate field name. (For single inheritance, these could
7585 all be the same name. Who knows for multiple inheritance). */
7588 get_vfield_name (tree type)
7590 tree binfo, base_binfo;
7593 for (binfo = TYPE_BINFO (type);
7594 BINFO_N_BASE_BINFOS (binfo);
7597 base_binfo = BINFO_BASE_BINFO (binfo, 0);
7599 if (BINFO_VIRTUAL_P (base_binfo)
7600 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo)))
7604 type = BINFO_TYPE (binfo);
7605 buf = (char *) alloca (sizeof (VFIELD_NAME_FORMAT)
7606 + TYPE_NAME_LENGTH (type) + 2);
7607 sprintf (buf, VFIELD_NAME_FORMAT,
7608 IDENTIFIER_POINTER (constructor_name (type)));
7609 return get_identifier (buf);
7613 print_class_statistics (void)
7615 if (! GATHER_STATISTICS)
7618 fprintf (stderr, "convert_harshness = %d\n", n_convert_harshness);
7619 fprintf (stderr, "compute_conversion_costs = %d\n", n_compute_conversion_costs);
7622 fprintf (stderr, "vtables = %d; vtable searches = %d\n",
7623 n_vtables, n_vtable_searches);
7624 fprintf (stderr, "vtable entries = %d; vtable elems = %d\n",
7625 n_vtable_entries, n_vtable_elems);
7629 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7630 according to [class]:
7631 The class-name is also inserted
7632 into the scope of the class itself. For purposes of access checking,
7633 the inserted class name is treated as if it were a public member name. */
7636 build_self_reference (void)
7638 tree name = constructor_name (current_class_type);
7639 tree value = build_lang_decl (TYPE_DECL, name, current_class_type);
7642 DECL_NONLOCAL (value) = 1;
7643 DECL_CONTEXT (value) = current_class_type;
7644 DECL_ARTIFICIAL (value) = 1;
7645 SET_DECL_SELF_REFERENCE_P (value);
7646 set_underlying_type (value);
7648 if (processing_template_decl)
7649 value = push_template_decl (value);
7651 saved_cas = current_access_specifier;
7652 current_access_specifier = access_public_node;
7653 finish_member_declaration (value);
7654 current_access_specifier = saved_cas;
7657 /* Returns 1 if TYPE contains only padding bytes. */
7660 is_empty_class (tree type)
7662 if (type == error_mark_node)
7665 if (! CLASS_TYPE_P (type))
7668 /* In G++ 3.2, whether or not a class was empty was determined by
7669 looking at its size. */
7670 if (abi_version_at_least (2))
7671 return CLASSTYPE_EMPTY_P (type);
7673 return integer_zerop (CLASSTYPE_SIZE (type));
7676 /* Returns true if TYPE contains an empty class. */
7679 contains_empty_class_p (tree type)
7681 if (is_empty_class (type))
7683 if (CLASS_TYPE_P (type))
7690 for (binfo = TYPE_BINFO (type), i = 0;
7691 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7692 if (contains_empty_class_p (BINFO_TYPE (base_binfo)))
7694 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
7695 if (TREE_CODE (field) == FIELD_DECL
7696 && !DECL_ARTIFICIAL (field)
7697 && is_empty_class (TREE_TYPE (field)))
7700 else if (TREE_CODE (type) == ARRAY_TYPE)
7701 return contains_empty_class_p (TREE_TYPE (type));
7705 /* Returns true if TYPE contains no actual data, just various
7706 possible combinations of empty classes and possibly a vptr. */
7709 is_really_empty_class (tree type)
7711 if (CLASS_TYPE_P (type))
7718 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7719 out, but we'd like to be able to check this before then. */
7720 if (COMPLETE_TYPE_P (type) && is_empty_class (type))
7723 for (binfo = TYPE_BINFO (type), i = 0;
7724 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
7725 if (!is_really_empty_class (BINFO_TYPE (base_binfo)))
7727 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field))
7728 if (TREE_CODE (field) == FIELD_DECL
7729 && !DECL_ARTIFICIAL (field)
7730 && !is_really_empty_class (TREE_TYPE (field)))
7734 else if (TREE_CODE (type) == ARRAY_TYPE)
7735 return is_really_empty_class (TREE_TYPE (type));
7739 /* Note that NAME was looked up while the current class was being
7740 defined and that the result of that lookup was DECL. */
7743 maybe_note_name_used_in_class (tree name, tree decl)
7745 splay_tree names_used;
7747 /* If we're not defining a class, there's nothing to do. */
7748 if (!(innermost_scope_kind() == sk_class
7749 && TYPE_BEING_DEFINED (current_class_type)
7750 && !LAMBDA_TYPE_P (current_class_type)))
7753 /* If there's already a binding for this NAME, then we don't have
7754 anything to worry about. */
7755 if (lookup_member (current_class_type, name,
7756 /*protect=*/0, /*want_type=*/false, tf_warning_or_error))
7759 if (!current_class_stack[current_class_depth - 1].names_used)
7760 current_class_stack[current_class_depth - 1].names_used
7761 = splay_tree_new (splay_tree_compare_pointers, 0, 0);
7762 names_used = current_class_stack[current_class_depth - 1].names_used;
7764 splay_tree_insert (names_used,
7765 (splay_tree_key) name,
7766 (splay_tree_value) decl);
7769 /* Note that NAME was declared (as DECL) in the current class. Check
7770 to see that the declaration is valid. */
7773 note_name_declared_in_class (tree name, tree decl)
7775 splay_tree names_used;
7778 /* Look to see if we ever used this name. */
7780 = current_class_stack[current_class_depth - 1].names_used;
7783 /* The C language allows members to be declared with a type of the same
7784 name, and the C++ standard says this diagnostic is not required. So
7785 allow it in extern "C" blocks unless predantic is specified.
7786 Allow it in all cases if -ms-extensions is specified. */
7787 if ((!pedantic && current_lang_name == lang_name_c)
7788 || flag_ms_extensions)
7790 n = splay_tree_lookup (names_used, (splay_tree_key) name);
7793 /* [basic.scope.class]
7795 A name N used in a class S shall refer to the same declaration
7796 in its context and when re-evaluated in the completed scope of
7798 permerror (input_location, "declaration of %q#D", decl);
7799 permerror (input_location, "changes meaning of %qD from %q+#D",
7800 DECL_NAME (OVL_CURRENT (decl)), (tree) n->value);
7804 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7805 Secondary vtables are merged with primary vtables; this function
7806 will return the VAR_DECL for the primary vtable. */
7809 get_vtbl_decl_for_binfo (tree binfo)
7813 decl = BINFO_VTABLE (binfo);
7814 if (decl && TREE_CODE (decl) == POINTER_PLUS_EXPR)
7816 gcc_assert (TREE_CODE (TREE_OPERAND (decl, 0)) == ADDR_EXPR);
7817 decl = TREE_OPERAND (TREE_OPERAND (decl, 0), 0);
7820 gcc_assert (TREE_CODE (decl) == VAR_DECL);
7825 /* Returns the binfo for the primary base of BINFO. If the resulting
7826 BINFO is a virtual base, and it is inherited elsewhere in the
7827 hierarchy, then the returned binfo might not be the primary base of
7828 BINFO in the complete object. Check BINFO_PRIMARY_P or
7829 BINFO_LOST_PRIMARY_P to be sure. */
7832 get_primary_binfo (tree binfo)
7836 primary_base = CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo));
7840 return copied_binfo (primary_base, binfo);
7843 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7846 maybe_indent_hierarchy (FILE * stream, int indent, int indented_p)
7849 fprintf (stream, "%*s", indent, "");
7853 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7854 INDENT should be zero when called from the top level; it is
7855 incremented recursively. IGO indicates the next expected BINFO in
7856 inheritance graph ordering. */
7859 dump_class_hierarchy_r (FILE *stream,
7869 indented = maybe_indent_hierarchy (stream, indent, 0);
7870 fprintf (stream, "%s (0x" HOST_WIDE_INT_PRINT_HEX ") ",
7871 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER),
7872 (HOST_WIDE_INT) (uintptr_t) binfo);
7875 fprintf (stream, "alternative-path\n");
7878 igo = TREE_CHAIN (binfo);
7880 fprintf (stream, HOST_WIDE_INT_PRINT_DEC,
7881 tree_low_cst (BINFO_OFFSET (binfo), 0));
7882 if (is_empty_class (BINFO_TYPE (binfo)))
7883 fprintf (stream, " empty");
7884 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo)))
7885 fprintf (stream, " nearly-empty");
7886 if (BINFO_VIRTUAL_P (binfo))
7887 fprintf (stream, " virtual");
7888 fprintf (stream, "\n");
7891 if (BINFO_PRIMARY_P (binfo))
7893 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
7894 fprintf (stream, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX ")",
7895 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo)),
7896 TFF_PLAIN_IDENTIFIER),
7897 (HOST_WIDE_INT) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo));
7899 if (BINFO_LOST_PRIMARY_P (binfo))
7901 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
7902 fprintf (stream, " lost-primary");
7905 fprintf (stream, "\n");
7907 if (!(flags & TDF_SLIM))
7911 if (BINFO_SUBVTT_INDEX (binfo))
7913 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
7914 fprintf (stream, " subvttidx=%s",
7915 expr_as_string (BINFO_SUBVTT_INDEX (binfo),
7916 TFF_PLAIN_IDENTIFIER));
7918 if (BINFO_VPTR_INDEX (binfo))
7920 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
7921 fprintf (stream, " vptridx=%s",
7922 expr_as_string (BINFO_VPTR_INDEX (binfo),
7923 TFF_PLAIN_IDENTIFIER));
7925 if (BINFO_VPTR_FIELD (binfo))
7927 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
7928 fprintf (stream, " vbaseoffset=%s",
7929 expr_as_string (BINFO_VPTR_FIELD (binfo),
7930 TFF_PLAIN_IDENTIFIER));
7932 if (BINFO_VTABLE (binfo))
7934 indented = maybe_indent_hierarchy (stream, indent + 3, indented);
7935 fprintf (stream, " vptr=%s",
7936 expr_as_string (BINFO_VTABLE (binfo),
7937 TFF_PLAIN_IDENTIFIER));
7941 fprintf (stream, "\n");
7944 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); i++)
7945 igo = dump_class_hierarchy_r (stream, flags, base_binfo, igo, indent + 2);
7950 /* Dump the BINFO hierarchy for T. */
7953 dump_class_hierarchy_1 (FILE *stream, int flags, tree t)
7955 fprintf (stream, "Class %s\n", type_as_string (t, TFF_PLAIN_IDENTIFIER));
7956 fprintf (stream, " size=%lu align=%lu\n",
7957 (unsigned long)(tree_low_cst (TYPE_SIZE (t), 0) / BITS_PER_UNIT),
7958 (unsigned long)(TYPE_ALIGN (t) / BITS_PER_UNIT));
7959 fprintf (stream, " base size=%lu base align=%lu\n",
7960 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t)), 0)
7962 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t))
7964 dump_class_hierarchy_r (stream, flags, TYPE_BINFO (t), TYPE_BINFO (t), 0);
7965 fprintf (stream, "\n");
7968 /* Debug interface to hierarchy dumping. */
7971 debug_class (tree t)
7973 dump_class_hierarchy_1 (stderr, TDF_SLIM, t);
7977 dump_class_hierarchy (tree t)
7980 FILE *stream = dump_begin (TDI_class, &flags);
7984 dump_class_hierarchy_1 (stream, flags, t);
7985 dump_end (TDI_class, stream);
7990 dump_array (FILE * stream, tree decl)
7993 unsigned HOST_WIDE_INT ix;
7995 tree size = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl)));
7997 elt = (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl))), 0)
7999 fprintf (stream, "%s:", decl_as_string (decl, TFF_PLAIN_IDENTIFIER));
8000 fprintf (stream, " %s entries",
8001 expr_as_string (size_binop (PLUS_EXPR, size, size_one_node),
8002 TFF_PLAIN_IDENTIFIER));
8003 fprintf (stream, "\n");
8005 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
8007 fprintf (stream, "%-4ld %s\n", (long)(ix * elt),
8008 expr_as_string (value, TFF_PLAIN_IDENTIFIER));
8012 dump_vtable (tree t, tree binfo, tree vtable)
8015 FILE *stream = dump_begin (TDI_class, &flags);
8020 if (!(flags & TDF_SLIM))
8022 int ctor_vtbl_p = TYPE_BINFO (t) != binfo;
8024 fprintf (stream, "%s for %s",
8025 ctor_vtbl_p ? "Construction vtable" : "Vtable",
8026 type_as_string (BINFO_TYPE (binfo), TFF_PLAIN_IDENTIFIER));
8029 if (!BINFO_VIRTUAL_P (binfo))
8030 fprintf (stream, " (0x" HOST_WIDE_INT_PRINT_HEX " instance)",
8031 (HOST_WIDE_INT) (uintptr_t) binfo);
8032 fprintf (stream, " in %s", type_as_string (t, TFF_PLAIN_IDENTIFIER));
8034 fprintf (stream, "\n");
8035 dump_array (stream, vtable);
8036 fprintf (stream, "\n");
8039 dump_end (TDI_class, stream);
8043 dump_vtt (tree t, tree vtt)
8046 FILE *stream = dump_begin (TDI_class, &flags);
8051 if (!(flags & TDF_SLIM))
8053 fprintf (stream, "VTT for %s\n",
8054 type_as_string (t, TFF_PLAIN_IDENTIFIER));
8055 dump_array (stream, vtt);
8056 fprintf (stream, "\n");
8059 dump_end (TDI_class, stream);
8062 /* Dump a function or thunk and its thunkees. */
8065 dump_thunk (FILE *stream, int indent, tree thunk)
8067 static const char spaces[] = " ";
8068 tree name = DECL_NAME (thunk);
8071 fprintf (stream, "%.*s%p %s %s", indent, spaces,
8073 !DECL_THUNK_P (thunk) ? "function"
8074 : DECL_THIS_THUNK_P (thunk) ? "this-thunk" : "covariant-thunk",
8075 name ? IDENTIFIER_POINTER (name) : "<unset>");
8076 if (DECL_THUNK_P (thunk))
8078 HOST_WIDE_INT fixed_adjust = THUNK_FIXED_OFFSET (thunk);
8079 tree virtual_adjust = THUNK_VIRTUAL_OFFSET (thunk);
8081 fprintf (stream, " fixed=" HOST_WIDE_INT_PRINT_DEC, fixed_adjust);
8082 if (!virtual_adjust)
8084 else if (DECL_THIS_THUNK_P (thunk))
8085 fprintf (stream, " vcall=" HOST_WIDE_INT_PRINT_DEC,
8086 tree_low_cst (virtual_adjust, 0));
8088 fprintf (stream, " vbase=" HOST_WIDE_INT_PRINT_DEC "(%s)",
8089 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust), 0),
8090 type_as_string (BINFO_TYPE (virtual_adjust), TFF_SCOPE));
8091 if (THUNK_ALIAS (thunk))
8092 fprintf (stream, " alias to %p", (void *)THUNK_ALIAS (thunk));
8094 fprintf (stream, "\n");
8095 for (thunks = DECL_THUNKS (thunk); thunks; thunks = TREE_CHAIN (thunks))
8096 dump_thunk (stream, indent + 2, thunks);
8099 /* Dump the thunks for FN. */
8102 debug_thunks (tree fn)
8104 dump_thunk (stderr, 0, fn);
8107 /* Virtual function table initialization. */
8109 /* Create all the necessary vtables for T and its base classes. */
8112 finish_vtbls (tree t)
8115 vec<constructor_elt, va_gc> *v = NULL;
8116 tree vtable = BINFO_VTABLE (TYPE_BINFO (t));
8118 /* We lay out the primary and secondary vtables in one contiguous
8119 vtable. The primary vtable is first, followed by the non-virtual
8120 secondary vtables in inheritance graph order. */
8121 accumulate_vtbl_inits (TYPE_BINFO (t), TYPE_BINFO (t), TYPE_BINFO (t),
8124 /* Then come the virtual bases, also in inheritance graph order. */
8125 for (vbase = TYPE_BINFO (t); vbase; vbase = TREE_CHAIN (vbase))
8127 if (!BINFO_VIRTUAL_P (vbase))
8129 accumulate_vtbl_inits (vbase, vbase, TYPE_BINFO (t), vtable, t, &v);
8132 if (BINFO_VTABLE (TYPE_BINFO (t)))
8133 initialize_vtable (TYPE_BINFO (t), v);
8136 /* Initialize the vtable for BINFO with the INITS. */
8139 initialize_vtable (tree binfo, vec<constructor_elt, va_gc> *inits)
8143 layout_vtable_decl (binfo, vec_safe_length (inits));
8144 decl = get_vtbl_decl_for_binfo (binfo);
8145 initialize_artificial_var (decl, inits);
8146 dump_vtable (BINFO_TYPE (binfo), binfo, decl);
8149 /* Build the VTT (virtual table table) for T.
8150 A class requires a VTT if it has virtual bases.
8153 1 - primary virtual pointer for complete object T
8154 2 - secondary VTTs for each direct non-virtual base of T which requires a
8156 3 - secondary virtual pointers for each direct or indirect base of T which
8157 has virtual bases or is reachable via a virtual path from T.
8158 4 - secondary VTTs for each direct or indirect virtual base of T.
8160 Secondary VTTs look like complete object VTTs without part 4. */
8168 vec<constructor_elt, va_gc> *inits;
8170 /* Build up the initializers for the VTT. */
8172 index = size_zero_node;
8173 build_vtt_inits (TYPE_BINFO (t), t, &inits, &index);
8175 /* If we didn't need a VTT, we're done. */
8179 /* Figure out the type of the VTT. */
8180 type = build_array_of_n_type (const_ptr_type_node,
8183 /* Now, build the VTT object itself. */
8184 vtt = build_vtable (t, mangle_vtt_for_type (t), type);
8185 initialize_artificial_var (vtt, inits);
8186 /* Add the VTT to the vtables list. */
8187 DECL_CHAIN (vtt) = DECL_CHAIN (CLASSTYPE_VTABLES (t));
8188 DECL_CHAIN (CLASSTYPE_VTABLES (t)) = vtt;
8193 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8194 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8195 and CHAIN the vtable pointer for this binfo after construction is
8196 complete. VALUE can also be another BINFO, in which case we recurse. */
8199 binfo_ctor_vtable (tree binfo)
8205 vt = BINFO_VTABLE (binfo);
8206 if (TREE_CODE (vt) == TREE_LIST)
8207 vt = TREE_VALUE (vt);
8208 if (TREE_CODE (vt) == TREE_BINFO)
8217 /* Data for secondary VTT initialization. */
8218 typedef struct secondary_vptr_vtt_init_data_s
8220 /* Is this the primary VTT? */
8223 /* Current index into the VTT. */
8226 /* Vector of initializers built up. */
8227 vec<constructor_elt, va_gc> *inits;
8229 /* The type being constructed by this secondary VTT. */
8230 tree type_being_constructed;
8231 } secondary_vptr_vtt_init_data;
8233 /* Recursively build the VTT-initializer for BINFO (which is in the
8234 hierarchy dominated by T). INITS points to the end of the initializer
8235 list to date. INDEX is the VTT index where the next element will be
8236 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8237 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8238 for virtual bases of T. When it is not so, we build the constructor
8239 vtables for the BINFO-in-T variant. */
8242 build_vtt_inits (tree binfo, tree t, vec<constructor_elt, va_gc> **inits,
8248 secondary_vptr_vtt_init_data data;
8249 int top_level_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
8251 /* We only need VTTs for subobjects with virtual bases. */
8252 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
8255 /* We need to use a construction vtable if this is not the primary
8259 build_ctor_vtbl_group (binfo, t);
8261 /* Record the offset in the VTT where this sub-VTT can be found. */
8262 BINFO_SUBVTT_INDEX (binfo) = *index;
8265 /* Add the address of the primary vtable for the complete object. */
8266 init = binfo_ctor_vtable (binfo);
8267 CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init);
8270 gcc_assert (!BINFO_VPTR_INDEX (binfo));
8271 BINFO_VPTR_INDEX (binfo) = *index;
8273 *index = size_binop (PLUS_EXPR, *index, TYPE_SIZE_UNIT (ptr_type_node));
8275 /* Recursively add the secondary VTTs for non-virtual bases. */
8276 for (i = 0; BINFO_BASE_ITERATE (binfo, i, b); ++i)
8277 if (!BINFO_VIRTUAL_P (b))
8278 build_vtt_inits (b, t, inits, index);
8280 /* Add secondary virtual pointers for all subobjects of BINFO with
8281 either virtual bases or reachable along a virtual path, except
8282 subobjects that are non-virtual primary bases. */
8283 data.top_level_p = top_level_p;
8284 data.index = *index;
8285 data.inits = *inits;
8286 data.type_being_constructed = BINFO_TYPE (binfo);
8288 dfs_walk_once (binfo, dfs_build_secondary_vptr_vtt_inits, NULL, &data);
8290 *index = data.index;
8292 /* data.inits might have grown as we added secondary virtual pointers.
8293 Make sure our caller knows about the new vector. */
8294 *inits = data.inits;
8297 /* Add the secondary VTTs for virtual bases in inheritance graph
8299 for (b = TYPE_BINFO (BINFO_TYPE (binfo)); b; b = TREE_CHAIN (b))
8301 if (!BINFO_VIRTUAL_P (b))
8304 build_vtt_inits (b, t, inits, index);
8307 /* Remove the ctor vtables we created. */
8308 dfs_walk_all (binfo, dfs_fixup_binfo_vtbls, NULL, binfo);
8311 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8312 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8315 dfs_build_secondary_vptr_vtt_inits (tree binfo, void *data_)
8317 secondary_vptr_vtt_init_data *data = (secondary_vptr_vtt_init_data *)data_;
8319 /* We don't care about bases that don't have vtables. */
8320 if (!TYPE_VFIELD (BINFO_TYPE (binfo)))
8321 return dfs_skip_bases;
8323 /* We're only interested in proper subobjects of the type being
8325 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), data->type_being_constructed))
8328 /* We're only interested in bases with virtual bases or reachable
8329 via a virtual path from the type being constructed. */
8330 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
8331 || binfo_via_virtual (binfo, data->type_being_constructed)))
8332 return dfs_skip_bases;
8334 /* We're not interested in non-virtual primary bases. */
8335 if (!BINFO_VIRTUAL_P (binfo) && BINFO_PRIMARY_P (binfo))
8338 /* Record the index where this secondary vptr can be found. */
8339 if (data->top_level_p)
8341 gcc_assert (!BINFO_VPTR_INDEX (binfo));
8342 BINFO_VPTR_INDEX (binfo) = data->index;
8344 if (BINFO_VIRTUAL_P (binfo))
8346 /* It's a primary virtual base, and this is not a
8347 construction vtable. Find the base this is primary of in
8348 the inheritance graph, and use that base's vtable
8350 while (BINFO_PRIMARY_P (binfo))
8351 binfo = BINFO_INHERITANCE_CHAIN (binfo);
8355 /* Add the initializer for the secondary vptr itself. */
8356 CONSTRUCTOR_APPEND_ELT (data->inits, NULL_TREE, binfo_ctor_vtable (binfo));
8358 /* Advance the vtt index. */
8359 data->index = size_binop (PLUS_EXPR, data->index,
8360 TYPE_SIZE_UNIT (ptr_type_node));
8365 /* Called from build_vtt_inits via dfs_walk. After building
8366 constructor vtables and generating the sub-vtt from them, we need
8367 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8368 binfo of the base whose sub vtt was generated. */
8371 dfs_fixup_binfo_vtbls (tree binfo, void* data)
8373 tree vtable = BINFO_VTABLE (binfo);
8375 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
8376 /* If this class has no vtable, none of its bases do. */
8377 return dfs_skip_bases;
8380 /* This might be a primary base, so have no vtable in this
8384 /* If we scribbled the construction vtable vptr into BINFO, clear it
8386 if (TREE_CODE (vtable) == TREE_LIST
8387 && (TREE_PURPOSE (vtable) == (tree) data))
8388 BINFO_VTABLE (binfo) = TREE_CHAIN (vtable);
8393 /* Build the construction vtable group for BINFO which is in the
8394 hierarchy dominated by T. */
8397 build_ctor_vtbl_group (tree binfo, tree t)
8403 vec<constructor_elt, va_gc> *v;
8405 /* See if we've already created this construction vtable group. */
8406 id = mangle_ctor_vtbl_for_type (t, binfo);
8407 if (IDENTIFIER_GLOBAL_VALUE (id))
8410 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t));
8411 /* Build a version of VTBL (with the wrong type) for use in
8412 constructing the addresses of secondary vtables in the
8413 construction vtable group. */
8414 vtbl = build_vtable (t, id, ptr_type_node);
8415 DECL_CONSTRUCTION_VTABLE_P (vtbl) = 1;
8416 /* Don't export construction vtables from shared libraries. Even on
8417 targets that don't support hidden visibility, this tells
8418 can_refer_decl_in_current_unit_p not to assume that it's safe to
8419 access from a different compilation unit (bz 54314). */
8420 DECL_VISIBILITY (vtbl) = VISIBILITY_HIDDEN;
8421 DECL_VISIBILITY_SPECIFIED (vtbl) = true;
8424 accumulate_vtbl_inits (binfo, TYPE_BINFO (TREE_TYPE (binfo)),
8425 binfo, vtbl, t, &v);
8427 /* Add the vtables for each of our virtual bases using the vbase in T
8429 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
8431 vbase = TREE_CHAIN (vbase))
8435 if (!BINFO_VIRTUAL_P (vbase))
8437 b = copied_binfo (vbase, binfo);
8439 accumulate_vtbl_inits (b, vbase, binfo, vtbl, t, &v);
8442 /* Figure out the type of the construction vtable. */
8443 type = build_array_of_n_type (vtable_entry_type, v->length ());
8445 TREE_TYPE (vtbl) = type;
8446 DECL_SIZE (vtbl) = DECL_SIZE_UNIT (vtbl) = NULL_TREE;
8447 layout_decl (vtbl, 0);
8449 /* Initialize the construction vtable. */
8450 CLASSTYPE_VTABLES (t) = chainon (CLASSTYPE_VTABLES (t), vtbl);
8451 initialize_artificial_var (vtbl, v);
8452 dump_vtable (t, binfo, vtbl);
8455 /* Add the vtbl initializers for BINFO (and its bases other than
8456 non-virtual primaries) to the list of INITS. BINFO is in the
8457 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8458 the constructor the vtbl inits should be accumulated for. (If this
8459 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8460 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8461 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8462 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8463 but are not necessarily the same in terms of layout. */
8466 accumulate_vtbl_inits (tree binfo,
8471 vec<constructor_elt, va_gc> **inits)
8475 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
8477 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), BINFO_TYPE (orig_binfo)));
8479 /* If it doesn't have a vptr, we don't do anything. */
8480 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo)))
8483 /* If we're building a construction vtable, we're not interested in
8484 subobjects that don't require construction vtables. */
8486 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo))
8487 && !binfo_via_virtual (orig_binfo, BINFO_TYPE (rtti_binfo)))
8490 /* Build the initializers for the BINFO-in-T vtable. */
8491 dfs_accumulate_vtbl_inits (binfo, orig_binfo, rtti_binfo, vtbl, t, inits);
8493 /* Walk the BINFO and its bases. We walk in preorder so that as we
8494 initialize each vtable we can figure out at what offset the
8495 secondary vtable lies from the primary vtable. We can't use
8496 dfs_walk here because we need to iterate through bases of BINFO
8497 and RTTI_BINFO simultaneously. */
8498 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
8500 /* Skip virtual bases. */
8501 if (BINFO_VIRTUAL_P (base_binfo))
8503 accumulate_vtbl_inits (base_binfo,
8504 BINFO_BASE_BINFO (orig_binfo, i),
8505 rtti_binfo, vtbl, t,
8510 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8511 BINFO vtable to L. */
8514 dfs_accumulate_vtbl_inits (tree binfo,
8519 vec<constructor_elt, va_gc> **l)
8521 tree vtbl = NULL_TREE;
8522 int ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
8526 && BINFO_VIRTUAL_P (orig_binfo) && BINFO_PRIMARY_P (orig_binfo))
8528 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8529 primary virtual base. If it is not the same primary in
8530 the hierarchy of T, we'll need to generate a ctor vtable
8531 for it, to place at its location in T. If it is the same
8532 primary, we still need a VTT entry for the vtable, but it
8533 should point to the ctor vtable for the base it is a
8534 primary for within the sub-hierarchy of RTTI_BINFO.
8536 There are three possible cases:
8538 1) We are in the same place.
8539 2) We are a primary base within a lost primary virtual base of
8541 3) We are primary to something not a base of RTTI_BINFO. */
8544 tree last = NULL_TREE;
8546 /* First, look through the bases we are primary to for RTTI_BINFO
8547 or a virtual base. */
8549 while (BINFO_PRIMARY_P (b))
8551 b = BINFO_INHERITANCE_CHAIN (b);
8553 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
8556 /* If we run out of primary links, keep looking down our
8557 inheritance chain; we might be an indirect primary. */
8558 for (b = last; b; b = BINFO_INHERITANCE_CHAIN (b))
8559 if (BINFO_VIRTUAL_P (b) || b == rtti_binfo)
8563 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8564 base B and it is a base of RTTI_BINFO, this is case 2. In
8565 either case, we share our vtable with LAST, i.e. the
8566 derived-most base within B of which we are a primary. */
8568 || (b && binfo_for_vbase (BINFO_TYPE (b), BINFO_TYPE (rtti_binfo))))
8569 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8570 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8571 binfo_ctor_vtable after everything's been set up. */
8574 /* Otherwise, this is case 3 and we get our own. */
8576 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo))
8579 n_inits = vec_safe_length (*l);
8586 /* Add the initializer for this vtable. */
8587 build_vtbl_initializer (binfo, orig_binfo, t, rtti_binfo,
8588 &non_fn_entries, l);
8590 /* Figure out the position to which the VPTR should point. */
8591 vtbl = build1 (ADDR_EXPR, vtbl_ptr_type_node, orig_vtbl);
8592 index = size_binop (MULT_EXPR,
8593 TYPE_SIZE_UNIT (vtable_entry_type),
8594 size_int (non_fn_entries + n_inits));
8595 vtbl = fold_build_pointer_plus (vtbl, index);
8599 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8600 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8601 straighten this out. */
8602 BINFO_VTABLE (binfo) = tree_cons (rtti_binfo, vtbl, BINFO_VTABLE (binfo));
8603 else if (BINFO_PRIMARY_P (binfo) && BINFO_VIRTUAL_P (binfo))
8604 /* Throw away any unneeded intializers. */
8605 (*l)->truncate (n_inits);
8607 /* For an ordinary vtable, set BINFO_VTABLE. */
8608 BINFO_VTABLE (binfo) = vtbl;
8611 static GTY(()) tree abort_fndecl_addr;
8613 /* Construct the initializer for BINFO's virtual function table. BINFO
8614 is part of the hierarchy dominated by T. If we're building a
8615 construction vtable, the ORIG_BINFO is the binfo we should use to
8616 find the actual function pointers to put in the vtable - but they
8617 can be overridden on the path to most-derived in the graph that
8618 ORIG_BINFO belongs. Otherwise,
8619 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8620 BINFO that should be indicated by the RTTI information in the
8621 vtable; it will be a base class of T, rather than T itself, if we
8622 are building a construction vtable.
8624 The value returned is a TREE_LIST suitable for wrapping in a
8625 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8626 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8627 number of non-function entries in the vtable.
8629 It might seem that this function should never be called with a
8630 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8631 base is always subsumed by a derived class vtable. However, when
8632 we are building construction vtables, we do build vtables for
8633 primary bases; we need these while the primary base is being
8637 build_vtbl_initializer (tree binfo,
8641 int* non_fn_entries_p,
8642 vec<constructor_elt, va_gc> **inits)
8648 vec<tree, va_gc> *vbases;
8651 /* Initialize VID. */
8652 memset (&vid, 0, sizeof (vid));
8655 vid.rtti_binfo = rtti_binfo;
8656 vid.primary_vtbl_p = SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), t);
8657 vid.ctor_vtbl_p = !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo), t);
8658 vid.generate_vcall_entries = true;
8659 /* The first vbase or vcall offset is at index -3 in the vtable. */
8660 vid.index = ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE);
8662 /* Add entries to the vtable for RTTI. */
8663 build_rtti_vtbl_entries (binfo, &vid);
8665 /* Create an array for keeping track of the functions we've
8666 processed. When we see multiple functions with the same
8667 signature, we share the vcall offsets. */
8668 vec_alloc (vid.fns, 32);
8669 /* Add the vcall and vbase offset entries. */
8670 build_vcall_and_vbase_vtbl_entries (binfo, &vid);
8672 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8673 build_vbase_offset_vtbl_entries. */
8674 for (vbases = CLASSTYPE_VBASECLASSES (t), ix = 0;
8675 vec_safe_iterate (vbases, ix, &vbinfo); ix++)
8676 BINFO_VTABLE_PATH_MARKED (vbinfo) = 0;
8678 /* If the target requires padding between data entries, add that now. */
8679 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE > 1)
8681 int n_entries = vec_safe_length (vid.inits);
8683 vec_safe_grow (vid.inits, TARGET_VTABLE_DATA_ENTRY_DISTANCE * n_entries);
8685 /* Move data entries into their new positions and add padding
8686 after the new positions. Iterate backwards so we don't
8687 overwrite entries that we would need to process later. */
8688 for (ix = n_entries - 1;
8689 vid.inits->iterate (ix, &e);
8693 int new_position = (TARGET_VTABLE_DATA_ENTRY_DISTANCE * ix
8694 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE - 1));
8696 (*vid.inits)[new_position] = *e;
8698 for (j = 1; j < TARGET_VTABLE_DATA_ENTRY_DISTANCE; ++j)
8700 constructor_elt *f = &(*vid.inits)[new_position - j];
8701 f->index = NULL_TREE;
8702 f->value = build1 (NOP_EXPR, vtable_entry_type,
8708 if (non_fn_entries_p)
8709 *non_fn_entries_p = vec_safe_length (vid.inits);
8711 /* The initializers for virtual functions were built up in reverse
8712 order. Straighten them out and add them to the running list in one
8714 jx = vec_safe_length (*inits);
8715 vec_safe_grow (*inits, jx + vid.inits->length ());
8717 for (ix = vid.inits->length () - 1;
8718 vid.inits->iterate (ix, &e);
8722 /* Go through all the ordinary virtual functions, building up
8724 for (v = BINFO_VIRTUALS (orig_binfo); v; v = TREE_CHAIN (v))
8728 tree fn, fn_original;
8729 tree init = NULL_TREE;
8733 if (DECL_THUNK_P (fn))
8735 if (!DECL_NAME (fn))
8737 if (THUNK_ALIAS (fn))
8739 fn = THUNK_ALIAS (fn);
8742 fn_original = THUNK_TARGET (fn);
8745 /* If the only definition of this function signature along our
8746 primary base chain is from a lost primary, this vtable slot will
8747 never be used, so just zero it out. This is important to avoid
8748 requiring extra thunks which cannot be generated with the function.
8750 We first check this in update_vtable_entry_for_fn, so we handle
8751 restored primary bases properly; we also need to do it here so we
8752 zero out unused slots in ctor vtables, rather than filling them
8753 with erroneous values (though harmless, apart from relocation
8755 if (BV_LOST_PRIMARY (v))
8756 init = size_zero_node;
8760 /* Pull the offset for `this', and the function to call, out of
8762 delta = BV_DELTA (v);
8763 vcall_index = BV_VCALL_INDEX (v);
8765 gcc_assert (TREE_CODE (delta) == INTEGER_CST);
8766 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
8768 /* You can't call an abstract virtual function; it's abstract.
8769 So, we replace these functions with __pure_virtual. */
8770 if (DECL_PURE_VIRTUAL_P (fn_original))
8773 if (!TARGET_VTABLE_USES_DESCRIPTORS)
8775 if (abort_fndecl_addr == NULL)
8777 = fold_convert (vfunc_ptr_type_node,
8778 build_fold_addr_expr (fn));
8779 init = abort_fndecl_addr;
8782 /* Likewise for deleted virtuals. */
8783 else if (DECL_DELETED_FN (fn_original))
8785 fn = get_identifier ("__cxa_deleted_virtual");
8786 if (!get_global_value_if_present (fn, &fn))
8787 fn = push_library_fn (fn, (build_function_type_list
8788 (void_type_node, NULL_TREE)),
8790 if (!TARGET_VTABLE_USES_DESCRIPTORS)
8791 init = fold_convert (vfunc_ptr_type_node,
8792 build_fold_addr_expr (fn));
8796 if (!integer_zerop (delta) || vcall_index)
8798 fn = make_thunk (fn, /*this_adjusting=*/1, delta, vcall_index);
8799 if (!DECL_NAME (fn))
8802 /* Take the address of the function, considering it to be of an
8803 appropriate generic type. */
8804 if (!TARGET_VTABLE_USES_DESCRIPTORS)
8805 init = fold_convert (vfunc_ptr_type_node,
8806 build_fold_addr_expr (fn));
8810 /* And add it to the chain of initializers. */
8811 if (TARGET_VTABLE_USES_DESCRIPTORS)
8814 if (init == size_zero_node)
8815 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
8816 CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init);
8818 for (i = 0; i < TARGET_VTABLE_USES_DESCRIPTORS; ++i)
8820 tree fdesc = build2 (FDESC_EXPR, vfunc_ptr_type_node,
8821 fn, build_int_cst (NULL_TREE, i));
8822 TREE_CONSTANT (fdesc) = 1;
8824 CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, fdesc);
8828 CONSTRUCTOR_APPEND_ELT (*inits, NULL_TREE, init);
8832 /* Adds to vid->inits the initializers for the vbase and vcall
8833 offsets in BINFO, which is in the hierarchy dominated by T. */
8836 build_vcall_and_vbase_vtbl_entries (tree binfo, vtbl_init_data* vid)
8840 /* If this is a derived class, we must first create entries
8841 corresponding to the primary base class. */
8842 b = get_primary_binfo (binfo);
8844 build_vcall_and_vbase_vtbl_entries (b, vid);
8846 /* Add the vbase entries for this base. */
8847 build_vbase_offset_vtbl_entries (binfo, vid);
8848 /* Add the vcall entries for this base. */
8849 build_vcall_offset_vtbl_entries (binfo, vid);
8852 /* Returns the initializers for the vbase offset entries in the vtable
8853 for BINFO (which is part of the class hierarchy dominated by T), in
8854 reverse order. VBASE_OFFSET_INDEX gives the vtable index
8855 where the next vbase offset will go. */
8858 build_vbase_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
8862 tree non_primary_binfo;
8864 /* If there are no virtual baseclasses, then there is nothing to
8866 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo)))
8871 /* We might be a primary base class. Go up the inheritance hierarchy
8872 until we find the most derived class of which we are a primary base:
8873 it is the offset of that which we need to use. */
8874 non_primary_binfo = binfo;
8875 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
8879 /* If we have reached a virtual base, then it must be a primary
8880 base (possibly multi-level) of vid->binfo, or we wouldn't
8881 have called build_vcall_and_vbase_vtbl_entries for it. But it
8882 might be a lost primary, so just skip down to vid->binfo. */
8883 if (BINFO_VIRTUAL_P (non_primary_binfo))
8885 non_primary_binfo = vid->binfo;
8889 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
8890 if (get_primary_binfo (b) != non_primary_binfo)
8892 non_primary_binfo = b;
8895 /* Go through the virtual bases, adding the offsets. */
8896 for (vbase = TYPE_BINFO (BINFO_TYPE (binfo));
8898 vbase = TREE_CHAIN (vbase))
8903 if (!BINFO_VIRTUAL_P (vbase))
8906 /* Find the instance of this virtual base in the complete
8908 b = copied_binfo (vbase, binfo);
8910 /* If we've already got an offset for this virtual base, we
8911 don't need another one. */
8912 if (BINFO_VTABLE_PATH_MARKED (b))
8914 BINFO_VTABLE_PATH_MARKED (b) = 1;
8916 /* Figure out where we can find this vbase offset. */
8917 delta = size_binop (MULT_EXPR,
8920 TYPE_SIZE_UNIT (vtable_entry_type)));
8921 if (vid->primary_vtbl_p)
8922 BINFO_VPTR_FIELD (b) = delta;
8924 if (binfo != TYPE_BINFO (t))
8925 /* The vbase offset had better be the same. */
8926 gcc_assert (tree_int_cst_equal (delta, BINFO_VPTR_FIELD (vbase)));
8928 /* The next vbase will come at a more negative offset. */
8929 vid->index = size_binop (MINUS_EXPR, vid->index,
8930 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
8932 /* The initializer is the delta from BINFO to this virtual base.
8933 The vbase offsets go in reverse inheritance-graph order, and
8934 we are walking in inheritance graph order so these end up in
8936 delta = size_diffop_loc (input_location,
8937 BINFO_OFFSET (b), BINFO_OFFSET (non_primary_binfo));
8939 CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE,
8940 fold_build1_loc (input_location, NOP_EXPR,
8941 vtable_entry_type, delta));
8945 /* Adds the initializers for the vcall offset entries in the vtable
8946 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
8950 build_vcall_offset_vtbl_entries (tree binfo, vtbl_init_data* vid)
8952 /* We only need these entries if this base is a virtual base. We
8953 compute the indices -- but do not add to the vtable -- when
8954 building the main vtable for a class. */
8955 if (binfo == TYPE_BINFO (vid->derived)
8956 || (BINFO_VIRTUAL_P (binfo)
8957 /* If BINFO is RTTI_BINFO, then (since BINFO does not
8958 correspond to VID->DERIVED), we are building a primary
8959 construction virtual table. Since this is a primary
8960 virtual table, we do not need the vcall offsets for
8962 && binfo != vid->rtti_binfo))
8964 /* We need a vcall offset for each of the virtual functions in this
8965 vtable. For example:
8967 class A { virtual void f (); };
8968 class B1 : virtual public A { virtual void f (); };
8969 class B2 : virtual public A { virtual void f (); };
8970 class C: public B1, public B2 { virtual void f (); };
8972 A C object has a primary base of B1, which has a primary base of A. A
8973 C also has a secondary base of B2, which no longer has a primary base
8974 of A. So the B2-in-C construction vtable needs a secondary vtable for
8975 A, which will adjust the A* to a B2* to call f. We have no way of
8976 knowing what (or even whether) this offset will be when we define B2,
8977 so we store this "vcall offset" in the A sub-vtable and look it up in
8978 a "virtual thunk" for B2::f.
8980 We need entries for all the functions in our primary vtable and
8981 in our non-virtual bases' secondary vtables. */
8983 /* If we are just computing the vcall indices -- but do not need
8984 the actual entries -- not that. */
8985 if (!BINFO_VIRTUAL_P (binfo))
8986 vid->generate_vcall_entries = false;
8987 /* Now, walk through the non-virtual bases, adding vcall offsets. */
8988 add_vcall_offset_vtbl_entries_r (binfo, vid);
8992 /* Build vcall offsets, starting with those for BINFO. */
8995 add_vcall_offset_vtbl_entries_r (tree binfo, vtbl_init_data* vid)
9001 /* Don't walk into virtual bases -- except, of course, for the
9002 virtual base for which we are building vcall offsets. Any
9003 primary virtual base will have already had its offsets generated
9004 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9005 if (BINFO_VIRTUAL_P (binfo) && vid->vbase != binfo)
9008 /* If BINFO has a primary base, process it first. */
9009 primary_binfo = get_primary_binfo (binfo);
9011 add_vcall_offset_vtbl_entries_r (primary_binfo, vid);
9013 /* Add BINFO itself to the list. */
9014 add_vcall_offset_vtbl_entries_1 (binfo, vid);
9016 /* Scan the non-primary bases of BINFO. */
9017 for (i = 0; BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i)
9018 if (base_binfo != primary_binfo)
9019 add_vcall_offset_vtbl_entries_r (base_binfo, vid);
9022 /* Called from build_vcall_offset_vtbl_entries_r. */
9025 add_vcall_offset_vtbl_entries_1 (tree binfo, vtbl_init_data* vid)
9027 /* Make entries for the rest of the virtuals. */
9028 if (abi_version_at_least (2))
9032 /* The ABI requires that the methods be processed in declaration
9033 order. G++ 3.2 used the order in the vtable. */
9034 for (orig_fn = TYPE_METHODS (BINFO_TYPE (binfo));
9036 orig_fn = DECL_CHAIN (orig_fn))
9037 if (DECL_VINDEX (orig_fn))
9038 add_vcall_offset (orig_fn, binfo, vid);
9042 tree derived_virtuals;
9045 /* If BINFO is a primary base, the most derived class which has
9046 BINFO as a primary base; otherwise, just BINFO. */
9047 tree non_primary_binfo;
9049 /* We might be a primary base class. Go up the inheritance hierarchy
9050 until we find the most derived class of which we are a primary base:
9051 it is the BINFO_VIRTUALS there that we need to consider. */
9052 non_primary_binfo = binfo;
9053 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo))
9057 /* If we have reached a virtual base, then it must be vid->vbase,
9058 because we ignore other virtual bases in
9059 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9060 base (possibly multi-level) of vid->binfo, or we wouldn't
9061 have called build_vcall_and_vbase_vtbl_entries for it. But it
9062 might be a lost primary, so just skip down to vid->binfo. */
9063 if (BINFO_VIRTUAL_P (non_primary_binfo))
9065 gcc_assert (non_primary_binfo == vid->vbase);
9066 non_primary_binfo = vid->binfo;
9070 b = BINFO_INHERITANCE_CHAIN (non_primary_binfo);
9071 if (get_primary_binfo (b) != non_primary_binfo)
9073 non_primary_binfo = b;
9076 if (vid->ctor_vtbl_p)
9077 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9078 where rtti_binfo is the most derived type. */
9080 = original_binfo (non_primary_binfo, vid->rtti_binfo);
9082 for (base_virtuals = BINFO_VIRTUALS (binfo),
9083 derived_virtuals = BINFO_VIRTUALS (non_primary_binfo),
9084 orig_virtuals = BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo)));
9086 base_virtuals = TREE_CHAIN (base_virtuals),
9087 derived_virtuals = TREE_CHAIN (derived_virtuals),
9088 orig_virtuals = TREE_CHAIN (orig_virtuals))
9092 /* Find the declaration that originally caused this function to
9093 be present in BINFO_TYPE (binfo). */
9094 orig_fn = BV_FN (orig_virtuals);
9096 /* When processing BINFO, we only want to generate vcall slots for
9097 function slots introduced in BINFO. So don't try to generate
9098 one if the function isn't even defined in BINFO. */
9099 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo), DECL_CONTEXT (orig_fn)))
9102 add_vcall_offset (orig_fn, binfo, vid);
9107 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9110 add_vcall_offset (tree orig_fn, tree binfo, vtbl_init_data *vid)
9116 /* If there is already an entry for a function with the same
9117 signature as FN, then we do not need a second vcall offset.
9118 Check the list of functions already present in the derived
9120 FOR_EACH_VEC_SAFE_ELT (vid->fns, i, derived_entry)
9122 if (same_signature_p (derived_entry, orig_fn)
9123 /* We only use one vcall offset for virtual destructors,
9124 even though there are two virtual table entries. */
9125 || (DECL_DESTRUCTOR_P (derived_entry)
9126 && DECL_DESTRUCTOR_P (orig_fn)))
9130 /* If we are building these vcall offsets as part of building
9131 the vtable for the most derived class, remember the vcall
9133 if (vid->binfo == TYPE_BINFO (vid->derived))
9135 tree_pair_s elt = {orig_fn, vid->index};
9136 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid->derived), elt);
9139 /* The next vcall offset will be found at a more negative
9141 vid->index = size_binop (MINUS_EXPR, vid->index,
9142 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE));
9144 /* Keep track of this function. */
9145 vec_safe_push (vid->fns, orig_fn);
9147 if (vid->generate_vcall_entries)
9152 /* Find the overriding function. */
9153 fn = find_final_overrider (vid->rtti_binfo, binfo, orig_fn);
9154 if (fn == error_mark_node)
9155 vcall_offset = build_zero_cst (vtable_entry_type);
9158 base = TREE_VALUE (fn);
9160 /* The vbase we're working on is a primary base of
9161 vid->binfo. But it might be a lost primary, so its
9162 BINFO_OFFSET might be wrong, so we just use the
9163 BINFO_OFFSET from vid->binfo. */
9164 vcall_offset = size_diffop_loc (input_location,
9165 BINFO_OFFSET (base),
9166 BINFO_OFFSET (vid->binfo));
9167 vcall_offset = fold_build1_loc (input_location,
9168 NOP_EXPR, vtable_entry_type,
9171 /* Add the initializer to the vtable. */
9172 CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, vcall_offset);
9176 /* Return vtbl initializers for the RTTI entries corresponding to the
9177 BINFO's vtable. The RTTI entries should indicate the object given
9178 by VID->rtti_binfo. */
9181 build_rtti_vtbl_entries (tree binfo, vtbl_init_data* vid)
9189 t = BINFO_TYPE (vid->rtti_binfo);
9191 /* To find the complete object, we will first convert to our most
9192 primary base, and then add the offset in the vtbl to that value. */
9194 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b))
9195 && !BINFO_LOST_PRIMARY_P (b))
9199 primary_base = get_primary_binfo (b);
9200 gcc_assert (BINFO_PRIMARY_P (primary_base)
9201 && BINFO_INHERITANCE_CHAIN (primary_base) == b);
9204 offset = size_diffop_loc (input_location,
9205 BINFO_OFFSET (vid->rtti_binfo), BINFO_OFFSET (b));
9207 /* The second entry is the address of the typeinfo object. */
9209 decl = build_address (get_tinfo_decl (t));
9211 decl = integer_zero_node;
9213 /* Convert the declaration to a type that can be stored in the
9215 init = build_nop (vfunc_ptr_type_node, decl);
9216 CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init);
9218 /* Add the offset-to-top entry. It comes earlier in the vtable than
9219 the typeinfo entry. Convert the offset to look like a
9220 function pointer, so that we can put it in the vtable. */
9221 init = build_nop (vfunc_ptr_type_node, offset);
9222 CONSTRUCTOR_APPEND_ELT (vid->inits, NULL_TREE, init);
9225 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9229 uniquely_derived_from_p (tree parent, tree type)
9231 tree base = lookup_base (type, parent, ba_unique, NULL, tf_none);
9232 return base && base != error_mark_node;
9235 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9238 publicly_uniquely_derived_p (tree parent, tree type)
9240 tree base = lookup_base (type, parent, ba_ignore_scope | ba_check,
9242 return base && base != error_mark_node;
9245 #include "gt-cp-class.h"