1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2014 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 tree
get_basefndecls (tree
, 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 fold_non_dependent_expr), we don't have vtables set
363 up properly yet, and the value doesn't matter there either; we're just
364 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 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1356 types with abi tags, add the corresponding identifiers to the VEC in
1357 *DATA and set IDENTIFIER_MARKED. */
1363 // error_mark_node to get diagnostics; otherwise collect missing tags here
1368 find_abi_tags_r (tree
*tp
, int *walk_subtrees
, void *data
)
1370 if (!OVERLOAD_TYPE_P (*tp
))
1373 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1374 anyway, but let's make sure of it. */
1375 *walk_subtrees
= false;
1377 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1379 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1380 for (tree list
= TREE_VALUE (attributes
); list
;
1381 list
= TREE_CHAIN (list
))
1383 tree tag
= TREE_VALUE (list
);
1384 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1385 if (!IDENTIFIER_MARKED (id
))
1387 if (p
->tags
!= error_mark_node
)
1389 /* We're collecting tags from template arguments. */
1390 tree str
= build_string (IDENTIFIER_LENGTH (id
),
1391 IDENTIFIER_POINTER (id
));
1392 p
->tags
= tree_cons (NULL_TREE
, str
, p
->tags
);
1393 ABI_TAG_IMPLICIT (p
->tags
) = true;
1395 /* Don't inherit this tag multiple times. */
1396 IDENTIFIER_MARKED (id
) = true;
1399 /* Otherwise we're diagnosing missing tags. */
1400 else if (TYPE_P (p
->subob
))
1402 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1403 "that base %qT has", p
->t
, tag
, p
->subob
))
1404 inform (location_of (p
->subob
), "%qT declared here",
1409 if (warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1410 "that %qT (used in the type of %qD) has",
1411 p
->t
, tag
, *tp
, p
->subob
))
1413 inform (location_of (p
->subob
), "%qD declared here",
1415 inform (location_of (*tp
), "%qT declared here", *tp
);
1424 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1425 complete) template arguments. */
1428 mark_type_abi_tags (tree t
, bool val
)
1430 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1433 for (tree list
= TREE_VALUE (attributes
); list
;
1434 list
= TREE_CHAIN (list
))
1436 tree tag
= TREE_VALUE (list
);
1437 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1438 IDENTIFIER_MARKED (id
) = val
;
1443 /* Check that class T has all the abi tags that subobject SUBOB has, or
1447 check_abi_tags (tree t
, tree subob
)
1449 mark_type_abi_tags (t
, true);
1451 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1452 struct abi_tag_data data
= { t
, subob
, error_mark_node
};
1454 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1456 mark_type_abi_tags (t
, false);
1460 inherit_targ_abi_tags (tree t
)
1462 if (!CLASS_TYPE_P (t
)
1463 || CLASSTYPE_TEMPLATE_INFO (t
) == NULL_TREE
)
1466 mark_type_abi_tags (t
, true);
1468 tree args
= CLASSTYPE_TI_ARGS (t
);
1469 struct abi_tag_data data
= { t
, NULL_TREE
, NULL_TREE
};
1470 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1472 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1473 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1475 tree arg
= TREE_VEC_ELT (level
, j
);
1477 cp_walk_tree_without_duplicates (&arg
, find_abi_tags_r
, &data
);
1481 // If we found some tags on our template arguments, add them to our
1482 // abi_tag attribute.
1485 tree attr
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1487 TREE_VALUE (attr
) = chainon (data
.tags
, TREE_VALUE (attr
));
1490 = tree_cons (get_identifier ("abi_tag"), data
.tags
,
1491 TYPE_ATTRIBUTES (t
));
1494 mark_type_abi_tags (t
, false);
1497 /* Return true, iff class T has a non-virtual destructor that is
1498 accessible from outside the class heirarchy (i.e. is public, or
1499 there's a suitable friend. */
1502 accessible_nvdtor_p (tree t
)
1504 tree dtor
= CLASSTYPE_DESTRUCTORS (t
);
1506 /* An implicitly declared destructor is always public. And,
1507 if it were virtual, we would have created it by now. */
1511 if (DECL_VINDEX (dtor
))
1512 return false; /* Virtual */
1514 if (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
1515 return true; /* Public */
1517 if (CLASSTYPE_FRIEND_CLASSES (t
)
1518 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1519 return true; /* Has friends */
1524 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1525 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1526 properties of the bases. */
1529 check_bases (tree t
,
1530 int* cant_have_const_ctor_p
,
1531 int* no_const_asn_ref_p
)
1534 bool seen_non_virtual_nearly_empty_base_p
= 0;
1535 int seen_tm_mask
= 0;
1538 tree field
= NULL_TREE
;
1540 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1541 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1542 if (TREE_CODE (field
) == FIELD_DECL
)
1545 for (binfo
= TYPE_BINFO (t
), i
= 0;
1546 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1548 tree basetype
= TREE_TYPE (base_binfo
);
1550 gcc_assert (COMPLETE_TYPE_P (basetype
));
1552 if (CLASSTYPE_FINAL (basetype
))
1553 error ("cannot derive from %<final%> base %qT in derived type %qT",
1556 /* If any base class is non-literal, so is the derived class. */
1557 if (!CLASSTYPE_LITERAL_P (basetype
))
1558 CLASSTYPE_LITERAL_P (t
) = false;
1560 /* If the base class doesn't have copy constructors or
1561 assignment operators that take const references, then the
1562 derived class cannot have such a member automatically
1564 if (TYPE_HAS_COPY_CTOR (basetype
)
1565 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1566 *cant_have_const_ctor_p
= 1;
1567 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1568 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1569 *no_const_asn_ref_p
= 1;
1571 if (BINFO_VIRTUAL_P (base_binfo
))
1572 /* A virtual base does not effect nearly emptiness. */
1574 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1576 if (seen_non_virtual_nearly_empty_base_p
)
1577 /* And if there is more than one nearly empty base, then the
1578 derived class is not nearly empty either. */
1579 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1581 /* Remember we've seen one. */
1582 seen_non_virtual_nearly_empty_base_p
= 1;
1584 else if (!is_empty_class (basetype
))
1585 /* If the base class is not empty or nearly empty, then this
1586 class cannot be nearly empty. */
1587 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1589 /* A lot of properties from the bases also apply to the derived
1591 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1592 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1593 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1594 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1595 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1596 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1597 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1598 || !TYPE_HAS_COPY_CTOR (basetype
));
1599 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1600 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1601 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1602 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1603 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1604 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1605 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1606 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1607 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1608 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1609 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1610 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1611 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1612 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1614 /* A standard-layout class is a class that:
1616 * has no non-standard-layout base classes, */
1617 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1618 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1621 /* ...has no base classes of the same type as the first non-static
1623 if (field
&& DECL_CONTEXT (field
) == t
1624 && (same_type_ignoring_top_level_qualifiers_p
1625 (TREE_TYPE (field
), basetype
)))
1626 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1628 /* ...either has no non-static data members in the most-derived
1629 class and at most one base class with non-static data
1630 members, or has no base classes with non-static data
1632 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1633 basefield
= DECL_CHAIN (basefield
))
1634 if (TREE_CODE (basefield
) == FIELD_DECL
)
1637 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1644 /* Don't bother collecting tm attributes if transactional memory
1645 support is not enabled. */
1648 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1650 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1653 check_abi_tags (t
, basetype
);
1656 /* If one of the base classes had TM attributes, and the current class
1657 doesn't define its own, then the current class inherits one. */
1658 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1660 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1661 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1665 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1666 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1667 that have had a nearly-empty virtual primary base stolen by some
1668 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1672 determine_primary_bases (tree t
)
1675 tree primary
= NULL_TREE
;
1676 tree type_binfo
= TYPE_BINFO (t
);
1679 /* Determine the primary bases of our bases. */
1680 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1681 base_binfo
= TREE_CHAIN (base_binfo
))
1683 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1685 /* See if we're the non-virtual primary of our inheritance
1687 if (!BINFO_VIRTUAL_P (base_binfo
))
1689 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1690 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1693 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1694 BINFO_TYPE (parent_primary
)))
1695 /* We are the primary binfo. */
1696 BINFO_PRIMARY_P (base_binfo
) = 1;
1698 /* Determine if we have a virtual primary base, and mark it so.
1700 if (primary
&& BINFO_VIRTUAL_P (primary
))
1702 tree this_primary
= copied_binfo (primary
, base_binfo
);
1704 if (BINFO_PRIMARY_P (this_primary
))
1705 /* Someone already claimed this base. */
1706 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1711 BINFO_PRIMARY_P (this_primary
) = 1;
1712 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1714 /* A virtual binfo might have been copied from within
1715 another hierarchy. As we're about to use it as a
1716 primary base, make sure the offsets match. */
1717 delta
= size_diffop_loc (input_location
,
1719 BINFO_OFFSET (base_binfo
)),
1721 BINFO_OFFSET (this_primary
)));
1723 propagate_binfo_offsets (this_primary
, delta
);
1728 /* First look for a dynamic direct non-virtual base. */
1729 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1731 tree basetype
= BINFO_TYPE (base_binfo
);
1733 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1735 primary
= base_binfo
;
1740 /* A "nearly-empty" virtual base class can be the primary base
1741 class, if no non-virtual polymorphic base can be found. Look for
1742 a nearly-empty virtual dynamic base that is not already a primary
1743 base of something in the hierarchy. If there is no such base,
1744 just pick the first nearly-empty virtual base. */
1746 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1747 base_binfo
= TREE_CHAIN (base_binfo
))
1748 if (BINFO_VIRTUAL_P (base_binfo
)
1749 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1751 if (!BINFO_PRIMARY_P (base_binfo
))
1753 /* Found one that is not primary. */
1754 primary
= base_binfo
;
1758 /* Remember the first candidate. */
1759 primary
= base_binfo
;
1763 /* If we've got a primary base, use it. */
1766 tree basetype
= BINFO_TYPE (primary
);
1768 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1769 if (BINFO_PRIMARY_P (primary
))
1770 /* We are stealing a primary base. */
1771 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1772 BINFO_PRIMARY_P (primary
) = 1;
1773 if (BINFO_VIRTUAL_P (primary
))
1777 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1778 /* A virtual binfo might have been copied from within
1779 another hierarchy. As we're about to use it as a primary
1780 base, make sure the offsets match. */
1781 delta
= size_diffop_loc (input_location
, ssize_int (0),
1782 convert (ssizetype
, BINFO_OFFSET (primary
)));
1784 propagate_binfo_offsets (primary
, delta
);
1787 primary
= TYPE_BINFO (basetype
);
1789 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1790 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1791 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1795 /* Update the variant types of T. */
1798 fixup_type_variants (tree t
)
1805 for (variants
= TYPE_NEXT_VARIANT (t
);
1807 variants
= TYPE_NEXT_VARIANT (variants
))
1809 /* These fields are in the _TYPE part of the node, not in
1810 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1811 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1812 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1813 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1814 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1816 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1818 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1820 /* Copy whatever these are holding today. */
1821 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1822 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1823 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1827 /* Early variant fixups: we apply attributes at the beginning of the class
1828 definition, and we need to fix up any variants that have already been
1829 made via elaborated-type-specifier so that check_qualified_type works. */
1832 fixup_attribute_variants (tree t
)
1839 for (variants
= TYPE_NEXT_VARIANT (t
);
1841 variants
= TYPE_NEXT_VARIANT (variants
))
1843 /* These are the two fields that check_qualified_type looks at and
1844 are affected by attributes. */
1845 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1846 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1850 /* Set memoizing fields and bits of T (and its variants) for later
1854 finish_struct_bits (tree t
)
1856 /* Fix up variants (if any). */
1857 fixup_type_variants (t
);
1859 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1860 /* For a class w/o baseclasses, 'finish_struct' has set
1861 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1862 Similarly for a class whose base classes do not have vtables.
1863 When neither of these is true, we might have removed abstract
1864 virtuals (by providing a definition), added some (by declaring
1865 new ones), or redeclared ones from a base class. We need to
1866 recalculate what's really an abstract virtual at this point (by
1867 looking in the vtables). */
1868 get_pure_virtuals (t
);
1870 /* If this type has a copy constructor or a destructor, force its
1871 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1872 nonzero. This will cause it to be passed by invisible reference
1873 and prevent it from being returned in a register. */
1874 if (type_has_nontrivial_copy_init (t
)
1875 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1878 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1879 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1881 SET_TYPE_MODE (variants
, BLKmode
);
1882 TREE_ADDRESSABLE (variants
) = 1;
1887 /* Issue warnings about T having private constructors, but no friends,
1890 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1891 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1892 non-private static member functions. */
1895 maybe_warn_about_overly_private_class (tree t
)
1897 int has_member_fn
= 0;
1898 int has_nonprivate_method
= 0;
1901 if (!warn_ctor_dtor_privacy
1902 /* If the class has friends, those entities might create and
1903 access instances, so we should not warn. */
1904 || (CLASSTYPE_FRIEND_CLASSES (t
)
1905 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1906 /* We will have warned when the template was declared; there's
1907 no need to warn on every instantiation. */
1908 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1909 /* There's no reason to even consider warning about this
1913 /* We only issue one warning, if more than one applies, because
1914 otherwise, on code like:
1917 // Oops - forgot `public:'
1923 we warn several times about essentially the same problem. */
1925 /* Check to see if all (non-constructor, non-destructor) member
1926 functions are private. (Since there are no friends or
1927 non-private statics, we can't ever call any of the private member
1929 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1930 /* We're not interested in compiler-generated methods; they don't
1931 provide any way to call private members. */
1932 if (!DECL_ARTIFICIAL (fn
))
1934 if (!TREE_PRIVATE (fn
))
1936 if (DECL_STATIC_FUNCTION_P (fn
))
1937 /* A non-private static member function is just like a
1938 friend; it can create and invoke private member
1939 functions, and be accessed without a class
1943 has_nonprivate_method
= 1;
1944 /* Keep searching for a static member function. */
1946 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1950 if (!has_nonprivate_method
&& has_member_fn
)
1952 /* There are no non-private methods, and there's at least one
1953 private member function that isn't a constructor or
1954 destructor. (If all the private members are
1955 constructors/destructors we want to use the code below that
1956 issues error messages specifically referring to
1957 constructors/destructors.) */
1959 tree binfo
= TYPE_BINFO (t
);
1961 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1962 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1964 has_nonprivate_method
= 1;
1967 if (!has_nonprivate_method
)
1969 warning (OPT_Wctor_dtor_privacy
,
1970 "all member functions in class %qT are private", t
);
1975 /* Even if some of the member functions are non-private, the class
1976 won't be useful for much if all the constructors or destructors
1977 are private: such an object can never be created or destroyed. */
1978 fn
= CLASSTYPE_DESTRUCTORS (t
);
1979 if (fn
&& TREE_PRIVATE (fn
))
1981 warning (OPT_Wctor_dtor_privacy
,
1982 "%q#T only defines a private destructor and has no friends",
1987 /* Warn about classes that have private constructors and no friends. */
1988 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1989 /* Implicitly generated constructors are always public. */
1990 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1991 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1993 int nonprivate_ctor
= 0;
1995 /* If a non-template class does not define a copy
1996 constructor, one is defined for it, enabling it to avoid
1997 this warning. For a template class, this does not
1998 happen, and so we would normally get a warning on:
2000 template <class T> class C { private: C(); };
2002 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2003 complete non-template or fully instantiated classes have this
2005 if (!TYPE_HAS_COPY_CTOR (t
))
2006 nonprivate_ctor
= 1;
2008 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
2010 tree ctor
= OVL_CURRENT (fn
);
2011 /* Ideally, we wouldn't count copy constructors (or, in
2012 fact, any constructor that takes an argument of the
2013 class type as a parameter) because such things cannot
2014 be used to construct an instance of the class unless
2015 you already have one. But, for now at least, we're
2017 if (! TREE_PRIVATE (ctor
))
2019 nonprivate_ctor
= 1;
2024 if (nonprivate_ctor
== 0)
2026 warning (OPT_Wctor_dtor_privacy
,
2027 "%q#T only defines private constructors and has no friends",
2035 gt_pointer_operator new_value
;
2039 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2042 method_name_cmp (const void* m1_p
, const void* m2_p
)
2044 const tree
*const m1
= (const tree
*) m1_p
;
2045 const tree
*const m2
= (const tree
*) m2_p
;
2047 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2049 if (*m1
== NULL_TREE
)
2051 if (*m2
== NULL_TREE
)
2053 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
2058 /* This routine compares two fields like method_name_cmp but using the
2059 pointer operator in resort_field_decl_data. */
2062 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
2064 const tree
*const m1
= (const tree
*) m1_p
;
2065 const tree
*const m2
= (const tree
*) m2_p
;
2066 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
2068 if (*m1
== NULL_TREE
)
2070 if (*m2
== NULL_TREE
)
2073 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
2074 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
2075 resort_data
.new_value (&d1
, resort_data
.cookie
);
2076 resort_data
.new_value (&d2
, resort_data
.cookie
);
2083 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2086 resort_type_method_vec (void* obj
,
2088 gt_pointer_operator new_value
,
2091 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2092 int len
= vec_safe_length (method_vec
);
2096 /* The type conversion ops have to live at the front of the vec, so we
2098 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2099 vec_safe_iterate (method_vec
, slot
, &fn
);
2101 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2106 resort_data
.new_value
= new_value
;
2107 resort_data
.cookie
= cookie
;
2108 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2109 resort_method_name_cmp
);
2113 /* Warn about duplicate methods in fn_fields.
2115 Sort methods that are not special (i.e., constructors, destructors,
2116 and type conversion operators) so that we can find them faster in
2120 finish_struct_methods (tree t
)
2123 vec
<tree
, va_gc
> *method_vec
;
2126 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2130 len
= method_vec
->length ();
2132 /* Clear DECL_IN_AGGR_P for all functions. */
2133 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2134 fn_fields
= DECL_CHAIN (fn_fields
))
2135 DECL_IN_AGGR_P (fn_fields
) = 0;
2137 /* Issue warnings about private constructors and such. If there are
2138 no methods, then some public defaults are generated. */
2139 maybe_warn_about_overly_private_class (t
);
2141 /* The type conversion ops have to live at the front of the vec, so we
2143 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2144 method_vec
->iterate (slot
, &fn_fields
);
2146 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2149 qsort (method_vec
->address () + slot
,
2150 len
-slot
, sizeof (tree
), method_name_cmp
);
2153 /* Make BINFO's vtable have N entries, including RTTI entries,
2154 vbase and vcall offsets, etc. Set its type and call the back end
2158 layout_vtable_decl (tree binfo
, int n
)
2163 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2164 layout_type (atype
);
2166 /* We may have to grow the vtable. */
2167 vtable
= get_vtbl_decl_for_binfo (binfo
);
2168 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2170 TREE_TYPE (vtable
) = atype
;
2171 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2172 layout_decl (vtable
, 0);
2176 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2177 have the same signature. */
2180 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2182 /* One destructor overrides another if they are the same kind of
2184 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2185 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2187 /* But a non-destructor never overrides a destructor, nor vice
2188 versa, nor do different kinds of destructors override
2189 one-another. For example, a complete object destructor does not
2190 override a deleting destructor. */
2191 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2194 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2195 || (DECL_CONV_FN_P (fndecl
)
2196 && DECL_CONV_FN_P (base_fndecl
)
2197 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2198 DECL_CONV_FN_TYPE (base_fndecl
))))
2200 tree fntype
= TREE_TYPE (fndecl
);
2201 tree base_fntype
= TREE_TYPE (base_fndecl
);
2202 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2203 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2204 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2205 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2211 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2215 base_derived_from (tree derived
, tree base
)
2219 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2221 if (probe
== derived
)
2223 else if (BINFO_VIRTUAL_P (probe
))
2224 /* If we meet a virtual base, we can't follow the inheritance
2225 any more. See if the complete type of DERIVED contains
2226 such a virtual base. */
2227 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2233 typedef struct find_final_overrider_data_s
{
2234 /* The function for which we are trying to find a final overrider. */
2236 /* The base class in which the function was declared. */
2237 tree declaring_base
;
2238 /* The candidate overriders. */
2240 /* Path to most derived. */
2242 } find_final_overrider_data
;
2244 /* Add the overrider along the current path to FFOD->CANDIDATES.
2245 Returns true if an overrider was found; false otherwise. */
2248 dfs_find_final_overrider_1 (tree binfo
,
2249 find_final_overrider_data
*ffod
,
2254 /* If BINFO is not the most derived type, try a more derived class.
2255 A definition there will overrider a definition here. */
2259 if (dfs_find_final_overrider_1
2260 (ffod
->path
[depth
], ffod
, depth
))
2264 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2267 tree
*candidate
= &ffod
->candidates
;
2269 /* Remove any candidates overridden by this new function. */
2272 /* If *CANDIDATE overrides METHOD, then METHOD
2273 cannot override anything else on the list. */
2274 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2276 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2277 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2278 *candidate
= TREE_CHAIN (*candidate
);
2280 candidate
= &TREE_CHAIN (*candidate
);
2283 /* Add the new function. */
2284 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2291 /* Called from find_final_overrider via dfs_walk. */
2294 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2296 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2298 if (binfo
== ffod
->declaring_base
)
2299 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2300 ffod
->path
.safe_push (binfo
);
2306 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2308 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2314 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2315 FN and whose TREE_VALUE is the binfo for the base where the
2316 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2317 DERIVED) is the base object in which FN is declared. */
2320 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2322 find_final_overrider_data ffod
;
2324 /* Getting this right is a little tricky. This is valid:
2326 struct S { virtual void f (); };
2327 struct T { virtual void f (); };
2328 struct U : public S, public T { };
2330 even though calling `f' in `U' is ambiguous. But,
2332 struct R { virtual void f(); };
2333 struct S : virtual public R { virtual void f (); };
2334 struct T : virtual public R { virtual void f (); };
2335 struct U : public S, public T { };
2337 is not -- there's no way to decide whether to put `S::f' or
2338 `T::f' in the vtable for `R'.
2340 The solution is to look at all paths to BINFO. If we find
2341 different overriders along any two, then there is a problem. */
2342 if (DECL_THUNK_P (fn
))
2343 fn
= THUNK_TARGET (fn
);
2345 /* Determine the depth of the hierarchy. */
2347 ffod
.declaring_base
= binfo
;
2348 ffod
.candidates
= NULL_TREE
;
2349 ffod
.path
.create (30);
2351 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2352 dfs_find_final_overrider_post
, &ffod
);
2354 ffod
.path
.release ();
2356 /* If there was no winner, issue an error message. */
2357 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2358 return error_mark_node
;
2360 return ffod
.candidates
;
2363 /* Return the index of the vcall offset for FN when TYPE is used as a
2367 get_vcall_index (tree fn
, tree type
)
2369 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2373 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2374 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2375 || same_signature_p (fn
, p
->purpose
))
2378 /* There should always be an appropriate index. */
2382 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2383 dominated by T. FN is the old function; VIRTUALS points to the
2384 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2385 of that entry in the list. */
2388 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2396 tree overrider_fn
, overrider_target
;
2397 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2398 tree over_return
, base_return
;
2401 /* Find the nearest primary base (possibly binfo itself) which defines
2402 this function; this is the class the caller will convert to when
2403 calling FN through BINFO. */
2404 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2407 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2410 /* The nearest definition is from a lost primary. */
2411 if (BINFO_LOST_PRIMARY_P (b
))
2416 /* Find the final overrider. */
2417 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2418 if (overrider
== error_mark_node
)
2420 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2423 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2425 /* Check for adjusting covariant return types. */
2426 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2427 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2429 if (POINTER_TYPE_P (over_return
)
2430 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2431 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2432 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2433 /* If the overrider is invalid, don't even try. */
2434 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2436 /* If FN is a covariant thunk, we must figure out the adjustment
2437 to the final base FN was converting to. As OVERRIDER_TARGET might
2438 also be converting to the return type of FN, we have to
2439 combine the two conversions here. */
2440 tree fixed_offset
, virtual_offset
;
2442 over_return
= TREE_TYPE (over_return
);
2443 base_return
= TREE_TYPE (base_return
);
2445 if (DECL_THUNK_P (fn
))
2447 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2448 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2449 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2452 fixed_offset
= virtual_offset
= NULL_TREE
;
2455 /* Find the equivalent binfo within the return type of the
2456 overriding function. We will want the vbase offset from
2458 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2460 else if (!same_type_ignoring_top_level_qualifiers_p
2461 (over_return
, base_return
))
2463 /* There was no existing virtual thunk (which takes
2464 precedence). So find the binfo of the base function's
2465 return type within the overriding function's return type.
2466 We cannot call lookup base here, because we're inside a
2467 dfs_walk, and will therefore clobber the BINFO_MARKED
2468 flags. Fortunately we know the covariancy is valid (it
2469 has already been checked), so we can just iterate along
2470 the binfos, which have been chained in inheritance graph
2471 order. Of course it is lame that we have to repeat the
2472 search here anyway -- we should really be caching pieces
2473 of the vtable and avoiding this repeated work. */
2474 tree thunk_binfo
, base_binfo
;
2476 /* Find the base binfo within the overriding function's
2477 return type. We will always find a thunk_binfo, except
2478 when the covariancy is invalid (which we will have
2479 already diagnosed). */
2480 for (base_binfo
= TYPE_BINFO (base_return
),
2481 thunk_binfo
= TYPE_BINFO (over_return
);
2483 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2484 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2485 BINFO_TYPE (base_binfo
)))
2488 /* See if virtual inheritance is involved. */
2489 for (virtual_offset
= thunk_binfo
;
2491 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2492 if (BINFO_VIRTUAL_P (virtual_offset
))
2496 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2498 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2502 /* We convert via virtual base. Adjust the fixed
2503 offset to be from there. */
2505 size_diffop (offset
,
2507 BINFO_OFFSET (virtual_offset
)));
2510 /* There was an existing fixed offset, this must be
2511 from the base just converted to, and the base the
2512 FN was thunking to. */
2513 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2515 fixed_offset
= offset
;
2519 if (fixed_offset
|| virtual_offset
)
2520 /* Replace the overriding function with a covariant thunk. We
2521 will emit the overriding function in its own slot as
2523 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2524 fixed_offset
, virtual_offset
);
2527 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2528 !DECL_THUNK_P (fn
));
2530 /* If we need a covariant thunk, then we may need to adjust first_defn.
2531 The ABI specifies that the thunks emitted with a function are
2532 determined by which bases the function overrides, so we need to be
2533 sure that we're using a thunk for some overridden base; even if we
2534 know that the necessary this adjustment is zero, there may not be an
2535 appropriate zero-this-adjusment thunk for us to use since thunks for
2536 overriding virtual bases always use the vcall offset.
2538 Furthermore, just choosing any base that overrides this function isn't
2539 quite right, as this slot won't be used for calls through a type that
2540 puts a covariant thunk here. Calling the function through such a type
2541 will use a different slot, and that slot is the one that determines
2542 the thunk emitted for that base.
2544 So, keep looking until we find the base that we're really overriding
2545 in this slot: the nearest primary base that doesn't use a covariant
2546 thunk in this slot. */
2547 if (overrider_target
!= overrider_fn
)
2549 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2550 /* We already know that the overrider needs a covariant thunk. */
2551 b
= get_primary_binfo (b
);
2552 for (; ; b
= get_primary_binfo (b
))
2554 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2555 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2556 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2558 if (BINFO_LOST_PRIMARY_P (b
))
2564 /* Assume that we will produce a thunk that convert all the way to
2565 the final overrider, and not to an intermediate virtual base. */
2566 virtual_base
= NULL_TREE
;
2568 /* See if we can convert to an intermediate virtual base first, and then
2569 use the vcall offset located there to finish the conversion. */
2570 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2572 /* If we find the final overrider, then we can stop
2574 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2575 BINFO_TYPE (TREE_VALUE (overrider
))))
2578 /* If we find a virtual base, and we haven't yet found the
2579 overrider, then there is a virtual base between the
2580 declaring base (first_defn) and the final overrider. */
2581 if (BINFO_VIRTUAL_P (b
))
2588 /* Compute the constant adjustment to the `this' pointer. The
2589 `this' pointer, when this function is called, will point at BINFO
2590 (or one of its primary bases, which are at the same offset). */
2592 /* The `this' pointer needs to be adjusted from the declaration to
2593 the nearest virtual base. */
2594 delta
= size_diffop_loc (input_location
,
2595 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2596 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2598 /* If the nearest definition is in a lost primary, we don't need an
2599 entry in our vtable. Except possibly in a constructor vtable,
2600 if we happen to get our primary back. In that case, the offset
2601 will be zero, as it will be a primary base. */
2602 delta
= size_zero_node
;
2604 /* The `this' pointer needs to be adjusted from pointing to
2605 BINFO to pointing at the base where the final overrider
2607 delta
= size_diffop_loc (input_location
,
2609 BINFO_OFFSET (TREE_VALUE (overrider
))),
2610 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2612 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2615 BV_VCALL_INDEX (*virtuals
)
2616 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2618 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2620 BV_LOST_PRIMARY (*virtuals
) = lost
;
2623 /* Called from modify_all_vtables via dfs_walk. */
2626 dfs_modify_vtables (tree binfo
, void* data
)
2628 tree t
= (tree
) data
;
2633 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2634 /* A base without a vtable needs no modification, and its bases
2635 are uninteresting. */
2636 return dfs_skip_bases
;
2638 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2639 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2640 /* Don't do the primary vtable, if it's new. */
2643 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2644 /* There's no need to modify the vtable for a non-virtual primary
2645 base; we're not going to use that vtable anyhow. We do still
2646 need to do this for virtual primary bases, as they could become
2647 non-primary in a construction vtable. */
2650 make_new_vtable (t
, binfo
);
2652 /* Now, go through each of the virtual functions in the virtual
2653 function table for BINFO. Find the final overrider, and update
2654 the BINFO_VIRTUALS list appropriately. */
2655 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2656 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2658 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2659 old_virtuals
= TREE_CHAIN (old_virtuals
))
2660 update_vtable_entry_for_fn (t
,
2662 BV_FN (old_virtuals
),
2668 /* Update all of the primary and secondary vtables for T. Create new
2669 vtables as required, and initialize their RTTI information. Each
2670 of the functions in VIRTUALS is declared in T and may override a
2671 virtual function from a base class; find and modify the appropriate
2672 entries to point to the overriding functions. Returns a list, in
2673 declaration order, of the virtual functions that are declared in T,
2674 but do not appear in the primary base class vtable, and which
2675 should therefore be appended to the end of the vtable for T. */
2678 modify_all_vtables (tree t
, tree virtuals
)
2680 tree binfo
= TYPE_BINFO (t
);
2683 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2684 if (TYPE_CONTAINS_VPTR_P (t
))
2685 get_vtable_decl (t
, false);
2687 /* Update all of the vtables. */
2688 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2690 /* Add virtual functions not already in our primary vtable. These
2691 will be both those introduced by this class, and those overridden
2692 from secondary bases. It does not include virtuals merely
2693 inherited from secondary bases. */
2694 for (fnsp
= &virtuals
; *fnsp
; )
2696 tree fn
= TREE_VALUE (*fnsp
);
2698 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2699 || DECL_VINDEX (fn
) == error_mark_node
)
2701 /* We don't need to adjust the `this' pointer when
2702 calling this function. */
2703 BV_DELTA (*fnsp
) = integer_zero_node
;
2704 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2706 /* This is a function not already in our vtable. Keep it. */
2707 fnsp
= &TREE_CHAIN (*fnsp
);
2710 /* We've already got an entry for this function. Skip it. */
2711 *fnsp
= TREE_CHAIN (*fnsp
);
2717 /* Get the base virtual function declarations in T that have the
2721 get_basefndecls (tree name
, tree t
)
2724 tree base_fndecls
= NULL_TREE
;
2725 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2728 /* Find virtual functions in T with the indicated NAME. */
2729 i
= lookup_fnfields_1 (t
, name
);
2731 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2733 methods
= OVL_NEXT (methods
))
2735 tree method
= OVL_CURRENT (methods
);
2737 if (TREE_CODE (method
) == FUNCTION_DECL
2738 && DECL_VINDEX (method
))
2739 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2743 return base_fndecls
;
2745 for (i
= 0; i
< n_baseclasses
; i
++)
2747 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2748 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2752 return base_fndecls
;
2755 /* If this declaration supersedes the declaration of
2756 a method declared virtual in the base class, then
2757 mark this field as being virtual as well. */
2760 check_for_override (tree decl
, tree ctype
)
2762 bool overrides_found
= false;
2763 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2764 /* In [temp.mem] we have:
2766 A specialization of a member function template does not
2767 override a virtual function from a base class. */
2769 if ((DECL_DESTRUCTOR_P (decl
)
2770 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2771 || DECL_CONV_FN_P (decl
))
2772 && look_for_overrides (ctype
, decl
)
2773 && !DECL_STATIC_FUNCTION_P (decl
))
2774 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2775 the error_mark_node so that we know it is an overriding
2778 DECL_VINDEX (decl
) = decl
;
2779 overrides_found
= true;
2782 if (DECL_VIRTUAL_P (decl
))
2784 if (!DECL_VINDEX (decl
))
2785 DECL_VINDEX (decl
) = error_mark_node
;
2786 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2787 if (DECL_DESTRUCTOR_P (decl
))
2788 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2790 else if (DECL_FINAL_P (decl
))
2791 error ("%q+#D marked %<final%>, but is not virtual", decl
);
2792 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2793 error ("%q+#D marked %<override%>, but does not override", decl
);
2796 /* Warn about hidden virtual functions that are not overridden in t.
2797 We know that constructors and destructors don't apply. */
2800 warn_hidden (tree t
)
2802 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2806 /* We go through each separately named virtual function. */
2807 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2808 vec_safe_iterate (method_vec
, i
, &fns
);
2819 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2820 have the same name. Figure out what name that is. */
2821 name
= DECL_NAME (OVL_CURRENT (fns
));
2822 /* There are no possibly hidden functions yet. */
2823 base_fndecls
= NULL_TREE
;
2824 /* Iterate through all of the base classes looking for possibly
2825 hidden functions. */
2826 for (binfo
= TYPE_BINFO (t
), j
= 0;
2827 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2829 tree basetype
= BINFO_TYPE (base_binfo
);
2830 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2834 /* If there are no functions to hide, continue. */
2838 /* Remove any overridden functions. */
2839 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2841 fndecl
= OVL_CURRENT (fn
);
2842 if (TREE_CODE (fndecl
) == FUNCTION_DECL
2843 && DECL_VINDEX (fndecl
))
2845 tree
*prev
= &base_fndecls
;
2848 /* If the method from the base class has the same
2849 signature as the method from the derived class, it
2850 has been overridden. */
2851 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2852 *prev
= TREE_CHAIN (*prev
);
2854 prev
= &TREE_CHAIN (*prev
);
2858 /* Now give a warning for all base functions without overriders,
2859 as they are hidden. */
2860 while (base_fndecls
)
2862 /* Here we know it is a hider, and no overrider exists. */
2863 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2864 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2865 base_fndecls
= TREE_CHAIN (base_fndecls
);
2870 /* Recursive helper for finish_struct_anon. */
2873 finish_struct_anon_r (tree field
, bool complain
)
2875 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2876 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2877 for (; elt
; elt
= DECL_CHAIN (elt
))
2879 /* We're generally only interested in entities the user
2880 declared, but we also find nested classes by noticing
2881 the TYPE_DECL that we create implicitly. You're
2882 allowed to put one anonymous union inside another,
2883 though, so we explicitly tolerate that. We use
2884 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2885 we also allow unnamed types used for defining fields. */
2886 if (DECL_ARTIFICIAL (elt
)
2887 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2888 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2891 if (TREE_CODE (elt
) != FIELD_DECL
)
2893 /* We already complained about static data members in
2894 finish_static_data_member_decl. */
2895 if (complain
&& TREE_CODE (elt
) != VAR_DECL
)
2898 permerror (input_location
,
2899 "%q+#D invalid; an anonymous union can "
2900 "only have non-static data members", elt
);
2902 permerror (input_location
,
2903 "%q+#D invalid; an anonymous struct can "
2904 "only have non-static data members", elt
);
2911 if (TREE_PRIVATE (elt
))
2914 permerror (input_location
,
2915 "private member %q+#D in anonymous union", elt
);
2917 permerror (input_location
,
2918 "private member %q+#D in anonymous struct", elt
);
2920 else if (TREE_PROTECTED (elt
))
2923 permerror (input_location
,
2924 "protected member %q+#D in anonymous union", elt
);
2926 permerror (input_location
,
2927 "protected member %q+#D in anonymous struct", elt
);
2931 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2932 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2934 /* Recurse into the anonymous aggregates to handle correctly
2935 access control (c++/24926):
2946 if (DECL_NAME (elt
) == NULL_TREE
2947 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2948 finish_struct_anon_r (elt
, /*complain=*/false);
2952 /* Check for things that are invalid. There are probably plenty of other
2953 things we should check for also. */
2956 finish_struct_anon (tree t
)
2958 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2960 if (TREE_STATIC (field
))
2962 if (TREE_CODE (field
) != FIELD_DECL
)
2965 if (DECL_NAME (field
) == NULL_TREE
2966 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2967 finish_struct_anon_r (field
, /*complain=*/true);
2971 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2972 will be used later during class template instantiation.
2973 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2974 a non-static member data (FIELD_DECL), a member function
2975 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2976 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2977 When FRIEND_P is nonzero, T is either a friend class
2978 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2979 (FUNCTION_DECL, TEMPLATE_DECL). */
2982 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2984 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2985 if (CLASSTYPE_TEMPLATE_INFO (type
))
2986 CLASSTYPE_DECL_LIST (type
)
2987 = tree_cons (friend_p
? NULL_TREE
: type
,
2988 t
, CLASSTYPE_DECL_LIST (type
));
2991 /* This function is called from declare_virt_assop_and_dtor via
2994 DATA is a type that direcly or indirectly inherits the base
2995 represented by BINFO. If BINFO contains a virtual assignment [copy
2996 assignment or move assigment] operator or a virtual constructor,
2997 declare that function in DATA if it hasn't been already declared. */
3000 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
3002 tree bv
, fn
, t
= (tree
)data
;
3003 tree opname
= ansi_assopname (NOP_EXPR
);
3005 gcc_assert (t
&& CLASS_TYPE_P (t
));
3006 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
3008 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
3009 /* A base without a vtable needs no modification, and its bases
3010 are uninteresting. */
3011 return dfs_skip_bases
;
3013 if (BINFO_PRIMARY_P (binfo
))
3014 /* If this is a primary base, then we have already looked at the
3015 virtual functions of its vtable. */
3018 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
3022 if (DECL_NAME (fn
) == opname
)
3024 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
3025 lazily_declare_fn (sfk_copy_assignment
, t
);
3026 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
3027 lazily_declare_fn (sfk_move_assignment
, t
);
3029 else if (DECL_DESTRUCTOR_P (fn
)
3030 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
3031 lazily_declare_fn (sfk_destructor
, t
);
3037 /* If the class type T has a direct or indirect base that contains a
3038 virtual assignment operator or a virtual destructor, declare that
3039 function in T if it hasn't been already declared. */
3042 declare_virt_assop_and_dtor (tree t
)
3044 if (!(TYPE_POLYMORPHIC_P (t
)
3045 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
3046 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
3047 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
3050 dfs_walk_all (TYPE_BINFO (t
),
3051 dfs_declare_virt_assop_and_dtor
,
3055 /* Declare the inheriting constructor for class T inherited from base
3056 constructor CTOR with the parameter array PARMS of size NPARMS. */
3059 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
3061 /* We don't declare an inheriting ctor that would be a default,
3062 copy or move ctor for derived or base. */
3066 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
3068 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
3069 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
3073 tree parmlist
= void_list_node
;
3074 for (int i
= nparms
- 1; i
>= 0; i
--)
3075 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
3076 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
3077 t
, false, ctor
, parmlist
);
3078 if (add_method (t
, fn
, NULL_TREE
))
3080 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
3081 TYPE_METHODS (t
) = fn
;
3085 /* Declare all the inheriting constructors for class T inherited from base
3086 constructor CTOR. */
3089 one_inherited_ctor (tree ctor
, tree t
)
3091 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3093 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3095 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3097 if (TREE_PURPOSE (parms
))
3098 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3099 new_parms
[i
++] = TREE_VALUE (parms
);
3101 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3102 if (parms
== NULL_TREE
)
3104 if (warning (OPT_Winherited_variadic_ctor
,
3105 "the ellipsis in %qD is not inherited", ctor
))
3106 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3110 /* Create default constructors, assignment operators, and so forth for
3111 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3112 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3113 the class cannot have a default constructor, copy constructor
3114 taking a const reference argument, or an assignment operator taking
3115 a const reference, respectively. */
3118 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3119 int cant_have_const_cctor
,
3120 int cant_have_const_assignment
)
3122 bool move_ok
= false;
3124 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3125 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3126 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3130 if (!CLASSTYPE_DESTRUCTORS (t
))
3132 /* In general, we create destructors lazily. */
3133 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3135 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3136 && TYPE_FOR_JAVA (t
))
3137 /* But if this is a Java class, any non-trivial destructor is
3138 invalid, even if compiler-generated. Therefore, if the
3139 destructor is non-trivial we create it now. */
3140 lazily_declare_fn (sfk_destructor
, t
);
3145 If there is no user-declared constructor for a class, a default
3146 constructor is implicitly declared. */
3147 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3149 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3150 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3151 if (cxx_dialect
>= cxx11
)
3152 TYPE_HAS_CONSTEXPR_CTOR (t
)
3153 /* This might force the declaration. */
3154 = type_has_constexpr_default_constructor (t
);
3159 If a class definition does not explicitly declare a copy
3160 constructor, one is declared implicitly. */
3161 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3163 TYPE_HAS_COPY_CTOR (t
) = 1;
3164 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3165 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3167 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3170 /* If there is no assignment operator, one will be created if and
3171 when it is needed. For now, just record whether or not the type
3172 of the parameter to the assignment operator will be a const or
3173 non-const reference. */
3174 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3176 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3177 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3178 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3179 if (move_ok
&& !LAMBDA_TYPE_P (t
))
3180 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3183 /* We can't be lazy about declaring functions that might override
3184 a virtual function from a base class. */
3185 declare_virt_assop_and_dtor (t
);
3187 while (*access_decls
)
3189 tree using_decl
= TREE_VALUE (*access_decls
);
3190 tree decl
= USING_DECL_DECLS (using_decl
);
3191 if (DECL_NAME (using_decl
) == ctor_identifier
)
3193 /* declare, then remove the decl */
3194 tree ctor_list
= decl
;
3195 location_t loc
= input_location
;
3196 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3198 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3199 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3200 *access_decls
= TREE_CHAIN (*access_decls
);
3201 input_location
= loc
;
3204 access_decls
= &TREE_CHAIN (*access_decls
);
3208 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3209 count the number of fields in TYPE, including anonymous union
3213 count_fields (tree fields
)
3217 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3219 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3220 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3227 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3228 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3229 elts, starting at offset IDX. */
3232 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3235 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3237 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3238 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3240 field_vec
->elts
[idx
++] = x
;
3245 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3246 starting at offset IDX. */
3249 add_enum_fields_to_record_type (tree enumtype
,
3250 struct sorted_fields_type
*field_vec
,
3254 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3255 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3259 /* FIELD is a bit-field. We are finishing the processing for its
3260 enclosing type. Issue any appropriate messages and set appropriate
3261 flags. Returns false if an error has been diagnosed. */
3264 check_bitfield_decl (tree field
)
3266 tree type
= TREE_TYPE (field
);
3269 /* Extract the declared width of the bitfield, which has been
3270 temporarily stashed in DECL_INITIAL. */
3271 w
= DECL_INITIAL (field
);
3272 gcc_assert (w
!= NULL_TREE
);
3273 /* Remove the bit-field width indicator so that the rest of the
3274 compiler does not treat that value as an initializer. */
3275 DECL_INITIAL (field
) = NULL_TREE
;
3277 /* Detect invalid bit-field type. */
3278 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3280 error ("bit-field %q+#D with non-integral type", field
);
3281 w
= error_mark_node
;
3285 location_t loc
= input_location
;
3286 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3289 /* detect invalid field size. */
3290 input_location
= DECL_SOURCE_LOCATION (field
);
3291 w
= cxx_constant_value (w
);
3292 input_location
= loc
;
3294 if (TREE_CODE (w
) != INTEGER_CST
)
3296 error ("bit-field %q+D width not an integer constant", field
);
3297 w
= error_mark_node
;
3299 else if (tree_int_cst_sgn (w
) < 0)
3301 error ("negative width in bit-field %q+D", field
);
3302 w
= error_mark_node
;
3304 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3306 error ("zero width for bit-field %q+D", field
);
3307 w
= error_mark_node
;
3309 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3310 && TREE_CODE (type
) != BOOLEAN_TYPE
3311 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3312 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3313 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3314 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3315 warning (0, "width of %q+D exceeds its type", field
);
3316 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3317 && (0 > (compare_tree_int
3318 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3319 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3322 if (w
!= error_mark_node
)
3324 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3325 DECL_BIT_FIELD (field
) = 1;
3330 /* Non-bit-fields are aligned for their type. */
3331 DECL_BIT_FIELD (field
) = 0;
3332 CLEAR_DECL_C_BIT_FIELD (field
);
3337 /* FIELD is a non bit-field. We are finishing the processing for its
3338 enclosing type T. Issue any appropriate messages and set appropriate
3342 check_field_decl (tree field
,
3344 int* cant_have_const_ctor
,
3345 int* no_const_asn_ref
,
3346 int* any_default_members
)
3348 tree type
= strip_array_types (TREE_TYPE (field
));
3350 /* In C++98 an anonymous union cannot contain any fields which would change
3351 the settings of CANT_HAVE_CONST_CTOR and friends. */
3352 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3354 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3355 structs. So, we recurse through their fields here. */
3356 else if (ANON_AGGR_TYPE_P (type
))
3360 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3361 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3362 check_field_decl (fields
, t
, cant_have_const_ctor
,
3363 no_const_asn_ref
, any_default_members
);
3365 /* Check members with class type for constructors, destructors,
3367 else if (CLASS_TYPE_P (type
))
3369 /* Never let anything with uninheritable virtuals
3370 make it through without complaint. */
3371 abstract_virtuals_error (field
, type
);
3373 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3376 int oldcount
= errorcount
;
3377 if (TYPE_NEEDS_CONSTRUCTING (type
))
3378 error ("member %q+#D with constructor not allowed in union",
3380 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3381 error ("member %q+#D with destructor not allowed in union", field
);
3382 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3383 error ("member %q+#D with copy assignment operator not allowed in union",
3385 if (!warned
&& errorcount
> oldcount
)
3387 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3388 "only available with -std=c++11 or -std=gnu++11");
3394 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3395 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3396 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3397 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3398 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3399 || !TYPE_HAS_COPY_ASSIGN (type
));
3400 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3401 || !TYPE_HAS_COPY_CTOR (type
));
3402 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3403 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3404 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3405 || TYPE_HAS_COMPLEX_DFLT (type
));
3408 if (TYPE_HAS_COPY_CTOR (type
)
3409 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3410 *cant_have_const_ctor
= 1;
3412 if (TYPE_HAS_COPY_ASSIGN (type
)
3413 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3414 *no_const_asn_ref
= 1;
3417 check_abi_tags (t
, field
);
3419 if (DECL_INITIAL (field
) != NULL_TREE
)
3421 /* `build_class_init_list' does not recognize
3423 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3424 error ("multiple fields in union %qT initialized", t
);
3425 *any_default_members
= 1;
3429 /* Check the data members (both static and non-static), class-scoped
3430 typedefs, etc., appearing in the declaration of T. Issue
3431 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3432 declaration order) of access declarations; each TREE_VALUE in this
3433 list is a USING_DECL.
3435 In addition, set the following flags:
3438 The class is empty, i.e., contains no non-static data members.
3440 CANT_HAVE_CONST_CTOR_P
3441 This class cannot have an implicitly generated copy constructor
3442 taking a const reference.
3444 CANT_HAVE_CONST_ASN_REF
3445 This class cannot have an implicitly generated assignment
3446 operator taking a const reference.
3448 All of these flags should be initialized before calling this
3451 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3452 fields can be added by adding to this chain. */
3455 check_field_decls (tree t
, tree
*access_decls
,
3456 int *cant_have_const_ctor_p
,
3457 int *no_const_asn_ref_p
)
3462 int any_default_members
;
3464 int field_access
= -1;
3466 /* Assume there are no access declarations. */
3467 *access_decls
= NULL_TREE
;
3468 /* Assume this class has no pointer members. */
3469 has_pointers
= false;
3470 /* Assume none of the members of this class have default
3472 any_default_members
= 0;
3474 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3477 tree type
= TREE_TYPE (x
);
3478 int this_field_access
;
3480 next
= &DECL_CHAIN (x
);
3482 if (TREE_CODE (x
) == USING_DECL
)
3484 /* Save the access declarations for our caller. */
3485 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3489 if (TREE_CODE (x
) == TYPE_DECL
3490 || TREE_CODE (x
) == TEMPLATE_DECL
)
3493 /* If we've gotten this far, it's a data member, possibly static,
3494 or an enumerator. */
3495 if (TREE_CODE (x
) != CONST_DECL
)
3496 DECL_CONTEXT (x
) = t
;
3498 /* When this goes into scope, it will be a non-local reference. */
3499 DECL_NONLOCAL (x
) = 1;
3501 if (TREE_CODE (t
) == UNION_TYPE
3502 && cxx_dialect
< cxx11
)
3504 /* [class.union] (C++98)
3506 If a union contains a static data member, or a member of
3507 reference type, the program is ill-formed.
3509 In C++11 this limitation doesn't exist anymore. */
3512 error ("in C++98 %q+D may not be static because it is "
3513 "a member of a union", x
);
3516 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3518 error ("in C++98 %q+D may not have reference type %qT "
3519 "because it is a member of a union", x
, type
);
3524 /* Perform error checking that did not get done in
3526 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3528 error ("field %q+D invalidly declared function type", x
);
3529 type
= build_pointer_type (type
);
3530 TREE_TYPE (x
) = type
;
3532 else if (TREE_CODE (type
) == METHOD_TYPE
)
3534 error ("field %q+D invalidly declared method type", x
);
3535 type
= build_pointer_type (type
);
3536 TREE_TYPE (x
) = type
;
3539 if (type
== error_mark_node
)
3542 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3545 /* Now it can only be a FIELD_DECL. */
3547 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3548 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3550 /* If at least one non-static data member is non-literal, the whole
3551 class becomes non-literal. Per Core/1453, volatile non-static
3552 data members and base classes are also not allowed.
3553 Note: if the type is incomplete we will complain later on. */
3554 if (COMPLETE_TYPE_P (type
)
3555 && (!literal_type_p (type
) || CP_TYPE_VOLATILE_P (type
)))
3556 CLASSTYPE_LITERAL_P (t
) = false;
3558 /* A standard-layout class is a class that:
3560 has the same access control (Clause 11) for all non-static data members,
3562 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3563 if (field_access
== -1)
3564 field_access
= this_field_access
;
3565 else if (this_field_access
!= field_access
)
3566 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3568 /* If this is of reference type, check if it needs an init. */
3569 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3571 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3572 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3573 if (DECL_INITIAL (x
) == NULL_TREE
)
3574 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3576 /* ARM $12.6.2: [A member initializer list] (or, for an
3577 aggregate, initialization by a brace-enclosed list) is the
3578 only way to initialize nonstatic const and reference
3580 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3581 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3584 type
= strip_array_types (type
);
3586 if (TYPE_PACKED (t
))
3588 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3592 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3596 else if (DECL_C_BIT_FIELD (x
)
3597 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3598 DECL_PACKED (x
) = 1;
3601 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3602 /* We don't treat zero-width bitfields as making a class
3607 /* The class is non-empty. */
3608 CLASSTYPE_EMPTY_P (t
) = 0;
3609 /* The class is not even nearly empty. */
3610 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3611 /* If one of the data members contains an empty class,
3613 if (CLASS_TYPE_P (type
)
3614 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3615 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3618 /* This is used by -Weffc++ (see below). Warn only for pointers
3619 to members which might hold dynamic memory. So do not warn
3620 for pointers to functions or pointers to members. */
3621 if (TYPE_PTR_P (type
)
3622 && !TYPE_PTRFN_P (type
))
3623 has_pointers
= true;
3625 if (CLASS_TYPE_P (type
))
3627 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3628 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3629 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3630 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3633 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3634 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3636 if (DECL_MUTABLE_P (x
))
3638 if (CP_TYPE_CONST_P (type
))
3640 error ("member %q+D cannot be declared both %<const%> "
3641 "and %<mutable%>", x
);
3644 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3646 error ("member %q+D cannot be declared as a %<mutable%> "
3652 if (! layout_pod_type_p (type
))
3653 /* DR 148 now allows pointers to members (which are POD themselves),
3654 to be allowed in POD structs. */
3655 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3657 if (!std_layout_type_p (type
))
3658 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3660 if (! zero_init_p (type
))
3661 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3663 /* We set DECL_C_BIT_FIELD in grokbitfield.
3664 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3665 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3666 check_field_decl (x
, t
,
3667 cant_have_const_ctor_p
,
3669 &any_default_members
);
3671 /* Now that we've removed bit-field widths from DECL_INITIAL,
3672 anything left in DECL_INITIAL is an NSDMI that makes the class
3673 non-aggregate in C++11. */
3674 if (DECL_INITIAL (x
) && cxx_dialect
< cxx14
)
3675 CLASSTYPE_NON_AGGREGATE (t
) = true;
3677 /* If any field is const, the structure type is pseudo-const. */
3678 if (CP_TYPE_CONST_P (type
))
3680 C_TYPE_FIELDS_READONLY (t
) = 1;
3681 if (DECL_INITIAL (x
) == NULL_TREE
)
3682 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3684 /* ARM $12.6.2: [A member initializer list] (or, for an
3685 aggregate, initialization by a brace-enclosed list) is the
3686 only way to initialize nonstatic const and reference
3688 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3689 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3691 /* A field that is pseudo-const makes the structure likewise. */
3692 else if (CLASS_TYPE_P (type
))
3694 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3695 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3696 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3697 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3700 /* Core issue 80: A nonstatic data member is required to have a
3701 different name from the class iff the class has a
3702 user-declared constructor. */
3703 if (constructor_name_p (DECL_NAME (x
), t
)
3704 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3705 permerror (input_location
, "field %q+#D with same name as class", x
);
3708 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3709 it should also define a copy constructor and an assignment operator to
3710 implement the correct copy semantic (deep vs shallow, etc.). As it is
3711 not feasible to check whether the constructors do allocate dynamic memory
3712 and store it within members, we approximate the warning like this:
3714 -- Warn only if there are members which are pointers
3715 -- Warn only if there is a non-trivial constructor (otherwise,
3716 there cannot be memory allocated).
3717 -- Warn only if there is a non-trivial destructor. We assume that the
3718 user at least implemented the cleanup correctly, and a destructor
3719 is needed to free dynamic memory.
3721 This seems enough for practical purposes. */
3724 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3725 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3726 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3728 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3730 if (! TYPE_HAS_COPY_CTOR (t
))
3732 warning (OPT_Weffc__
,
3733 " but does not override %<%T(const %T&)%>", t
, t
);
3734 if (!TYPE_HAS_COPY_ASSIGN (t
))
3735 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3737 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3738 warning (OPT_Weffc__
,
3739 " but does not override %<operator=(const %T&)%>", t
);
3742 /* Non-static data member initializers make the default constructor
3744 if (any_default_members
)
3746 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3747 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3750 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3752 TYPE_PACKED (t
) = 0;
3754 /* Check anonymous struct/anonymous union fields. */
3755 finish_struct_anon (t
);
3757 /* We've built up the list of access declarations in reverse order.
3759 *access_decls
= nreverse (*access_decls
);
3762 /* If TYPE is an empty class type, records its OFFSET in the table of
3766 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3770 if (!is_empty_class (type
))
3773 /* Record the location of this empty object in OFFSETS. */
3774 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3776 n
= splay_tree_insert (offsets
,
3777 (splay_tree_key
) offset
,
3778 (splay_tree_value
) NULL_TREE
);
3779 n
->value
= ((splay_tree_value
)
3780 tree_cons (NULL_TREE
,
3787 /* Returns nonzero if TYPE is an empty class type and there is
3788 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3791 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3796 if (!is_empty_class (type
))
3799 /* Record the location of this empty object in OFFSETS. */
3800 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3804 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3805 if (same_type_p (TREE_VALUE (t
), type
))
3811 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3812 F for every subobject, passing it the type, offset, and table of
3813 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3816 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3817 than MAX_OFFSET will not be walked.
3819 If F returns a nonzero value, the traversal ceases, and that value
3820 is returned. Otherwise, returns zero. */
3823 walk_subobject_offsets (tree type
,
3824 subobject_offset_fn f
,
3831 tree type_binfo
= NULL_TREE
;
3833 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3835 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3838 if (type
== error_mark_node
)
3844 type
= BINFO_TYPE (type
);
3847 if (CLASS_TYPE_P (type
))
3853 /* Avoid recursing into objects that are not interesting. */
3854 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3857 /* Record the location of TYPE. */
3858 r
= (*f
) (type
, offset
, offsets
);
3862 /* Iterate through the direct base classes of TYPE. */
3864 type_binfo
= TYPE_BINFO (type
);
3865 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3869 if (BINFO_VIRTUAL_P (binfo
))
3873 /* We cannot rely on BINFO_OFFSET being set for the base
3874 class yet, but the offsets for direct non-virtual
3875 bases can be calculated by going back to the TYPE. */
3876 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3877 binfo_offset
= size_binop (PLUS_EXPR
,
3879 BINFO_OFFSET (orig_binfo
));
3881 r
= walk_subobject_offsets (binfo
,
3891 if (CLASSTYPE_VBASECLASSES (type
))
3894 vec
<tree
, va_gc
> *vbases
;
3896 /* Iterate through the virtual base classes of TYPE. In G++
3897 3.2, we included virtual bases in the direct base class
3898 loop above, which results in incorrect results; the
3899 correct offsets for virtual bases are only known when
3900 working with the most derived type. */
3902 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3903 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3905 r
= walk_subobject_offsets (binfo
,
3907 size_binop (PLUS_EXPR
,
3909 BINFO_OFFSET (binfo
)),
3918 /* We still have to walk the primary base, if it is
3919 virtual. (If it is non-virtual, then it was walked
3921 tree vbase
= get_primary_binfo (type_binfo
);
3923 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3924 && BINFO_PRIMARY_P (vbase
)
3925 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3927 r
= (walk_subobject_offsets
3929 offsets
, max_offset
, /*vbases_p=*/0));
3936 /* Iterate through the fields of TYPE. */
3937 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3938 if (TREE_CODE (field
) == FIELD_DECL
3939 && TREE_TYPE (field
) != error_mark_node
3940 && !DECL_ARTIFICIAL (field
))
3944 field_offset
= byte_position (field
);
3946 r
= walk_subobject_offsets (TREE_TYPE (field
),
3948 size_binop (PLUS_EXPR
,
3958 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3960 tree element_type
= strip_array_types (type
);
3961 tree domain
= TYPE_DOMAIN (type
);
3964 /* Avoid recursing into objects that are not interesting. */
3965 if (!CLASS_TYPE_P (element_type
)
3966 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3969 /* Step through each of the elements in the array. */
3970 for (index
= size_zero_node
;
3971 !tree_int_cst_lt (TYPE_MAX_VALUE (domain
), index
);
3972 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3974 r
= walk_subobject_offsets (TREE_TYPE (type
),
3982 offset
= size_binop (PLUS_EXPR
, offset
,
3983 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3984 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3985 there's no point in iterating through the remaining
3986 elements of the array. */
3987 if (max_offset
&& tree_int_cst_lt (max_offset
, offset
))
3995 /* Record all of the empty subobjects of TYPE (either a type or a
3996 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3997 is being placed at OFFSET; otherwise, it is a base class that is
3998 being placed at OFFSET. */
4001 record_subobject_offsets (tree type
,
4004 bool is_data_member
)
4007 /* If recording subobjects for a non-static data member or a
4008 non-empty base class , we do not need to record offsets beyond
4009 the size of the biggest empty class. Additional data members
4010 will go at the end of the class. Additional base classes will go
4011 either at offset zero (if empty, in which case they cannot
4012 overlap with offsets past the size of the biggest empty class) or
4013 at the end of the class.
4015 However, if we are placing an empty base class, then we must record
4016 all offsets, as either the empty class is at offset zero (where
4017 other empty classes might later be placed) or at the end of the
4018 class (where other objects might then be placed, so other empty
4019 subobjects might later overlap). */
4021 || !is_empty_class (BINFO_TYPE (type
)))
4022 max_offset
= sizeof_biggest_empty_class
;
4024 max_offset
= NULL_TREE
;
4025 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
4026 offsets
, max_offset
, is_data_member
);
4029 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4030 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4031 virtual bases of TYPE are examined. */
4034 layout_conflict_p (tree type
,
4039 splay_tree_node max_node
;
4041 /* Get the node in OFFSETS that indicates the maximum offset where
4042 an empty subobject is located. */
4043 max_node
= splay_tree_max (offsets
);
4044 /* If there aren't any empty subobjects, then there's no point in
4045 performing this check. */
4049 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
4050 offsets
, (tree
) (max_node
->key
),
4054 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4055 non-static data member of the type indicated by RLI. BINFO is the
4056 binfo corresponding to the base subobject, OFFSETS maps offsets to
4057 types already located at those offsets. This function determines
4058 the position of the DECL. */
4061 layout_nonempty_base_or_field (record_layout_info rli
,
4066 tree offset
= NULL_TREE
;
4072 /* For the purposes of determining layout conflicts, we want to
4073 use the class type of BINFO; TREE_TYPE (DECL) will be the
4074 CLASSTYPE_AS_BASE version, which does not contain entries for
4075 zero-sized bases. */
4076 type
= TREE_TYPE (binfo
);
4081 type
= TREE_TYPE (decl
);
4085 /* Try to place the field. It may take more than one try if we have
4086 a hard time placing the field without putting two objects of the
4087 same type at the same address. */
4090 struct record_layout_info_s old_rli
= *rli
;
4092 /* Place this field. */
4093 place_field (rli
, decl
);
4094 offset
= byte_position (decl
);
4096 /* We have to check to see whether or not there is already
4097 something of the same type at the offset we're about to use.
4098 For example, consider:
4101 struct T : public S { int i; };
4102 struct U : public S, public T {};
4104 Here, we put S at offset zero in U. Then, we can't put T at
4105 offset zero -- its S component would be at the same address
4106 as the S we already allocated. So, we have to skip ahead.
4107 Since all data members, including those whose type is an
4108 empty class, have nonzero size, any overlap can happen only
4109 with a direct or indirect base-class -- it can't happen with
4111 /* In a union, overlap is permitted; all members are placed at
4113 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4115 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4118 /* Strip off the size allocated to this field. That puts us
4119 at the first place we could have put the field with
4120 proper alignment. */
4123 /* Bump up by the alignment required for the type. */
4125 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4127 ? CLASSTYPE_ALIGN (type
)
4128 : TYPE_ALIGN (type
)));
4129 normalize_rli (rli
);
4132 /* There was no conflict. We're done laying out this field. */
4136 /* Now that we know where it will be placed, update its
4138 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4139 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4140 this point because their BINFO_OFFSET is copied from another
4141 hierarchy. Therefore, we may not need to add the entire
4143 propagate_binfo_offsets (binfo
,
4144 size_diffop_loc (input_location
,
4145 convert (ssizetype
, offset
),
4147 BINFO_OFFSET (binfo
))));
4150 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4153 empty_base_at_nonzero_offset_p (tree type
,
4155 splay_tree
/*offsets*/)
4157 return is_empty_class (type
) && !integer_zerop (offset
);
4160 /* Layout the empty base BINFO. EOC indicates the byte currently just
4161 past the end of the class, and should be correctly aligned for a
4162 class of the type indicated by BINFO; OFFSETS gives the offsets of
4163 the empty bases allocated so far. T is the most derived
4164 type. Return nonzero iff we added it at the end. */
4167 layout_empty_base (record_layout_info rli
, tree binfo
,
4168 tree eoc
, splay_tree offsets
)
4171 tree basetype
= BINFO_TYPE (binfo
);
4174 /* This routine should only be used for empty classes. */
4175 gcc_assert (is_empty_class (basetype
));
4176 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4178 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4179 propagate_binfo_offsets
4180 (binfo
, size_diffop_loc (input_location
,
4181 size_zero_node
, BINFO_OFFSET (binfo
)));
4183 /* This is an empty base class. We first try to put it at offset
4185 if (layout_conflict_p (binfo
,
4186 BINFO_OFFSET (binfo
),
4190 /* That didn't work. Now, we move forward from the next
4191 available spot in the class. */
4193 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4196 if (!layout_conflict_p (binfo
,
4197 BINFO_OFFSET (binfo
),
4200 /* We finally found a spot where there's no overlap. */
4203 /* There's overlap here, too. Bump along to the next spot. */
4204 propagate_binfo_offsets (binfo
, alignment
);
4208 if (CLASSTYPE_USER_ALIGN (basetype
))
4210 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4212 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4213 TYPE_USER_ALIGN (rli
->t
) = 1;
4219 /* Layout the base given by BINFO in the class indicated by RLI.
4220 *BASE_ALIGN is a running maximum of the alignments of
4221 any base class. OFFSETS gives the location of empty base
4222 subobjects. T is the most derived type. Return nonzero if the new
4223 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4224 *NEXT_FIELD, unless BINFO is for an empty base class.
4226 Returns the location at which the next field should be inserted. */
4229 build_base_field (record_layout_info rli
, tree binfo
,
4230 splay_tree offsets
, tree
*next_field
)
4233 tree basetype
= BINFO_TYPE (binfo
);
4235 if (!COMPLETE_TYPE_P (basetype
))
4236 /* This error is now reported in xref_tag, thus giving better
4237 location information. */
4240 /* Place the base class. */
4241 if (!is_empty_class (basetype
))
4245 /* The containing class is non-empty because it has a non-empty
4247 CLASSTYPE_EMPTY_P (t
) = 0;
4249 /* Create the FIELD_DECL. */
4250 decl
= build_decl (input_location
,
4251 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4252 DECL_ARTIFICIAL (decl
) = 1;
4253 DECL_IGNORED_P (decl
) = 1;
4254 DECL_FIELD_CONTEXT (decl
) = t
;
4255 if (CLASSTYPE_AS_BASE (basetype
))
4257 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4258 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4259 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4260 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4261 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4262 DECL_FIELD_IS_BASE (decl
) = 1;
4264 /* Try to place the field. It may take more than one try if we
4265 have a hard time placing the field without putting two
4266 objects of the same type at the same address. */
4267 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4268 /* Add the new FIELD_DECL to the list of fields for T. */
4269 DECL_CHAIN (decl
) = *next_field
;
4271 next_field
= &DECL_CHAIN (decl
);
4279 /* On some platforms (ARM), even empty classes will not be
4281 eoc
= round_up_loc (input_location
,
4282 rli_size_unit_so_far (rli
),
4283 CLASSTYPE_ALIGN_UNIT (basetype
));
4284 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4285 /* A nearly-empty class "has no proper base class that is empty,
4286 not morally virtual, and at an offset other than zero." */
4287 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4290 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4291 /* The check above (used in G++ 3.2) is insufficient because
4292 an empty class placed at offset zero might itself have an
4293 empty base at a nonzero offset. */
4294 else if (walk_subobject_offsets (basetype
,
4295 empty_base_at_nonzero_offset_p
,
4298 /*max_offset=*/NULL_TREE
,
4300 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4303 /* We do not create a FIELD_DECL for empty base classes because
4304 it might overlap some other field. We want to be able to
4305 create CONSTRUCTORs for the class by iterating over the
4306 FIELD_DECLs, and the back end does not handle overlapping
4309 /* An empty virtual base causes a class to be non-empty
4310 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4311 here because that was already done when the virtual table
4312 pointer was created. */
4315 /* Record the offsets of BINFO and its base subobjects. */
4316 record_subobject_offsets (binfo
,
4317 BINFO_OFFSET (binfo
),
4319 /*is_data_member=*/false);
4324 /* Layout all of the non-virtual base classes. Record empty
4325 subobjects in OFFSETS. T is the most derived type. Return nonzero
4326 if the type cannot be nearly empty. The fields created
4327 corresponding to the base classes will be inserted at
4331 build_base_fields (record_layout_info rli
,
4332 splay_tree offsets
, tree
*next_field
)
4334 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4337 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4340 /* The primary base class is always allocated first. */
4341 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4342 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4343 offsets
, next_field
);
4345 /* Now allocate the rest of the bases. */
4346 for (i
= 0; i
< n_baseclasses
; ++i
)
4350 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4352 /* The primary base was already allocated above, so we don't
4353 need to allocate it again here. */
4354 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4357 /* Virtual bases are added at the end (a primary virtual base
4358 will have already been added). */
4359 if (BINFO_VIRTUAL_P (base_binfo
))
4362 next_field
= build_base_field (rli
, base_binfo
,
4363 offsets
, next_field
);
4367 /* Go through the TYPE_METHODS of T issuing any appropriate
4368 diagnostics, figuring out which methods override which other
4369 methods, and so forth. */
4372 check_methods (tree t
)
4376 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4378 check_for_override (x
, t
);
4379 if (DECL_PURE_VIRTUAL_P (x
) && (TREE_CODE (x
) != FUNCTION_DECL
|| ! DECL_VINDEX (x
)))
4380 error ("initializer specified for non-virtual method %q+D", x
);
4381 /* The name of the field is the original field name
4382 Save this in auxiliary field for later overloading. */
4383 if (TREE_CODE (x
) == FUNCTION_DECL
&& DECL_VINDEX (x
))
4385 TYPE_POLYMORPHIC_P (t
) = 1;
4386 if (DECL_PURE_VIRTUAL_P (x
))
4387 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4389 /* All user-provided destructors are non-trivial.
4390 Constructors and assignment ops are handled in
4391 grok_special_member_properties. */
4392 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4393 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4397 /* FN is a constructor or destructor. Clone the declaration to create
4398 a specialized in-charge or not-in-charge version, as indicated by
4402 build_clone (tree fn
, tree name
)
4407 /* Copy the function. */
4408 clone
= copy_decl (fn
);
4409 /* Reset the function name. */
4410 DECL_NAME (clone
) = name
;
4411 /* Remember where this function came from. */
4412 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4413 /* Make it easy to find the CLONE given the FN. */
4414 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4415 DECL_CHAIN (fn
) = clone
;
4417 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4418 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4420 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4421 DECL_TEMPLATE_RESULT (clone
) = result
;
4422 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4423 DECL_TI_TEMPLATE (result
) = clone
;
4424 TREE_TYPE (clone
) = TREE_TYPE (result
);
4428 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4429 DECL_CLONED_FUNCTION (clone
) = fn
;
4430 /* There's no pending inline data for this function. */
4431 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4432 DECL_PENDING_INLINE_P (clone
) = 0;
4434 /* The base-class destructor is not virtual. */
4435 if (name
== base_dtor_identifier
)
4437 DECL_VIRTUAL_P (clone
) = 0;
4438 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4439 DECL_VINDEX (clone
) = NULL_TREE
;
4442 /* If there was an in-charge parameter, drop it from the function
4444 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4450 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4451 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4452 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4453 /* Skip the `this' parameter. */
4454 parmtypes
= TREE_CHAIN (parmtypes
);
4455 /* Skip the in-charge parameter. */
4456 parmtypes
= TREE_CHAIN (parmtypes
);
4457 /* And the VTT parm, in a complete [cd]tor. */
4458 if (DECL_HAS_VTT_PARM_P (fn
)
4459 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4460 parmtypes
= TREE_CHAIN (parmtypes
);
4461 /* If this is subobject constructor or destructor, add the vtt
4464 = build_method_type_directly (basetype
,
4465 TREE_TYPE (TREE_TYPE (clone
)),
4468 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4471 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4472 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4475 /* Copy the function parameters. */
4476 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4477 /* Remove the in-charge parameter. */
4478 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4480 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4481 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4482 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4484 /* And the VTT parm, in a complete [cd]tor. */
4485 if (DECL_HAS_VTT_PARM_P (fn
))
4487 if (DECL_NEEDS_VTT_PARM_P (clone
))
4488 DECL_HAS_VTT_PARM_P (clone
) = 1;
4491 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4492 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4493 DECL_HAS_VTT_PARM_P (clone
) = 0;
4497 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4499 DECL_CONTEXT (parms
) = clone
;
4500 cxx_dup_lang_specific_decl (parms
);
4503 /* Create the RTL for this function. */
4504 SET_DECL_RTL (clone
, NULL
);
4505 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4508 note_decl_for_pch (clone
);
4513 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4514 not invoke this function directly.
4516 For a non-thunk function, returns the address of the slot for storing
4517 the function it is a clone of. Otherwise returns NULL_TREE.
4519 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4520 cloned_function is unset. This is to support the separate
4521 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4522 on a template makes sense, but not the former. */
4525 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4529 decl
= STRIP_TEMPLATE (decl
);
4531 if (TREE_CODE (decl
) != FUNCTION_DECL
4532 || !DECL_LANG_SPECIFIC (decl
)
4533 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4535 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4537 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4543 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4544 if (just_testing
&& *ptr
== NULL_TREE
)
4550 /* Produce declarations for all appropriate clones of FN. If
4551 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4552 CLASTYPE_METHOD_VEC as well. */
4555 clone_function_decl (tree fn
, int update_method_vec_p
)
4559 /* Avoid inappropriate cloning. */
4561 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4564 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4566 /* For each constructor, we need two variants: an in-charge version
4567 and a not-in-charge version. */
4568 clone
= build_clone (fn
, complete_ctor_identifier
);
4569 if (update_method_vec_p
)
4570 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4571 clone
= build_clone (fn
, base_ctor_identifier
);
4572 if (update_method_vec_p
)
4573 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4577 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4579 /* For each destructor, we need three variants: an in-charge
4580 version, a not-in-charge version, and an in-charge deleting
4581 version. We clone the deleting version first because that
4582 means it will go second on the TYPE_METHODS list -- and that
4583 corresponds to the correct layout order in the virtual
4586 For a non-virtual destructor, we do not build a deleting
4588 if (DECL_VIRTUAL_P (fn
))
4590 clone
= build_clone (fn
, deleting_dtor_identifier
);
4591 if (update_method_vec_p
)
4592 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4594 clone
= build_clone (fn
, complete_dtor_identifier
);
4595 if (update_method_vec_p
)
4596 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4597 clone
= build_clone (fn
, base_dtor_identifier
);
4598 if (update_method_vec_p
)
4599 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4602 /* Note that this is an abstract function that is never emitted. */
4603 DECL_ABSTRACT_P (fn
) = true;
4606 /* DECL is an in charge constructor, which is being defined. This will
4607 have had an in class declaration, from whence clones were
4608 declared. An out-of-class definition can specify additional default
4609 arguments. As it is the clones that are involved in overload
4610 resolution, we must propagate the information from the DECL to its
4614 adjust_clone_args (tree decl
)
4618 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4619 clone
= DECL_CHAIN (clone
))
4621 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4622 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4623 tree decl_parms
, clone_parms
;
4625 clone_parms
= orig_clone_parms
;
4627 /* Skip the 'this' parameter. */
4628 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4629 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4631 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4632 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4633 if (DECL_HAS_VTT_PARM_P (decl
))
4634 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4636 clone_parms
= orig_clone_parms
;
4637 if (DECL_HAS_VTT_PARM_P (clone
))
4638 clone_parms
= TREE_CHAIN (clone_parms
);
4640 for (decl_parms
= orig_decl_parms
; decl_parms
;
4641 decl_parms
= TREE_CHAIN (decl_parms
),
4642 clone_parms
= TREE_CHAIN (clone_parms
))
4644 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4645 TREE_TYPE (clone_parms
)));
4647 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4649 /* A default parameter has been added. Adjust the
4650 clone's parameters. */
4651 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4652 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4653 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4656 clone_parms
= orig_decl_parms
;
4658 if (DECL_HAS_VTT_PARM_P (clone
))
4660 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4661 TREE_VALUE (orig_clone_parms
),
4663 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4665 type
= build_method_type_directly (basetype
,
4666 TREE_TYPE (TREE_TYPE (clone
)),
4669 type
= build_exception_variant (type
, exceptions
);
4671 type
= cp_build_type_attribute_variant (type
, attrs
);
4672 TREE_TYPE (clone
) = type
;
4674 clone_parms
= NULL_TREE
;
4678 gcc_assert (!clone_parms
);
4682 /* For each of the constructors and destructors in T, create an
4683 in-charge and not-in-charge variant. */
4686 clone_constructors_and_destructors (tree t
)
4690 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4692 if (!CLASSTYPE_METHOD_VEC (t
))
4695 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4696 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4697 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4698 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4701 /* Deduce noexcept for a destructor DTOR. */
4704 deduce_noexcept_on_destructor (tree dtor
)
4706 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4708 tree eh_spec
= unevaluated_noexcept_spec ();
4709 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4713 /* For each destructor in T, deduce noexcept:
4715 12.4/3: A declaration of a destructor that does not have an
4716 exception-specification is implicitly considered to have the
4717 same exception-specification as an implicit declaration (15.4). */
4720 deduce_noexcept_on_destructors (tree t
)
4722 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4724 if (!CLASSTYPE_METHOD_VEC (t
))
4727 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4728 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4731 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4732 of TYPE for virtual functions which FNDECL overrides. Return a
4733 mask of the tm attributes found therein. */
4736 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4738 tree binfo
= TYPE_BINFO (type
);
4742 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4744 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4746 if (!TYPE_POLYMORPHIC_P (basetype
))
4749 o
= look_for_overrides_here (basetype
, fndecl
);
4751 found
|= tm_attr_to_mask (find_tm_attribute
4752 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4754 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4760 /* Subroutine of set_method_tm_attributes. Handle the checks and
4761 inheritance for one virtual method FNDECL. */
4764 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4769 found
= look_for_tm_attr_overrides (type
, fndecl
);
4771 /* If FNDECL doesn't actually override anything (i.e. T is the
4772 class that first declares FNDECL virtual), then we're done. */
4776 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4777 have
= tm_attr_to_mask (tm_attr
);
4779 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4780 tm_pure must match exactly, otherwise no weakening of
4781 tm_safe > tm_callable > nothing. */
4782 /* ??? The tm_pure attribute didn't make the transition to the
4783 multivendor language spec. */
4784 if (have
== TM_ATTR_PURE
)
4786 if (found
!= TM_ATTR_PURE
)
4792 /* If the overridden function is tm_pure, then FNDECL must be. */
4793 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4795 /* Look for base class combinations that cannot be satisfied. */
4796 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4798 found
&= ~TM_ATTR_PURE
;
4800 error_at (DECL_SOURCE_LOCATION (fndecl
),
4801 "method overrides both %<transaction_pure%> and %qE methods",
4802 tm_mask_to_attr (found
));
4804 /* If FNDECL did not declare an attribute, then inherit the most
4806 else if (tm_attr
== NULL
)
4808 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4810 /* Otherwise validate that we're not weaker than a function
4811 that is being overridden. */
4815 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4821 error_at (DECL_SOURCE_LOCATION (fndecl
),
4822 "method declared %qE overriding %qE method",
4823 tm_attr
, tm_mask_to_attr (found
));
4826 /* For each of the methods in T, propagate a class-level tm attribute. */
4829 set_method_tm_attributes (tree t
)
4831 tree class_tm_attr
, fndecl
;
4833 /* Don't bother collecting tm attributes if transactional memory
4834 support is not enabled. */
4838 /* Process virtual methods first, as they inherit directly from the
4839 base virtual function and also require validation of new attributes. */
4840 if (TYPE_CONTAINS_VPTR_P (t
))
4843 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4844 vchain
= TREE_CHAIN (vchain
))
4846 fndecl
= BV_FN (vchain
);
4847 if (DECL_THUNK_P (fndecl
))
4848 fndecl
= THUNK_TARGET (fndecl
);
4849 set_one_vmethod_tm_attributes (t
, fndecl
);
4853 /* If the class doesn't have an attribute, nothing more to do. */
4854 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4855 if (class_tm_attr
== NULL
)
4858 /* Any method that does not yet have a tm attribute inherits
4859 the one from the class. */
4860 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4862 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4863 apply_tm_attr (fndecl
, class_tm_attr
);
4867 /* Returns true iff class T has a user-defined constructor other than
4868 the default constructor. */
4871 type_has_user_nondefault_constructor (tree t
)
4875 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4878 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4880 tree fn
= OVL_CURRENT (fns
);
4881 if (!DECL_ARTIFICIAL (fn
)
4882 && (TREE_CODE (fn
) == TEMPLATE_DECL
4883 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4891 /* Returns the defaulted constructor if T has one. Otherwise, returns
4895 in_class_defaulted_default_constructor (tree t
)
4899 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4902 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4904 tree fn
= OVL_CURRENT (fns
);
4906 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4908 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4909 while (args
&& TREE_PURPOSE (args
))
4910 args
= TREE_CHAIN (args
);
4911 if (!args
|| args
== void_list_node
)
4919 /* Returns true iff FN is a user-provided function, i.e. user-declared
4920 and not defaulted at its first declaration; or explicit, private,
4921 protected, or non-const. */
4924 user_provided_p (tree fn
)
4926 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4929 return (!DECL_ARTIFICIAL (fn
)
4930 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4931 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4934 /* Returns true iff class T has a user-provided constructor. */
4937 type_has_user_provided_constructor (tree t
)
4941 if (!CLASS_TYPE_P (t
))
4944 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4947 /* This can happen in error cases; avoid crashing. */
4948 if (!CLASSTYPE_METHOD_VEC (t
))
4951 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4952 if (user_provided_p (OVL_CURRENT (fns
)))
4958 /* Returns true iff class T has a non-user-provided (i.e. implicitly
4959 declared or explicitly defaulted in the class body) default
4963 type_has_non_user_provided_default_constructor (tree t
)
4967 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (t
))
4969 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
4972 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4974 tree fn
= OVL_CURRENT (fns
);
4975 if (TREE_CODE (fn
) == FUNCTION_DECL
4976 && !user_provided_p (fn
)
4977 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4984 /* TYPE is being used as a virtual base, and has a non-trivial move
4985 assignment. Return true if this is due to there being a user-provided
4986 move assignment in TYPE or one of its subobjects; if there isn't, then
4987 multiple move assignment can't cause any harm. */
4990 vbase_has_user_provided_move_assign (tree type
)
4992 /* Does the type itself have a user-provided move assignment operator? */
4994 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4995 fns
; fns
= OVL_NEXT (fns
))
4997 tree fn
= OVL_CURRENT (fns
);
4998 if (move_fn_p (fn
) && user_provided_p (fn
))
5002 /* Do any of its bases? */
5003 tree binfo
= TYPE_BINFO (type
);
5005 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5006 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
5009 /* Or non-static data members? */
5010 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
5012 if (TREE_CODE (field
) == FIELD_DECL
5013 && CLASS_TYPE_P (TREE_TYPE (field
))
5014 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
5022 /* If default-initialization leaves part of TYPE uninitialized, returns
5023 a DECL for the field or TYPE itself (DR 253). */
5026 default_init_uninitialized_part (tree type
)
5031 type
= strip_array_types (type
);
5032 if (!CLASS_TYPE_P (type
))
5034 if (!type_has_non_user_provided_default_constructor (type
))
5036 for (binfo
= TYPE_BINFO (type
), i
= 0;
5037 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
5039 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
5043 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
5044 if (TREE_CODE (t
) == FIELD_DECL
5045 && !DECL_ARTIFICIAL (t
)
5046 && !DECL_INITIAL (t
))
5048 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5050 return DECL_P (r
) ? r
: t
;
5056 /* Returns true iff for class T, a trivial synthesized default constructor
5057 would be constexpr. */
5060 trivial_default_constructor_is_constexpr (tree t
)
5062 /* A defaulted trivial default constructor is constexpr
5063 if there is nothing to initialize. */
5064 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5065 return is_really_empty_class (t
);
5068 /* Returns true iff class T has a constexpr default constructor. */
5071 type_has_constexpr_default_constructor (tree t
)
5075 if (!CLASS_TYPE_P (t
))
5077 /* The caller should have stripped an enclosing array. */
5078 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5081 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5083 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5084 return trivial_default_constructor_is_constexpr (t
);
5085 /* Non-trivial, we need to check subobject constructors. */
5086 lazily_declare_fn (sfk_constructor
, t
);
5088 fns
= locate_ctor (t
);
5089 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5092 /* Returns true iff class TYPE has a virtual destructor. */
5095 type_has_virtual_destructor (tree type
)
5099 if (!CLASS_TYPE_P (type
))
5102 gcc_assert (COMPLETE_TYPE_P (type
));
5103 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5104 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5107 /* Returns true iff class T has a move constructor. */
5110 type_has_move_constructor (tree t
)
5114 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5116 gcc_assert (COMPLETE_TYPE_P (t
));
5117 lazily_declare_fn (sfk_move_constructor
, t
);
5120 if (!CLASSTYPE_METHOD_VEC (t
))
5123 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5124 if (move_fn_p (OVL_CURRENT (fns
)))
5130 /* Returns true iff class T has a move assignment operator. */
5133 type_has_move_assign (tree t
)
5137 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5139 gcc_assert (COMPLETE_TYPE_P (t
));
5140 lazily_declare_fn (sfk_move_assignment
, t
);
5143 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5144 fns
; fns
= OVL_NEXT (fns
))
5145 if (move_fn_p (OVL_CURRENT (fns
)))
5151 /* Returns true iff class T has a move constructor that was explicitly
5152 declared in the class body. Note that this is different from
5153 "user-provided", which doesn't include functions that are defaulted in
5157 type_has_user_declared_move_constructor (tree t
)
5161 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5164 if (!CLASSTYPE_METHOD_VEC (t
))
5167 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5169 tree fn
= OVL_CURRENT (fns
);
5170 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5177 /* Returns true iff class T has a move assignment operator that was
5178 explicitly declared in the class body. */
5181 type_has_user_declared_move_assign (tree t
)
5185 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5188 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5189 fns
; fns
= OVL_NEXT (fns
))
5191 tree fn
= OVL_CURRENT (fns
);
5192 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5199 /* Nonzero if we need to build up a constructor call when initializing an
5200 object of this class, either because it has a user-declared constructor
5201 or because it doesn't have a default constructor (so we need to give an
5202 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5203 what you care about is whether or not an object can be produced by a
5204 constructor (e.g. so we don't set TREE_READONLY on const variables of
5205 such type); use this function when what you care about is whether or not
5206 to try to call a constructor to create an object. The latter case is
5207 the former plus some cases of constructors that cannot be called. */
5210 type_build_ctor_call (tree t
)
5213 if (TYPE_NEEDS_CONSTRUCTING (t
))
5215 inner
= strip_array_types (t
);
5216 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5218 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5220 if (cxx_dialect
< cxx11
)
5222 /* A user-declared constructor might be private, and a constructor might
5223 be trivial but deleted. */
5224 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5225 fns
; fns
= OVL_NEXT (fns
))
5227 tree fn
= OVL_CURRENT (fns
);
5228 if (!DECL_ARTIFICIAL (fn
)
5229 || DECL_DELETED_FN (fn
))
5235 /* Like type_build_ctor_call, but for destructors. */
5238 type_build_dtor_call (tree t
)
5241 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5243 inner
= strip_array_types (t
);
5244 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5245 || !COMPLETE_TYPE_P (inner
))
5247 if (cxx_dialect
< cxx11
)
5249 /* A user-declared destructor might be private, and a destructor might
5250 be trivial but deleted. */
5251 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5252 fns
; fns
= OVL_NEXT (fns
))
5254 tree fn
= OVL_CURRENT (fns
);
5255 if (!DECL_ARTIFICIAL (fn
)
5256 || DECL_DELETED_FN (fn
))
5262 /* Remove all zero-width bit-fields from T. */
5265 remove_zero_width_bit_fields (tree t
)
5269 fieldsp
= &TYPE_FIELDS (t
);
5272 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5273 && DECL_C_BIT_FIELD (*fieldsp
)
5274 /* We should not be confused by the fact that grokbitfield
5275 temporarily sets the width of the bit field into
5276 DECL_INITIAL (*fieldsp).
5277 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5279 && integer_zerop (DECL_SIZE (*fieldsp
)))
5280 *fieldsp
= DECL_CHAIN (*fieldsp
);
5282 fieldsp
= &DECL_CHAIN (*fieldsp
);
5286 /* Returns TRUE iff we need a cookie when dynamically allocating an
5287 array whose elements have the indicated class TYPE. */
5290 type_requires_array_cookie (tree type
)
5293 bool has_two_argument_delete_p
= false;
5295 gcc_assert (CLASS_TYPE_P (type
));
5297 /* If there's a non-trivial destructor, we need a cookie. In order
5298 to iterate through the array calling the destructor for each
5299 element, we'll have to know how many elements there are. */
5300 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5303 /* If the usual deallocation function is a two-argument whose second
5304 argument is of type `size_t', then we have to pass the size of
5305 the array to the deallocation function, so we will need to store
5307 fns
= lookup_fnfields (TYPE_BINFO (type
),
5308 ansi_opname (VEC_DELETE_EXPR
),
5310 /* If there are no `operator []' members, or the lookup is
5311 ambiguous, then we don't need a cookie. */
5312 if (!fns
|| fns
== error_mark_node
)
5314 /* Loop through all of the functions. */
5315 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5320 /* Select the current function. */
5321 fn
= OVL_CURRENT (fns
);
5322 /* See if this function is a one-argument delete function. If
5323 it is, then it will be the usual deallocation function. */
5324 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5325 if (second_parm
== void_list_node
)
5327 /* Do not consider this function if its second argument is an
5331 /* Otherwise, if we have a two-argument function and the second
5332 argument is `size_t', it will be the usual deallocation
5333 function -- unless there is one-argument function, too. */
5334 if (TREE_CHAIN (second_parm
) == void_list_node
5335 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5336 has_two_argument_delete_p
= true;
5339 return has_two_argument_delete_p
;
5342 /* Finish computing the `literal type' property of class type T.
5344 At this point, we have already processed base classes and
5345 non-static data members. We need to check whether the copy
5346 constructor is trivial, the destructor is trivial, and there
5347 is a trivial default constructor or at least one constexpr
5348 constructor other than the copy constructor. */
5351 finalize_literal_type_property (tree t
)
5355 if (cxx_dialect
< cxx11
5356 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5357 CLASSTYPE_LITERAL_P (t
) = false;
5358 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5359 && CLASSTYPE_NON_AGGREGATE (t
)
5360 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5361 CLASSTYPE_LITERAL_P (t
) = false;
5363 if (!CLASSTYPE_LITERAL_P (t
))
5364 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5365 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5366 && TREE_CODE (fn
) != TEMPLATE_DECL
5367 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5368 && !DECL_CONSTRUCTOR_P (fn
))
5370 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5371 if (!DECL_GENERATED_P (fn
))
5373 error ("enclosing class of constexpr non-static member "
5374 "function %q+#D is not a literal type", fn
);
5375 explain_non_literal_class (t
);
5380 /* T is a non-literal type used in a context which requires a constant
5381 expression. Explain why it isn't literal. */
5384 explain_non_literal_class (tree t
)
5386 static hash_set
<tree
> *diagnosed
;
5388 if (!CLASS_TYPE_P (t
))
5390 t
= TYPE_MAIN_VARIANT (t
);
5392 if (diagnosed
== NULL
)
5393 diagnosed
= new hash_set
<tree
>;
5394 if (diagnosed
->add (t
))
5395 /* Already explained. */
5398 inform (0, "%q+T is not literal because:", t
);
5399 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5400 inform (0, " %q+T has a non-trivial destructor", t
);
5401 else if (CLASSTYPE_NON_AGGREGATE (t
)
5402 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5403 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5405 inform (0, " %q+T is not an aggregate, does not have a trivial "
5406 "default constructor, and has no constexpr constructor that "
5407 "is not a copy or move constructor", t
);
5408 if (type_has_non_user_provided_default_constructor (t
))
5410 /* Note that we can't simply call locate_ctor because when the
5411 constructor is deleted it just returns NULL_TREE. */
5413 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5415 tree fn
= OVL_CURRENT (fns
);
5416 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5418 parms
= skip_artificial_parms_for (fn
, parms
);
5420 if (sufficient_parms_p (parms
))
5422 if (DECL_DELETED_FN (fn
))
5423 maybe_explain_implicit_delete (fn
);
5425 explain_invalid_constexpr_fn (fn
);
5433 tree binfo
, base_binfo
, field
; int i
;
5434 for (binfo
= TYPE_BINFO (t
), i
= 0;
5435 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5437 tree basetype
= TREE_TYPE (base_binfo
);
5438 if (!CLASSTYPE_LITERAL_P (basetype
))
5440 inform (0, " base class %qT of %q+T is non-literal",
5442 explain_non_literal_class (basetype
);
5446 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5449 if (TREE_CODE (field
) != FIELD_DECL
)
5451 ftype
= TREE_TYPE (field
);
5452 if (!literal_type_p (ftype
))
5454 inform (0, " non-static data member %q+D has "
5455 "non-literal type", field
);
5456 if (CLASS_TYPE_P (ftype
))
5457 explain_non_literal_class (ftype
);
5459 if (CP_TYPE_VOLATILE_P (ftype
))
5460 inform (0, " non-static data member %q+D has "
5461 "volatile type", field
);
5466 /* Check the validity of the bases and members declared in T. Add any
5467 implicitly-generated functions (like copy-constructors and
5468 assignment operators). Compute various flag bits (like
5469 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5470 level: i.e., independently of the ABI in use. */
5473 check_bases_and_members (tree t
)
5475 /* Nonzero if the implicitly generated copy constructor should take
5476 a non-const reference argument. */
5477 int cant_have_const_ctor
;
5478 /* Nonzero if the implicitly generated assignment operator
5479 should take a non-const reference argument. */
5480 int no_const_asn_ref
;
5482 bool saved_complex_asn_ref
;
5483 bool saved_nontrivial_dtor
;
5486 /* By default, we use const reference arguments and generate default
5488 cant_have_const_ctor
= 0;
5489 no_const_asn_ref
= 0;
5491 /* Check all the base-classes. */
5492 check_bases (t
, &cant_have_const_ctor
,
5495 /* Deduce noexcept on destructors. This needs to happen after we've set
5496 triviality flags appropriately for our bases. */
5497 if (cxx_dialect
>= cxx11
)
5498 deduce_noexcept_on_destructors (t
);
5500 /* Check all the method declarations. */
5503 /* Save the initial values of these flags which only indicate whether
5504 or not the class has user-provided functions. As we analyze the
5505 bases and members we can set these flags for other reasons. */
5506 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5507 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5509 /* Check all the data member declarations. We cannot call
5510 check_field_decls until we have called check_bases check_methods,
5511 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5512 being set appropriately. */
5513 check_field_decls (t
, &access_decls
,
5514 &cant_have_const_ctor
,
5517 /* A nearly-empty class has to be vptr-containing; a nearly empty
5518 class contains just a vptr. */
5519 if (!TYPE_CONTAINS_VPTR_P (t
))
5520 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5522 /* Do some bookkeeping that will guide the generation of implicitly
5523 declared member functions. */
5524 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5525 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5526 /* We need to call a constructor for this class if it has a
5527 user-provided constructor, or if the default constructor is going
5528 to initialize the vptr. (This is not an if-and-only-if;
5529 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5530 themselves need constructing.) */
5531 TYPE_NEEDS_CONSTRUCTING (t
)
5532 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5535 An aggregate is an array or a class with no user-provided
5536 constructors ... and no virtual functions.
5538 Again, other conditions for being an aggregate are checked
5540 CLASSTYPE_NON_AGGREGATE (t
)
5541 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5542 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5543 retain the old definition internally for ABI reasons. */
5544 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5545 |= (CLASSTYPE_NON_AGGREGATE (t
)
5546 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5547 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5548 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5549 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5550 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5552 /* If the only explicitly declared default constructor is user-provided,
5553 set TYPE_HAS_COMPLEX_DFLT. */
5554 if (!TYPE_HAS_COMPLEX_DFLT (t
)
5555 && TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5556 && !type_has_non_user_provided_default_constructor (t
))
5557 TYPE_HAS_COMPLEX_DFLT (t
) = true;
5559 /* Warn if a public base of a polymorphic type has an accessible
5560 non-virtual destructor. It is only now that we know the class is
5561 polymorphic. Although a polymorphic base will have a already
5562 been diagnosed during its definition, we warn on use too. */
5563 if (TYPE_POLYMORPHIC_P (t
) && warn_nonvdtor
)
5565 tree binfo
= TYPE_BINFO (t
);
5566 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
5570 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5572 tree basetype
= TREE_TYPE (base_binfo
);
5574 if ((*accesses
)[i
] == access_public_node
5575 && (TYPE_POLYMORPHIC_P (basetype
) || warn_ecpp
)
5576 && accessible_nvdtor_p (basetype
))
5577 warning (OPT_Wnon_virtual_dtor
,
5578 "base class %q#T has accessible non-virtual destructor",
5583 /* If the class has no user-declared constructor, but does have
5584 non-static const or reference data members that can never be
5585 initialized, issue a warning. */
5586 if (warn_uninitialized
5587 /* Classes with user-declared constructors are presumed to
5588 initialize these members. */
5589 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5590 /* Aggregates can be initialized with brace-enclosed
5592 && CLASSTYPE_NON_AGGREGATE (t
))
5596 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5600 if (TREE_CODE (field
) != FIELD_DECL
5601 || DECL_INITIAL (field
) != NULL_TREE
)
5604 type
= TREE_TYPE (field
);
5605 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5606 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5607 "in class without a constructor", field
);
5608 else if (CP_TYPE_CONST_P (type
)
5609 && (!CLASS_TYPE_P (type
)
5610 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5611 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5612 "in class without a constructor", field
);
5616 /* Synthesize any needed methods. */
5617 add_implicitly_declared_members (t
, &access_decls
,
5618 cant_have_const_ctor
,
5621 /* Check defaulted declarations here so we have cant_have_const_ctor
5622 and don't need to worry about clones. */
5623 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5624 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5626 int copy
= copy_fn_p (fn
);
5630 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5631 : !no_const_asn_ref
);
5632 bool fn_const_p
= (copy
== 2);
5634 if (fn_const_p
&& !imp_const_p
)
5635 /* If the function is defaulted outside the class, we just
5636 give the synthesis error. */
5637 error ("%q+D declared to take const reference, but implicit "
5638 "declaration would take non-const", fn
);
5640 defaulted_late_check (fn
);
5643 if (LAMBDA_TYPE_P (t
))
5645 /* "This class type is not an aggregate." */
5646 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5649 /* Compute the 'literal type' property before we
5650 do anything with non-static member functions. */
5651 finalize_literal_type_property (t
);
5653 /* Create the in-charge and not-in-charge variants of constructors
5655 clone_constructors_and_destructors (t
);
5657 /* Process the using-declarations. */
5658 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5659 handle_using_decl (TREE_VALUE (access_decls
), t
);
5661 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5662 finish_struct_methods (t
);
5664 /* Figure out whether or not we will need a cookie when dynamically
5665 allocating an array of this type. */
5666 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5667 = type_requires_array_cookie (t
);
5670 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5671 accordingly. If a new vfield was created (because T doesn't have a
5672 primary base class), then the newly created field is returned. It
5673 is not added to the TYPE_FIELDS list; it is the caller's
5674 responsibility to do that. Accumulate declared virtual functions
5678 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5682 /* Collect the virtual functions declared in T. */
5683 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5684 if (TREE_CODE (fn
) == FUNCTION_DECL
5685 && DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5686 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5688 tree new_virtual
= make_node (TREE_LIST
);
5690 BV_FN (new_virtual
) = fn
;
5691 BV_DELTA (new_virtual
) = integer_zero_node
;
5692 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5694 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5695 *virtuals_p
= new_virtual
;
5698 /* If we couldn't find an appropriate base class, create a new field
5699 here. Even if there weren't any new virtual functions, we might need a
5700 new virtual function table if we're supposed to include vptrs in
5701 all classes that need them. */
5702 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5704 /* We build this decl with vtbl_ptr_type_node, which is a
5705 `vtable_entry_type*'. It might seem more precise to use
5706 `vtable_entry_type (*)[N]' where N is the number of virtual
5707 functions. However, that would require the vtable pointer in
5708 base classes to have a different type than the vtable pointer
5709 in derived classes. We could make that happen, but that
5710 still wouldn't solve all the problems. In particular, the
5711 type-based alias analysis code would decide that assignments
5712 to the base class vtable pointer can't alias assignments to
5713 the derived class vtable pointer, since they have different
5714 types. Thus, in a derived class destructor, where the base
5715 class constructor was inlined, we could generate bad code for
5716 setting up the vtable pointer.
5718 Therefore, we use one type for all vtable pointers. We still
5719 use a type-correct type; it's just doesn't indicate the array
5720 bounds. That's better than using `void*' or some such; it's
5721 cleaner, and it let's the alias analysis code know that these
5722 stores cannot alias stores to void*! */
5725 field
= build_decl (input_location
,
5726 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5727 DECL_VIRTUAL_P (field
) = 1;
5728 DECL_ARTIFICIAL (field
) = 1;
5729 DECL_FIELD_CONTEXT (field
) = t
;
5730 DECL_FCONTEXT (field
) = t
;
5731 if (TYPE_PACKED (t
))
5732 DECL_PACKED (field
) = 1;
5734 TYPE_VFIELD (t
) = field
;
5736 /* This class is non-empty. */
5737 CLASSTYPE_EMPTY_P (t
) = 0;
5745 /* Add OFFSET to all base types of BINFO which is a base in the
5746 hierarchy dominated by T.
5748 OFFSET, which is a type offset, is number of bytes. */
5751 propagate_binfo_offsets (tree binfo
, tree offset
)
5757 /* Update BINFO's offset. */
5758 BINFO_OFFSET (binfo
)
5759 = convert (sizetype
,
5760 size_binop (PLUS_EXPR
,
5761 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5764 /* Find the primary base class. */
5765 primary_binfo
= get_primary_binfo (binfo
);
5767 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5768 propagate_binfo_offsets (primary_binfo
, offset
);
5770 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5772 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5774 /* Don't do the primary base twice. */
5775 if (base_binfo
== primary_binfo
)
5778 if (BINFO_VIRTUAL_P (base_binfo
))
5781 propagate_binfo_offsets (base_binfo
, offset
);
5785 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5786 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5787 empty subobjects of T. */
5790 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5796 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5799 /* Find the last field. The artificial fields created for virtual
5800 bases will go after the last extant field to date. */
5801 next_field
= &TYPE_FIELDS (t
);
5803 next_field
= &DECL_CHAIN (*next_field
);
5805 /* Go through the virtual bases, allocating space for each virtual
5806 base that is not already a primary base class. These are
5807 allocated in inheritance graph order. */
5808 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5810 if (!BINFO_VIRTUAL_P (vbase
))
5813 if (!BINFO_PRIMARY_P (vbase
))
5815 /* This virtual base is not a primary base of any class in the
5816 hierarchy, so we have to add space for it. */
5817 next_field
= build_base_field (rli
, vbase
,
5818 offsets
, next_field
);
5823 /* Returns the offset of the byte just past the end of the base class
5827 end_of_base (tree binfo
)
5831 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5832 size
= TYPE_SIZE_UNIT (char_type_node
);
5833 else if (is_empty_class (BINFO_TYPE (binfo
)))
5834 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5835 allocate some space for it. It cannot have virtual bases, so
5836 TYPE_SIZE_UNIT is fine. */
5837 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5839 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5841 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5844 /* Returns the offset of the byte just past the end of the base class
5845 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5846 only non-virtual bases are included. */
5849 end_of_class (tree t
, int include_virtuals_p
)
5851 tree result
= size_zero_node
;
5852 vec
<tree
, va_gc
> *vbases
;
5858 for (binfo
= TYPE_BINFO (t
), i
= 0;
5859 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5861 if (!include_virtuals_p
5862 && BINFO_VIRTUAL_P (base_binfo
)
5863 && (!BINFO_PRIMARY_P (base_binfo
)
5864 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5867 offset
= end_of_base (base_binfo
);
5868 if (tree_int_cst_lt (result
, offset
))
5872 if (include_virtuals_p
)
5873 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5874 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5876 offset
= end_of_base (base_binfo
);
5877 if (tree_int_cst_lt (result
, offset
))
5884 /* Warn about bases of T that are inaccessible because they are
5885 ambiguous. For example:
5888 struct T : public S {};
5889 struct U : public S, public T {};
5891 Here, `(S*) new U' is not allowed because there are two `S'
5895 warn_about_ambiguous_bases (tree t
)
5898 vec
<tree
, va_gc
> *vbases
;
5903 /* If there are no repeated bases, nothing can be ambiguous. */
5904 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5907 /* Check direct bases. */
5908 for (binfo
= TYPE_BINFO (t
), i
= 0;
5909 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5911 basetype
= BINFO_TYPE (base_binfo
);
5913 if (!uniquely_derived_from_p (basetype
, t
))
5914 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5918 /* Check for ambiguous virtual bases. */
5920 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5921 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5923 basetype
= BINFO_TYPE (binfo
);
5925 if (!uniquely_derived_from_p (basetype
, t
))
5926 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5927 "to ambiguity", basetype
, t
);
5931 /* Compare two INTEGER_CSTs K1 and K2. */
5934 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5936 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5939 /* Increase the size indicated in RLI to account for empty classes
5940 that are "off the end" of the class. */
5943 include_empty_classes (record_layout_info rli
)
5948 /* It might be the case that we grew the class to allocate a
5949 zero-sized base class. That won't be reflected in RLI, yet,
5950 because we are willing to overlay multiple bases at the same
5951 offset. However, now we need to make sure that RLI is big enough
5952 to reflect the entire class. */
5953 eoc
= end_of_class (rli
->t
,
5954 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5955 rli_size
= rli_size_unit_so_far (rli
);
5956 if (TREE_CODE (rli_size
) == INTEGER_CST
5957 && tree_int_cst_lt (rli_size
, eoc
))
5959 /* The size should have been rounded to a whole byte. */
5960 gcc_assert (tree_int_cst_equal
5961 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5963 = size_binop (PLUS_EXPR
,
5965 size_binop (MULT_EXPR
,
5966 convert (bitsizetype
,
5967 size_binop (MINUS_EXPR
,
5969 bitsize_int (BITS_PER_UNIT
)));
5970 normalize_rli (rli
);
5974 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5975 BINFO_OFFSETs for all of the base-classes. Position the vtable
5976 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5979 layout_class_type (tree t
, tree
*virtuals_p
)
5981 tree non_static_data_members
;
5984 record_layout_info rli
;
5985 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5986 types that appear at that offset. */
5987 splay_tree empty_base_offsets
;
5988 /* True if the last field laid out was a bit-field. */
5989 bool last_field_was_bitfield
= false;
5990 /* The location at which the next field should be inserted. */
5992 /* T, as a base class. */
5995 /* Keep track of the first non-static data member. */
5996 non_static_data_members
= TYPE_FIELDS (t
);
5998 /* Start laying out the record. */
5999 rli
= start_record_layout (t
);
6001 /* Mark all the primary bases in the hierarchy. */
6002 determine_primary_bases (t
);
6004 /* Create a pointer to our virtual function table. */
6005 vptr
= create_vtable_ptr (t
, virtuals_p
);
6007 /* The vptr is always the first thing in the class. */
6010 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
6011 TYPE_FIELDS (t
) = vptr
;
6012 next_field
= &DECL_CHAIN (vptr
);
6013 place_field (rli
, vptr
);
6016 next_field
= &TYPE_FIELDS (t
);
6018 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6019 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
6021 build_base_fields (rli
, empty_base_offsets
, next_field
);
6023 /* Layout the non-static data members. */
6024 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6029 /* We still pass things that aren't non-static data members to
6030 the back end, in case it wants to do something with them. */
6031 if (TREE_CODE (field
) != FIELD_DECL
)
6033 place_field (rli
, field
);
6034 /* If the static data member has incomplete type, keep track
6035 of it so that it can be completed later. (The handling
6036 of pending statics in finish_record_layout is
6037 insufficient; consider:
6040 struct S2 { static S1 s1; };
6042 At this point, finish_record_layout will be called, but
6043 S1 is still incomplete.) */
6046 maybe_register_incomplete_var (field
);
6047 /* The visibility of static data members is determined
6048 at their point of declaration, not their point of
6050 determine_visibility (field
);
6055 type
= TREE_TYPE (field
);
6056 if (type
== error_mark_node
)
6059 padding
= NULL_TREE
;
6061 /* If this field is a bit-field whose width is greater than its
6062 type, then there are some special rules for allocating
6064 if (DECL_C_BIT_FIELD (field
)
6065 && tree_int_cst_lt (TYPE_SIZE (type
), DECL_SIZE (field
)))
6069 bool was_unnamed_p
= false;
6070 /* We must allocate the bits as if suitably aligned for the
6071 longest integer type that fits in this many bits. type
6072 of the field. Then, we are supposed to use the left over
6073 bits as additional padding. */
6074 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6075 if (integer_types
[itk
] != NULL_TREE
6076 && (tree_int_cst_lt (size_int (MAX_FIXED_MODE_SIZE
),
6077 TYPE_SIZE (integer_types
[itk
]))
6078 || tree_int_cst_lt (DECL_SIZE (field
),
6079 TYPE_SIZE (integer_types
[itk
]))))
6082 /* ITK now indicates a type that is too large for the
6083 field. We have to back up by one to find the largest
6088 integer_type
= integer_types
[itk
];
6089 } while (itk
> 0 && integer_type
== NULL_TREE
);
6091 /* Figure out how much additional padding is required. */
6092 if (tree_int_cst_lt (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6094 if (TREE_CODE (t
) == UNION_TYPE
)
6095 /* In a union, the padding field must have the full width
6096 of the bit-field; all fields start at offset zero. */
6097 padding
= DECL_SIZE (field
);
6099 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6100 TYPE_SIZE (integer_type
));
6102 #ifdef PCC_BITFIELD_TYPE_MATTERS
6103 /* An unnamed bitfield does not normally affect the
6104 alignment of the containing class on a target where
6105 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6106 make any exceptions for unnamed bitfields when the
6107 bitfields are longer than their types. Therefore, we
6108 temporarily give the field a name. */
6109 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6111 was_unnamed_p
= true;
6112 DECL_NAME (field
) = make_anon_name ();
6115 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6116 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6117 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6118 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6119 empty_base_offsets
);
6121 DECL_NAME (field
) = NULL_TREE
;
6122 /* Now that layout has been performed, set the size of the
6123 field to the size of its declared type; the rest of the
6124 field is effectively invisible. */
6125 DECL_SIZE (field
) = TYPE_SIZE (type
);
6126 /* We must also reset the DECL_MODE of the field. */
6127 DECL_MODE (field
) = TYPE_MODE (type
);
6130 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6131 empty_base_offsets
);
6133 /* Remember the location of any empty classes in FIELD. */
6134 record_subobject_offsets (TREE_TYPE (field
),
6135 byte_position(field
),
6137 /*is_data_member=*/true);
6139 /* If a bit-field does not immediately follow another bit-field,
6140 and yet it starts in the middle of a byte, we have failed to
6141 comply with the ABI. */
6143 && DECL_C_BIT_FIELD (field
)
6144 /* The TREE_NO_WARNING flag gets set by Objective-C when
6145 laying out an Objective-C class. The ObjC ABI differs
6146 from the C++ ABI, and so we do not want a warning
6148 && !TREE_NO_WARNING (field
)
6149 && !last_field_was_bitfield
6150 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6151 DECL_FIELD_BIT_OFFSET (field
),
6152 bitsize_unit_node
)))
6153 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6154 "change in a future version of GCC", field
);
6156 /* The middle end uses the type of expressions to determine the
6157 possible range of expression values. In order to optimize
6158 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6159 must be made aware of the width of "i", via its type.
6161 Because C++ does not have integer types of arbitrary width,
6162 we must (for the purposes of the front end) convert from the
6163 type assigned here to the declared type of the bitfield
6164 whenever a bitfield expression is used as an rvalue.
6165 Similarly, when assigning a value to a bitfield, the value
6166 must be converted to the type given the bitfield here. */
6167 if (DECL_C_BIT_FIELD (field
))
6169 unsigned HOST_WIDE_INT width
;
6170 tree ftype
= TREE_TYPE (field
);
6171 width
= tree_to_uhwi (DECL_SIZE (field
));
6172 if (width
!= TYPE_PRECISION (ftype
))
6175 = c_build_bitfield_integer_type (width
,
6176 TYPE_UNSIGNED (ftype
));
6178 = cp_build_qualified_type (TREE_TYPE (field
),
6179 cp_type_quals (ftype
));
6183 /* If we needed additional padding after this field, add it
6189 padding_field
= build_decl (input_location
,
6193 DECL_BIT_FIELD (padding_field
) = 1;
6194 DECL_SIZE (padding_field
) = padding
;
6195 DECL_CONTEXT (padding_field
) = t
;
6196 DECL_ARTIFICIAL (padding_field
) = 1;
6197 DECL_IGNORED_P (padding_field
) = 1;
6198 layout_nonempty_base_or_field (rli
, padding_field
,
6200 empty_base_offsets
);
6203 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6206 if (!integer_zerop (rli
->bitpos
))
6208 /* Make sure that we are on a byte boundary so that the size of
6209 the class without virtual bases will always be a round number
6211 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6212 normalize_rli (rli
);
6215 /* Delete all zero-width bit-fields from the list of fields. Now
6216 that the type is laid out they are no longer important. */
6217 remove_zero_width_bit_fields (t
);
6219 /* Create the version of T used for virtual bases. We do not use
6220 make_class_type for this version; this is an artificial type. For
6221 a POD type, we just reuse T. */
6222 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6224 base_t
= make_node (TREE_CODE (t
));
6226 /* Set the size and alignment for the new type. */
6229 /* If the ABI version is not at least two, and the last
6230 field was a bit-field, RLI may not be on a byte
6231 boundary. In particular, rli_size_unit_so_far might
6232 indicate the last complete byte, while rli_size_so_far
6233 indicates the total number of bits used. Therefore,
6234 rli_size_so_far, rather than rli_size_unit_so_far, is
6235 used to compute TYPE_SIZE_UNIT. */
6236 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6237 TYPE_SIZE_UNIT (base_t
)
6238 = size_binop (MAX_EXPR
,
6240 size_binop (CEIL_DIV_EXPR
,
6241 rli_size_so_far (rli
),
6242 bitsize_int (BITS_PER_UNIT
))),
6245 = size_binop (MAX_EXPR
,
6246 rli_size_so_far (rli
),
6247 size_binop (MULT_EXPR
,
6248 convert (bitsizetype
, eoc
),
6249 bitsize_int (BITS_PER_UNIT
)));
6250 TYPE_ALIGN (base_t
) = rli
->record_align
;
6251 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6253 /* Copy the fields from T. */
6254 next_field
= &TYPE_FIELDS (base_t
);
6255 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6256 if (TREE_CODE (field
) == FIELD_DECL
)
6258 *next_field
= build_decl (input_location
,
6262 DECL_CONTEXT (*next_field
) = base_t
;
6263 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6264 DECL_FIELD_BIT_OFFSET (*next_field
)
6265 = DECL_FIELD_BIT_OFFSET (field
);
6266 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6267 DECL_MODE (*next_field
) = DECL_MODE (field
);
6268 next_field
= &DECL_CHAIN (*next_field
);
6271 /* Record the base version of the type. */
6272 CLASSTYPE_AS_BASE (t
) = base_t
;
6273 TYPE_CONTEXT (base_t
) = t
;
6276 CLASSTYPE_AS_BASE (t
) = t
;
6278 /* Every empty class contains an empty class. */
6279 if (CLASSTYPE_EMPTY_P (t
))
6280 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6282 /* Set the TYPE_DECL for this type to contain the right
6283 value for DECL_OFFSET, so that we can use it as part
6284 of a COMPONENT_REF for multiple inheritance. */
6285 layout_decl (TYPE_MAIN_DECL (t
), 0);
6287 /* Now fix up any virtual base class types that we left lying
6288 around. We must get these done before we try to lay out the
6289 virtual function table. As a side-effect, this will remove the
6290 base subobject fields. */
6291 layout_virtual_bases (rli
, empty_base_offsets
);
6293 /* Make sure that empty classes are reflected in RLI at this
6295 include_empty_classes(rli
);
6297 /* Make sure not to create any structures with zero size. */
6298 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6300 build_decl (input_location
,
6301 FIELD_DECL
, NULL_TREE
, char_type_node
));
6303 /* If this is a non-POD, declaring it packed makes a difference to how it
6304 can be used as a field; don't let finalize_record_size undo it. */
6305 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6306 rli
->packed_maybe_necessary
= true;
6308 /* Let the back end lay out the type. */
6309 finish_record_layout (rli
, /*free_p=*/true);
6311 if (TYPE_SIZE_UNIT (t
)
6312 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6313 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6314 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6315 error ("type %qT is too large", t
);
6317 /* Warn about bases that can't be talked about due to ambiguity. */
6318 warn_about_ambiguous_bases (t
);
6320 /* Now that we're done with layout, give the base fields the real types. */
6321 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6322 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6323 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6326 splay_tree_delete (empty_base_offsets
);
6328 if (CLASSTYPE_EMPTY_P (t
)
6329 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6330 TYPE_SIZE_UNIT (t
)))
6331 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6334 /* Determine the "key method" for the class type indicated by TYPE,
6335 and set CLASSTYPE_KEY_METHOD accordingly. */
6338 determine_key_method (tree type
)
6342 if (TYPE_FOR_JAVA (type
)
6343 || processing_template_decl
6344 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6345 || CLASSTYPE_INTERFACE_KNOWN (type
))
6348 /* The key method is the first non-pure virtual function that is not
6349 inline at the point of class definition. On some targets the
6350 key function may not be inline; those targets should not call
6351 this function until the end of the translation unit. */
6352 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6353 method
= DECL_CHAIN (method
))
6354 if (TREE_CODE (method
) == FUNCTION_DECL
6355 && DECL_VINDEX (method
) != NULL_TREE
6356 && ! DECL_DECLARED_INLINE_P (method
)
6357 && ! DECL_PURE_VIRTUAL_P (method
))
6359 CLASSTYPE_KEY_METHOD (type
) = method
;
6367 /* Allocate and return an instance of struct sorted_fields_type with
6370 static struct sorted_fields_type
*
6371 sorted_fields_type_new (int n
)
6373 struct sorted_fields_type
*sft
;
6374 sft
= (sorted_fields_type
*) ggc_internal_alloc (sizeof (sorted_fields_type
)
6375 + n
* sizeof (tree
));
6382 /* Perform processing required when the definition of T (a class type)
6386 finish_struct_1 (tree t
)
6389 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6390 tree virtuals
= NULL_TREE
;
6392 if (COMPLETE_TYPE_P (t
))
6394 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6395 error ("redefinition of %q#T", t
);
6400 /* If this type was previously laid out as a forward reference,
6401 make sure we lay it out again. */
6402 TYPE_SIZE (t
) = NULL_TREE
;
6403 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6405 /* Make assumptions about the class; we'll reset the flags if
6407 CLASSTYPE_EMPTY_P (t
) = 1;
6408 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6409 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6410 CLASSTYPE_LITERAL_P (t
) = true;
6412 /* Do end-of-class semantic processing: checking the validity of the
6413 bases and members and add implicitly generated methods. */
6414 check_bases_and_members (t
);
6416 /* Find the key method. */
6417 if (TYPE_CONTAINS_VPTR_P (t
))
6419 /* The Itanium C++ ABI permits the key method to be chosen when
6420 the class is defined -- even though the key method so
6421 selected may later turn out to be an inline function. On
6422 some systems (such as ARM Symbian OS) the key method cannot
6423 be determined until the end of the translation unit. On such
6424 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6425 will cause the class to be added to KEYED_CLASSES. Then, in
6426 finish_file we will determine the key method. */
6427 if (targetm
.cxx
.key_method_may_be_inline ())
6428 determine_key_method (t
);
6430 /* If a polymorphic class has no key method, we may emit the vtable
6431 in every translation unit where the class definition appears. If
6432 we're devirtualizing, we can look into the vtable even if we
6433 aren't emitting it. */
6434 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6435 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6438 /* Layout the class itself. */
6439 layout_class_type (t
, &virtuals
);
6440 if (CLASSTYPE_AS_BASE (t
) != t
)
6441 /* We use the base type for trivial assignments, and hence it
6443 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6445 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6447 /* If necessary, create the primary vtable for this class. */
6448 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6450 /* We must enter these virtuals into the table. */
6451 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6452 build_primary_vtable (NULL_TREE
, t
);
6453 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6454 /* Here we know enough to change the type of our virtual
6455 function table, but we will wait until later this function. */
6456 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6458 /* If we're warning about ABI tags, check the types of the new
6459 virtual functions. */
6461 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6462 check_abi_tags (t
, TREE_VALUE (v
));
6465 if (TYPE_CONTAINS_VPTR_P (t
))
6470 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6471 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6472 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6473 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6475 /* Add entries for virtual functions introduced by this class. */
6476 BINFO_VIRTUALS (TYPE_BINFO (t
))
6477 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6479 /* Set DECL_VINDEX for all functions declared in this class. */
6480 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6482 fn
= TREE_CHAIN (fn
),
6483 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6484 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6486 tree fndecl
= BV_FN (fn
);
6488 if (DECL_THUNK_P (fndecl
))
6489 /* A thunk. We should never be calling this entry directly
6490 from this vtable -- we'd use the entry for the non
6491 thunk base function. */
6492 DECL_VINDEX (fndecl
) = NULL_TREE
;
6493 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6494 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6498 finish_struct_bits (t
);
6499 set_method_tm_attributes (t
);
6501 /* Complete the rtl for any static member objects of the type we're
6503 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6504 if (VAR_P (x
) && TREE_STATIC (x
)
6505 && TREE_TYPE (x
) != error_mark_node
6506 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6507 DECL_MODE (x
) = TYPE_MODE (t
);
6509 /* Done with FIELDS...now decide whether to sort these for
6510 faster lookups later.
6512 We use a small number because most searches fail (succeeding
6513 ultimately as the search bores through the inheritance
6514 hierarchy), and we want this failure to occur quickly. */
6516 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6518 /* Complain if one of the field types requires lower visibility. */
6519 constrain_class_visibility (t
);
6521 /* Make the rtl for any new vtables we have created, and unmark
6522 the base types we marked. */
6525 /* Build the VTT for T. */
6528 /* This warning does not make sense for Java classes, since they
6529 cannot have destructors. */
6530 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
6531 && TYPE_POLYMORPHIC_P (t
) && accessible_nvdtor_p (t
)
6532 && !CLASSTYPE_FINAL (t
))
6533 warning (OPT_Wnon_virtual_dtor
,
6534 "%q#T has virtual functions and accessible"
6535 " non-virtual destructor", t
);
6539 if (warn_overloaded_virtual
)
6542 /* Class layout, assignment of virtual table slots, etc., is now
6543 complete. Give the back end a chance to tweak the visibility of
6544 the class or perform any other required target modifications. */
6545 targetm
.cxx
.adjust_class_at_definition (t
);
6547 maybe_suppress_debug_info (t
);
6549 if (flag_vtable_verify
)
6550 vtv_save_class_info (t
);
6552 dump_class_hierarchy (t
);
6554 /* Finish debugging output for this type. */
6555 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6557 if (TYPE_TRANSPARENT_AGGR (t
))
6559 tree field
= first_field (t
);
6560 if (field
== NULL_TREE
|| error_operand_p (field
))
6562 error ("type transparent %q#T does not have any fields", t
);
6563 TYPE_TRANSPARENT_AGGR (t
) = 0;
6565 else if (DECL_ARTIFICIAL (field
))
6567 if (DECL_FIELD_IS_BASE (field
))
6568 error ("type transparent class %qT has base classes", t
);
6571 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6572 error ("type transparent class %qT has virtual functions", t
);
6574 TYPE_TRANSPARENT_AGGR (t
) = 0;
6576 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6578 error ("type transparent %q#T cannot be made transparent because "
6579 "the type of the first field has a different ABI from the "
6580 "class overall", t
);
6581 TYPE_TRANSPARENT_AGGR (t
) = 0;
6586 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6587 equal to THRESHOLD or greater than THRESHOLD. */
6590 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6592 int n_fields
= count_fields (fields
);
6593 if (n_fields
>= threshold
)
6595 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6596 add_fields_to_record_type (fields
, field_vec
, 0);
6597 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6598 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6602 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6605 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6607 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6612 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6613 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6615 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6616 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6618 add_enum_fields_to_record_type (enumtype
, field_vec
,
6619 sorted_fields
->len
);
6620 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6621 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6625 /* When T was built up, the member declarations were added in reverse
6626 order. Rearrange them to declaration order. */
6629 unreverse_member_declarations (tree t
)
6635 /* The following lists are all in reverse order. Put them in
6636 declaration order now. */
6637 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6638 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6640 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6641 reverse order, so we can't just use nreverse. */
6643 for (x
= TYPE_FIELDS (t
);
6644 x
&& TREE_CODE (x
) != TYPE_DECL
;
6647 next
= DECL_CHAIN (x
);
6648 DECL_CHAIN (x
) = prev
;
6653 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6655 TYPE_FIELDS (t
) = prev
;
6660 finish_struct (tree t
, tree attributes
)
6662 location_t saved_loc
= input_location
;
6664 /* Now that we've got all the field declarations, reverse everything
6666 unreverse_member_declarations (t
);
6668 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6670 /* Nadger the current location so that diagnostics point to the start of
6671 the struct, not the end. */
6672 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6674 if (processing_template_decl
)
6678 finish_struct_methods (t
);
6679 TYPE_SIZE (t
) = bitsize_zero_node
;
6680 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6682 /* We need to emit an error message if this type was used as a parameter
6683 and it is an abstract type, even if it is a template. We construct
6684 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6685 account and we call complete_vars with this type, which will check
6686 the PARM_DECLS. Note that while the type is being defined,
6687 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6688 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6689 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6690 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6691 if (DECL_PURE_VIRTUAL_P (x
))
6692 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6694 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6695 an enclosing scope is a template class, so that this function be
6696 found by lookup_fnfields_1 when the using declaration is not
6697 instantiated yet. */
6698 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6699 if (TREE_CODE (x
) == USING_DECL
)
6701 tree fn
= strip_using_decl (x
);
6702 if (is_overloaded_fn (fn
))
6703 for (; fn
; fn
= OVL_NEXT (fn
))
6704 add_method (t
, OVL_CURRENT (fn
), x
);
6707 /* Remember current #pragma pack value. */
6708 TYPE_PRECISION (t
) = maximum_field_alignment
;
6710 /* Fix up any variants we've already built. */
6711 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6713 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6714 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6715 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6716 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6720 finish_struct_1 (t
);
6722 if (is_std_init_list (t
))
6724 /* People keep complaining that the compiler crashes on an invalid
6725 definition of initializer_list, so I guess we should explicitly
6726 reject it. What the compiler internals care about is that it's a
6727 template and has a pointer field followed by an integer field. */
6729 if (processing_template_decl
)
6731 tree f
= next_initializable_field (TYPE_FIELDS (t
));
6732 if (f
&& TREE_CODE (TREE_TYPE (f
)) == POINTER_TYPE
)
6734 f
= next_initializable_field (DECL_CHAIN (f
));
6735 if (f
&& TREE_CODE (TREE_TYPE (f
)) == INTEGER_TYPE
)
6740 fatal_error ("definition of std::initializer_list does not match "
6741 "#include <initializer_list>");
6744 input_location
= saved_loc
;
6746 TYPE_BEING_DEFINED (t
) = 0;
6748 if (current_class_type
)
6751 error ("trying to finish struct, but kicked out due to previous parse errors");
6753 if (processing_template_decl
&& at_function_scope_p ()
6754 /* Lambdas are defined by the LAMBDA_EXPR. */
6755 && !LAMBDA_TYPE_P (t
))
6756 add_stmt (build_min (TAG_DEFN
, t
));
6761 /* Hash table to avoid endless recursion when handling references. */
6762 static hash_table
<pointer_hash
<tree_node
> > *fixed_type_or_null_ref_ht
;
6764 /* Return the dynamic type of INSTANCE, if known.
6765 Used to determine whether the virtual function table is needed
6768 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6769 of our knowledge of its type. *NONNULL should be initialized
6770 before this function is called. */
6773 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6775 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6777 switch (TREE_CODE (instance
))
6780 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6783 return RECUR (TREE_OPERAND (instance
, 0));
6786 /* This is a call to a constructor, hence it's never zero. */
6787 if (TREE_HAS_CONSTRUCTOR (instance
))
6791 return TREE_TYPE (instance
);
6796 /* This is a call to a constructor, hence it's never zero. */
6797 if (TREE_HAS_CONSTRUCTOR (instance
))
6801 return TREE_TYPE (instance
);
6803 return RECUR (TREE_OPERAND (instance
, 0));
6805 case POINTER_PLUS_EXPR
:
6808 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6809 return RECUR (TREE_OPERAND (instance
, 0));
6810 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6811 /* Propagate nonnull. */
6812 return RECUR (TREE_OPERAND (instance
, 0));
6817 return RECUR (TREE_OPERAND (instance
, 0));
6820 instance
= TREE_OPERAND (instance
, 0);
6823 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6824 with a real object -- given &p->f, p can still be null. */
6825 tree t
= get_base_address (instance
);
6826 /* ??? Probably should check DECL_WEAK here. */
6827 if (t
&& DECL_P (t
))
6830 return RECUR (instance
);
6833 /* If this component is really a base class reference, then the field
6834 itself isn't definitive. */
6835 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6836 return RECUR (TREE_OPERAND (instance
, 0));
6837 return RECUR (TREE_OPERAND (instance
, 1));
6841 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6842 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6846 return TREE_TYPE (TREE_TYPE (instance
));
6848 /* fall through... */
6852 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6856 return TREE_TYPE (instance
);
6858 else if (instance
== current_class_ptr
)
6863 /* if we're in a ctor or dtor, we know our type. If
6864 current_class_ptr is set but we aren't in a function, we're in
6865 an NSDMI (and therefore a constructor). */
6866 if (current_scope () != current_function_decl
6867 || (DECL_LANG_SPECIFIC (current_function_decl
)
6868 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6869 || DECL_DESTRUCTOR_P (current_function_decl
))))
6873 return TREE_TYPE (TREE_TYPE (instance
));
6876 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6878 /* We only need one hash table because it is always left empty. */
6879 if (!fixed_type_or_null_ref_ht
)
6880 fixed_type_or_null_ref_ht
6881 = new hash_table
<pointer_hash
<tree_node
> > (37);
6883 /* Reference variables should be references to objects. */
6887 /* Enter the INSTANCE in a table to prevent recursion; a
6888 variable's initializer may refer to the variable
6890 if (VAR_P (instance
)
6891 && DECL_INITIAL (instance
)
6892 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6893 && !fixed_type_or_null_ref_ht
->find (instance
))
6898 slot
= fixed_type_or_null_ref_ht
->find_slot (instance
, INSERT
);
6900 type
= RECUR (DECL_INITIAL (instance
));
6901 fixed_type_or_null_ref_ht
->remove_elt (instance
);
6914 /* Return nonzero if the dynamic type of INSTANCE is known, and
6915 equivalent to the static type. We also handle the case where
6916 INSTANCE is really a pointer. Return negative if this is a
6917 ctor/dtor. There the dynamic type is known, but this might not be
6918 the most derived base of the original object, and hence virtual
6919 bases may not be laid out according to this type.
6921 Used to determine whether the virtual function table is needed
6924 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6925 of our knowledge of its type. *NONNULL should be initialized
6926 before this function is called. */
6929 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6931 tree t
= TREE_TYPE (instance
);
6935 /* processing_template_decl can be false in a template if we're in
6936 fold_non_dependent_expr, but we still want to suppress this check. */
6937 if (in_template_function ())
6939 /* In a template we only care about the type of the result. */
6945 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6946 if (fixed
== NULL_TREE
)
6948 if (POINTER_TYPE_P (t
))
6950 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6952 return cdtorp
? -1 : 1;
6957 init_class_processing (void)
6959 current_class_depth
= 0;
6960 current_class_stack_size
= 10;
6962 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6963 vec_alloc (local_classes
, 8);
6964 sizeof_biggest_empty_class
= size_zero_node
;
6966 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6967 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6968 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6971 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6974 restore_class_cache (void)
6978 /* We are re-entering the same class we just left, so we don't
6979 have to search the whole inheritance matrix to find all the
6980 decls to bind again. Instead, we install the cached
6981 class_shadowed list and walk through it binding names. */
6982 push_binding_level (previous_class_level
);
6983 class_binding_level
= previous_class_level
;
6984 /* Restore IDENTIFIER_TYPE_VALUE. */
6985 for (type
= class_binding_level
->type_shadowed
;
6987 type
= TREE_CHAIN (type
))
6988 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6991 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6992 appropriate for TYPE.
6994 So that we may avoid calls to lookup_name, we cache the _TYPE
6995 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6997 For multiple inheritance, we perform a two-pass depth-first search
6998 of the type lattice. */
7001 pushclass (tree type
)
7003 class_stack_node_t csn
;
7005 type
= TYPE_MAIN_VARIANT (type
);
7007 /* Make sure there is enough room for the new entry on the stack. */
7008 if (current_class_depth
+ 1 >= current_class_stack_size
)
7010 current_class_stack_size
*= 2;
7012 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7013 current_class_stack_size
);
7016 /* Insert a new entry on the class stack. */
7017 csn
= current_class_stack
+ current_class_depth
;
7018 csn
->name
= current_class_name
;
7019 csn
->type
= current_class_type
;
7020 csn
->access
= current_access_specifier
;
7021 csn
->names_used
= 0;
7023 current_class_depth
++;
7025 /* Now set up the new type. */
7026 current_class_name
= TYPE_NAME (type
);
7027 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7028 current_class_name
= DECL_NAME (current_class_name
);
7029 current_class_type
= type
;
7031 /* By default, things in classes are private, while things in
7032 structures or unions are public. */
7033 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7034 ? access_private_node
7035 : access_public_node
);
7037 if (previous_class_level
7038 && type
!= previous_class_level
->this_entity
7039 && current_class_depth
== 1)
7041 /* Forcibly remove any old class remnants. */
7042 invalidate_class_lookup_cache ();
7045 if (!previous_class_level
7046 || type
!= previous_class_level
->this_entity
7047 || current_class_depth
> 1)
7050 restore_class_cache ();
7053 /* When we exit a toplevel class scope, we save its binding level so
7054 that we can restore it quickly. Here, we've entered some other
7055 class, so we must invalidate our cache. */
7058 invalidate_class_lookup_cache (void)
7060 previous_class_level
= NULL
;
7063 /* Get out of the current class scope. If we were in a class scope
7064 previously, that is the one popped to. */
7071 current_class_depth
--;
7072 current_class_name
= current_class_stack
[current_class_depth
].name
;
7073 current_class_type
= current_class_stack
[current_class_depth
].type
;
7074 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7075 if (current_class_stack
[current_class_depth
].names_used
)
7076 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7079 /* Mark the top of the class stack as hidden. */
7082 push_class_stack (void)
7084 if (current_class_depth
)
7085 ++current_class_stack
[current_class_depth
- 1].hidden
;
7088 /* Mark the top of the class stack as un-hidden. */
7091 pop_class_stack (void)
7093 if (current_class_depth
)
7094 --current_class_stack
[current_class_depth
- 1].hidden
;
7097 /* Returns 1 if the class type currently being defined is either T or
7098 a nested type of T. */
7101 currently_open_class (tree t
)
7105 if (!CLASS_TYPE_P (t
))
7108 t
= TYPE_MAIN_VARIANT (t
);
7110 /* We start looking from 1 because entry 0 is from global scope,
7112 for (i
= current_class_depth
; i
> 0; --i
)
7115 if (i
== current_class_depth
)
7116 c
= current_class_type
;
7119 if (current_class_stack
[i
].hidden
)
7121 c
= current_class_stack
[i
].type
;
7125 if (same_type_p (c
, t
))
7131 /* If either current_class_type or one of its enclosing classes are derived
7132 from T, return the appropriate type. Used to determine how we found
7133 something via unqualified lookup. */
7136 currently_open_derived_class (tree t
)
7140 /* The bases of a dependent type are unknown. */
7141 if (dependent_type_p (t
))
7144 if (!current_class_type
)
7147 if (DERIVED_FROM_P (t
, current_class_type
))
7148 return current_class_type
;
7150 for (i
= current_class_depth
- 1; i
> 0; --i
)
7152 if (current_class_stack
[i
].hidden
)
7154 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7155 return current_class_stack
[i
].type
;
7161 /* Return the outermost enclosing class type that is still open, or
7165 outermost_open_class (void)
7167 if (!current_class_type
)
7170 if (TYPE_BEING_DEFINED (current_class_type
))
7171 r
= current_class_type
;
7172 for (int i
= current_class_depth
- 1; i
> 0; --i
)
7174 if (current_class_stack
[i
].hidden
)
7176 tree t
= current_class_stack
[i
].type
;
7177 if (!TYPE_BEING_DEFINED (t
))
7184 /* Returns the innermost class type which is not a lambda closure type. */
7187 current_nonlambda_class_type (void)
7191 /* We start looking from 1 because entry 0 is from global scope,
7193 for (i
= current_class_depth
; i
> 0; --i
)
7196 if (i
== current_class_depth
)
7197 c
= current_class_type
;
7200 if (current_class_stack
[i
].hidden
)
7202 c
= current_class_stack
[i
].type
;
7206 if (!LAMBDA_TYPE_P (c
))
7212 /* When entering a class scope, all enclosing class scopes' names with
7213 static meaning (static variables, static functions, types and
7214 enumerators) have to be visible. This recursive function calls
7215 pushclass for all enclosing class contexts until global or a local
7216 scope is reached. TYPE is the enclosed class. */
7219 push_nested_class (tree type
)
7221 /* A namespace might be passed in error cases, like A::B:C. */
7222 if (type
== NULL_TREE
7223 || !CLASS_TYPE_P (type
))
7226 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7231 /* Undoes a push_nested_class call. */
7234 pop_nested_class (void)
7236 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7239 if (context
&& CLASS_TYPE_P (context
))
7240 pop_nested_class ();
7243 /* Returns the number of extern "LANG" blocks we are nested within. */
7246 current_lang_depth (void)
7248 return vec_safe_length (current_lang_base
);
7251 /* Set global variables CURRENT_LANG_NAME to appropriate value
7252 so that behavior of name-mangling machinery is correct. */
7255 push_lang_context (tree name
)
7257 vec_safe_push (current_lang_base
, current_lang_name
);
7259 if (name
== lang_name_cplusplus
)
7261 current_lang_name
= name
;
7263 else if (name
== lang_name_java
)
7265 current_lang_name
= name
;
7266 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7267 (See record_builtin_java_type in decl.c.) However, that causes
7268 incorrect debug entries if these types are actually used.
7269 So we re-enable debug output after extern "Java". */
7270 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7271 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7272 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7273 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7274 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7275 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7276 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7277 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7279 else if (name
== lang_name_c
)
7281 current_lang_name
= name
;
7284 error ("language string %<\"%E\"%> not recognized", name
);
7287 /* Get out of the current language scope. */
7290 pop_lang_context (void)
7292 current_lang_name
= current_lang_base
->pop ();
7295 /* Type instantiation routines. */
7297 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7298 matches the TARGET_TYPE. If there is no satisfactory match, return
7299 error_mark_node, and issue an error & warning messages under
7300 control of FLAGS. Permit pointers to member function if FLAGS
7301 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7302 a template-id, and EXPLICIT_TARGS are the explicitly provided
7305 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7306 is the base path used to reference those member functions. If
7307 the address is resolved to a member function, access checks will be
7308 performed and errors issued if appropriate. */
7311 resolve_address_of_overloaded_function (tree target_type
,
7313 tsubst_flags_t flags
,
7315 tree explicit_targs
,
7318 /* Here's what the standard says:
7322 If the name is a function template, template argument deduction
7323 is done, and if the argument deduction succeeds, the deduced
7324 arguments are used to generate a single template function, which
7325 is added to the set of overloaded functions considered.
7327 Non-member functions and static member functions match targets of
7328 type "pointer-to-function" or "reference-to-function." Nonstatic
7329 member functions match targets of type "pointer-to-member
7330 function;" the function type of the pointer to member is used to
7331 select the member function from the set of overloaded member
7332 functions. If a nonstatic member function is selected, the
7333 reference to the overloaded function name is required to have the
7334 form of a pointer to member as described in 5.3.1.
7336 If more than one function is selected, any template functions in
7337 the set are eliminated if the set also contains a non-template
7338 function, and any given template function is eliminated if the
7339 set contains a second template function that is more specialized
7340 than the first according to the partial ordering rules 14.5.5.2.
7341 After such eliminations, if any, there shall remain exactly one
7342 selected function. */
7345 /* We store the matches in a TREE_LIST rooted here. The functions
7346 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7347 interoperability with most_specialized_instantiation. */
7348 tree matches
= NULL_TREE
;
7350 tree target_fn_type
;
7352 /* By the time we get here, we should be seeing only real
7353 pointer-to-member types, not the internal POINTER_TYPE to
7354 METHOD_TYPE representation. */
7355 gcc_assert (!TYPE_PTR_P (target_type
)
7356 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7358 gcc_assert (is_overloaded_fn (overload
));
7360 /* Check that the TARGET_TYPE is reasonable. */
7361 if (TYPE_PTRFN_P (target_type
)
7362 || TYPE_REFFN_P (target_type
))
7364 else if (TYPE_PTRMEMFUNC_P (target_type
))
7365 /* This is OK, too. */
7367 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7368 /* This is OK, too. This comes from a conversion to reference
7370 target_type
= build_reference_type (target_type
);
7373 if (flags
& tf_error
)
7374 error ("cannot resolve overloaded function %qD based on"
7375 " conversion to type %qT",
7376 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7377 return error_mark_node
;
7380 /* Non-member functions and static member functions match targets of type
7381 "pointer-to-function" or "reference-to-function." Nonstatic member
7382 functions match targets of type "pointer-to-member-function;" the
7383 function type of the pointer to member is used to select the member
7384 function from the set of overloaded member functions.
7386 So figure out the FUNCTION_TYPE that we want to match against. */
7387 target_fn_type
= static_fn_type (target_type
);
7389 /* If we can find a non-template function that matches, we can just
7390 use it. There's no point in generating template instantiations
7391 if we're just going to throw them out anyhow. But, of course, we
7392 can only do this when we don't *need* a template function. */
7397 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7399 tree fn
= OVL_CURRENT (fns
);
7401 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7402 /* We're not looking for templates just yet. */
7405 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7407 /* We're looking for a non-static member, and this isn't
7408 one, or vice versa. */
7411 /* Ignore functions which haven't been explicitly
7413 if (DECL_ANTICIPATED (fn
))
7416 /* See if there's a match. */
7417 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7418 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7422 /* Now, if we've already got a match (or matches), there's no need
7423 to proceed to the template functions. But, if we don't have a
7424 match we need to look at them, too. */
7427 tree target_arg_types
;
7428 tree target_ret_type
;
7431 unsigned int nargs
, ia
;
7434 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7435 target_ret_type
= TREE_TYPE (target_fn_type
);
7437 nargs
= list_length (target_arg_types
);
7438 args
= XALLOCAVEC (tree
, nargs
);
7439 for (arg
= target_arg_types
, ia
= 0;
7440 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7441 arg
= TREE_CHAIN (arg
), ++ia
)
7442 args
[ia
] = TREE_VALUE (arg
);
7445 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7447 tree fn
= OVL_CURRENT (fns
);
7451 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7452 /* We're only looking for templates. */
7455 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7457 /* We're not looking for a non-static member, and this is
7458 one, or vice versa. */
7461 tree ret
= target_ret_type
;
7463 /* If the template has a deduced return type, don't expose it to
7464 template argument deduction. */
7465 if (undeduced_auto_decl (fn
))
7468 /* Try to do argument deduction. */
7469 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7470 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7472 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7474 if (instantiation
== error_mark_node
)
7475 /* Instantiation failed. */
7478 /* And now force instantiation to do return type deduction. */
7479 if (undeduced_auto_decl (instantiation
))
7482 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7485 require_deduced_type (instantiation
);
7488 /* See if there's a match. */
7489 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7490 matches
= tree_cons (instantiation
, fn
, matches
);
7493 /* Now, remove all but the most specialized of the matches. */
7496 tree match
= most_specialized_instantiation (matches
);
7498 if (match
!= error_mark_node
)
7499 matches
= tree_cons (TREE_PURPOSE (match
),
7505 /* Now we should have exactly one function in MATCHES. */
7506 if (matches
== NULL_TREE
)
7508 /* There were *no* matches. */
7509 if (flags
& tf_error
)
7511 error ("no matches converting function %qD to type %q#T",
7512 DECL_NAME (OVL_CURRENT (overload
)),
7515 print_candidates (overload
);
7517 return error_mark_node
;
7519 else if (TREE_CHAIN (matches
))
7521 /* There were too many matches. First check if they're all
7522 the same function. */
7523 tree match
= NULL_TREE
;
7525 fn
= TREE_PURPOSE (matches
);
7527 /* For multi-versioned functions, more than one match is just fine and
7528 decls_match will return false as they are different. */
7529 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7530 if (!decls_match (fn
, TREE_PURPOSE (match
))
7531 && !targetm
.target_option
.function_versions
7532 (fn
, TREE_PURPOSE (match
)))
7537 if (flags
& tf_error
)
7539 error ("converting overloaded function %qD to type %q#T is ambiguous",
7540 DECL_NAME (OVL_FUNCTION (overload
)),
7543 /* Since print_candidates expects the functions in the
7544 TREE_VALUE slot, we flip them here. */
7545 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7546 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7548 print_candidates (matches
);
7551 return error_mark_node
;
7555 /* Good, exactly one match. Now, convert it to the correct type. */
7556 fn
= TREE_PURPOSE (matches
);
7558 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7559 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7561 static int explained
;
7563 if (!(flags
& tf_error
))
7564 return error_mark_node
;
7566 permerror (input_location
, "assuming pointer to member %qD", fn
);
7569 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7574 /* If a pointer to a function that is multi-versioned is requested, the
7575 pointer to the dispatcher function is returned instead. This works
7576 well because indirectly calling the function will dispatch the right
7577 function version at run-time. */
7578 if (DECL_FUNCTION_VERSIONED (fn
))
7580 fn
= get_function_version_dispatcher (fn
);
7582 return error_mark_node
;
7583 /* Mark all the versions corresponding to the dispatcher as used. */
7584 if (!(flags
& tf_conv
))
7585 mark_versions_used (fn
);
7588 /* If we're doing overload resolution purely for the purpose of
7589 determining conversion sequences, we should not consider the
7590 function used. If this conversion sequence is selected, the
7591 function will be marked as used at this point. */
7592 if (!(flags
& tf_conv
))
7594 /* Make =delete work with SFINAE. */
7595 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7596 return error_mark_node
;
7601 /* We could not check access to member functions when this
7602 expression was originally created since we did not know at that
7603 time to which function the expression referred. */
7604 if (DECL_FUNCTION_MEMBER_P (fn
))
7606 gcc_assert (access_path
);
7607 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7610 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7611 return cp_build_addr_expr (fn
, flags
);
7614 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7615 will mark the function as addressed, but here we must do it
7617 cxx_mark_addressable (fn
);
7623 /* This function will instantiate the type of the expression given in
7624 RHS to match the type of LHSTYPE. If errors exist, then return
7625 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7626 we complain on errors. If we are not complaining, never modify rhs,
7627 as overload resolution wants to try many possible instantiations, in
7628 the hope that at least one will work.
7630 For non-recursive calls, LHSTYPE should be a function, pointer to
7631 function, or a pointer to member function. */
7634 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7636 tsubst_flags_t flags_in
= flags
;
7637 tree access_path
= NULL_TREE
;
7639 flags
&= ~tf_ptrmem_ok
;
7641 if (lhstype
== unknown_type_node
)
7643 if (flags
& tf_error
)
7644 error ("not enough type information");
7645 return error_mark_node
;
7648 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7650 tree fntype
= non_reference (lhstype
);
7651 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7653 if (flag_ms_extensions
7654 && TYPE_PTRMEMFUNC_P (fntype
)
7655 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7656 /* Microsoft allows `A::f' to be resolved to a
7657 pointer-to-member. */
7661 if (flags
& tf_error
)
7662 error ("cannot convert %qE from type %qT to type %qT",
7663 rhs
, TREE_TYPE (rhs
), fntype
);
7664 return error_mark_node
;
7668 if (BASELINK_P (rhs
))
7670 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7671 rhs
= BASELINK_FUNCTIONS (rhs
);
7674 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7675 deduce any type information. */
7676 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7678 if (flags
& tf_error
)
7679 error ("not enough type information");
7680 return error_mark_node
;
7683 /* There only a few kinds of expressions that may have a type
7684 dependent on overload resolution. */
7685 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7686 || TREE_CODE (rhs
) == COMPONENT_REF
7687 || is_overloaded_fn (rhs
)
7688 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7690 /* This should really only be used when attempting to distinguish
7691 what sort of a pointer to function we have. For now, any
7692 arithmetic operation which is not supported on pointers
7693 is rejected as an error. */
7695 switch (TREE_CODE (rhs
))
7699 tree member
= TREE_OPERAND (rhs
, 1);
7701 member
= instantiate_type (lhstype
, member
, flags
);
7702 if (member
!= error_mark_node
7703 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7704 /* Do not lose object's side effects. */
7705 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7706 TREE_OPERAND (rhs
, 0), member
);
7711 rhs
= TREE_OPERAND (rhs
, 1);
7712 if (BASELINK_P (rhs
))
7713 return instantiate_type (lhstype
, rhs
, flags_in
);
7715 /* This can happen if we are forming a pointer-to-member for a
7717 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7721 case TEMPLATE_ID_EXPR
:
7723 tree fns
= TREE_OPERAND (rhs
, 0);
7724 tree args
= TREE_OPERAND (rhs
, 1);
7727 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7728 /*template_only=*/true,
7735 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7736 /*template_only=*/false,
7737 /*explicit_targs=*/NULL_TREE
,
7742 if (PTRMEM_OK_P (rhs
))
7743 flags
|= tf_ptrmem_ok
;
7745 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7749 return error_mark_node
;
7754 return error_mark_node
;
7757 /* Return the name of the virtual function pointer field
7758 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7759 this may have to look back through base types to find the
7760 ultimate field name. (For single inheritance, these could
7761 all be the same name. Who knows for multiple inheritance). */
7764 get_vfield_name (tree type
)
7766 tree binfo
, base_binfo
;
7769 for (binfo
= TYPE_BINFO (type
);
7770 BINFO_N_BASE_BINFOS (binfo
);
7773 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7775 if (BINFO_VIRTUAL_P (base_binfo
)
7776 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7780 type
= BINFO_TYPE (binfo
);
7781 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7782 + TYPE_NAME_LENGTH (type
) + 2);
7783 sprintf (buf
, VFIELD_NAME_FORMAT
,
7784 IDENTIFIER_POINTER (constructor_name (type
)));
7785 return get_identifier (buf
);
7789 print_class_statistics (void)
7791 if (! GATHER_STATISTICS
)
7794 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7795 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7798 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7799 n_vtables
, n_vtable_searches
);
7800 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7801 n_vtable_entries
, n_vtable_elems
);
7805 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7806 according to [class]:
7807 The class-name is also inserted
7808 into the scope of the class itself. For purposes of access checking,
7809 the inserted class name is treated as if it were a public member name. */
7812 build_self_reference (void)
7814 tree name
= constructor_name (current_class_type
);
7815 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7818 DECL_NONLOCAL (value
) = 1;
7819 DECL_CONTEXT (value
) = current_class_type
;
7820 DECL_ARTIFICIAL (value
) = 1;
7821 SET_DECL_SELF_REFERENCE_P (value
);
7822 set_underlying_type (value
);
7824 if (processing_template_decl
)
7825 value
= push_template_decl (value
);
7827 saved_cas
= current_access_specifier
;
7828 current_access_specifier
= access_public_node
;
7829 finish_member_declaration (value
);
7830 current_access_specifier
= saved_cas
;
7833 /* Returns 1 if TYPE contains only padding bytes. */
7836 is_empty_class (tree type
)
7838 if (type
== error_mark_node
)
7841 if (! CLASS_TYPE_P (type
))
7844 return CLASSTYPE_EMPTY_P (type
);
7847 /* Returns true if TYPE contains no actual data, just various
7848 possible combinations of empty classes and possibly a vptr. */
7851 is_really_empty_class (tree type
)
7853 if (CLASS_TYPE_P (type
))
7860 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7861 out, but we'd like to be able to check this before then. */
7862 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7865 for (binfo
= TYPE_BINFO (type
), i
= 0;
7866 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7867 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7869 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7870 if (TREE_CODE (field
) == FIELD_DECL
7871 && !DECL_ARTIFICIAL (field
)
7872 && !is_really_empty_class (TREE_TYPE (field
)))
7876 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7877 return is_really_empty_class (TREE_TYPE (type
));
7881 /* Note that NAME was looked up while the current class was being
7882 defined and that the result of that lookup was DECL. */
7885 maybe_note_name_used_in_class (tree name
, tree decl
)
7887 splay_tree names_used
;
7889 /* If we're not defining a class, there's nothing to do. */
7890 if (!(innermost_scope_kind() == sk_class
7891 && TYPE_BEING_DEFINED (current_class_type
)
7892 && !LAMBDA_TYPE_P (current_class_type
)))
7895 /* If there's already a binding for this NAME, then we don't have
7896 anything to worry about. */
7897 if (lookup_member (current_class_type
, name
,
7898 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7901 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7902 current_class_stack
[current_class_depth
- 1].names_used
7903 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7904 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7906 splay_tree_insert (names_used
,
7907 (splay_tree_key
) name
,
7908 (splay_tree_value
) decl
);
7911 /* Note that NAME was declared (as DECL) in the current class. Check
7912 to see that the declaration is valid. */
7915 note_name_declared_in_class (tree name
, tree decl
)
7917 splay_tree names_used
;
7920 /* Look to see if we ever used this name. */
7922 = current_class_stack
[current_class_depth
- 1].names_used
;
7925 /* The C language allows members to be declared with a type of the same
7926 name, and the C++ standard says this diagnostic is not required. So
7927 allow it in extern "C" blocks unless predantic is specified.
7928 Allow it in all cases if -ms-extensions is specified. */
7929 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7930 || flag_ms_extensions
)
7932 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7935 /* [basic.scope.class]
7937 A name N used in a class S shall refer to the same declaration
7938 in its context and when re-evaluated in the completed scope of
7940 permerror (input_location
, "declaration of %q#D", decl
);
7941 permerror (input_location
, "changes meaning of %qD from %q+#D",
7942 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7946 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7947 Secondary vtables are merged with primary vtables; this function
7948 will return the VAR_DECL for the primary vtable. */
7951 get_vtbl_decl_for_binfo (tree binfo
)
7955 decl
= BINFO_VTABLE (binfo
);
7956 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7958 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7959 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7962 gcc_assert (VAR_P (decl
));
7967 /* Returns the binfo for the primary base of BINFO. If the resulting
7968 BINFO is a virtual base, and it is inherited elsewhere in the
7969 hierarchy, then the returned binfo might not be the primary base of
7970 BINFO in the complete object. Check BINFO_PRIMARY_P or
7971 BINFO_LOST_PRIMARY_P to be sure. */
7974 get_primary_binfo (tree binfo
)
7978 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
7982 return copied_binfo (primary_base
, binfo
);
7985 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7988 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
7991 fprintf (stream
, "%*s", indent
, "");
7995 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7996 INDENT should be zero when called from the top level; it is
7997 incremented recursively. IGO indicates the next expected BINFO in
7998 inheritance graph ordering. */
8001 dump_class_hierarchy_r (FILE *stream
,
8011 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8012 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8013 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8014 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8017 fprintf (stream
, "alternative-path\n");
8020 igo
= TREE_CHAIN (binfo
);
8022 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8023 tree_to_shwi (BINFO_OFFSET (binfo
)));
8024 if (is_empty_class (BINFO_TYPE (binfo
)))
8025 fprintf (stream
, " empty");
8026 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8027 fprintf (stream
, " nearly-empty");
8028 if (BINFO_VIRTUAL_P (binfo
))
8029 fprintf (stream
, " virtual");
8030 fprintf (stream
, "\n");
8033 if (BINFO_PRIMARY_P (binfo
))
8035 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8036 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8037 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8038 TFF_PLAIN_IDENTIFIER
),
8039 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8041 if (BINFO_LOST_PRIMARY_P (binfo
))
8043 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8044 fprintf (stream
, " lost-primary");
8047 fprintf (stream
, "\n");
8049 if (!(flags
& TDF_SLIM
))
8053 if (BINFO_SUBVTT_INDEX (binfo
))
8055 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8056 fprintf (stream
, " subvttidx=%s",
8057 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8058 TFF_PLAIN_IDENTIFIER
));
8060 if (BINFO_VPTR_INDEX (binfo
))
8062 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8063 fprintf (stream
, " vptridx=%s",
8064 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8065 TFF_PLAIN_IDENTIFIER
));
8067 if (BINFO_VPTR_FIELD (binfo
))
8069 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8070 fprintf (stream
, " vbaseoffset=%s",
8071 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8072 TFF_PLAIN_IDENTIFIER
));
8074 if (BINFO_VTABLE (binfo
))
8076 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8077 fprintf (stream
, " vptr=%s",
8078 expr_as_string (BINFO_VTABLE (binfo
),
8079 TFF_PLAIN_IDENTIFIER
));
8083 fprintf (stream
, "\n");
8086 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8087 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8092 /* Dump the BINFO hierarchy for T. */
8095 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8097 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8098 fprintf (stream
, " size=%lu align=%lu\n",
8099 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8100 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8101 fprintf (stream
, " base size=%lu base align=%lu\n",
8102 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8104 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8106 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8107 fprintf (stream
, "\n");
8110 /* Debug interface to hierarchy dumping. */
8113 debug_class (tree t
)
8115 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8119 dump_class_hierarchy (tree t
)
8122 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8126 dump_class_hierarchy_1 (stream
, flags
, t
);
8131 dump_array (FILE * stream
, tree decl
)
8134 unsigned HOST_WIDE_INT ix
;
8136 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8138 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8140 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8141 fprintf (stream
, " %s entries",
8142 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8143 TFF_PLAIN_IDENTIFIER
));
8144 fprintf (stream
, "\n");
8146 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8148 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8149 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8153 dump_vtable (tree t
, tree binfo
, tree vtable
)
8156 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8161 if (!(flags
& TDF_SLIM
))
8163 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8165 fprintf (stream
, "%s for %s",
8166 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8167 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8170 if (!BINFO_VIRTUAL_P (binfo
))
8171 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8172 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8173 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8175 fprintf (stream
, "\n");
8176 dump_array (stream
, vtable
);
8177 fprintf (stream
, "\n");
8182 dump_vtt (tree t
, tree vtt
)
8185 FILE *stream
= get_dump_info (TDI_class
, &flags
);
8190 if (!(flags
& TDF_SLIM
))
8192 fprintf (stream
, "VTT for %s\n",
8193 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8194 dump_array (stream
, vtt
);
8195 fprintf (stream
, "\n");
8199 /* Dump a function or thunk and its thunkees. */
8202 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8204 static const char spaces
[] = " ";
8205 tree name
= DECL_NAME (thunk
);
8208 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8210 !DECL_THUNK_P (thunk
) ? "function"
8211 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8212 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8213 if (DECL_THUNK_P (thunk
))
8215 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8216 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8218 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8219 if (!virtual_adjust
)
8221 else if (DECL_THIS_THUNK_P (thunk
))
8222 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8223 tree_to_shwi (virtual_adjust
));
8225 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8226 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8227 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8228 if (THUNK_ALIAS (thunk
))
8229 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8231 fprintf (stream
, "\n");
8232 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8233 dump_thunk (stream
, indent
+ 2, thunks
);
8236 /* Dump the thunks for FN. */
8239 debug_thunks (tree fn
)
8241 dump_thunk (stderr
, 0, fn
);
8244 /* Virtual function table initialization. */
8246 /* Create all the necessary vtables for T and its base classes. */
8249 finish_vtbls (tree t
)
8252 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8253 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8255 /* We lay out the primary and secondary vtables in one contiguous
8256 vtable. The primary vtable is first, followed by the non-virtual
8257 secondary vtables in inheritance graph order. */
8258 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8261 /* Then come the virtual bases, also in inheritance graph order. */
8262 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8264 if (!BINFO_VIRTUAL_P (vbase
))
8266 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8269 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8270 initialize_vtable (TYPE_BINFO (t
), v
);
8273 /* Initialize the vtable for BINFO with the INITS. */
8276 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8280 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8281 decl
= get_vtbl_decl_for_binfo (binfo
);
8282 initialize_artificial_var (decl
, inits
);
8283 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8286 /* Build the VTT (virtual table table) for T.
8287 A class requires a VTT if it has virtual bases.
8290 1 - primary virtual pointer for complete object T
8291 2 - secondary VTTs for each direct non-virtual base of T which requires a
8293 3 - secondary virtual pointers for each direct or indirect base of T which
8294 has virtual bases or is reachable via a virtual path from T.
8295 4 - secondary VTTs for each direct or indirect virtual base of T.
8297 Secondary VTTs look like complete object VTTs without part 4. */
8305 vec
<constructor_elt
, va_gc
> *inits
;
8307 /* Build up the initializers for the VTT. */
8309 index
= size_zero_node
;
8310 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8312 /* If we didn't need a VTT, we're done. */
8316 /* Figure out the type of the VTT. */
8317 type
= build_array_of_n_type (const_ptr_type_node
,
8320 /* Now, build the VTT object itself. */
8321 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8322 initialize_artificial_var (vtt
, inits
);
8323 /* Add the VTT to the vtables list. */
8324 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8325 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8330 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8331 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8332 and CHAIN the vtable pointer for this binfo after construction is
8333 complete. VALUE can also be another BINFO, in which case we recurse. */
8336 binfo_ctor_vtable (tree binfo
)
8342 vt
= BINFO_VTABLE (binfo
);
8343 if (TREE_CODE (vt
) == TREE_LIST
)
8344 vt
= TREE_VALUE (vt
);
8345 if (TREE_CODE (vt
) == TREE_BINFO
)
8354 /* Data for secondary VTT initialization. */
8355 typedef struct secondary_vptr_vtt_init_data_s
8357 /* Is this the primary VTT? */
8360 /* Current index into the VTT. */
8363 /* Vector of initializers built up. */
8364 vec
<constructor_elt
, va_gc
> *inits
;
8366 /* The type being constructed by this secondary VTT. */
8367 tree type_being_constructed
;
8368 } secondary_vptr_vtt_init_data
;
8370 /* Recursively build the VTT-initializer for BINFO (which is in the
8371 hierarchy dominated by T). INITS points to the end of the initializer
8372 list to date. INDEX is the VTT index where the next element will be
8373 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8374 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8375 for virtual bases of T. When it is not so, we build the constructor
8376 vtables for the BINFO-in-T variant. */
8379 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8385 secondary_vptr_vtt_init_data data
;
8386 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8388 /* We only need VTTs for subobjects with virtual bases. */
8389 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8392 /* We need to use a construction vtable if this is not the primary
8396 build_ctor_vtbl_group (binfo
, t
);
8398 /* Record the offset in the VTT where this sub-VTT can be found. */
8399 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8402 /* Add the address of the primary vtable for the complete object. */
8403 init
= binfo_ctor_vtable (binfo
);
8404 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8407 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8408 BINFO_VPTR_INDEX (binfo
) = *index
;
8410 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8412 /* Recursively add the secondary VTTs for non-virtual bases. */
8413 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8414 if (!BINFO_VIRTUAL_P (b
))
8415 build_vtt_inits (b
, t
, inits
, index
);
8417 /* Add secondary virtual pointers for all subobjects of BINFO with
8418 either virtual bases or reachable along a virtual path, except
8419 subobjects that are non-virtual primary bases. */
8420 data
.top_level_p
= top_level_p
;
8421 data
.index
= *index
;
8422 data
.inits
= *inits
;
8423 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8425 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8427 *index
= data
.index
;
8429 /* data.inits might have grown as we added secondary virtual pointers.
8430 Make sure our caller knows about the new vector. */
8431 *inits
= data
.inits
;
8434 /* Add the secondary VTTs for virtual bases in inheritance graph
8436 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8438 if (!BINFO_VIRTUAL_P (b
))
8441 build_vtt_inits (b
, t
, inits
, index
);
8444 /* Remove the ctor vtables we created. */
8445 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8448 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8449 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8452 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8454 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8456 /* We don't care about bases that don't have vtables. */
8457 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8458 return dfs_skip_bases
;
8460 /* We're only interested in proper subobjects of the type being
8462 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8465 /* We're only interested in bases with virtual bases or reachable
8466 via a virtual path from the type being constructed. */
8467 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8468 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8469 return dfs_skip_bases
;
8471 /* We're not interested in non-virtual primary bases. */
8472 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8475 /* Record the index where this secondary vptr can be found. */
8476 if (data
->top_level_p
)
8478 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8479 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8481 if (BINFO_VIRTUAL_P (binfo
))
8483 /* It's a primary virtual base, and this is not a
8484 construction vtable. Find the base this is primary of in
8485 the inheritance graph, and use that base's vtable
8487 while (BINFO_PRIMARY_P (binfo
))
8488 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8492 /* Add the initializer for the secondary vptr itself. */
8493 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8495 /* Advance the vtt index. */
8496 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8497 TYPE_SIZE_UNIT (ptr_type_node
));
8502 /* Called from build_vtt_inits via dfs_walk. After building
8503 constructor vtables and generating the sub-vtt from them, we need
8504 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8505 binfo of the base whose sub vtt was generated. */
8508 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8510 tree vtable
= BINFO_VTABLE (binfo
);
8512 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8513 /* If this class has no vtable, none of its bases do. */
8514 return dfs_skip_bases
;
8517 /* This might be a primary base, so have no vtable in this
8521 /* If we scribbled the construction vtable vptr into BINFO, clear it
8523 if (TREE_CODE (vtable
) == TREE_LIST
8524 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8525 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8530 /* Build the construction vtable group for BINFO which is in the
8531 hierarchy dominated by T. */
8534 build_ctor_vtbl_group (tree binfo
, tree t
)
8540 vec
<constructor_elt
, va_gc
> *v
;
8542 /* See if we've already created this construction vtable group. */
8543 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8544 if (IDENTIFIER_GLOBAL_VALUE (id
))
8547 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8548 /* Build a version of VTBL (with the wrong type) for use in
8549 constructing the addresses of secondary vtables in the
8550 construction vtable group. */
8551 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8552 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8553 /* Don't export construction vtables from shared libraries. Even on
8554 targets that don't support hidden visibility, this tells
8555 can_refer_decl_in_current_unit_p not to assume that it's safe to
8556 access from a different compilation unit (bz 54314). */
8557 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8558 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8561 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8562 binfo
, vtbl
, t
, &v
);
8564 /* Add the vtables for each of our virtual bases using the vbase in T
8566 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8568 vbase
= TREE_CHAIN (vbase
))
8572 if (!BINFO_VIRTUAL_P (vbase
))
8574 b
= copied_binfo (vbase
, binfo
);
8576 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8579 /* Figure out the type of the construction vtable. */
8580 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8582 TREE_TYPE (vtbl
) = type
;
8583 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8584 layout_decl (vtbl
, 0);
8586 /* Initialize the construction vtable. */
8587 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8588 initialize_artificial_var (vtbl
, v
);
8589 dump_vtable (t
, binfo
, vtbl
);
8592 /* Add the vtbl initializers for BINFO (and its bases other than
8593 non-virtual primaries) to the list of INITS. BINFO is in the
8594 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8595 the constructor the vtbl inits should be accumulated for. (If this
8596 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8597 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8598 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8599 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8600 but are not necessarily the same in terms of layout. */
8603 accumulate_vtbl_inits (tree binfo
,
8608 vec
<constructor_elt
, va_gc
> **inits
)
8612 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8614 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8616 /* If it doesn't have a vptr, we don't do anything. */
8617 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8620 /* If we're building a construction vtable, we're not interested in
8621 subobjects that don't require construction vtables. */
8623 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8624 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8627 /* Build the initializers for the BINFO-in-T vtable. */
8628 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8630 /* Walk the BINFO and its bases. We walk in preorder so that as we
8631 initialize each vtable we can figure out at what offset the
8632 secondary vtable lies from the primary vtable. We can't use
8633 dfs_walk here because we need to iterate through bases of BINFO
8634 and RTTI_BINFO simultaneously. */
8635 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8637 /* Skip virtual bases. */
8638 if (BINFO_VIRTUAL_P (base_binfo
))
8640 accumulate_vtbl_inits (base_binfo
,
8641 BINFO_BASE_BINFO (orig_binfo
, i
),
8642 rtti_binfo
, vtbl
, t
,
8647 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8648 BINFO vtable to L. */
8651 dfs_accumulate_vtbl_inits (tree binfo
,
8656 vec
<constructor_elt
, va_gc
> **l
)
8658 tree vtbl
= NULL_TREE
;
8659 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8663 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8665 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8666 primary virtual base. If it is not the same primary in
8667 the hierarchy of T, we'll need to generate a ctor vtable
8668 for it, to place at its location in T. If it is the same
8669 primary, we still need a VTT entry for the vtable, but it
8670 should point to the ctor vtable for the base it is a
8671 primary for within the sub-hierarchy of RTTI_BINFO.
8673 There are three possible cases:
8675 1) We are in the same place.
8676 2) We are a primary base within a lost primary virtual base of
8678 3) We are primary to something not a base of RTTI_BINFO. */
8681 tree last
= NULL_TREE
;
8683 /* First, look through the bases we are primary to for RTTI_BINFO
8684 or a virtual base. */
8686 while (BINFO_PRIMARY_P (b
))
8688 b
= BINFO_INHERITANCE_CHAIN (b
);
8690 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8693 /* If we run out of primary links, keep looking down our
8694 inheritance chain; we might be an indirect primary. */
8695 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8696 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8700 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8701 base B and it is a base of RTTI_BINFO, this is case 2. In
8702 either case, we share our vtable with LAST, i.e. the
8703 derived-most base within B of which we are a primary. */
8705 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8706 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8707 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8708 binfo_ctor_vtable after everything's been set up. */
8711 /* Otherwise, this is case 3 and we get our own. */
8713 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8716 n_inits
= vec_safe_length (*l
);
8723 /* Add the initializer for this vtable. */
8724 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8725 &non_fn_entries
, l
);
8727 /* Figure out the position to which the VPTR should point. */
8728 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8729 index
= size_binop (MULT_EXPR
,
8730 TYPE_SIZE_UNIT (vtable_entry_type
),
8731 size_int (non_fn_entries
+ n_inits
));
8732 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8736 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8737 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8738 straighten this out. */
8739 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8740 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8741 /* Throw away any unneeded intializers. */
8742 (*l
)->truncate (n_inits
);
8744 /* For an ordinary vtable, set BINFO_VTABLE. */
8745 BINFO_VTABLE (binfo
) = vtbl
;
8748 static GTY(()) tree abort_fndecl_addr
;
8750 /* Construct the initializer for BINFO's virtual function table. BINFO
8751 is part of the hierarchy dominated by T. If we're building a
8752 construction vtable, the ORIG_BINFO is the binfo we should use to
8753 find the actual function pointers to put in the vtable - but they
8754 can be overridden on the path to most-derived in the graph that
8755 ORIG_BINFO belongs. Otherwise,
8756 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8757 BINFO that should be indicated by the RTTI information in the
8758 vtable; it will be a base class of T, rather than T itself, if we
8759 are building a construction vtable.
8761 The value returned is a TREE_LIST suitable for wrapping in a
8762 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8763 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8764 number of non-function entries in the vtable.
8766 It might seem that this function should never be called with a
8767 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8768 base is always subsumed by a derived class vtable. However, when
8769 we are building construction vtables, we do build vtables for
8770 primary bases; we need these while the primary base is being
8774 build_vtbl_initializer (tree binfo
,
8778 int* non_fn_entries_p
,
8779 vec
<constructor_elt
, va_gc
> **inits
)
8785 vec
<tree
, va_gc
> *vbases
;
8788 /* Initialize VID. */
8789 memset (&vid
, 0, sizeof (vid
));
8792 vid
.rtti_binfo
= rtti_binfo
;
8793 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8794 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8795 vid
.generate_vcall_entries
= true;
8796 /* The first vbase or vcall offset is at index -3 in the vtable. */
8797 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8799 /* Add entries to the vtable for RTTI. */
8800 build_rtti_vtbl_entries (binfo
, &vid
);
8802 /* Create an array for keeping track of the functions we've
8803 processed. When we see multiple functions with the same
8804 signature, we share the vcall offsets. */
8805 vec_alloc (vid
.fns
, 32);
8806 /* Add the vcall and vbase offset entries. */
8807 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8809 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8810 build_vbase_offset_vtbl_entries. */
8811 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8812 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8813 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8815 /* If the target requires padding between data entries, add that now. */
8816 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8818 int n_entries
= vec_safe_length (vid
.inits
);
8820 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8822 /* Move data entries into their new positions and add padding
8823 after the new positions. Iterate backwards so we don't
8824 overwrite entries that we would need to process later. */
8825 for (ix
= n_entries
- 1;
8826 vid
.inits
->iterate (ix
, &e
);
8830 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8831 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8833 (*vid
.inits
)[new_position
] = *e
;
8835 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8837 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8838 f
->index
= NULL_TREE
;
8839 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8845 if (non_fn_entries_p
)
8846 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8848 /* The initializers for virtual functions were built up in reverse
8849 order. Straighten them out and add them to the running list in one
8851 jx
= vec_safe_length (*inits
);
8852 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8854 for (ix
= vid
.inits
->length () - 1;
8855 vid
.inits
->iterate (ix
, &e
);
8859 /* Go through all the ordinary virtual functions, building up
8861 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8865 tree fn
, fn_original
;
8866 tree init
= NULL_TREE
;
8870 if (DECL_THUNK_P (fn
))
8872 if (!DECL_NAME (fn
))
8874 if (THUNK_ALIAS (fn
))
8876 fn
= THUNK_ALIAS (fn
);
8879 fn_original
= THUNK_TARGET (fn
);
8882 /* If the only definition of this function signature along our
8883 primary base chain is from a lost primary, this vtable slot will
8884 never be used, so just zero it out. This is important to avoid
8885 requiring extra thunks which cannot be generated with the function.
8887 We first check this in update_vtable_entry_for_fn, so we handle
8888 restored primary bases properly; we also need to do it here so we
8889 zero out unused slots in ctor vtables, rather than filling them
8890 with erroneous values (though harmless, apart from relocation
8892 if (BV_LOST_PRIMARY (v
))
8893 init
= size_zero_node
;
8897 /* Pull the offset for `this', and the function to call, out of
8899 delta
= BV_DELTA (v
);
8900 vcall_index
= BV_VCALL_INDEX (v
);
8902 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8903 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8905 /* You can't call an abstract virtual function; it's abstract.
8906 So, we replace these functions with __pure_virtual. */
8907 if (DECL_PURE_VIRTUAL_P (fn_original
))
8910 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8912 if (abort_fndecl_addr
== NULL
)
8914 = fold_convert (vfunc_ptr_type_node
,
8915 build_fold_addr_expr (fn
));
8916 init
= abort_fndecl_addr
;
8919 /* Likewise for deleted virtuals. */
8920 else if (DECL_DELETED_FN (fn_original
))
8922 fn
= get_identifier ("__cxa_deleted_virtual");
8923 if (!get_global_value_if_present (fn
, &fn
))
8924 fn
= push_library_fn (fn
, (build_function_type_list
8925 (void_type_node
, NULL_TREE
)),
8926 NULL_TREE
, ECF_NORETURN
);
8927 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8928 init
= fold_convert (vfunc_ptr_type_node
,
8929 build_fold_addr_expr (fn
));
8933 if (!integer_zerop (delta
) || vcall_index
)
8935 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8936 if (!DECL_NAME (fn
))
8939 /* Take the address of the function, considering it to be of an
8940 appropriate generic type. */
8941 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8942 init
= fold_convert (vfunc_ptr_type_node
,
8943 build_fold_addr_expr (fn
));
8944 /* Don't refer to a virtual destructor from a constructor
8945 vtable or a vtable for an abstract class, since destroying
8946 an object under construction is undefined behavior and we
8947 don't want it to be considered a candidate for speculative
8948 devirtualization. But do create the thunk for ABI
8950 if (DECL_DESTRUCTOR_P (fn_original
)
8951 && (CLASSTYPE_PURE_VIRTUALS (DECL_CONTEXT (fn_original
))
8952 || orig_binfo
!= binfo
))
8953 init
= size_zero_node
;
8957 /* And add it to the chain of initializers. */
8958 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8961 if (init
== size_zero_node
)
8962 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8963 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8965 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8967 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8968 fn
, build_int_cst (NULL_TREE
, i
));
8969 TREE_CONSTANT (fdesc
) = 1;
8971 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8975 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8979 /* Adds to vid->inits the initializers for the vbase and vcall
8980 offsets in BINFO, which is in the hierarchy dominated by T. */
8983 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8987 /* If this is a derived class, we must first create entries
8988 corresponding to the primary base class. */
8989 b
= get_primary_binfo (binfo
);
8991 build_vcall_and_vbase_vtbl_entries (b
, vid
);
8993 /* Add the vbase entries for this base. */
8994 build_vbase_offset_vtbl_entries (binfo
, vid
);
8995 /* Add the vcall entries for this base. */
8996 build_vcall_offset_vtbl_entries (binfo
, vid
);
8999 /* Returns the initializers for the vbase offset entries in the vtable
9000 for BINFO (which is part of the class hierarchy dominated by T), in
9001 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9002 where the next vbase offset will go. */
9005 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9009 tree non_primary_binfo
;
9011 /* If there are no virtual baseclasses, then there is nothing to
9013 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9018 /* We might be a primary base class. Go up the inheritance hierarchy
9019 until we find the most derived class of which we are a primary base:
9020 it is the offset of that which we need to use. */
9021 non_primary_binfo
= binfo
;
9022 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9026 /* If we have reached a virtual base, then it must be a primary
9027 base (possibly multi-level) of vid->binfo, or we wouldn't
9028 have called build_vcall_and_vbase_vtbl_entries for it. But it
9029 might be a lost primary, so just skip down to vid->binfo. */
9030 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9032 non_primary_binfo
= vid
->binfo
;
9036 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9037 if (get_primary_binfo (b
) != non_primary_binfo
)
9039 non_primary_binfo
= b
;
9042 /* Go through the virtual bases, adding the offsets. */
9043 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9045 vbase
= TREE_CHAIN (vbase
))
9050 if (!BINFO_VIRTUAL_P (vbase
))
9053 /* Find the instance of this virtual base in the complete
9055 b
= copied_binfo (vbase
, binfo
);
9057 /* If we've already got an offset for this virtual base, we
9058 don't need another one. */
9059 if (BINFO_VTABLE_PATH_MARKED (b
))
9061 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9063 /* Figure out where we can find this vbase offset. */
9064 delta
= size_binop (MULT_EXPR
,
9067 TYPE_SIZE_UNIT (vtable_entry_type
)));
9068 if (vid
->primary_vtbl_p
)
9069 BINFO_VPTR_FIELD (b
) = delta
;
9071 if (binfo
!= TYPE_BINFO (t
))
9072 /* The vbase offset had better be the same. */
9073 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9075 /* The next vbase will come at a more negative offset. */
9076 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9077 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9079 /* The initializer is the delta from BINFO to this virtual base.
9080 The vbase offsets go in reverse inheritance-graph order, and
9081 we are walking in inheritance graph order so these end up in
9083 delta
= size_diffop_loc (input_location
,
9084 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9086 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9087 fold_build1_loc (input_location
, NOP_EXPR
,
9088 vtable_entry_type
, delta
));
9092 /* Adds the initializers for the vcall offset entries in the vtable
9093 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9097 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9099 /* We only need these entries if this base is a virtual base. We
9100 compute the indices -- but do not add to the vtable -- when
9101 building the main vtable for a class. */
9102 if (binfo
== TYPE_BINFO (vid
->derived
)
9103 || (BINFO_VIRTUAL_P (binfo
)
9104 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9105 correspond to VID->DERIVED), we are building a primary
9106 construction virtual table. Since this is a primary
9107 virtual table, we do not need the vcall offsets for
9109 && binfo
!= vid
->rtti_binfo
))
9111 /* We need a vcall offset for each of the virtual functions in this
9112 vtable. For example:
9114 class A { virtual void f (); };
9115 class B1 : virtual public A { virtual void f (); };
9116 class B2 : virtual public A { virtual void f (); };
9117 class C: public B1, public B2 { virtual void f (); };
9119 A C object has a primary base of B1, which has a primary base of A. A
9120 C also has a secondary base of B2, which no longer has a primary base
9121 of A. So the B2-in-C construction vtable needs a secondary vtable for
9122 A, which will adjust the A* to a B2* to call f. We have no way of
9123 knowing what (or even whether) this offset will be when we define B2,
9124 so we store this "vcall offset" in the A sub-vtable and look it up in
9125 a "virtual thunk" for B2::f.
9127 We need entries for all the functions in our primary vtable and
9128 in our non-virtual bases' secondary vtables. */
9130 /* If we are just computing the vcall indices -- but do not need
9131 the actual entries -- not that. */
9132 if (!BINFO_VIRTUAL_P (binfo
))
9133 vid
->generate_vcall_entries
= false;
9134 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9135 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9139 /* Build vcall offsets, starting with those for BINFO. */
9142 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9148 /* Don't walk into virtual bases -- except, of course, for the
9149 virtual base for which we are building vcall offsets. Any
9150 primary virtual base will have already had its offsets generated
9151 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9152 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9155 /* If BINFO has a primary base, process it first. */
9156 primary_binfo
= get_primary_binfo (binfo
);
9158 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9160 /* Add BINFO itself to the list. */
9161 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9163 /* Scan the non-primary bases of BINFO. */
9164 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9165 if (base_binfo
!= primary_binfo
)
9166 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9169 /* Called from build_vcall_offset_vtbl_entries_r. */
9172 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9174 /* Make entries for the rest of the virtuals. */
9177 /* The ABI requires that the methods be processed in declaration
9179 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9181 orig_fn
= DECL_CHAIN (orig_fn
))
9182 if (TREE_CODE (orig_fn
) == FUNCTION_DECL
&& DECL_VINDEX (orig_fn
))
9183 add_vcall_offset (orig_fn
, binfo
, vid
);
9186 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9189 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9195 /* If there is already an entry for a function with the same
9196 signature as FN, then we do not need a second vcall offset.
9197 Check the list of functions already present in the derived
9199 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9201 if (same_signature_p (derived_entry
, orig_fn
)
9202 /* We only use one vcall offset for virtual destructors,
9203 even though there are two virtual table entries. */
9204 || (DECL_DESTRUCTOR_P (derived_entry
)
9205 && DECL_DESTRUCTOR_P (orig_fn
)))
9209 /* If we are building these vcall offsets as part of building
9210 the vtable for the most derived class, remember the vcall
9212 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9214 tree_pair_s elt
= {orig_fn
, vid
->index
};
9215 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9218 /* The next vcall offset will be found at a more negative
9220 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9221 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9223 /* Keep track of this function. */
9224 vec_safe_push (vid
->fns
, orig_fn
);
9226 if (vid
->generate_vcall_entries
)
9231 /* Find the overriding function. */
9232 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9233 if (fn
== error_mark_node
)
9234 vcall_offset
= build_zero_cst (vtable_entry_type
);
9237 base
= TREE_VALUE (fn
);
9239 /* The vbase we're working on is a primary base of
9240 vid->binfo. But it might be a lost primary, so its
9241 BINFO_OFFSET might be wrong, so we just use the
9242 BINFO_OFFSET from vid->binfo. */
9243 vcall_offset
= size_diffop_loc (input_location
,
9244 BINFO_OFFSET (base
),
9245 BINFO_OFFSET (vid
->binfo
));
9246 vcall_offset
= fold_build1_loc (input_location
,
9247 NOP_EXPR
, vtable_entry_type
,
9250 /* Add the initializer to the vtable. */
9251 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9255 /* Return vtbl initializers for the RTTI entries corresponding to the
9256 BINFO's vtable. The RTTI entries should indicate the object given
9257 by VID->rtti_binfo. */
9260 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9268 t
= BINFO_TYPE (vid
->rtti_binfo
);
9270 /* To find the complete object, we will first convert to our most
9271 primary base, and then add the offset in the vtbl to that value. */
9273 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9274 && !BINFO_LOST_PRIMARY_P (b
))
9278 primary_base
= get_primary_binfo (b
);
9279 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9280 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9283 offset
= size_diffop_loc (input_location
,
9284 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9286 /* The second entry is the address of the typeinfo object. */
9288 decl
= build_address (get_tinfo_decl (t
));
9290 decl
= integer_zero_node
;
9292 /* Convert the declaration to a type that can be stored in the
9294 init
= build_nop (vfunc_ptr_type_node
, decl
);
9295 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9297 /* Add the offset-to-top entry. It comes earlier in the vtable than
9298 the typeinfo entry. Convert the offset to look like a
9299 function pointer, so that we can put it in the vtable. */
9300 init
= build_nop (vfunc_ptr_type_node
, offset
);
9301 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9304 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9308 uniquely_derived_from_p (tree parent
, tree type
)
9310 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9311 return base
&& base
!= error_mark_node
;
9314 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9317 publicly_uniquely_derived_p (tree parent
, tree type
)
9319 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9321 return base
&& base
!= error_mark_node
;
9324 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9325 class between them, if any. */
9328 common_enclosing_class (tree ctx1
, tree ctx2
)
9330 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9332 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9333 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9336 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9337 TYPE_MARKED_P (t
) = true;
9338 tree found
= NULL_TREE
;
9339 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9340 if (TYPE_MARKED_P (t
))
9345 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9346 TYPE_MARKED_P (t
) = false;
9350 #include "gt-cp-class.h"