1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2015 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"
29 #include "stringpool.h"
30 #include "stor-layout.h"
32 #include "hash-table.h"
40 #include "plugin-api.h"
45 #include "hard-reg-set.h"
51 #include "splay-tree.h"
55 /* The number of nested classes being processed. If we are not in the
56 scope of any class, this is zero. */
58 int current_class_depth
;
60 /* In order to deal with nested classes, we keep a stack of classes.
61 The topmost entry is the innermost class, and is the entry at index
62 CURRENT_CLASS_DEPTH */
64 typedef struct class_stack_node
{
65 /* The name of the class. */
68 /* The _TYPE node for the class. */
71 /* The access specifier pending for new declarations in the scope of
75 /* If were defining TYPE, the names used in this class. */
76 splay_tree names_used
;
78 /* Nonzero if this class is no longer open, because of a call to
81 }* class_stack_node_t
;
83 typedef struct vtbl_init_data_s
85 /* The base for which we're building initializers. */
87 /* The type of the most-derived type. */
89 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
90 unless ctor_vtbl_p is true. */
92 /* The negative-index vtable initializers built up so far. These
93 are in order from least negative index to most negative index. */
94 vec
<constructor_elt
, va_gc
> *inits
;
95 /* The binfo for the virtual base for which we're building
96 vcall offset initializers. */
98 /* The functions in vbase for which we have already provided vcall
100 vec
<tree
, va_gc
> *fns
;
101 /* The vtable index of the next vcall or vbase offset. */
103 /* Nonzero if we are building the initializer for the primary
106 /* Nonzero if we are building the initializer for a construction
109 /* True when adding vcall offset entries to the vtable. False when
110 merely computing the indices. */
111 bool generate_vcall_entries
;
114 /* The type of a function passed to walk_subobject_offsets. */
115 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
117 /* The stack itself. This is a dynamically resized array. The
118 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
119 static int current_class_stack_size
;
120 static class_stack_node_t current_class_stack
;
122 /* The size of the largest empty class seen in this translation unit. */
123 static GTY (()) tree sizeof_biggest_empty_class
;
125 /* An array of all local classes present in this translation unit, in
126 declaration order. */
127 vec
<tree
, va_gc
> *local_classes
;
129 static tree
get_vfield_name (tree
);
130 static void finish_struct_anon (tree
);
131 static tree
get_vtable_name (tree
);
132 static void get_basefndecls (tree
, tree
, vec
<tree
> *);
133 static int build_primary_vtable (tree
, tree
);
134 static int build_secondary_vtable (tree
);
135 static void finish_vtbls (tree
);
136 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
137 static void finish_struct_bits (tree
);
138 static int alter_access (tree
, tree
, tree
);
139 static void handle_using_decl (tree
, tree
);
140 static tree
dfs_modify_vtables (tree
, void *);
141 static tree
modify_all_vtables (tree
, tree
);
142 static void determine_primary_bases (tree
);
143 static void finish_struct_methods (tree
);
144 static void maybe_warn_about_overly_private_class (tree
);
145 static int method_name_cmp (const void *, const void *);
146 static int resort_method_name_cmp (const void *, const void *);
147 static void add_implicitly_declared_members (tree
, tree
*, int, int);
148 static tree
fixed_type_or_null (tree
, int *, int *);
149 static tree
build_simple_base_path (tree expr
, tree binfo
);
150 static tree
build_vtbl_ref_1 (tree
, tree
);
151 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
152 vec
<constructor_elt
, va_gc
> **);
153 static int count_fields (tree
);
154 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
155 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
156 static bool check_bitfield_decl (tree
);
157 static void check_field_decl (tree
, tree
, int *, int *, int *);
158 static void check_field_decls (tree
, tree
*, int *, int *);
159 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
160 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
161 static void check_methods (tree
);
162 static void remove_zero_width_bit_fields (tree
);
163 static bool accessible_nvdtor_p (tree
);
164 static void check_bases (tree
, int *, int *);
165 static void check_bases_and_members (tree
);
166 static tree
create_vtable_ptr (tree
, tree
*);
167 static void include_empty_classes (record_layout_info
);
168 static void layout_class_type (tree
, tree
*);
169 static void propagate_binfo_offsets (tree
, tree
);
170 static void layout_virtual_bases (record_layout_info
, splay_tree
);
171 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
172 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
173 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
174 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
175 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
176 static void layout_vtable_decl (tree
, int);
177 static tree
dfs_find_final_overrider_pre (tree
, void *);
178 static tree
dfs_find_final_overrider_post (tree
, void *);
179 static tree
find_final_overrider (tree
, tree
, tree
);
180 static int make_new_vtable (tree
, tree
);
181 static tree
get_primary_binfo (tree
);
182 static int maybe_indent_hierarchy (FILE *, int, int);
183 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
184 static void dump_class_hierarchy (tree
);
185 static void dump_class_hierarchy_1 (FILE *, int, tree
);
186 static void dump_array (FILE *, tree
);
187 static void dump_vtable (tree
, tree
, tree
);
188 static void dump_vtt (tree
, tree
);
189 static void dump_thunk (FILE *, int, tree
);
190 static tree
build_vtable (tree
, tree
, tree
);
191 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
192 static void layout_nonempty_base_or_field (record_layout_info
,
193 tree
, tree
, splay_tree
);
194 static tree
end_of_class (tree
, int);
195 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
196 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
197 vec
<constructor_elt
, va_gc
> **);
198 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
199 vec
<constructor_elt
, va_gc
> **);
200 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
201 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
202 static void clone_constructors_and_destructors (tree
);
203 static tree
build_clone (tree
, tree
);
204 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
205 static void build_ctor_vtbl_group (tree
, tree
);
206 static void build_vtt (tree
);
207 static tree
binfo_ctor_vtable (tree
);
208 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
210 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
211 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
212 static int record_subobject_offset (tree
, tree
, splay_tree
);
213 static int check_subobject_offset (tree
, tree
, splay_tree
);
214 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
215 tree
, splay_tree
, tree
, int);
216 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
217 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
218 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
220 static void warn_about_ambiguous_bases (tree
);
221 static bool type_requires_array_cookie (tree
);
222 static bool base_derived_from (tree
, tree
);
223 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
224 static tree
end_of_base (tree
);
225 static tree
get_vcall_index (tree
, tree
);
227 /* Variables shared between class.c and call.c. */
230 int n_vtable_entries
= 0;
231 int n_vtable_searches
= 0;
232 int n_vtable_elems
= 0;
233 int n_convert_harshness
= 0;
234 int n_compute_conversion_costs
= 0;
235 int n_inner_fields_searched
= 0;
237 /* Convert to or from a base subobject. EXPR is an expression of type
238 `A' or `A*', an expression of type `B' or `B*' is returned. To
239 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
240 the B base instance within A. To convert base A to derived B, CODE
241 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
242 In this latter case, A must not be a morally virtual base of B.
243 NONNULL is true if EXPR is known to be non-NULL (this is only
244 needed when EXPR is of pointer type). CV qualifiers are preserved
248 build_base_path (enum tree_code code
,
252 tsubst_flags_t complain
)
254 tree v_binfo
= NULL_TREE
;
255 tree d_binfo
= NULL_TREE
;
259 tree null_test
= NULL
;
260 tree ptr_target_type
;
262 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
263 bool has_empty
= false;
267 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
268 return error_mark_node
;
270 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
273 if (is_empty_class (BINFO_TYPE (probe
)))
275 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
279 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
281 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
283 if (code
== PLUS_EXPR
284 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
286 /* This can happen when adjust_result_of_qualified_name_lookup can't
287 find a unique base binfo in a call to a member function. We
288 couldn't give the diagnostic then since we might have been calling
289 a static member function, so we do it now. */
290 if (complain
& tf_error
)
292 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
293 ba_unique
, NULL
, complain
);
294 gcc_assert (base
== error_mark_node
);
296 return error_mark_node
;
299 gcc_assert ((code
== MINUS_EXPR
300 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
301 || code
== PLUS_EXPR
);
303 if (binfo
== d_binfo
)
307 if (code
== MINUS_EXPR
&& v_binfo
)
309 if (complain
& tf_error
)
311 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
314 error ("cannot convert from pointer to base class %qT to "
315 "pointer to derived class %qT because the base is "
316 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
318 error ("cannot convert from base class %qT to derived "
319 "class %qT because the base is virtual",
320 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
325 error ("cannot convert from pointer to base class %qT to "
326 "pointer to derived class %qT via virtual base %qT",
327 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
328 BINFO_TYPE (v_binfo
));
330 error ("cannot convert from base class %qT to derived "
331 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
332 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
335 return error_mark_node
;
340 rvalue
= !real_lvalue_p (expr
);
341 /* This must happen before the call to save_expr. */
342 expr
= cp_build_addr_expr (expr
, complain
);
345 expr
= mark_rvalue_use (expr
);
347 offset
= BINFO_OFFSET (binfo
);
348 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
349 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
350 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
351 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
352 expression returned matches the input. */
353 target_type
= cp_build_qualified_type
354 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
355 ptr_target_type
= build_pointer_type (target_type
);
357 /* Do we need to look in the vtable for the real offset? */
358 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
360 /* Don't bother with the calculations inside sizeof; they'll ICE if the
361 source type is incomplete and the pointer value doesn't matter. In a
362 template (even in instantiate_non_dependent_expr), we don't have vtables
363 set up properly yet, and the value doesn't matter there either; we're
364 just interested in the result of overload resolution. */
365 if (cp_unevaluated_operand
!= 0
366 || in_template_function ())
368 expr
= build_nop (ptr_target_type
, expr
);
372 /* If we're in an NSDMI, we don't have the full constructor context yet
373 that we need for converting to a virtual base, so just build a stub
374 CONVERT_EXPR and expand it later in bot_replace. */
375 if (virtual_access
&& fixed_type_p
< 0
376 && current_scope () != current_function_decl
)
378 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
379 CONVERT_EXPR_VBASE_PATH (expr
) = true;
383 /* Do we need to check for a null pointer? */
384 if (want_pointer
&& !nonnull
)
386 /* If we know the conversion will not actually change the value
387 of EXPR, then we can avoid testing the expression for NULL.
388 We have to avoid generating a COMPONENT_REF for a base class
389 field, because other parts of the compiler know that such
390 expressions are always non-NULL. */
391 if (!virtual_access
&& integer_zerop (offset
))
392 return build_nop (ptr_target_type
, expr
);
393 null_test
= error_mark_node
;
396 /* Protect against multiple evaluation if necessary. */
397 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
398 expr
= save_expr (expr
);
400 /* Now that we've saved expr, build the real null test. */
403 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
404 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
408 /* If this is a simple base reference, express it as a COMPONENT_REF. */
409 if (code
== PLUS_EXPR
&& !virtual_access
410 /* We don't build base fields for empty bases, and they aren't very
411 interesting to the optimizers anyway. */
414 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
415 expr
= build_simple_base_path (expr
, binfo
);
419 expr
= build_address (expr
);
420 target_type
= TREE_TYPE (expr
);
426 /* Going via virtual base V_BINFO. We need the static offset
427 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
428 V_BINFO. That offset is an entry in D_BINFO's vtable. */
431 if (fixed_type_p
< 0 && in_base_initializer
)
433 /* In a base member initializer, we cannot rely on the
434 vtable being set up. We have to indirect via the
438 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
439 t
= build_pointer_type (t
);
440 v_offset
= convert (t
, current_vtt_parm
);
441 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
444 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
446 TREE_TYPE (TREE_TYPE (expr
)));
448 if (v_offset
== error_mark_node
)
449 return error_mark_node
;
451 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
452 v_offset
= build1 (NOP_EXPR
,
453 build_pointer_type (ptrdiff_type_node
),
455 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
456 TREE_CONSTANT (v_offset
) = 1;
458 offset
= convert_to_integer (ptrdiff_type_node
,
459 size_diffop_loc (input_location
, offset
,
460 BINFO_OFFSET (v_binfo
)));
462 if (!integer_zerop (offset
))
463 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
465 if (fixed_type_p
< 0)
466 /* Negative fixed_type_p means this is a constructor or destructor;
467 virtual base layout is fixed in in-charge [cd]tors, but not in
469 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
470 build2 (EQ_EXPR
, boolean_type_node
,
471 current_in_charge_parm
, integer_zero_node
),
473 convert_to_integer (ptrdiff_type_node
,
474 BINFO_OFFSET (binfo
)));
480 target_type
= ptr_target_type
;
482 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
484 if (!integer_zerop (offset
))
486 offset
= fold_convert (sizetype
, offset
);
487 if (code
== MINUS_EXPR
)
488 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
489 expr
= fold_build_pointer_plus (expr
, offset
);
497 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
504 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
505 build_zero_cst (target_type
));
510 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
511 Perform a derived-to-base conversion by recursively building up a
512 sequence of COMPONENT_REFs to the appropriate base fields. */
515 build_simple_base_path (tree expr
, tree binfo
)
517 tree type
= BINFO_TYPE (binfo
);
518 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
521 if (d_binfo
== NULL_TREE
)
525 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
527 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
528 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
529 an lvalue in the front end; only _DECLs and _REFs are lvalues
531 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
533 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
539 expr
= build_simple_base_path (expr
, d_binfo
);
541 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
542 field
; field
= DECL_CHAIN (field
))
543 /* Is this the base field created by build_base_field? */
544 if (TREE_CODE (field
) == FIELD_DECL
545 && DECL_FIELD_IS_BASE (field
)
546 && TREE_TYPE (field
) == type
547 /* If we're looking for a field in the most-derived class,
548 also check the field offset; we can have two base fields
549 of the same type if one is an indirect virtual base and one
550 is a direct non-virtual base. */
551 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
552 || tree_int_cst_equal (byte_position (field
),
553 BINFO_OFFSET (binfo
))))
555 /* We don't use build_class_member_access_expr here, as that
556 has unnecessary checks, and more importantly results in
557 recursive calls to dfs_walk_once. */
558 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
560 expr
= build3 (COMPONENT_REF
,
561 cp_build_qualified_type (type
, type_quals
),
562 expr
, field
, NULL_TREE
);
563 expr
= fold_if_not_in_template (expr
);
565 /* Mark the expression const or volatile, as appropriate.
566 Even though we've dealt with the type above, we still have
567 to mark the expression itself. */
568 if (type_quals
& TYPE_QUAL_CONST
)
569 TREE_READONLY (expr
) = 1;
570 if (type_quals
& TYPE_QUAL_VOLATILE
)
571 TREE_THIS_VOLATILE (expr
) = 1;
576 /* Didn't find the base field?!? */
580 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
581 type is a class type or a pointer to a class type. In the former
582 case, TYPE is also a class type; in the latter it is another
583 pointer type. If CHECK_ACCESS is true, an error message is emitted
584 if TYPE is inaccessible. If OBJECT has pointer type, the value is
585 assumed to be non-NULL. */
588 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
589 tsubst_flags_t complain
)
594 if (TYPE_PTR_P (TREE_TYPE (object
)))
596 object_type
= TREE_TYPE (TREE_TYPE (object
));
597 type
= TREE_TYPE (type
);
600 object_type
= TREE_TYPE (object
);
602 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
604 if (!binfo
|| binfo
== error_mark_node
)
605 return error_mark_node
;
607 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
610 /* EXPR is an expression with unqualified class type. BASE is a base
611 binfo of that class type. Returns EXPR, converted to the BASE
612 type. This function assumes that EXPR is the most derived class;
613 therefore virtual bases can be found at their static offsets. */
616 convert_to_base_statically (tree expr
, tree base
)
620 expr_type
= TREE_TYPE (expr
);
621 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
623 /* If this is a non-empty base, use a COMPONENT_REF. */
624 if (!is_empty_class (BINFO_TYPE (base
)))
625 return build_simple_base_path (expr
, base
);
627 /* We use fold_build2 and fold_convert below to simplify the trees
628 provided to the optimizers. It is not safe to call these functions
629 when processing a template because they do not handle C++-specific
631 gcc_assert (!processing_template_decl
);
632 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
633 if (!integer_zerop (BINFO_OFFSET (base
)))
634 expr
= fold_build_pointer_plus_loc (input_location
,
635 expr
, BINFO_OFFSET (base
));
636 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
637 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
645 build_vfield_ref (tree datum
, tree type
)
647 tree vfield
, vcontext
;
649 if (datum
== error_mark_node
650 /* Can happen in case of duplicate base types (c++/59082). */
651 || !TYPE_VFIELD (type
))
652 return error_mark_node
;
654 /* First, convert to the requested type. */
655 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
656 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
657 /*nonnull=*/true, tf_warning_or_error
);
659 /* Second, the requested type may not be the owner of its own vptr.
660 If not, convert to the base class that owns it. We cannot use
661 convert_to_base here, because VCONTEXT may appear more than once
662 in the inheritance hierarchy of TYPE, and thus direct conversion
663 between the types may be ambiguous. Following the path back up
664 one step at a time via primary bases avoids the problem. */
665 vfield
= TYPE_VFIELD (type
);
666 vcontext
= DECL_CONTEXT (vfield
);
667 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
669 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
670 type
= TREE_TYPE (datum
);
673 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
676 /* Given an object INSTANCE, return an expression which yields the
677 vtable element corresponding to INDEX. There are many special
678 cases for INSTANCE which we take care of here, mainly to avoid
679 creating extra tree nodes when we don't have to. */
682 build_vtbl_ref_1 (tree instance
, tree idx
)
685 tree vtbl
= NULL_TREE
;
687 /* Try to figure out what a reference refers to, and
688 access its virtual function table directly. */
691 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
693 tree basetype
= non_reference (TREE_TYPE (instance
));
695 if (fixed_type
&& !cdtorp
)
697 tree binfo
= lookup_base (fixed_type
, basetype
,
698 ba_unique
, NULL
, tf_none
);
699 if (binfo
&& binfo
!= error_mark_node
)
700 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
704 vtbl
= build_vfield_ref (instance
, basetype
);
706 aref
= build_array_ref (input_location
, vtbl
, idx
);
707 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
713 build_vtbl_ref (tree instance
, tree idx
)
715 tree aref
= build_vtbl_ref_1 (instance
, idx
);
720 /* Given a stable object pointer INSTANCE_PTR, return an expression which
721 yields a function pointer corresponding to vtable element INDEX. */
724 build_vfn_ref (tree instance_ptr
, tree idx
)
728 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
729 tf_warning_or_error
),
732 /* When using function descriptors, the address of the
733 vtable entry is treated as a function pointer. */
734 if (TARGET_VTABLE_USES_DESCRIPTORS
)
735 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
736 cp_build_addr_expr (aref
, tf_warning_or_error
));
738 /* Remember this as a method reference, for later devirtualization. */
739 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
744 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
745 for the given TYPE. */
748 get_vtable_name (tree type
)
750 return mangle_vtbl_for_type (type
);
753 /* DECL is an entity associated with TYPE, like a virtual table or an
754 implicitly generated constructor. Determine whether or not DECL
755 should have external or internal linkage at the object file
756 level. This routine does not deal with COMDAT linkage and other
757 similar complexities; it simply sets TREE_PUBLIC if it possible for
758 entities in other translation units to contain copies of DECL, in
762 set_linkage_according_to_type (tree
/*type*/, tree decl
)
764 TREE_PUBLIC (decl
) = 1;
765 determine_visibility (decl
);
768 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
769 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
770 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
773 build_vtable (tree class_type
, tree name
, tree vtable_type
)
777 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
778 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
779 now to avoid confusion in mangle_decl. */
780 SET_DECL_ASSEMBLER_NAME (decl
, name
);
781 DECL_CONTEXT (decl
) = class_type
;
782 DECL_ARTIFICIAL (decl
) = 1;
783 TREE_STATIC (decl
) = 1;
784 TREE_READONLY (decl
) = 1;
785 DECL_VIRTUAL_P (decl
) = 1;
786 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
787 DECL_USER_ALIGN (decl
) = true;
788 DECL_VTABLE_OR_VTT_P (decl
) = 1;
789 set_linkage_according_to_type (class_type
, decl
);
790 /* The vtable has not been defined -- yet. */
791 DECL_EXTERNAL (decl
) = 1;
792 DECL_NOT_REALLY_EXTERN (decl
) = 1;
794 /* Mark the VAR_DECL node representing the vtable itself as a
795 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
796 is rather important that such things be ignored because any
797 effort to actually generate DWARF for them will run into
798 trouble when/if we encounter code like:
801 struct S { virtual void member (); };
803 because the artificial declaration of the vtable itself (as
804 manufactured by the g++ front end) will say that the vtable is
805 a static member of `S' but only *after* the debug output for
806 the definition of `S' has already been output. This causes
807 grief because the DWARF entry for the definition of the vtable
808 will try to refer back to an earlier *declaration* of the
809 vtable as a static member of `S' and there won't be one. We
810 might be able to arrange to have the "vtable static member"
811 attached to the member list for `S' before the debug info for
812 `S' get written (which would solve the problem) but that would
813 require more intrusive changes to the g++ front end. */
814 DECL_IGNORED_P (decl
) = 1;
819 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
820 or even complete. If this does not exist, create it. If COMPLETE is
821 nonzero, then complete the definition of it -- that will render it
822 impossible to actually build the vtable, but is useful to get at those
823 which are known to exist in the runtime. */
826 get_vtable_decl (tree type
, int complete
)
830 if (CLASSTYPE_VTABLES (type
))
831 return CLASSTYPE_VTABLES (type
);
833 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
834 CLASSTYPE_VTABLES (type
) = decl
;
838 DECL_EXTERNAL (decl
) = 1;
839 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
845 /* Build the primary virtual function table for TYPE. If BINFO is
846 non-NULL, build the vtable starting with the initial approximation
847 that it is the same as the one which is the head of the association
848 list. Returns a nonzero value if a new vtable is actually
852 build_primary_vtable (tree binfo
, tree type
)
857 decl
= get_vtable_decl (type
, /*complete=*/0);
861 if (BINFO_NEW_VTABLE_MARKED (binfo
))
862 /* We have already created a vtable for this base, so there's
863 no need to do it again. */
866 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
867 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
868 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
869 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
873 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
874 virtuals
= NULL_TREE
;
877 if (GATHER_STATISTICS
)
880 n_vtable_elems
+= list_length (virtuals
);
883 /* Initialize the association list for this type, based
884 on our first approximation. */
885 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
886 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
887 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
891 /* Give BINFO a new virtual function table which is initialized
892 with a skeleton-copy of its original initialization. The only
893 entry that changes is the `delta' entry, so we can really
894 share a lot of structure.
896 FOR_TYPE is the most derived type which caused this table to
899 Returns nonzero if we haven't met BINFO before.
901 The order in which vtables are built (by calling this function) for
902 an object must remain the same, otherwise a binary incompatibility
906 build_secondary_vtable (tree binfo
)
908 if (BINFO_NEW_VTABLE_MARKED (binfo
))
909 /* We already created a vtable for this base. There's no need to
913 /* Remember that we've created a vtable for this BINFO, so that we
914 don't try to do so again. */
915 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
917 /* Make fresh virtual list, so we can smash it later. */
918 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
920 /* Secondary vtables are laid out as part of the same structure as
921 the primary vtable. */
922 BINFO_VTABLE (binfo
) = NULL_TREE
;
926 /* Create a new vtable for BINFO which is the hierarchy dominated by
927 T. Return nonzero if we actually created a new vtable. */
930 make_new_vtable (tree t
, tree binfo
)
932 if (binfo
== TYPE_BINFO (t
))
933 /* In this case, it is *type*'s vtable we are modifying. We start
934 with the approximation that its vtable is that of the
935 immediate base class. */
936 return build_primary_vtable (binfo
, t
);
938 /* This is our very own copy of `basetype' to play with. Later,
939 we will fill in all the virtual functions that override the
940 virtual functions in these base classes which are not defined
941 by the current type. */
942 return build_secondary_vtable (binfo
);
945 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
946 (which is in the hierarchy dominated by T) list FNDECL as its
947 BV_FN. DELTA is the required constant adjustment from the `this'
948 pointer where the vtable entry appears to the `this' required when
949 the function is actually called. */
952 modify_vtable_entry (tree t
,
962 if (fndecl
!= BV_FN (v
)
963 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
965 /* We need a new vtable for BINFO. */
966 if (make_new_vtable (t
, binfo
))
968 /* If we really did make a new vtable, we also made a copy
969 of the BINFO_VIRTUALS list. Now, we have to find the
970 corresponding entry in that list. */
971 *virtuals
= BINFO_VIRTUALS (binfo
);
972 while (BV_FN (*virtuals
) != BV_FN (v
))
973 *virtuals
= TREE_CHAIN (*virtuals
);
977 BV_DELTA (v
) = delta
;
978 BV_VCALL_INDEX (v
) = NULL_TREE
;
984 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
985 the USING_DECL naming METHOD. Returns true if the method could be
986 added to the method vec. */
989 add_method (tree type
, tree method
, tree using_decl
)
993 bool template_conv_p
= false;
995 vec
<tree
, va_gc
> *method_vec
;
997 bool insert_p
= false;
1001 if (method
== error_mark_node
)
1004 complete_p
= COMPLETE_TYPE_P (type
);
1005 conv_p
= DECL_CONV_FN_P (method
);
1007 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
1008 && DECL_TEMPLATE_CONV_FN_P (method
));
1010 method_vec
= CLASSTYPE_METHOD_VEC (type
);
1013 /* Make a new method vector. We start with 8 entries. We must
1014 allocate at least two (for constructors and destructors), and
1015 we're going to end up with an assignment operator at some
1017 vec_alloc (method_vec
, 8);
1018 /* Create slots for constructors and destructors. */
1019 method_vec
->quick_push (NULL_TREE
);
1020 method_vec
->quick_push (NULL_TREE
);
1021 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1024 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1025 grok_special_member_properties (method
);
1027 /* Constructors and destructors go in special slots. */
1028 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1029 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1030 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1032 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1034 if (TYPE_FOR_JAVA (type
))
1036 if (!DECL_ARTIFICIAL (method
))
1037 error ("Java class %qT cannot have a destructor", type
);
1038 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1039 error ("Java class %qT cannot have an implicit non-trivial "
1049 /* See if we already have an entry with this name. */
1050 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1051 vec_safe_iterate (method_vec
, slot
, &m
);
1054 m
= OVL_CURRENT (m
);
1055 if (template_conv_p
)
1057 if (TREE_CODE (m
) == TEMPLATE_DECL
1058 && DECL_TEMPLATE_CONV_FN_P (m
))
1062 if (conv_p
&& !DECL_CONV_FN_P (m
))
1064 if (DECL_NAME (m
) == DECL_NAME (method
))
1070 && !DECL_CONV_FN_P (m
)
1071 && DECL_NAME (m
) > DECL_NAME (method
))
1075 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1077 /* Check to see if we've already got this method. */
1078 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1080 tree fn
= OVL_CURRENT (fns
);
1086 if (TREE_CODE (fn
) != TREE_CODE (method
))
1089 /* [over.load] Member function declarations with the
1090 same name and the same parameter types cannot be
1091 overloaded if any of them is a static member
1092 function declaration.
1094 [over.load] Member function declarations with the same name and
1095 the same parameter-type-list as well as member function template
1096 declarations with the same name, the same parameter-type-list, and
1097 the same template parameter lists cannot be overloaded if any of
1098 them, but not all, have a ref-qualifier.
1100 [namespace.udecl] When a using-declaration brings names
1101 from a base class into a derived class scope, member
1102 functions in the derived class override and/or hide member
1103 functions with the same name and parameter types in a base
1104 class (rather than conflicting). */
1105 fn_type
= TREE_TYPE (fn
);
1106 method_type
= TREE_TYPE (method
);
1107 parms1
= TYPE_ARG_TYPES (fn_type
);
1108 parms2
= TYPE_ARG_TYPES (method_type
);
1110 /* Compare the quals on the 'this' parm. Don't compare
1111 the whole types, as used functions are treated as
1112 coming from the using class in overload resolution. */
1113 if (! DECL_STATIC_FUNCTION_P (fn
)
1114 && ! DECL_STATIC_FUNCTION_P (method
)
1115 /* Either both or neither need to be ref-qualified for
1116 differing quals to allow overloading. */
1117 && (FUNCTION_REF_QUALIFIED (fn_type
)
1118 == FUNCTION_REF_QUALIFIED (method_type
))
1119 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1120 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1123 /* For templates, the return type and template parameters
1124 must be identical. */
1125 if (TREE_CODE (fn
) == TEMPLATE_DECL
1126 && (!same_type_p (TREE_TYPE (fn_type
),
1127 TREE_TYPE (method_type
))
1128 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1129 DECL_TEMPLATE_PARMS (method
))))
1132 if (! DECL_STATIC_FUNCTION_P (fn
))
1133 parms1
= TREE_CHAIN (parms1
);
1134 if (! DECL_STATIC_FUNCTION_P (method
))
1135 parms2
= TREE_CHAIN (parms2
);
1137 if (compparms (parms1
, parms2
)
1138 && (!DECL_CONV_FN_P (fn
)
1139 || same_type_p (TREE_TYPE (fn_type
),
1140 TREE_TYPE (method_type
))))
1142 /* For function versions, their parms and types match
1143 but they are not duplicates. Record function versions
1144 as and when they are found. extern "C" functions are
1145 not treated as versions. */
1146 if (TREE_CODE (fn
) == FUNCTION_DECL
1147 && TREE_CODE (method
) == FUNCTION_DECL
1148 && !DECL_EXTERN_C_P (fn
)
1149 && !DECL_EXTERN_C_P (method
)
1150 && targetm
.target_option
.function_versions (fn
, method
))
1152 /* Mark functions as versions if necessary. Modify the mangled
1153 decl name if necessary. */
1154 if (!DECL_FUNCTION_VERSIONED (fn
))
1156 DECL_FUNCTION_VERSIONED (fn
) = 1;
1157 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1160 if (!DECL_FUNCTION_VERSIONED (method
))
1162 DECL_FUNCTION_VERSIONED (method
) = 1;
1163 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1164 mangle_decl (method
);
1166 cgraph_node::record_function_versions (fn
, method
);
1169 if (DECL_INHERITED_CTOR_BASE (method
))
1171 if (DECL_INHERITED_CTOR_BASE (fn
))
1173 error_at (DECL_SOURCE_LOCATION (method
),
1174 "%q#D inherited from %qT", method
,
1175 DECL_INHERITED_CTOR_BASE (method
));
1176 error_at (DECL_SOURCE_LOCATION (fn
),
1177 "conflicts with version inherited from %qT",
1178 DECL_INHERITED_CTOR_BASE (fn
));
1180 /* Otherwise defer to the other function. */
1185 if (DECL_CONTEXT (fn
) == type
)
1186 /* Defer to the local function. */
1191 error ("%q+#D cannot be overloaded", method
);
1192 error ("with %q+#D", fn
);
1195 /* We don't call duplicate_decls here to merge the
1196 declarations because that will confuse things if the
1197 methods have inline definitions. In particular, we
1198 will crash while processing the definitions. */
1203 /* A class should never have more than one destructor. */
1204 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1207 /* Add the new binding. */
1210 overload
= ovl_cons (method
, current_fns
);
1211 OVL_USED (overload
) = true;
1214 overload
= build_overload (method
, current_fns
);
1217 TYPE_HAS_CONVERSION (type
) = 1;
1218 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1219 push_class_level_binding (DECL_NAME (method
), overload
);
1225 /* We only expect to add few methods in the COMPLETE_P case, so
1226 just make room for one more method in that case. */
1228 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1230 reallocated
= vec_safe_reserve (method_vec
, 1);
1232 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1233 if (slot
== method_vec
->length ())
1234 method_vec
->quick_push (overload
);
1236 method_vec
->quick_insert (slot
, overload
);
1239 /* Replace the current slot. */
1240 (*method_vec
)[slot
] = overload
;
1244 /* Subroutines of finish_struct. */
1246 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1247 legit, otherwise return 0. */
1250 alter_access (tree t
, tree fdecl
, tree access
)
1254 if (!DECL_LANG_SPECIFIC (fdecl
))
1255 retrofit_lang_decl (fdecl
);
1257 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1259 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1262 if (TREE_VALUE (elem
) != access
)
1264 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1265 error ("conflicting access specifications for method"
1266 " %q+D, ignored", TREE_TYPE (fdecl
));
1268 error ("conflicting access specifications for field %qE, ignored",
1273 /* They're changing the access to the same thing they changed
1274 it to before. That's OK. */
1280 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1281 tf_warning_or_error
);
1282 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1288 /* Process the USING_DECL, which is a member of T. */
1291 handle_using_decl (tree using_decl
, tree t
)
1293 tree decl
= USING_DECL_DECLS (using_decl
);
1294 tree name
= DECL_NAME (using_decl
);
1296 = TREE_PRIVATE (using_decl
) ? access_private_node
1297 : TREE_PROTECTED (using_decl
) ? access_protected_node
1298 : access_public_node
;
1299 tree flist
= NULL_TREE
;
1302 gcc_assert (!processing_template_decl
&& decl
);
1304 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1305 tf_warning_or_error
);
1308 if (is_overloaded_fn (old_value
))
1309 old_value
= OVL_CURRENT (old_value
);
1311 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1314 old_value
= NULL_TREE
;
1317 cp_emit_debug_info_for_using (decl
, t
);
1319 if (is_overloaded_fn (decl
))
1324 else if (is_overloaded_fn (old_value
))
1327 /* It's OK to use functions from a base when there are functions with
1328 the same name already present in the current class. */;
1331 error ("%q+D invalid in %q#T", using_decl
, t
);
1332 error (" because of local method %q+#D with same name",
1333 OVL_CURRENT (old_value
));
1337 else if (!DECL_ARTIFICIAL (old_value
))
1339 error ("%q+D invalid in %q#T", using_decl
, t
);
1340 error (" because of local member %q+#D with same name", old_value
);
1344 /* Make type T see field decl FDECL with access ACCESS. */
1346 for (; flist
; flist
= OVL_NEXT (flist
))
1348 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1349 alter_access (t
, OVL_CURRENT (flist
), access
);
1352 alter_access (t
, decl
, access
);
1355 /* Data structure for find_abi_tags_r, below. */
1359 tree t
; // The type that we're checking for missing tags.
1360 tree subob
; // The subobject of T that we're getting tags from.
1361 tree tags
; // error_mark_node for diagnostics, or a list of missing tags.
1364 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1365 in the context of P. TAG can be either an identifier (the DECL_NAME of
1366 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1369 check_tag (tree tag
, tree
*tp
, abi_tag_data
*p
)
1373 if (TREE_CODE (tag
) == STRING_CST
)
1374 id
= get_identifier (TREE_STRING_POINTER (tag
));
1381 if (!IDENTIFIER_MARKED (id
))
1384 tag
= build_string (IDENTIFIER_LENGTH (id
) + 1,
1385 IDENTIFIER_POINTER (id
));
1386 if (p
->tags
!= error_mark_node
)
1388 /* We're collecting tags from template arguments. */
1389 p
->tags
= tree_cons (NULL_TREE
, tag
, p
->tags
);
1390 ABI_TAG_IMPLICIT (p
->tags
) = true;
1392 /* Don't inherit this tag multiple times. */
1393 IDENTIFIER_MARKED (id
) = true;
1396 /* Otherwise we're diagnosing missing tags. */
1397 else if (TYPE_P (p
->subob
))
1399 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1400 "that base %qT has", p
->t
, tag
, p
->subob
))
1401 inform (location_of (p
->subob
), "%qT declared here",
1406 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1407 "that %qT (used in the type of %qD) has",
1408 p
->t
, tag
, *tp
, p
->subob
))
1410 inform (location_of (p
->subob
), "%qD declared here",
1412 inform (location_of (*tp
), "%qT declared here", *tp
);
1418 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1419 types with abi tags, add the corresponding identifiers to the VEC in
1420 *DATA and set IDENTIFIER_MARKED. */
1423 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1425 if (!OVERLOAD_TYPE_P (*tp
))
1428 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1429 anyway, but let's make sure of it. */
1430 *walk_subtrees
= false;
1432 abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1434 for (tree ns
= decl_namespace_context (*tp
);
1435 ns
!= global_namespace
;
1436 ns
= CP_DECL_CONTEXT (ns
))
1437 if (NAMESPACE_ABI_TAG (ns
))
1438 check_tag (DECL_NAME (ns
), tp
, p
);
1440 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1442 for (tree list
= TREE_VALUE (attributes
); list
;
1443 list
= TREE_CHAIN (list
))
1445 tree tag
= TREE_VALUE (list
);
1446 check_tag (tag
, tp
, p
);
1452 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1453 complete) template arguments. */
1456 mark_type_abi_tags (tree t
, bool val
)
1458 for (tree ns
= decl_namespace_context (t
);
1459 ns
!= global_namespace
;
1460 ns
= CP_DECL_CONTEXT (ns
))
1461 if (NAMESPACE_ABI_TAG (ns
))
1462 IDENTIFIER_MARKED (DECL_NAME (ns
)) = val
;
1464 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1467 for (tree list
= TREE_VALUE (attributes
); list
;
1468 list
= TREE_CHAIN (list
))
1470 tree tag
= TREE_VALUE (list
);
1471 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1472 IDENTIFIER_MARKED (id
) = val
;
1477 /* Check that class T has all the abi tags that subobject SUBOB has, or
1481 check_abi_tags (tree t
, tree subob
)
1483 mark_type_abi_tags (t
, true);
1485 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1486 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1488 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1490 mark_type_abi_tags (t
, false);
1494 inherit_targ_abi_tags (tree t
)
1496 if (!CLASS_TYPE_P (t
)
1497 || CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1500 mark_type_abi_tags (t
, true);
1502 tree args
= CLASSTYPE_TI_ARGS (t
);
1503 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1504 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1506 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1507 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1509 tree arg
= TREE_VEC_ELT (level
, j
);
1511 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1515 // If we found some tags on our template arguments, add them to our
1516 // abi_tag attribute.
1519 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1521 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1524 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1525 TYPE_ATTRIBUTES (t
));
1528 mark_type_abi_tags (t
, false);
1531 /* Return true, iff class T has a non-virtual destructor that is
1532 accessible from outside the class heirarchy (i.e. is public, or
1533 there's a suitable friend. */
1536 accessible_nvdtor_p (tree t
)
1538 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1540 /* An implicitly declared destructor is always public. And,
1541 if it were virtual, we would have created it by now. */
1545 if (DECL_VINDEX (dtor
))
1546 return false; /* Virtual */
1548 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1549 return true; /* Public */
1551 if (CLASSTYPE_FRIEND_CLASSES (t
)
1552 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1553 return true; /* Has friends */
1558 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1559 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1560 properties of the bases. */
1563 check_bases (tree t
,
1564 int* cant_have_const_ctor_p
,
1565 int* no_const_asn_ref_p
)
1568 bool seen_non_virtual_nearly_empty_base_p
= 0;
1569 int seen_tm_mask
= 0;
1572 tree field
= NULL_TREE
;
1574 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1575 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1576 if (TREE_CODE (field
) == FIELD_DECL
)
1579 for (binfo
= TYPE_BINFO (t
), i
= 0;
1580 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1582 tree basetype
= TREE_TYPE (base_binfo
);
1584 gcc_assert (COMPLETE_TYPE_P (basetype
));
1586 if (CLASSTYPE_FINAL (basetype
))
1587 error ("cannot derive from %<final%> base %qT in derived type %qT",
1590 /* If any base class is non-literal, so is the derived class. */
1591 if (!CLASSTYPE_LITERAL_P (basetype
))
1592 CLASSTYPE_LITERAL_P (t
) = false;
1594 /* If the base class doesn't have copy constructors or
1595 assignment operators that take const references, then the
1596 derived class cannot have such a member automatically
1598 if (TYPE_HAS_COPY_CTOR (basetype
)
1599 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1600 *cant_have_const_ctor_p
= 1;
1601 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1602 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1603 *no_const_asn_ref_p
= 1;
1605 if (BINFO_VIRTUAL_P (base_binfo
))
1606 /* A virtual base does not effect nearly emptiness. */
1608 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1610 if (seen_non_virtual_nearly_empty_base_p
)
1611 /* And if there is more than one nearly empty base, then the
1612 derived class is not nearly empty either. */
1613 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1615 /* Remember we've seen one. */
1616 seen_non_virtual_nearly_empty_base_p
= 1;
1618 else if (!is_empty_class (basetype
))
1619 /* If the base class is not empty or nearly empty, then this
1620 class cannot be nearly empty. */
1621 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1623 /* A lot of properties from the bases also apply to the derived
1625 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1626 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1627 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1628 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1629 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1630 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1631 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1632 || !TYPE_HAS_COPY_CTOR (basetype
));
1633 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1634 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1635 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1636 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1637 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1638 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1639 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1640 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1641 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1642 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1643 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1644 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1645 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1646 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1648 /* A standard-layout class is a class that:
1650 * has no non-standard-layout base classes, */
1651 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1652 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1655 /* ...has no base classes of the same type as the first non-static
1657 if (field
&& DECL_CONTEXT (field
) == t
1658 && (same_type_ignoring_top_level_qualifiers_p
1659 (TREE_TYPE (field
), basetype
)))
1660 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1662 /* ...either has no non-static data members in the most-derived
1663 class and at most one base class with non-static data
1664 members, or has no base classes with non-static data
1666 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1667 basefield
= DECL_CHAIN (basefield
))
1668 if (TREE_CODE (basefield
) == FIELD_DECL
)
1671 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1678 /* Don't bother collecting tm attributes if transactional memory
1679 support is not enabled. */
1682 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1684 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1687 check_abi_tags (t
, basetype
);
1690 /* If one of the base classes had TM attributes, and the current class
1691 doesn't define its own, then the current class inherits one. */
1692 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1694 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1695 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1699 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1700 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1701 that have had a nearly-empty virtual primary base stolen by some
1702 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1706 determine_primary_bases (tree t
)
1709 tree primary
= NULL_TREE
;
1710 tree type_binfo
= TYPE_BINFO (t
);
1713 /* Determine the primary bases of our bases. */
1714 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1715 base_binfo
= TREE_CHAIN (base_binfo
))
1717 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1719 /* See if we're the non-virtual primary of our inheritance
1721 if (!BINFO_VIRTUAL_P (base_binfo
))
1723 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1724 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1727 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1728 BINFO_TYPE (parent_primary
)))
1729 /* We are the primary binfo. */
1730 BINFO_PRIMARY_P (base_binfo
) = 1;
1732 /* Determine if we have a virtual primary base, and mark it so.
1734 if (primary
&& BINFO_VIRTUAL_P (primary
))
1736 tree this_primary
= copied_binfo (primary
, base_binfo
);
1738 if (BINFO_PRIMARY_P (this_primary
))
1739 /* Someone already claimed this base. */
1740 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1745 BINFO_PRIMARY_P (this_primary
) = 1;
1746 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1748 /* A virtual binfo might have been copied from within
1749 another hierarchy. As we're about to use it as a
1750 primary base, make sure the offsets match. */
1751 delta
= size_diffop_loc (input_location
,
1753 BINFO_OFFSET (base_binfo
)),
1755 BINFO_OFFSET (this_primary
)));
1757 propagate_binfo_offsets (this_primary
, delta
);
1762 /* First look for a dynamic direct non-virtual base. */
1763 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1765 tree basetype
= BINFO_TYPE (base_binfo
);
1767 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1769 primary
= base_binfo
;
1774 /* A "nearly-empty" virtual base class can be the primary base
1775 class, if no non-virtual polymorphic base can be found. Look for
1776 a nearly-empty virtual dynamic base that is not already a primary
1777 base of something in the hierarchy. If there is no such base,
1778 just pick the first nearly-empty virtual base. */
1780 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1781 base_binfo
= TREE_CHAIN (base_binfo
))
1782 if (BINFO_VIRTUAL_P (base_binfo
)
1783 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1785 if (!BINFO_PRIMARY_P (base_binfo
))
1787 /* Found one that is not primary. */
1788 primary
= base_binfo
;
1792 /* Remember the first candidate. */
1793 primary
= base_binfo
;
1797 /* If we've got a primary base, use it. */
1800 tree basetype
= BINFO_TYPE (primary
);
1802 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1803 if (BINFO_PRIMARY_P (primary
))
1804 /* We are stealing a primary base. */
1805 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1806 BINFO_PRIMARY_P (primary
) = 1;
1807 if (BINFO_VIRTUAL_P (primary
))
1811 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1812 /* A virtual binfo might have been copied from within
1813 another hierarchy. As we're about to use it as a primary
1814 base, make sure the offsets match. */
1815 delta
= size_diffop_loc (input_location
, ssize_int (0),
1816 convert (ssizetype
, BINFO_OFFSET (primary
)));
1818 propagate_binfo_offsets (primary
, delta
);
1821 primary
= TYPE_BINFO (basetype
);
1823 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1824 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1825 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1829 /* Update the variant types of T. */
1832 fixup_type_variants (tree t
)
1839 for (variants
= TYPE_NEXT_VARIANT (t
);
1841 variants
= TYPE_NEXT_VARIANT (variants
))
1843 /* These fields are in the _TYPE part of the node, not in
1844 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1845 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1846 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1847 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1848 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1850 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1852 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1854 /* Copy whatever these are holding today. */
1855 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1856 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1857 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1861 /* Early variant fixups: we apply attributes at the beginning of the class
1862 definition, and we need to fix up any variants that have already been
1863 made via elaborated-type-specifier so that check_qualified_type works. */
1866 fixup_attribute_variants (tree t
)
1873 for (variants
= TYPE_NEXT_VARIANT (t
);
1875 variants
= TYPE_NEXT_VARIANT (variants
))
1877 /* These are the two fields that check_qualified_type looks at and
1878 are affected by attributes. */
1879 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1880 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1884 /* Set memoizing fields and bits of T (and its variants) for later
1888 finish_struct_bits (tree t
)
1890 /* Fix up variants (if any). */
1891 fixup_type_variants (t
);
1893 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1894 /* For a class w/o baseclasses, 'finish_struct' has set
1895 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1896 Similarly for a class whose base classes do not have vtables.
1897 When neither of these is true, we might have removed abstract
1898 virtuals (by providing a definition), added some (by declaring
1899 new ones), or redeclared ones from a base class. We need to
1900 recalculate what's really an abstract virtual at this point (by
1901 looking in the vtables). */
1902 get_pure_virtuals (t
);
1904 /* If this type has a copy constructor or a destructor, force its
1905 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1906 nonzero. This will cause it to be passed by invisible reference
1907 and prevent it from being returned in a register. */
1908 if (type_has_nontrivial_copy_init (t
)
1909 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1912 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1913 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1915 SET_TYPE_MODE (variants
, BLKmode
);
1916 TREE_ADDRESSABLE (variants
) = 1;
1921 /* Issue warnings about T having private constructors, but no friends,
1924 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1925 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1926 non-private static member functions. */
1929 maybe_warn_about_overly_private_class (tree t
)
1931 int has_member_fn
= 0;
1932 int has_nonprivate_method
= 0;
1935 if (!warn_ctor_dtor_privacy
1936 /* If the class has friends, those entities might create and
1937 access instances, so we should not warn. */
1938 || (CLASSTYPE_FRIEND_CLASSES (t
)
1939 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1940 /* We will have warned when the template was declared; there's
1941 no need to warn on every instantiation. */
1942 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1943 /* There's no reason to even consider warning about this
1947 /* We only issue one warning, if more than one applies, because
1948 otherwise, on code like:
1951 // Oops - forgot `public:'
1957 we warn several times about essentially the same problem. */
1959 /* Check to see if all (non-constructor, non-destructor) member
1960 functions are private. (Since there are no friends or
1961 non-private statics, we can't ever call any of the private member
1963 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1964 /* We're not interested in compiler-generated methods; they don't
1965 provide any way to call private members. */
1966 if (!DECL_ARTIFICIAL (fn
))
1968 if (!TREE_PRIVATE (fn
))
1970 if (DECL_STATIC_FUNCTION_P (fn
))
1971 /* A non-private static member function is just like a
1972 friend; it can create and invoke private member
1973 functions, and be accessed without a class
1977 has_nonprivate_method
= 1;
1978 /* Keep searching for a static member function. */
1980 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1984 if (!has_nonprivate_method
&& has_member_fn
)
1986 /* There are no non-private methods, and there's at least one
1987 private member function that isn't a constructor or
1988 destructor. (If all the private members are
1989 constructors/destructors we want to use the code below that
1990 issues error messages specifically referring to
1991 constructors/destructors.) */
1993 tree binfo
= TYPE_BINFO (t
);
1995 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1996 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1998 has_nonprivate_method
= 1;
2001 if (!has_nonprivate_method
)
2003 warning (OPT_Wctor_dtor_privacy
,
2004 "all member functions in class %qT are private", t
);
2009 /* Even if some of the member functions are non-private, the class
2010 won't be useful for much if all the constructors or destructors
2011 are private: such an object can never be created or destroyed. */
2012 fn
= CLASSTYPE_DESTRUCTORS (t
);
2013 if (fn
&& TREE_PRIVATE (fn
))
2015 warning (OPT_Wctor_dtor_privacy
,
2016 "%q#T only defines a private destructor and has no friends",
2021 /* Warn about classes that have private constructors and no friends. */
2022 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
2023 /* Implicitly generated constructors are always public. */
2024 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
2025 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
2027 int nonprivate_ctor
= 0;
2029 /* If a non-template class does not define a copy
2030 constructor, one is defined for it, enabling it to avoid
2031 this warning. For a template class, this does not
2032 happen, and so we would normally get a warning on:
2034 template <class T> class C { private: C(); };
2036 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2037 complete non-template or fully instantiated classes have this
2039 if (!TYPE_HAS_COPY_CTOR (t
))
2040 nonprivate_ctor
= 1;
2042 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
2044 tree ctor
= OVL_CURRENT (fn
);
2045 /* Ideally, we wouldn't count copy constructors (or, in
2046 fact, any constructor that takes an argument of the
2047 class type as a parameter) because such things cannot
2048 be used to construct an instance of the class unless
2049 you already have one. But, for now at least, we're
2051 if (! TREE_PRIVATE (ctor
))
2053 nonprivate_ctor
= 1;
2058 if (nonprivate_ctor
== 0)
2060 warning (OPT_Wctor_dtor_privacy
,
2061 "%q#T only defines private constructors and has no friends",
2069 gt_pointer_operator new_value
;
2073 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2076 method_name_cmp (const void* m1_p
, const void* m2_p
)
2078 const tree
*const m1
= (const tree
*) m1_p
;
2079 const tree
*const m2
= (const tree
*) m2_p
;
2081 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2083 if (*m1
== NULL_TREE
)
2085 if (*m2
== NULL_TREE
)
2087 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2092 /* This routine compares two fields like method_name_cmp but using the
2093 pointer operator in resort_field_decl_data. */
2096 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2098 const tree
*const m1
= (const tree
*) m1_p
;
2099 const tree
*const m2
= (const tree
*) m2_p
;
2100 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2102 if (*m1
== NULL_TREE
)
2104 if (*m2
== NULL_TREE
)
2107 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2108 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2109 resort_data
.new_value (&d1
, resort_data
.cookie
);
2110 resort_data
.new_value (&d2
, resort_data
.cookie
);
2117 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2120 resort_type_method_vec (void* obj
,
2122 gt_pointer_operator new_value
,
2125 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2126 int len
= vec_safe_length (method_vec
);
2130 /* The type conversion ops have to live at the front of the vec, so we
2132 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2133 vec_safe_iterate (method_vec
, slot
, &fn
);
2135 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2140 resort_data
.new_value
= new_value
;
2141 resort_data
.cookie
= cookie
;
2142 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2143 resort_method_name_cmp
);
2147 /* Warn about duplicate methods in fn_fields.
2149 Sort methods that are not special (i.e., constructors, destructors,
2150 and type conversion operators) so that we can find them faster in
2154 finish_struct_methods (tree t
)
2157 vec
<tree
, va_gc
> *method_vec
;
2160 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2164 len
= method_vec
->length ();
2166 /* Clear DECL_IN_AGGR_P for all functions. */
2167 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2168 fn_fields
= DECL_CHAIN (fn_fields
))
2169 DECL_IN_AGGR_P (fn_fields
) = 0;
2171 /* Issue warnings about private constructors and such. If there are
2172 no methods, then some public defaults are generated. */
2173 maybe_warn_about_overly_private_class (t
);
2175 /* The type conversion ops have to live at the front of the vec, so we
2177 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2178 method_vec
->iterate (slot
, &fn_fields
);
2180 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2183 qsort (method_vec
->address () + slot
,
2184 len
-slot
, sizeof (tree
), method_name_cmp
);
2187 /* Make BINFO's vtable have N entries, including RTTI entries,
2188 vbase and vcall offsets, etc. Set its type and call the back end
2192 layout_vtable_decl (tree binfo
, int n
)
2197 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2198 layout_type (atype
);
2200 /* We may have to grow the vtable. */
2201 vtable
= get_vtbl_decl_for_binfo (binfo
);
2202 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2204 TREE_TYPE (vtable
) = atype
;
2205 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2206 layout_decl (vtable
, 0);
2210 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2211 have the same signature. */
2214 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2216 /* One destructor overrides another if they are the same kind of
2218 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2219 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2221 /* But a non-destructor never overrides a destructor, nor vice
2222 versa, nor do different kinds of destructors override
2223 one-another. For example, a complete object destructor does not
2224 override a deleting destructor. */
2225 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2228 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2229 || (DECL_CONV_FN_P (fndecl
)
2230 && DECL_CONV_FN_P (base_fndecl
)
2231 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2232 DECL_CONV_FN_TYPE (base_fndecl
))))
2234 tree fntype
= TREE_TYPE (fndecl
);
2235 tree base_fntype
= TREE_TYPE (base_fndecl
);
2236 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2237 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2238 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2239 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2245 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2249 base_derived_from (tree derived
, tree base
)
2253 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2255 if (probe
== derived
)
2257 else if (BINFO_VIRTUAL_P (probe
))
2258 /* If we meet a virtual base, we can't follow the inheritance
2259 any more. See if the complete type of DERIVED contains
2260 such a virtual base. */
2261 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2267 typedef struct find_final_overrider_data_s
{
2268 /* The function for which we are trying to find a final overrider. */
2270 /* The base class in which the function was declared. */
2271 tree declaring_base
;
2272 /* The candidate overriders. */
2274 /* Path to most derived. */
2276 } find_final_overrider_data
;
2278 /* Add the overrider along the current path to FFOD->CANDIDATES.
2279 Returns true if an overrider was found; false otherwise. */
2282 dfs_find_final_overrider_1 (tree binfo
,
2283 find_final_overrider_data
*ffod
,
2288 /* If BINFO is not the most derived type, try a more derived class.
2289 A definition there will overrider a definition here. */
2293 if (dfs_find_final_overrider_1
2294 (ffod
->path
[depth
], ffod
, depth
))
2298 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2301 tree
*candidate
= &ffod
->candidates
;
2303 /* Remove any candidates overridden by this new function. */
2306 /* If *CANDIDATE overrides METHOD, then METHOD
2307 cannot override anything else on the list. */
2308 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2310 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2311 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2312 *candidate
= TREE_CHAIN (*candidate
);
2314 candidate
= &TREE_CHAIN (*candidate
);
2317 /* Add the new function. */
2318 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2325 /* Called from find_final_overrider via dfs_walk. */
2328 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2330 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2332 if (binfo
== ffod
->declaring_base
)
2333 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2334 ffod
->path
.safe_push (binfo
);
2340 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2342 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2348 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2349 FN and whose TREE_VALUE is the binfo for the base where the
2350 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2351 DERIVED) is the base object in which FN is declared. */
2354 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2356 find_final_overrider_data ffod
;
2358 /* Getting this right is a little tricky. This is valid:
2360 struct S { virtual void f (); };
2361 struct T { virtual void f (); };
2362 struct U : public S, public T { };
2364 even though calling `f' in `U' is ambiguous. But,
2366 struct R { virtual void f(); };
2367 struct S : virtual public R { virtual void f (); };
2368 struct T : virtual public R { virtual void f (); };
2369 struct U : public S, public T { };
2371 is not -- there's no way to decide whether to put `S::f' or
2372 `T::f' in the vtable for `R'.
2374 The solution is to look at all paths to BINFO. If we find
2375 different overriders along any two, then there is a problem. */
2376 if (DECL_THUNK_P (fn
))
2377 fn
= THUNK_TARGET (fn
);
2379 /* Determine the depth of the hierarchy. */
2381 ffod
.declaring_base
= binfo
;
2382 ffod
.candidates
= NULL_TREE
;
2383 ffod
.path
.create (30);
2385 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2386 dfs_find_final_overrider_post
, &ffod
);
2388 ffod
.path
.release ();
2390 /* If there was no winner, issue an error message. */
2391 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2392 return error_mark_node
;
2394 return ffod
.candidates
;
2397 /* Return the index of the vcall offset for FN when TYPE is used as a
2401 get_vcall_index (tree fn
, tree type
)
2403 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2407 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2408 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2409 || same_signature_p (fn
, p
->purpose
))
2412 /* There should always be an appropriate index. */
2416 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2417 dominated by T. FN is the old function; VIRTUALS points to the
2418 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2419 of that entry in the list. */
2422 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2430 tree overrider_fn
, overrider_target
;
2431 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2432 tree over_return
, base_return
;
2435 /* Find the nearest primary base (possibly binfo itself) which defines
2436 this function; this is the class the caller will convert to when
2437 calling FN through BINFO. */
2438 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2441 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2444 /* The nearest definition is from a lost primary. */
2445 if (BINFO_LOST_PRIMARY_P (b
))
2450 /* Find the final overrider. */
2451 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2452 if (overrider
== error_mark_node
)
2454 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2457 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2459 /* Check for adjusting covariant return types. */
2460 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2461 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2463 if (POINTER_TYPE_P (over_return
)
2464 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2465 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2466 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2467 /* If the overrider is invalid, don't even try. */
2468 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2470 /* If FN is a covariant thunk, we must figure out the adjustment
2471 to the final base FN was converting to. As OVERRIDER_TARGET might
2472 also be converting to the return type of FN, we have to
2473 combine the two conversions here. */
2474 tree fixed_offset
, virtual_offset
;
2476 over_return
= TREE_TYPE (over_return
);
2477 base_return
= TREE_TYPE (base_return
);
2479 if (DECL_THUNK_P (fn
))
2481 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2482 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2483 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2486 fixed_offset
= virtual_offset
= NULL_TREE
;
2489 /* Find the equivalent binfo within the return type of the
2490 overriding function. We will want the vbase offset from
2492 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2494 else if (!same_type_ignoring_top_level_qualifiers_p
2495 (over_return
, base_return
))
2497 /* There was no existing virtual thunk (which takes
2498 precedence). So find the binfo of the base function's
2499 return type within the overriding function's return type.
2500 We cannot call lookup base here, because we're inside a
2501 dfs_walk, and will therefore clobber the BINFO_MARKED
2502 flags. Fortunately we know the covariancy is valid (it
2503 has already been checked), so we can just iterate along
2504 the binfos, which have been chained in inheritance graph
2505 order. Of course it is lame that we have to repeat the
2506 search here anyway -- we should really be caching pieces
2507 of the vtable and avoiding this repeated work. */
2508 tree thunk_binfo
, base_binfo
;
2510 /* Find the base binfo within the overriding function's
2511 return type. We will always find a thunk_binfo, except
2512 when the covariancy is invalid (which we will have
2513 already diagnosed). */
2514 for (base_binfo
= TYPE_BINFO (base_return
),
2515 thunk_binfo
= TYPE_BINFO (over_return
);
2517 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2518 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2519 BINFO_TYPE (base_binfo
)))
2522 /* See if virtual inheritance is involved. */
2523 for (virtual_offset
= thunk_binfo
;
2525 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2526 if (BINFO_VIRTUAL_P (virtual_offset
))
2530 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2532 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2536 /* We convert via virtual base. Adjust the fixed
2537 offset to be from there. */
2539 size_diffop (offset
,
2541 BINFO_OFFSET (virtual_offset
)));
2544 /* There was an existing fixed offset, this must be
2545 from the base just converted to, and the base the
2546 FN was thunking to. */
2547 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2549 fixed_offset
= offset
;
2553 if (fixed_offset
|| virtual_offset
)
2554 /* Replace the overriding function with a covariant thunk. We
2555 will emit the overriding function in its own slot as
2557 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2558 fixed_offset
, virtual_offset
);
2561 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2562 !DECL_THUNK_P (fn
));
2564 /* If we need a covariant thunk, then we may need to adjust first_defn.
2565 The ABI specifies that the thunks emitted with a function are
2566 determined by which bases the function overrides, so we need to be
2567 sure that we're using a thunk for some overridden base; even if we
2568 know that the necessary this adjustment is zero, there may not be an
2569 appropriate zero-this-adjusment thunk for us to use since thunks for
2570 overriding virtual bases always use the vcall offset.
2572 Furthermore, just choosing any base that overrides this function isn't
2573 quite right, as this slot won't be used for calls through a type that
2574 puts a covariant thunk here. Calling the function through such a type
2575 will use a different slot, and that slot is the one that determines
2576 the thunk emitted for that base.
2578 So, keep looking until we find the base that we're really overriding
2579 in this slot: the nearest primary base that doesn't use a covariant
2580 thunk in this slot. */
2581 if (overrider_target
!= overrider_fn
)
2583 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2584 /* We already know that the overrider needs a covariant thunk. */
2585 b
= get_primary_binfo (b
);
2586 for (; ; b
= get_primary_binfo (b
))
2588 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2589 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2590 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2592 if (BINFO_LOST_PRIMARY_P (b
))
2598 /* Assume that we will produce a thunk that convert all the way to
2599 the final overrider, and not to an intermediate virtual base. */
2600 virtual_base
= NULL_TREE
;
2602 /* See if we can convert to an intermediate virtual base first, and then
2603 use the vcall offset located there to finish the conversion. */
2604 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2606 /* If we find the final overrider, then we can stop
2608 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2609 BINFO_TYPE (TREE_VALUE (overrider
))))
2612 /* If we find a virtual base, and we haven't yet found the
2613 overrider, then there is a virtual base between the
2614 declaring base (first_defn) and the final overrider. */
2615 if (BINFO_VIRTUAL_P (b
))
2622 /* Compute the constant adjustment to the `this' pointer. The
2623 `this' pointer, when this function is called, will point at BINFO
2624 (or one of its primary bases, which are at the same offset). */
2626 /* The `this' pointer needs to be adjusted from the declaration to
2627 the nearest virtual base. */
2628 delta
= size_diffop_loc (input_location
,
2629 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2630 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2632 /* If the nearest definition is in a lost primary, we don't need an
2633 entry in our vtable. Except possibly in a constructor vtable,
2634 if we happen to get our primary back. In that case, the offset
2635 will be zero, as it will be a primary base. */
2636 delta
= size_zero_node
;
2638 /* The `this' pointer needs to be adjusted from pointing to
2639 BINFO to pointing at the base where the final overrider
2641 delta
= size_diffop_loc (input_location
,
2643 BINFO_OFFSET (TREE_VALUE (overrider
))),
2644 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2646 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2649 BV_VCALL_INDEX (*virtuals
)
2650 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2652 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2654 BV_LOST_PRIMARY (*virtuals
) = lost
;
2657 /* Called from modify_all_vtables via dfs_walk. */
2660 dfs_modify_vtables (tree binfo
, void* data
)
2662 tree t
= (tree
) data
;
2667 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2668 /* A base without a vtable needs no modification, and its bases
2669 are uninteresting. */
2670 return dfs_skip_bases
;
2672 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2673 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2674 /* Don't do the primary vtable, if it's new. */
2677 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2678 /* There's no need to modify the vtable for a non-virtual primary
2679 base; we're not going to use that vtable anyhow. We do still
2680 need to do this for virtual primary bases, as they could become
2681 non-primary in a construction vtable. */
2684 make_new_vtable (t
, binfo
);
2686 /* Now, go through each of the virtual functions in the virtual
2687 function table for BINFO. Find the final overrider, and update
2688 the BINFO_VIRTUALS list appropriately. */
2689 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2690 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2692 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2693 old_virtuals
= TREE_CHAIN (old_virtuals
))
2694 update_vtable_entry_for_fn (t
,
2696 BV_FN (old_virtuals
),
2702 /* Update all of the primary and secondary vtables for T. Create new
2703 vtables as required, and initialize their RTTI information. Each
2704 of the functions in VIRTUALS is declared in T and may override a
2705 virtual function from a base class; find and modify the appropriate
2706 entries to point to the overriding functions. Returns a list, in
2707 declaration order, of the virtual functions that are declared in T,
2708 but do not appear in the primary base class vtable, and which
2709 should therefore be appended to the end of the vtable for T. */
2712 modify_all_vtables (tree t
, tree virtuals
)
2714 tree binfo
= TYPE_BINFO (t
);
2717 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2718 if (TYPE_CONTAINS_VPTR_P (t
))
2719 get_vtable_decl (t
, false);
2721 /* Update all of the vtables. */
2722 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2724 /* Add virtual functions not already in our primary vtable. These
2725 will be both those introduced by this class, and those overridden
2726 from secondary bases. It does not include virtuals merely
2727 inherited from secondary bases. */
2728 for (fnsp
= &virtuals
; *fnsp
; )
2730 tree fn
= TREE_VALUE (*fnsp
);
2732 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2733 || DECL_VINDEX (fn
) == error_mark_node
)
2735 /* We don't need to adjust the `this' pointer when
2736 calling this function. */
2737 BV_DELTA (*fnsp
) = integer_zero_node
;
2738 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2740 /* This is a function not already in our vtable. Keep it. */
2741 fnsp
= &TREE_CHAIN (*fnsp
);
2744 /* We've already got an entry for this function. Skip it. */
2745 *fnsp
= TREE_CHAIN (*fnsp
);
2751 /* Get the base virtual function declarations in T that have the
2755 get_basefndecls (tree name
, tree t
, vec
<tree
> *base_fndecls
)
2758 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2761 /* Find virtual functions in T with the indicated NAME. */
2762 i
= lookup_fnfields_1 (t
, name
);
2763 bool found_decls
= false;
2765 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2767 methods
= OVL_NEXT (methods
))
2769 tree method
= OVL_CURRENT (methods
);
2771 if (TREE_CODE (method
) == FUNCTION_DECL
2772 && DECL_VINDEX (method
))
2774 base_fndecls
->safe_push (method
);
2782 for (i
= 0; i
< n_baseclasses
; i
++)
2784 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2785 get_basefndecls (name
, basetype
, base_fndecls
);
2789 /* If this declaration supersedes the declaration of
2790 a method declared virtual in the base class, then
2791 mark this field as being virtual as well. */
2794 check_for_override (tree decl
, tree ctype
)
2796 bool overrides_found
= false;
2797 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2798 /* In [temp.mem] we have:
2800 A specialization of a member function template does not
2801 override a virtual function from a base class. */
2803 if ((DECL_DESTRUCTOR_P (decl
)
2804 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2805 || DECL_CONV_FN_P (decl
))
2806 && look_for_overrides (ctype
, decl
)
2807 && !DECL_STATIC_FUNCTION_P (decl
))
2808 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2809 the error_mark_node so that we know it is an overriding
2812 DECL_VINDEX (decl
) = decl
;
2813 overrides_found
= true;
2814 if (warn_override
&& !DECL_OVERRIDE_P (decl
)
2815 && !DECL_DESTRUCTOR_P (decl
))
2816 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wsuggest_override
,
2817 "%q+D can be marked override", decl
);
2820 if (DECL_VIRTUAL_P (decl
))
2822 if (!DECL_VINDEX (decl
))
2823 DECL_VINDEX (decl
) = error_mark_node
;
2824 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2825 if (DECL_DESTRUCTOR_P (decl
))
2826 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2828 else if (DECL_FINAL_P (decl
))
2829 error ("%q+#D marked %<final%>, but is not virtual", decl
);
2830 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2831 error ("%q+#D marked %<override%>, but does not override", decl
);
2834 /* Warn about hidden virtual functions that are not overridden in t.
2835 We know that constructors and destructors don't apply. */
2838 warn_hidden (tree t
)
2840 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2844 /* We go through each separately named virtual function. */
2845 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2846 vec_safe_iterate (method_vec
, i
, &fns
);
2856 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2857 have the same name. Figure out what name that is. */
2858 name
= DECL_NAME (OVL_CURRENT (fns
));
2859 /* There are no possibly hidden functions yet. */
2860 auto_vec
<tree
, 20> base_fndecls
;
2861 /* Iterate through all of the base classes looking for possibly
2862 hidden functions. */
2863 for (binfo
= TYPE_BINFO (t
), j
= 0;
2864 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2866 tree basetype
= BINFO_TYPE (base_binfo
);
2867 get_basefndecls (name
, basetype
, &base_fndecls
);
2870 /* If there are no functions to hide, continue. */
2871 if (base_fndecls
.is_empty ())
2874 /* Remove any overridden functions. */
2875 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2877 fndecl
= OVL_CURRENT (fn
);
2878 if (TREE_CODE (fndecl
) == FUNCTION_DECL
2879 && DECL_VINDEX (fndecl
))
2881 /* If the method from the base class has the same
2882 signature as the method from the derived class, it
2883 has been overridden. */
2884 for (size_t k
= 0; k
< base_fndecls
.length (); k
++)
2886 && same_signature_p (fndecl
, base_fndecls
[k
]))
2887 base_fndecls
[k
] = NULL_TREE
;
2891 /* Now give a warning for all base functions without overriders,
2892 as they are hidden. */
2895 FOR_EACH_VEC_ELT (base_fndecls
, k
, base_fndecl
)
2898 /* Here we know it is a hider, and no overrider exists. */
2899 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", base_fndecl
);
2900 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2905 /* Recursive helper for finish_struct_anon. */
2908 finish_struct_anon_r (tree field
, bool complain
)
2910 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2911 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2912 for (; elt
; elt
= DECL_CHAIN (elt
))
2914 /* We're generally only interested in entities the user
2915 declared, but we also find nested classes by noticing
2916 the TYPE_DECL that we create implicitly. You're
2917 allowed to put one anonymous union inside another,
2918 though, so we explicitly tolerate that. We use
2919 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2920 we also allow unnamed types used for defining fields. */
2921 if (DECL_ARTIFICIAL (elt
)
2922 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2923 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2926 if (TREE_CODE (elt
) != FIELD_DECL
)
2928 /* We already complained about static data members in
2929 finish_static_data_member_decl. */
2930 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2933 permerror (input_location
,
2934 "%q+#D invalid; an anonymous union can "
2935 "only have non-static data members", elt
);
2937 permerror (input_location
,
2938 "%q+#D invalid; an anonymous struct can "
2939 "only have non-static data members", elt
);
2946 if (TREE_PRIVATE (elt
))
2949 permerror (input_location
,
2950 "private member %q+#D in anonymous union", elt
);
2952 permerror (input_location
,
2953 "private member %q+#D in anonymous struct", elt
);
2955 else if (TREE_PROTECTED (elt
))
2958 permerror (input_location
,
2959 "protected member %q+#D in anonymous union", elt
);
2961 permerror (input_location
,
2962 "protected member %q+#D in anonymous struct", elt
);
2966 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2967 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2969 /* Recurse into the anonymous aggregates to handle correctly
2970 access control (c++/24926):
2981 if (DECL_NAME (elt
) == NULL_TREE
2982 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2983 finish_struct_anon_r (elt
, /*complain=*/false);
2987 /* Check for things that are invalid. There are probably plenty of other
2988 things we should check for also. */
2991 finish_struct_anon (tree t
)
2993 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2995 if (TREE_STATIC (field
))
2997 if (TREE_CODE (field
) != FIELD_DECL
)
3000 if (DECL_NAME (field
) == NULL_TREE
3001 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
3002 finish_struct_anon_r (field
, /*complain=*/true);
3006 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
3007 will be used later during class template instantiation.
3008 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
3009 a non-static member data (FIELD_DECL), a member function
3010 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
3011 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
3012 When FRIEND_P is nonzero, T is either a friend class
3013 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
3014 (FUNCTION_DECL, TEMPLATE_DECL). */
3017 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
3019 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3020 if (CLASSTYPE_TEMPLATE_INFO (type
))
3021 CLASSTYPE_DECL_LIST (type
)
3022 = tree_cons (friend_p
? NULL_TREE
: type
,
3023 t
, CLASSTYPE_DECL_LIST (type
));
3026 /* This function is called from declare_virt_assop_and_dtor via
3029 DATA is a type that direcly or indirectly inherits the base
3030 represented by BINFO. If BINFO contains a virtual assignment [copy
3031 assignment or move assigment] operator or a virtual constructor,
3032 declare that function in DATA if it hasn't been already declared. */
3035 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
3037 tree bv
, fn
, t
= (tree
)data
;
3038 tree opname
= ansi_assopname (NOP_EXPR
);
3040 gcc_assert (t
&& CLASS_TYPE_P (t
));
3041 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
3043 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
3044 /* A base without a vtable needs no modification, and its bases
3045 are uninteresting. */
3046 return dfs_skip_bases
;
3048 if (BINFO_PRIMARY_P (binfo
))
3049 /* If this is a primary base, then we have already looked at the
3050 virtual functions of its vtable. */
3053 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3057 if (DECL_NAME (fn
) == opname
)
3059 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3060 lazily_declare_fn (sfk_copy_assignment
, t
);
3061 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3062 lazily_declare_fn (sfk_move_assignment
, t
);
3064 else if (DECL_DESTRUCTOR_P (fn
)
3065 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3066 lazily_declare_fn (sfk_destructor
, t
);
3072 /* If the class type T has a direct or indirect base that contains a
3073 virtual assignment operator or a virtual destructor, declare that
3074 function in T if it hasn't been already declared. */
3077 declare_virt_assop_and_dtor (tree t
)
3079 if (!(TYPE_POLYMORPHIC_P (t
)
3080 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3081 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3082 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3085 dfs_walk_all (TYPE_BINFO (t
),
3086 dfs_declare_virt_assop_and_dtor
,
3090 /* Declare the inheriting constructor for class T inherited from base
3091 constructor CTOR with the parameter array PARMS of size NPARMS. */
3094 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3096 /* We don't declare an inheriting ctor that would be a default,
3097 copy or move ctor for derived or base. */
3101 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3103 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3104 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3108 tree parmlist
= void_list_node
;
3109 for (int i
= nparms
- 1; i
>= 0; i
--)
3110 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3111 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3112 t
, false, ctor
, parmlist
);
3113 if (add_method (t
, fn
, NULL_TREE
))
3115 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3116 TYPE_METHODS (t
) = fn
;
3120 /* Declare all the inheriting constructors for class T inherited from base
3121 constructor CTOR. */
3124 one_inherited_ctor (tree ctor
, tree t
)
3126 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3128 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3130 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3132 if (TREE_PURPOSE (parms
))
3133 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3134 new_parms
[i
++] = TREE_VALUE (parms
);
3136 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3137 if (parms
== NULL_TREE
)
3139 if (warning (OPT_Winherited_variadic_ctor
,
3140 "the ellipsis in %qD is not inherited", ctor
))
3141 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3145 /* Create default constructors, assignment operators, and so forth for
3146 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3147 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3148 the class cannot have a default constructor, copy constructor
3149 taking a const reference argument, or an assignment operator taking
3150 a const reference, respectively. */
3153 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3154 int cant_have_const_cctor
,
3155 int cant_have_const_assignment
)
3157 bool move_ok
= false;
3159 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3160 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3161 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3165 if (!CLASSTYPE_DESTRUCTORS (t
))
3167 /* In general, we create destructors lazily. */
3168 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3170 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3171 && TYPE_FOR_JAVA (t
))
3172 /* But if this is a Java class, any non-trivial destructor is
3173 invalid, even if compiler-generated. Therefore, if the
3174 destructor is non-trivial we create it now. */
3175 lazily_declare_fn (sfk_destructor
, t
);
3180 If there is no user-declared constructor for a class, a default
3181 constructor is implicitly declared. */
3182 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3184 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3185 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3186 if (cxx_dialect
>= cxx11
)
3187 TYPE_HAS_CONSTEXPR_CTOR (t
)
3188 /* This might force the declaration. */
3189 = type_has_constexpr_default_constructor (t
);
3194 If a class definition does not explicitly declare a copy
3195 constructor, one is declared implicitly. */
3196 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3198 TYPE_HAS_COPY_CTOR (t
) = 1;
3199 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3200 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3202 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3205 /* If there is no assignment operator, one will be created if and
3206 when it is needed. For now, just record whether or not the type
3207 of the parameter to the assignment operator will be a const or
3208 non-const reference. */
3209 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3211 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3212 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3213 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3214 if (move_ok
&& !LAMBDA_TYPE_P (t
))
3215 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3218 /* We can't be lazy about declaring functions that might override
3219 a virtual function from a base class. */
3220 declare_virt_assop_and_dtor (t
);
3222 while (*access_decls
)
3224 tree using_decl
= TREE_VALUE (*access_decls
);
3225 tree decl
= USING_DECL_DECLS (using_decl
);
3226 if (DECL_NAME (using_decl
) == ctor_identifier
)
3228 /* declare, then remove the decl */
3229 tree ctor_list
= decl
;
3230 location_t loc
= input_location
;
3231 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3233 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3234 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3235 *access_decls
= TREE_CHAIN (*access_decls
);
3236 input_location
= loc
;
3239 access_decls
= &TREE_CHAIN (*access_decls
);
3243 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3244 count the number of fields in TYPE, including anonymous union
3248 count_fields (tree fields
)
3252 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3254 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3255 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3262 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3263 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3264 elts, starting at offset IDX. */
3267 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3270 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3272 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3273 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3275 field_vec
->elts
[idx
++] = x
;
3280 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3281 starting at offset IDX. */
3284 add_enum_fields_to_record_type (tree enumtype
,
3285 struct sorted_fields_type
*field_vec
,
3289 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3290 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3294 /* FIELD is a bit-field. We are finishing the processing for its
3295 enclosing type. Issue any appropriate messages and set appropriate
3296 flags. Returns false if an error has been diagnosed. */
3299 check_bitfield_decl (tree field
)
3301 tree type
= TREE_TYPE (field
);
3304 /* Extract the declared width of the bitfield, which has been
3305 temporarily stashed in DECL_INITIAL. */
3306 w
= DECL_INITIAL (field
);
3307 gcc_assert (w
!= NULL_TREE
);
3308 /* Remove the bit-field width indicator so that the rest of the
3309 compiler does not treat that value as an initializer. */
3310 DECL_INITIAL (field
) = NULL_TREE
;
3312 /* Detect invalid bit-field type. */
3313 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3315 error ("bit-field %q+#D with non-integral type", field
);
3316 w
= error_mark_node
;
3320 location_t loc
= input_location
;
3321 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3324 /* detect invalid field size. */
3325 input_location
= DECL_SOURCE_LOCATION (field
);
3326 w
= cxx_constant_value (w
);
3327 input_location
= loc
;
3329 if (TREE_CODE (w
) != INTEGER_CST
)
3331 error ("bit-field %q+D width not an integer constant", field
);
3332 w
= error_mark_node
;
3334 else if (tree_int_cst_sgn (w
) < 0)
3336 error ("negative width in bit-field %q+D", field
);
3337 w
= error_mark_node
;
3339 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3341 error ("zero width for bit-field %q+D", field
);
3342 w
= error_mark_node
;
3344 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3345 && TREE_CODE (type
) != BOOLEAN_TYPE
3346 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3347 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3348 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3349 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3350 warning (0, "width of %q+D exceeds its type", field
);
3351 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3352 && (0 > (compare_tree_int
3353 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3354 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3357 if (w
!= error_mark_node
)
3359 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3360 DECL_BIT_FIELD (field
) = 1;
3365 /* Non-bit-fields are aligned for their type. */
3366 DECL_BIT_FIELD (field
) = 0;
3367 CLEAR_DECL_C_BIT_FIELD (field
);
3372 /* FIELD is a non bit-field. We are finishing the processing for its
3373 enclosing type T. Issue any appropriate messages and set appropriate
3377 check_field_decl (tree field
,
3379 int* cant_have_const_ctor
,
3380 int* no_const_asn_ref
,
3381 int* any_default_members
)
3383 tree type
= strip_array_types (TREE_TYPE (field
));
3385 /* In C++98 an anonymous union cannot contain any fields which would change
3386 the settings of CANT_HAVE_CONST_CTOR and friends. */
3387 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3389 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3390 structs. So, we recurse through their fields here. */
3391 else if (ANON_AGGR_TYPE_P (type
))
3395 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3396 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3397 check_field_decl (fields
, t
, cant_have_const_ctor
,
3398 no_const_asn_ref
, any_default_members
);
3400 /* Check members with class type for constructors, destructors,
3402 else if (CLASS_TYPE_P (type
))
3404 /* Never let anything with uninheritable virtuals
3405 make it through without complaint. */
3406 abstract_virtuals_error (field
, type
);
3408 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3411 int oldcount
= errorcount
;
3412 if (TYPE_NEEDS_CONSTRUCTING (type
))
3413 error ("member %q+#D with constructor not allowed in union",
3415 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3416 error ("member %q+#D with destructor not allowed in union", field
);
3417 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3418 error ("member %q+#D with copy assignment operator not allowed in union",
3420 if (!warned
&& errorcount
> oldcount
)
3422 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3423 "only available with -std=c++11 or -std=gnu++11");
3429 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3430 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3431 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3432 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3433 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3434 || !TYPE_HAS_COPY_ASSIGN (type
));
3435 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3436 || !TYPE_HAS_COPY_CTOR (type
));
3437 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3438 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3439 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3440 || TYPE_HAS_COMPLEX_DFLT (type
));
3443 if (TYPE_HAS_COPY_CTOR (type
)
3444 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3445 *cant_have_const_ctor
= 1;
3447 if (TYPE_HAS_COPY_ASSIGN (type
)
3448 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3449 *no_const_asn_ref
= 1;
3452 check_abi_tags (t
, field
);
3454 if (DECL_INITIAL (field
) != NULL_TREE
)
3456 /* `build_class_init_list' does not recognize
3458 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3459 error ("multiple fields in union %qT initialized", t
);
3460 *any_default_members
= 1;
3464 /* Check the data members (both static and non-static), class-scoped
3465 typedefs, etc., appearing in the declaration of T. Issue
3466 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3467 declaration order) of access declarations; each TREE_VALUE in this
3468 list is a USING_DECL.
3470 In addition, set the following flags:
3473 The class is empty, i.e., contains no non-static data members.
3475 CANT_HAVE_CONST_CTOR_P
3476 This class cannot have an implicitly generated copy constructor
3477 taking a const reference.
3479 CANT_HAVE_CONST_ASN_REF
3480 This class cannot have an implicitly generated assignment
3481 operator taking a const reference.
3483 All of these flags should be initialized before calling this
3486 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3487 fields can be added by adding to this chain. */
3490 check_field_decls (tree t
, tree
*access_decls
,
3491 int *cant_have_const_ctor_p
,
3492 int *no_const_asn_ref_p
)
3497 int any_default_members
;
3499 int field_access
= -1;
3501 /* Assume there are no access declarations. */
3502 *access_decls
= NULL_TREE
;
3503 /* Assume this class has no pointer members. */
3504 has_pointers
= false;
3505 /* Assume none of the members of this class have default
3507 any_default_members
= 0;
3509 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3512 tree type
= TREE_TYPE (x
);
3513 int this_field_access
;
3515 next
= &DECL_CHAIN (x
);
3517 if (TREE_CODE (x
) == USING_DECL
)
3519 /* Save the access declarations for our caller. */
3520 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3524 if (TREE_CODE (x
) == TYPE_DECL
3525 || TREE_CODE (x
) == TEMPLATE_DECL
)
3528 /* If we've gotten this far, it's a data member, possibly static,
3529 or an enumerator. */
3530 if (TREE_CODE (x
) != CONST_DECL
)
3531 DECL_CONTEXT (x
) = t
;
3533 /* When this goes into scope, it will be a non-local reference. */
3534 DECL_NONLOCAL (x
) = 1;
3536 if (TREE_CODE (t
) == UNION_TYPE
3537 && cxx_dialect
< cxx11
)
3539 /* [class.union] (C++98)
3541 If a union contains a static data member, or a member of
3542 reference type, the program is ill-formed.
3544 In C++11 this limitation doesn't exist anymore. */
3547 error ("in C++98 %q+D may not be static because it is "
3548 "a member of a union", x
);
3551 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3553 error ("in C++98 %q+D may not have reference type %qT "
3554 "because it is a member of a union", x
, type
);
3559 /* Perform error checking that did not get done in
3561 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3563 error ("field %q+D invalidly declared function type", x
);
3564 type
= build_pointer_type (type
);
3565 TREE_TYPE (x
) = type
;
3567 else if (TREE_CODE (type
) == METHOD_TYPE
)
3569 error ("field %q+D invalidly declared method type", x
);
3570 type
= build_pointer_type (type
);
3571 TREE_TYPE (x
) = type
;
3574 if (type
== error_mark_node
)
3577 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3580 /* Now it can only be a FIELD_DECL. */
3582 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3583 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3585 /* If at least one non-static data member is non-literal, the whole
3586 class becomes non-literal. Per Core/1453, volatile non-static
3587 data members and base classes are also not allowed.
3588 Note: if the type is incomplete we will complain later on. */
3589 if (COMPLETE_TYPE_P (type
)
3590 && (!literal_type_p (type
) || CP_TYPE_VOLATILE_P (type
)))
3591 CLASSTYPE_LITERAL_P (t
) = false;
3593 /* A standard-layout class is a class that:
3595 has the same access control (Clause 11) for all non-static data members,
3597 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3598 if (field_access
== -1)
3599 field_access
= this_field_access
;
3600 else if (this_field_access
!= field_access
)
3601 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3603 /* If this is of reference type, check if it needs an init. */
3604 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3606 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3607 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3608 if (DECL_INITIAL (x
) == NULL_TREE
)
3609 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3611 /* ARM $12.6.2: [A member initializer list] (or, for an
3612 aggregate, initialization by a brace-enclosed list) is the
3613 only way to initialize nonstatic const and reference
3615 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3616 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3619 type
= strip_array_types (type
);
3621 if (TYPE_PACKED (t
))
3623 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3627 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3631 else if (DECL_C_BIT_FIELD (x
)
3632 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3633 DECL_PACKED (x
) = 1;
3636 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3637 /* We don't treat zero-width bitfields as making a class
3642 /* The class is non-empty. */
3643 CLASSTYPE_EMPTY_P (t
) = 0;
3644 /* The class is not even nearly empty. */
3645 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3646 /* If one of the data members contains an empty class,
3648 if (CLASS_TYPE_P (type
)
3649 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3650 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3653 /* This is used by -Weffc++ (see below). Warn only for pointers
3654 to members which might hold dynamic memory. So do not warn
3655 for pointers to functions or pointers to members. */
3656 if (TYPE_PTR_P (type
)
3657 && !TYPE_PTRFN_P (type
))
3658 has_pointers
= true;
3660 if (CLASS_TYPE_P (type
))
3662 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3663 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3664 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3665 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3668 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3669 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3671 if (DECL_MUTABLE_P (x
))
3673 if (CP_TYPE_CONST_P (type
))
3675 error ("member %q+D cannot be declared both %<const%> "
3676 "and %<mutable%>", x
);
3679 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3681 error ("member %q+D cannot be declared as a %<mutable%> "
3687 if (! layout_pod_type_p (type
))
3688 /* DR 148 now allows pointers to members (which are POD themselves),
3689 to be allowed in POD structs. */
3690 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3692 if (!std_layout_type_p (type
))
3693 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3695 if (! zero_init_p (type
))
3696 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3698 /* We set DECL_C_BIT_FIELD in grokbitfield.
3699 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3700 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3701 check_field_decl (x
, t
,
3702 cant_have_const_ctor_p
,
3704 &any_default_members
);
3706 /* Now that we've removed bit-field widths from DECL_INITIAL,
3707 anything left in DECL_INITIAL is an NSDMI that makes the class
3708 non-aggregate in C++11. */
3709 if (DECL_INITIAL (x
) && cxx_dialect
< cxx14
)
3710 CLASSTYPE_NON_AGGREGATE (t
) = true;
3712 /* If any field is const, the structure type is pseudo-const. */
3713 if (CP_TYPE_CONST_P (type
))
3715 C_TYPE_FIELDS_READONLY (t
) = 1;
3716 if (DECL_INITIAL (x
) == NULL_TREE
)
3717 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3719 /* ARM $12.6.2: [A member initializer list] (or, for an
3720 aggregate, initialization by a brace-enclosed list) is the
3721 only way to initialize nonstatic const and reference
3723 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3724 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3726 /* A field that is pseudo-const makes the structure likewise. */
3727 else if (CLASS_TYPE_P (type
))
3729 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3730 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3731 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3732 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3735 /* Core issue 80: A nonstatic data member is required to have a
3736 different name from the class iff the class has a
3737 user-declared constructor. */
3738 if (constructor_name_p (DECL_NAME (x
), t
)
3739 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3740 permerror (input_location
, "field %q+#D with same name as class", x
);
3743 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3744 it should also define a copy constructor and an assignment operator to
3745 implement the correct copy semantic (deep vs shallow, etc.). As it is
3746 not feasible to check whether the constructors do allocate dynamic memory
3747 and store it within members, we approximate the warning like this:
3749 -- Warn only if there are members which are pointers
3750 -- Warn only if there is a non-trivial constructor (otherwise,
3751 there cannot be memory allocated).
3752 -- Warn only if there is a non-trivial destructor. We assume that the
3753 user at least implemented the cleanup correctly, and a destructor
3754 is needed to free dynamic memory.
3756 This seems enough for practical purposes. */
3759 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3760 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3761 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3763 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3765 if (! TYPE_HAS_COPY_CTOR (t
))
3767 warning (OPT_Weffc__
,
3768 " but does not override %<%T(const %T&)%>", t
, t
);
3769 if (!TYPE_HAS_COPY_ASSIGN (t
))
3770 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3772 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3773 warning (OPT_Weffc__
,
3774 " but does not override %<operator=(const %T&)%>", t
);
3777 /* Non-static data member initializers make the default constructor
3779 if (any_default_members
)
3781 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3782 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3785 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3787 TYPE_PACKED (t
) = 0;
3789 /* Check anonymous struct/anonymous union fields. */
3790 finish_struct_anon (t
);
3792 /* We've built up the list of access declarations in reverse order.
3794 *access_decls
= nreverse (*access_decls
);
3797 /* If TYPE is an empty class type, records its OFFSET in the table of
3801 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3805 if (!is_empty_class (type
))
3808 /* Record the location of this empty object in OFFSETS. */
3809 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3811 n
= splay_tree_insert (offsets
,
3812 (splay_tree_key
) offset
,
3813 (splay_tree_value
) NULL_TREE
);
3814 n
->value
= ((splay_tree_value
)
3815 tree_cons (NULL_TREE
,
3822 /* Returns nonzero if TYPE is an empty class type and there is
3823 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3826 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3831 if (!is_empty_class (type
))
3834 /* Record the location of this empty object in OFFSETS. */
3835 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3839 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3840 if (same_type_p (TREE_VALUE (t
), type
))
3846 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3847 F for every subobject, passing it the type, offset, and table of
3848 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3851 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3852 than MAX_OFFSET will not be walked.
3854 If F returns a nonzero value, the traversal ceases, and that value
3855 is returned. Otherwise, returns zero. */
3858 walk_subobject_offsets (tree type
,
3859 subobject_offset_fn f
,
3866 tree type_binfo
= NULL_TREE
;
3868 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3870 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3873 if (type
== error_mark_node
)
3879 type
= BINFO_TYPE (type
);
3882 if (CLASS_TYPE_P (type
))
3888 /* Avoid recursing into objects that are not interesting. */
3889 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3892 /* Record the location of TYPE. */
3893 r
= (*f
) (type
, offset
, offsets
);
3897 /* Iterate through the direct base classes of TYPE. */
3899 type_binfo
= TYPE_BINFO (type
);
3900 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3904 if (BINFO_VIRTUAL_P (binfo
))
3908 /* We cannot rely on BINFO_OFFSET being set for the base
3909 class yet, but the offsets for direct non-virtual
3910 bases can be calculated by going back to the TYPE. */
3911 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3912 binfo_offset
= size_binop (PLUS_EXPR
,
3914 BINFO_OFFSET (orig_binfo
));
3916 r
= walk_subobject_offsets (binfo
,
3926 if (CLASSTYPE_VBASECLASSES (type
))
3929 vec
<tree
, va_gc
> *vbases
;
3931 /* Iterate through the virtual base classes of TYPE. In G++
3932 3.2, we included virtual bases in the direct base class
3933 loop above, which results in incorrect results; the
3934 correct offsets for virtual bases are only known when
3935 working with the most derived type. */
3937 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3938 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3940 r
= walk_subobject_offsets (binfo
,
3942 size_binop (PLUS_EXPR
,
3944 BINFO_OFFSET (binfo
)),
3953 /* We still have to walk the primary base, if it is
3954 virtual. (If it is non-virtual, then it was walked
3956 tree vbase
= get_primary_binfo (type_binfo
);
3958 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3959 && BINFO_PRIMARY_P (vbase
)
3960 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3962 r
= (walk_subobject_offsets
3964 offsets
, max_offset
, /*vbases_p=*/0));
3971 /* Iterate through the fields of TYPE. */
3972 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3973 if (TREE_CODE (field
) == FIELD_DECL
3974 && TREE_TYPE (field
) != error_mark_node
3975 && !DECL_ARTIFICIAL (field
))
3979 field_offset
= byte_position (field
);
3981 r
= walk_subobject_offsets (TREE_TYPE (field
),
3983 size_binop (PLUS_EXPR
,
3993 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3995 tree element_type
= strip_array_types (type
);
3996 tree domain
= TYPE_DOMAIN (type
);
3999 /* Avoid recursing into objects that are not interesting. */
4000 if (!CLASS_TYPE_P (element_type
)
4001 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
4004 /* Step through each of the elements in the array. */
4005 for (index
= size_zero_node
;
4006 !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
);
4007 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
4009 r
= walk_subobject_offsets (TREE_TYPE (type
),
4017 offset
= size_binop (PLUS_EXPR
, offset
,
4018 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
4019 /* If this new OFFSET is bigger than the MAX_OFFSET, then
4020 there's no point in iterating through the remaining
4021 elements of the array. */
4022 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
4030 /* Record all of the empty subobjects of TYPE (either a type or a
4031 binfo). If IS_DATA_MEMBER is true, then a non-static data member
4032 is being placed at OFFSET; otherwise, it is a base class that is
4033 being placed at OFFSET. */
4036 record_subobject_offsets (tree type
,
4039 bool is_data_member
)
4042 /* If recording subobjects for a non-static data member or a
4043 non-empty base class , we do not need to record offsets beyond
4044 the size of the biggest empty class. Additional data members
4045 will go at the end of the class. Additional base classes will go
4046 either at offset zero (if empty, in which case they cannot
4047 overlap with offsets past the size of the biggest empty class) or
4048 at the end of the class.
4050 However, if we are placing an empty base class, then we must record
4051 all offsets, as either the empty class is at offset zero (where
4052 other empty classes might later be placed) or at the end of the
4053 class (where other objects might then be placed, so other empty
4054 subobjects might later overlap). */
4056 || !is_empty_class (BINFO_TYPE (type
)))
4057 max_offset
= sizeof_biggest_empty_class
;
4059 max_offset
= NULL_TREE
;
4060 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4061 offsets
, max_offset
, is_data_member
);
4064 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4065 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4066 virtual bases of TYPE are examined. */
4069 layout_conflict_p (tree type
,
4074 splay_tree_node max_node
;
4076 /* Get the node in OFFSETS that indicates the maximum offset where
4077 an empty subobject is located. */
4078 max_node
= splay_tree_max (offsets
);
4079 /* If there aren't any empty subobjects, then there's no point in
4080 performing this check. */
4084 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4085 offsets
, (tree
) (max_node
->key
),
4089 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4090 non-static data member of the type indicated by RLI. BINFO is the
4091 binfo corresponding to the base subobject, OFFSETS maps offsets to
4092 types already located at those offsets. This function determines
4093 the position of the DECL. */
4096 layout_nonempty_base_or_field (record_layout_info rli
,
4101 tree offset
= NULL_TREE
;
4107 /* For the purposes of determining layout conflicts, we want to
4108 use the class type of BINFO; TREE_TYPE (DECL) will be the
4109 CLASSTYPE_AS_BASE version, which does not contain entries for
4110 zero-sized bases. */
4111 type
= TREE_TYPE (binfo
);
4116 type
= TREE_TYPE (decl
);
4120 /* Try to place the field. It may take more than one try if we have
4121 a hard time placing the field without putting two objects of the
4122 same type at the same address. */
4125 struct record_layout_info_s old_rli
= *rli
;
4127 /* Place this field. */
4128 place_field (rli
, decl
);
4129 offset
= byte_position (decl
);
4131 /* We have to check to see whether or not there is already
4132 something of the same type at the offset we're about to use.
4133 For example, consider:
4136 struct T : public S { int i; };
4137 struct U : public S, public T {};
4139 Here, we put S at offset zero in U. Then, we can't put T at
4140 offset zero -- its S component would be at the same address
4141 as the S we already allocated. So, we have to skip ahead.
4142 Since all data members, including those whose type is an
4143 empty class, have nonzero size, any overlap can happen only
4144 with a direct or indirect base-class -- it can't happen with
4146 /* In a union, overlap is permitted; all members are placed at
4148 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4150 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4153 /* Strip off the size allocated to this field. That puts us
4154 at the first place we could have put the field with
4155 proper alignment. */
4158 /* Bump up by the alignment required for the type. */
4160 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4162 ? CLASSTYPE_ALIGN (type
)
4163 : TYPE_ALIGN (type
)));
4164 normalize_rli (rli
);
4167 /* There was no conflict. We're done laying out this field. */
4171 /* Now that we know where it will be placed, update its
4173 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4174 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4175 this point because their BINFO_OFFSET is copied from another
4176 hierarchy. Therefore, we may not need to add the entire
4178 propagate_binfo_offsets (binfo
,
4179 size_diffop_loc (input_location
,
4180 convert (ssizetype
, offset
),
4182 BINFO_OFFSET (binfo
))));
4185 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4188 empty_base_at_nonzero_offset_p (tree type
,
4190 splay_tree
/*offsets*/)
4192 return is_empty_class (type
) && !integer_zerop (offset
);
4195 /* Layout the empty base BINFO. EOC indicates the byte currently just
4196 past the end of the class, and should be correctly aligned for a
4197 class of the type indicated by BINFO; OFFSETS gives the offsets of
4198 the empty bases allocated so far. T is the most derived
4199 type. Return nonzero iff we added it at the end. */
4202 layout_empty_base (record_layout_info rli
, tree binfo
,
4203 tree eoc
, splay_tree offsets
)
4206 tree basetype
= BINFO_TYPE (binfo
);
4209 /* This routine should only be used for empty classes. */
4210 gcc_assert (is_empty_class (basetype
));
4211 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4213 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4214 propagate_binfo_offsets
4215 (binfo
, size_diffop_loc (input_location
,
4216 size_zero_node
, BINFO_OFFSET (binfo
)));
4218 /* This is an empty base class. We first try to put it at offset
4220 if (layout_conflict_p (binfo
,
4221 BINFO_OFFSET (binfo
),
4225 /* That didn't work. Now, we move forward from the next
4226 available spot in the class. */
4228 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4231 if (!layout_conflict_p (binfo
,
4232 BINFO_OFFSET (binfo
),
4235 /* We finally found a spot where there's no overlap. */
4238 /* There's overlap here, too. Bump along to the next spot. */
4239 propagate_binfo_offsets (binfo
, alignment
);
4243 if (CLASSTYPE_USER_ALIGN (basetype
))
4245 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4247 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4248 TYPE_USER_ALIGN (rli
->t
) = 1;
4254 /* Layout the base given by BINFO in the class indicated by RLI.
4255 *BASE_ALIGN is a running maximum of the alignments of
4256 any base class. OFFSETS gives the location of empty base
4257 subobjects. T is the most derived type. Return nonzero if the new
4258 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4259 *NEXT_FIELD, unless BINFO is for an empty base class.
4261 Returns the location at which the next field should be inserted. */
4264 build_base_field (record_layout_info rli
, tree binfo
,
4265 splay_tree offsets
, tree
*next_field
)
4268 tree basetype
= BINFO_TYPE (binfo
);
4270 if (!COMPLETE_TYPE_P (basetype
))
4271 /* This error is now reported in xref_tag, thus giving better
4272 location information. */
4275 /* Place the base class. */
4276 if (!is_empty_class (basetype
))
4280 /* The containing class is non-empty because it has a non-empty
4282 CLASSTYPE_EMPTY_P (t
) = 0;
4284 /* Create the FIELD_DECL. */
4285 decl
= build_decl (input_location
,
4286 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4287 DECL_ARTIFICIAL (decl
) = 1;
4288 DECL_IGNORED_P (decl
) = 1;
4289 DECL_FIELD_CONTEXT (decl
) = t
;
4290 if (CLASSTYPE_AS_BASE (basetype
))
4292 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4293 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4294 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4295 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4296 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4297 DECL_FIELD_IS_BASE (decl
) = 1;
4299 /* Try to place the field. It may take more than one try if we
4300 have a hard time placing the field without putting two
4301 objects of the same type at the same address. */
4302 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4303 /* Add the new FIELD_DECL to the list of fields for T. */
4304 DECL_CHAIN (decl
) = *next_field
;
4306 next_field
= &DECL_CHAIN (decl
);
4314 /* On some platforms (ARM), even empty classes will not be
4316 eoc
= round_up_loc (input_location
,
4317 rli_size_unit_so_far (rli
),
4318 CLASSTYPE_ALIGN_UNIT (basetype
));
4319 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4320 /* A nearly-empty class "has no proper base class that is empty,
4321 not morally virtual, and at an offset other than zero." */
4322 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4325 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4326 /* The check above (used in G++ 3.2) is insufficient because
4327 an empty class placed at offset zero might itself have an
4328 empty base at a nonzero offset. */
4329 else if (walk_subobject_offsets (basetype
,
4330 empty_base_at_nonzero_offset_p
,
4333 /*max_offset=*/NULL_TREE
,
4335 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4338 /* We do not create a FIELD_DECL for empty base classes because
4339 it might overlap some other field. We want to be able to
4340 create CONSTRUCTORs for the class by iterating over the
4341 FIELD_DECLs, and the back end does not handle overlapping
4344 /* An empty virtual base causes a class to be non-empty
4345 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4346 here because that was already done when the virtual table
4347 pointer was created. */
4350 /* Record the offsets of BINFO and its base subobjects. */
4351 record_subobject_offsets (binfo
,
4352 BINFO_OFFSET (binfo
),
4354 /*is_data_member=*/false);
4359 /* Layout all of the non-virtual base classes. Record empty
4360 subobjects in OFFSETS. T is the most derived type. Return nonzero
4361 if the type cannot be nearly empty. The fields created
4362 corresponding to the base classes will be inserted at
4366 build_base_fields (record_layout_info rli
,
4367 splay_tree offsets
, tree
*next_field
)
4369 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4372 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4375 /* The primary base class is always allocated first. */
4376 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4377 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4378 offsets
, next_field
);
4380 /* Now allocate the rest of the bases. */
4381 for (i
= 0; i
< n_baseclasses
; ++i
)
4385 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4387 /* The primary base was already allocated above, so we don't
4388 need to allocate it again here. */
4389 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4392 /* Virtual bases are added at the end (a primary virtual base
4393 will have already been added). */
4394 if (BINFO_VIRTUAL_P (base_binfo
))
4397 next_field
= build_base_field (rli
, base_binfo
,
4398 offsets
, next_field
);
4402 /* Go through the TYPE_METHODS of T issuing any appropriate
4403 diagnostics, figuring out which methods override which other
4404 methods, and so forth. */
4407 check_methods (tree t
)
4411 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4413 check_for_override (x
, t
);
4414 if (DECL_PURE_VIRTUAL_P (x
) && (TREE_CODE (x
) != FUNCTION_DECL
|| ! DECL_VINDEX (x
)))
4415 error ("initializer specified for non-virtual method %q+D", x
);
4416 /* The name of the field is the original field name
4417 Save this in auxiliary field for later overloading. */
4418 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_VINDEX (x
))
4420 TYPE_POLYMORPHIC_P (t
) = 1;
4421 if (DECL_PURE_VIRTUAL_P (x
))
4422 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4424 /* All user-provided destructors are non-trivial.
4425 Constructors and assignment ops are handled in
4426 grok_special_member_properties. */
4427 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4428 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4432 /* FN is a constructor or destructor. Clone the declaration to create
4433 a specialized in-charge or not-in-charge version, as indicated by
4437 build_clone (tree fn
, tree name
)
4442 /* Copy the function. */
4443 clone
= copy_decl (fn
);
4444 /* Reset the function name. */
4445 DECL_NAME (clone
) = name
;
4446 /* Remember where this function came from. */
4447 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4448 /* Make it easy to find the CLONE given the FN. */
4449 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4450 DECL_CHAIN (fn
) = clone
;
4452 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4453 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4455 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4456 DECL_TEMPLATE_RESULT (clone
) = result
;
4457 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4458 DECL_TI_TEMPLATE (result
) = clone
;
4459 TREE_TYPE (clone
) = TREE_TYPE (result
);
4463 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4464 DECL_CLONED_FUNCTION (clone
) = fn
;
4465 /* There's no pending inline data for this function. */
4466 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4467 DECL_PENDING_INLINE_P (clone
) = 0;
4469 /* The base-class destructor is not virtual. */
4470 if (name
== base_dtor_identifier
)
4472 DECL_VIRTUAL_P (clone
) = 0;
4473 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4474 DECL_VINDEX (clone
) = NULL_TREE
;
4477 /* If there was an in-charge parameter, drop it from the function
4479 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4485 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4486 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4487 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4488 /* Skip the `this' parameter. */
4489 parmtypes
= TREE_CHAIN (parmtypes
);
4490 /* Skip the in-charge parameter. */
4491 parmtypes
= TREE_CHAIN (parmtypes
);
4492 /* And the VTT parm, in a complete [cd]tor. */
4493 if (DECL_HAS_VTT_PARM_P (fn
)
4494 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4495 parmtypes
= TREE_CHAIN (parmtypes
);
4496 /* If this is subobject constructor or destructor, add the vtt
4499 = build_method_type_directly (basetype
,
4500 TREE_TYPE (TREE_TYPE (clone
)),
4503 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4506 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4507 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4510 /* Copy the function parameters. */
4511 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4512 /* Remove the in-charge parameter. */
4513 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4515 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4516 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4517 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4519 /* And the VTT parm, in a complete [cd]tor. */
4520 if (DECL_HAS_VTT_PARM_P (fn
))
4522 if (DECL_NEEDS_VTT_PARM_P (clone
))
4523 DECL_HAS_VTT_PARM_P (clone
) = 1;
4526 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4527 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4528 DECL_HAS_VTT_PARM_P (clone
) = 0;
4532 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4534 DECL_CONTEXT (parms
) = clone
;
4535 cxx_dup_lang_specific_decl (parms
);
4538 /* Create the RTL for this function. */
4539 SET_DECL_RTL (clone
, NULL
);
4540 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4543 note_decl_for_pch (clone
);
4548 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4549 not invoke this function directly.
4551 For a non-thunk function, returns the address of the slot for storing
4552 the function it is a clone of. Otherwise returns NULL_TREE.
4554 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4555 cloned_function is unset. This is to support the separate
4556 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4557 on a template makes sense, but not the former. */
4560 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4564 decl
= STRIP_TEMPLATE (decl
);
4566 if (TREE_CODE (decl
) != FUNCTION_DECL
4567 || !DECL_LANG_SPECIFIC (decl
)
4568 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4570 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4572 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4578 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4579 if (just_testing
&& *ptr
== NULL_TREE
)
4585 /* Produce declarations for all appropriate clones of FN. If
4586 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4587 CLASTYPE_METHOD_VEC as well. */
4590 clone_function_decl (tree fn
, int update_method_vec_p
)
4594 /* Avoid inappropriate cloning. */
4596 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4599 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4601 /* For each constructor, we need two variants: an in-charge version
4602 and a not-in-charge version. */
4603 clone
= build_clone (fn
, complete_ctor_identifier
);
4604 if (update_method_vec_p
)
4605 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4606 clone
= build_clone (fn
, base_ctor_identifier
);
4607 if (update_method_vec_p
)
4608 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4612 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4614 /* For each destructor, we need three variants: an in-charge
4615 version, a not-in-charge version, and an in-charge deleting
4616 version. We clone the deleting version first because that
4617 means it will go second on the TYPE_METHODS list -- and that
4618 corresponds to the correct layout order in the virtual
4621 For a non-virtual destructor, we do not build a deleting
4623 if (DECL_VIRTUAL_P (fn
))
4625 clone
= build_clone (fn
, deleting_dtor_identifier
);
4626 if (update_method_vec_p
)
4627 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4629 clone
= build_clone (fn
, complete_dtor_identifier
);
4630 if (update_method_vec_p
)
4631 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4632 clone
= build_clone (fn
, base_dtor_identifier
);
4633 if (update_method_vec_p
)
4634 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4637 /* Note that this is an abstract function that is never emitted. */
4638 DECL_ABSTRACT_P (fn
) = true;
4641 /* DECL is an in charge constructor, which is being defined. This will
4642 have had an in class declaration, from whence clones were
4643 declared. An out-of-class definition can specify additional default
4644 arguments. As it is the clones that are involved in overload
4645 resolution, we must propagate the information from the DECL to its
4649 adjust_clone_args (tree decl
)
4653 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4654 clone
= DECL_CHAIN (clone
))
4656 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4657 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4658 tree decl_parms
, clone_parms
;
4660 clone_parms
= orig_clone_parms
;
4662 /* Skip the 'this' parameter. */
4663 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4664 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4666 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4667 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4668 if (DECL_HAS_VTT_PARM_P (decl
))
4669 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4671 clone_parms
= orig_clone_parms
;
4672 if (DECL_HAS_VTT_PARM_P (clone
))
4673 clone_parms
= TREE_CHAIN (clone_parms
);
4675 for (decl_parms
= orig_decl_parms
; decl_parms
;
4676 decl_parms
= TREE_CHAIN (decl_parms
),
4677 clone_parms
= TREE_CHAIN (clone_parms
))
4679 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4680 TREE_TYPE (clone_parms
)));
4682 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4684 /* A default parameter has been added. Adjust the
4685 clone's parameters. */
4686 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4687 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4688 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4691 clone_parms
= orig_decl_parms
;
4693 if (DECL_HAS_VTT_PARM_P (clone
))
4695 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4696 TREE_VALUE (orig_clone_parms
),
4698 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4700 type
= build_method_type_directly (basetype
,
4701 TREE_TYPE (TREE_TYPE (clone
)),
4704 type
= build_exception_variant (type
, exceptions
);
4706 type
= cp_build_type_attribute_variant (type
, attrs
);
4707 TREE_TYPE (clone
) = type
;
4709 clone_parms
= NULL_TREE
;
4713 gcc_assert (!clone_parms
);
4717 /* For each of the constructors and destructors in T, create an
4718 in-charge and not-in-charge variant. */
4721 clone_constructors_and_destructors (tree t
)
4725 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4727 if (!CLASSTYPE_METHOD_VEC (t
))
4730 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4731 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4732 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4733 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4736 /* Deduce noexcept for a destructor DTOR. */
4739 deduce_noexcept_on_destructor (tree dtor
)
4741 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4743 tree eh_spec
= unevaluated_noexcept_spec ();
4744 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4748 /* For each destructor in T, deduce noexcept:
4750 12.4/3: A declaration of a destructor that does not have an
4751 exception-specification is implicitly considered to have the
4752 same exception-specification as an implicit declaration (15.4). */
4755 deduce_noexcept_on_destructors (tree t
)
4757 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4759 if (!CLASSTYPE_METHOD_VEC (t
))
4762 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4763 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4766 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4767 of TYPE for virtual functions which FNDECL overrides. Return a
4768 mask of the tm attributes found therein. */
4771 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4773 tree binfo
= TYPE_BINFO (type
);
4777 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4779 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4781 if (!TYPE_POLYMORPHIC_P (basetype
))
4784 o
= look_for_overrides_here (basetype
, fndecl
);
4786 found
|= tm_attr_to_mask (find_tm_attribute
4787 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4789 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4795 /* Subroutine of set_method_tm_attributes. Handle the checks and
4796 inheritance for one virtual method FNDECL. */
4799 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4804 found
= look_for_tm_attr_overrides (type
, fndecl
);
4806 /* If FNDECL doesn't actually override anything (i.e. T is the
4807 class that first declares FNDECL virtual), then we're done. */
4811 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4812 have
= tm_attr_to_mask (tm_attr
);
4814 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4815 tm_pure must match exactly, otherwise no weakening of
4816 tm_safe > tm_callable > nothing. */
4817 /* ??? The tm_pure attribute didn't make the transition to the
4818 multivendor language spec. */
4819 if (have
== TM_ATTR_PURE
)
4821 if (found
!= TM_ATTR_PURE
)
4827 /* If the overridden function is tm_pure, then FNDECL must be. */
4828 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4830 /* Look for base class combinations that cannot be satisfied. */
4831 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4833 found
&= ~TM_ATTR_PURE
;
4835 error_at (DECL_SOURCE_LOCATION (fndecl
),
4836 "method overrides both %<transaction_pure%> and %qE methods",
4837 tm_mask_to_attr (found
));
4839 /* If FNDECL did not declare an attribute, then inherit the most
4841 else if (tm_attr
== NULL
)
4843 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4845 /* Otherwise validate that we're not weaker than a function
4846 that is being overridden. */
4850 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4856 error_at (DECL_SOURCE_LOCATION (fndecl
),
4857 "method declared %qE overriding %qE method",
4858 tm_attr
, tm_mask_to_attr (found
));
4861 /* For each of the methods in T, propagate a class-level tm attribute. */
4864 set_method_tm_attributes (tree t
)
4866 tree class_tm_attr
, fndecl
;
4868 /* Don't bother collecting tm attributes if transactional memory
4869 support is not enabled. */
4873 /* Process virtual methods first, as they inherit directly from the
4874 base virtual function and also require validation of new attributes. */
4875 if (TYPE_CONTAINS_VPTR_P (t
))
4878 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4879 vchain
= TREE_CHAIN (vchain
))
4881 fndecl
= BV_FN (vchain
);
4882 if (DECL_THUNK_P (fndecl
))
4883 fndecl
= THUNK_TARGET (fndecl
);
4884 set_one_vmethod_tm_attributes (t
, fndecl
);
4888 /* If the class doesn't have an attribute, nothing more to do. */
4889 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4890 if (class_tm_attr
== NULL
)
4893 /* Any method that does not yet have a tm attribute inherits
4894 the one from the class. */
4895 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4897 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4898 apply_tm_attr (fndecl
, class_tm_attr
);
4902 /* Returns true iff class T has a user-defined constructor other than
4903 the default constructor. */
4906 type_has_user_nondefault_constructor (tree t
)
4910 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4913 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4915 tree fn
= OVL_CURRENT (fns
);
4916 if (!DECL_ARTIFICIAL (fn
)
4917 && (TREE_CODE (fn
) == TEMPLATE_DECL
4918 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4926 /* Returns the defaulted constructor if T has one. Otherwise, returns
4930 in_class_defaulted_default_constructor (tree t
)
4934 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4937 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4939 tree fn
= OVL_CURRENT (fns
);
4941 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4943 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4944 while (args
&& TREE_PURPOSE (args
))
4945 args
= TREE_CHAIN (args
);
4946 if (!args
|| args
== void_list_node
)
4954 /* Returns true iff FN is a user-provided function, i.e. user-declared
4955 and not defaulted at its first declaration; or explicit, private,
4956 protected, or non-const. */
4959 user_provided_p (tree fn
)
4961 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4964 return (!DECL_ARTIFICIAL (fn
)
4965 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4966 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4969 /* Returns true iff class T has a user-provided constructor. */
4972 type_has_user_provided_constructor (tree t
)
4976 if (!CLASS_TYPE_P (t
))
4979 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4982 /* This can happen in error cases; avoid crashing. */
4983 if (!CLASSTYPE_METHOD_VEC (t
))
4986 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4987 if (user_provided_p (OVL_CURRENT (fns
)))
4993 /* Returns true iff class T has a non-user-provided (i.e. implicitly
4994 declared or explicitly defaulted in the class body) default
4998 type_has_non_user_provided_default_constructor (tree t
)
5002 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (t
))
5004 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5007 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5009 tree fn
= OVL_CURRENT (fns
);
5010 if (TREE_CODE (fn
) == FUNCTION_DECL
5011 && !user_provided_p (fn
)
5012 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
5019 /* TYPE is being used as a virtual base, and has a non-trivial move
5020 assignment. Return true if this is due to there being a user-provided
5021 move assignment in TYPE or one of its subobjects; if there isn't, then
5022 multiple move assignment can't cause any harm. */
5025 vbase_has_user_provided_move_assign (tree type
)
5027 /* Does the type itself have a user-provided move assignment operator? */
5029 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
5030 fns
; fns
= OVL_NEXT (fns
))
5032 tree fn
= OVL_CURRENT (fns
);
5033 if (move_fn_p (fn
) && user_provided_p (fn
))
5037 /* Do any of its bases? */
5038 tree binfo
= TYPE_BINFO (type
);
5040 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5041 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
5044 /* Or non-static data members? */
5045 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5047 if (TREE_CODE (field
) == FIELD_DECL
5048 && CLASS_TYPE_P (TREE_TYPE (field
))
5049 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5057 /* If default-initialization leaves part of TYPE uninitialized, returns
5058 a DECL for the field or TYPE itself (DR 253). */
5061 default_init_uninitialized_part (tree type
)
5066 type
= strip_array_types (type
);
5067 if (!CLASS_TYPE_P (type
))
5069 if (!type_has_non_user_provided_default_constructor (type
))
5071 for (binfo
= TYPE_BINFO (type
), i
= 0;
5072 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5074 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5078 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5079 if (TREE_CODE (t
) == FIELD_DECL
5080 && !DECL_ARTIFICIAL (t
)
5081 && !DECL_INITIAL (t
))
5083 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5085 return DECL_P (r
) ? r
: t
;
5091 /* Returns true iff for class T, a trivial synthesized default constructor
5092 would be constexpr. */
5095 trivial_default_constructor_is_constexpr (tree t
)
5097 /* A defaulted trivial default constructor is constexpr
5098 if there is nothing to initialize. */
5099 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5100 return is_really_empty_class (t
);
5103 /* Returns true iff class T has a constexpr default constructor. */
5106 type_has_constexpr_default_constructor (tree t
)
5110 if (!CLASS_TYPE_P (t
))
5112 /* The caller should have stripped an enclosing array. */
5113 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5116 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5118 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5119 return trivial_default_constructor_is_constexpr (t
);
5120 /* Non-trivial, we need to check subobject constructors. */
5121 lazily_declare_fn (sfk_constructor
, t
);
5123 fns
= locate_ctor (t
);
5124 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5127 /* Returns true iff class TYPE has a virtual destructor. */
5130 type_has_virtual_destructor (tree type
)
5134 if (!CLASS_TYPE_P (type
))
5137 gcc_assert (COMPLETE_TYPE_P (type
));
5138 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5139 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5142 /* Returns true iff class T has a move constructor. */
5145 type_has_move_constructor (tree t
)
5149 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5151 gcc_assert (COMPLETE_TYPE_P (t
));
5152 lazily_declare_fn (sfk_move_constructor
, t
);
5155 if (!CLASSTYPE_METHOD_VEC (t
))
5158 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5159 if (move_fn_p (OVL_CURRENT (fns
)))
5165 /* Returns true iff class T has a move assignment operator. */
5168 type_has_move_assign (tree t
)
5172 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5174 gcc_assert (COMPLETE_TYPE_P (t
));
5175 lazily_declare_fn (sfk_move_assignment
, t
);
5178 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5179 fns
; fns
= OVL_NEXT (fns
))
5180 if (move_fn_p (OVL_CURRENT (fns
)))
5186 /* Returns true iff class T has a move constructor that was explicitly
5187 declared in the class body. Note that this is different from
5188 "user-provided", which doesn't include functions that are defaulted in
5192 type_has_user_declared_move_constructor (tree t
)
5196 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5199 if (!CLASSTYPE_METHOD_VEC (t
))
5202 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5204 tree fn
= OVL_CURRENT (fns
);
5205 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5212 /* Returns true iff class T has a move assignment operator that was
5213 explicitly declared in the class body. */
5216 type_has_user_declared_move_assign (tree t
)
5220 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5223 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5224 fns
; fns
= OVL_NEXT (fns
))
5226 tree fn
= OVL_CURRENT (fns
);
5227 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5234 /* Nonzero if we need to build up a constructor call when initializing an
5235 object of this class, either because it has a user-declared constructor
5236 or because it doesn't have a default constructor (so we need to give an
5237 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5238 what you care about is whether or not an object can be produced by a
5239 constructor (e.g. so we don't set TREE_READONLY on const variables of
5240 such type); use this function when what you care about is whether or not
5241 to try to call a constructor to create an object. The latter case is
5242 the former plus some cases of constructors that cannot be called. */
5245 type_build_ctor_call (tree t
)
5248 if (TYPE_NEEDS_CONSTRUCTING (t
))
5250 inner
= strip_array_types (t
);
5251 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5253 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5255 if (cxx_dialect
< cxx11
)
5257 /* A user-declared constructor might be private, and a constructor might
5258 be trivial but deleted. */
5259 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5260 fns
; fns
= OVL_NEXT (fns
))
5262 tree fn
= OVL_CURRENT (fns
);
5263 if (!DECL_ARTIFICIAL (fn
)
5264 || DECL_DELETED_FN (fn
))
5270 /* Like type_build_ctor_call, but for destructors. */
5273 type_build_dtor_call (tree t
)
5276 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5278 inner
= strip_array_types (t
);
5279 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5280 || !COMPLETE_TYPE_P (inner
))
5282 if (cxx_dialect
< cxx11
)
5284 /* A user-declared destructor might be private, and a destructor might
5285 be trivial but deleted. */
5286 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5287 fns
; fns
= OVL_NEXT (fns
))
5289 tree fn
= OVL_CURRENT (fns
);
5290 if (!DECL_ARTIFICIAL (fn
)
5291 || DECL_DELETED_FN (fn
))
5297 /* Remove all zero-width bit-fields from T. */
5300 remove_zero_width_bit_fields (tree t
)
5304 fieldsp
= &TYPE_FIELDS (t
);
5307 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5308 && DECL_C_BIT_FIELD (*fieldsp
)
5309 /* We should not be confused by the fact that grokbitfield
5310 temporarily sets the width of the bit field into
5311 DECL_INITIAL (*fieldsp).
5312 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5314 && integer_zerop (DECL_SIZE (*fieldsp
)))
5315 *fieldsp
= DECL_CHAIN (*fieldsp
);
5317 fieldsp
= &DECL_CHAIN (*fieldsp
);
5321 /* Returns TRUE iff we need a cookie when dynamically allocating an
5322 array whose elements have the indicated class TYPE. */
5325 type_requires_array_cookie (tree type
)
5328 bool has_two_argument_delete_p
= false;
5330 gcc_assert (CLASS_TYPE_P (type
));
5332 /* If there's a non-trivial destructor, we need a cookie. In order
5333 to iterate through the array calling the destructor for each
5334 element, we'll have to know how many elements there are. */
5335 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5338 /* If the usual deallocation function is a two-argument whose second
5339 argument is of type `size_t', then we have to pass the size of
5340 the array to the deallocation function, so we will need to store
5342 fns
= lookup_fnfields (TYPE_BINFO (type
),
5343 ansi_opname (VEC_DELETE_EXPR
),
5345 /* If there are no `operator []' members, or the lookup is
5346 ambiguous, then we don't need a cookie. */
5347 if (!fns
|| fns
== error_mark_node
)
5349 /* Loop through all of the functions. */
5350 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5355 /* Select the current function. */
5356 fn
= OVL_CURRENT (fns
);
5357 /* See if this function is a one-argument delete function. If
5358 it is, then it will be the usual deallocation function. */
5359 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5360 if (second_parm
== void_list_node
)
5362 /* Do not consider this function if its second argument is an
5366 /* Otherwise, if we have a two-argument function and the second
5367 argument is `size_t', it will be the usual deallocation
5368 function -- unless there is one-argument function, too. */
5369 if (TREE_CHAIN (second_parm
) == void_list_node
5370 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5371 has_two_argument_delete_p
= true;
5374 return has_two_argument_delete_p
;
5377 /* Finish computing the `literal type' property of class type T.
5379 At this point, we have already processed base classes and
5380 non-static data members. We need to check whether the copy
5381 constructor is trivial, the destructor is trivial, and there
5382 is a trivial default constructor or at least one constexpr
5383 constructor other than the copy constructor. */
5386 finalize_literal_type_property (tree t
)
5390 if (cxx_dialect
< cxx11
5391 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5392 CLASSTYPE_LITERAL_P (t
) = false;
5393 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5394 && CLASSTYPE_NON_AGGREGATE (t
)
5395 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5396 CLASSTYPE_LITERAL_P (t
) = false;
5398 if (!CLASSTYPE_LITERAL_P (t
))
5399 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5400 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5401 && TREE_CODE (fn
) != TEMPLATE_DECL
5402 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5403 && !DECL_CONSTRUCTOR_P (fn
))
5405 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5406 if (!DECL_GENERATED_P (fn
))
5408 error ("enclosing class of constexpr non-static member "
5409 "function %q+#D is not a literal type", fn
);
5410 explain_non_literal_class (t
);
5415 /* T is a non-literal type used in a context which requires a constant
5416 expression. Explain why it isn't literal. */
5419 explain_non_literal_class (tree t
)
5421 static hash_set
<tree
> *diagnosed
;
5423 if (!CLASS_TYPE_P (t
))
5425 t
= TYPE_MAIN_VARIANT (t
);
5427 if (diagnosed
== NULL
)
5428 diagnosed
= new hash_set
<tree
>;
5429 if (diagnosed
->add (t
))
5430 /* Already explained. */
5433 inform (0, "%q+T is not literal because:", t
);
5434 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5435 inform (0, " %q+T has a non-trivial destructor", t
);
5436 else if (CLASSTYPE_NON_AGGREGATE (t
)
5437 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5438 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5440 inform (0, " %q+T is not an aggregate, does not have a trivial "
5441 "default constructor, and has no constexpr constructor that "
5442 "is not a copy or move constructor", t
);
5443 if (type_has_non_user_provided_default_constructor (t
))
5445 /* Note that we can't simply call locate_ctor because when the
5446 constructor is deleted it just returns NULL_TREE. */
5448 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5450 tree fn
= OVL_CURRENT (fns
);
5451 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5453 parms
= skip_artificial_parms_for (fn
, parms
);
5455 if (sufficient_parms_p (parms
))
5457 if (DECL_DELETED_FN (fn
))
5458 maybe_explain_implicit_delete (fn
);
5460 explain_invalid_constexpr_fn (fn
);
5468 tree binfo
, base_binfo
, field
; int i
;
5469 for (binfo
= TYPE_BINFO (t
), i
= 0;
5470 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5472 tree basetype
= TREE_TYPE (base_binfo
);
5473 if (!CLASSTYPE_LITERAL_P (basetype
))
5475 inform (0, " base class %qT of %q+T is non-literal",
5477 explain_non_literal_class (basetype
);
5481 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5484 if (TREE_CODE (field
) != FIELD_DECL
)
5486 ftype
= TREE_TYPE (field
);
5487 if (!literal_type_p (ftype
))
5489 inform (0, " non-static data member %q+D has "
5490 "non-literal type", field
);
5491 if (CLASS_TYPE_P (ftype
))
5492 explain_non_literal_class (ftype
);
5494 if (CP_TYPE_VOLATILE_P (ftype
))
5495 inform (0, " non-static data member %q+D has "
5496 "volatile type", field
);
5501 /* Check the validity of the bases and members declared in T. Add any
5502 implicitly-generated functions (like copy-constructors and
5503 assignment operators). Compute various flag bits (like
5504 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5505 level: i.e., independently of the ABI in use. */
5508 check_bases_and_members (tree t
)
5510 /* Nonzero if the implicitly generated copy constructor should take
5511 a non-const reference argument. */
5512 int cant_have_const_ctor
;
5513 /* Nonzero if the implicitly generated assignment operator
5514 should take a non-const reference argument. */
5515 int no_const_asn_ref
;
5517 bool saved_complex_asn_ref
;
5518 bool saved_nontrivial_dtor
;
5521 /* By default, we use const reference arguments and generate default
5523 cant_have_const_ctor
= 0;
5524 no_const_asn_ref
= 0;
5526 /* Check all the base-classes. */
5527 check_bases (t
, &cant_have_const_ctor
,
5530 /* Deduce noexcept on destructors. This needs to happen after we've set
5531 triviality flags appropriately for our bases. */
5532 if (cxx_dialect
>= cxx11
)
5533 deduce_noexcept_on_destructors (t
);
5535 /* Check all the method declarations. */
5538 /* Save the initial values of these flags which only indicate whether
5539 or not the class has user-provided functions. As we analyze the
5540 bases and members we can set these flags for other reasons. */
5541 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5542 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5544 /* Check all the data member declarations. We cannot call
5545 check_field_decls until we have called check_bases check_methods,
5546 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5547 being set appropriately. */
5548 check_field_decls (t
, &access_decls
,
5549 &cant_have_const_ctor
,
5552 /* A nearly-empty class has to be vptr-containing; a nearly empty
5553 class contains just a vptr. */
5554 if (!TYPE_CONTAINS_VPTR_P (t
))
5555 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5557 /* Do some bookkeeping that will guide the generation of implicitly
5558 declared member functions. */
5559 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5560 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5561 /* We need to call a constructor for this class if it has a
5562 user-provided constructor, or if the default constructor is going
5563 to initialize the vptr. (This is not an if-and-only-if;
5564 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5565 themselves need constructing.) */
5566 TYPE_NEEDS_CONSTRUCTING (t
)
5567 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5570 An aggregate is an array or a class with no user-provided
5571 constructors ... and no virtual functions.
5573 Again, other conditions for being an aggregate are checked
5575 CLASSTYPE_NON_AGGREGATE (t
)
5576 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5577 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5578 retain the old definition internally for ABI reasons. */
5579 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5580 |= (CLASSTYPE_NON_AGGREGATE (t
)
5581 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5582 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5583 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5584 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5585 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5587 /* If the only explicitly declared default constructor is user-provided,
5588 set TYPE_HAS_COMPLEX_DFLT. */
5589 if (!TYPE_HAS_COMPLEX_DFLT (t
)
5590 && TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5591 && !type_has_non_user_provided_default_constructor (t
))
5592 TYPE_HAS_COMPLEX_DFLT (t
) = true;
5594 /* Warn if a public base of a polymorphic type has an accessible
5595 non-virtual destructor. It is only now that we know the class is
5596 polymorphic. Although a polymorphic base will have a already
5597 been diagnosed during its definition, we warn on use too. */
5598 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5600 tree binfo
= TYPE_BINFO (t
);
5601 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5605 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5607 tree basetype
= TREE_TYPE (base_binfo
);
5609 if ((*accesses
)[i
] == access_public_node
5610 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5611 && accessible_nvdtor_p (basetype
))
5612 warning (OPT_Wnon_virtual_dtor
,
5613 "base class %q#T has accessible non-virtual destructor",
5618 /* If the class has no user-declared constructor, but does have
5619 non-static const or reference data members that can never be
5620 initialized, issue a warning. */
5621 if (warn_uninitialized
5622 /* Classes with user-declared constructors are presumed to
5623 initialize these members. */
5624 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5625 /* Aggregates can be initialized with brace-enclosed
5627 && CLASSTYPE_NON_AGGREGATE (t
))
5631 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5635 if (TREE_CODE (field
) != FIELD_DECL
5636 || DECL_INITIAL (field
) != NULL_TREE
)
5639 type
= TREE_TYPE (field
);
5640 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5641 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5642 "in class without a constructor", field
);
5643 else if (CP_TYPE_CONST_P (type
)
5644 && (!CLASS_TYPE_P (type
)
5645 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5646 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5647 "in class without a constructor", field
);
5651 /* Synthesize any needed methods. */
5652 add_implicitly_declared_members (t
, &access_decls
,
5653 cant_have_const_ctor
,
5656 /* Check defaulted declarations here so we have cant_have_const_ctor
5657 and don't need to worry about clones. */
5658 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5659 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5661 int copy
= copy_fn_p (fn
);
5665 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5666 : !no_const_asn_ref
);
5667 bool fn_const_p
= (copy
== 2);
5669 if (fn_const_p
&& !imp_const_p
)
5670 /* If the function is defaulted outside the class, we just
5671 give the synthesis error. */
5672 error ("%q+D declared to take const reference, but implicit "
5673 "declaration would take non-const", fn
);
5675 defaulted_late_check (fn
);
5678 if (LAMBDA_TYPE_P (t
))
5680 /* "This class type is not an aggregate." */
5681 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5684 /* Compute the 'literal type' property before we
5685 do anything with non-static member functions. */
5686 finalize_literal_type_property (t
);
5688 /* Create the in-charge and not-in-charge variants of constructors
5690 clone_constructors_and_destructors (t
);
5692 /* Process the using-declarations. */
5693 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5694 handle_using_decl (TREE_VALUE (access_decls
), t
);
5696 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5697 finish_struct_methods (t
);
5699 /* Figure out whether or not we will need a cookie when dynamically
5700 allocating an array of this type. */
5701 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5702 = type_requires_array_cookie (t
);
5705 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5706 accordingly. If a new vfield was created (because T doesn't have a
5707 primary base class), then the newly created field is returned. It
5708 is not added to the TYPE_FIELDS list; it is the caller's
5709 responsibility to do that. Accumulate declared virtual functions
5713 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5717 /* Collect the virtual functions declared in T. */
5718 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5719 if (TREE_CODE (fn
) == FUNCTION_DECL
5720 && DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5721 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5723 tree new_virtual
= make_node (TREE_LIST
);
5725 BV_FN (new_virtual
) = fn
;
5726 BV_DELTA (new_virtual
) = integer_zero_node
;
5727 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5729 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5730 *virtuals_p
= new_virtual
;
5733 /* If we couldn't find an appropriate base class, create a new field
5734 here. Even if there weren't any new virtual functions, we might need a
5735 new virtual function table if we're supposed to include vptrs in
5736 all classes that need them. */
5737 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5739 /* We build this decl with vtbl_ptr_type_node, which is a
5740 `vtable_entry_type*'. It might seem more precise to use
5741 `vtable_entry_type (*)[N]' where N is the number of virtual
5742 functions. However, that would require the vtable pointer in
5743 base classes to have a different type than the vtable pointer
5744 in derived classes. We could make that happen, but that
5745 still wouldn't solve all the problems. In particular, the
5746 type-based alias analysis code would decide that assignments
5747 to the base class vtable pointer can't alias assignments to
5748 the derived class vtable pointer, since they have different
5749 types. Thus, in a derived class destructor, where the base
5750 class constructor was inlined, we could generate bad code for
5751 setting up the vtable pointer.
5753 Therefore, we use one type for all vtable pointers. We still
5754 use a type-correct type; it's just doesn't indicate the array
5755 bounds. That's better than using `void*' or some such; it's
5756 cleaner, and it let's the alias analysis code know that these
5757 stores cannot alias stores to void*! */
5760 field
= build_decl (input_location
,
5761 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5762 DECL_VIRTUAL_P (field
) = 1;
5763 DECL_ARTIFICIAL (field
) = 1;
5764 DECL_FIELD_CONTEXT (field
) = t
;
5765 DECL_FCONTEXT (field
) = t
;
5766 if (TYPE_PACKED (t
))
5767 DECL_PACKED (field
) = 1;
5769 TYPE_VFIELD (t
) = field
;
5771 /* This class is non-empty. */
5772 CLASSTYPE_EMPTY_P (t
) = 0;
5780 /* Add OFFSET to all base types of BINFO which is a base in the
5781 hierarchy dominated by T.
5783 OFFSET, which is a type offset, is number of bytes. */
5786 propagate_binfo_offsets (tree binfo
, tree offset
)
5792 /* Update BINFO's offset. */
5793 BINFO_OFFSET (binfo
)
5794 = convert (sizetype
,
5795 size_binop (PLUS_EXPR
,
5796 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5799 /* Find the primary base class. */
5800 primary_binfo
= get_primary_binfo (binfo
);
5802 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5803 propagate_binfo_offsets (primary_binfo
, offset
);
5805 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5807 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5809 /* Don't do the primary base twice. */
5810 if (base_binfo
== primary_binfo
)
5813 if (BINFO_VIRTUAL_P (base_binfo
))
5816 propagate_binfo_offsets (base_binfo
, offset
);
5820 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5821 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5822 empty subobjects of T. */
5825 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5831 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5834 /* Find the last field. The artificial fields created for virtual
5835 bases will go after the last extant field to date. */
5836 next_field
= &TYPE_FIELDS (t
);
5838 next_field
= &DECL_CHAIN (*next_field
);
5840 /* Go through the virtual bases, allocating space for each virtual
5841 base that is not already a primary base class. These are
5842 allocated in inheritance graph order. */
5843 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5845 if (!BINFO_VIRTUAL_P (vbase
))
5848 if (!BINFO_PRIMARY_P (vbase
))
5850 /* This virtual base is not a primary base of any class in the
5851 hierarchy, so we have to add space for it. */
5852 next_field
= build_base_field (rli
, vbase
,
5853 offsets
, next_field
);
5858 /* Returns the offset of the byte just past the end of the base class
5862 end_of_base (tree binfo
)
5866 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5867 size
= TYPE_SIZE_UNIT (char_type_node
);
5868 else if (is_empty_class (BINFO_TYPE (binfo
)))
5869 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5870 allocate some space for it. It cannot have virtual bases, so
5871 TYPE_SIZE_UNIT is fine. */
5872 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5874 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5876 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5879 /* Returns the offset of the byte just past the end of the base class
5880 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5881 only non-virtual bases are included. */
5884 end_of_class (tree t
, int include_virtuals_p
)
5886 tree result
= size_zero_node
;
5887 vec
<tree
, va_gc
> *vbases
;
5893 for (binfo
= TYPE_BINFO (t
), i
= 0;
5894 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5896 if (!include_virtuals_p
5897 && BINFO_VIRTUAL_P (base_binfo
)
5898 && (!BINFO_PRIMARY_P (base_binfo
)
5899 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5902 offset
= end_of_base (base_binfo
);
5903 if (tree_int_cst_lt (result
, offset
))
5907 if (include_virtuals_p
)
5908 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5909 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5911 offset
= end_of_base (base_binfo
);
5912 if (tree_int_cst_lt (result
, offset
))
5919 /* Warn about bases of T that are inaccessible because they are
5920 ambiguous. For example:
5923 struct T : public S {};
5924 struct U : public S, public T {};
5926 Here, `(S*) new U' is not allowed because there are two `S'
5930 warn_about_ambiguous_bases (tree t
)
5933 vec
<tree
, va_gc
> *vbases
;
5938 /* If there are no repeated bases, nothing can be ambiguous. */
5939 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5942 /* Check direct bases. */
5943 for (binfo
= TYPE_BINFO (t
), i
= 0;
5944 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5946 basetype
= BINFO_TYPE (base_binfo
);
5948 if (!uniquely_derived_from_p (basetype
, t
))
5949 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5953 /* Check for ambiguous virtual bases. */
5955 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5956 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5958 basetype
= BINFO_TYPE (binfo
);
5960 if (!uniquely_derived_from_p (basetype
, t
))
5961 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5962 "to ambiguity", basetype
, t
);
5966 /* Compare two INTEGER_CSTs K1 and K2. */
5969 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5971 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5974 /* Increase the size indicated in RLI to account for empty classes
5975 that are "off the end" of the class. */
5978 include_empty_classes (record_layout_info rli
)
5983 /* It might be the case that we grew the class to allocate a
5984 zero-sized base class. That won't be reflected in RLI, yet,
5985 because we are willing to overlay multiple bases at the same
5986 offset. However, now we need to make sure that RLI is big enough
5987 to reflect the entire class. */
5988 eoc
= end_of_class (rli
->t
,
5989 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5990 rli_size
= rli_size_unit_so_far (rli
);
5991 if (TREE_CODE (rli_size
) == INTEGER_CST
5992 && tree_int_cst_lt (rli_size
, eoc
))
5994 /* The size should have been rounded to a whole byte. */
5995 gcc_assert (tree_int_cst_equal
5996 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5998 = size_binop (PLUS_EXPR
,
6000 size_binop (MULT_EXPR
,
6001 convert (bitsizetype
,
6002 size_binop (MINUS_EXPR
,
6004 bitsize_int (BITS_PER_UNIT
)));
6005 normalize_rli (rli
);
6009 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6010 BINFO_OFFSETs for all of the base-classes. Position the vtable
6011 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6014 layout_class_type (tree t
, tree
*virtuals_p
)
6016 tree non_static_data_members
;
6019 record_layout_info rli
;
6020 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6021 types that appear at that offset. */
6022 splay_tree empty_base_offsets
;
6023 /* True if the last field laid out was a bit-field. */
6024 bool last_field_was_bitfield
= false;
6025 /* The location at which the next field should be inserted. */
6027 /* T, as a base class. */
6030 /* Keep track of the first non-static data member. */
6031 non_static_data_members
= TYPE_FIELDS (t
);
6033 /* Start laying out the record. */
6034 rli
= start_record_layout (t
);
6036 /* Mark all the primary bases in the hierarchy. */
6037 determine_primary_bases (t
);
6039 /* Create a pointer to our virtual function table. */
6040 vptr
= create_vtable_ptr (t
, virtuals_p
);
6042 /* The vptr is always the first thing in the class. */
6045 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6046 TYPE_FIELDS (t
) = vptr
;
6047 next_field
= &DECL_CHAIN (vptr
);
6048 place_field (rli
, vptr
);
6051 next_field
= &TYPE_FIELDS (t
);
6053 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6054 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6056 build_base_fields (rli
, empty_base_offsets
, next_field
);
6058 /* Layout the non-static data members. */
6059 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6064 /* We still pass things that aren't non-static data members to
6065 the back end, in case it wants to do something with them. */
6066 if (TREE_CODE (field
) != FIELD_DECL
)
6068 place_field (rli
, field
);
6069 /* If the static data member has incomplete type, keep track
6070 of it so that it can be completed later. (The handling
6071 of pending statics in finish_record_layout is
6072 insufficient; consider:
6075 struct S2 { static S1 s1; };
6077 At this point, finish_record_layout will be called, but
6078 S1 is still incomplete.) */
6081 maybe_register_incomplete_var (field
);
6082 /* The visibility of static data members is determined
6083 at their point of declaration, not their point of
6085 determine_visibility (field
);
6090 type
= TREE_TYPE (field
);
6091 if (type
== error_mark_node
)
6094 padding
= NULL_TREE
;
6096 /* If this field is a bit-field whose width is greater than its
6097 type, then there are some special rules for allocating
6099 if (DECL_C_BIT_FIELD (field
)
6100 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6104 bool was_unnamed_p
= false;
6105 /* We must allocate the bits as if suitably aligned for the
6106 longest integer type that fits in this many bits. type
6107 of the field. Then, we are supposed to use the left over
6108 bits as additional padding. */
6109 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6110 if (integer_types
[itk
] != NULL_TREE
6111 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6112 TYPE_SIZE (integer_types
[itk
]))
6113 || tree_int_cst_lt (DECL_SIZE (field
),
6114 TYPE_SIZE (integer_types
[itk
]))))
6117 /* ITK now indicates a type that is too large for the
6118 field. We have to back up by one to find the largest
6123 integer_type
= integer_types
[itk
];
6124 } while (itk
> 0 && integer_type
== NULL_TREE
);
6126 /* Figure out how much additional padding is required. */
6127 if (tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6129 if (TREE_CODE (t
) == UNION_TYPE
)
6130 /* In a union, the padding field must have the full width
6131 of the bit-field; all fields start at offset zero. */
6132 padding
= DECL_SIZE (field
);
6134 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6135 TYPE_SIZE (integer_type
));
6137 #ifdef PCC_BITFIELD_TYPE_MATTERS
6138 /* An unnamed bitfield does not normally affect the
6139 alignment of the containing class on a target where
6140 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6141 make any exceptions for unnamed bitfields when the
6142 bitfields are longer than their types. Therefore, we
6143 temporarily give the field a name. */
6144 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6146 was_unnamed_p
= true;
6147 DECL_NAME (field
) = make_anon_name ();
6150 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6151 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6152 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6153 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6154 empty_base_offsets
);
6156 DECL_NAME (field
) = NULL_TREE
;
6157 /* Now that layout has been performed, set the size of the
6158 field to the size of its declared type; the rest of the
6159 field is effectively invisible. */
6160 DECL_SIZE (field
) = TYPE_SIZE (type
);
6161 /* We must also reset the DECL_MODE of the field. */
6162 DECL_MODE (field
) = TYPE_MODE (type
);
6165 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6166 empty_base_offsets
);
6168 /* Remember the location of any empty classes in FIELD. */
6169 record_subobject_offsets (TREE_TYPE (field
),
6170 byte_position(field
),
6172 /*is_data_member=*/true);
6174 /* If a bit-field does not immediately follow another bit-field,
6175 and yet it starts in the middle of a byte, we have failed to
6176 comply with the ABI. */
6178 && DECL_C_BIT_FIELD (field
)
6179 /* The TREE_NO_WARNING flag gets set by Objective-C when
6180 laying out an Objective-C class. The ObjC ABI differs
6181 from the C++ ABI, and so we do not want a warning
6183 && !TREE_NO_WARNING (field
)
6184 && !last_field_was_bitfield
6185 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6186 DECL_FIELD_BIT_OFFSET (field
),
6187 bitsize_unit_node
)))
6188 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6189 "change in a future version of GCC", field
);
6191 /* The middle end uses the type of expressions to determine the
6192 possible range of expression values. In order to optimize
6193 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6194 must be made aware of the width of "i", via its type.
6196 Because C++ does not have integer types of arbitrary width,
6197 we must (for the purposes of the front end) convert from the
6198 type assigned here to the declared type of the bitfield
6199 whenever a bitfield expression is used as an rvalue.
6200 Similarly, when assigning a value to a bitfield, the value
6201 must be converted to the type given the bitfield here. */
6202 if (DECL_C_BIT_FIELD (field
))
6204 unsigned HOST_WIDE_INT width
;
6205 tree ftype
= TREE_TYPE (field
);
6206 width
= tree_to_uhwi (DECL_SIZE (field
));
6207 if (width
!= TYPE_PRECISION (ftype
))
6210 = c_build_bitfield_integer_type (width
,
6211 TYPE_UNSIGNED (ftype
));
6213 = cp_build_qualified_type (TREE_TYPE (field
),
6214 cp_type_quals (ftype
));
6218 /* If we needed additional padding after this field, add it
6224 padding_field
= build_decl (input_location
,
6228 DECL_BIT_FIELD (padding_field
) = 1;
6229 DECL_SIZE (padding_field
) = padding
;
6230 DECL_CONTEXT (padding_field
) = t
;
6231 DECL_ARTIFICIAL (padding_field
) = 1;
6232 DECL_IGNORED_P (padding_field
) = 1;
6233 layout_nonempty_base_or_field (rli
, padding_field
,
6235 empty_base_offsets
);
6238 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6241 if (!integer_zerop (rli
->bitpos
))
6243 /* Make sure that we are on a byte boundary so that the size of
6244 the class without virtual bases will always be a round number
6246 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6247 normalize_rli (rli
);
6250 /* Delete all zero-width bit-fields from the list of fields. Now
6251 that the type is laid out they are no longer important. */
6252 remove_zero_width_bit_fields (t
);
6254 /* Create the version of T used for virtual bases. We do not use
6255 make_class_type for this version; this is an artificial type. For
6256 a POD type, we just reuse T. */
6257 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6259 base_t
= make_node (TREE_CODE (t
));
6261 /* Set the size and alignment for the new type. */
6264 /* If the ABI version is not at least two, and the last
6265 field was a bit-field, RLI may not be on a byte
6266 boundary. In particular, rli_size_unit_so_far might
6267 indicate the last complete byte, while rli_size_so_far
6268 indicates the total number of bits used. Therefore,
6269 rli_size_so_far, rather than rli_size_unit_so_far, is
6270 used to compute TYPE_SIZE_UNIT. */
6271 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6272 TYPE_SIZE_UNIT (base_t
)
6273 = size_binop (MAX_EXPR
,
6275 size_binop (CEIL_DIV_EXPR
,
6276 rli_size_so_far (rli
),
6277 bitsize_int (BITS_PER_UNIT
))),
6280 = size_binop (MAX_EXPR
,
6281 rli_size_so_far (rli
),
6282 size_binop (MULT_EXPR
,
6283 convert (bitsizetype
, eoc
),
6284 bitsize_int (BITS_PER_UNIT
)));
6285 TYPE_ALIGN (base_t
) = rli
->record_align
;
6286 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6288 /* Copy the fields from T. */
6289 next_field
= &TYPE_FIELDS (base_t
);
6290 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6291 if (TREE_CODE (field
) == FIELD_DECL
)
6293 *next_field
= build_decl (input_location
,
6297 DECL_CONTEXT (*next_field
) = base_t
;
6298 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6299 DECL_FIELD_BIT_OFFSET (*next_field
)
6300 = DECL_FIELD_BIT_OFFSET (field
);
6301 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6302 DECL_MODE (*next_field
) = DECL_MODE (field
);
6303 next_field
= &DECL_CHAIN (*next_field
);
6306 /* Record the base version of the type. */
6307 CLASSTYPE_AS_BASE (t
) = base_t
;
6308 TYPE_CONTEXT (base_t
) = t
;
6311 CLASSTYPE_AS_BASE (t
) = t
;
6313 /* Every empty class contains an empty class. */
6314 if (CLASSTYPE_EMPTY_P (t
))
6315 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6317 /* Set the TYPE_DECL for this type to contain the right
6318 value for DECL_OFFSET, so that we can use it as part
6319 of a COMPONENT_REF for multiple inheritance. */
6320 layout_decl (TYPE_MAIN_DECL (t
), 0);
6322 /* Now fix up any virtual base class types that we left lying
6323 around. We must get these done before we try to lay out the
6324 virtual function table. As a side-effect, this will remove the
6325 base subobject fields. */
6326 layout_virtual_bases (rli
, empty_base_offsets
);
6328 /* Make sure that empty classes are reflected in RLI at this
6330 include_empty_classes(rli
);
6332 /* Make sure not to create any structures with zero size. */
6333 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6335 build_decl (input_location
,
6336 FIELD_DECL
, NULL_TREE
, char_type_node
));
6338 /* If this is a non-POD, declaring it packed makes a difference to how it
6339 can be used as a field; don't let finalize_record_size undo it. */
6340 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6341 rli
->packed_maybe_necessary
= true;
6343 /* Let the back end lay out the type. */
6344 finish_record_layout (rli
, /*free_p=*/true);
6346 if (TYPE_SIZE_UNIT (t
)
6347 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6348 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6349 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6350 error ("type %qT is too large", t
);
6352 /* Warn about bases that can't be talked about due to ambiguity. */
6353 warn_about_ambiguous_bases (t
);
6355 /* Now that we're done with layout, give the base fields the real types. */
6356 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6357 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6358 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6361 splay_tree_delete (empty_base_offsets
);
6363 if (CLASSTYPE_EMPTY_P (t
)
6364 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6365 TYPE_SIZE_UNIT (t
)))
6366 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6369 /* Determine the "key method" for the class type indicated by TYPE,
6370 and set CLASSTYPE_KEY_METHOD accordingly. */
6373 determine_key_method (tree type
)
6377 if (TYPE_FOR_JAVA (type
)
6378 || processing_template_decl
6379 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6380 || CLASSTYPE_INTERFACE_KNOWN (type
))
6383 /* The key method is the first non-pure virtual function that is not
6384 inline at the point of class definition. On some targets the
6385 key function may not be inline; those targets should not call
6386 this function until the end of the translation unit. */
6387 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6388 method
= DECL_CHAIN (method
))
6389 if (TREE_CODE (method
) == FUNCTION_DECL
6390 && DECL_VINDEX (method
) != NULL_TREE
6391 && ! DECL_DECLARED_INLINE_P (method
)
6392 && ! DECL_PURE_VIRTUAL_P (method
))
6394 CLASSTYPE_KEY_METHOD (type
) = method
;
6402 /* Allocate and return an instance of struct sorted_fields_type with
6405 static struct sorted_fields_type
*
6406 sorted_fields_type_new (int n
)
6408 struct sorted_fields_type
*sft
;
6409 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6410 + n
* sizeof (tree
));
6417 /* Perform processing required when the definition of T (a class type)
6421 finish_struct_1 (tree t
)
6424 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6425 tree virtuals
= NULL_TREE
;
6427 if (COMPLETE_TYPE_P (t
))
6429 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6430 error ("redefinition of %q#T", t
);
6435 /* If this type was previously laid out as a forward reference,
6436 make sure we lay it out again. */
6437 TYPE_SIZE (t
) = NULL_TREE
;
6438 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6440 /* Make assumptions about the class; we'll reset the flags if
6442 CLASSTYPE_EMPTY_P (t
) = 1;
6443 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6444 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6445 CLASSTYPE_LITERAL_P (t
) = true;
6447 /* Do end-of-class semantic processing: checking the validity of the
6448 bases and members and add implicitly generated methods. */
6449 check_bases_and_members (t
);
6451 /* Find the key method. */
6452 if (TYPE_CONTAINS_VPTR_P (t
))
6454 /* The Itanium C++ ABI permits the key method to be chosen when
6455 the class is defined -- even though the key method so
6456 selected may later turn out to be an inline function. On
6457 some systems (such as ARM Symbian OS) the key method cannot
6458 be determined until the end of the translation unit. On such
6459 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6460 will cause the class to be added to KEYED_CLASSES. Then, in
6461 finish_file we will determine the key method. */
6462 if (targetm
.cxx
.key_method_may_be_inline ())
6463 determine_key_method (t
);
6465 /* If a polymorphic class has no key method, we may emit the vtable
6466 in every translation unit where the class definition appears. If
6467 we're devirtualizing, we can look into the vtable even if we
6468 aren't emitting it. */
6469 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6470 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6473 /* Layout the class itself. */
6474 layout_class_type (t
, &virtuals
);
6475 if (CLASSTYPE_AS_BASE (t
) != t
)
6476 /* We use the base type for trivial assignments, and hence it
6478 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6480 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6482 /* If necessary, create the primary vtable for this class. */
6483 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6485 /* We must enter these virtuals into the table. */
6486 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6487 build_primary_vtable (NULL_TREE
, t
);
6488 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6489 /* Here we know enough to change the type of our virtual
6490 function table, but we will wait until later this function. */
6491 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6493 /* If we're warning about ABI tags, check the types of the new
6494 virtual functions. */
6496 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6497 check_abi_tags (t
, TREE_VALUE (v
));
6500 if (TYPE_CONTAINS_VPTR_P (t
))
6505 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6506 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6507 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6508 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6510 /* Add entries for virtual functions introduced by this class. */
6511 BINFO_VIRTUALS (TYPE_BINFO (t
))
6512 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6514 /* Set DECL_VINDEX for all functions declared in this class. */
6515 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6517 fn
= TREE_CHAIN (fn
),
6518 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6519 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6521 tree fndecl
= BV_FN (fn
);
6523 if (DECL_THUNK_P (fndecl
))
6524 /* A thunk. We should never be calling this entry directly
6525 from this vtable -- we'd use the entry for the non
6526 thunk base function. */
6527 DECL_VINDEX (fndecl
) = NULL_TREE
;
6528 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6529 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6533 finish_struct_bits (t
);
6534 set_method_tm_attributes (t
);
6536 /* Complete the rtl for any static member objects of the type we're
6538 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6539 if (VAR_P (x
) && TREE_STATIC (x
)
6540 && TREE_TYPE (x
) != error_mark_node
6541 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6542 DECL_MODE (x
) = TYPE_MODE (t
);
6544 /* Done with FIELDS...now decide whether to sort these for
6545 faster lookups later.
6547 We use a small number because most searches fail (succeeding
6548 ultimately as the search bores through the inheritance
6549 hierarchy), and we want this failure to occur quickly. */
6551 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6553 /* Complain if one of the field types requires lower visibility. */
6554 constrain_class_visibility (t
);
6556 /* Make the rtl for any new vtables we have created, and unmark
6557 the base types we marked. */
6560 /* Build the VTT for T. */
6563 /* This warning does not make sense for Java classes, since they
6564 cannot have destructors. */
6565 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6566 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
)
6567 && !CLASSTYPE_FINAL (t
))
6568 warning (OPT_Wnon_virtual_dtor
,
6569 "%q#T has virtual functions and accessible"
6570 " non-virtual destructor", t
);
6574 if (warn_overloaded_virtual
)
6577 /* Class layout, assignment of virtual table slots, etc., is now
6578 complete. Give the back end a chance to tweak the visibility of
6579 the class or perform any other required target modifications. */
6580 targetm
.cxx
.adjust_class_at_definition (t
);
6582 maybe_suppress_debug_info (t
);
6584 if (flag_vtable_verify
)
6585 vtv_save_class_info (t
);
6587 dump_class_hierarchy (t
);
6589 /* Finish debugging output for this type. */
6590 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6592 if (TYPE_TRANSPARENT_AGGR (t
))
6594 tree field
= first_field (t
);
6595 if (field
== NULL_TREE
|| error_operand_p (field
))
6597 error ("type transparent %q#T does not have any fields", t
);
6598 TYPE_TRANSPARENT_AGGR (t
) = 0;
6600 else if (DECL_ARTIFICIAL (field
))
6602 if (DECL_FIELD_IS_BASE (field
))
6603 error ("type transparent class %qT has base classes", t
);
6606 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6607 error ("type transparent class %qT has virtual functions", t
);
6609 TYPE_TRANSPARENT_AGGR (t
) = 0;
6611 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6613 error ("type transparent %q#T cannot be made transparent because "
6614 "the type of the first field has a different ABI from the "
6615 "class overall", t
);
6616 TYPE_TRANSPARENT_AGGR (t
) = 0;
6621 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6622 equal to THRESHOLD or greater than THRESHOLD. */
6625 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6627 int n_fields
= count_fields (fields
);
6628 if (n_fields
>= threshold
)
6630 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6631 add_fields_to_record_type (fields
, field_vec
, 0);
6632 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6633 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6637 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6640 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6642 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6647 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6648 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6650 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6651 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6653 add_enum_fields_to_record_type (enumtype
, field_vec
,
6654 sorted_fields
->len
);
6655 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6656 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6660 /* When T was built up, the member declarations were added in reverse
6661 order. Rearrange them to declaration order. */
6664 unreverse_member_declarations (tree t
)
6670 /* The following lists are all in reverse order. Put them in
6671 declaration order now. */
6672 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6673 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6675 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6676 reverse order, so we can't just use nreverse. */
6678 for (x
= TYPE_FIELDS (t
);
6679 x
&& TREE_CODE (x
) != TYPE_DECL
;
6682 next
= DECL_CHAIN (x
);
6683 DECL_CHAIN (x
) = prev
;
6688 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6690 TYPE_FIELDS (t
) = prev
;
6695 finish_struct (tree t
, tree attributes
)
6697 location_t saved_loc
= input_location
;
6699 /* Now that we've got all the field declarations, reverse everything
6701 unreverse_member_declarations (t
);
6703 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6705 /* Nadger the current location so that diagnostics point to the start of
6706 the struct, not the end. */
6707 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6709 if (processing_template_decl
)
6713 finish_struct_methods (t
);
6714 TYPE_SIZE (t
) = bitsize_zero_node
;
6715 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6717 /* We need to emit an error message if this type was used as a parameter
6718 and it is an abstract type, even if it is a template. We construct
6719 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6720 account and we call complete_vars with this type, which will check
6721 the PARM_DECLS. Note that while the type is being defined,
6722 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6723 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6724 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6725 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6726 if (DECL_PURE_VIRTUAL_P (x
))
6727 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6729 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6730 an enclosing scope is a template class, so that this function be
6731 found by lookup_fnfields_1 when the using declaration is not
6732 instantiated yet. */
6733 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6734 if (TREE_CODE (x
) == USING_DECL
)
6736 tree fn
= strip_using_decl (x
);
6737 if (is_overloaded_fn (fn
))
6738 for (; fn
; fn
= OVL_NEXT (fn
))
6739 add_method (t
, OVL_CURRENT (fn
), x
);
6742 /* Remember current #pragma pack value. */
6743 TYPE_PRECISION (t
) = maximum_field_alignment
;
6745 /* Fix up any variants we've already built. */
6746 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6748 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6749 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6750 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6751 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6755 finish_struct_1 (t
);
6757 if (is_std_init_list (t
))
6759 /* People keep complaining that the compiler crashes on an invalid
6760 definition of initializer_list, so I guess we should explicitly
6761 reject it. What the compiler internals care about is that it's a
6762 template and has a pointer field followed by an integer field. */
6764 if (processing_template_decl
)
6766 tree f
= next_initializable_field (TYPE_FIELDS (t
));
6767 if (f
&& TREE_CODE (TREE_TYPE (f
)) == POINTER_TYPE
)
6769 f
= next_initializable_field (DECL_CHAIN (f
));
6770 if (f
&& TREE_CODE (TREE_TYPE (f
)) == INTEGER_TYPE
)
6775 fatal_error ("definition of std::initializer_list does not match "
6776 "#include <initializer_list>");
6779 input_location
= saved_loc
;
6781 TYPE_BEING_DEFINED (t
) = 0;
6783 if (current_class_type
)
6786 error ("trying to finish struct, but kicked out due to previous parse errors");
6788 if (processing_template_decl
&& at_function_scope_p ()
6789 /* Lambdas are defined by the LAMBDA_EXPR. */
6790 && !LAMBDA_TYPE_P (t
))
6791 add_stmt (build_min (TAG_DEFN
, t
));
6796 /* Hash table to avoid endless recursion when handling references. */
6797 static hash_table
<pointer_hash
<tree_node
> > *fixed_type_or_null_ref_ht
;
6799 /* Return the dynamic type of INSTANCE, if known.
6800 Used to determine whether the virtual function table is needed
6803 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6804 of our knowledge of its type. *NONNULL should be initialized
6805 before this function is called. */
6808 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6810 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6812 switch (TREE_CODE (instance
))
6815 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6818 return RECUR (TREE_OPERAND (instance
, 0));
6821 /* This is a call to a constructor, hence it's never zero. */
6822 if (TREE_HAS_CONSTRUCTOR (instance
))
6826 return TREE_TYPE (instance
);
6831 /* This is a call to a constructor, hence it's never zero. */
6832 if (TREE_HAS_CONSTRUCTOR (instance
))
6836 return TREE_TYPE (instance
);
6838 return RECUR (TREE_OPERAND (instance
, 0));
6840 case POINTER_PLUS_EXPR
:
6843 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6844 return RECUR (TREE_OPERAND (instance
, 0));
6845 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6846 /* Propagate nonnull. */
6847 return RECUR (TREE_OPERAND (instance
, 0));
6852 return RECUR (TREE_OPERAND (instance
, 0));
6855 instance
= TREE_OPERAND (instance
, 0);
6858 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6859 with a real object -- given &p->f, p can still be null. */
6860 tree t
= get_base_address (instance
);
6861 /* ??? Probably should check DECL_WEAK here. */
6862 if (t
&& DECL_P (t
))
6865 return RECUR (instance
);
6868 /* If this component is really a base class reference, then the field
6869 itself isn't definitive. */
6870 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6871 return RECUR (TREE_OPERAND (instance
, 0));
6872 return RECUR (TREE_OPERAND (instance
, 1));
6876 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6877 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6881 return TREE_TYPE (TREE_TYPE (instance
));
6883 /* fall through... */
6887 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6891 return TREE_TYPE (instance
);
6893 else if (instance
== current_class_ptr
)
6898 /* if we're in a ctor or dtor, we know our type. If
6899 current_class_ptr is set but we aren't in a function, we're in
6900 an NSDMI (and therefore a constructor). */
6901 if (current_scope () != current_function_decl
6902 || (DECL_LANG_SPECIFIC (current_function_decl
)
6903 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6904 || DECL_DESTRUCTOR_P (current_function_decl
))))
6908 return TREE_TYPE (TREE_TYPE (instance
));
6911 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6913 /* We only need one hash table because it is always left empty. */
6914 if (!fixed_type_or_null_ref_ht
)
6915 fixed_type_or_null_ref_ht
6916 = new hash_table
<pointer_hash
<tree_node
> > (37);
6918 /* Reference variables should be references to objects. */
6922 /* Enter the INSTANCE in a table to prevent recursion; a
6923 variable's initializer may refer to the variable
6925 if (VAR_P (instance
)
6926 && DECL_INITIAL (instance
)
6927 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6928 && !fixed_type_or_null_ref_ht
->find (instance
))
6933 slot
= fixed_type_or_null_ref_ht
->find_slot (instance
, INSERT
);
6935 type
= RECUR (DECL_INITIAL (instance
));
6936 fixed_type_or_null_ref_ht
->remove_elt (instance
);
6949 /* Return nonzero if the dynamic type of INSTANCE is known, and
6950 equivalent to the static type. We also handle the case where
6951 INSTANCE is really a pointer. Return negative if this is a
6952 ctor/dtor. There the dynamic type is known, but this might not be
6953 the most derived base of the original object, and hence virtual
6954 bases may not be laid out according to this type.
6956 Used to determine whether the virtual function table is needed
6959 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6960 of our knowledge of its type. *NONNULL should be initialized
6961 before this function is called. */
6964 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6966 tree t
= TREE_TYPE (instance
);
6970 /* processing_template_decl can be false in a template if we're in
6971 instantiate_non_dependent_expr, but we still want to suppress
6973 if (in_template_function ())
6975 /* In a template we only care about the type of the result. */
6981 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6982 if (fixed
== NULL_TREE
)
6984 if (POINTER_TYPE_P (t
))
6986 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6988 return cdtorp
? -1 : 1;
6993 init_class_processing (void)
6995 current_class_depth
= 0;
6996 current_class_stack_size
= 10;
6998 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6999 vec_alloc (local_classes
, 8);
7000 sizeof_biggest_empty_class
= size_zero_node
;
7002 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
7003 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
7004 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
7007 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7010 restore_class_cache (void)
7014 /* We are re-entering the same class we just left, so we don't
7015 have to search the whole inheritance matrix to find all the
7016 decls to bind again. Instead, we install the cached
7017 class_shadowed list and walk through it binding names. */
7018 push_binding_level (previous_class_level
);
7019 class_binding_level
= previous_class_level
;
7020 /* Restore IDENTIFIER_TYPE_VALUE. */
7021 for (type
= class_binding_level
->type_shadowed
;
7023 type
= TREE_CHAIN (type
))
7024 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
7027 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7028 appropriate for TYPE.
7030 So that we may avoid calls to lookup_name, we cache the _TYPE
7031 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7033 For multiple inheritance, we perform a two-pass depth-first search
7034 of the type lattice. */
7037 pushclass (tree type
)
7039 class_stack_node_t csn
;
7041 type
= TYPE_MAIN_VARIANT (type
);
7043 /* Make sure there is enough room for the new entry on the stack. */
7044 if (current_class_depth
+ 1 >= current_class_stack_size
)
7046 current_class_stack_size
*= 2;
7048 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7049 current_class_stack_size
);
7052 /* Insert a new entry on the class stack. */
7053 csn
= current_class_stack
+ current_class_depth
;
7054 csn
->name
= current_class_name
;
7055 csn
->type
= current_class_type
;
7056 csn
->access
= current_access_specifier
;
7057 csn
->names_used
= 0;
7059 current_class_depth
++;
7061 /* Now set up the new type. */
7062 current_class_name
= TYPE_NAME (type
);
7063 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7064 current_class_name
= DECL_NAME (current_class_name
);
7065 current_class_type
= type
;
7067 /* By default, things in classes are private, while things in
7068 structures or unions are public. */
7069 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7070 ? access_private_node
7071 : access_public_node
);
7073 if (previous_class_level
7074 && type
!= previous_class_level
->this_entity
7075 && current_class_depth
== 1)
7077 /* Forcibly remove any old class remnants. */
7078 invalidate_class_lookup_cache ();
7081 if (!previous_class_level
7082 || type
!= previous_class_level
->this_entity
7083 || current_class_depth
> 1)
7086 restore_class_cache ();
7089 /* When we exit a toplevel class scope, we save its binding level so
7090 that we can restore it quickly. Here, we've entered some other
7091 class, so we must invalidate our cache. */
7094 invalidate_class_lookup_cache (void)
7096 previous_class_level
= NULL
;
7099 /* Get out of the current class scope. If we were in a class scope
7100 previously, that is the one popped to. */
7107 current_class_depth
--;
7108 current_class_name
= current_class_stack
[current_class_depth
].name
;
7109 current_class_type
= current_class_stack
[current_class_depth
].type
;
7110 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7111 if (current_class_stack
[current_class_depth
].names_used
)
7112 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7115 /* Mark the top of the class stack as hidden. */
7118 push_class_stack (void)
7120 if (current_class_depth
)
7121 ++current_class_stack
[current_class_depth
- 1].hidden
;
7124 /* Mark the top of the class stack as un-hidden. */
7127 pop_class_stack (void)
7129 if (current_class_depth
)
7130 --current_class_stack
[current_class_depth
- 1].hidden
;
7133 /* Returns 1 if the class type currently being defined is either T or
7134 a nested type of T. */
7137 currently_open_class (tree t
)
7141 if (!CLASS_TYPE_P (t
))
7144 t
= TYPE_MAIN_VARIANT (t
);
7146 /* We start looking from 1 because entry 0 is from global scope,
7148 for (i
= current_class_depth
; i
> 0; --i
)
7151 if (i
== current_class_depth
)
7152 c
= current_class_type
;
7155 if (current_class_stack
[i
].hidden
)
7157 c
= current_class_stack
[i
].type
;
7161 if (same_type_p (c
, t
))
7167 /* If either current_class_type or one of its enclosing classes are derived
7168 from T, return the appropriate type. Used to determine how we found
7169 something via unqualified lookup. */
7172 currently_open_derived_class (tree t
)
7176 /* The bases of a dependent type are unknown. */
7177 if (dependent_type_p (t
))
7180 if (!current_class_type
)
7183 if (DERIVED_FROM_P (t
, current_class_type
))
7184 return current_class_type
;
7186 for (i
= current_class_depth
- 1; i
> 0; --i
)
7188 if (current_class_stack
[i
].hidden
)
7190 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7191 return current_class_stack
[i
].type
;
7197 /* Return the outermost enclosing class type that is still open, or
7201 outermost_open_class (void)
7203 if (!current_class_type
)
7206 if (TYPE_BEING_DEFINED (current_class_type
))
7207 r
= current_class_type
;
7208 for (int i
= current_class_depth
- 1; i
> 0; --i
)
7210 if (current_class_stack
[i
].hidden
)
7212 tree t
= current_class_stack
[i
].type
;
7213 if (!TYPE_BEING_DEFINED (t
))
7220 /* Returns the innermost class type which is not a lambda closure type. */
7223 current_nonlambda_class_type (void)
7227 /* We start looking from 1 because entry 0 is from global scope,
7229 for (i
= current_class_depth
; i
> 0; --i
)
7232 if (i
== current_class_depth
)
7233 c
= current_class_type
;
7236 if (current_class_stack
[i
].hidden
)
7238 c
= current_class_stack
[i
].type
;
7242 if (!LAMBDA_TYPE_P (c
))
7248 /* When entering a class scope, all enclosing class scopes' names with
7249 static meaning (static variables, static functions, types and
7250 enumerators) have to be visible. This recursive function calls
7251 pushclass for all enclosing class contexts until global or a local
7252 scope is reached. TYPE is the enclosed class. */
7255 push_nested_class (tree type
)
7257 /* A namespace might be passed in error cases, like A::B:C. */
7258 if (type
== NULL_TREE
7259 || !CLASS_TYPE_P (type
))
7262 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7267 /* Undoes a push_nested_class call. */
7270 pop_nested_class (void)
7272 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7275 if (context
&& CLASS_TYPE_P (context
))
7276 pop_nested_class ();
7279 /* Returns the number of extern "LANG" blocks we are nested within. */
7282 current_lang_depth (void)
7284 return vec_safe_length (current_lang_base
);
7287 /* Set global variables CURRENT_LANG_NAME to appropriate value
7288 so that behavior of name-mangling machinery is correct. */
7291 push_lang_context (tree name
)
7293 vec_safe_push (current_lang_base
, current_lang_name
);
7295 if (name
== lang_name_cplusplus
)
7297 current_lang_name
= name
;
7299 else if (name
== lang_name_java
)
7301 current_lang_name
= name
;
7302 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7303 (See record_builtin_java_type in decl.c.) However, that causes
7304 incorrect debug entries if these types are actually used.
7305 So we re-enable debug output after extern "Java". */
7306 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7307 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7308 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7309 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7310 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7311 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7312 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7313 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7315 else if (name
== lang_name_c
)
7317 current_lang_name
= name
;
7320 error ("language string %<\"%E\"%> not recognized", name
);
7323 /* Get out of the current language scope. */
7326 pop_lang_context (void)
7328 current_lang_name
= current_lang_base
->pop ();
7331 /* Type instantiation routines. */
7333 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7334 matches the TARGET_TYPE. If there is no satisfactory match, return
7335 error_mark_node, and issue an error & warning messages under
7336 control of FLAGS. Permit pointers to member function if FLAGS
7337 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7338 a template-id, and EXPLICIT_TARGS are the explicitly provided
7341 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7342 is the base path used to reference those member functions. If
7343 the address is resolved to a member function, access checks will be
7344 performed and errors issued if appropriate. */
7347 resolve_address_of_overloaded_function (tree target_type
,
7349 tsubst_flags_t flags
,
7351 tree explicit_targs
,
7354 /* Here's what the standard says:
7358 If the name is a function template, template argument deduction
7359 is done, and if the argument deduction succeeds, the deduced
7360 arguments are used to generate a single template function, which
7361 is added to the set of overloaded functions considered.
7363 Non-member functions and static member functions match targets of
7364 type "pointer-to-function" or "reference-to-function." Nonstatic
7365 member functions match targets of type "pointer-to-member
7366 function;" the function type of the pointer to member is used to
7367 select the member function from the set of overloaded member
7368 functions. If a nonstatic member function is selected, the
7369 reference to the overloaded function name is required to have the
7370 form of a pointer to member as described in 5.3.1.
7372 If more than one function is selected, any template functions in
7373 the set are eliminated if the set also contains a non-template
7374 function, and any given template function is eliminated if the
7375 set contains a second template function that is more specialized
7376 than the first according to the partial ordering rules 14.5.5.2.
7377 After such eliminations, if any, there shall remain exactly one
7378 selected function. */
7381 /* We store the matches in a TREE_LIST rooted here. The functions
7382 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7383 interoperability with most_specialized_instantiation. */
7384 tree matches
= NULL_TREE
;
7386 tree target_fn_type
;
7388 /* By the time we get here, we should be seeing only real
7389 pointer-to-member types, not the internal POINTER_TYPE to
7390 METHOD_TYPE representation. */
7391 gcc_assert (!TYPE_PTR_P (target_type
)
7392 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7394 gcc_assert (is_overloaded_fn (overload
));
7396 /* Check that the TARGET_TYPE is reasonable. */
7397 if (TYPE_PTRFN_P (target_type
)
7398 || TYPE_REFFN_P (target_type
))
7400 else if (TYPE_PTRMEMFUNC_P (target_type
))
7401 /* This is OK, too. */
7403 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7404 /* This is OK, too. This comes from a conversion to reference
7406 target_type
= build_reference_type (target_type
);
7409 if (flags
& tf_error
)
7410 error ("cannot resolve overloaded function %qD based on"
7411 " conversion to type %qT",
7412 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7413 return error_mark_node
;
7416 /* Non-member functions and static member functions match targets of type
7417 "pointer-to-function" or "reference-to-function." Nonstatic member
7418 functions match targets of type "pointer-to-member-function;" the
7419 function type of the pointer to member is used to select the member
7420 function from the set of overloaded member functions.
7422 So figure out the FUNCTION_TYPE that we want to match against. */
7423 target_fn_type
= static_fn_type (target_type
);
7425 /* If we can find a non-template function that matches, we can just
7426 use it. There's no point in generating template instantiations
7427 if we're just going to throw them out anyhow. But, of course, we
7428 can only do this when we don't *need* a template function. */
7433 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7435 tree fn
= OVL_CURRENT (fns
);
7437 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7438 /* We're not looking for templates just yet. */
7441 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7443 /* We're looking for a non-static member, and this isn't
7444 one, or vice versa. */
7447 /* Ignore functions which haven't been explicitly
7449 if (DECL_ANTICIPATED (fn
))
7452 /* See if there's a match. */
7453 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7454 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7458 /* Now, if we've already got a match (or matches), there's no need
7459 to proceed to the template functions. But, if we don't have a
7460 match we need to look at them, too. */
7463 tree target_arg_types
;
7464 tree target_ret_type
;
7467 unsigned int nargs
, ia
;
7470 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7471 target_ret_type
= TREE_TYPE (target_fn_type
);
7473 nargs
= list_length (target_arg_types
);
7474 args
= XALLOCAVEC (tree
, nargs
);
7475 for (arg
= target_arg_types
, ia
= 0;
7476 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7477 arg
= TREE_CHAIN (arg
), ++ia
)
7478 args
[ia
] = TREE_VALUE (arg
);
7481 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7483 tree fn
= OVL_CURRENT (fns
);
7487 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7488 /* We're only looking for templates. */
7491 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7493 /* We're not looking for a non-static member, and this is
7494 one, or vice versa. */
7497 tree ret
= target_ret_type
;
7499 /* If the template has a deduced return type, don't expose it to
7500 template argument deduction. */
7501 if (undeduced_auto_decl (fn
))
7504 /* Try to do argument deduction. */
7505 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7506 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7508 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7510 if (instantiation
== error_mark_node
)
7511 /* Instantiation failed. */
7514 /* And now force instantiation to do return type deduction. */
7515 if (undeduced_auto_decl (instantiation
))
7518 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7521 require_deduced_type (instantiation
);
7524 /* See if there's a match. */
7525 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7526 matches
= tree_cons (instantiation
, fn
, matches
);
7529 /* Now, remove all but the most specialized of the matches. */
7532 tree match
= most_specialized_instantiation (matches
);
7534 if (match
!= error_mark_node
)
7535 matches
= tree_cons (TREE_PURPOSE (match
),
7541 /* Now we should have exactly one function in MATCHES. */
7542 if (matches
== NULL_TREE
)
7544 /* There were *no* matches. */
7545 if (flags
& tf_error
)
7547 error ("no matches converting function %qD to type %q#T",
7548 DECL_NAME (OVL_CURRENT (overload
)),
7551 print_candidates (overload
);
7553 return error_mark_node
;
7555 else if (TREE_CHAIN (matches
))
7557 /* There were too many matches. First check if they're all
7558 the same function. */
7559 tree match
= NULL_TREE
;
7561 fn
= TREE_PURPOSE (matches
);
7563 /* For multi-versioned functions, more than one match is just fine and
7564 decls_match will return false as they are different. */
7565 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7566 if (!decls_match (fn
, TREE_PURPOSE (match
))
7567 && !targetm
.target_option
.function_versions
7568 (fn
, TREE_PURPOSE (match
)))
7573 if (flags
& tf_error
)
7575 error ("converting overloaded function %qD to type %q#T is ambiguous",
7576 DECL_NAME (OVL_FUNCTION (overload
)),
7579 /* Since print_candidates expects the functions in the
7580 TREE_VALUE slot, we flip them here. */
7581 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7582 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7584 print_candidates (matches
);
7587 return error_mark_node
;
7591 /* Good, exactly one match. Now, convert it to the correct type. */
7592 fn
= TREE_PURPOSE (matches
);
7594 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7595 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7597 static int explained
;
7599 if (!(flags
& tf_error
))
7600 return error_mark_node
;
7602 permerror (input_location
, "assuming pointer to member %qD", fn
);
7605 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7610 /* If a pointer to a function that is multi-versioned is requested, the
7611 pointer to the dispatcher function is returned instead. This works
7612 well because indirectly calling the function will dispatch the right
7613 function version at run-time. */
7614 if (DECL_FUNCTION_VERSIONED (fn
))
7616 fn
= get_function_version_dispatcher (fn
);
7618 return error_mark_node
;
7619 /* Mark all the versions corresponding to the dispatcher as used. */
7620 if (!(flags
& tf_conv
))
7621 mark_versions_used (fn
);
7624 /* If we're doing overload resolution purely for the purpose of
7625 determining conversion sequences, we should not consider the
7626 function used. If this conversion sequence is selected, the
7627 function will be marked as used at this point. */
7628 if (!(flags
& tf_conv
))
7630 /* Make =delete work with SFINAE. */
7631 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7632 return error_mark_node
;
7637 /* We could not check access to member functions when this
7638 expression was originally created since we did not know at that
7639 time to which function the expression referred. */
7640 if (DECL_FUNCTION_MEMBER_P (fn
))
7642 gcc_assert (access_path
);
7643 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7646 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7647 return cp_build_addr_expr (fn
, flags
);
7650 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7651 will mark the function as addressed, but here we must do it
7653 cxx_mark_addressable (fn
);
7659 /* This function will instantiate the type of the expression given in
7660 RHS to match the type of LHSTYPE. If errors exist, then return
7661 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7662 we complain on errors. If we are not complaining, never modify rhs,
7663 as overload resolution wants to try many possible instantiations, in
7664 the hope that at least one will work.
7666 For non-recursive calls, LHSTYPE should be a function, pointer to
7667 function, or a pointer to member function. */
7670 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7672 tsubst_flags_t flags_in
= flags
;
7673 tree access_path
= NULL_TREE
;
7675 flags
&= ~tf_ptrmem_ok
;
7677 if (lhstype
== unknown_type_node
)
7679 if (flags
& tf_error
)
7680 error ("not enough type information");
7681 return error_mark_node
;
7684 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7686 tree fntype
= non_reference (lhstype
);
7687 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7689 if (flag_ms_extensions
7690 && TYPE_PTRMEMFUNC_P (fntype
)
7691 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7692 /* Microsoft allows `A::f' to be resolved to a
7693 pointer-to-member. */
7697 if (flags
& tf_error
)
7698 error ("cannot convert %qE from type %qT to type %qT",
7699 rhs
, TREE_TYPE (rhs
), fntype
);
7700 return error_mark_node
;
7704 if (BASELINK_P (rhs
))
7706 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7707 rhs
= BASELINK_FUNCTIONS (rhs
);
7710 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7711 deduce any type information. */
7712 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7714 if (flags
& tf_error
)
7715 error ("not enough type information");
7716 return error_mark_node
;
7719 /* There only a few kinds of expressions that may have a type
7720 dependent on overload resolution. */
7721 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7722 || TREE_CODE (rhs
) == COMPONENT_REF
7723 || is_overloaded_fn (rhs
)
7724 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7726 /* This should really only be used when attempting to distinguish
7727 what sort of a pointer to function we have. For now, any
7728 arithmetic operation which is not supported on pointers
7729 is rejected as an error. */
7731 switch (TREE_CODE (rhs
))
7735 tree member
= TREE_OPERAND (rhs
, 1);
7737 member
= instantiate_type (lhstype
, member
, flags
);
7738 if (member
!= error_mark_node
7739 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7740 /* Do not lose object's side effects. */
7741 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7742 TREE_OPERAND (rhs
, 0), member
);
7747 rhs
= TREE_OPERAND (rhs
, 1);
7748 if (BASELINK_P (rhs
))
7749 return instantiate_type (lhstype
, rhs
, flags_in
);
7751 /* This can happen if we are forming a pointer-to-member for a
7753 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7757 case TEMPLATE_ID_EXPR
:
7759 tree fns
= TREE_OPERAND (rhs
, 0);
7760 tree args
= TREE_OPERAND (rhs
, 1);
7763 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7764 /*template_only=*/true,
7771 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7772 /*template_only=*/false,
7773 /*explicit_targs=*/NULL_TREE
,
7778 if (PTRMEM_OK_P (rhs
))
7779 flags
|= tf_ptrmem_ok
;
7781 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7785 return error_mark_node
;
7790 return error_mark_node
;
7793 /* Return the name of the virtual function pointer field
7794 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7795 this may have to look back through base types to find the
7796 ultimate field name. (For single inheritance, these could
7797 all be the same name. Who knows for multiple inheritance). */
7800 get_vfield_name (tree type
)
7802 tree binfo
, base_binfo
;
7805 for (binfo
= TYPE_BINFO (type
);
7806 BINFO_N_BASE_BINFOS (binfo
);
7809 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7811 if (BINFO_VIRTUAL_P (base_binfo
)
7812 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7816 type
= BINFO_TYPE (binfo
);
7817 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7818 + TYPE_NAME_LENGTH (type
) + 2);
7819 sprintf (buf
, VFIELD_NAME_FORMAT
,
7820 IDENTIFIER_POINTER (constructor_name (type
)));
7821 return get_identifier (buf
);
7825 print_class_statistics (void)
7827 if (! GATHER_STATISTICS
)
7830 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7831 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7834 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7835 n_vtables
, n_vtable_searches
);
7836 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7837 n_vtable_entries
, n_vtable_elems
);
7841 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7842 according to [class]:
7843 The class-name is also inserted
7844 into the scope of the class itself. For purposes of access checking,
7845 the inserted class name is treated as if it were a public member name. */
7848 build_self_reference (void)
7850 tree name
= constructor_name (current_class_type
);
7851 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7854 DECL_NONLOCAL (value
) = 1;
7855 DECL_CONTEXT (value
) = current_class_type
;
7856 DECL_ARTIFICIAL (value
) = 1;
7857 SET_DECL_SELF_REFERENCE_P (value
);
7858 set_underlying_type (value
);
7860 if (processing_template_decl
)
7861 value
= push_template_decl (value
);
7863 saved_cas
= current_access_specifier
;
7864 current_access_specifier
= access_public_node
;
7865 finish_member_declaration (value
);
7866 current_access_specifier
= saved_cas
;
7869 /* Returns 1 if TYPE contains only padding bytes. */
7872 is_empty_class (tree type
)
7874 if (type
== error_mark_node
)
7877 if (! CLASS_TYPE_P (type
))
7880 return CLASSTYPE_EMPTY_P (type
);
7883 /* Returns true if TYPE contains no actual data, just various
7884 possible combinations of empty classes and possibly a vptr. */
7887 is_really_empty_class (tree type
)
7889 if (CLASS_TYPE_P (type
))
7896 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7897 out, but we'd like to be able to check this before then. */
7898 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7901 for (binfo
= TYPE_BINFO (type
), i
= 0;
7902 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7903 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7905 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7906 if (TREE_CODE (field
) == FIELD_DECL
7907 && !DECL_ARTIFICIAL (field
)
7908 && !is_really_empty_class (TREE_TYPE (field
)))
7912 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7913 return is_really_empty_class (TREE_TYPE (type
));
7917 /* Note that NAME was looked up while the current class was being
7918 defined and that the result of that lookup was DECL. */
7921 maybe_note_name_used_in_class (tree name
, tree decl
)
7923 splay_tree names_used
;
7925 /* If we're not defining a class, there's nothing to do. */
7926 if (!(innermost_scope_kind() == sk_class
7927 && TYPE_BEING_DEFINED (current_class_type
)
7928 && !LAMBDA_TYPE_P (current_class_type
)))
7931 /* If there's already a binding for this NAME, then we don't have
7932 anything to worry about. */
7933 if (lookup_member (current_class_type
, name
,
7934 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7937 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7938 current_class_stack
[current_class_depth
- 1].names_used
7939 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7940 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7942 splay_tree_insert (names_used
,
7943 (splay_tree_key
) name
,
7944 (splay_tree_value
) decl
);
7947 /* Note that NAME was declared (as DECL) in the current class. Check
7948 to see that the declaration is valid. */
7951 note_name_declared_in_class (tree name
, tree decl
)
7953 splay_tree names_used
;
7956 /* Look to see if we ever used this name. */
7958 = current_class_stack
[current_class_depth
- 1].names_used
;
7961 /* The C language allows members to be declared with a type of the same
7962 name, and the C++ standard says this diagnostic is not required. So
7963 allow it in extern "C" blocks unless predantic is specified.
7964 Allow it in all cases if -ms-extensions is specified. */
7965 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7966 || flag_ms_extensions
)
7968 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7971 /* [basic.scope.class]
7973 A name N used in a class S shall refer to the same declaration
7974 in its context and when re-evaluated in the completed scope of
7976 permerror (input_location
, "declaration of %q#D", decl
);
7977 permerror (input_location
, "changes meaning of %qD from %q+#D",
7978 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7982 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7983 Secondary vtables are merged with primary vtables; this function
7984 will return the VAR_DECL for the primary vtable. */
7987 get_vtbl_decl_for_binfo (tree binfo
)
7991 decl
= BINFO_VTABLE (binfo
);
7992 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7994 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7995 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7998 gcc_assert (VAR_P (decl
));
8003 /* Returns the binfo for the primary base of BINFO. If the resulting
8004 BINFO is a virtual base, and it is inherited elsewhere in the
8005 hierarchy, then the returned binfo might not be the primary base of
8006 BINFO in the complete object. Check BINFO_PRIMARY_P or
8007 BINFO_LOST_PRIMARY_P to be sure. */
8010 get_primary_binfo (tree binfo
)
8014 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8018 return copied_binfo (primary_base
, binfo
);
8021 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8024 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8027 fprintf (stream
, "%*s", indent
, "");
8031 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8032 INDENT should be zero when called from the top level; it is
8033 incremented recursively. IGO indicates the next expected BINFO in
8034 inheritance graph ordering. */
8037 dump_class_hierarchy_r (FILE *stream
,
8047 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8048 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8049 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8050 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8053 fprintf (stream
, "alternative-path\n");
8056 igo
= TREE_CHAIN (binfo
);
8058 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8059 tree_to_shwi (BINFO_OFFSET (binfo
)));
8060 if (is_empty_class (BINFO_TYPE (binfo
)))
8061 fprintf (stream
, " empty");
8062 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8063 fprintf (stream
, " nearly-empty");
8064 if (BINFO_VIRTUAL_P (binfo
))
8065 fprintf (stream
, " virtual");
8066 fprintf (stream
, "\n");
8069 if (BINFO_PRIMARY_P (binfo
))
8071 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8072 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8073 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8074 TFF_PLAIN_IDENTIFIER
),
8075 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8077 if (BINFO_LOST_PRIMARY_P (binfo
))
8079 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8080 fprintf (stream
, " lost-primary");
8083 fprintf (stream
, "\n");
8085 if (!(flags
& TDF_SLIM
))
8089 if (BINFO_SUBVTT_INDEX (binfo
))
8091 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8092 fprintf (stream
, " subvttidx=%s",
8093 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8094 TFF_PLAIN_IDENTIFIER
));
8096 if (BINFO_VPTR_INDEX (binfo
))
8098 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8099 fprintf (stream
, " vptridx=%s",
8100 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8101 TFF_PLAIN_IDENTIFIER
));
8103 if (BINFO_VPTR_FIELD (binfo
))
8105 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8106 fprintf (stream
, " vbaseoffset=%s",
8107 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8108 TFF_PLAIN_IDENTIFIER
));
8110 if (BINFO_VTABLE (binfo
))
8112 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8113 fprintf (stream
, " vptr=%s",
8114 expr_as_string (BINFO_VTABLE (binfo
),
8115 TFF_PLAIN_IDENTIFIER
));
8119 fprintf (stream
, "\n");
8122 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8123 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8128 /* Dump the BINFO hierarchy for T. */
8131 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8133 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8134 fprintf (stream
, " size=%lu align=%lu\n",
8135 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8136 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8137 fprintf (stream
, " base size=%lu base align=%lu\n",
8138 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8140 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8142 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8143 fprintf (stream
, "\n");
8146 /* Debug interface to hierarchy dumping. */
8149 debug_class (tree t
)
8151 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8155 dump_class_hierarchy (tree t
)
8158 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8162 dump_class_hierarchy_1 (stream
, flags
, t
);
8167 dump_array (FILE * stream
, tree decl
)
8170 unsigned HOST_WIDE_INT ix
;
8172 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8174 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8176 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8177 fprintf (stream
, " %s entries",
8178 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8179 TFF_PLAIN_IDENTIFIER
));
8180 fprintf (stream
, "\n");
8182 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8184 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8185 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8189 dump_vtable (tree t
, tree binfo
, tree vtable
)
8192 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8197 if (!(flags
& TDF_SLIM
))
8199 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8201 fprintf (stream
, "%s for %s",
8202 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8203 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8206 if (!BINFO_VIRTUAL_P (binfo
))
8207 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8208 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8209 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8211 fprintf (stream
, "\n");
8212 dump_array (stream
, vtable
);
8213 fprintf (stream
, "\n");
8218 dump_vtt (tree t
, tree vtt
)
8221 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8226 if (!(flags
& TDF_SLIM
))
8228 fprintf (stream
, "VTT for %s\n",
8229 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8230 dump_array (stream
, vtt
);
8231 fprintf (stream
, "\n");
8235 /* Dump a function or thunk and its thunkees. */
8238 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8240 static const char spaces
[] = " ";
8241 tree name
= DECL_NAME (thunk
);
8244 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8246 !DECL_THUNK_P (thunk
) ? "function"
8247 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8248 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8249 if (DECL_THUNK_P (thunk
))
8251 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8252 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8254 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8255 if (!virtual_adjust
)
8257 else if (DECL_THIS_THUNK_P (thunk
))
8258 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8259 tree_to_shwi (virtual_adjust
));
8261 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8262 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8263 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8264 if (THUNK_ALIAS (thunk
))
8265 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8267 fprintf (stream
, "\n");
8268 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8269 dump_thunk (stream
, indent
+ 2, thunks
);
8272 /* Dump the thunks for FN. */
8275 debug_thunks (tree fn
)
8277 dump_thunk (stderr
, 0, fn
);
8280 /* Virtual function table initialization. */
8282 /* Create all the necessary vtables for T and its base classes. */
8285 finish_vtbls (tree t
)
8288 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8289 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8291 /* We lay out the primary and secondary vtables in one contiguous
8292 vtable. The primary vtable is first, followed by the non-virtual
8293 secondary vtables in inheritance graph order. */
8294 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8297 /* Then come the virtual bases, also in inheritance graph order. */
8298 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8300 if (!BINFO_VIRTUAL_P (vbase
))
8302 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8305 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8306 initialize_vtable (TYPE_BINFO (t
), v
);
8309 /* Initialize the vtable for BINFO with the INITS. */
8312 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8316 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8317 decl
= get_vtbl_decl_for_binfo (binfo
);
8318 initialize_artificial_var (decl
, inits
);
8319 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8322 /* Build the VTT (virtual table table) for T.
8323 A class requires a VTT if it has virtual bases.
8326 1 - primary virtual pointer for complete object T
8327 2 - secondary VTTs for each direct non-virtual base of T which requires a
8329 3 - secondary virtual pointers for each direct or indirect base of T which
8330 has virtual bases or is reachable via a virtual path from T.
8331 4 - secondary VTTs for each direct or indirect virtual base of T.
8333 Secondary VTTs look like complete object VTTs without part 4. */
8341 vec
<constructor_elt
, va_gc
> *inits
;
8343 /* Build up the initializers for the VTT. */
8345 index
= size_zero_node
;
8346 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8348 /* If we didn't need a VTT, we're done. */
8352 /* Figure out the type of the VTT. */
8353 type
= build_array_of_n_type (const_ptr_type_node
,
8356 /* Now, build the VTT object itself. */
8357 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8358 initialize_artificial_var (vtt
, inits
);
8359 /* Add the VTT to the vtables list. */
8360 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8361 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8366 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8367 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8368 and CHAIN the vtable pointer for this binfo after construction is
8369 complete. VALUE can also be another BINFO, in which case we recurse. */
8372 binfo_ctor_vtable (tree binfo
)
8378 vt
= BINFO_VTABLE (binfo
);
8379 if (TREE_CODE (vt
) == TREE_LIST
)
8380 vt
= TREE_VALUE (vt
);
8381 if (TREE_CODE (vt
) == TREE_BINFO
)
8390 /* Data for secondary VTT initialization. */
8391 typedef struct secondary_vptr_vtt_init_data_s
8393 /* Is this the primary VTT? */
8396 /* Current index into the VTT. */
8399 /* Vector of initializers built up. */
8400 vec
<constructor_elt
, va_gc
> *inits
;
8402 /* The type being constructed by this secondary VTT. */
8403 tree type_being_constructed
;
8404 } secondary_vptr_vtt_init_data
;
8406 /* Recursively build the VTT-initializer for BINFO (which is in the
8407 hierarchy dominated by T). INITS points to the end of the initializer
8408 list to date. INDEX is the VTT index where the next element will be
8409 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8410 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8411 for virtual bases of T. When it is not so, we build the constructor
8412 vtables for the BINFO-in-T variant. */
8415 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8421 secondary_vptr_vtt_init_data data
;
8422 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8424 /* We only need VTTs for subobjects with virtual bases. */
8425 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8428 /* We need to use a construction vtable if this is not the primary
8432 build_ctor_vtbl_group (binfo
, t
);
8434 /* Record the offset in the VTT where this sub-VTT can be found. */
8435 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8438 /* Add the address of the primary vtable for the complete object. */
8439 init
= binfo_ctor_vtable (binfo
);
8440 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8443 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8444 BINFO_VPTR_INDEX (binfo
) = *index
;
8446 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8448 /* Recursively add the secondary VTTs for non-virtual bases. */
8449 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8450 if (!BINFO_VIRTUAL_P (b
))
8451 build_vtt_inits (b
, t
, inits
, index
);
8453 /* Add secondary virtual pointers for all subobjects of BINFO with
8454 either virtual bases or reachable along a virtual path, except
8455 subobjects that are non-virtual primary bases. */
8456 data
.top_level_p
= top_level_p
;
8457 data
.index
= *index
;
8458 data
.inits
= *inits
;
8459 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8461 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8463 *index
= data
.index
;
8465 /* data.inits might have grown as we added secondary virtual pointers.
8466 Make sure our caller knows about the new vector. */
8467 *inits
= data
.inits
;
8470 /* Add the secondary VTTs for virtual bases in inheritance graph
8472 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8474 if (!BINFO_VIRTUAL_P (b
))
8477 build_vtt_inits (b
, t
, inits
, index
);
8480 /* Remove the ctor vtables we created. */
8481 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8484 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8485 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8488 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8490 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8492 /* We don't care about bases that don't have vtables. */
8493 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8494 return dfs_skip_bases
;
8496 /* We're only interested in proper subobjects of the type being
8498 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8501 /* We're only interested in bases with virtual bases or reachable
8502 via a virtual path from the type being constructed. */
8503 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8504 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8505 return dfs_skip_bases
;
8507 /* We're not interested in non-virtual primary bases. */
8508 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8511 /* Record the index where this secondary vptr can be found. */
8512 if (data
->top_level_p
)
8514 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8515 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8517 if (BINFO_VIRTUAL_P (binfo
))
8519 /* It's a primary virtual base, and this is not a
8520 construction vtable. Find the base this is primary of in
8521 the inheritance graph, and use that base's vtable
8523 while (BINFO_PRIMARY_P (binfo
))
8524 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8528 /* Add the initializer for the secondary vptr itself. */
8529 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8531 /* Advance the vtt index. */
8532 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8533 TYPE_SIZE_UNIT (ptr_type_node
));
8538 /* Called from build_vtt_inits via dfs_walk. After building
8539 constructor vtables and generating the sub-vtt from them, we need
8540 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8541 binfo of the base whose sub vtt was generated. */
8544 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8546 tree vtable
= BINFO_VTABLE (binfo
);
8548 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8549 /* If this class has no vtable, none of its bases do. */
8550 return dfs_skip_bases
;
8553 /* This might be a primary base, so have no vtable in this
8557 /* If we scribbled the construction vtable vptr into BINFO, clear it
8559 if (TREE_CODE (vtable
) == TREE_LIST
8560 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8561 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8566 /* Build the construction vtable group for BINFO which is in the
8567 hierarchy dominated by T. */
8570 build_ctor_vtbl_group (tree binfo
, tree t
)
8576 vec
<constructor_elt
, va_gc
> *v
;
8578 /* See if we've already created this construction vtable group. */
8579 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8580 if (IDENTIFIER_GLOBAL_VALUE (id
))
8583 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8584 /* Build a version of VTBL (with the wrong type) for use in
8585 constructing the addresses of secondary vtables in the
8586 construction vtable group. */
8587 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8588 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8589 /* Don't export construction vtables from shared libraries. Even on
8590 targets that don't support hidden visibility, this tells
8591 can_refer_decl_in_current_unit_p not to assume that it's safe to
8592 access from a different compilation unit (bz 54314). */
8593 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8594 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8597 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8598 binfo
, vtbl
, t
, &v
);
8600 /* Add the vtables for each of our virtual bases using the vbase in T
8602 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8604 vbase
= TREE_CHAIN (vbase
))
8608 if (!BINFO_VIRTUAL_P (vbase
))
8610 b
= copied_binfo (vbase
, binfo
);
8612 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8615 /* Figure out the type of the construction vtable. */
8616 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8618 TREE_TYPE (vtbl
) = type
;
8619 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8620 layout_decl (vtbl
, 0);
8622 /* Initialize the construction vtable. */
8623 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8624 initialize_artificial_var (vtbl
, v
);
8625 dump_vtable (t
, binfo
, vtbl
);
8628 /* Add the vtbl initializers for BINFO (and its bases other than
8629 non-virtual primaries) to the list of INITS. BINFO is in the
8630 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8631 the constructor the vtbl inits should be accumulated for. (If this
8632 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8633 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8634 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8635 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8636 but are not necessarily the same in terms of layout. */
8639 accumulate_vtbl_inits (tree binfo
,
8644 vec
<constructor_elt
, va_gc
> **inits
)
8648 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8650 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8652 /* If it doesn't have a vptr, we don't do anything. */
8653 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8656 /* If we're building a construction vtable, we're not interested in
8657 subobjects that don't require construction vtables. */
8659 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8660 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8663 /* Build the initializers for the BINFO-in-T vtable. */
8664 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8666 /* Walk the BINFO and its bases. We walk in preorder so that as we
8667 initialize each vtable we can figure out at what offset the
8668 secondary vtable lies from the primary vtable. We can't use
8669 dfs_walk here because we need to iterate through bases of BINFO
8670 and RTTI_BINFO simultaneously. */
8671 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8673 /* Skip virtual bases. */
8674 if (BINFO_VIRTUAL_P (base_binfo
))
8676 accumulate_vtbl_inits (base_binfo
,
8677 BINFO_BASE_BINFO (orig_binfo
, i
),
8678 rtti_binfo
, vtbl
, t
,
8683 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8684 BINFO vtable to L. */
8687 dfs_accumulate_vtbl_inits (tree binfo
,
8692 vec
<constructor_elt
, va_gc
> **l
)
8694 tree vtbl
= NULL_TREE
;
8695 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8699 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8701 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8702 primary virtual base. If it is not the same primary in
8703 the hierarchy of T, we'll need to generate a ctor vtable
8704 for it, to place at its location in T. If it is the same
8705 primary, we still need a VTT entry for the vtable, but it
8706 should point to the ctor vtable for the base it is a
8707 primary for within the sub-hierarchy of RTTI_BINFO.
8709 There are three possible cases:
8711 1) We are in the same place.
8712 2) We are a primary base within a lost primary virtual base of
8714 3) We are primary to something not a base of RTTI_BINFO. */
8717 tree last
= NULL_TREE
;
8719 /* First, look through the bases we are primary to for RTTI_BINFO
8720 or a virtual base. */
8722 while (BINFO_PRIMARY_P (b
))
8724 b
= BINFO_INHERITANCE_CHAIN (b
);
8726 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8729 /* If we run out of primary links, keep looking down our
8730 inheritance chain; we might be an indirect primary. */
8731 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8732 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8736 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8737 base B and it is a base of RTTI_BINFO, this is case 2. In
8738 either case, we share our vtable with LAST, i.e. the
8739 derived-most base within B of which we are a primary. */
8741 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8742 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8743 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8744 binfo_ctor_vtable after everything's been set up. */
8747 /* Otherwise, this is case 3 and we get our own. */
8749 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8752 n_inits
= vec_safe_length (*l
);
8759 /* Add the initializer for this vtable. */
8760 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8761 &non_fn_entries
, l
);
8763 /* Figure out the position to which the VPTR should point. */
8764 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8765 index
= size_binop (MULT_EXPR
,
8766 TYPE_SIZE_UNIT (vtable_entry_type
),
8767 size_int (non_fn_entries
+ n_inits
));
8768 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8772 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8773 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8774 straighten this out. */
8775 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8776 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8777 /* Throw away any unneeded intializers. */
8778 (*l
)->truncate (n_inits
);
8780 /* For an ordinary vtable, set BINFO_VTABLE. */
8781 BINFO_VTABLE (binfo
) = vtbl
;
8784 static GTY(()) tree abort_fndecl_addr
;
8786 /* Construct the initializer for BINFO's virtual function table. BINFO
8787 is part of the hierarchy dominated by T. If we're building a
8788 construction vtable, the ORIG_BINFO is the binfo we should use to
8789 find the actual function pointers to put in the vtable - but they
8790 can be overridden on the path to most-derived in the graph that
8791 ORIG_BINFO belongs. Otherwise,
8792 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8793 BINFO that should be indicated by the RTTI information in the
8794 vtable; it will be a base class of T, rather than T itself, if we
8795 are building a construction vtable.
8797 The value returned is a TREE_LIST suitable for wrapping in a
8798 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8799 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8800 number of non-function entries in the vtable.
8802 It might seem that this function should never be called with a
8803 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8804 base is always subsumed by a derived class vtable. However, when
8805 we are building construction vtables, we do build vtables for
8806 primary bases; we need these while the primary base is being
8810 build_vtbl_initializer (tree binfo
,
8814 int* non_fn_entries_p
,
8815 vec
<constructor_elt
, va_gc
> **inits
)
8821 vec
<tree
, va_gc
> *vbases
;
8824 /* Initialize VID. */
8825 memset (&vid
, 0, sizeof (vid
));
8828 vid
.rtti_binfo
= rtti_binfo
;
8829 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8830 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8831 vid
.generate_vcall_entries
= true;
8832 /* The first vbase or vcall offset is at index -3 in the vtable. */
8833 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8835 /* Add entries to the vtable for RTTI. */
8836 build_rtti_vtbl_entries (binfo
, &vid
);
8838 /* Create an array for keeping track of the functions we've
8839 processed. When we see multiple functions with the same
8840 signature, we share the vcall offsets. */
8841 vec_alloc (vid
.fns
, 32);
8842 /* Add the vcall and vbase offset entries. */
8843 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8845 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8846 build_vbase_offset_vtbl_entries. */
8847 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8848 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8849 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8851 /* If the target requires padding between data entries, add that now. */
8852 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8854 int n_entries
= vec_safe_length (vid
.inits
);
8856 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8858 /* Move data entries into their new positions and add padding
8859 after the new positions. Iterate backwards so we don't
8860 overwrite entries that we would need to process later. */
8861 for (ix
= n_entries
- 1;
8862 vid
.inits
->iterate (ix
, &e
);
8866 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8867 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8869 (*vid
.inits
)[new_position
] = *e
;
8871 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8873 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8874 f
->index
= NULL_TREE
;
8875 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8881 if (non_fn_entries_p
)
8882 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8884 /* The initializers for virtual functions were built up in reverse
8885 order. Straighten them out and add them to the running list in one
8887 jx
= vec_safe_length (*inits
);
8888 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8890 for (ix
= vid
.inits
->length () - 1;
8891 vid
.inits
->iterate (ix
, &e
);
8895 /* Go through all the ordinary virtual functions, building up
8897 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8901 tree fn
, fn_original
;
8902 tree init
= NULL_TREE
;
8906 if (DECL_THUNK_P (fn
))
8908 if (!DECL_NAME (fn
))
8910 if (THUNK_ALIAS (fn
))
8912 fn
= THUNK_ALIAS (fn
);
8915 fn_original
= THUNK_TARGET (fn
);
8918 /* If the only definition of this function signature along our
8919 primary base chain is from a lost primary, this vtable slot will
8920 never be used, so just zero it out. This is important to avoid
8921 requiring extra thunks which cannot be generated with the function.
8923 We first check this in update_vtable_entry_for_fn, so we handle
8924 restored primary bases properly; we also need to do it here so we
8925 zero out unused slots in ctor vtables, rather than filling them
8926 with erroneous values (though harmless, apart from relocation
8928 if (BV_LOST_PRIMARY (v
))
8929 init
= size_zero_node
;
8933 /* Pull the offset for `this', and the function to call, out of
8935 delta
= BV_DELTA (v
);
8936 vcall_index
= BV_VCALL_INDEX (v
);
8938 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8939 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8941 /* You can't call an abstract virtual function; it's abstract.
8942 So, we replace these functions with __pure_virtual. */
8943 if (DECL_PURE_VIRTUAL_P (fn_original
))
8946 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8948 if (abort_fndecl_addr
== NULL
)
8950 = fold_convert (vfunc_ptr_type_node
,
8951 build_fold_addr_expr (fn
));
8952 init
= abort_fndecl_addr
;
8955 /* Likewise for deleted virtuals. */
8956 else if (DECL_DELETED_FN (fn_original
))
8958 fn
= get_identifier ("__cxa_deleted_virtual");
8959 if (!get_global_value_if_present (fn
, &fn
))
8960 fn
= push_library_fn (fn
, (build_function_type_list
8961 (void_type_node
, NULL_TREE
)),
8962 NULL_TREE
, ECF_NORETURN
);
8963 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8964 init
= fold_convert (vfunc_ptr_type_node
,
8965 build_fold_addr_expr (fn
));
8969 if (!integer_zerop (delta
) || vcall_index
)
8971 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8972 if (!DECL_NAME (fn
))
8975 /* Take the address of the function, considering it to be of an
8976 appropriate generic type. */
8977 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8978 init
= fold_convert (vfunc_ptr_type_node
,
8979 build_fold_addr_expr (fn
));
8980 /* Don't refer to a virtual destructor from a constructor
8981 vtable or a vtable for an abstract class, since destroying
8982 an object under construction is undefined behavior and we
8983 don't want it to be considered a candidate for speculative
8984 devirtualization. But do create the thunk for ABI
8986 if (DECL_DESTRUCTOR_P (fn_original
)
8987 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
8988 || orig_binfo
!= binfo
))
8989 init
= size_zero_node
;
8993 /* And add it to the chain of initializers. */
8994 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8997 if (init
== size_zero_node
)
8998 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8999 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9001 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
9003 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
9004 fn
, build_int_cst (NULL_TREE
, i
));
9005 TREE_CONSTANT (fdesc
) = 1;
9007 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
9011 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
9015 /* Adds to vid->inits the initializers for the vbase and vcall
9016 offsets in BINFO, which is in the hierarchy dominated by T. */
9019 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9023 /* If this is a derived class, we must first create entries
9024 corresponding to the primary base class. */
9025 b
= get_primary_binfo (binfo
);
9027 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9029 /* Add the vbase entries for this base. */
9030 build_vbase_offset_vtbl_entries (binfo
, vid
);
9031 /* Add the vcall entries for this base. */
9032 build_vcall_offset_vtbl_entries (binfo
, vid
);
9035 /* Returns the initializers for the vbase offset entries in the vtable
9036 for BINFO (which is part of the class hierarchy dominated by T), in
9037 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9038 where the next vbase offset will go. */
9041 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9045 tree non_primary_binfo
;
9047 /* If there are no virtual baseclasses, then there is nothing to
9049 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9054 /* We might be a primary base class. Go up the inheritance hierarchy
9055 until we find the most derived class of which we are a primary base:
9056 it is the offset of that which we need to use. */
9057 non_primary_binfo
= binfo
;
9058 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9062 /* If we have reached a virtual base, then it must be a primary
9063 base (possibly multi-level) of vid->binfo, or we wouldn't
9064 have called build_vcall_and_vbase_vtbl_entries for it. But it
9065 might be a lost primary, so just skip down to vid->binfo. */
9066 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9068 non_primary_binfo
= vid
->binfo
;
9072 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9073 if (get_primary_binfo (b
) != non_primary_binfo
)
9075 non_primary_binfo
= b
;
9078 /* Go through the virtual bases, adding the offsets. */
9079 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9081 vbase
= TREE_CHAIN (vbase
))
9086 if (!BINFO_VIRTUAL_P (vbase
))
9089 /* Find the instance of this virtual base in the complete
9091 b
= copied_binfo (vbase
, binfo
);
9093 /* If we've already got an offset for this virtual base, we
9094 don't need another one. */
9095 if (BINFO_VTABLE_PATH_MARKED (b
))
9097 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9099 /* Figure out where we can find this vbase offset. */
9100 delta
= size_binop (MULT_EXPR
,
9103 TYPE_SIZE_UNIT (vtable_entry_type
)));
9104 if (vid
->primary_vtbl_p
)
9105 BINFO_VPTR_FIELD (b
) = delta
;
9107 if (binfo
!= TYPE_BINFO (t
))
9108 /* The vbase offset had better be the same. */
9109 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9111 /* The next vbase will come at a more negative offset. */
9112 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9113 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9115 /* The initializer is the delta from BINFO to this virtual base.
9116 The vbase offsets go in reverse inheritance-graph order, and
9117 we are walking in inheritance graph order so these end up in
9119 delta
= size_diffop_loc (input_location
,
9120 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9122 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9123 fold_build1_loc (input_location
, NOP_EXPR
,
9124 vtable_entry_type
, delta
));
9128 /* Adds the initializers for the vcall offset entries in the vtable
9129 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9133 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9135 /* We only need these entries if this base is a virtual base. We
9136 compute the indices -- but do not add to the vtable -- when
9137 building the main vtable for a class. */
9138 if (binfo
== TYPE_BINFO (vid
->derived
)
9139 || (BINFO_VIRTUAL_P (binfo
)
9140 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9141 correspond to VID->DERIVED), we are building a primary
9142 construction virtual table. Since this is a primary
9143 virtual table, we do not need the vcall offsets for
9145 && binfo
!= vid
->rtti_binfo
))
9147 /* We need a vcall offset for each of the virtual functions in this
9148 vtable. For example:
9150 class A { virtual void f (); };
9151 class B1 : virtual public A { virtual void f (); };
9152 class B2 : virtual public A { virtual void f (); };
9153 class C: public B1, public B2 { virtual void f (); };
9155 A C object has a primary base of B1, which has a primary base of A. A
9156 C also has a secondary base of B2, which no longer has a primary base
9157 of A. So the B2-in-C construction vtable needs a secondary vtable for
9158 A, which will adjust the A* to a B2* to call f. We have no way of
9159 knowing what (or even whether) this offset will be when we define B2,
9160 so we store this "vcall offset" in the A sub-vtable and look it up in
9161 a "virtual thunk" for B2::f.
9163 We need entries for all the functions in our primary vtable and
9164 in our non-virtual bases' secondary vtables. */
9166 /* If we are just computing the vcall indices -- but do not need
9167 the actual entries -- not that. */
9168 if (!BINFO_VIRTUAL_P (binfo
))
9169 vid
->generate_vcall_entries
= false;
9170 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9171 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9175 /* Build vcall offsets, starting with those for BINFO. */
9178 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9184 /* Don't walk into virtual bases -- except, of course, for the
9185 virtual base for which we are building vcall offsets. Any
9186 primary virtual base will have already had its offsets generated
9187 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9188 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9191 /* If BINFO has a primary base, process it first. */
9192 primary_binfo
= get_primary_binfo (binfo
);
9194 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9196 /* Add BINFO itself to the list. */
9197 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9199 /* Scan the non-primary bases of BINFO. */
9200 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9201 if (base_binfo
!= primary_binfo
)
9202 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9205 /* Called from build_vcall_offset_vtbl_entries_r. */
9208 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9210 /* Make entries for the rest of the virtuals. */
9213 /* The ABI requires that the methods be processed in declaration
9215 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9217 orig_fn
= DECL_CHAIN (orig_fn
))
9218 if (TREE_CODE (orig_fn
) == FUNCTION_DECL
&& DECL_VINDEX (orig_fn
))
9219 add_vcall_offset (orig_fn
, binfo
, vid
);
9222 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9225 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9231 /* If there is already an entry for a function with the same
9232 signature as FN, then we do not need a second vcall offset.
9233 Check the list of functions already present in the derived
9235 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9237 if (same_signature_p (derived_entry
, orig_fn
)
9238 /* We only use one vcall offset for virtual destructors,
9239 even though there are two virtual table entries. */
9240 || (DECL_DESTRUCTOR_P (derived_entry
)
9241 && DECL_DESTRUCTOR_P (orig_fn
)))
9245 /* If we are building these vcall offsets as part of building
9246 the vtable for the most derived class, remember the vcall
9248 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9250 tree_pair_s elt
= {orig_fn
, vid
->index
};
9251 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9254 /* The next vcall offset will be found at a more negative
9256 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9257 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9259 /* Keep track of this function. */
9260 vec_safe_push (vid
->fns
, orig_fn
);
9262 if (vid
->generate_vcall_entries
)
9267 /* Find the overriding function. */
9268 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9269 if (fn
== error_mark_node
)
9270 vcall_offset
= build_zero_cst (vtable_entry_type
);
9273 base
= TREE_VALUE (fn
);
9275 /* The vbase we're working on is a primary base of
9276 vid->binfo. But it might be a lost primary, so its
9277 BINFO_OFFSET might be wrong, so we just use the
9278 BINFO_OFFSET from vid->binfo. */
9279 vcall_offset
= size_diffop_loc (input_location
,
9280 BINFO_OFFSET (base
),
9281 BINFO_OFFSET (vid
->binfo
));
9282 vcall_offset
= fold_build1_loc (input_location
,
9283 NOP_EXPR
, vtable_entry_type
,
9286 /* Add the initializer to the vtable. */
9287 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9291 /* Return vtbl initializers for the RTTI entries corresponding to the
9292 BINFO's vtable. The RTTI entries should indicate the object given
9293 by VID->rtti_binfo. */
9296 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9304 t
= BINFO_TYPE (vid
->rtti_binfo
);
9306 /* To find the complete object, we will first convert to our most
9307 primary base, and then add the offset in the vtbl to that value. */
9309 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9310 && !BINFO_LOST_PRIMARY_P (b
))
9314 primary_base
= get_primary_binfo (b
);
9315 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9316 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9319 offset
= size_diffop_loc (input_location
,
9320 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9322 /* The second entry is the address of the typeinfo object. */
9324 decl
= build_address (get_tinfo_decl (t
));
9326 decl
= integer_zero_node
;
9328 /* Convert the declaration to a type that can be stored in the
9330 init
= build_nop (vfunc_ptr_type_node
, decl
);
9331 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9333 /* Add the offset-to-top entry. It comes earlier in the vtable than
9334 the typeinfo entry. Convert the offset to look like a
9335 function pointer, so that we can put it in the vtable. */
9336 init
= build_nop (vfunc_ptr_type_node
, offset
);
9337 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9340 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9344 uniquely_derived_from_p (tree parent
, tree type
)
9346 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9347 return base
&& base
!= error_mark_node
;
9350 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9353 publicly_uniquely_derived_p (tree parent
, tree type
)
9355 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9357 return base
&& base
!= error_mark_node
;
9360 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9361 class between them, if any. */
9364 common_enclosing_class (tree ctx1
, tree ctx2
)
9366 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9368 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9369 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9372 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9373 TYPE_MARKED_P (t
) = true;
9374 tree found
= NULL_TREE
;
9375 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9376 if (TYPE_MARKED_P (t
))
9381 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9382 TYPE_MARKED_P (t
) = false;
9386 #include "gt-cp-class.h"