1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
26 #include "coretypes.h"
36 #include "splay-tree.h"
37 #include "pointer-set.h"
38 #include "hash-table.h"
40 /* The number of nested classes being processed. If we are not in the
41 scope of any class, this is zero. */
43 int current_class_depth
;
45 /* In order to deal with nested classes, we keep a stack of classes.
46 The topmost entry is the innermost class, and is the entry at index
47 CURRENT_CLASS_DEPTH */
49 typedef struct class_stack_node
{
50 /* The name of the class. */
53 /* The _TYPE node for the class. */
56 /* The access specifier pending for new declarations in the scope of
60 /* If were defining TYPE, the names used in this class. */
61 splay_tree names_used
;
63 /* Nonzero if this class is no longer open, because of a call to
66 }* class_stack_node_t
;
68 typedef struct vtbl_init_data_s
70 /* The base for which we're building initializers. */
72 /* The type of the most-derived type. */
74 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
75 unless ctor_vtbl_p is true. */
77 /* The negative-index vtable initializers built up so far. These
78 are in order from least negative index to most negative index. */
79 vec
<constructor_elt
, va_gc
> *inits
;
80 /* The binfo for the virtual base for which we're building
81 vcall offset initializers. */
83 /* The functions in vbase for which we have already provided vcall
85 vec
<tree
, va_gc
> *fns
;
86 /* The vtable index of the next vcall or vbase offset. */
88 /* Nonzero if we are building the initializer for the primary
91 /* Nonzero if we are building the initializer for a construction
94 /* True when adding vcall offset entries to the vtable. False when
95 merely computing the indices. */
96 bool generate_vcall_entries
;
99 /* The type of a function passed to walk_subobject_offsets. */
100 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
102 /* The stack itself. This is a dynamically resized array. The
103 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
104 static int current_class_stack_size
;
105 static class_stack_node_t current_class_stack
;
107 /* The size of the largest empty class seen in this translation unit. */
108 static GTY (()) tree sizeof_biggest_empty_class
;
110 /* An array of all local classes present in this translation unit, in
111 declaration order. */
112 vec
<tree
, va_gc
> *local_classes
;
114 static tree
get_vfield_name (tree
);
115 static void finish_struct_anon (tree
);
116 static tree
get_vtable_name (tree
);
117 static tree
get_basefndecls (tree
, tree
);
118 static int build_primary_vtable (tree
, tree
);
119 static int build_secondary_vtable (tree
);
120 static void finish_vtbls (tree
);
121 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
122 static void finish_struct_bits (tree
);
123 static int alter_access (tree
, tree
, tree
);
124 static void handle_using_decl (tree
, tree
);
125 static tree
dfs_modify_vtables (tree
, void *);
126 static tree
modify_all_vtables (tree
, tree
);
127 static void determine_primary_bases (tree
);
128 static void finish_struct_methods (tree
);
129 static void maybe_warn_about_overly_private_class (tree
);
130 static int method_name_cmp (const void *, const void *);
131 static int resort_method_name_cmp (const void *, const void *);
132 static void add_implicitly_declared_members (tree
, tree
*, int, int);
133 static tree
fixed_type_or_null (tree
, int *, int *);
134 static tree
build_simple_base_path (tree expr
, tree binfo
);
135 static tree
build_vtbl_ref_1 (tree
, tree
);
136 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
137 vec
<constructor_elt
, va_gc
> **);
138 static int count_fields (tree
);
139 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
140 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
141 static bool check_bitfield_decl (tree
);
142 static void check_field_decl (tree
, tree
, int *, int *, int *);
143 static void check_field_decls (tree
, tree
*, int *, int *);
144 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
145 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
146 static void check_methods (tree
);
147 static void remove_zero_width_bit_fields (tree
);
148 static void check_bases (tree
, int *, int *);
149 static void check_bases_and_members (tree
);
150 static tree
create_vtable_ptr (tree
, tree
*);
151 static void include_empty_classes (record_layout_info
);
152 static void layout_class_type (tree
, tree
*);
153 static void propagate_binfo_offsets (tree
, tree
);
154 static void layout_virtual_bases (record_layout_info
, splay_tree
);
155 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
156 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
157 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
158 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
159 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
160 static void layout_vtable_decl (tree
, int);
161 static tree
dfs_find_final_overrider_pre (tree
, void *);
162 static tree
dfs_find_final_overrider_post (tree
, void *);
163 static tree
find_final_overrider (tree
, tree
, tree
);
164 static int make_new_vtable (tree
, tree
);
165 static tree
get_primary_binfo (tree
);
166 static int maybe_indent_hierarchy (FILE *, int, int);
167 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
168 static void dump_class_hierarchy (tree
);
169 static void dump_class_hierarchy_1 (FILE *, int, tree
);
170 static void dump_array (FILE *, tree
);
171 static void dump_vtable (tree
, tree
, tree
);
172 static void dump_vtt (tree
, tree
);
173 static void dump_thunk (FILE *, int, tree
);
174 static tree
build_vtable (tree
, tree
, tree
);
175 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
176 static void layout_nonempty_base_or_field (record_layout_info
,
177 tree
, tree
, splay_tree
);
178 static tree
end_of_class (tree
, int);
179 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
180 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
181 vec
<constructor_elt
, va_gc
> **);
182 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
183 vec
<constructor_elt
, va_gc
> **);
184 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
185 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
186 static void clone_constructors_and_destructors (tree
);
187 static tree
build_clone (tree
, tree
);
188 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
189 static void build_ctor_vtbl_group (tree
, tree
);
190 static void build_vtt (tree
);
191 static tree
binfo_ctor_vtable (tree
);
192 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
194 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
195 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
196 static int record_subobject_offset (tree
, tree
, splay_tree
);
197 static int check_subobject_offset (tree
, tree
, splay_tree
);
198 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
199 tree
, splay_tree
, tree
, int);
200 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
201 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
202 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
204 static void warn_about_ambiguous_bases (tree
);
205 static bool type_requires_array_cookie (tree
);
206 static bool contains_empty_class_p (tree
);
207 static bool base_derived_from (tree
, tree
);
208 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
209 static tree
end_of_base (tree
);
210 static tree
get_vcall_index (tree
, tree
);
212 /* Variables shared between class.c and call.c. */
215 int n_vtable_entries
= 0;
216 int n_vtable_searches
= 0;
217 int n_vtable_elems
= 0;
218 int n_convert_harshness
= 0;
219 int n_compute_conversion_costs
= 0;
220 int n_inner_fields_searched
= 0;
222 /* Convert to or from a base subobject. EXPR is an expression of type
223 `A' or `A*', an expression of type `B' or `B*' is returned. To
224 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
225 the B base instance within A. To convert base A to derived B, CODE
226 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
227 In this latter case, A must not be a morally virtual base of B.
228 NONNULL is true if EXPR is known to be non-NULL (this is only
229 needed when EXPR is of pointer type). CV qualifiers are preserved
233 build_base_path (enum tree_code code
,
237 tsubst_flags_t complain
)
239 tree v_binfo
= NULL_TREE
;
240 tree d_binfo
= NULL_TREE
;
244 tree null_test
= NULL
;
245 tree ptr_target_type
;
247 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
248 bool has_empty
= false;
251 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
252 return error_mark_node
;
254 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
257 if (is_empty_class (BINFO_TYPE (probe
)))
259 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
263 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
265 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
267 if (code
== PLUS_EXPR
268 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
270 /* This can happen when adjust_result_of_qualified_name_lookup can't
271 find a unique base binfo in a call to a member function. We
272 couldn't give the diagnostic then since we might have been calling
273 a static member function, so we do it now. */
274 if (complain
& tf_error
)
276 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
277 ba_unique
, NULL
, complain
);
278 gcc_assert (base
== error_mark_node
);
280 return error_mark_node
;
283 gcc_assert ((code
== MINUS_EXPR
284 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
285 || code
== PLUS_EXPR
);
287 if (binfo
== d_binfo
)
291 if (code
== MINUS_EXPR
&& v_binfo
)
293 if (complain
& tf_error
)
294 error ("cannot convert from base %qT to derived type %qT via "
295 "virtual base %qT", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
296 BINFO_TYPE (v_binfo
));
297 return error_mark_node
;
301 /* This must happen before the call to save_expr. */
302 expr
= cp_build_addr_expr (expr
, complain
);
304 expr
= mark_rvalue_use (expr
);
306 offset
= BINFO_OFFSET (binfo
);
307 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
308 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
309 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
310 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
311 expression returned matches the input. */
312 target_type
= cp_build_qualified_type
313 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
314 ptr_target_type
= build_pointer_type (target_type
);
316 /* Do we need to look in the vtable for the real offset? */
317 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
319 /* Don't bother with the calculations inside sizeof; they'll ICE if the
320 source type is incomplete and the pointer value doesn't matter. In a
321 template (even in fold_non_dependent_expr), we don't have vtables set
322 up properly yet, and the value doesn't matter there either; we're just
323 interested in the result of overload resolution. */
324 if (cp_unevaluated_operand
!= 0
325 || in_template_function ())
327 expr
= build_nop (ptr_target_type
, expr
);
329 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
333 /* If we're in an NSDMI, we don't have the full constructor context yet
334 that we need for converting to a virtual base, so just build a stub
335 CONVERT_EXPR and expand it later in bot_replace. */
336 if (virtual_access
&& fixed_type_p
< 0
337 && current_scope () != current_function_decl
)
339 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
340 CONVERT_EXPR_VBASE_PATH (expr
) = true;
342 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
346 /* Do we need to check for a null pointer? */
347 if (want_pointer
&& !nonnull
)
349 /* If we know the conversion will not actually change the value
350 of EXPR, then we can avoid testing the expression for NULL.
351 We have to avoid generating a COMPONENT_REF for a base class
352 field, because other parts of the compiler know that such
353 expressions are always non-NULL. */
354 if (!virtual_access
&& integer_zerop (offset
))
355 return build_nop (ptr_target_type
, expr
);
356 null_test
= error_mark_node
;
359 /* Protect against multiple evaluation if necessary. */
360 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
361 expr
= save_expr (expr
);
363 /* Now that we've saved expr, build the real null test. */
366 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
367 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
371 /* If this is a simple base reference, express it as a COMPONENT_REF. */
372 if (code
== PLUS_EXPR
&& !virtual_access
373 /* We don't build base fields for empty bases, and they aren't very
374 interesting to the optimizers anyway. */
377 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
378 expr
= build_simple_base_path (expr
, binfo
);
380 expr
= build_address (expr
);
381 target_type
= TREE_TYPE (expr
);
387 /* Going via virtual base V_BINFO. We need the static offset
388 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
389 V_BINFO. That offset is an entry in D_BINFO's vtable. */
392 if (fixed_type_p
< 0 && in_base_initializer
)
394 /* In a base member initializer, we cannot rely on the
395 vtable being set up. We have to indirect via the
399 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
400 t
= build_pointer_type (t
);
401 v_offset
= convert (t
, current_vtt_parm
);
402 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
405 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
407 TREE_TYPE (TREE_TYPE (expr
)));
409 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
410 v_offset
= build1 (NOP_EXPR
,
411 build_pointer_type (ptrdiff_type_node
),
413 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
414 TREE_CONSTANT (v_offset
) = 1;
416 offset
= convert_to_integer (ptrdiff_type_node
,
417 size_diffop_loc (input_location
, offset
,
418 BINFO_OFFSET (v_binfo
)));
420 if (!integer_zerop (offset
))
421 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
423 if (fixed_type_p
< 0)
424 /* Negative fixed_type_p means this is a constructor or destructor;
425 virtual base layout is fixed in in-charge [cd]tors, but not in
427 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
428 build2 (EQ_EXPR
, boolean_type_node
,
429 current_in_charge_parm
, integer_zero_node
),
431 convert_to_integer (ptrdiff_type_node
,
432 BINFO_OFFSET (binfo
)));
438 target_type
= ptr_target_type
;
440 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
442 if (!integer_zerop (offset
))
444 offset
= fold_convert (sizetype
, offset
);
445 if (code
== MINUS_EXPR
)
446 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
447 expr
= fold_build_pointer_plus (expr
, offset
);
453 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
457 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
458 build_zero_cst (target_type
));
463 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
464 Perform a derived-to-base conversion by recursively building up a
465 sequence of COMPONENT_REFs to the appropriate base fields. */
468 build_simple_base_path (tree expr
, tree binfo
)
470 tree type
= BINFO_TYPE (binfo
);
471 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
474 if (d_binfo
== NULL_TREE
)
478 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
480 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
481 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
482 an lvalue in the front end; only _DECLs and _REFs are lvalues
484 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
486 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
492 expr
= build_simple_base_path (expr
, d_binfo
);
494 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
495 field
; field
= DECL_CHAIN (field
))
496 /* Is this the base field created by build_base_field? */
497 if (TREE_CODE (field
) == FIELD_DECL
498 && DECL_FIELD_IS_BASE (field
)
499 && TREE_TYPE (field
) == type
500 /* If we're looking for a field in the most-derived class,
501 also check the field offset; we can have two base fields
502 of the same type if one is an indirect virtual base and one
503 is a direct non-virtual base. */
504 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
505 || tree_int_cst_equal (byte_position (field
),
506 BINFO_OFFSET (binfo
))))
508 /* We don't use build_class_member_access_expr here, as that
509 has unnecessary checks, and more importantly results in
510 recursive calls to dfs_walk_once. */
511 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
513 expr
= build3 (COMPONENT_REF
,
514 cp_build_qualified_type (type
, type_quals
),
515 expr
, field
, NULL_TREE
);
516 expr
= fold_if_not_in_template (expr
);
518 /* Mark the expression const or volatile, as appropriate.
519 Even though we've dealt with the type above, we still have
520 to mark the expression itself. */
521 if (type_quals
& TYPE_QUAL_CONST
)
522 TREE_READONLY (expr
) = 1;
523 if (type_quals
& TYPE_QUAL_VOLATILE
)
524 TREE_THIS_VOLATILE (expr
) = 1;
529 /* Didn't find the base field?!? */
533 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
534 type is a class type or a pointer to a class type. In the former
535 case, TYPE is also a class type; in the latter it is another
536 pointer type. If CHECK_ACCESS is true, an error message is emitted
537 if TYPE is inaccessible. If OBJECT has pointer type, the value is
538 assumed to be non-NULL. */
541 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
542 tsubst_flags_t complain
)
547 if (TYPE_PTR_P (TREE_TYPE (object
)))
549 object_type
= TREE_TYPE (TREE_TYPE (object
));
550 type
= TREE_TYPE (type
);
553 object_type
= TREE_TYPE (object
);
555 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
557 if (!binfo
|| binfo
== error_mark_node
)
558 return error_mark_node
;
560 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
563 /* EXPR is an expression with unqualified class type. BASE is a base
564 binfo of that class type. Returns EXPR, converted to the BASE
565 type. This function assumes that EXPR is the most derived class;
566 therefore virtual bases can be found at their static offsets. */
569 convert_to_base_statically (tree expr
, tree base
)
573 expr_type
= TREE_TYPE (expr
);
574 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
576 /* If this is a non-empty base, use a COMPONENT_REF. */
577 if (!is_empty_class (BINFO_TYPE (base
)))
578 return build_simple_base_path (expr
, base
);
580 /* We use fold_build2 and fold_convert below to simplify the trees
581 provided to the optimizers. It is not safe to call these functions
582 when processing a template because they do not handle C++-specific
584 gcc_assert (!processing_template_decl
);
585 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
586 if (!integer_zerop (BINFO_OFFSET (base
)))
587 expr
= fold_build_pointer_plus_loc (input_location
,
588 expr
, BINFO_OFFSET (base
));
589 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
590 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
598 build_vfield_ref (tree datum
, tree type
)
600 tree vfield
, vcontext
;
602 if (datum
== error_mark_node
)
603 return error_mark_node
;
605 /* First, convert to the requested type. */
606 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
607 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
608 /*nonnull=*/true, tf_warning_or_error
);
610 /* Second, the requested type may not be the owner of its own vptr.
611 If not, convert to the base class that owns it. We cannot use
612 convert_to_base here, because VCONTEXT may appear more than once
613 in the inheritance hierarchy of TYPE, and thus direct conversion
614 between the types may be ambiguous. Following the path back up
615 one step at a time via primary bases avoids the problem. */
616 vfield
= TYPE_VFIELD (type
);
617 vcontext
= DECL_CONTEXT (vfield
);
618 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
620 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
621 type
= TREE_TYPE (datum
);
624 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
627 /* Given an object INSTANCE, return an expression which yields the
628 vtable element corresponding to INDEX. There are many special
629 cases for INSTANCE which we take care of here, mainly to avoid
630 creating extra tree nodes when we don't have to. */
633 build_vtbl_ref_1 (tree instance
, tree idx
)
636 tree vtbl
= NULL_TREE
;
638 /* Try to figure out what a reference refers to, and
639 access its virtual function table directly. */
642 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
644 tree basetype
= non_reference (TREE_TYPE (instance
));
646 if (fixed_type
&& !cdtorp
)
648 tree binfo
= lookup_base (fixed_type
, basetype
,
649 ba_unique
, NULL
, tf_none
);
650 if (binfo
&& binfo
!= error_mark_node
)
651 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
655 vtbl
= build_vfield_ref (instance
, basetype
);
657 aref
= build_array_ref (input_location
, vtbl
, idx
);
658 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
664 build_vtbl_ref (tree instance
, tree idx
)
666 tree aref
= build_vtbl_ref_1 (instance
, idx
);
671 /* Given a stable object pointer INSTANCE_PTR, return an expression which
672 yields a function pointer corresponding to vtable element INDEX. */
675 build_vfn_ref (tree instance_ptr
, tree idx
)
679 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
680 tf_warning_or_error
),
683 /* When using function descriptors, the address of the
684 vtable entry is treated as a function pointer. */
685 if (TARGET_VTABLE_USES_DESCRIPTORS
)
686 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
687 cp_build_addr_expr (aref
, tf_warning_or_error
));
689 /* Remember this as a method reference, for later devirtualization. */
690 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
695 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
696 for the given TYPE. */
699 get_vtable_name (tree type
)
701 return mangle_vtbl_for_type (type
);
704 /* DECL is an entity associated with TYPE, like a virtual table or an
705 implicitly generated constructor. Determine whether or not DECL
706 should have external or internal linkage at the object file
707 level. This routine does not deal with COMDAT linkage and other
708 similar complexities; it simply sets TREE_PUBLIC if it possible for
709 entities in other translation units to contain copies of DECL, in
713 set_linkage_according_to_type (tree
/*type*/, tree decl
)
715 TREE_PUBLIC (decl
) = 1;
716 determine_visibility (decl
);
719 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
720 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
721 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
724 build_vtable (tree class_type
, tree name
, tree vtable_type
)
728 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
729 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
730 now to avoid confusion in mangle_decl. */
731 SET_DECL_ASSEMBLER_NAME (decl
, name
);
732 DECL_CONTEXT (decl
) = class_type
;
733 DECL_ARTIFICIAL (decl
) = 1;
734 TREE_STATIC (decl
) = 1;
735 TREE_READONLY (decl
) = 1;
736 DECL_VIRTUAL_P (decl
) = 1;
737 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
738 DECL_VTABLE_OR_VTT_P (decl
) = 1;
739 /* At one time the vtable info was grabbed 2 words at a time. This
740 fails on sparc unless you have 8-byte alignment. (tiemann) */
741 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
743 set_linkage_according_to_type (class_type
, decl
);
744 /* The vtable has not been defined -- yet. */
745 DECL_EXTERNAL (decl
) = 1;
746 DECL_NOT_REALLY_EXTERN (decl
) = 1;
748 /* Mark the VAR_DECL node representing the vtable itself as a
749 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
750 is rather important that such things be ignored because any
751 effort to actually generate DWARF for them will run into
752 trouble when/if we encounter code like:
755 struct S { virtual void member (); };
757 because the artificial declaration of the vtable itself (as
758 manufactured by the g++ front end) will say that the vtable is
759 a static member of `S' but only *after* the debug output for
760 the definition of `S' has already been output. This causes
761 grief because the DWARF entry for the definition of the vtable
762 will try to refer back to an earlier *declaration* of the
763 vtable as a static member of `S' and there won't be one. We
764 might be able to arrange to have the "vtable static member"
765 attached to the member list for `S' before the debug info for
766 `S' get written (which would solve the problem) but that would
767 require more intrusive changes to the g++ front end. */
768 DECL_IGNORED_P (decl
) = 1;
773 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
774 or even complete. If this does not exist, create it. If COMPLETE is
775 nonzero, then complete the definition of it -- that will render it
776 impossible to actually build the vtable, but is useful to get at those
777 which are known to exist in the runtime. */
780 get_vtable_decl (tree type
, int complete
)
784 if (CLASSTYPE_VTABLES (type
))
785 return CLASSTYPE_VTABLES (type
);
787 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
788 CLASSTYPE_VTABLES (type
) = decl
;
792 DECL_EXTERNAL (decl
) = 1;
793 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
799 /* Build the primary virtual function table for TYPE. If BINFO is
800 non-NULL, build the vtable starting with the initial approximation
801 that it is the same as the one which is the head of the association
802 list. Returns a nonzero value if a new vtable is actually
806 build_primary_vtable (tree binfo
, tree type
)
811 decl
= get_vtable_decl (type
, /*complete=*/0);
815 if (BINFO_NEW_VTABLE_MARKED (binfo
))
816 /* We have already created a vtable for this base, so there's
817 no need to do it again. */
820 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
821 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
822 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
823 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
827 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
828 virtuals
= NULL_TREE
;
831 if (GATHER_STATISTICS
)
834 n_vtable_elems
+= list_length (virtuals
);
837 /* Initialize the association list for this type, based
838 on our first approximation. */
839 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
840 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
841 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
845 /* Give BINFO a new virtual function table which is initialized
846 with a skeleton-copy of its original initialization. The only
847 entry that changes is the `delta' entry, so we can really
848 share a lot of structure.
850 FOR_TYPE is the most derived type which caused this table to
853 Returns nonzero if we haven't met BINFO before.
855 The order in which vtables are built (by calling this function) for
856 an object must remain the same, otherwise a binary incompatibility
860 build_secondary_vtable (tree binfo
)
862 if (BINFO_NEW_VTABLE_MARKED (binfo
))
863 /* We already created a vtable for this base. There's no need to
867 /* Remember that we've created a vtable for this BINFO, so that we
868 don't try to do so again. */
869 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
871 /* Make fresh virtual list, so we can smash it later. */
872 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
874 /* Secondary vtables are laid out as part of the same structure as
875 the primary vtable. */
876 BINFO_VTABLE (binfo
) = NULL_TREE
;
880 /* Create a new vtable for BINFO which is the hierarchy dominated by
881 T. Return nonzero if we actually created a new vtable. */
884 make_new_vtable (tree t
, tree binfo
)
886 if (binfo
== TYPE_BINFO (t
))
887 /* In this case, it is *type*'s vtable we are modifying. We start
888 with the approximation that its vtable is that of the
889 immediate base class. */
890 return build_primary_vtable (binfo
, t
);
892 /* This is our very own copy of `basetype' to play with. Later,
893 we will fill in all the virtual functions that override the
894 virtual functions in these base classes which are not defined
895 by the current type. */
896 return build_secondary_vtable (binfo
);
899 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
900 (which is in the hierarchy dominated by T) list FNDECL as its
901 BV_FN. DELTA is the required constant adjustment from the `this'
902 pointer where the vtable entry appears to the `this' required when
903 the function is actually called. */
906 modify_vtable_entry (tree t
,
916 if (fndecl
!= BV_FN (v
)
917 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
919 /* We need a new vtable for BINFO. */
920 if (make_new_vtable (t
, binfo
))
922 /* If we really did make a new vtable, we also made a copy
923 of the BINFO_VIRTUALS list. Now, we have to find the
924 corresponding entry in that list. */
925 *virtuals
= BINFO_VIRTUALS (binfo
);
926 while (BV_FN (*virtuals
) != BV_FN (v
))
927 *virtuals
= TREE_CHAIN (*virtuals
);
931 BV_DELTA (v
) = delta
;
932 BV_VCALL_INDEX (v
) = NULL_TREE
;
938 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
939 the USING_DECL naming METHOD. Returns true if the method could be
940 added to the method vec. */
943 add_method (tree type
, tree method
, tree using_decl
)
947 bool template_conv_p
= false;
949 vec
<tree
, va_gc
> *method_vec
;
951 bool insert_p
= false;
955 if (method
== error_mark_node
)
958 complete_p
= COMPLETE_TYPE_P (type
);
959 conv_p
= DECL_CONV_FN_P (method
);
961 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
962 && DECL_TEMPLATE_CONV_FN_P (method
));
964 method_vec
= CLASSTYPE_METHOD_VEC (type
);
967 /* Make a new method vector. We start with 8 entries. We must
968 allocate at least two (for constructors and destructors), and
969 we're going to end up with an assignment operator at some
971 vec_alloc (method_vec
, 8);
972 /* Create slots for constructors and destructors. */
973 method_vec
->quick_push (NULL_TREE
);
974 method_vec
->quick_push (NULL_TREE
);
975 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
978 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
979 grok_special_member_properties (method
);
981 /* Constructors and destructors go in special slots. */
982 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
983 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
984 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
986 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
988 if (TYPE_FOR_JAVA (type
))
990 if (!DECL_ARTIFICIAL (method
))
991 error ("Java class %qT cannot have a destructor", type
);
992 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
993 error ("Java class %qT cannot have an implicit non-trivial "
1003 /* See if we already have an entry with this name. */
1004 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1005 vec_safe_iterate (method_vec
, slot
, &m
);
1008 m
= OVL_CURRENT (m
);
1009 if (template_conv_p
)
1011 if (TREE_CODE (m
) == TEMPLATE_DECL
1012 && DECL_TEMPLATE_CONV_FN_P (m
))
1016 if (conv_p
&& !DECL_CONV_FN_P (m
))
1018 if (DECL_NAME (m
) == DECL_NAME (method
))
1024 && !DECL_CONV_FN_P (m
)
1025 && DECL_NAME (m
) > DECL_NAME (method
))
1029 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1031 /* Check to see if we've already got this method. */
1032 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1034 tree fn
= OVL_CURRENT (fns
);
1040 if (TREE_CODE (fn
) != TREE_CODE (method
))
1043 /* [over.load] Member function declarations with the
1044 same name and the same parameter types cannot be
1045 overloaded if any of them is a static member
1046 function declaration.
1048 [over.load] Member function declarations with the same name and
1049 the same parameter-type-list as well as member function template
1050 declarations with the same name, the same parameter-type-list, and
1051 the same template parameter lists cannot be overloaded if any of
1052 them, but not all, have a ref-qualifier.
1054 [namespace.udecl] When a using-declaration brings names
1055 from a base class into a derived class scope, member
1056 functions in the derived class override and/or hide member
1057 functions with the same name and parameter types in a base
1058 class (rather than conflicting). */
1059 fn_type
= TREE_TYPE (fn
);
1060 method_type
= TREE_TYPE (method
);
1061 parms1
= TYPE_ARG_TYPES (fn_type
);
1062 parms2
= TYPE_ARG_TYPES (method_type
);
1064 /* Compare the quals on the 'this' parm. Don't compare
1065 the whole types, as used functions are treated as
1066 coming from the using class in overload resolution. */
1067 if (! DECL_STATIC_FUNCTION_P (fn
)
1068 && ! DECL_STATIC_FUNCTION_P (method
)
1069 /* Either both or neither need to be ref-qualified for
1070 differing quals to allow overloading. */
1071 && (FUNCTION_REF_QUALIFIED (fn_type
)
1072 == FUNCTION_REF_QUALIFIED (method_type
))
1073 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1074 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1077 /* For templates, the return type and template parameters
1078 must be identical. */
1079 if (TREE_CODE (fn
) == TEMPLATE_DECL
1080 && (!same_type_p (TREE_TYPE (fn_type
),
1081 TREE_TYPE (method_type
))
1082 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1083 DECL_TEMPLATE_PARMS (method
))))
1086 if (! DECL_STATIC_FUNCTION_P (fn
))
1087 parms1
= TREE_CHAIN (parms1
);
1088 if (! DECL_STATIC_FUNCTION_P (method
))
1089 parms2
= TREE_CHAIN (parms2
);
1091 if (compparms (parms1
, parms2
)
1092 && (!DECL_CONV_FN_P (fn
)
1093 || same_type_p (TREE_TYPE (fn_type
),
1094 TREE_TYPE (method_type
))))
1096 /* For function versions, their parms and types match
1097 but they are not duplicates. Record function versions
1098 as and when they are found. extern "C" functions are
1099 not treated as versions. */
1100 if (TREE_CODE (fn
) == FUNCTION_DECL
1101 && TREE_CODE (method
) == FUNCTION_DECL
1102 && !DECL_EXTERN_C_P (fn
)
1103 && !DECL_EXTERN_C_P (method
)
1104 && targetm
.target_option
.function_versions (fn
, method
))
1106 /* Mark functions as versions if necessary. Modify the mangled
1107 decl name if necessary. */
1108 if (!DECL_FUNCTION_VERSIONED (fn
))
1110 DECL_FUNCTION_VERSIONED (fn
) = 1;
1111 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1114 if (!DECL_FUNCTION_VERSIONED (method
))
1116 DECL_FUNCTION_VERSIONED (method
) = 1;
1117 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1118 mangle_decl (method
);
1120 record_function_versions (fn
, method
);
1123 if (DECL_INHERITED_CTOR_BASE (method
))
1125 if (DECL_INHERITED_CTOR_BASE (fn
))
1127 error_at (DECL_SOURCE_LOCATION (method
),
1128 "%q#D inherited from %qT", method
,
1129 DECL_INHERITED_CTOR_BASE (method
));
1130 error_at (DECL_SOURCE_LOCATION (fn
),
1131 "conflicts with version inherited from %qT",
1132 DECL_INHERITED_CTOR_BASE (fn
));
1134 /* Otherwise defer to the other function. */
1139 if (DECL_CONTEXT (fn
) == type
)
1140 /* Defer to the local function. */
1145 error ("%q+#D cannot be overloaded", method
);
1146 error ("with %q+#D", fn
);
1149 /* We don't call duplicate_decls here to merge the
1150 declarations because that will confuse things if the
1151 methods have inline definitions. In particular, we
1152 will crash while processing the definitions. */
1157 /* A class should never have more than one destructor. */
1158 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1161 /* Add the new binding. */
1164 overload
= ovl_cons (method
, current_fns
);
1165 OVL_USED (overload
) = true;
1168 overload
= build_overload (method
, current_fns
);
1171 TYPE_HAS_CONVERSION (type
) = 1;
1172 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1173 push_class_level_binding (DECL_NAME (method
), overload
);
1179 /* We only expect to add few methods in the COMPLETE_P case, so
1180 just make room for one more method in that case. */
1182 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1184 reallocated
= vec_safe_reserve (method_vec
, 1);
1186 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1187 if (slot
== method_vec
->length ())
1188 method_vec
->quick_push (overload
);
1190 method_vec
->quick_insert (slot
, overload
);
1193 /* Replace the current slot. */
1194 (*method_vec
)[slot
] = overload
;
1198 /* Subroutines of finish_struct. */
1200 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1201 legit, otherwise return 0. */
1204 alter_access (tree t
, tree fdecl
, tree access
)
1208 if (!DECL_LANG_SPECIFIC (fdecl
))
1209 retrofit_lang_decl (fdecl
);
1211 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1213 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1216 if (TREE_VALUE (elem
) != access
)
1218 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1219 error ("conflicting access specifications for method"
1220 " %q+D, ignored", TREE_TYPE (fdecl
));
1222 error ("conflicting access specifications for field %qE, ignored",
1227 /* They're changing the access to the same thing they changed
1228 it to before. That's OK. */
1234 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1235 tf_warning_or_error
);
1236 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1242 /* Process the USING_DECL, which is a member of T. */
1245 handle_using_decl (tree using_decl
, tree t
)
1247 tree decl
= USING_DECL_DECLS (using_decl
);
1248 tree name
= DECL_NAME (using_decl
);
1250 = TREE_PRIVATE (using_decl
) ? access_private_node
1251 : TREE_PROTECTED (using_decl
) ? access_protected_node
1252 : access_public_node
;
1253 tree flist
= NULL_TREE
;
1256 gcc_assert (!processing_template_decl
&& decl
);
1258 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1259 tf_warning_or_error
);
1262 if (is_overloaded_fn (old_value
))
1263 old_value
= OVL_CURRENT (old_value
);
1265 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1268 old_value
= NULL_TREE
;
1271 cp_emit_debug_info_for_using (decl
, USING_DECL_SCOPE (using_decl
));
1273 if (is_overloaded_fn (decl
))
1278 else if (is_overloaded_fn (old_value
))
1281 /* It's OK to use functions from a base when there are functions with
1282 the same name already present in the current class. */;
1285 error ("%q+D invalid in %q#T", using_decl
, t
);
1286 error (" because of local method %q+#D with same name",
1287 OVL_CURRENT (old_value
));
1291 else if (!DECL_ARTIFICIAL (old_value
))
1293 error ("%q+D invalid in %q#T", using_decl
, t
);
1294 error (" because of local member %q+#D with same name", old_value
);
1298 /* Make type T see field decl FDECL with access ACCESS. */
1300 for (; flist
; flist
= OVL_NEXT (flist
))
1302 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1303 alter_access (t
, OVL_CURRENT (flist
), access
);
1306 alter_access (t
, decl
, access
);
1309 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1310 types with abi tags, add the corresponding identifiers to the VEC in
1311 *DATA and set IDENTIFIER_MARKED. */
1320 find_abi_tags_r (tree
*tp
, int */
*walk_subtrees*/
, void *data
)
1322 if (!OVERLOAD_TYPE_P (*tp
))
1325 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1327 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1328 for (tree list
= TREE_VALUE (attributes
); list
;
1329 list
= TREE_CHAIN (list
))
1331 tree tag
= TREE_VALUE (list
);
1332 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1333 if (!IDENTIFIER_MARKED (id
))
1335 if (TYPE_P (p
->subob
))
1337 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1338 "that base %qT has", p
->t
, tag
, p
->subob
);
1339 inform (location_of (p
->subob
), "%qT declared here",
1344 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1345 "that %qT (used in the type of %qD) has",
1346 p
->t
, tag
, *tp
, p
->subob
);
1347 inform (location_of (p
->subob
), "%qD declared here",
1349 inform (location_of (*tp
), "%qT declared here", *tp
);
1357 /* Check that class T has all the abi tags that subobject SUBOB has, or
1361 check_abi_tags (tree t
, tree subob
)
1363 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1366 for (tree list
= TREE_VALUE (attributes
); list
;
1367 list
= TREE_CHAIN (list
))
1369 tree tag
= TREE_VALUE (list
);
1370 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1371 IDENTIFIER_MARKED (id
) = true;
1375 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1376 struct abi_tag_data data
= { t
, subob
};
1378 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1382 for (tree list
= TREE_VALUE (attributes
); list
;
1383 list
= TREE_CHAIN (list
))
1385 tree tag
= TREE_VALUE (list
);
1386 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1387 IDENTIFIER_MARKED (id
) = false;
1392 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1393 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1394 properties of the bases. */
1397 check_bases (tree t
,
1398 int* cant_have_const_ctor_p
,
1399 int* no_const_asn_ref_p
)
1402 bool seen_non_virtual_nearly_empty_base_p
= 0;
1403 int seen_tm_mask
= 0;
1406 tree field
= NULL_TREE
;
1408 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1409 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1410 if (TREE_CODE (field
) == FIELD_DECL
)
1413 for (binfo
= TYPE_BINFO (t
), i
= 0;
1414 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1416 tree basetype
= TREE_TYPE (base_binfo
);
1418 gcc_assert (COMPLETE_TYPE_P (basetype
));
1420 if (CLASSTYPE_FINAL (basetype
))
1421 error ("cannot derive from %<final%> base %qT in derived type %qT",
1424 /* If any base class is non-literal, so is the derived class. */
1425 if (!CLASSTYPE_LITERAL_P (basetype
))
1426 CLASSTYPE_LITERAL_P (t
) = false;
1428 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1429 here because the case of virtual functions but non-virtual
1430 dtor is handled in finish_struct_1. */
1431 if (!TYPE_POLYMORPHIC_P (basetype
))
1432 warning (OPT_Weffc__
,
1433 "base class %q#T has a non-virtual destructor", basetype
);
1435 /* If the base class doesn't have copy constructors or
1436 assignment operators that take const references, then the
1437 derived class cannot have such a member automatically
1439 if (TYPE_HAS_COPY_CTOR (basetype
)
1440 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1441 *cant_have_const_ctor_p
= 1;
1442 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1443 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1444 *no_const_asn_ref_p
= 1;
1446 if (BINFO_VIRTUAL_P (base_binfo
))
1447 /* A virtual base does not effect nearly emptiness. */
1449 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1451 if (seen_non_virtual_nearly_empty_base_p
)
1452 /* And if there is more than one nearly empty base, then the
1453 derived class is not nearly empty either. */
1454 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1456 /* Remember we've seen one. */
1457 seen_non_virtual_nearly_empty_base_p
= 1;
1459 else if (!is_empty_class (basetype
))
1460 /* If the base class is not empty or nearly empty, then this
1461 class cannot be nearly empty. */
1462 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1464 /* A lot of properties from the bases also apply to the derived
1466 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1467 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1468 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1469 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1470 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1471 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1472 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1473 || !TYPE_HAS_COPY_CTOR (basetype
));
1474 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1475 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1476 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1477 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1478 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1479 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1480 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1481 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1483 /* A standard-layout class is a class that:
1485 * has no non-standard-layout base classes, */
1486 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1487 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1490 /* ...has no base classes of the same type as the first non-static
1492 if (field
&& DECL_CONTEXT (field
) == t
1493 && (same_type_ignoring_top_level_qualifiers_p
1494 (TREE_TYPE (field
), basetype
)))
1495 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1497 /* ...either has no non-static data members in the most-derived
1498 class and at most one base class with non-static data
1499 members, or has no base classes with non-static data
1501 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1502 basefield
= DECL_CHAIN (basefield
))
1503 if (TREE_CODE (basefield
) == FIELD_DECL
)
1506 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1513 /* Don't bother collecting tm attributes if transactional memory
1514 support is not enabled. */
1517 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1519 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1522 check_abi_tags (t
, basetype
);
1525 /* If one of the base classes had TM attributes, and the current class
1526 doesn't define its own, then the current class inherits one. */
1527 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1529 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1530 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1534 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1535 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1536 that have had a nearly-empty virtual primary base stolen by some
1537 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1541 determine_primary_bases (tree t
)
1544 tree primary
= NULL_TREE
;
1545 tree type_binfo
= TYPE_BINFO (t
);
1548 /* Determine the primary bases of our bases. */
1549 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1550 base_binfo
= TREE_CHAIN (base_binfo
))
1552 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1554 /* See if we're the non-virtual primary of our inheritance
1556 if (!BINFO_VIRTUAL_P (base_binfo
))
1558 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1559 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1562 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1563 BINFO_TYPE (parent_primary
)))
1564 /* We are the primary binfo. */
1565 BINFO_PRIMARY_P (base_binfo
) = 1;
1567 /* Determine if we have a virtual primary base, and mark it so.
1569 if (primary
&& BINFO_VIRTUAL_P (primary
))
1571 tree this_primary
= copied_binfo (primary
, base_binfo
);
1573 if (BINFO_PRIMARY_P (this_primary
))
1574 /* Someone already claimed this base. */
1575 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1580 BINFO_PRIMARY_P (this_primary
) = 1;
1581 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1583 /* A virtual binfo might have been copied from within
1584 another hierarchy. As we're about to use it as a
1585 primary base, make sure the offsets match. */
1586 delta
= size_diffop_loc (input_location
,
1588 BINFO_OFFSET (base_binfo
)),
1590 BINFO_OFFSET (this_primary
)));
1592 propagate_binfo_offsets (this_primary
, delta
);
1597 /* First look for a dynamic direct non-virtual base. */
1598 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1600 tree basetype
= BINFO_TYPE (base_binfo
);
1602 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1604 primary
= base_binfo
;
1609 /* A "nearly-empty" virtual base class can be the primary base
1610 class, if no non-virtual polymorphic base can be found. Look for
1611 a nearly-empty virtual dynamic base that is not already a primary
1612 base of something in the hierarchy. If there is no such base,
1613 just pick the first nearly-empty virtual base. */
1615 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1616 base_binfo
= TREE_CHAIN (base_binfo
))
1617 if (BINFO_VIRTUAL_P (base_binfo
)
1618 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1620 if (!BINFO_PRIMARY_P (base_binfo
))
1622 /* Found one that is not primary. */
1623 primary
= base_binfo
;
1627 /* Remember the first candidate. */
1628 primary
= base_binfo
;
1632 /* If we've got a primary base, use it. */
1635 tree basetype
= BINFO_TYPE (primary
);
1637 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1638 if (BINFO_PRIMARY_P (primary
))
1639 /* We are stealing a primary base. */
1640 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1641 BINFO_PRIMARY_P (primary
) = 1;
1642 if (BINFO_VIRTUAL_P (primary
))
1646 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1647 /* A virtual binfo might have been copied from within
1648 another hierarchy. As we're about to use it as a primary
1649 base, make sure the offsets match. */
1650 delta
= size_diffop_loc (input_location
, ssize_int (0),
1651 convert (ssizetype
, BINFO_OFFSET (primary
)));
1653 propagate_binfo_offsets (primary
, delta
);
1656 primary
= TYPE_BINFO (basetype
);
1658 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1659 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1660 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1664 /* Update the variant types of T. */
1667 fixup_type_variants (tree t
)
1674 for (variants
= TYPE_NEXT_VARIANT (t
);
1676 variants
= TYPE_NEXT_VARIANT (variants
))
1678 /* These fields are in the _TYPE part of the node, not in
1679 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1680 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1681 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1682 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1683 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1685 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1687 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1689 /* Copy whatever these are holding today. */
1690 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1691 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1692 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1696 /* Early variant fixups: we apply attributes at the beginning of the class
1697 definition, and we need to fix up any variants that have already been
1698 made via elaborated-type-specifier so that check_qualified_type works. */
1701 fixup_attribute_variants (tree t
)
1708 for (variants
= TYPE_NEXT_VARIANT (t
);
1710 variants
= TYPE_NEXT_VARIANT (variants
))
1712 /* These are the two fields that check_qualified_type looks at and
1713 are affected by attributes. */
1714 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1715 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1719 /* Set memoizing fields and bits of T (and its variants) for later
1723 finish_struct_bits (tree t
)
1725 /* Fix up variants (if any). */
1726 fixup_type_variants (t
);
1728 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1729 /* For a class w/o baseclasses, 'finish_struct' has set
1730 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1731 Similarly for a class whose base classes do not have vtables.
1732 When neither of these is true, we might have removed abstract
1733 virtuals (by providing a definition), added some (by declaring
1734 new ones), or redeclared ones from a base class. We need to
1735 recalculate what's really an abstract virtual at this point (by
1736 looking in the vtables). */
1737 get_pure_virtuals (t
);
1739 /* If this type has a copy constructor or a destructor, force its
1740 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1741 nonzero. This will cause it to be passed by invisible reference
1742 and prevent it from being returned in a register. */
1743 if (type_has_nontrivial_copy_init (t
)
1744 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1747 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1748 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1750 SET_TYPE_MODE (variants
, BLKmode
);
1751 TREE_ADDRESSABLE (variants
) = 1;
1756 /* Issue warnings about T having private constructors, but no friends,
1759 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1760 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1761 non-private static member functions. */
1764 maybe_warn_about_overly_private_class (tree t
)
1766 int has_member_fn
= 0;
1767 int has_nonprivate_method
= 0;
1770 if (!warn_ctor_dtor_privacy
1771 /* If the class has friends, those entities might create and
1772 access instances, so we should not warn. */
1773 || (CLASSTYPE_FRIEND_CLASSES (t
)
1774 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1775 /* We will have warned when the template was declared; there's
1776 no need to warn on every instantiation. */
1777 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1778 /* There's no reason to even consider warning about this
1782 /* We only issue one warning, if more than one applies, because
1783 otherwise, on code like:
1786 // Oops - forgot `public:'
1792 we warn several times about essentially the same problem. */
1794 /* Check to see if all (non-constructor, non-destructor) member
1795 functions are private. (Since there are no friends or
1796 non-private statics, we can't ever call any of the private member
1798 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1799 /* We're not interested in compiler-generated methods; they don't
1800 provide any way to call private members. */
1801 if (!DECL_ARTIFICIAL (fn
))
1803 if (!TREE_PRIVATE (fn
))
1805 if (DECL_STATIC_FUNCTION_P (fn
))
1806 /* A non-private static member function is just like a
1807 friend; it can create and invoke private member
1808 functions, and be accessed without a class
1812 has_nonprivate_method
= 1;
1813 /* Keep searching for a static member function. */
1815 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1819 if (!has_nonprivate_method
&& has_member_fn
)
1821 /* There are no non-private methods, and there's at least one
1822 private member function that isn't a constructor or
1823 destructor. (If all the private members are
1824 constructors/destructors we want to use the code below that
1825 issues error messages specifically referring to
1826 constructors/destructors.) */
1828 tree binfo
= TYPE_BINFO (t
);
1830 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1831 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1833 has_nonprivate_method
= 1;
1836 if (!has_nonprivate_method
)
1838 warning (OPT_Wctor_dtor_privacy
,
1839 "all member functions in class %qT are private", t
);
1844 /* Even if some of the member functions are non-private, the class
1845 won't be useful for much if all the constructors or destructors
1846 are private: such an object can never be created or destroyed. */
1847 fn
= CLASSTYPE_DESTRUCTORS (t
);
1848 if (fn
&& TREE_PRIVATE (fn
))
1850 warning (OPT_Wctor_dtor_privacy
,
1851 "%q#T only defines a private destructor and has no friends",
1856 /* Warn about classes that have private constructors and no friends. */
1857 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1858 /* Implicitly generated constructors are always public. */
1859 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1860 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1862 int nonprivate_ctor
= 0;
1864 /* If a non-template class does not define a copy
1865 constructor, one is defined for it, enabling it to avoid
1866 this warning. For a template class, this does not
1867 happen, and so we would normally get a warning on:
1869 template <class T> class C { private: C(); };
1871 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1872 complete non-template or fully instantiated classes have this
1874 if (!TYPE_HAS_COPY_CTOR (t
))
1875 nonprivate_ctor
= 1;
1877 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1879 tree ctor
= OVL_CURRENT (fn
);
1880 /* Ideally, we wouldn't count copy constructors (or, in
1881 fact, any constructor that takes an argument of the
1882 class type as a parameter) because such things cannot
1883 be used to construct an instance of the class unless
1884 you already have one. But, for now at least, we're
1886 if (! TREE_PRIVATE (ctor
))
1888 nonprivate_ctor
= 1;
1893 if (nonprivate_ctor
== 0)
1895 warning (OPT_Wctor_dtor_privacy
,
1896 "%q#T only defines private constructors and has no friends",
1904 gt_pointer_operator new_value
;
1908 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1911 method_name_cmp (const void* m1_p
, const void* m2_p
)
1913 const tree
*const m1
= (const tree
*) m1_p
;
1914 const tree
*const m2
= (const tree
*) m2_p
;
1916 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1918 if (*m1
== NULL_TREE
)
1920 if (*m2
== NULL_TREE
)
1922 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
1927 /* This routine compares two fields like method_name_cmp but using the
1928 pointer operator in resort_field_decl_data. */
1931 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
1933 const tree
*const m1
= (const tree
*) m1_p
;
1934 const tree
*const m2
= (const tree
*) m2_p
;
1935 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1937 if (*m1
== NULL_TREE
)
1939 if (*m2
== NULL_TREE
)
1942 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
1943 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
1944 resort_data
.new_value (&d1
, resort_data
.cookie
);
1945 resort_data
.new_value (&d2
, resort_data
.cookie
);
1952 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1955 resort_type_method_vec (void* obj
,
1957 gt_pointer_operator new_value
,
1960 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
1961 int len
= vec_safe_length (method_vec
);
1965 /* The type conversion ops have to live at the front of the vec, so we
1967 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1968 vec_safe_iterate (method_vec
, slot
, &fn
);
1970 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
1975 resort_data
.new_value
= new_value
;
1976 resort_data
.cookie
= cookie
;
1977 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
1978 resort_method_name_cmp
);
1982 /* Warn about duplicate methods in fn_fields.
1984 Sort methods that are not special (i.e., constructors, destructors,
1985 and type conversion operators) so that we can find them faster in
1989 finish_struct_methods (tree t
)
1992 vec
<tree
, va_gc
> *method_vec
;
1995 method_vec
= CLASSTYPE_METHOD_VEC (t
);
1999 len
= method_vec
->length ();
2001 /* Clear DECL_IN_AGGR_P for all functions. */
2002 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2003 fn_fields
= DECL_CHAIN (fn_fields
))
2004 DECL_IN_AGGR_P (fn_fields
) = 0;
2006 /* Issue warnings about private constructors and such. If there are
2007 no methods, then some public defaults are generated. */
2008 maybe_warn_about_overly_private_class (t
);
2010 /* The type conversion ops have to live at the front of the vec, so we
2012 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2013 method_vec
->iterate (slot
, &fn_fields
);
2015 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2018 qsort (method_vec
->address () + slot
,
2019 len
-slot
, sizeof (tree
), method_name_cmp
);
2022 /* Make BINFO's vtable have N entries, including RTTI entries,
2023 vbase and vcall offsets, etc. Set its type and call the back end
2027 layout_vtable_decl (tree binfo
, int n
)
2032 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2033 layout_type (atype
);
2035 /* We may have to grow the vtable. */
2036 vtable
= get_vtbl_decl_for_binfo (binfo
);
2037 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2039 TREE_TYPE (vtable
) = atype
;
2040 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2041 layout_decl (vtable
, 0);
2045 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2046 have the same signature. */
2049 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2051 /* One destructor overrides another if they are the same kind of
2053 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2054 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2056 /* But a non-destructor never overrides a destructor, nor vice
2057 versa, nor do different kinds of destructors override
2058 one-another. For example, a complete object destructor does not
2059 override a deleting destructor. */
2060 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2063 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2064 || (DECL_CONV_FN_P (fndecl
)
2065 && DECL_CONV_FN_P (base_fndecl
)
2066 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2067 DECL_CONV_FN_TYPE (base_fndecl
))))
2069 tree fntype
= TREE_TYPE (fndecl
);
2070 tree base_fntype
= TREE_TYPE (base_fndecl
);
2071 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2072 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2073 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2074 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2080 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2084 base_derived_from (tree derived
, tree base
)
2088 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2090 if (probe
== derived
)
2092 else if (BINFO_VIRTUAL_P (probe
))
2093 /* If we meet a virtual base, we can't follow the inheritance
2094 any more. See if the complete type of DERIVED contains
2095 such a virtual base. */
2096 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2102 typedef struct find_final_overrider_data_s
{
2103 /* The function for which we are trying to find a final overrider. */
2105 /* The base class in which the function was declared. */
2106 tree declaring_base
;
2107 /* The candidate overriders. */
2109 /* Path to most derived. */
2111 } find_final_overrider_data
;
2113 /* Add the overrider along the current path to FFOD->CANDIDATES.
2114 Returns true if an overrider was found; false otherwise. */
2117 dfs_find_final_overrider_1 (tree binfo
,
2118 find_final_overrider_data
*ffod
,
2123 /* If BINFO is not the most derived type, try a more derived class.
2124 A definition there will overrider a definition here. */
2128 if (dfs_find_final_overrider_1
2129 (ffod
->path
[depth
], ffod
, depth
))
2133 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2136 tree
*candidate
= &ffod
->candidates
;
2138 /* Remove any candidates overridden by this new function. */
2141 /* If *CANDIDATE overrides METHOD, then METHOD
2142 cannot override anything else on the list. */
2143 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2145 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2146 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2147 *candidate
= TREE_CHAIN (*candidate
);
2149 candidate
= &TREE_CHAIN (*candidate
);
2152 /* Add the new function. */
2153 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2160 /* Called from find_final_overrider via dfs_walk. */
2163 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2165 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2167 if (binfo
== ffod
->declaring_base
)
2168 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2169 ffod
->path
.safe_push (binfo
);
2175 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2177 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2183 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2184 FN and whose TREE_VALUE is the binfo for the base where the
2185 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2186 DERIVED) is the base object in which FN is declared. */
2189 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2191 find_final_overrider_data ffod
;
2193 /* Getting this right is a little tricky. This is valid:
2195 struct S { virtual void f (); };
2196 struct T { virtual void f (); };
2197 struct U : public S, public T { };
2199 even though calling `f' in `U' is ambiguous. But,
2201 struct R { virtual void f(); };
2202 struct S : virtual public R { virtual void f (); };
2203 struct T : virtual public R { virtual void f (); };
2204 struct U : public S, public T { };
2206 is not -- there's no way to decide whether to put `S::f' or
2207 `T::f' in the vtable for `R'.
2209 The solution is to look at all paths to BINFO. If we find
2210 different overriders along any two, then there is a problem. */
2211 if (DECL_THUNK_P (fn
))
2212 fn
= THUNK_TARGET (fn
);
2214 /* Determine the depth of the hierarchy. */
2216 ffod
.declaring_base
= binfo
;
2217 ffod
.candidates
= NULL_TREE
;
2218 ffod
.path
.create (30);
2220 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2221 dfs_find_final_overrider_post
, &ffod
);
2223 ffod
.path
.release ();
2225 /* If there was no winner, issue an error message. */
2226 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2227 return error_mark_node
;
2229 return ffod
.candidates
;
2232 /* Return the index of the vcall offset for FN when TYPE is used as a
2236 get_vcall_index (tree fn
, tree type
)
2238 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2242 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2243 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2244 || same_signature_p (fn
, p
->purpose
))
2247 /* There should always be an appropriate index. */
2251 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2252 dominated by T. FN is the old function; VIRTUALS points to the
2253 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2254 of that entry in the list. */
2257 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2265 tree overrider_fn
, overrider_target
;
2266 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2267 tree over_return
, base_return
;
2270 /* Find the nearest primary base (possibly binfo itself) which defines
2271 this function; this is the class the caller will convert to when
2272 calling FN through BINFO. */
2273 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2276 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2279 /* The nearest definition is from a lost primary. */
2280 if (BINFO_LOST_PRIMARY_P (b
))
2285 /* Find the final overrider. */
2286 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2287 if (overrider
== error_mark_node
)
2289 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2292 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2294 /* Check for adjusting covariant return types. */
2295 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2296 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2298 if (POINTER_TYPE_P (over_return
)
2299 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2300 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2301 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2302 /* If the overrider is invalid, don't even try. */
2303 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2305 /* If FN is a covariant thunk, we must figure out the adjustment
2306 to the final base FN was converting to. As OVERRIDER_TARGET might
2307 also be converting to the return type of FN, we have to
2308 combine the two conversions here. */
2309 tree fixed_offset
, virtual_offset
;
2311 over_return
= TREE_TYPE (over_return
);
2312 base_return
= TREE_TYPE (base_return
);
2314 if (DECL_THUNK_P (fn
))
2316 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2317 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2318 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2321 fixed_offset
= virtual_offset
= NULL_TREE
;
2324 /* Find the equivalent binfo within the return type of the
2325 overriding function. We will want the vbase offset from
2327 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2329 else if (!same_type_ignoring_top_level_qualifiers_p
2330 (over_return
, base_return
))
2332 /* There was no existing virtual thunk (which takes
2333 precedence). So find the binfo of the base function's
2334 return type within the overriding function's return type.
2335 We cannot call lookup base here, because we're inside a
2336 dfs_walk, and will therefore clobber the BINFO_MARKED
2337 flags. Fortunately we know the covariancy is valid (it
2338 has already been checked), so we can just iterate along
2339 the binfos, which have been chained in inheritance graph
2340 order. Of course it is lame that we have to repeat the
2341 search here anyway -- we should really be caching pieces
2342 of the vtable and avoiding this repeated work. */
2343 tree thunk_binfo
, base_binfo
;
2345 /* Find the base binfo within the overriding function's
2346 return type. We will always find a thunk_binfo, except
2347 when the covariancy is invalid (which we will have
2348 already diagnosed). */
2349 for (base_binfo
= TYPE_BINFO (base_return
),
2350 thunk_binfo
= TYPE_BINFO (over_return
);
2352 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2353 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2354 BINFO_TYPE (base_binfo
)))
2357 /* See if virtual inheritance is involved. */
2358 for (virtual_offset
= thunk_binfo
;
2360 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2361 if (BINFO_VIRTUAL_P (virtual_offset
))
2365 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2367 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2371 /* We convert via virtual base. Adjust the fixed
2372 offset to be from there. */
2374 size_diffop (offset
,
2376 BINFO_OFFSET (virtual_offset
)));
2379 /* There was an existing fixed offset, this must be
2380 from the base just converted to, and the base the
2381 FN was thunking to. */
2382 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2384 fixed_offset
= offset
;
2388 if (fixed_offset
|| virtual_offset
)
2389 /* Replace the overriding function with a covariant thunk. We
2390 will emit the overriding function in its own slot as
2392 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2393 fixed_offset
, virtual_offset
);
2396 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2397 !DECL_THUNK_P (fn
));
2399 /* If we need a covariant thunk, then we may need to adjust first_defn.
2400 The ABI specifies that the thunks emitted with a function are
2401 determined by which bases the function overrides, so we need to be
2402 sure that we're using a thunk for some overridden base; even if we
2403 know that the necessary this adjustment is zero, there may not be an
2404 appropriate zero-this-adjusment thunk for us to use since thunks for
2405 overriding virtual bases always use the vcall offset.
2407 Furthermore, just choosing any base that overrides this function isn't
2408 quite right, as this slot won't be used for calls through a type that
2409 puts a covariant thunk here. Calling the function through such a type
2410 will use a different slot, and that slot is the one that determines
2411 the thunk emitted for that base.
2413 So, keep looking until we find the base that we're really overriding
2414 in this slot: the nearest primary base that doesn't use a covariant
2415 thunk in this slot. */
2416 if (overrider_target
!= overrider_fn
)
2418 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2419 /* We already know that the overrider needs a covariant thunk. */
2420 b
= get_primary_binfo (b
);
2421 for (; ; b
= get_primary_binfo (b
))
2423 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2424 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2425 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2427 if (BINFO_LOST_PRIMARY_P (b
))
2433 /* Assume that we will produce a thunk that convert all the way to
2434 the final overrider, and not to an intermediate virtual base. */
2435 virtual_base
= NULL_TREE
;
2437 /* See if we can convert to an intermediate virtual base first, and then
2438 use the vcall offset located there to finish the conversion. */
2439 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2441 /* If we find the final overrider, then we can stop
2443 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2444 BINFO_TYPE (TREE_VALUE (overrider
))))
2447 /* If we find a virtual base, and we haven't yet found the
2448 overrider, then there is a virtual base between the
2449 declaring base (first_defn) and the final overrider. */
2450 if (BINFO_VIRTUAL_P (b
))
2457 /* Compute the constant adjustment to the `this' pointer. The
2458 `this' pointer, when this function is called, will point at BINFO
2459 (or one of its primary bases, which are at the same offset). */
2461 /* The `this' pointer needs to be adjusted from the declaration to
2462 the nearest virtual base. */
2463 delta
= size_diffop_loc (input_location
,
2464 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2465 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2467 /* If the nearest definition is in a lost primary, we don't need an
2468 entry in our vtable. Except possibly in a constructor vtable,
2469 if we happen to get our primary back. In that case, the offset
2470 will be zero, as it will be a primary base. */
2471 delta
= size_zero_node
;
2473 /* The `this' pointer needs to be adjusted from pointing to
2474 BINFO to pointing at the base where the final overrider
2476 delta
= size_diffop_loc (input_location
,
2478 BINFO_OFFSET (TREE_VALUE (overrider
))),
2479 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2481 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2484 BV_VCALL_INDEX (*virtuals
)
2485 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2487 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2489 BV_LOST_PRIMARY (*virtuals
) = lost
;
2492 /* Called from modify_all_vtables via dfs_walk. */
2495 dfs_modify_vtables (tree binfo
, void* data
)
2497 tree t
= (tree
) data
;
2502 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2503 /* A base without a vtable needs no modification, and its bases
2504 are uninteresting. */
2505 return dfs_skip_bases
;
2507 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2508 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2509 /* Don't do the primary vtable, if it's new. */
2512 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2513 /* There's no need to modify the vtable for a non-virtual primary
2514 base; we're not going to use that vtable anyhow. We do still
2515 need to do this for virtual primary bases, as they could become
2516 non-primary in a construction vtable. */
2519 make_new_vtable (t
, binfo
);
2521 /* Now, go through each of the virtual functions in the virtual
2522 function table for BINFO. Find the final overrider, and update
2523 the BINFO_VIRTUALS list appropriately. */
2524 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2525 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2527 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2528 old_virtuals
= TREE_CHAIN (old_virtuals
))
2529 update_vtable_entry_for_fn (t
,
2531 BV_FN (old_virtuals
),
2537 /* Update all of the primary and secondary vtables for T. Create new
2538 vtables as required, and initialize their RTTI information. Each
2539 of the functions in VIRTUALS is declared in T and may override a
2540 virtual function from a base class; find and modify the appropriate
2541 entries to point to the overriding functions. Returns a list, in
2542 declaration order, of the virtual functions that are declared in T,
2543 but do not appear in the primary base class vtable, and which
2544 should therefore be appended to the end of the vtable for T. */
2547 modify_all_vtables (tree t
, tree virtuals
)
2549 tree binfo
= TYPE_BINFO (t
);
2552 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2553 if (TYPE_CONTAINS_VPTR_P (t
))
2554 get_vtable_decl (t
, false);
2556 /* Update all of the vtables. */
2557 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2559 /* Add virtual functions not already in our primary vtable. These
2560 will be both those introduced by this class, and those overridden
2561 from secondary bases. It does not include virtuals merely
2562 inherited from secondary bases. */
2563 for (fnsp
= &virtuals
; *fnsp
; )
2565 tree fn
= TREE_VALUE (*fnsp
);
2567 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2568 || DECL_VINDEX (fn
) == error_mark_node
)
2570 /* We don't need to adjust the `this' pointer when
2571 calling this function. */
2572 BV_DELTA (*fnsp
) = integer_zero_node
;
2573 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2575 /* This is a function not already in our vtable. Keep it. */
2576 fnsp
= &TREE_CHAIN (*fnsp
);
2579 /* We've already got an entry for this function. Skip it. */
2580 *fnsp
= TREE_CHAIN (*fnsp
);
2586 /* Get the base virtual function declarations in T that have the
2590 get_basefndecls (tree name
, tree t
)
2593 tree base_fndecls
= NULL_TREE
;
2594 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2597 /* Find virtual functions in T with the indicated NAME. */
2598 i
= lookup_fnfields_1 (t
, name
);
2600 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2602 methods
= OVL_NEXT (methods
))
2604 tree method
= OVL_CURRENT (methods
);
2606 if (TREE_CODE (method
) == FUNCTION_DECL
2607 && DECL_VINDEX (method
))
2608 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2612 return base_fndecls
;
2614 for (i
= 0; i
< n_baseclasses
; i
++)
2616 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2617 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2621 return base_fndecls
;
2624 /* If this declaration supersedes the declaration of
2625 a method declared virtual in the base class, then
2626 mark this field as being virtual as well. */
2629 check_for_override (tree decl
, tree ctype
)
2631 bool overrides_found
= false;
2632 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2633 /* In [temp.mem] we have:
2635 A specialization of a member function template does not
2636 override a virtual function from a base class. */
2638 if ((DECL_DESTRUCTOR_P (decl
)
2639 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2640 || DECL_CONV_FN_P (decl
))
2641 && look_for_overrides (ctype
, decl
)
2642 && !DECL_STATIC_FUNCTION_P (decl
))
2643 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2644 the error_mark_node so that we know it is an overriding
2647 DECL_VINDEX (decl
) = decl
;
2648 overrides_found
= true;
2651 if (DECL_VIRTUAL_P (decl
))
2653 if (!DECL_VINDEX (decl
))
2654 DECL_VINDEX (decl
) = error_mark_node
;
2655 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2656 if (DECL_DESTRUCTOR_P (decl
))
2657 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2659 else if (DECL_FINAL_P (decl
))
2660 error ("%q+#D marked final, but is not virtual", decl
);
2661 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2662 error ("%q+#D marked override, but does not override", decl
);
2665 /* Warn about hidden virtual functions that are not overridden in t.
2666 We know that constructors and destructors don't apply. */
2669 warn_hidden (tree t
)
2671 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2675 /* We go through each separately named virtual function. */
2676 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2677 vec_safe_iterate (method_vec
, i
, &fns
);
2688 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2689 have the same name. Figure out what name that is. */
2690 name
= DECL_NAME (OVL_CURRENT (fns
));
2691 /* There are no possibly hidden functions yet. */
2692 base_fndecls
= NULL_TREE
;
2693 /* Iterate through all of the base classes looking for possibly
2694 hidden functions. */
2695 for (binfo
= TYPE_BINFO (t
), j
= 0;
2696 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2698 tree basetype
= BINFO_TYPE (base_binfo
);
2699 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2703 /* If there are no functions to hide, continue. */
2707 /* Remove any overridden functions. */
2708 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2710 fndecl
= OVL_CURRENT (fn
);
2711 if (DECL_VINDEX (fndecl
))
2713 tree
*prev
= &base_fndecls
;
2716 /* If the method from the base class has the same
2717 signature as the method from the derived class, it
2718 has been overridden. */
2719 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2720 *prev
= TREE_CHAIN (*prev
);
2722 prev
= &TREE_CHAIN (*prev
);
2726 /* Now give a warning for all base functions without overriders,
2727 as they are hidden. */
2728 while (base_fndecls
)
2730 /* Here we know it is a hider, and no overrider exists. */
2731 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2732 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2733 base_fndecls
= TREE_CHAIN (base_fndecls
);
2738 /* Check for things that are invalid. There are probably plenty of other
2739 things we should check for also. */
2742 finish_struct_anon (tree t
)
2746 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2748 if (TREE_STATIC (field
))
2750 if (TREE_CODE (field
) != FIELD_DECL
)
2753 if (DECL_NAME (field
) == NULL_TREE
2754 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2756 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2757 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2758 for (; elt
; elt
= DECL_CHAIN (elt
))
2760 /* We're generally only interested in entities the user
2761 declared, but we also find nested classes by noticing
2762 the TYPE_DECL that we create implicitly. You're
2763 allowed to put one anonymous union inside another,
2764 though, so we explicitly tolerate that. We use
2765 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2766 we also allow unnamed types used for defining fields. */
2767 if (DECL_ARTIFICIAL (elt
)
2768 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2769 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2772 if (TREE_CODE (elt
) != FIELD_DECL
)
2775 permerror (input_location
, "%q+#D invalid; an anonymous union can "
2776 "only have non-static data members", elt
);
2778 permerror (input_location
, "%q+#D invalid; an anonymous struct can "
2779 "only have non-static data members", elt
);
2783 if (TREE_PRIVATE (elt
))
2786 permerror (input_location
, "private member %q+#D in anonymous union", elt
);
2788 permerror (input_location
, "private member %q+#D in anonymous struct", elt
);
2790 else if (TREE_PROTECTED (elt
))
2793 permerror (input_location
, "protected member %q+#D in anonymous union", elt
);
2795 permerror (input_location
, "protected member %q+#D in anonymous struct", elt
);
2798 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2799 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2805 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2806 will be used later during class template instantiation.
2807 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2808 a non-static member data (FIELD_DECL), a member function
2809 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2810 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2811 When FRIEND_P is nonzero, T is either a friend class
2812 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2813 (FUNCTION_DECL, TEMPLATE_DECL). */
2816 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2818 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2819 if (CLASSTYPE_TEMPLATE_INFO (type
))
2820 CLASSTYPE_DECL_LIST (type
)
2821 = tree_cons (friend_p
? NULL_TREE
: type
,
2822 t
, CLASSTYPE_DECL_LIST (type
));
2825 /* This function is called from declare_virt_assop_and_dtor via
2828 DATA is a type that direcly or indirectly inherits the base
2829 represented by BINFO. If BINFO contains a virtual assignment [copy
2830 assignment or move assigment] operator or a virtual constructor,
2831 declare that function in DATA if it hasn't been already declared. */
2834 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2836 tree bv
, fn
, t
= (tree
)data
;
2837 tree opname
= ansi_assopname (NOP_EXPR
);
2839 gcc_assert (t
&& CLASS_TYPE_P (t
));
2840 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2842 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2843 /* A base without a vtable needs no modification, and its bases
2844 are uninteresting. */
2845 return dfs_skip_bases
;
2847 if (BINFO_PRIMARY_P (binfo
))
2848 /* If this is a primary base, then we have already looked at the
2849 virtual functions of its vtable. */
2852 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
2856 if (DECL_NAME (fn
) == opname
)
2858 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
2859 lazily_declare_fn (sfk_copy_assignment
, t
);
2860 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
2861 lazily_declare_fn (sfk_move_assignment
, t
);
2863 else if (DECL_DESTRUCTOR_P (fn
)
2864 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
2865 lazily_declare_fn (sfk_destructor
, t
);
2871 /* If the class type T has a direct or indirect base that contains a
2872 virtual assignment operator or a virtual destructor, declare that
2873 function in T if it hasn't been already declared. */
2876 declare_virt_assop_and_dtor (tree t
)
2878 if (!(TYPE_POLYMORPHIC_P (t
)
2879 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
2880 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
2881 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
2884 dfs_walk_all (TYPE_BINFO (t
),
2885 dfs_declare_virt_assop_and_dtor
,
2889 /* Declare the inheriting constructor for class T inherited from base
2890 constructor CTOR with the parameter array PARMS of size NPARMS. */
2893 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
2895 /* We don't declare an inheriting ctor that would be a default,
2896 copy or move ctor for derived or base. */
2900 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
2902 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
2903 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
2907 tree parmlist
= void_list_node
;
2908 for (int i
= nparms
- 1; i
>= 0; i
--)
2909 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
2910 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
2911 t
, false, ctor
, parmlist
);
2912 if (add_method (t
, fn
, NULL_TREE
))
2914 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
2915 TYPE_METHODS (t
) = fn
;
2919 /* Declare all the inheriting constructors for class T inherited from base
2920 constructor CTOR. */
2923 one_inherited_ctor (tree ctor
, tree t
)
2925 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
2927 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
2929 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
2931 if (TREE_PURPOSE (parms
))
2932 one_inheriting_sig (t
, ctor
, new_parms
, i
);
2933 new_parms
[i
++] = TREE_VALUE (parms
);
2935 one_inheriting_sig (t
, ctor
, new_parms
, i
);
2936 if (parms
== NULL_TREE
)
2938 warning (OPT_Winherited_variadic_ctor
,
2939 "the ellipsis in %qD is not inherited", ctor
);
2940 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
2944 /* Create default constructors, assignment operators, and so forth for
2945 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2946 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2947 the class cannot have a default constructor, copy constructor
2948 taking a const reference argument, or an assignment operator taking
2949 a const reference, respectively. */
2952 add_implicitly_declared_members (tree t
, tree
* access_decls
,
2953 int cant_have_const_cctor
,
2954 int cant_have_const_assignment
)
2956 bool move_ok
= false;
2958 if (cxx_dialect
>= cxx0x
&& !CLASSTYPE_DESTRUCTORS (t
)
2959 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
2960 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
2964 if (!CLASSTYPE_DESTRUCTORS (t
))
2966 /* In general, we create destructors lazily. */
2967 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
2969 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
2970 && TYPE_FOR_JAVA (t
))
2971 /* But if this is a Java class, any non-trivial destructor is
2972 invalid, even if compiler-generated. Therefore, if the
2973 destructor is non-trivial we create it now. */
2974 lazily_declare_fn (sfk_destructor
, t
);
2979 If there is no user-declared constructor for a class, a default
2980 constructor is implicitly declared. */
2981 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
2983 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
2984 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
2985 if (cxx_dialect
>= cxx0x
)
2986 TYPE_HAS_CONSTEXPR_CTOR (t
)
2987 /* This might force the declaration. */
2988 = type_has_constexpr_default_constructor (t
);
2993 If a class definition does not explicitly declare a copy
2994 constructor, one is declared implicitly. */
2995 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
2997 TYPE_HAS_COPY_CTOR (t
) = 1;
2998 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
2999 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3001 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3004 /* If there is no assignment operator, one will be created if and
3005 when it is needed. For now, just record whether or not the type
3006 of the parameter to the assignment operator will be a const or
3007 non-const reference. */
3008 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3010 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3011 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3012 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3014 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3017 /* We can't be lazy about declaring functions that might override
3018 a virtual function from a base class. */
3019 declare_virt_assop_and_dtor (t
);
3021 while (*access_decls
)
3023 tree using_decl
= TREE_VALUE (*access_decls
);
3024 tree decl
= USING_DECL_DECLS (using_decl
);
3025 if (DECL_NAME (using_decl
) == ctor_identifier
)
3027 /* declare, then remove the decl */
3028 tree ctor_list
= decl
;
3029 location_t loc
= input_location
;
3030 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3032 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3033 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3034 *access_decls
= TREE_CHAIN (*access_decls
);
3035 input_location
= loc
;
3038 access_decls
= &TREE_CHAIN (*access_decls
);
3042 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3043 count the number of fields in TYPE, including anonymous union
3047 count_fields (tree fields
)
3051 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3053 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3054 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3061 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3062 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3063 elts, starting at offset IDX. */
3066 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3069 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3071 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3072 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3074 field_vec
->elts
[idx
++] = x
;
3079 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3080 starting at offset IDX. */
3083 add_enum_fields_to_record_type (tree enumtype
,
3084 struct sorted_fields_type
*field_vec
,
3088 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3089 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3093 /* FIELD is a bit-field. We are finishing the processing for its
3094 enclosing type. Issue any appropriate messages and set appropriate
3095 flags. Returns false if an error has been diagnosed. */
3098 check_bitfield_decl (tree field
)
3100 tree type
= TREE_TYPE (field
);
3103 /* Extract the declared width of the bitfield, which has been
3104 temporarily stashed in DECL_INITIAL. */
3105 w
= DECL_INITIAL (field
);
3106 gcc_assert (w
!= NULL_TREE
);
3107 /* Remove the bit-field width indicator so that the rest of the
3108 compiler does not treat that value as an initializer. */
3109 DECL_INITIAL (field
) = NULL_TREE
;
3111 /* Detect invalid bit-field type. */
3112 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3114 error ("bit-field %q+#D with non-integral type", field
);
3115 w
= error_mark_node
;
3119 location_t loc
= input_location
;
3120 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3123 /* detect invalid field size. */
3124 input_location
= DECL_SOURCE_LOCATION (field
);
3125 w
= cxx_constant_value (w
);
3126 input_location
= loc
;
3128 if (TREE_CODE (w
) != INTEGER_CST
)
3130 error ("bit-field %q+D width not an integer constant", field
);
3131 w
= error_mark_node
;
3133 else if (tree_int_cst_sgn (w
) < 0)
3135 error ("negative width in bit-field %q+D", field
);
3136 w
= error_mark_node
;
3138 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3140 error ("zero width for bit-field %q+D", field
);
3141 w
= error_mark_node
;
3143 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3144 && TREE_CODE (type
) != BOOLEAN_TYPE
3145 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3146 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3147 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3148 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3149 warning (0, "width of %q+D exceeds its type", field
);
3150 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3151 && (0 > (compare_tree_int
3152 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3153 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3156 if (w
!= error_mark_node
)
3158 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3159 DECL_BIT_FIELD (field
) = 1;
3164 /* Non-bit-fields are aligned for their type. */
3165 DECL_BIT_FIELD (field
) = 0;
3166 CLEAR_DECL_C_BIT_FIELD (field
);
3171 /* FIELD is a non bit-field. We are finishing the processing for its
3172 enclosing type T. Issue any appropriate messages and set appropriate
3176 check_field_decl (tree field
,
3178 int* cant_have_const_ctor
,
3179 int* no_const_asn_ref
,
3180 int* any_default_members
)
3182 tree type
= strip_array_types (TREE_TYPE (field
));
3184 /* In C++98 an anonymous union cannot contain any fields which would change
3185 the settings of CANT_HAVE_CONST_CTOR and friends. */
3186 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx0x
)
3188 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3189 structs. So, we recurse through their fields here. */
3190 else if (ANON_AGGR_TYPE_P (type
))
3194 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3195 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3196 check_field_decl (fields
, t
, cant_have_const_ctor
,
3197 no_const_asn_ref
, any_default_members
);
3199 /* Check members with class type for constructors, destructors,
3201 else if (CLASS_TYPE_P (type
))
3203 /* Never let anything with uninheritable virtuals
3204 make it through without complaint. */
3205 abstract_virtuals_error (field
, type
);
3207 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx0x
)
3210 int oldcount
= errorcount
;
3211 if (TYPE_NEEDS_CONSTRUCTING (type
))
3212 error ("member %q+#D with constructor not allowed in union",
3214 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3215 error ("member %q+#D with destructor not allowed in union", field
);
3216 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3217 error ("member %q+#D with copy assignment operator not allowed in union",
3219 if (!warned
&& errorcount
> oldcount
)
3221 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3222 "only available with -std=c++11 or -std=gnu++11");
3228 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3229 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3230 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3231 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3232 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3233 || !TYPE_HAS_COPY_ASSIGN (type
));
3234 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3235 || !TYPE_HAS_COPY_CTOR (type
));
3236 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3237 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3238 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3239 || TYPE_HAS_COMPLEX_DFLT (type
));
3242 if (TYPE_HAS_COPY_CTOR (type
)
3243 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3244 *cant_have_const_ctor
= 1;
3246 if (TYPE_HAS_COPY_ASSIGN (type
)
3247 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3248 *no_const_asn_ref
= 1;
3251 check_abi_tags (t
, field
);
3253 if (DECL_INITIAL (field
) != NULL_TREE
)
3255 /* `build_class_init_list' does not recognize
3257 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3258 error ("multiple fields in union %qT initialized", t
);
3259 *any_default_members
= 1;
3263 /* Check the data members (both static and non-static), class-scoped
3264 typedefs, etc., appearing in the declaration of T. Issue
3265 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3266 declaration order) of access declarations; each TREE_VALUE in this
3267 list is a USING_DECL.
3269 In addition, set the following flags:
3272 The class is empty, i.e., contains no non-static data members.
3274 CANT_HAVE_CONST_CTOR_P
3275 This class cannot have an implicitly generated copy constructor
3276 taking a const reference.
3278 CANT_HAVE_CONST_ASN_REF
3279 This class cannot have an implicitly generated assignment
3280 operator taking a const reference.
3282 All of these flags should be initialized before calling this
3285 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3286 fields can be added by adding to this chain. */
3289 check_field_decls (tree t
, tree
*access_decls
,
3290 int *cant_have_const_ctor_p
,
3291 int *no_const_asn_ref_p
)
3296 int any_default_members
;
3298 int field_access
= -1;
3300 /* Assume there are no access declarations. */
3301 *access_decls
= NULL_TREE
;
3302 /* Assume this class has no pointer members. */
3303 has_pointers
= false;
3304 /* Assume none of the members of this class have default
3306 any_default_members
= 0;
3308 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3311 tree type
= TREE_TYPE (x
);
3312 int this_field_access
;
3314 next
= &DECL_CHAIN (x
);
3316 if (TREE_CODE (x
) == USING_DECL
)
3318 /* Save the access declarations for our caller. */
3319 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3323 if (TREE_CODE (x
) == TYPE_DECL
3324 || TREE_CODE (x
) == TEMPLATE_DECL
)
3327 /* If we've gotten this far, it's a data member, possibly static,
3328 or an enumerator. */
3329 if (TREE_CODE (x
) != CONST_DECL
)
3330 DECL_CONTEXT (x
) = t
;
3332 /* When this goes into scope, it will be a non-local reference. */
3333 DECL_NONLOCAL (x
) = 1;
3335 if (TREE_CODE (t
) == UNION_TYPE
)
3339 If a union contains a static data member, or a member of
3340 reference type, the program is ill-formed. */
3343 error ("%q+D may not be static because it is a member of a union", x
);
3346 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3348 error ("%q+D may not have reference type %qT because"
3349 " it is a member of a union",
3355 /* Perform error checking that did not get done in
3357 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3359 error ("field %q+D invalidly declared function type", x
);
3360 type
= build_pointer_type (type
);
3361 TREE_TYPE (x
) = type
;
3363 else if (TREE_CODE (type
) == METHOD_TYPE
)
3365 error ("field %q+D invalidly declared method type", x
);
3366 type
= build_pointer_type (type
);
3367 TREE_TYPE (x
) = type
;
3370 if (type
== error_mark_node
)
3373 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3376 /* Now it can only be a FIELD_DECL. */
3378 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3379 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3381 /* If at least one non-static data member is non-literal, the whole
3382 class becomes non-literal. Note: if the type is incomplete we
3383 will complain later on. */
3384 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3385 CLASSTYPE_LITERAL_P (t
) = false;
3387 /* A standard-layout class is a class that:
3389 has the same access control (Clause 11) for all non-static data members,
3391 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3392 if (field_access
== -1)
3393 field_access
= this_field_access
;
3394 else if (this_field_access
!= field_access
)
3395 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3397 /* If this is of reference type, check if it needs an init. */
3398 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3400 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3401 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3402 if (DECL_INITIAL (x
) == NULL_TREE
)
3403 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3405 /* ARM $12.6.2: [A member initializer list] (or, for an
3406 aggregate, initialization by a brace-enclosed list) is the
3407 only way to initialize nonstatic const and reference
3409 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3410 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3413 type
= strip_array_types (type
);
3415 if (TYPE_PACKED (t
))
3417 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3421 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3425 else if (DECL_C_BIT_FIELD (x
)
3426 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3427 DECL_PACKED (x
) = 1;
3430 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3431 /* We don't treat zero-width bitfields as making a class
3436 /* The class is non-empty. */
3437 CLASSTYPE_EMPTY_P (t
) = 0;
3438 /* The class is not even nearly empty. */
3439 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3440 /* If one of the data members contains an empty class,
3442 if (CLASS_TYPE_P (type
)
3443 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3444 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3447 /* This is used by -Weffc++ (see below). Warn only for pointers
3448 to members which might hold dynamic memory. So do not warn
3449 for pointers to functions or pointers to members. */
3450 if (TYPE_PTR_P (type
)
3451 && !TYPE_PTRFN_P (type
))
3452 has_pointers
= true;
3454 if (CLASS_TYPE_P (type
))
3456 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3457 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3458 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3459 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3462 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3463 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3465 if (! layout_pod_type_p (type
))
3466 /* DR 148 now allows pointers to members (which are POD themselves),
3467 to be allowed in POD structs. */
3468 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3470 if (!std_layout_type_p (type
))
3471 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3473 if (! zero_init_p (type
))
3474 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3476 /* We set DECL_C_BIT_FIELD in grokbitfield.
3477 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3478 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3479 check_field_decl (x
, t
,
3480 cant_have_const_ctor_p
,
3482 &any_default_members
);
3484 /* Now that we've removed bit-field widths from DECL_INITIAL,
3485 anything left in DECL_INITIAL is an NSDMI that makes the class
3487 if (DECL_INITIAL (x
))
3488 CLASSTYPE_NON_AGGREGATE (t
) = true;
3490 /* If any field is const, the structure type is pseudo-const. */
3491 if (CP_TYPE_CONST_P (type
))
3493 C_TYPE_FIELDS_READONLY (t
) = 1;
3494 if (DECL_INITIAL (x
) == NULL_TREE
)
3495 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3497 /* ARM $12.6.2: [A member initializer list] (or, for an
3498 aggregate, initialization by a brace-enclosed list) is the
3499 only way to initialize nonstatic const and reference
3501 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3502 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3504 /* A field that is pseudo-const makes the structure likewise. */
3505 else if (CLASS_TYPE_P (type
))
3507 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3508 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3509 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3510 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3513 /* Core issue 80: A nonstatic data member is required to have a
3514 different name from the class iff the class has a
3515 user-declared constructor. */
3516 if (constructor_name_p (DECL_NAME (x
), t
)
3517 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3518 permerror (input_location
, "field %q+#D with same name as class", x
);
3521 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3522 it should also define a copy constructor and an assignment operator to
3523 implement the correct copy semantic (deep vs shallow, etc.). As it is
3524 not feasible to check whether the constructors do allocate dynamic memory
3525 and store it within members, we approximate the warning like this:
3527 -- Warn only if there are members which are pointers
3528 -- Warn only if there is a non-trivial constructor (otherwise,
3529 there cannot be memory allocated).
3530 -- Warn only if there is a non-trivial destructor. We assume that the
3531 user at least implemented the cleanup correctly, and a destructor
3532 is needed to free dynamic memory.
3534 This seems enough for practical purposes. */
3537 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3538 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3539 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3541 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3543 if (! TYPE_HAS_COPY_CTOR (t
))
3545 warning (OPT_Weffc__
,
3546 " but does not override %<%T(const %T&)%>", t
, t
);
3547 if (!TYPE_HAS_COPY_ASSIGN (t
))
3548 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3550 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3551 warning (OPT_Weffc__
,
3552 " but does not override %<operator=(const %T&)%>", t
);
3555 /* Non-static data member initializers make the default constructor
3557 if (any_default_members
)
3559 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3560 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3563 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3565 TYPE_PACKED (t
) = 0;
3567 /* Check anonymous struct/anonymous union fields. */
3568 finish_struct_anon (t
);
3570 /* We've built up the list of access declarations in reverse order.
3572 *access_decls
= nreverse (*access_decls
);
3575 /* If TYPE is an empty class type, records its OFFSET in the table of
3579 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3583 if (!is_empty_class (type
))
3586 /* Record the location of this empty object in OFFSETS. */
3587 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3589 n
= splay_tree_insert (offsets
,
3590 (splay_tree_key
) offset
,
3591 (splay_tree_value
) NULL_TREE
);
3592 n
->value
= ((splay_tree_value
)
3593 tree_cons (NULL_TREE
,
3600 /* Returns nonzero if TYPE is an empty class type and there is
3601 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3604 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3609 if (!is_empty_class (type
))
3612 /* Record the location of this empty object in OFFSETS. */
3613 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3617 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3618 if (same_type_p (TREE_VALUE (t
), type
))
3624 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3625 F for every subobject, passing it the type, offset, and table of
3626 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3629 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3630 than MAX_OFFSET will not be walked.
3632 If F returns a nonzero value, the traversal ceases, and that value
3633 is returned. Otherwise, returns zero. */
3636 walk_subobject_offsets (tree type
,
3637 subobject_offset_fn f
,
3644 tree type_binfo
= NULL_TREE
;
3646 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3648 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3651 if (type
== error_mark_node
)
3656 if (abi_version_at_least (2))
3658 type
= BINFO_TYPE (type
);
3661 if (CLASS_TYPE_P (type
))
3667 /* Avoid recursing into objects that are not interesting. */
3668 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3671 /* Record the location of TYPE. */
3672 r
= (*f
) (type
, offset
, offsets
);
3676 /* Iterate through the direct base classes of TYPE. */
3678 type_binfo
= TYPE_BINFO (type
);
3679 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3683 if (abi_version_at_least (2)
3684 && BINFO_VIRTUAL_P (binfo
))
3688 && BINFO_VIRTUAL_P (binfo
)
3689 && !BINFO_PRIMARY_P (binfo
))
3692 if (!abi_version_at_least (2))
3693 binfo_offset
= size_binop (PLUS_EXPR
,
3695 BINFO_OFFSET (binfo
));
3699 /* We cannot rely on BINFO_OFFSET being set for the base
3700 class yet, but the offsets for direct non-virtual
3701 bases can be calculated by going back to the TYPE. */
3702 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3703 binfo_offset
= size_binop (PLUS_EXPR
,
3705 BINFO_OFFSET (orig_binfo
));
3708 r
= walk_subobject_offsets (binfo
,
3713 (abi_version_at_least (2)
3714 ? /*vbases_p=*/0 : vbases_p
));
3719 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3722 vec
<tree
, va_gc
> *vbases
;
3724 /* Iterate through the virtual base classes of TYPE. In G++
3725 3.2, we included virtual bases in the direct base class
3726 loop above, which results in incorrect results; the
3727 correct offsets for virtual bases are only known when
3728 working with the most derived type. */
3730 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3731 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3733 r
= walk_subobject_offsets (binfo
,
3735 size_binop (PLUS_EXPR
,
3737 BINFO_OFFSET (binfo
)),
3746 /* We still have to walk the primary base, if it is
3747 virtual. (If it is non-virtual, then it was walked
3749 tree vbase
= get_primary_binfo (type_binfo
);
3751 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3752 && BINFO_PRIMARY_P (vbase
)
3753 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3755 r
= (walk_subobject_offsets
3757 offsets
, max_offset
, /*vbases_p=*/0));
3764 /* Iterate through the fields of TYPE. */
3765 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3766 if (TREE_CODE (field
) == FIELD_DECL
&& !DECL_ARTIFICIAL (field
))
3770 if (abi_version_at_least (2))
3771 field_offset
= byte_position (field
);
3773 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3774 field_offset
= DECL_FIELD_OFFSET (field
);
3776 r
= walk_subobject_offsets (TREE_TYPE (field
),
3778 size_binop (PLUS_EXPR
,
3788 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3790 tree element_type
= strip_array_types (type
);
3791 tree domain
= TYPE_DOMAIN (type
);
3794 /* Avoid recursing into objects that are not interesting. */
3795 if (!CLASS_TYPE_P (element_type
)
3796 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3799 /* Step through each of the elements in the array. */
3800 for (index
= size_zero_node
;
3801 /* G++ 3.2 had an off-by-one error here. */
3802 (abi_version_at_least (2)
3803 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3804 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3805 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3807 r
= walk_subobject_offsets (TREE_TYPE (type
),
3815 offset
= size_binop (PLUS_EXPR
, offset
,
3816 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3817 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3818 there's no point in iterating through the remaining
3819 elements of the array. */
3820 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3828 /* Record all of the empty subobjects of TYPE (either a type or a
3829 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3830 is being placed at OFFSET; otherwise, it is a base class that is
3831 being placed at OFFSET. */
3834 record_subobject_offsets (tree type
,
3837 bool is_data_member
)
3840 /* If recording subobjects for a non-static data member or a
3841 non-empty base class , we do not need to record offsets beyond
3842 the size of the biggest empty class. Additional data members
3843 will go at the end of the class. Additional base classes will go
3844 either at offset zero (if empty, in which case they cannot
3845 overlap with offsets past the size of the biggest empty class) or
3846 at the end of the class.
3848 However, if we are placing an empty base class, then we must record
3849 all offsets, as either the empty class is at offset zero (where
3850 other empty classes might later be placed) or at the end of the
3851 class (where other objects might then be placed, so other empty
3852 subobjects might later overlap). */
3854 || !is_empty_class (BINFO_TYPE (type
)))
3855 max_offset
= sizeof_biggest_empty_class
;
3857 max_offset
= NULL_TREE
;
3858 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3859 offsets
, max_offset
, is_data_member
);
3862 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3863 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3864 virtual bases of TYPE are examined. */
3867 layout_conflict_p (tree type
,
3872 splay_tree_node max_node
;
3874 /* Get the node in OFFSETS that indicates the maximum offset where
3875 an empty subobject is located. */
3876 max_node
= splay_tree_max (offsets
);
3877 /* If there aren't any empty subobjects, then there's no point in
3878 performing this check. */
3882 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3883 offsets
, (tree
) (max_node
->key
),
3887 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3888 non-static data member of the type indicated by RLI. BINFO is the
3889 binfo corresponding to the base subobject, OFFSETS maps offsets to
3890 types already located at those offsets. This function determines
3891 the position of the DECL. */
3894 layout_nonempty_base_or_field (record_layout_info rli
,
3899 tree offset
= NULL_TREE
;
3905 /* For the purposes of determining layout conflicts, we want to
3906 use the class type of BINFO; TREE_TYPE (DECL) will be the
3907 CLASSTYPE_AS_BASE version, which does not contain entries for
3908 zero-sized bases. */
3909 type
= TREE_TYPE (binfo
);
3914 type
= TREE_TYPE (decl
);
3918 /* Try to place the field. It may take more than one try if we have
3919 a hard time placing the field without putting two objects of the
3920 same type at the same address. */
3923 struct record_layout_info_s old_rli
= *rli
;
3925 /* Place this field. */
3926 place_field (rli
, decl
);
3927 offset
= byte_position (decl
);
3929 /* We have to check to see whether or not there is already
3930 something of the same type at the offset we're about to use.
3931 For example, consider:
3934 struct T : public S { int i; };
3935 struct U : public S, public T {};
3937 Here, we put S at offset zero in U. Then, we can't put T at
3938 offset zero -- its S component would be at the same address
3939 as the S we already allocated. So, we have to skip ahead.
3940 Since all data members, including those whose type is an
3941 empty class, have nonzero size, any overlap can happen only
3942 with a direct or indirect base-class -- it can't happen with
3944 /* In a union, overlap is permitted; all members are placed at
3946 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
3948 /* G++ 3.2 did not check for overlaps when placing a non-empty
3950 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
3952 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
3955 /* Strip off the size allocated to this field. That puts us
3956 at the first place we could have put the field with
3957 proper alignment. */
3960 /* Bump up by the alignment required for the type. */
3962 = size_binop (PLUS_EXPR
, rli
->bitpos
,
3964 ? CLASSTYPE_ALIGN (type
)
3965 : TYPE_ALIGN (type
)));
3966 normalize_rli (rli
);
3969 /* There was no conflict. We're done laying out this field. */
3973 /* Now that we know where it will be placed, update its
3975 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
3976 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3977 this point because their BINFO_OFFSET is copied from another
3978 hierarchy. Therefore, we may not need to add the entire
3980 propagate_binfo_offsets (binfo
,
3981 size_diffop_loc (input_location
,
3982 convert (ssizetype
, offset
),
3984 BINFO_OFFSET (binfo
))));
3987 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3990 empty_base_at_nonzero_offset_p (tree type
,
3992 splay_tree
/*offsets*/)
3994 return is_empty_class (type
) && !integer_zerop (offset
);
3997 /* Layout the empty base BINFO. EOC indicates the byte currently just
3998 past the end of the class, and should be correctly aligned for a
3999 class of the type indicated by BINFO; OFFSETS gives the offsets of
4000 the empty bases allocated so far. T is the most derived
4001 type. Return nonzero iff we added it at the end. */
4004 layout_empty_base (record_layout_info rli
, tree binfo
,
4005 tree eoc
, splay_tree offsets
)
4008 tree basetype
= BINFO_TYPE (binfo
);
4011 /* This routine should only be used for empty classes. */
4012 gcc_assert (is_empty_class (basetype
));
4013 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4015 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4017 if (abi_version_at_least (2))
4018 propagate_binfo_offsets
4019 (binfo
, size_diffop_loc (input_location
,
4020 size_zero_node
, BINFO_OFFSET (binfo
)));
4023 "offset of empty base %qT may not be ABI-compliant and may"
4024 "change in a future version of GCC",
4025 BINFO_TYPE (binfo
));
4028 /* This is an empty base class. We first try to put it at offset
4030 if (layout_conflict_p (binfo
,
4031 BINFO_OFFSET (binfo
),
4035 /* That didn't work. Now, we move forward from the next
4036 available spot in the class. */
4038 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4041 if (!layout_conflict_p (binfo
,
4042 BINFO_OFFSET (binfo
),
4045 /* We finally found a spot where there's no overlap. */
4048 /* There's overlap here, too. Bump along to the next spot. */
4049 propagate_binfo_offsets (binfo
, alignment
);
4053 if (CLASSTYPE_USER_ALIGN (basetype
))
4055 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4057 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4058 TYPE_USER_ALIGN (rli
->t
) = 1;
4064 /* Layout the base given by BINFO in the class indicated by RLI.
4065 *BASE_ALIGN is a running maximum of the alignments of
4066 any base class. OFFSETS gives the location of empty base
4067 subobjects. T is the most derived type. Return nonzero if the new
4068 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4069 *NEXT_FIELD, unless BINFO is for an empty base class.
4071 Returns the location at which the next field should be inserted. */
4074 build_base_field (record_layout_info rli
, tree binfo
,
4075 splay_tree offsets
, tree
*next_field
)
4078 tree basetype
= BINFO_TYPE (binfo
);
4080 if (!COMPLETE_TYPE_P (basetype
))
4081 /* This error is now reported in xref_tag, thus giving better
4082 location information. */
4085 /* Place the base class. */
4086 if (!is_empty_class (basetype
))
4090 /* The containing class is non-empty because it has a non-empty
4092 CLASSTYPE_EMPTY_P (t
) = 0;
4094 /* Create the FIELD_DECL. */
4095 decl
= build_decl (input_location
,
4096 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4097 DECL_ARTIFICIAL (decl
) = 1;
4098 DECL_IGNORED_P (decl
) = 1;
4099 DECL_FIELD_CONTEXT (decl
) = t
;
4100 if (CLASSTYPE_AS_BASE (basetype
))
4102 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4103 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4104 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4105 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4106 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4107 DECL_FIELD_IS_BASE (decl
) = 1;
4109 /* Try to place the field. It may take more than one try if we
4110 have a hard time placing the field without putting two
4111 objects of the same type at the same address. */
4112 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4113 /* Add the new FIELD_DECL to the list of fields for T. */
4114 DECL_CHAIN (decl
) = *next_field
;
4116 next_field
= &DECL_CHAIN (decl
);
4124 /* On some platforms (ARM), even empty classes will not be
4126 eoc
= round_up_loc (input_location
,
4127 rli_size_unit_so_far (rli
),
4128 CLASSTYPE_ALIGN_UNIT (basetype
));
4129 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4130 /* A nearly-empty class "has no proper base class that is empty,
4131 not morally virtual, and at an offset other than zero." */
4132 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4135 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4136 /* The check above (used in G++ 3.2) is insufficient because
4137 an empty class placed at offset zero might itself have an
4138 empty base at a nonzero offset. */
4139 else if (walk_subobject_offsets (basetype
,
4140 empty_base_at_nonzero_offset_p
,
4143 /*max_offset=*/NULL_TREE
,
4146 if (abi_version_at_least (2))
4147 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4150 "class %qT will be considered nearly empty in a "
4151 "future version of GCC", t
);
4155 /* We do not create a FIELD_DECL for empty base classes because
4156 it might overlap some other field. We want to be able to
4157 create CONSTRUCTORs for the class by iterating over the
4158 FIELD_DECLs, and the back end does not handle overlapping
4161 /* An empty virtual base causes a class to be non-empty
4162 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4163 here because that was already done when the virtual table
4164 pointer was created. */
4167 /* Record the offsets of BINFO and its base subobjects. */
4168 record_subobject_offsets (binfo
,
4169 BINFO_OFFSET (binfo
),
4171 /*is_data_member=*/false);
4176 /* Layout all of the non-virtual base classes. Record empty
4177 subobjects in OFFSETS. T is the most derived type. Return nonzero
4178 if the type cannot be nearly empty. The fields created
4179 corresponding to the base classes will be inserted at
4183 build_base_fields (record_layout_info rli
,
4184 splay_tree offsets
, tree
*next_field
)
4186 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4189 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4192 /* The primary base class is always allocated first. */
4193 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4194 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4195 offsets
, next_field
);
4197 /* Now allocate the rest of the bases. */
4198 for (i
= 0; i
< n_baseclasses
; ++i
)
4202 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4204 /* The primary base was already allocated above, so we don't
4205 need to allocate it again here. */
4206 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4209 /* Virtual bases are added at the end (a primary virtual base
4210 will have already been added). */
4211 if (BINFO_VIRTUAL_P (base_binfo
))
4214 next_field
= build_base_field (rli
, base_binfo
,
4215 offsets
, next_field
);
4219 /* Go through the TYPE_METHODS of T issuing any appropriate
4220 diagnostics, figuring out which methods override which other
4221 methods, and so forth. */
4224 check_methods (tree t
)
4228 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4230 check_for_override (x
, t
);
4231 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4232 error ("initializer specified for non-virtual method %q+D", x
);
4233 /* The name of the field is the original field name
4234 Save this in auxiliary field for later overloading. */
4235 if (DECL_VINDEX (x
))
4237 TYPE_POLYMORPHIC_P (t
) = 1;
4238 if (DECL_PURE_VIRTUAL_P (x
))
4239 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4241 /* All user-provided destructors are non-trivial.
4242 Constructors and assignment ops are handled in
4243 grok_special_member_properties. */
4244 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4245 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4249 /* FN is a constructor or destructor. Clone the declaration to create
4250 a specialized in-charge or not-in-charge version, as indicated by
4254 build_clone (tree fn
, tree name
)
4259 /* Copy the function. */
4260 clone
= copy_decl (fn
);
4261 /* Reset the function name. */
4262 DECL_NAME (clone
) = name
;
4263 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4264 /* Remember where this function came from. */
4265 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4266 /* Make it easy to find the CLONE given the FN. */
4267 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4268 DECL_CHAIN (fn
) = clone
;
4270 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4271 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4273 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4274 DECL_TEMPLATE_RESULT (clone
) = result
;
4275 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4276 DECL_TI_TEMPLATE (result
) = clone
;
4277 TREE_TYPE (clone
) = TREE_TYPE (result
);
4281 DECL_CLONED_FUNCTION (clone
) = fn
;
4282 /* There's no pending inline data for this function. */
4283 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4284 DECL_PENDING_INLINE_P (clone
) = 0;
4286 /* The base-class destructor is not virtual. */
4287 if (name
== base_dtor_identifier
)
4289 DECL_VIRTUAL_P (clone
) = 0;
4290 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4291 DECL_VINDEX (clone
) = NULL_TREE
;
4294 /* If there was an in-charge parameter, drop it from the function
4296 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4302 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4303 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4304 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4305 /* Skip the `this' parameter. */
4306 parmtypes
= TREE_CHAIN (parmtypes
);
4307 /* Skip the in-charge parameter. */
4308 parmtypes
= TREE_CHAIN (parmtypes
);
4309 /* And the VTT parm, in a complete [cd]tor. */
4310 if (DECL_HAS_VTT_PARM_P (fn
)
4311 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4312 parmtypes
= TREE_CHAIN (parmtypes
);
4313 /* If this is subobject constructor or destructor, add the vtt
4316 = build_method_type_directly (basetype
,
4317 TREE_TYPE (TREE_TYPE (clone
)),
4320 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4323 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4324 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4327 /* Copy the function parameters. */
4328 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4329 /* Remove the in-charge parameter. */
4330 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4332 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4333 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4334 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4336 /* And the VTT parm, in a complete [cd]tor. */
4337 if (DECL_HAS_VTT_PARM_P (fn
))
4339 if (DECL_NEEDS_VTT_PARM_P (clone
))
4340 DECL_HAS_VTT_PARM_P (clone
) = 1;
4343 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4344 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4345 DECL_HAS_VTT_PARM_P (clone
) = 0;
4349 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4351 DECL_CONTEXT (parms
) = clone
;
4352 cxx_dup_lang_specific_decl (parms
);
4355 /* Create the RTL for this function. */
4356 SET_DECL_RTL (clone
, NULL
);
4357 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4360 note_decl_for_pch (clone
);
4365 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4366 not invoke this function directly.
4368 For a non-thunk function, returns the address of the slot for storing
4369 the function it is a clone of. Otherwise returns NULL_TREE.
4371 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4372 cloned_function is unset. This is to support the separate
4373 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4374 on a template makes sense, but not the former. */
4377 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4381 decl
= STRIP_TEMPLATE (decl
);
4383 if (TREE_CODE (decl
) != FUNCTION_DECL
4384 || !DECL_LANG_SPECIFIC (decl
)
4385 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4387 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4389 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4395 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4396 if (just_testing
&& *ptr
== NULL_TREE
)
4402 /* Produce declarations for all appropriate clones of FN. If
4403 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4404 CLASTYPE_METHOD_VEC as well. */
4407 clone_function_decl (tree fn
, int update_method_vec_p
)
4411 /* Avoid inappropriate cloning. */
4413 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4416 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4418 /* For each constructor, we need two variants: an in-charge version
4419 and a not-in-charge version. */
4420 clone
= build_clone (fn
, complete_ctor_identifier
);
4421 if (update_method_vec_p
)
4422 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4423 clone
= build_clone (fn
, base_ctor_identifier
);
4424 if (update_method_vec_p
)
4425 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4429 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4431 /* For each destructor, we need three variants: an in-charge
4432 version, a not-in-charge version, and an in-charge deleting
4433 version. We clone the deleting version first because that
4434 means it will go second on the TYPE_METHODS list -- and that
4435 corresponds to the correct layout order in the virtual
4438 For a non-virtual destructor, we do not build a deleting
4440 if (DECL_VIRTUAL_P (fn
))
4442 clone
= build_clone (fn
, deleting_dtor_identifier
);
4443 if (update_method_vec_p
)
4444 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4446 clone
= build_clone (fn
, complete_dtor_identifier
);
4447 if (update_method_vec_p
)
4448 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4449 clone
= build_clone (fn
, base_dtor_identifier
);
4450 if (update_method_vec_p
)
4451 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4454 /* Note that this is an abstract function that is never emitted. */
4455 DECL_ABSTRACT (fn
) = 1;
4458 /* DECL is an in charge constructor, which is being defined. This will
4459 have had an in class declaration, from whence clones were
4460 declared. An out-of-class definition can specify additional default
4461 arguments. As it is the clones that are involved in overload
4462 resolution, we must propagate the information from the DECL to its
4466 adjust_clone_args (tree decl
)
4470 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4471 clone
= DECL_CHAIN (clone
))
4473 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4474 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4475 tree decl_parms
, clone_parms
;
4477 clone_parms
= orig_clone_parms
;
4479 /* Skip the 'this' parameter. */
4480 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4481 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4483 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4484 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4485 if (DECL_HAS_VTT_PARM_P (decl
))
4486 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4488 clone_parms
= orig_clone_parms
;
4489 if (DECL_HAS_VTT_PARM_P (clone
))
4490 clone_parms
= TREE_CHAIN (clone_parms
);
4492 for (decl_parms
= orig_decl_parms
; decl_parms
;
4493 decl_parms
= TREE_CHAIN (decl_parms
),
4494 clone_parms
= TREE_CHAIN (clone_parms
))
4496 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4497 TREE_TYPE (clone_parms
)));
4499 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4501 /* A default parameter has been added. Adjust the
4502 clone's parameters. */
4503 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4504 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4505 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4508 clone_parms
= orig_decl_parms
;
4510 if (DECL_HAS_VTT_PARM_P (clone
))
4512 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4513 TREE_VALUE (orig_clone_parms
),
4515 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4517 type
= build_method_type_directly (basetype
,
4518 TREE_TYPE (TREE_TYPE (clone
)),
4521 type
= build_exception_variant (type
, exceptions
);
4523 type
= cp_build_type_attribute_variant (type
, attrs
);
4524 TREE_TYPE (clone
) = type
;
4526 clone_parms
= NULL_TREE
;
4530 gcc_assert (!clone_parms
);
4534 /* For each of the constructors and destructors in T, create an
4535 in-charge and not-in-charge variant. */
4538 clone_constructors_and_destructors (tree t
)
4542 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4544 if (!CLASSTYPE_METHOD_VEC (t
))
4547 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4548 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4549 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4550 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4553 /* Deduce noexcept for a destructor DTOR. */
4556 deduce_noexcept_on_destructor (tree dtor
)
4558 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4560 tree ctx
= DECL_CONTEXT (dtor
);
4561 tree implicit_fn
= implicitly_declare_fn (sfk_destructor
, ctx
,
4564 tree eh_spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn
));
4565 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4569 /* For each destructor in T, deduce noexcept:
4571 12.4/3: A declaration of a destructor that does not have an
4572 exception-specification is implicitly considered to have the
4573 same exception-specification as an implicit declaration (15.4). */
4576 deduce_noexcept_on_destructors (tree t
)
4580 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4582 if (!CLASSTYPE_METHOD_VEC (t
))
4585 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4586 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4589 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4590 of TYPE for virtual functions which FNDECL overrides. Return a
4591 mask of the tm attributes found therein. */
4594 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4596 tree binfo
= TYPE_BINFO (type
);
4600 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4602 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4604 if (!TYPE_POLYMORPHIC_P (basetype
))
4607 o
= look_for_overrides_here (basetype
, fndecl
);
4609 found
|= tm_attr_to_mask (find_tm_attribute
4610 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4612 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4618 /* Subroutine of set_method_tm_attributes. Handle the checks and
4619 inheritance for one virtual method FNDECL. */
4622 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4627 found
= look_for_tm_attr_overrides (type
, fndecl
);
4629 /* If FNDECL doesn't actually override anything (i.e. T is the
4630 class that first declares FNDECL virtual), then we're done. */
4634 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4635 have
= tm_attr_to_mask (tm_attr
);
4637 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4638 tm_pure must match exactly, otherwise no weakening of
4639 tm_safe > tm_callable > nothing. */
4640 /* ??? The tm_pure attribute didn't make the transition to the
4641 multivendor language spec. */
4642 if (have
== TM_ATTR_PURE
)
4644 if (found
!= TM_ATTR_PURE
)
4650 /* If the overridden function is tm_pure, then FNDECL must be. */
4651 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4653 /* Look for base class combinations that cannot be satisfied. */
4654 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4656 found
&= ~TM_ATTR_PURE
;
4658 error_at (DECL_SOURCE_LOCATION (fndecl
),
4659 "method overrides both %<transaction_pure%> and %qE methods",
4660 tm_mask_to_attr (found
));
4662 /* If FNDECL did not declare an attribute, then inherit the most
4664 else if (tm_attr
== NULL
)
4666 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4668 /* Otherwise validate that we're not weaker than a function
4669 that is being overridden. */
4673 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4679 error_at (DECL_SOURCE_LOCATION (fndecl
),
4680 "method declared %qE overriding %qE method",
4681 tm_attr
, tm_mask_to_attr (found
));
4684 /* For each of the methods in T, propagate a class-level tm attribute. */
4687 set_method_tm_attributes (tree t
)
4689 tree class_tm_attr
, fndecl
;
4691 /* Don't bother collecting tm attributes if transactional memory
4692 support is not enabled. */
4696 /* Process virtual methods first, as they inherit directly from the
4697 base virtual function and also require validation of new attributes. */
4698 if (TYPE_CONTAINS_VPTR_P (t
))
4701 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4702 vchain
= TREE_CHAIN (vchain
))
4704 fndecl
= BV_FN (vchain
);
4705 if (DECL_THUNK_P (fndecl
))
4706 fndecl
= THUNK_TARGET (fndecl
);
4707 set_one_vmethod_tm_attributes (t
, fndecl
);
4711 /* If the class doesn't have an attribute, nothing more to do. */
4712 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4713 if (class_tm_attr
== NULL
)
4716 /* Any method that does not yet have a tm attribute inherits
4717 the one from the class. */
4718 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4720 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4721 apply_tm_attr (fndecl
, class_tm_attr
);
4725 /* Returns true iff class T has a user-defined constructor other than
4726 the default constructor. */
4729 type_has_user_nondefault_constructor (tree t
)
4733 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4736 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4738 tree fn
= OVL_CURRENT (fns
);
4739 if (!DECL_ARTIFICIAL (fn
)
4740 && (TREE_CODE (fn
) == TEMPLATE_DECL
4741 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4749 /* Returns the defaulted constructor if T has one. Otherwise, returns
4753 in_class_defaulted_default_constructor (tree t
)
4757 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4760 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4762 tree fn
= OVL_CURRENT (fns
);
4764 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4766 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4767 while (args
&& TREE_PURPOSE (args
))
4768 args
= TREE_CHAIN (args
);
4769 if (!args
|| args
== void_list_node
)
4777 /* Returns true iff FN is a user-provided function, i.e. user-declared
4778 and not defaulted at its first declaration; or explicit, private,
4779 protected, or non-const. */
4782 user_provided_p (tree fn
)
4784 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4787 return (!DECL_ARTIFICIAL (fn
)
4788 && !DECL_DEFAULTED_IN_CLASS_P (fn
));
4791 /* Returns true iff class T has a user-provided constructor. */
4794 type_has_user_provided_constructor (tree t
)
4798 if (!CLASS_TYPE_P (t
))
4801 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4804 /* This can happen in error cases; avoid crashing. */
4805 if (!CLASSTYPE_METHOD_VEC (t
))
4808 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4809 if (user_provided_p (OVL_CURRENT (fns
)))
4815 /* Returns true iff class T has a user-provided default constructor. */
4818 type_has_user_provided_default_constructor (tree t
)
4822 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4825 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4827 tree fn
= OVL_CURRENT (fns
);
4828 if (TREE_CODE (fn
) == FUNCTION_DECL
4829 && user_provided_p (fn
)
4830 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4837 /* TYPE is being used as a virtual base, and has a non-trivial move
4838 assignment. Return true if this is due to there being a user-provided
4839 move assignment in TYPE or one of its subobjects; if there isn't, then
4840 multiple move assignment can't cause any harm. */
4843 vbase_has_user_provided_move_assign (tree type
)
4845 /* Does the type itself have a user-provided move assignment operator? */
4847 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4848 fns
; fns
= OVL_NEXT (fns
))
4850 tree fn
= OVL_CURRENT (fns
);
4851 if (move_fn_p (fn
) && user_provided_p (fn
))
4855 /* Do any of its bases? */
4856 tree binfo
= TYPE_BINFO (type
);
4858 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4859 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
4862 /* Or non-static data members? */
4863 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4865 if (TREE_CODE (field
) == FIELD_DECL
4866 && CLASS_TYPE_P (TREE_TYPE (field
))
4867 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
4875 /* If default-initialization leaves part of TYPE uninitialized, returns
4876 a DECL for the field or TYPE itself (DR 253). */
4879 default_init_uninitialized_part (tree type
)
4884 type
= strip_array_types (type
);
4885 if (!CLASS_TYPE_P (type
))
4887 if (type_has_user_provided_default_constructor (type
))
4889 for (binfo
= TYPE_BINFO (type
), i
= 0;
4890 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
4892 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
4896 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
4897 if (TREE_CODE (t
) == FIELD_DECL
4898 && !DECL_ARTIFICIAL (t
)
4899 && !DECL_INITIAL (t
))
4901 r
= default_init_uninitialized_part (TREE_TYPE (t
));
4903 return DECL_P (r
) ? r
: t
;
4909 /* Returns true iff for class T, a trivial synthesized default constructor
4910 would be constexpr. */
4913 trivial_default_constructor_is_constexpr (tree t
)
4915 /* A defaulted trivial default constructor is constexpr
4916 if there is nothing to initialize. */
4917 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
4918 return is_really_empty_class (t
);
4921 /* Returns true iff class T has a constexpr default constructor. */
4924 type_has_constexpr_default_constructor (tree t
)
4928 if (!CLASS_TYPE_P (t
))
4930 /* The caller should have stripped an enclosing array. */
4931 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
4934 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
4936 if (!TYPE_HAS_COMPLEX_DFLT (t
))
4937 return trivial_default_constructor_is_constexpr (t
);
4938 /* Non-trivial, we need to check subobject constructors. */
4939 lazily_declare_fn (sfk_constructor
, t
);
4941 fns
= locate_ctor (t
);
4942 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
4945 /* Returns true iff class TYPE has a virtual destructor. */
4948 type_has_virtual_destructor (tree type
)
4952 if (!CLASS_TYPE_P (type
))
4955 gcc_assert (COMPLETE_TYPE_P (type
));
4956 dtor
= CLASSTYPE_DESTRUCTORS (type
);
4957 return (dtor
&& DECL_VIRTUAL_P (dtor
));
4960 /* Returns true iff class T has a move constructor. */
4963 type_has_move_constructor (tree t
)
4967 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4969 gcc_assert (COMPLETE_TYPE_P (t
));
4970 lazily_declare_fn (sfk_move_constructor
, t
);
4973 if (!CLASSTYPE_METHOD_VEC (t
))
4976 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4977 if (move_fn_p (OVL_CURRENT (fns
)))
4983 /* Returns true iff class T has a move assignment operator. */
4986 type_has_move_assign (tree t
)
4990 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
4992 gcc_assert (COMPLETE_TYPE_P (t
));
4993 lazily_declare_fn (sfk_move_assignment
, t
);
4996 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
4997 fns
; fns
= OVL_NEXT (fns
))
4998 if (move_fn_p (OVL_CURRENT (fns
)))
5004 /* Returns true iff class T has a move constructor that was explicitly
5005 declared in the class body. Note that this is different from
5006 "user-provided", which doesn't include functions that are defaulted in
5010 type_has_user_declared_move_constructor (tree t
)
5014 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5017 if (!CLASSTYPE_METHOD_VEC (t
))
5020 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5022 tree fn
= OVL_CURRENT (fns
);
5023 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5030 /* Returns true iff class T has a move assignment operator that was
5031 explicitly declared in the class body. */
5034 type_has_user_declared_move_assign (tree t
)
5038 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5041 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5042 fns
; fns
= OVL_NEXT (fns
))
5044 tree fn
= OVL_CURRENT (fns
);
5045 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5052 /* Nonzero if we need to build up a constructor call when initializing an
5053 object of this class, either because it has a user-provided constructor
5054 or because it doesn't have a default constructor (so we need to give an
5055 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5056 what you care about is whether or not an object can be produced by a
5057 constructor (e.g. so we don't set TREE_READONLY on const variables of
5058 such type); use this function when what you care about is whether or not
5059 to try to call a constructor to create an object. The latter case is
5060 the former plus some cases of constructors that cannot be called. */
5063 type_build_ctor_call (tree t
)
5066 if (TYPE_NEEDS_CONSTRUCTING (t
))
5068 inner
= strip_array_types (t
);
5069 return (CLASS_TYPE_P (inner
) && !TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
)
5070 && !ANON_AGGR_TYPE_P (inner
));
5073 /* Remove all zero-width bit-fields from T. */
5076 remove_zero_width_bit_fields (tree t
)
5080 fieldsp
= &TYPE_FIELDS (t
);
5083 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5084 && DECL_C_BIT_FIELD (*fieldsp
)
5085 /* We should not be confused by the fact that grokbitfield
5086 temporarily sets the width of the bit field into
5087 DECL_INITIAL (*fieldsp).
5088 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5090 && integer_zerop (DECL_SIZE (*fieldsp
)))
5091 *fieldsp
= DECL_CHAIN (*fieldsp
);
5093 fieldsp
= &DECL_CHAIN (*fieldsp
);
5097 /* Returns TRUE iff we need a cookie when dynamically allocating an
5098 array whose elements have the indicated class TYPE. */
5101 type_requires_array_cookie (tree type
)
5104 bool has_two_argument_delete_p
= false;
5106 gcc_assert (CLASS_TYPE_P (type
));
5108 /* If there's a non-trivial destructor, we need a cookie. In order
5109 to iterate through the array calling the destructor for each
5110 element, we'll have to know how many elements there are. */
5111 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5114 /* If the usual deallocation function is a two-argument whose second
5115 argument is of type `size_t', then we have to pass the size of
5116 the array to the deallocation function, so we will need to store
5118 fns
= lookup_fnfields (TYPE_BINFO (type
),
5119 ansi_opname (VEC_DELETE_EXPR
),
5121 /* If there are no `operator []' members, or the lookup is
5122 ambiguous, then we don't need a cookie. */
5123 if (!fns
|| fns
== error_mark_node
)
5125 /* Loop through all of the functions. */
5126 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5131 /* Select the current function. */
5132 fn
= OVL_CURRENT (fns
);
5133 /* See if this function is a one-argument delete function. If
5134 it is, then it will be the usual deallocation function. */
5135 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5136 if (second_parm
== void_list_node
)
5138 /* Do not consider this function if its second argument is an
5142 /* Otherwise, if we have a two-argument function and the second
5143 argument is `size_t', it will be the usual deallocation
5144 function -- unless there is one-argument function, too. */
5145 if (TREE_CHAIN (second_parm
) == void_list_node
5146 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5147 has_two_argument_delete_p
= true;
5150 return has_two_argument_delete_p
;
5153 /* Finish computing the `literal type' property of class type T.
5155 At this point, we have already processed base classes and
5156 non-static data members. We need to check whether the copy
5157 constructor is trivial, the destructor is trivial, and there
5158 is a trivial default constructor or at least one constexpr
5159 constructor other than the copy constructor. */
5162 finalize_literal_type_property (tree t
)
5166 if (cxx_dialect
< cxx0x
5167 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5168 CLASSTYPE_LITERAL_P (t
) = false;
5169 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5170 && CLASSTYPE_NON_AGGREGATE (t
)
5171 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5172 CLASSTYPE_LITERAL_P (t
) = false;
5174 if (!CLASSTYPE_LITERAL_P (t
))
5175 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5176 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5177 && TREE_CODE (fn
) != TEMPLATE_DECL
5178 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5179 && !DECL_CONSTRUCTOR_P (fn
))
5181 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5182 if (!DECL_GENERATED_P (fn
))
5184 error ("enclosing class of constexpr non-static member "
5185 "function %q+#D is not a literal type", fn
);
5186 explain_non_literal_class (t
);
5191 /* T is a non-literal type used in a context which requires a constant
5192 expression. Explain why it isn't literal. */
5195 explain_non_literal_class (tree t
)
5197 static struct pointer_set_t
*diagnosed
;
5199 if (!CLASS_TYPE_P (t
))
5201 t
= TYPE_MAIN_VARIANT (t
);
5203 if (diagnosed
== NULL
)
5204 diagnosed
= pointer_set_create ();
5205 if (pointer_set_insert (diagnosed
, t
) != 0)
5206 /* Already explained. */
5209 inform (0, "%q+T is not literal because:", t
);
5210 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5211 inform (0, " %q+T has a non-trivial destructor", t
);
5212 else if (CLASSTYPE_NON_AGGREGATE (t
)
5213 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5214 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5216 inform (0, " %q+T is not an aggregate, does not have a trivial "
5217 "default constructor, and has no constexpr constructor that "
5218 "is not a copy or move constructor", t
);
5219 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5220 && !type_has_user_provided_default_constructor (t
))
5222 /* Note that we can't simply call locate_ctor because when the
5223 constructor is deleted it just returns NULL_TREE. */
5225 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5227 tree fn
= OVL_CURRENT (fns
);
5228 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5230 parms
= skip_artificial_parms_for (fn
, parms
);
5232 if (sufficient_parms_p (parms
))
5234 if (DECL_DELETED_FN (fn
))
5235 maybe_explain_implicit_delete (fn
);
5237 explain_invalid_constexpr_fn (fn
);
5245 tree binfo
, base_binfo
, field
; int i
;
5246 for (binfo
= TYPE_BINFO (t
), i
= 0;
5247 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5249 tree basetype
= TREE_TYPE (base_binfo
);
5250 if (!CLASSTYPE_LITERAL_P (basetype
))
5252 inform (0, " base class %qT of %q+T is non-literal",
5254 explain_non_literal_class (basetype
);
5258 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5261 if (TREE_CODE (field
) != FIELD_DECL
)
5263 ftype
= TREE_TYPE (field
);
5264 if (!literal_type_p (ftype
))
5266 inform (0, " non-static data member %q+D has "
5267 "non-literal type", field
);
5268 if (CLASS_TYPE_P (ftype
))
5269 explain_non_literal_class (ftype
);
5275 /* Check the validity of the bases and members declared in T. Add any
5276 implicitly-generated functions (like copy-constructors and
5277 assignment operators). Compute various flag bits (like
5278 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5279 level: i.e., independently of the ABI in use. */
5282 check_bases_and_members (tree t
)
5284 /* Nonzero if the implicitly generated copy constructor should take
5285 a non-const reference argument. */
5286 int cant_have_const_ctor
;
5287 /* Nonzero if the implicitly generated assignment operator
5288 should take a non-const reference argument. */
5289 int no_const_asn_ref
;
5291 bool saved_complex_asn_ref
;
5292 bool saved_nontrivial_dtor
;
5295 /* By default, we use const reference arguments and generate default
5297 cant_have_const_ctor
= 0;
5298 no_const_asn_ref
= 0;
5300 /* Check all the base-classes. */
5301 check_bases (t
, &cant_have_const_ctor
,
5304 /* Deduce noexcept on destructors. This needs to happen after we've set
5305 triviality flags appropriately for our bases. */
5306 if (cxx_dialect
>= cxx0x
)
5307 deduce_noexcept_on_destructors (t
);
5309 /* Check all the method declarations. */
5312 /* Save the initial values of these flags which only indicate whether
5313 or not the class has user-provided functions. As we analyze the
5314 bases and members we can set these flags for other reasons. */
5315 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5316 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5318 /* Check all the data member declarations. We cannot call
5319 check_field_decls until we have called check_bases check_methods,
5320 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5321 being set appropriately. */
5322 check_field_decls (t
, &access_decls
,
5323 &cant_have_const_ctor
,
5326 /* A nearly-empty class has to be vptr-containing; a nearly empty
5327 class contains just a vptr. */
5328 if (!TYPE_CONTAINS_VPTR_P (t
))
5329 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5331 /* Do some bookkeeping that will guide the generation of implicitly
5332 declared member functions. */
5333 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5334 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5335 /* We need to call a constructor for this class if it has a
5336 user-provided constructor, or if the default constructor is going
5337 to initialize the vptr. (This is not an if-and-only-if;
5338 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5339 themselves need constructing.) */
5340 TYPE_NEEDS_CONSTRUCTING (t
)
5341 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5344 An aggregate is an array or a class with no user-provided
5345 constructors ... and no virtual functions.
5347 Again, other conditions for being an aggregate are checked
5349 CLASSTYPE_NON_AGGREGATE (t
)
5350 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5351 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5352 retain the old definition internally for ABI reasons. */
5353 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5354 |= (CLASSTYPE_NON_AGGREGATE (t
)
5355 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5356 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5357 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5358 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5359 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5361 /* If the class has no user-declared constructor, but does have
5362 non-static const or reference data members that can never be
5363 initialized, issue a warning. */
5364 if (warn_uninitialized
5365 /* Classes with user-declared constructors are presumed to
5366 initialize these members. */
5367 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5368 /* Aggregates can be initialized with brace-enclosed
5370 && CLASSTYPE_NON_AGGREGATE (t
))
5374 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5378 if (TREE_CODE (field
) != FIELD_DECL
5379 || DECL_INITIAL (field
) != NULL_TREE
)
5382 type
= TREE_TYPE (field
);
5383 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5384 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5385 "in class without a constructor", field
);
5386 else if (CP_TYPE_CONST_P (type
)
5387 && (!CLASS_TYPE_P (type
)
5388 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5389 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5390 "in class without a constructor", field
);
5394 /* Synthesize any needed methods. */
5395 add_implicitly_declared_members (t
, &access_decls
,
5396 cant_have_const_ctor
,
5399 /* Check defaulted declarations here so we have cant_have_const_ctor
5400 and don't need to worry about clones. */
5401 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5402 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5404 int copy
= copy_fn_p (fn
);
5408 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5409 : !no_const_asn_ref
);
5410 bool fn_const_p
= (copy
== 2);
5412 if (fn_const_p
&& !imp_const_p
)
5413 /* If the function is defaulted outside the class, we just
5414 give the synthesis error. */
5415 error ("%q+D declared to take const reference, but implicit "
5416 "declaration would take non-const", fn
);
5418 defaulted_late_check (fn
);
5421 if (LAMBDA_TYPE_P (t
))
5423 /* "The closure type associated with a lambda-expression has a deleted
5424 default constructor and a deleted copy assignment operator." */
5425 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5426 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5427 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5428 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5430 /* "This class type is not an aggregate." */
5431 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5434 /* Compute the 'literal type' property before we
5435 do anything with non-static member functions. */
5436 finalize_literal_type_property (t
);
5438 /* Create the in-charge and not-in-charge variants of constructors
5440 clone_constructors_and_destructors (t
);
5442 /* Process the using-declarations. */
5443 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5444 handle_using_decl (TREE_VALUE (access_decls
), t
);
5446 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5447 finish_struct_methods (t
);
5449 /* Figure out whether or not we will need a cookie when dynamically
5450 allocating an array of this type. */
5451 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5452 = type_requires_array_cookie (t
);
5455 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5456 accordingly. If a new vfield was created (because T doesn't have a
5457 primary base class), then the newly created field is returned. It
5458 is not added to the TYPE_FIELDS list; it is the caller's
5459 responsibility to do that. Accumulate declared virtual functions
5463 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5467 /* Collect the virtual functions declared in T. */
5468 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5469 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5470 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5472 tree new_virtual
= make_node (TREE_LIST
);
5474 BV_FN (new_virtual
) = fn
;
5475 BV_DELTA (new_virtual
) = integer_zero_node
;
5476 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5478 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5479 *virtuals_p
= new_virtual
;
5482 /* If we couldn't find an appropriate base class, create a new field
5483 here. Even if there weren't any new virtual functions, we might need a
5484 new virtual function table if we're supposed to include vptrs in
5485 all classes that need them. */
5486 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5488 /* We build this decl with vtbl_ptr_type_node, which is a
5489 `vtable_entry_type*'. It might seem more precise to use
5490 `vtable_entry_type (*)[N]' where N is the number of virtual
5491 functions. However, that would require the vtable pointer in
5492 base classes to have a different type than the vtable pointer
5493 in derived classes. We could make that happen, but that
5494 still wouldn't solve all the problems. In particular, the
5495 type-based alias analysis code would decide that assignments
5496 to the base class vtable pointer can't alias assignments to
5497 the derived class vtable pointer, since they have different
5498 types. Thus, in a derived class destructor, where the base
5499 class constructor was inlined, we could generate bad code for
5500 setting up the vtable pointer.
5502 Therefore, we use one type for all vtable pointers. We still
5503 use a type-correct type; it's just doesn't indicate the array
5504 bounds. That's better than using `void*' or some such; it's
5505 cleaner, and it let's the alias analysis code know that these
5506 stores cannot alias stores to void*! */
5509 field
= build_decl (input_location
,
5510 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5511 DECL_VIRTUAL_P (field
) = 1;
5512 DECL_ARTIFICIAL (field
) = 1;
5513 DECL_FIELD_CONTEXT (field
) = t
;
5514 DECL_FCONTEXT (field
) = t
;
5515 if (TYPE_PACKED (t
))
5516 DECL_PACKED (field
) = 1;
5518 TYPE_VFIELD (t
) = field
;
5520 /* This class is non-empty. */
5521 CLASSTYPE_EMPTY_P (t
) = 0;
5529 /* Add OFFSET to all base types of BINFO which is a base in the
5530 hierarchy dominated by T.
5532 OFFSET, which is a type offset, is number of bytes. */
5535 propagate_binfo_offsets (tree binfo
, tree offset
)
5541 /* Update BINFO's offset. */
5542 BINFO_OFFSET (binfo
)
5543 = convert (sizetype
,
5544 size_binop (PLUS_EXPR
,
5545 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5548 /* Find the primary base class. */
5549 primary_binfo
= get_primary_binfo (binfo
);
5551 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5552 propagate_binfo_offsets (primary_binfo
, offset
);
5554 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5556 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5558 /* Don't do the primary base twice. */
5559 if (base_binfo
== primary_binfo
)
5562 if (BINFO_VIRTUAL_P (base_binfo
))
5565 propagate_binfo_offsets (base_binfo
, offset
);
5569 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5570 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5571 empty subobjects of T. */
5574 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5578 bool first_vbase
= true;
5581 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5584 if (!abi_version_at_least(2))
5586 /* In G++ 3.2, we incorrectly rounded the size before laying out
5587 the virtual bases. */
5588 finish_record_layout (rli
, /*free_p=*/false);
5589 #ifdef STRUCTURE_SIZE_BOUNDARY
5590 /* Packed structures don't need to have minimum size. */
5591 if (! TYPE_PACKED (t
))
5592 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5594 rli
->offset
= TYPE_SIZE_UNIT (t
);
5595 rli
->bitpos
= bitsize_zero_node
;
5596 rli
->record_align
= TYPE_ALIGN (t
);
5599 /* Find the last field. The artificial fields created for virtual
5600 bases will go after the last extant field to date. */
5601 next_field
= &TYPE_FIELDS (t
);
5603 next_field
= &DECL_CHAIN (*next_field
);
5605 /* Go through the virtual bases, allocating space for each virtual
5606 base that is not already a primary base class. These are
5607 allocated in inheritance graph order. */
5608 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5610 if (!BINFO_VIRTUAL_P (vbase
))
5613 if (!BINFO_PRIMARY_P (vbase
))
5615 tree basetype
= TREE_TYPE (vbase
);
5617 /* This virtual base is not a primary base of any class in the
5618 hierarchy, so we have to add space for it. */
5619 next_field
= build_base_field (rli
, vbase
,
5620 offsets
, next_field
);
5622 /* If the first virtual base might have been placed at a
5623 lower address, had we started from CLASSTYPE_SIZE, rather
5624 than TYPE_SIZE, issue a warning. There can be both false
5625 positives and false negatives from this warning in rare
5626 cases; to deal with all the possibilities would probably
5627 require performing both layout algorithms and comparing
5628 the results which is not particularly tractable. */
5632 (size_binop (CEIL_DIV_EXPR
,
5633 round_up_loc (input_location
,
5635 CLASSTYPE_ALIGN (basetype
)),
5637 BINFO_OFFSET (vbase
))))
5639 "offset of virtual base %qT is not ABI-compliant and "
5640 "may change in a future version of GCC",
5643 first_vbase
= false;
5648 /* Returns the offset of the byte just past the end of the base class
5652 end_of_base (tree binfo
)
5656 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5657 size
= TYPE_SIZE_UNIT (char_type_node
);
5658 else if (is_empty_class (BINFO_TYPE (binfo
)))
5659 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5660 allocate some space for it. It cannot have virtual bases, so
5661 TYPE_SIZE_UNIT is fine. */
5662 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5664 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5666 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5669 /* Returns the offset of the byte just past the end of the base class
5670 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5671 only non-virtual bases are included. */
5674 end_of_class (tree t
, int include_virtuals_p
)
5676 tree result
= size_zero_node
;
5677 vec
<tree
, va_gc
> *vbases
;
5683 for (binfo
= TYPE_BINFO (t
), i
= 0;
5684 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5686 if (!include_virtuals_p
5687 && BINFO_VIRTUAL_P (base_binfo
)
5688 && (!BINFO_PRIMARY_P (base_binfo
)
5689 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5692 offset
= end_of_base (base_binfo
);
5693 if (INT_CST_LT_UNSIGNED (result
, offset
))
5697 /* G++ 3.2 did not check indirect virtual bases. */
5698 if (abi_version_at_least (2) && include_virtuals_p
)
5699 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5700 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5702 offset
= end_of_base (base_binfo
);
5703 if (INT_CST_LT_UNSIGNED (result
, offset
))
5710 /* Warn about bases of T that are inaccessible because they are
5711 ambiguous. For example:
5714 struct T : public S {};
5715 struct U : public S, public T {};
5717 Here, `(S*) new U' is not allowed because there are two `S'
5721 warn_about_ambiguous_bases (tree t
)
5724 vec
<tree
, va_gc
> *vbases
;
5729 /* If there are no repeated bases, nothing can be ambiguous. */
5730 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5733 /* Check direct bases. */
5734 for (binfo
= TYPE_BINFO (t
), i
= 0;
5735 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5737 basetype
= BINFO_TYPE (base_binfo
);
5739 if (!uniquely_derived_from_p (basetype
, t
))
5740 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5744 /* Check for ambiguous virtual bases. */
5746 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5747 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5749 basetype
= BINFO_TYPE (binfo
);
5751 if (!uniquely_derived_from_p (basetype
, t
))
5752 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5753 "to ambiguity", basetype
, t
);
5757 /* Compare two INTEGER_CSTs K1 and K2. */
5760 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5762 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5765 /* Increase the size indicated in RLI to account for empty classes
5766 that are "off the end" of the class. */
5769 include_empty_classes (record_layout_info rli
)
5774 /* It might be the case that we grew the class to allocate a
5775 zero-sized base class. That won't be reflected in RLI, yet,
5776 because we are willing to overlay multiple bases at the same
5777 offset. However, now we need to make sure that RLI is big enough
5778 to reflect the entire class. */
5779 eoc
= end_of_class (rli
->t
,
5780 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5781 rli_size
= rli_size_unit_so_far (rli
);
5782 if (TREE_CODE (rli_size
) == INTEGER_CST
5783 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
5785 if (!abi_version_at_least (2))
5786 /* In version 1 of the ABI, the size of a class that ends with
5787 a bitfield was not rounded up to a whole multiple of a
5788 byte. Because rli_size_unit_so_far returns only the number
5789 of fully allocated bytes, any extra bits were not included
5791 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
5793 /* The size should have been rounded to a whole byte. */
5794 gcc_assert (tree_int_cst_equal
5795 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5797 = size_binop (PLUS_EXPR
,
5799 size_binop (MULT_EXPR
,
5800 convert (bitsizetype
,
5801 size_binop (MINUS_EXPR
,
5803 bitsize_int (BITS_PER_UNIT
)));
5804 normalize_rli (rli
);
5808 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5809 BINFO_OFFSETs for all of the base-classes. Position the vtable
5810 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5813 layout_class_type (tree t
, tree
*virtuals_p
)
5815 tree non_static_data_members
;
5818 record_layout_info rli
;
5819 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5820 types that appear at that offset. */
5821 splay_tree empty_base_offsets
;
5822 /* True if the last field layed out was a bit-field. */
5823 bool last_field_was_bitfield
= false;
5824 /* The location at which the next field should be inserted. */
5826 /* T, as a base class. */
5829 /* Keep track of the first non-static data member. */
5830 non_static_data_members
= TYPE_FIELDS (t
);
5832 /* Start laying out the record. */
5833 rli
= start_record_layout (t
);
5835 /* Mark all the primary bases in the hierarchy. */
5836 determine_primary_bases (t
);
5838 /* Create a pointer to our virtual function table. */
5839 vptr
= create_vtable_ptr (t
, virtuals_p
);
5841 /* The vptr is always the first thing in the class. */
5844 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
5845 TYPE_FIELDS (t
) = vptr
;
5846 next_field
= &DECL_CHAIN (vptr
);
5847 place_field (rli
, vptr
);
5850 next_field
= &TYPE_FIELDS (t
);
5852 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5853 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5855 build_base_fields (rli
, empty_base_offsets
, next_field
);
5857 /* Layout the non-static data members. */
5858 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
5863 /* We still pass things that aren't non-static data members to
5864 the back end, in case it wants to do something with them. */
5865 if (TREE_CODE (field
) != FIELD_DECL
)
5867 place_field (rli
, field
);
5868 /* If the static data member has incomplete type, keep track
5869 of it so that it can be completed later. (The handling
5870 of pending statics in finish_record_layout is
5871 insufficient; consider:
5874 struct S2 { static S1 s1; };
5876 At this point, finish_record_layout will be called, but
5877 S1 is still incomplete.) */
5880 maybe_register_incomplete_var (field
);
5881 /* The visibility of static data members is determined
5882 at their point of declaration, not their point of
5884 determine_visibility (field
);
5889 type
= TREE_TYPE (field
);
5890 if (type
== error_mark_node
)
5893 padding
= NULL_TREE
;
5895 /* If this field is a bit-field whose width is greater than its
5896 type, then there are some special rules for allocating
5898 if (DECL_C_BIT_FIELD (field
)
5899 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
5903 bool was_unnamed_p
= false;
5904 /* We must allocate the bits as if suitably aligned for the
5905 longest integer type that fits in this many bits. type
5906 of the field. Then, we are supposed to use the left over
5907 bits as additional padding. */
5908 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
5909 if (integer_types
[itk
] != NULL_TREE
5910 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
5911 TYPE_SIZE (integer_types
[itk
]))
5912 || INT_CST_LT (DECL_SIZE (field
),
5913 TYPE_SIZE (integer_types
[itk
]))))
5916 /* ITK now indicates a type that is too large for the
5917 field. We have to back up by one to find the largest
5922 integer_type
= integer_types
[itk
];
5923 } while (itk
> 0 && integer_type
== NULL_TREE
);
5925 /* Figure out how much additional padding is required. GCC
5926 3.2 always created a padding field, even if it had zero
5928 if (!abi_version_at_least (2)
5929 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
5931 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
5932 /* In a union, the padding field must have the full width
5933 of the bit-field; all fields start at offset zero. */
5934 padding
= DECL_SIZE (field
);
5937 if (TREE_CODE (t
) == UNION_TYPE
)
5938 warning (OPT_Wabi
, "size assigned to %qT may not be "
5939 "ABI-compliant and may change in a future "
5942 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
5943 TYPE_SIZE (integer_type
));
5946 #ifdef PCC_BITFIELD_TYPE_MATTERS
5947 /* An unnamed bitfield does not normally affect the
5948 alignment of the containing class on a target where
5949 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
5950 make any exceptions for unnamed bitfields when the
5951 bitfields are longer than their types. Therefore, we
5952 temporarily give the field a name. */
5953 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
5955 was_unnamed_p
= true;
5956 DECL_NAME (field
) = make_anon_name ();
5959 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
5960 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
5961 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
5962 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5963 empty_base_offsets
);
5965 DECL_NAME (field
) = NULL_TREE
;
5966 /* Now that layout has been performed, set the size of the
5967 field to the size of its declared type; the rest of the
5968 field is effectively invisible. */
5969 DECL_SIZE (field
) = TYPE_SIZE (type
);
5970 /* We must also reset the DECL_MODE of the field. */
5971 if (abi_version_at_least (2))
5972 DECL_MODE (field
) = TYPE_MODE (type
);
5974 && DECL_MODE (field
) != TYPE_MODE (type
))
5975 /* Versions of G++ before G++ 3.4 did not reset the
5978 "the offset of %qD may not be ABI-compliant and may "
5979 "change in a future version of GCC", field
);
5982 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5983 empty_base_offsets
);
5985 /* Remember the location of any empty classes in FIELD. */
5986 if (abi_version_at_least (2))
5987 record_subobject_offsets (TREE_TYPE (field
),
5988 byte_position(field
),
5990 /*is_data_member=*/true);
5992 /* If a bit-field does not immediately follow another bit-field,
5993 and yet it starts in the middle of a byte, we have failed to
5994 comply with the ABI. */
5996 && DECL_C_BIT_FIELD (field
)
5997 /* The TREE_NO_WARNING flag gets set by Objective-C when
5998 laying out an Objective-C class. The ObjC ABI differs
5999 from the C++ ABI, and so we do not want a warning
6001 && !TREE_NO_WARNING (field
)
6002 && !last_field_was_bitfield
6003 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6004 DECL_FIELD_BIT_OFFSET (field
),
6005 bitsize_unit_node
)))
6006 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6007 "change in a future version of GCC", field
);
6009 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6010 offset of the field. */
6012 && !abi_version_at_least (2)
6013 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
6014 byte_position (field
))
6015 && contains_empty_class_p (TREE_TYPE (field
)))
6016 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
6017 "classes to be placed at different locations in a "
6018 "future version of GCC", field
);
6020 /* The middle end uses the type of expressions to determine the
6021 possible range of expression values. In order to optimize
6022 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6023 must be made aware of the width of "i", via its type.
6025 Because C++ does not have integer types of arbitrary width,
6026 we must (for the purposes of the front end) convert from the
6027 type assigned here to the declared type of the bitfield
6028 whenever a bitfield expression is used as an rvalue.
6029 Similarly, when assigning a value to a bitfield, the value
6030 must be converted to the type given the bitfield here. */
6031 if (DECL_C_BIT_FIELD (field
))
6033 unsigned HOST_WIDE_INT width
;
6034 tree ftype
= TREE_TYPE (field
);
6035 width
= tree_low_cst (DECL_SIZE (field
), /*unsignedp=*/1);
6036 if (width
!= TYPE_PRECISION (ftype
))
6039 = c_build_bitfield_integer_type (width
,
6040 TYPE_UNSIGNED (ftype
));
6042 = cp_build_qualified_type (TREE_TYPE (field
),
6043 cp_type_quals (ftype
));
6047 /* If we needed additional padding after this field, add it
6053 padding_field
= build_decl (input_location
,
6057 DECL_BIT_FIELD (padding_field
) = 1;
6058 DECL_SIZE (padding_field
) = padding
;
6059 DECL_CONTEXT (padding_field
) = t
;
6060 DECL_ARTIFICIAL (padding_field
) = 1;
6061 DECL_IGNORED_P (padding_field
) = 1;
6062 layout_nonempty_base_or_field (rli
, padding_field
,
6064 empty_base_offsets
);
6067 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6070 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6072 /* Make sure that we are on a byte boundary so that the size of
6073 the class without virtual bases will always be a round number
6075 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6076 normalize_rli (rli
);
6079 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6081 if (!abi_version_at_least (2))
6082 include_empty_classes(rli
);
6084 /* Delete all zero-width bit-fields from the list of fields. Now
6085 that the type is laid out they are no longer important. */
6086 remove_zero_width_bit_fields (t
);
6088 /* Create the version of T used for virtual bases. We do not use
6089 make_class_type for this version; this is an artificial type. For
6090 a POD type, we just reuse T. */
6091 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6093 base_t
= make_node (TREE_CODE (t
));
6095 /* Set the size and alignment for the new type. In G++ 3.2, all
6096 empty classes were considered to have size zero when used as
6098 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6100 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6101 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6102 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6104 "layout of classes derived from empty class %qT "
6105 "may change in a future version of GCC",
6112 /* If the ABI version is not at least two, and the last
6113 field was a bit-field, RLI may not be on a byte
6114 boundary. In particular, rli_size_unit_so_far might
6115 indicate the last complete byte, while rli_size_so_far
6116 indicates the total number of bits used. Therefore,
6117 rli_size_so_far, rather than rli_size_unit_so_far, is
6118 used to compute TYPE_SIZE_UNIT. */
6119 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6120 TYPE_SIZE_UNIT (base_t
)
6121 = size_binop (MAX_EXPR
,
6123 size_binop (CEIL_DIV_EXPR
,
6124 rli_size_so_far (rli
),
6125 bitsize_int (BITS_PER_UNIT
))),
6128 = size_binop (MAX_EXPR
,
6129 rli_size_so_far (rli
),
6130 size_binop (MULT_EXPR
,
6131 convert (bitsizetype
, eoc
),
6132 bitsize_int (BITS_PER_UNIT
)));
6134 TYPE_ALIGN (base_t
) = rli
->record_align
;
6135 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6137 /* Copy the fields from T. */
6138 next_field
= &TYPE_FIELDS (base_t
);
6139 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6140 if (TREE_CODE (field
) == FIELD_DECL
)
6142 *next_field
= build_decl (input_location
,
6146 DECL_CONTEXT (*next_field
) = base_t
;
6147 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6148 DECL_FIELD_BIT_OFFSET (*next_field
)
6149 = DECL_FIELD_BIT_OFFSET (field
);
6150 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6151 DECL_MODE (*next_field
) = DECL_MODE (field
);
6152 next_field
= &DECL_CHAIN (*next_field
);
6155 /* Record the base version of the type. */
6156 CLASSTYPE_AS_BASE (t
) = base_t
;
6157 TYPE_CONTEXT (base_t
) = t
;
6160 CLASSTYPE_AS_BASE (t
) = t
;
6162 /* Every empty class contains an empty class. */
6163 if (CLASSTYPE_EMPTY_P (t
))
6164 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6166 /* Set the TYPE_DECL for this type to contain the right
6167 value for DECL_OFFSET, so that we can use it as part
6168 of a COMPONENT_REF for multiple inheritance. */
6169 layout_decl (TYPE_MAIN_DECL (t
), 0);
6171 /* Now fix up any virtual base class types that we left lying
6172 around. We must get these done before we try to lay out the
6173 virtual function table. As a side-effect, this will remove the
6174 base subobject fields. */
6175 layout_virtual_bases (rli
, empty_base_offsets
);
6177 /* Make sure that empty classes are reflected in RLI at this
6179 include_empty_classes(rli
);
6181 /* Make sure not to create any structures with zero size. */
6182 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6184 build_decl (input_location
,
6185 FIELD_DECL
, NULL_TREE
, char_type_node
));
6187 /* If this is a non-POD, declaring it packed makes a difference to how it
6188 can be used as a field; don't let finalize_record_size undo it. */
6189 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6190 rli
->packed_maybe_necessary
= true;
6192 /* Let the back end lay out the type. */
6193 finish_record_layout (rli
, /*free_p=*/true);
6195 /* Warn about bases that can't be talked about due to ambiguity. */
6196 warn_about_ambiguous_bases (t
);
6198 /* Now that we're done with layout, give the base fields the real types. */
6199 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6200 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6201 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6204 splay_tree_delete (empty_base_offsets
);
6206 if (CLASSTYPE_EMPTY_P (t
)
6207 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6208 TYPE_SIZE_UNIT (t
)))
6209 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6212 /* Determine the "key method" for the class type indicated by TYPE,
6213 and set CLASSTYPE_KEY_METHOD accordingly. */
6216 determine_key_method (tree type
)
6220 if (TYPE_FOR_JAVA (type
)
6221 || processing_template_decl
6222 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6223 || CLASSTYPE_INTERFACE_KNOWN (type
))
6226 /* The key method is the first non-pure virtual function that is not
6227 inline at the point of class definition. On some targets the
6228 key function may not be inline; those targets should not call
6229 this function until the end of the translation unit. */
6230 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6231 method
= DECL_CHAIN (method
))
6232 if (DECL_VINDEX (method
) != NULL_TREE
6233 && ! DECL_DECLARED_INLINE_P (method
)
6234 && ! DECL_PURE_VIRTUAL_P (method
))
6236 CLASSTYPE_KEY_METHOD (type
) = method
;
6244 /* Allocate and return an instance of struct sorted_fields_type with
6247 static struct sorted_fields_type
*
6248 sorted_fields_type_new (int n
)
6250 struct sorted_fields_type
*sft
;
6251 sft
= ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type
)
6252 + n
* sizeof (tree
));
6259 /* Perform processing required when the definition of T (a class type)
6263 finish_struct_1 (tree t
)
6266 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6267 tree virtuals
= NULL_TREE
;
6269 if (COMPLETE_TYPE_P (t
))
6271 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6272 error ("redefinition of %q#T", t
);
6277 /* If this type was previously laid out as a forward reference,
6278 make sure we lay it out again. */
6279 TYPE_SIZE (t
) = NULL_TREE
;
6280 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6282 /* Make assumptions about the class; we'll reset the flags if
6284 CLASSTYPE_EMPTY_P (t
) = 1;
6285 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6286 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6287 CLASSTYPE_LITERAL_P (t
) = true;
6289 /* Do end-of-class semantic processing: checking the validity of the
6290 bases and members and add implicitly generated methods. */
6291 check_bases_and_members (t
);
6293 /* Find the key method. */
6294 if (TYPE_CONTAINS_VPTR_P (t
))
6296 /* The Itanium C++ ABI permits the key method to be chosen when
6297 the class is defined -- even though the key method so
6298 selected may later turn out to be an inline function. On
6299 some systems (such as ARM Symbian OS) the key method cannot
6300 be determined until the end of the translation unit. On such
6301 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6302 will cause the class to be added to KEYED_CLASSES. Then, in
6303 finish_file we will determine the key method. */
6304 if (targetm
.cxx
.key_method_may_be_inline ())
6305 determine_key_method (t
);
6307 /* If a polymorphic class has no key method, we may emit the vtable
6308 in every translation unit where the class definition appears. */
6309 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6310 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6313 /* Layout the class itself. */
6314 layout_class_type (t
, &virtuals
);
6315 if (CLASSTYPE_AS_BASE (t
) != t
)
6316 /* We use the base type for trivial assignments, and hence it
6318 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6320 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6322 /* If necessary, create the primary vtable for this class. */
6323 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6325 /* We must enter these virtuals into the table. */
6326 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6327 build_primary_vtable (NULL_TREE
, t
);
6328 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6329 /* Here we know enough to change the type of our virtual
6330 function table, but we will wait until later this function. */
6331 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6333 /* If we're warning about ABI tags, check the types of the new
6334 virtual functions. */
6336 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6337 check_abi_tags (t
, TREE_VALUE (v
));
6340 if (TYPE_CONTAINS_VPTR_P (t
))
6345 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6346 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6347 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6348 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6350 /* Add entries for virtual functions introduced by this class. */
6351 BINFO_VIRTUALS (TYPE_BINFO (t
))
6352 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6354 /* Set DECL_VINDEX for all functions declared in this class. */
6355 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6357 fn
= TREE_CHAIN (fn
),
6358 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6359 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6361 tree fndecl
= BV_FN (fn
);
6363 if (DECL_THUNK_P (fndecl
))
6364 /* A thunk. We should never be calling this entry directly
6365 from this vtable -- we'd use the entry for the non
6366 thunk base function. */
6367 DECL_VINDEX (fndecl
) = NULL_TREE
;
6368 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6369 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6373 finish_struct_bits (t
);
6374 set_method_tm_attributes (t
);
6376 /* Complete the rtl for any static member objects of the type we're
6378 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6379 if (VAR_P (x
) && TREE_STATIC (x
)
6380 && TREE_TYPE (x
) != error_mark_node
6381 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6382 DECL_MODE (x
) = TYPE_MODE (t
);
6384 /* Done with FIELDS...now decide whether to sort these for
6385 faster lookups later.
6387 We use a small number because most searches fail (succeeding
6388 ultimately as the search bores through the inheritance
6389 hierarchy), and we want this failure to occur quickly. */
6391 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6393 /* Complain if one of the field types requires lower visibility. */
6394 constrain_class_visibility (t
);
6396 /* Make the rtl for any new vtables we have created, and unmark
6397 the base types we marked. */
6400 /* Build the VTT for T. */
6403 /* This warning does not make sense for Java classes, since they
6404 cannot have destructors. */
6405 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
))
6409 dtor
= CLASSTYPE_DESTRUCTORS (t
);
6410 if (/* An implicitly declared destructor is always public. And,
6411 if it were virtual, we would have created it by now. */
6413 || (!DECL_VINDEX (dtor
)
6414 && (/* public non-virtual */
6415 (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
6416 || (/* non-public non-virtual with friends */
6417 (TREE_PRIVATE (dtor
) || TREE_PROTECTED (dtor
))
6418 && (CLASSTYPE_FRIEND_CLASSES (t
)
6419 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))))))
6420 warning (OPT_Wnon_virtual_dtor
,
6421 "%q#T has virtual functions and accessible"
6422 " non-virtual destructor", t
);
6427 if (warn_overloaded_virtual
)
6430 /* Class layout, assignment of virtual table slots, etc., is now
6431 complete. Give the back end a chance to tweak the visibility of
6432 the class or perform any other required target modifications. */
6433 targetm
.cxx
.adjust_class_at_definition (t
);
6435 maybe_suppress_debug_info (t
);
6437 dump_class_hierarchy (t
);
6439 /* Finish debugging output for this type. */
6440 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6442 if (TYPE_TRANSPARENT_AGGR (t
))
6444 tree field
= first_field (t
);
6445 if (field
== NULL_TREE
|| error_operand_p (field
))
6447 error ("type transparent %q#T does not have any fields", t
);
6448 TYPE_TRANSPARENT_AGGR (t
) = 0;
6450 else if (DECL_ARTIFICIAL (field
))
6452 if (DECL_FIELD_IS_BASE (field
))
6453 error ("type transparent class %qT has base classes", t
);
6456 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6457 error ("type transparent class %qT has virtual functions", t
);
6459 TYPE_TRANSPARENT_AGGR (t
) = 0;
6461 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6463 error ("type transparent %q#T cannot be made transparent because "
6464 "the type of the first field has a different ABI from the "
6465 "class overall", t
);
6466 TYPE_TRANSPARENT_AGGR (t
) = 0;
6471 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6472 equal to THRESHOLD or greater than THRESHOLD. */
6475 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6477 int n_fields
= count_fields (fields
);
6478 if (n_fields
>= threshold
)
6480 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6481 add_fields_to_record_type (fields
, field_vec
, 0);
6482 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6483 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6487 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6490 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6492 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6497 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6498 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6500 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6501 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6503 add_enum_fields_to_record_type (enumtype
, field_vec
,
6504 sorted_fields
->len
);
6505 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6506 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6510 /* When T was built up, the member declarations were added in reverse
6511 order. Rearrange them to declaration order. */
6514 unreverse_member_declarations (tree t
)
6520 /* The following lists are all in reverse order. Put them in
6521 declaration order now. */
6522 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6523 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6525 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6526 reverse order, so we can't just use nreverse. */
6528 for (x
= TYPE_FIELDS (t
);
6529 x
&& TREE_CODE (x
) != TYPE_DECL
;
6532 next
= DECL_CHAIN (x
);
6533 DECL_CHAIN (x
) = prev
;
6538 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6540 TYPE_FIELDS (t
) = prev
;
6545 finish_struct (tree t
, tree attributes
)
6547 location_t saved_loc
= input_location
;
6549 /* Now that we've got all the field declarations, reverse everything
6551 unreverse_member_declarations (t
);
6553 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6555 /* Nadger the current location so that diagnostics point to the start of
6556 the struct, not the end. */
6557 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6559 if (processing_template_decl
)
6563 finish_struct_methods (t
);
6564 TYPE_SIZE (t
) = bitsize_zero_node
;
6565 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6567 /* We need to emit an error message if this type was used as a parameter
6568 and it is an abstract type, even if it is a template. We construct
6569 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6570 account and we call complete_vars with this type, which will check
6571 the PARM_DECLS. Note that while the type is being defined,
6572 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6573 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6574 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6575 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6576 if (DECL_PURE_VIRTUAL_P (x
))
6577 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6579 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6580 an enclosing scope is a template class, so that this function be
6581 found by lookup_fnfields_1 when the using declaration is not
6582 instantiated yet. */
6583 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6584 if (TREE_CODE (x
) == USING_DECL
)
6586 tree fn
= strip_using_decl (x
);
6587 if (is_overloaded_fn (fn
))
6588 for (; fn
; fn
= OVL_NEXT (fn
))
6589 add_method (t
, OVL_CURRENT (fn
), x
);
6592 /* Remember current #pragma pack value. */
6593 TYPE_PRECISION (t
) = maximum_field_alignment
;
6595 /* Fix up any variants we've already built. */
6596 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6598 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6599 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6600 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6601 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6605 finish_struct_1 (t
);
6607 input_location
= saved_loc
;
6609 TYPE_BEING_DEFINED (t
) = 0;
6611 if (current_class_type
)
6614 error ("trying to finish struct, but kicked out due to previous parse errors");
6616 if (processing_template_decl
&& at_function_scope_p ()
6617 /* Lambdas are defined by the LAMBDA_EXPR. */
6618 && !LAMBDA_TYPE_P (t
))
6619 add_stmt (build_min (TAG_DEFN
, t
));
6624 /* Hash table to avoid endless recursion when handling references. */
6625 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6627 /* Return the dynamic type of INSTANCE, if known.
6628 Used to determine whether the virtual function table is needed
6631 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6632 of our knowledge of its type. *NONNULL should be initialized
6633 before this function is called. */
6636 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6638 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6640 switch (TREE_CODE (instance
))
6643 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6646 return RECUR (TREE_OPERAND (instance
, 0));
6649 /* This is a call to a constructor, hence it's never zero. */
6650 if (TREE_HAS_CONSTRUCTOR (instance
))
6654 return TREE_TYPE (instance
);
6659 /* This is a call to a constructor, hence it's never zero. */
6660 if (TREE_HAS_CONSTRUCTOR (instance
))
6664 return TREE_TYPE (instance
);
6666 return RECUR (TREE_OPERAND (instance
, 0));
6668 case POINTER_PLUS_EXPR
:
6671 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6672 return RECUR (TREE_OPERAND (instance
, 0));
6673 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6674 /* Propagate nonnull. */
6675 return RECUR (TREE_OPERAND (instance
, 0));
6680 return RECUR (TREE_OPERAND (instance
, 0));
6683 instance
= TREE_OPERAND (instance
, 0);
6686 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6687 with a real object -- given &p->f, p can still be null. */
6688 tree t
= get_base_address (instance
);
6689 /* ??? Probably should check DECL_WEAK here. */
6690 if (t
&& DECL_P (t
))
6693 return RECUR (instance
);
6696 /* If this component is really a base class reference, then the field
6697 itself isn't definitive. */
6698 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6699 return RECUR (TREE_OPERAND (instance
, 0));
6700 return RECUR (TREE_OPERAND (instance
, 1));
6704 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6705 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6709 return TREE_TYPE (TREE_TYPE (instance
));
6711 /* fall through... */
6715 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6719 return TREE_TYPE (instance
);
6721 else if (instance
== current_class_ptr
)
6726 /* if we're in a ctor or dtor, we know our type. If
6727 current_class_ptr is set but we aren't in a function, we're in
6728 an NSDMI (and therefore a constructor). */
6729 if (current_scope () != current_function_decl
6730 || (DECL_LANG_SPECIFIC (current_function_decl
)
6731 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6732 || DECL_DESTRUCTOR_P (current_function_decl
))))
6736 return TREE_TYPE (TREE_TYPE (instance
));
6739 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6741 /* We only need one hash table because it is always left empty. */
6742 if (!fixed_type_or_null_ref_ht
.is_created ())
6743 fixed_type_or_null_ref_ht
.create (37);
6745 /* Reference variables should be references to objects. */
6749 /* Enter the INSTANCE in a table to prevent recursion; a
6750 variable's initializer may refer to the variable
6752 if (VAR_P (instance
)
6753 && DECL_INITIAL (instance
)
6754 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6755 && !fixed_type_or_null_ref_ht
.find (instance
))
6760 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6762 type
= RECUR (DECL_INITIAL (instance
));
6763 fixed_type_or_null_ref_ht
.remove_elt (instance
);
6776 /* Return nonzero if the dynamic type of INSTANCE is known, and
6777 equivalent to the static type. We also handle the case where
6778 INSTANCE is really a pointer. Return negative if this is a
6779 ctor/dtor. There the dynamic type is known, but this might not be
6780 the most derived base of the original object, and hence virtual
6781 bases may not be layed out according to this type.
6783 Used to determine whether the virtual function table is needed
6786 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6787 of our knowledge of its type. *NONNULL should be initialized
6788 before this function is called. */
6791 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6793 tree t
= TREE_TYPE (instance
);
6797 /* processing_template_decl can be false in a template if we're in
6798 fold_non_dependent_expr, but we still want to suppress this check. */
6799 if (in_template_function ())
6801 /* In a template we only care about the type of the result. */
6807 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6808 if (fixed
== NULL_TREE
)
6810 if (POINTER_TYPE_P (t
))
6812 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6814 return cdtorp
? -1 : 1;
6819 init_class_processing (void)
6821 current_class_depth
= 0;
6822 current_class_stack_size
= 10;
6824 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6825 vec_alloc (local_classes
, 8);
6826 sizeof_biggest_empty_class
= size_zero_node
;
6828 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6829 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6830 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6833 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6836 restore_class_cache (void)
6840 /* We are re-entering the same class we just left, so we don't
6841 have to search the whole inheritance matrix to find all the
6842 decls to bind again. Instead, we install the cached
6843 class_shadowed list and walk through it binding names. */
6844 push_binding_level (previous_class_level
);
6845 class_binding_level
= previous_class_level
;
6846 /* Restore IDENTIFIER_TYPE_VALUE. */
6847 for (type
= class_binding_level
->type_shadowed
;
6849 type
= TREE_CHAIN (type
))
6850 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6853 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6854 appropriate for TYPE.
6856 So that we may avoid calls to lookup_name, we cache the _TYPE
6857 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6859 For multiple inheritance, we perform a two-pass depth-first search
6860 of the type lattice. */
6863 pushclass (tree type
)
6865 class_stack_node_t csn
;
6867 type
= TYPE_MAIN_VARIANT (type
);
6869 /* Make sure there is enough room for the new entry on the stack. */
6870 if (current_class_depth
+ 1 >= current_class_stack_size
)
6872 current_class_stack_size
*= 2;
6874 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
6875 current_class_stack_size
);
6878 /* Insert a new entry on the class stack. */
6879 csn
= current_class_stack
+ current_class_depth
;
6880 csn
->name
= current_class_name
;
6881 csn
->type
= current_class_type
;
6882 csn
->access
= current_access_specifier
;
6883 csn
->names_used
= 0;
6885 current_class_depth
++;
6887 /* Now set up the new type. */
6888 current_class_name
= TYPE_NAME (type
);
6889 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
6890 current_class_name
= DECL_NAME (current_class_name
);
6891 current_class_type
= type
;
6893 /* By default, things in classes are private, while things in
6894 structures or unions are public. */
6895 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
6896 ? access_private_node
6897 : access_public_node
);
6899 if (previous_class_level
6900 && type
!= previous_class_level
->this_entity
6901 && current_class_depth
== 1)
6903 /* Forcibly remove any old class remnants. */
6904 invalidate_class_lookup_cache ();
6907 if (!previous_class_level
6908 || type
!= previous_class_level
->this_entity
6909 || current_class_depth
> 1)
6912 restore_class_cache ();
6915 /* When we exit a toplevel class scope, we save its binding level so
6916 that we can restore it quickly. Here, we've entered some other
6917 class, so we must invalidate our cache. */
6920 invalidate_class_lookup_cache (void)
6922 previous_class_level
= NULL
;
6925 /* Get out of the current class scope. If we were in a class scope
6926 previously, that is the one popped to. */
6933 current_class_depth
--;
6934 current_class_name
= current_class_stack
[current_class_depth
].name
;
6935 current_class_type
= current_class_stack
[current_class_depth
].type
;
6936 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
6937 if (current_class_stack
[current_class_depth
].names_used
)
6938 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
6941 /* Mark the top of the class stack as hidden. */
6944 push_class_stack (void)
6946 if (current_class_depth
)
6947 ++current_class_stack
[current_class_depth
- 1].hidden
;
6950 /* Mark the top of the class stack as un-hidden. */
6953 pop_class_stack (void)
6955 if (current_class_depth
)
6956 --current_class_stack
[current_class_depth
- 1].hidden
;
6959 /* Returns 1 if the class type currently being defined is either T or
6960 a nested type of T. */
6963 currently_open_class (tree t
)
6967 if (!CLASS_TYPE_P (t
))
6970 t
= TYPE_MAIN_VARIANT (t
);
6972 /* We start looking from 1 because entry 0 is from global scope,
6974 for (i
= current_class_depth
; i
> 0; --i
)
6977 if (i
== current_class_depth
)
6978 c
= current_class_type
;
6981 if (current_class_stack
[i
].hidden
)
6983 c
= current_class_stack
[i
].type
;
6987 if (same_type_p (c
, t
))
6993 /* If either current_class_type or one of its enclosing classes are derived
6994 from T, return the appropriate type. Used to determine how we found
6995 something via unqualified lookup. */
6998 currently_open_derived_class (tree t
)
7002 /* The bases of a dependent type are unknown. */
7003 if (dependent_type_p (t
))
7006 if (!current_class_type
)
7009 if (DERIVED_FROM_P (t
, current_class_type
))
7010 return current_class_type
;
7012 for (i
= current_class_depth
- 1; i
> 0; --i
)
7014 if (current_class_stack
[i
].hidden
)
7016 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7017 return current_class_stack
[i
].type
;
7023 /* Returns the innermost class type which is not a lambda closure type. */
7026 current_nonlambda_class_type (void)
7030 /* We start looking from 1 because entry 0 is from global scope,
7032 for (i
= current_class_depth
; i
> 0; --i
)
7035 if (i
== current_class_depth
)
7036 c
= current_class_type
;
7039 if (current_class_stack
[i
].hidden
)
7041 c
= current_class_stack
[i
].type
;
7045 if (!LAMBDA_TYPE_P (c
))
7051 /* When entering a class scope, all enclosing class scopes' names with
7052 static meaning (static variables, static functions, types and
7053 enumerators) have to be visible. This recursive function calls
7054 pushclass for all enclosing class contexts until global or a local
7055 scope is reached. TYPE is the enclosed class. */
7058 push_nested_class (tree type
)
7060 /* A namespace might be passed in error cases, like A::B:C. */
7061 if (type
== NULL_TREE
7062 || !CLASS_TYPE_P (type
))
7065 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7070 /* Undoes a push_nested_class call. */
7073 pop_nested_class (void)
7075 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7078 if (context
&& CLASS_TYPE_P (context
))
7079 pop_nested_class ();
7082 /* Returns the number of extern "LANG" blocks we are nested within. */
7085 current_lang_depth (void)
7087 return vec_safe_length (current_lang_base
);
7090 /* Set global variables CURRENT_LANG_NAME to appropriate value
7091 so that behavior of name-mangling machinery is correct. */
7094 push_lang_context (tree name
)
7096 vec_safe_push (current_lang_base
, current_lang_name
);
7098 if (name
== lang_name_cplusplus
)
7100 current_lang_name
= name
;
7102 else if (name
== lang_name_java
)
7104 current_lang_name
= name
;
7105 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7106 (See record_builtin_java_type in decl.c.) However, that causes
7107 incorrect debug entries if these types are actually used.
7108 So we re-enable debug output after extern "Java". */
7109 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7110 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7111 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7112 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7113 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7114 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7115 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7116 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7118 else if (name
== lang_name_c
)
7120 current_lang_name
= name
;
7123 error ("language string %<\"%E\"%> not recognized", name
);
7126 /* Get out of the current language scope. */
7129 pop_lang_context (void)
7131 current_lang_name
= current_lang_base
->pop ();
7134 /* Type instantiation routines. */
7136 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7137 matches the TARGET_TYPE. If there is no satisfactory match, return
7138 error_mark_node, and issue an error & warning messages under
7139 control of FLAGS. Permit pointers to member function if FLAGS
7140 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7141 a template-id, and EXPLICIT_TARGS are the explicitly provided
7144 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7145 is the base path used to reference those member functions. If
7146 the address is resolved to a member function, access checks will be
7147 performed and errors issued if appropriate. */
7150 resolve_address_of_overloaded_function (tree target_type
,
7152 tsubst_flags_t flags
,
7154 tree explicit_targs
,
7157 /* Here's what the standard says:
7161 If the name is a function template, template argument deduction
7162 is done, and if the argument deduction succeeds, the deduced
7163 arguments are used to generate a single template function, which
7164 is added to the set of overloaded functions considered.
7166 Non-member functions and static member functions match targets of
7167 type "pointer-to-function" or "reference-to-function." Nonstatic
7168 member functions match targets of type "pointer-to-member
7169 function;" the function type of the pointer to member is used to
7170 select the member function from the set of overloaded member
7171 functions. If a nonstatic member function is selected, the
7172 reference to the overloaded function name is required to have the
7173 form of a pointer to member as described in 5.3.1.
7175 If more than one function is selected, any template functions in
7176 the set are eliminated if the set also contains a non-template
7177 function, and any given template function is eliminated if the
7178 set contains a second template function that is more specialized
7179 than the first according to the partial ordering rules 14.5.5.2.
7180 After such eliminations, if any, there shall remain exactly one
7181 selected function. */
7184 /* We store the matches in a TREE_LIST rooted here. The functions
7185 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7186 interoperability with most_specialized_instantiation. */
7187 tree matches
= NULL_TREE
;
7189 tree target_fn_type
;
7191 /* By the time we get here, we should be seeing only real
7192 pointer-to-member types, not the internal POINTER_TYPE to
7193 METHOD_TYPE representation. */
7194 gcc_assert (!TYPE_PTR_P (target_type
)
7195 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7197 gcc_assert (is_overloaded_fn (overload
));
7199 /* Check that the TARGET_TYPE is reasonable. */
7200 if (TYPE_PTRFN_P (target_type
)
7201 || TYPE_REFFN_P (target_type
))
7203 else if (TYPE_PTRMEMFUNC_P (target_type
))
7204 /* This is OK, too. */
7206 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7207 /* This is OK, too. This comes from a conversion to reference
7209 target_type
= build_reference_type (target_type
);
7212 if (flags
& tf_error
)
7213 error ("cannot resolve overloaded function %qD based on"
7214 " conversion to type %qT",
7215 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7216 return error_mark_node
;
7219 /* Non-member functions and static member functions match targets of type
7220 "pointer-to-function" or "reference-to-function." Nonstatic member
7221 functions match targets of type "pointer-to-member-function;" the
7222 function type of the pointer to member is used to select the member
7223 function from the set of overloaded member functions.
7225 So figure out the FUNCTION_TYPE that we want to match against. */
7226 target_fn_type
= static_fn_type (target_type
);
7228 /* If we can find a non-template function that matches, we can just
7229 use it. There's no point in generating template instantiations
7230 if we're just going to throw them out anyhow. But, of course, we
7231 can only do this when we don't *need* a template function. */
7236 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7238 tree fn
= OVL_CURRENT (fns
);
7240 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7241 /* We're not looking for templates just yet. */
7244 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7246 /* We're looking for a non-static member, and this isn't
7247 one, or vice versa. */
7250 /* Ignore functions which haven't been explicitly
7252 if (DECL_ANTICIPATED (fn
))
7255 /* See if there's a match. */
7256 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7257 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7261 /* Now, if we've already got a match (or matches), there's no need
7262 to proceed to the template functions. But, if we don't have a
7263 match we need to look at them, too. */
7266 tree target_arg_types
;
7267 tree target_ret_type
;
7270 unsigned int nargs
, ia
;
7273 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7274 target_ret_type
= TREE_TYPE (target_fn_type
);
7276 nargs
= list_length (target_arg_types
);
7277 args
= XALLOCAVEC (tree
, nargs
);
7278 for (arg
= target_arg_types
, ia
= 0;
7279 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7280 arg
= TREE_CHAIN (arg
), ++ia
)
7281 args
[ia
] = TREE_VALUE (arg
);
7284 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7286 tree fn
= OVL_CURRENT (fns
);
7290 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7291 /* We're only looking for templates. */
7294 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7296 /* We're not looking for a non-static member, and this is
7297 one, or vice versa. */
7300 tree ret
= target_ret_type
;
7302 /* If the template has a deduced return type, don't expose it to
7303 template argument deduction. */
7304 if (undeduced_auto_decl (fn
))
7307 /* Try to do argument deduction. */
7308 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7309 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7311 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7313 if (instantiation
== error_mark_node
)
7314 /* Instantiation failed. */
7317 /* And now force instantiation to do return type deduction. */
7318 if (undeduced_auto_decl (instantiation
))
7321 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7324 require_deduced_type (instantiation
);
7327 /* See if there's a match. */
7328 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7329 matches
= tree_cons (instantiation
, fn
, matches
);
7334 /* Now, remove all but the most specialized of the matches. */
7337 tree match
= most_specialized_instantiation (matches
);
7339 if (match
!= error_mark_node
)
7340 matches
= tree_cons (TREE_PURPOSE (match
),
7346 /* Now we should have exactly one function in MATCHES. */
7347 if (matches
== NULL_TREE
)
7349 /* There were *no* matches. */
7350 if (flags
& tf_error
)
7352 error ("no matches converting function %qD to type %q#T",
7353 DECL_NAME (OVL_CURRENT (overload
)),
7356 print_candidates (overload
);
7358 return error_mark_node
;
7360 else if (TREE_CHAIN (matches
))
7362 /* There were too many matches. First check if they're all
7363 the same function. */
7364 tree match
= NULL_TREE
;
7366 fn
= TREE_PURPOSE (matches
);
7368 /* For multi-versioned functions, more than one match is just fine and
7369 decls_match will return false as they are different. */
7370 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7371 if (!decls_match (fn
, TREE_PURPOSE (match
))
7372 && !targetm
.target_option
.function_versions
7373 (fn
, TREE_PURPOSE (match
)))
7378 if (flags
& tf_error
)
7380 error ("converting overloaded function %qD to type %q#T is ambiguous",
7381 DECL_NAME (OVL_FUNCTION (overload
)),
7384 /* Since print_candidates expects the functions in the
7385 TREE_VALUE slot, we flip them here. */
7386 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7387 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7389 print_candidates (matches
);
7392 return error_mark_node
;
7396 /* Good, exactly one match. Now, convert it to the correct type. */
7397 fn
= TREE_PURPOSE (matches
);
7399 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7400 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7402 static int explained
;
7404 if (!(flags
& tf_error
))
7405 return error_mark_node
;
7407 permerror (input_location
, "assuming pointer to member %qD", fn
);
7410 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7415 /* If a pointer to a function that is multi-versioned is requested, the
7416 pointer to the dispatcher function is returned instead. This works
7417 well because indirectly calling the function will dispatch the right
7418 function version at run-time. */
7419 if (DECL_FUNCTION_VERSIONED (fn
))
7421 fn
= get_function_version_dispatcher (fn
);
7423 return error_mark_node
;
7424 /* Mark all the versions corresponding to the dispatcher as used. */
7425 if (!(flags
& tf_conv
))
7426 mark_versions_used (fn
);
7429 /* If we're doing overload resolution purely for the purpose of
7430 determining conversion sequences, we should not consider the
7431 function used. If this conversion sequence is selected, the
7432 function will be marked as used at this point. */
7433 if (!(flags
& tf_conv
))
7435 /* Make =delete work with SFINAE. */
7436 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7437 return error_mark_node
;
7442 /* We could not check access to member functions when this
7443 expression was originally created since we did not know at that
7444 time to which function the expression referred. */
7445 if (DECL_FUNCTION_MEMBER_P (fn
))
7447 gcc_assert (access_path
);
7448 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7451 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7452 return cp_build_addr_expr (fn
, flags
);
7455 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7456 will mark the function as addressed, but here we must do it
7458 cxx_mark_addressable (fn
);
7464 /* This function will instantiate the type of the expression given in
7465 RHS to match the type of LHSTYPE. If errors exist, then return
7466 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7467 we complain on errors. If we are not complaining, never modify rhs,
7468 as overload resolution wants to try many possible instantiations, in
7469 the hope that at least one will work.
7471 For non-recursive calls, LHSTYPE should be a function, pointer to
7472 function, or a pointer to member function. */
7475 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7477 tsubst_flags_t flags_in
= flags
;
7478 tree access_path
= NULL_TREE
;
7480 flags
&= ~tf_ptrmem_ok
;
7482 if (lhstype
== unknown_type_node
)
7484 if (flags
& tf_error
)
7485 error ("not enough type information");
7486 return error_mark_node
;
7489 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7491 tree fntype
= non_reference (lhstype
);
7492 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7494 if (flag_ms_extensions
7495 && TYPE_PTRMEMFUNC_P (fntype
)
7496 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7497 /* Microsoft allows `A::f' to be resolved to a
7498 pointer-to-member. */
7502 if (flags
& tf_error
)
7503 error ("cannot convert %qE from type %qT to type %qT",
7504 rhs
, TREE_TYPE (rhs
), fntype
);
7505 return error_mark_node
;
7509 if (BASELINK_P (rhs
))
7511 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7512 rhs
= BASELINK_FUNCTIONS (rhs
);
7515 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7516 deduce any type information. */
7517 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7519 if (flags
& tf_error
)
7520 error ("not enough type information");
7521 return error_mark_node
;
7524 /* There only a few kinds of expressions that may have a type
7525 dependent on overload resolution. */
7526 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7527 || TREE_CODE (rhs
) == COMPONENT_REF
7528 || really_overloaded_fn (rhs
)
7529 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7531 /* This should really only be used when attempting to distinguish
7532 what sort of a pointer to function we have. For now, any
7533 arithmetic operation which is not supported on pointers
7534 is rejected as an error. */
7536 switch (TREE_CODE (rhs
))
7540 tree member
= TREE_OPERAND (rhs
, 1);
7542 member
= instantiate_type (lhstype
, member
, flags
);
7543 if (member
!= error_mark_node
7544 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7545 /* Do not lose object's side effects. */
7546 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7547 TREE_OPERAND (rhs
, 0), member
);
7552 rhs
= TREE_OPERAND (rhs
, 1);
7553 if (BASELINK_P (rhs
))
7554 return instantiate_type (lhstype
, rhs
, flags_in
);
7556 /* This can happen if we are forming a pointer-to-member for a
7558 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7562 case TEMPLATE_ID_EXPR
:
7564 tree fns
= TREE_OPERAND (rhs
, 0);
7565 tree args
= TREE_OPERAND (rhs
, 1);
7568 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7569 /*template_only=*/true,
7576 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7577 /*template_only=*/false,
7578 /*explicit_targs=*/NULL_TREE
,
7583 if (PTRMEM_OK_P (rhs
))
7584 flags
|= tf_ptrmem_ok
;
7586 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7590 return error_mark_node
;
7595 return error_mark_node
;
7598 /* Return the name of the virtual function pointer field
7599 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7600 this may have to look back through base types to find the
7601 ultimate field name. (For single inheritance, these could
7602 all be the same name. Who knows for multiple inheritance). */
7605 get_vfield_name (tree type
)
7607 tree binfo
, base_binfo
;
7610 for (binfo
= TYPE_BINFO (type
);
7611 BINFO_N_BASE_BINFOS (binfo
);
7614 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7616 if (BINFO_VIRTUAL_P (base_binfo
)
7617 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7621 type
= BINFO_TYPE (binfo
);
7622 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7623 + TYPE_NAME_LENGTH (type
) + 2);
7624 sprintf (buf
, VFIELD_NAME_FORMAT
,
7625 IDENTIFIER_POINTER (constructor_name (type
)));
7626 return get_identifier (buf
);
7630 print_class_statistics (void)
7632 if (! GATHER_STATISTICS
)
7635 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7636 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7639 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7640 n_vtables
, n_vtable_searches
);
7641 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7642 n_vtable_entries
, n_vtable_elems
);
7646 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7647 according to [class]:
7648 The class-name is also inserted
7649 into the scope of the class itself. For purposes of access checking,
7650 the inserted class name is treated as if it were a public member name. */
7653 build_self_reference (void)
7655 tree name
= constructor_name (current_class_type
);
7656 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7659 DECL_NONLOCAL (value
) = 1;
7660 DECL_CONTEXT (value
) = current_class_type
;
7661 DECL_ARTIFICIAL (value
) = 1;
7662 SET_DECL_SELF_REFERENCE_P (value
);
7663 set_underlying_type (value
);
7665 if (processing_template_decl
)
7666 value
= push_template_decl (value
);
7668 saved_cas
= current_access_specifier
;
7669 current_access_specifier
= access_public_node
;
7670 finish_member_declaration (value
);
7671 current_access_specifier
= saved_cas
;
7674 /* Returns 1 if TYPE contains only padding bytes. */
7677 is_empty_class (tree type
)
7679 if (type
== error_mark_node
)
7682 if (! CLASS_TYPE_P (type
))
7685 /* In G++ 3.2, whether or not a class was empty was determined by
7686 looking at its size. */
7687 if (abi_version_at_least (2))
7688 return CLASSTYPE_EMPTY_P (type
);
7690 return integer_zerop (CLASSTYPE_SIZE (type
));
7693 /* Returns true if TYPE contains an empty class. */
7696 contains_empty_class_p (tree type
)
7698 if (is_empty_class (type
))
7700 if (CLASS_TYPE_P (type
))
7707 for (binfo
= TYPE_BINFO (type
), i
= 0;
7708 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7709 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7711 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7712 if (TREE_CODE (field
) == FIELD_DECL
7713 && !DECL_ARTIFICIAL (field
)
7714 && is_empty_class (TREE_TYPE (field
)))
7717 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7718 return contains_empty_class_p (TREE_TYPE (type
));
7722 /* Returns true if TYPE contains no actual data, just various
7723 possible combinations of empty classes and possibly a vptr. */
7726 is_really_empty_class (tree type
)
7728 if (CLASS_TYPE_P (type
))
7735 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7736 out, but we'd like to be able to check this before then. */
7737 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7740 for (binfo
= TYPE_BINFO (type
), i
= 0;
7741 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7742 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7744 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7745 if (TREE_CODE (field
) == FIELD_DECL
7746 && !DECL_ARTIFICIAL (field
)
7747 && !is_really_empty_class (TREE_TYPE (field
)))
7751 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7752 return is_really_empty_class (TREE_TYPE (type
));
7756 /* Note that NAME was looked up while the current class was being
7757 defined and that the result of that lookup was DECL. */
7760 maybe_note_name_used_in_class (tree name
, tree decl
)
7762 splay_tree names_used
;
7764 /* If we're not defining a class, there's nothing to do. */
7765 if (!(innermost_scope_kind() == sk_class
7766 && TYPE_BEING_DEFINED (current_class_type
)
7767 && !LAMBDA_TYPE_P (current_class_type
)))
7770 /* If there's already a binding for this NAME, then we don't have
7771 anything to worry about. */
7772 if (lookup_member (current_class_type
, name
,
7773 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7776 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7777 current_class_stack
[current_class_depth
- 1].names_used
7778 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7779 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7781 splay_tree_insert (names_used
,
7782 (splay_tree_key
) name
,
7783 (splay_tree_value
) decl
);
7786 /* Note that NAME was declared (as DECL) in the current class. Check
7787 to see that the declaration is valid. */
7790 note_name_declared_in_class (tree name
, tree decl
)
7792 splay_tree names_used
;
7795 /* Look to see if we ever used this name. */
7797 = current_class_stack
[current_class_depth
- 1].names_used
;
7800 /* The C language allows members to be declared with a type of the same
7801 name, and the C++ standard says this diagnostic is not required. So
7802 allow it in extern "C" blocks unless predantic is specified.
7803 Allow it in all cases if -ms-extensions is specified. */
7804 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7805 || flag_ms_extensions
)
7807 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7810 /* [basic.scope.class]
7812 A name N used in a class S shall refer to the same declaration
7813 in its context and when re-evaluated in the completed scope of
7815 permerror (input_location
, "declaration of %q#D", decl
);
7816 permerror (input_location
, "changes meaning of %qD from %q+#D",
7817 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7821 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7822 Secondary vtables are merged with primary vtables; this function
7823 will return the VAR_DECL for the primary vtable. */
7826 get_vtbl_decl_for_binfo (tree binfo
)
7830 decl
= BINFO_VTABLE (binfo
);
7831 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7833 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7834 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7837 gcc_assert (VAR_P (decl
));
7842 /* Returns the binfo for the primary base of BINFO. If the resulting
7843 BINFO is a virtual base, and it is inherited elsewhere in the
7844 hierarchy, then the returned binfo might not be the primary base of
7845 BINFO in the complete object. Check BINFO_PRIMARY_P or
7846 BINFO_LOST_PRIMARY_P to be sure. */
7849 get_primary_binfo (tree binfo
)
7853 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
7857 return copied_binfo (primary_base
, binfo
);
7860 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7863 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
7866 fprintf (stream
, "%*s", indent
, "");
7870 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7871 INDENT should be zero when called from the top level; it is
7872 incremented recursively. IGO indicates the next expected BINFO in
7873 inheritance graph ordering. */
7876 dump_class_hierarchy_r (FILE *stream
,
7886 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
7887 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
7888 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
7889 (HOST_WIDE_INT
) (uintptr_t) binfo
);
7892 fprintf (stream
, "alternative-path\n");
7895 igo
= TREE_CHAIN (binfo
);
7897 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
7898 tree_low_cst (BINFO_OFFSET (binfo
), 0));
7899 if (is_empty_class (BINFO_TYPE (binfo
)))
7900 fprintf (stream
, " empty");
7901 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
7902 fprintf (stream
, " nearly-empty");
7903 if (BINFO_VIRTUAL_P (binfo
))
7904 fprintf (stream
, " virtual");
7905 fprintf (stream
, "\n");
7908 if (BINFO_PRIMARY_P (binfo
))
7910 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7911 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
7912 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
7913 TFF_PLAIN_IDENTIFIER
),
7914 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
7916 if (BINFO_LOST_PRIMARY_P (binfo
))
7918 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7919 fprintf (stream
, " lost-primary");
7922 fprintf (stream
, "\n");
7924 if (!(flags
& TDF_SLIM
))
7928 if (BINFO_SUBVTT_INDEX (binfo
))
7930 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7931 fprintf (stream
, " subvttidx=%s",
7932 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
7933 TFF_PLAIN_IDENTIFIER
));
7935 if (BINFO_VPTR_INDEX (binfo
))
7937 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7938 fprintf (stream
, " vptridx=%s",
7939 expr_as_string (BINFO_VPTR_INDEX (binfo
),
7940 TFF_PLAIN_IDENTIFIER
));
7942 if (BINFO_VPTR_FIELD (binfo
))
7944 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7945 fprintf (stream
, " vbaseoffset=%s",
7946 expr_as_string (BINFO_VPTR_FIELD (binfo
),
7947 TFF_PLAIN_IDENTIFIER
));
7949 if (BINFO_VTABLE (binfo
))
7951 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7952 fprintf (stream
, " vptr=%s",
7953 expr_as_string (BINFO_VTABLE (binfo
),
7954 TFF_PLAIN_IDENTIFIER
));
7958 fprintf (stream
, "\n");
7961 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
7962 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
7967 /* Dump the BINFO hierarchy for T. */
7970 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
7972 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
7973 fprintf (stream
, " size=%lu align=%lu\n",
7974 (unsigned long)(tree_low_cst (TYPE_SIZE (t
), 0) / BITS_PER_UNIT
),
7975 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
7976 fprintf (stream
, " base size=%lu base align=%lu\n",
7977 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)), 0)
7979 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
7981 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
7982 fprintf (stream
, "\n");
7985 /* Debug interface to hierarchy dumping. */
7988 debug_class (tree t
)
7990 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
7994 dump_class_hierarchy (tree t
)
7997 FILE *stream
= dump_begin (TDI_class
, &flags
);
8001 dump_class_hierarchy_1 (stream
, flags
, t
);
8002 dump_end (TDI_class
, stream
);
8007 dump_array (FILE * stream
, tree decl
)
8010 unsigned HOST_WIDE_INT ix
;
8012 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8014 elt
= (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))), 0)
8016 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8017 fprintf (stream
, " %s entries",
8018 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8019 TFF_PLAIN_IDENTIFIER
));
8020 fprintf (stream
, "\n");
8022 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8024 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8025 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8029 dump_vtable (tree t
, tree binfo
, tree vtable
)
8032 FILE *stream
= dump_begin (TDI_class
, &flags
);
8037 if (!(flags
& TDF_SLIM
))
8039 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8041 fprintf (stream
, "%s for %s",
8042 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8043 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8046 if (!BINFO_VIRTUAL_P (binfo
))
8047 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8048 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8049 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8051 fprintf (stream
, "\n");
8052 dump_array (stream
, vtable
);
8053 fprintf (stream
, "\n");
8056 dump_end (TDI_class
, stream
);
8060 dump_vtt (tree t
, tree vtt
)
8063 FILE *stream
= dump_begin (TDI_class
, &flags
);
8068 if (!(flags
& TDF_SLIM
))
8070 fprintf (stream
, "VTT for %s\n",
8071 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8072 dump_array (stream
, vtt
);
8073 fprintf (stream
, "\n");
8076 dump_end (TDI_class
, stream
);
8079 /* Dump a function or thunk and its thunkees. */
8082 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8084 static const char spaces
[] = " ";
8085 tree name
= DECL_NAME (thunk
);
8088 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8090 !DECL_THUNK_P (thunk
) ? "function"
8091 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8092 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8093 if (DECL_THUNK_P (thunk
))
8095 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8096 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8098 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8099 if (!virtual_adjust
)
8101 else if (DECL_THIS_THUNK_P (thunk
))
8102 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8103 tree_low_cst (virtual_adjust
, 0));
8105 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8106 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust
), 0),
8107 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8108 if (THUNK_ALIAS (thunk
))
8109 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8111 fprintf (stream
, "\n");
8112 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8113 dump_thunk (stream
, indent
+ 2, thunks
);
8116 /* Dump the thunks for FN. */
8119 debug_thunks (tree fn
)
8121 dump_thunk (stderr
, 0, fn
);
8124 /* Virtual function table initialization. */
8126 /* Create all the necessary vtables for T and its base classes. */
8129 finish_vtbls (tree t
)
8132 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8133 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8135 /* We lay out the primary and secondary vtables in one contiguous
8136 vtable. The primary vtable is first, followed by the non-virtual
8137 secondary vtables in inheritance graph order. */
8138 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8141 /* Then come the virtual bases, also in inheritance graph order. */
8142 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8144 if (!BINFO_VIRTUAL_P (vbase
))
8146 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8149 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8150 initialize_vtable (TYPE_BINFO (t
), v
);
8153 /* Initialize the vtable for BINFO with the INITS. */
8156 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8160 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8161 decl
= get_vtbl_decl_for_binfo (binfo
);
8162 initialize_artificial_var (decl
, inits
);
8163 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8166 /* Build the VTT (virtual table table) for T.
8167 A class requires a VTT if it has virtual bases.
8170 1 - primary virtual pointer for complete object T
8171 2 - secondary VTTs for each direct non-virtual base of T which requires a
8173 3 - secondary virtual pointers for each direct or indirect base of T which
8174 has virtual bases or is reachable via a virtual path from T.
8175 4 - secondary VTTs for each direct or indirect virtual base of T.
8177 Secondary VTTs look like complete object VTTs without part 4. */
8185 vec
<constructor_elt
, va_gc
> *inits
;
8187 /* Build up the initializers for the VTT. */
8189 index
= size_zero_node
;
8190 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8192 /* If we didn't need a VTT, we're done. */
8196 /* Figure out the type of the VTT. */
8197 type
= build_array_of_n_type (const_ptr_type_node
,
8200 /* Now, build the VTT object itself. */
8201 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8202 initialize_artificial_var (vtt
, inits
);
8203 /* Add the VTT to the vtables list. */
8204 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8205 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8210 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8211 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8212 and CHAIN the vtable pointer for this binfo after construction is
8213 complete. VALUE can also be another BINFO, in which case we recurse. */
8216 binfo_ctor_vtable (tree binfo
)
8222 vt
= BINFO_VTABLE (binfo
);
8223 if (TREE_CODE (vt
) == TREE_LIST
)
8224 vt
= TREE_VALUE (vt
);
8225 if (TREE_CODE (vt
) == TREE_BINFO
)
8234 /* Data for secondary VTT initialization. */
8235 typedef struct secondary_vptr_vtt_init_data_s
8237 /* Is this the primary VTT? */
8240 /* Current index into the VTT. */
8243 /* Vector of initializers built up. */
8244 vec
<constructor_elt
, va_gc
> *inits
;
8246 /* The type being constructed by this secondary VTT. */
8247 tree type_being_constructed
;
8248 } secondary_vptr_vtt_init_data
;
8250 /* Recursively build the VTT-initializer for BINFO (which is in the
8251 hierarchy dominated by T). INITS points to the end of the initializer
8252 list to date. INDEX is the VTT index where the next element will be
8253 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8254 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8255 for virtual bases of T. When it is not so, we build the constructor
8256 vtables for the BINFO-in-T variant. */
8259 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8265 secondary_vptr_vtt_init_data data
;
8266 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8268 /* We only need VTTs for subobjects with virtual bases. */
8269 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8272 /* We need to use a construction vtable if this is not the primary
8276 build_ctor_vtbl_group (binfo
, t
);
8278 /* Record the offset in the VTT where this sub-VTT can be found. */
8279 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8282 /* Add the address of the primary vtable for the complete object. */
8283 init
= binfo_ctor_vtable (binfo
);
8284 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8287 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8288 BINFO_VPTR_INDEX (binfo
) = *index
;
8290 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8292 /* Recursively add the secondary VTTs for non-virtual bases. */
8293 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8294 if (!BINFO_VIRTUAL_P (b
))
8295 build_vtt_inits (b
, t
, inits
, index
);
8297 /* Add secondary virtual pointers for all subobjects of BINFO with
8298 either virtual bases or reachable along a virtual path, except
8299 subobjects that are non-virtual primary bases. */
8300 data
.top_level_p
= top_level_p
;
8301 data
.index
= *index
;
8302 data
.inits
= *inits
;
8303 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8305 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8307 *index
= data
.index
;
8309 /* data.inits might have grown as we added secondary virtual pointers.
8310 Make sure our caller knows about the new vector. */
8311 *inits
= data
.inits
;
8314 /* Add the secondary VTTs for virtual bases in inheritance graph
8316 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8318 if (!BINFO_VIRTUAL_P (b
))
8321 build_vtt_inits (b
, t
, inits
, index
);
8324 /* Remove the ctor vtables we created. */
8325 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8328 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8329 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8332 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8334 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8336 /* We don't care about bases that don't have vtables. */
8337 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8338 return dfs_skip_bases
;
8340 /* We're only interested in proper subobjects of the type being
8342 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8345 /* We're only interested in bases with virtual bases or reachable
8346 via a virtual path from the type being constructed. */
8347 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8348 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8349 return dfs_skip_bases
;
8351 /* We're not interested in non-virtual primary bases. */
8352 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8355 /* Record the index where this secondary vptr can be found. */
8356 if (data
->top_level_p
)
8358 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8359 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8361 if (BINFO_VIRTUAL_P (binfo
))
8363 /* It's a primary virtual base, and this is not a
8364 construction vtable. Find the base this is primary of in
8365 the inheritance graph, and use that base's vtable
8367 while (BINFO_PRIMARY_P (binfo
))
8368 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8372 /* Add the initializer for the secondary vptr itself. */
8373 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8375 /* Advance the vtt index. */
8376 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8377 TYPE_SIZE_UNIT (ptr_type_node
));
8382 /* Called from build_vtt_inits via dfs_walk. After building
8383 constructor vtables and generating the sub-vtt from them, we need
8384 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8385 binfo of the base whose sub vtt was generated. */
8388 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8390 tree vtable
= BINFO_VTABLE (binfo
);
8392 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8393 /* If this class has no vtable, none of its bases do. */
8394 return dfs_skip_bases
;
8397 /* This might be a primary base, so have no vtable in this
8401 /* If we scribbled the construction vtable vptr into BINFO, clear it
8403 if (TREE_CODE (vtable
) == TREE_LIST
8404 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8405 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8410 /* Build the construction vtable group for BINFO which is in the
8411 hierarchy dominated by T. */
8414 build_ctor_vtbl_group (tree binfo
, tree t
)
8420 vec
<constructor_elt
, va_gc
> *v
;
8422 /* See if we've already created this construction vtable group. */
8423 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8424 if (IDENTIFIER_GLOBAL_VALUE (id
))
8427 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8428 /* Build a version of VTBL (with the wrong type) for use in
8429 constructing the addresses of secondary vtables in the
8430 construction vtable group. */
8431 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8432 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8433 /* Don't export construction vtables from shared libraries. Even on
8434 targets that don't support hidden visibility, this tells
8435 can_refer_decl_in_current_unit_p not to assume that it's safe to
8436 access from a different compilation unit (bz 54314). */
8437 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8438 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8441 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8442 binfo
, vtbl
, t
, &v
);
8444 /* Add the vtables for each of our virtual bases using the vbase in T
8446 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8448 vbase
= TREE_CHAIN (vbase
))
8452 if (!BINFO_VIRTUAL_P (vbase
))
8454 b
= copied_binfo (vbase
, binfo
);
8456 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8459 /* Figure out the type of the construction vtable. */
8460 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8462 TREE_TYPE (vtbl
) = type
;
8463 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8464 layout_decl (vtbl
, 0);
8466 /* Initialize the construction vtable. */
8467 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8468 initialize_artificial_var (vtbl
, v
);
8469 dump_vtable (t
, binfo
, vtbl
);
8472 /* Add the vtbl initializers for BINFO (and its bases other than
8473 non-virtual primaries) to the list of INITS. BINFO is in the
8474 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8475 the constructor the vtbl inits should be accumulated for. (If this
8476 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8477 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8478 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8479 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8480 but are not necessarily the same in terms of layout. */
8483 accumulate_vtbl_inits (tree binfo
,
8488 vec
<constructor_elt
, va_gc
> **inits
)
8492 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8494 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8496 /* If it doesn't have a vptr, we don't do anything. */
8497 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8500 /* If we're building a construction vtable, we're not interested in
8501 subobjects that don't require construction vtables. */
8503 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8504 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8507 /* Build the initializers for the BINFO-in-T vtable. */
8508 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8510 /* Walk the BINFO and its bases. We walk in preorder so that as we
8511 initialize each vtable we can figure out at what offset the
8512 secondary vtable lies from the primary vtable. We can't use
8513 dfs_walk here because we need to iterate through bases of BINFO
8514 and RTTI_BINFO simultaneously. */
8515 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8517 /* Skip virtual bases. */
8518 if (BINFO_VIRTUAL_P (base_binfo
))
8520 accumulate_vtbl_inits (base_binfo
,
8521 BINFO_BASE_BINFO (orig_binfo
, i
),
8522 rtti_binfo
, vtbl
, t
,
8527 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8528 BINFO vtable to L. */
8531 dfs_accumulate_vtbl_inits (tree binfo
,
8536 vec
<constructor_elt
, va_gc
> **l
)
8538 tree vtbl
= NULL_TREE
;
8539 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8543 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8545 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8546 primary virtual base. If it is not the same primary in
8547 the hierarchy of T, we'll need to generate a ctor vtable
8548 for it, to place at its location in T. If it is the same
8549 primary, we still need a VTT entry for the vtable, but it
8550 should point to the ctor vtable for the base it is a
8551 primary for within the sub-hierarchy of RTTI_BINFO.
8553 There are three possible cases:
8555 1) We are in the same place.
8556 2) We are a primary base within a lost primary virtual base of
8558 3) We are primary to something not a base of RTTI_BINFO. */
8561 tree last
= NULL_TREE
;
8563 /* First, look through the bases we are primary to for RTTI_BINFO
8564 or a virtual base. */
8566 while (BINFO_PRIMARY_P (b
))
8568 b
= BINFO_INHERITANCE_CHAIN (b
);
8570 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8573 /* If we run out of primary links, keep looking down our
8574 inheritance chain; we might be an indirect primary. */
8575 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8576 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8580 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8581 base B and it is a base of RTTI_BINFO, this is case 2. In
8582 either case, we share our vtable with LAST, i.e. the
8583 derived-most base within B of which we are a primary. */
8585 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8586 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8587 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8588 binfo_ctor_vtable after everything's been set up. */
8591 /* Otherwise, this is case 3 and we get our own. */
8593 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8596 n_inits
= vec_safe_length (*l
);
8603 /* Add the initializer for this vtable. */
8604 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8605 &non_fn_entries
, l
);
8607 /* Figure out the position to which the VPTR should point. */
8608 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8609 index
= size_binop (MULT_EXPR
,
8610 TYPE_SIZE_UNIT (vtable_entry_type
),
8611 size_int (non_fn_entries
+ n_inits
));
8612 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8616 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8617 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8618 straighten this out. */
8619 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8620 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8621 /* Throw away any unneeded intializers. */
8622 (*l
)->truncate (n_inits
);
8624 /* For an ordinary vtable, set BINFO_VTABLE. */
8625 BINFO_VTABLE (binfo
) = vtbl
;
8628 static GTY(()) tree abort_fndecl_addr
;
8630 /* Construct the initializer for BINFO's virtual function table. BINFO
8631 is part of the hierarchy dominated by T. If we're building a
8632 construction vtable, the ORIG_BINFO is the binfo we should use to
8633 find the actual function pointers to put in the vtable - but they
8634 can be overridden on the path to most-derived in the graph that
8635 ORIG_BINFO belongs. Otherwise,
8636 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8637 BINFO that should be indicated by the RTTI information in the
8638 vtable; it will be a base class of T, rather than T itself, if we
8639 are building a construction vtable.
8641 The value returned is a TREE_LIST suitable for wrapping in a
8642 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8643 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8644 number of non-function entries in the vtable.
8646 It might seem that this function should never be called with a
8647 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8648 base is always subsumed by a derived class vtable. However, when
8649 we are building construction vtables, we do build vtables for
8650 primary bases; we need these while the primary base is being
8654 build_vtbl_initializer (tree binfo
,
8658 int* non_fn_entries_p
,
8659 vec
<constructor_elt
, va_gc
> **inits
)
8665 vec
<tree
, va_gc
> *vbases
;
8668 /* Initialize VID. */
8669 memset (&vid
, 0, sizeof (vid
));
8672 vid
.rtti_binfo
= rtti_binfo
;
8673 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8674 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8675 vid
.generate_vcall_entries
= true;
8676 /* The first vbase or vcall offset is at index -3 in the vtable. */
8677 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8679 /* Add entries to the vtable for RTTI. */
8680 build_rtti_vtbl_entries (binfo
, &vid
);
8682 /* Create an array for keeping track of the functions we've
8683 processed. When we see multiple functions with the same
8684 signature, we share the vcall offsets. */
8685 vec_alloc (vid
.fns
, 32);
8686 /* Add the vcall and vbase offset entries. */
8687 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8689 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8690 build_vbase_offset_vtbl_entries. */
8691 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8692 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8693 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8695 /* If the target requires padding between data entries, add that now. */
8696 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8698 int n_entries
= vec_safe_length (vid
.inits
);
8700 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8702 /* Move data entries into their new positions and add padding
8703 after the new positions. Iterate backwards so we don't
8704 overwrite entries that we would need to process later. */
8705 for (ix
= n_entries
- 1;
8706 vid
.inits
->iterate (ix
, &e
);
8710 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8711 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8713 (*vid
.inits
)[new_position
] = *e
;
8715 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8717 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8718 f
->index
= NULL_TREE
;
8719 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8725 if (non_fn_entries_p
)
8726 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8728 /* The initializers for virtual functions were built up in reverse
8729 order. Straighten them out and add them to the running list in one
8731 jx
= vec_safe_length (*inits
);
8732 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8734 for (ix
= vid
.inits
->length () - 1;
8735 vid
.inits
->iterate (ix
, &e
);
8739 /* Go through all the ordinary virtual functions, building up
8741 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8745 tree fn
, fn_original
;
8746 tree init
= NULL_TREE
;
8750 if (DECL_THUNK_P (fn
))
8752 if (!DECL_NAME (fn
))
8754 if (THUNK_ALIAS (fn
))
8756 fn
= THUNK_ALIAS (fn
);
8759 fn_original
= THUNK_TARGET (fn
);
8762 /* If the only definition of this function signature along our
8763 primary base chain is from a lost primary, this vtable slot will
8764 never be used, so just zero it out. This is important to avoid
8765 requiring extra thunks which cannot be generated with the function.
8767 We first check this in update_vtable_entry_for_fn, so we handle
8768 restored primary bases properly; we also need to do it here so we
8769 zero out unused slots in ctor vtables, rather than filling them
8770 with erroneous values (though harmless, apart from relocation
8772 if (BV_LOST_PRIMARY (v
))
8773 init
= size_zero_node
;
8777 /* Pull the offset for `this', and the function to call, out of
8779 delta
= BV_DELTA (v
);
8780 vcall_index
= BV_VCALL_INDEX (v
);
8782 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8783 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8785 /* You can't call an abstract virtual function; it's abstract.
8786 So, we replace these functions with __pure_virtual. */
8787 if (DECL_PURE_VIRTUAL_P (fn_original
))
8790 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8792 if (abort_fndecl_addr
== NULL
)
8794 = fold_convert (vfunc_ptr_type_node
,
8795 build_fold_addr_expr (fn
));
8796 init
= abort_fndecl_addr
;
8799 /* Likewise for deleted virtuals. */
8800 else if (DECL_DELETED_FN (fn_original
))
8802 fn
= get_identifier ("__cxa_deleted_virtual");
8803 if (!get_global_value_if_present (fn
, &fn
))
8804 fn
= push_library_fn (fn
, (build_function_type_list
8805 (void_type_node
, NULL_TREE
)),
8807 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8808 init
= fold_convert (vfunc_ptr_type_node
,
8809 build_fold_addr_expr (fn
));
8813 if (!integer_zerop (delta
) || vcall_index
)
8815 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8816 if (!DECL_NAME (fn
))
8819 /* Take the address of the function, considering it to be of an
8820 appropriate generic type. */
8821 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8822 init
= fold_convert (vfunc_ptr_type_node
,
8823 build_fold_addr_expr (fn
));
8827 /* And add it to the chain of initializers. */
8828 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8831 if (init
== size_zero_node
)
8832 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8833 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8835 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8837 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8838 fn
, build_int_cst (NULL_TREE
, i
));
8839 TREE_CONSTANT (fdesc
) = 1;
8841 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8845 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8849 /* Adds to vid->inits the initializers for the vbase and vcall
8850 offsets in BINFO, which is in the hierarchy dominated by T. */
8853 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8857 /* If this is a derived class, we must first create entries
8858 corresponding to the primary base class. */
8859 b
= get_primary_binfo (binfo
);
8861 build_vcall_and_vbase_vtbl_entries (b
, vid
);
8863 /* Add the vbase entries for this base. */
8864 build_vbase_offset_vtbl_entries (binfo
, vid
);
8865 /* Add the vcall entries for this base. */
8866 build_vcall_offset_vtbl_entries (binfo
, vid
);
8869 /* Returns the initializers for the vbase offset entries in the vtable
8870 for BINFO (which is part of the class hierarchy dominated by T), in
8871 reverse order. VBASE_OFFSET_INDEX gives the vtable index
8872 where the next vbase offset will go. */
8875 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8879 tree non_primary_binfo
;
8881 /* If there are no virtual baseclasses, then there is nothing to
8883 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8888 /* We might be a primary base class. Go up the inheritance hierarchy
8889 until we find the most derived class of which we are a primary base:
8890 it is the offset of that which we need to use. */
8891 non_primary_binfo
= binfo
;
8892 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
8896 /* If we have reached a virtual base, then it must be a primary
8897 base (possibly multi-level) of vid->binfo, or we wouldn't
8898 have called build_vcall_and_vbase_vtbl_entries for it. But it
8899 might be a lost primary, so just skip down to vid->binfo. */
8900 if (BINFO_VIRTUAL_P (non_primary_binfo
))
8902 non_primary_binfo
= vid
->binfo
;
8906 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
8907 if (get_primary_binfo (b
) != non_primary_binfo
)
8909 non_primary_binfo
= b
;
8912 /* Go through the virtual bases, adding the offsets. */
8913 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8915 vbase
= TREE_CHAIN (vbase
))
8920 if (!BINFO_VIRTUAL_P (vbase
))
8923 /* Find the instance of this virtual base in the complete
8925 b
= copied_binfo (vbase
, binfo
);
8927 /* If we've already got an offset for this virtual base, we
8928 don't need another one. */
8929 if (BINFO_VTABLE_PATH_MARKED (b
))
8931 BINFO_VTABLE_PATH_MARKED (b
) = 1;
8933 /* Figure out where we can find this vbase offset. */
8934 delta
= size_binop (MULT_EXPR
,
8937 TYPE_SIZE_UNIT (vtable_entry_type
)));
8938 if (vid
->primary_vtbl_p
)
8939 BINFO_VPTR_FIELD (b
) = delta
;
8941 if (binfo
!= TYPE_BINFO (t
))
8942 /* The vbase offset had better be the same. */
8943 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
8945 /* The next vbase will come at a more negative offset. */
8946 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
8947 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
8949 /* The initializer is the delta from BINFO to this virtual base.
8950 The vbase offsets go in reverse inheritance-graph order, and
8951 we are walking in inheritance graph order so these end up in
8953 delta
= size_diffop_loc (input_location
,
8954 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
8956 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
8957 fold_build1_loc (input_location
, NOP_EXPR
,
8958 vtable_entry_type
, delta
));
8962 /* Adds the initializers for the vcall offset entries in the vtable
8963 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
8967 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8969 /* We only need these entries if this base is a virtual base. We
8970 compute the indices -- but do not add to the vtable -- when
8971 building the main vtable for a class. */
8972 if (binfo
== TYPE_BINFO (vid
->derived
)
8973 || (BINFO_VIRTUAL_P (binfo
)
8974 /* If BINFO is RTTI_BINFO, then (since BINFO does not
8975 correspond to VID->DERIVED), we are building a primary
8976 construction virtual table. Since this is a primary
8977 virtual table, we do not need the vcall offsets for
8979 && binfo
!= vid
->rtti_binfo
))
8981 /* We need a vcall offset for each of the virtual functions in this
8982 vtable. For example:
8984 class A { virtual void f (); };
8985 class B1 : virtual public A { virtual void f (); };
8986 class B2 : virtual public A { virtual void f (); };
8987 class C: public B1, public B2 { virtual void f (); };
8989 A C object has a primary base of B1, which has a primary base of A. A
8990 C also has a secondary base of B2, which no longer has a primary base
8991 of A. So the B2-in-C construction vtable needs a secondary vtable for
8992 A, which will adjust the A* to a B2* to call f. We have no way of
8993 knowing what (or even whether) this offset will be when we define B2,
8994 so we store this "vcall offset" in the A sub-vtable and look it up in
8995 a "virtual thunk" for B2::f.
8997 We need entries for all the functions in our primary vtable and
8998 in our non-virtual bases' secondary vtables. */
9000 /* If we are just computing the vcall indices -- but do not need
9001 the actual entries -- not that. */
9002 if (!BINFO_VIRTUAL_P (binfo
))
9003 vid
->generate_vcall_entries
= false;
9004 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9005 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9009 /* Build vcall offsets, starting with those for BINFO. */
9012 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9018 /* Don't walk into virtual bases -- except, of course, for the
9019 virtual base for which we are building vcall offsets. Any
9020 primary virtual base will have already had its offsets generated
9021 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9022 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9025 /* If BINFO has a primary base, process it first. */
9026 primary_binfo
= get_primary_binfo (binfo
);
9028 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9030 /* Add BINFO itself to the list. */
9031 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9033 /* Scan the non-primary bases of BINFO. */
9034 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9035 if (base_binfo
!= primary_binfo
)
9036 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9039 /* Called from build_vcall_offset_vtbl_entries_r. */
9042 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9044 /* Make entries for the rest of the virtuals. */
9045 if (abi_version_at_least (2))
9049 /* The ABI requires that the methods be processed in declaration
9050 order. G++ 3.2 used the order in the vtable. */
9051 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9053 orig_fn
= DECL_CHAIN (orig_fn
))
9054 if (DECL_VINDEX (orig_fn
))
9055 add_vcall_offset (orig_fn
, binfo
, vid
);
9059 tree derived_virtuals
;
9062 /* If BINFO is a primary base, the most derived class which has
9063 BINFO as a primary base; otherwise, just BINFO. */
9064 tree non_primary_binfo
;
9066 /* We might be a primary base class. Go up the inheritance hierarchy
9067 until we find the most derived class of which we are a primary base:
9068 it is the BINFO_VIRTUALS there that we need to consider. */
9069 non_primary_binfo
= binfo
;
9070 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9074 /* If we have reached a virtual base, then it must be vid->vbase,
9075 because we ignore other virtual bases in
9076 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9077 base (possibly multi-level) of vid->binfo, or we wouldn't
9078 have called build_vcall_and_vbase_vtbl_entries for it. But it
9079 might be a lost primary, so just skip down to vid->binfo. */
9080 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9082 gcc_assert (non_primary_binfo
== vid
->vbase
);
9083 non_primary_binfo
= vid
->binfo
;
9087 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9088 if (get_primary_binfo (b
) != non_primary_binfo
)
9090 non_primary_binfo
= b
;
9093 if (vid
->ctor_vtbl_p
)
9094 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9095 where rtti_binfo is the most derived type. */
9097 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9099 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9100 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9101 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9103 base_virtuals
= TREE_CHAIN (base_virtuals
),
9104 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9105 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9109 /* Find the declaration that originally caused this function to
9110 be present in BINFO_TYPE (binfo). */
9111 orig_fn
= BV_FN (orig_virtuals
);
9113 /* When processing BINFO, we only want to generate vcall slots for
9114 function slots introduced in BINFO. So don't try to generate
9115 one if the function isn't even defined in BINFO. */
9116 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9119 add_vcall_offset (orig_fn
, binfo
, vid
);
9124 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9127 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9133 /* If there is already an entry for a function with the same
9134 signature as FN, then we do not need a second vcall offset.
9135 Check the list of functions already present in the derived
9137 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9139 if (same_signature_p (derived_entry
, orig_fn
)
9140 /* We only use one vcall offset for virtual destructors,
9141 even though there are two virtual table entries. */
9142 || (DECL_DESTRUCTOR_P (derived_entry
)
9143 && DECL_DESTRUCTOR_P (orig_fn
)))
9147 /* If we are building these vcall offsets as part of building
9148 the vtable for the most derived class, remember the vcall
9150 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9152 tree_pair_s elt
= {orig_fn
, vid
->index
};
9153 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9156 /* The next vcall offset will be found at a more negative
9158 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9159 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9161 /* Keep track of this function. */
9162 vec_safe_push (vid
->fns
, orig_fn
);
9164 if (vid
->generate_vcall_entries
)
9169 /* Find the overriding function. */
9170 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9171 if (fn
== error_mark_node
)
9172 vcall_offset
= build_zero_cst (vtable_entry_type
);
9175 base
= TREE_VALUE (fn
);
9177 /* The vbase we're working on is a primary base of
9178 vid->binfo. But it might be a lost primary, so its
9179 BINFO_OFFSET might be wrong, so we just use the
9180 BINFO_OFFSET from vid->binfo. */
9181 vcall_offset
= size_diffop_loc (input_location
,
9182 BINFO_OFFSET (base
),
9183 BINFO_OFFSET (vid
->binfo
));
9184 vcall_offset
= fold_build1_loc (input_location
,
9185 NOP_EXPR
, vtable_entry_type
,
9188 /* Add the initializer to the vtable. */
9189 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9193 /* Return vtbl initializers for the RTTI entries corresponding to the
9194 BINFO's vtable. The RTTI entries should indicate the object given
9195 by VID->rtti_binfo. */
9198 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9206 t
= BINFO_TYPE (vid
->rtti_binfo
);
9208 /* To find the complete object, we will first convert to our most
9209 primary base, and then add the offset in the vtbl to that value. */
9211 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9212 && !BINFO_LOST_PRIMARY_P (b
))
9216 primary_base
= get_primary_binfo (b
);
9217 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9218 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9221 offset
= size_diffop_loc (input_location
,
9222 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9224 /* The second entry is the address of the typeinfo object. */
9226 decl
= build_address (get_tinfo_decl (t
));
9228 decl
= integer_zero_node
;
9230 /* Convert the declaration to a type that can be stored in the
9232 init
= build_nop (vfunc_ptr_type_node
, decl
);
9233 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9235 /* Add the offset-to-top entry. It comes earlier in the vtable than
9236 the typeinfo entry. Convert the offset to look like a
9237 function pointer, so that we can put it in the vtable. */
9238 init
= build_nop (vfunc_ptr_type_node
, offset
);
9239 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9242 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9246 uniquely_derived_from_p (tree parent
, tree type
)
9248 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9249 return base
&& base
!= error_mark_node
;
9252 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9255 publicly_uniquely_derived_p (tree parent
, tree type
)
9257 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9259 return base
&& base
!= error_mark_node
;
9262 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9263 class between them, if any. */
9266 common_enclosing_class (tree ctx1
, tree ctx2
)
9268 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9270 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9271 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9274 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9275 TYPE_MARKED_P (t
) = true;
9276 tree found
= NULL_TREE
;
9277 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9278 if (TYPE_MARKED_P (t
))
9283 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9284 TYPE_MARKED_P (t
) = false;
9288 #include "gt-cp-class.h"