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 (compare_tree_int (w
, TYPE_PRECISION (type
)) > 0
3144 && TREE_CODE (type
) != ENUMERAL_TYPE
3145 && TREE_CODE (type
) != BOOLEAN_TYPE
)
3146 warning (0, "width of %q+D exceeds its type", field
);
3147 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3148 && (0 > (compare_tree_int
3149 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3150 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3153 if (w
!= error_mark_node
)
3155 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3156 DECL_BIT_FIELD (field
) = 1;
3161 /* Non-bit-fields are aligned for their type. */
3162 DECL_BIT_FIELD (field
) = 0;
3163 CLEAR_DECL_C_BIT_FIELD (field
);
3168 /* FIELD is a non bit-field. We are finishing the processing for its
3169 enclosing type T. Issue any appropriate messages and set appropriate
3173 check_field_decl (tree field
,
3175 int* cant_have_const_ctor
,
3176 int* no_const_asn_ref
,
3177 int* any_default_members
)
3179 tree type
= strip_array_types (TREE_TYPE (field
));
3181 /* In C++98 an anonymous union cannot contain any fields which would change
3182 the settings of CANT_HAVE_CONST_CTOR and friends. */
3183 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx0x
)
3185 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3186 structs. So, we recurse through their fields here. */
3187 else if (ANON_AGGR_TYPE_P (type
))
3191 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3192 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3193 check_field_decl (fields
, t
, cant_have_const_ctor
,
3194 no_const_asn_ref
, any_default_members
);
3196 /* Check members with class type for constructors, destructors,
3198 else if (CLASS_TYPE_P (type
))
3200 /* Never let anything with uninheritable virtuals
3201 make it through without complaint. */
3202 abstract_virtuals_error (field
, type
);
3204 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx0x
)
3207 int oldcount
= errorcount
;
3208 if (TYPE_NEEDS_CONSTRUCTING (type
))
3209 error ("member %q+#D with constructor not allowed in union",
3211 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3212 error ("member %q+#D with destructor not allowed in union", field
);
3213 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3214 error ("member %q+#D with copy assignment operator not allowed in union",
3216 if (!warned
&& errorcount
> oldcount
)
3218 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3219 "only available with -std=c++11 or -std=gnu++11");
3225 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3226 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3227 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3228 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3229 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3230 || !TYPE_HAS_COPY_ASSIGN (type
));
3231 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3232 || !TYPE_HAS_COPY_CTOR (type
));
3233 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3234 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3235 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3236 || TYPE_HAS_COMPLEX_DFLT (type
));
3239 if (TYPE_HAS_COPY_CTOR (type
)
3240 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3241 *cant_have_const_ctor
= 1;
3243 if (TYPE_HAS_COPY_ASSIGN (type
)
3244 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3245 *no_const_asn_ref
= 1;
3248 check_abi_tags (t
, field
);
3250 if (DECL_INITIAL (field
) != NULL_TREE
)
3252 /* `build_class_init_list' does not recognize
3254 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3255 error ("multiple fields in union %qT initialized", t
);
3256 *any_default_members
= 1;
3260 /* Check the data members (both static and non-static), class-scoped
3261 typedefs, etc., appearing in the declaration of T. Issue
3262 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3263 declaration order) of access declarations; each TREE_VALUE in this
3264 list is a USING_DECL.
3266 In addition, set the following flags:
3269 The class is empty, i.e., contains no non-static data members.
3271 CANT_HAVE_CONST_CTOR_P
3272 This class cannot have an implicitly generated copy constructor
3273 taking a const reference.
3275 CANT_HAVE_CONST_ASN_REF
3276 This class cannot have an implicitly generated assignment
3277 operator taking a const reference.
3279 All of these flags should be initialized before calling this
3282 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3283 fields can be added by adding to this chain. */
3286 check_field_decls (tree t
, tree
*access_decls
,
3287 int *cant_have_const_ctor_p
,
3288 int *no_const_asn_ref_p
)
3293 int any_default_members
;
3295 int field_access
= -1;
3297 /* Assume there are no access declarations. */
3298 *access_decls
= NULL_TREE
;
3299 /* Assume this class has no pointer members. */
3300 has_pointers
= false;
3301 /* Assume none of the members of this class have default
3303 any_default_members
= 0;
3305 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3308 tree type
= TREE_TYPE (x
);
3309 int this_field_access
;
3311 next
= &DECL_CHAIN (x
);
3313 if (TREE_CODE (x
) == USING_DECL
)
3315 /* Save the access declarations for our caller. */
3316 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3320 if (TREE_CODE (x
) == TYPE_DECL
3321 || TREE_CODE (x
) == TEMPLATE_DECL
)
3324 /* If we've gotten this far, it's a data member, possibly static,
3325 or an enumerator. */
3326 if (TREE_CODE (x
) != CONST_DECL
)
3327 DECL_CONTEXT (x
) = t
;
3329 /* When this goes into scope, it will be a non-local reference. */
3330 DECL_NONLOCAL (x
) = 1;
3332 if (TREE_CODE (t
) == UNION_TYPE
)
3336 If a union contains a static data member, or a member of
3337 reference type, the program is ill-formed. */
3340 error ("%q+D may not be static because it is a member of a union", x
);
3343 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3345 error ("%q+D may not have reference type %qT because"
3346 " it is a member of a union",
3352 /* Perform error checking that did not get done in
3354 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3356 error ("field %q+D invalidly declared function type", x
);
3357 type
= build_pointer_type (type
);
3358 TREE_TYPE (x
) = type
;
3360 else if (TREE_CODE (type
) == METHOD_TYPE
)
3362 error ("field %q+D invalidly declared method type", x
);
3363 type
= build_pointer_type (type
);
3364 TREE_TYPE (x
) = type
;
3367 if (type
== error_mark_node
)
3370 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3373 /* Now it can only be a FIELD_DECL. */
3375 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3376 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3378 /* If at least one non-static data member is non-literal, the whole
3379 class becomes non-literal. Note: if the type is incomplete we
3380 will complain later on. */
3381 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3382 CLASSTYPE_LITERAL_P (t
) = false;
3384 /* A standard-layout class is a class that:
3386 has the same access control (Clause 11) for all non-static data members,
3388 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3389 if (field_access
== -1)
3390 field_access
= this_field_access
;
3391 else if (this_field_access
!= field_access
)
3392 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3394 /* If this is of reference type, check if it needs an init. */
3395 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3397 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3398 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3399 if (DECL_INITIAL (x
) == NULL_TREE
)
3400 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3402 /* ARM $12.6.2: [A member initializer list] (or, for an
3403 aggregate, initialization by a brace-enclosed list) is the
3404 only way to initialize nonstatic const and reference
3406 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3407 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3410 type
= strip_array_types (type
);
3412 if (TYPE_PACKED (t
))
3414 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3418 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3422 else if (DECL_C_BIT_FIELD (x
)
3423 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3424 DECL_PACKED (x
) = 1;
3427 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3428 /* We don't treat zero-width bitfields as making a class
3433 /* The class is non-empty. */
3434 CLASSTYPE_EMPTY_P (t
) = 0;
3435 /* The class is not even nearly empty. */
3436 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3437 /* If one of the data members contains an empty class,
3439 if (CLASS_TYPE_P (type
)
3440 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3441 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3444 /* This is used by -Weffc++ (see below). Warn only for pointers
3445 to members which might hold dynamic memory. So do not warn
3446 for pointers to functions or pointers to members. */
3447 if (TYPE_PTR_P (type
)
3448 && !TYPE_PTRFN_P (type
))
3449 has_pointers
= true;
3451 if (CLASS_TYPE_P (type
))
3453 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3454 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3455 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3456 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3459 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3460 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3462 if (! layout_pod_type_p (type
))
3463 /* DR 148 now allows pointers to members (which are POD themselves),
3464 to be allowed in POD structs. */
3465 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3467 if (!std_layout_type_p (type
))
3468 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3470 if (! zero_init_p (type
))
3471 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3473 /* We set DECL_C_BIT_FIELD in grokbitfield.
3474 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3475 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3476 check_field_decl (x
, t
,
3477 cant_have_const_ctor_p
,
3479 &any_default_members
);
3481 /* Now that we've removed bit-field widths from DECL_INITIAL,
3482 anything left in DECL_INITIAL is an NSDMI that makes the class
3484 if (DECL_INITIAL (x
))
3485 CLASSTYPE_NON_AGGREGATE (t
) = true;
3487 /* If any field is const, the structure type is pseudo-const. */
3488 if (CP_TYPE_CONST_P (type
))
3490 C_TYPE_FIELDS_READONLY (t
) = 1;
3491 if (DECL_INITIAL (x
) == NULL_TREE
)
3492 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3494 /* ARM $12.6.2: [A member initializer list] (or, for an
3495 aggregate, initialization by a brace-enclosed list) is the
3496 only way to initialize nonstatic const and reference
3498 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3499 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3501 /* A field that is pseudo-const makes the structure likewise. */
3502 else if (CLASS_TYPE_P (type
))
3504 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3505 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3506 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3507 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3510 /* Core issue 80: A nonstatic data member is required to have a
3511 different name from the class iff the class has a
3512 user-declared constructor. */
3513 if (constructor_name_p (DECL_NAME (x
), t
)
3514 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3515 permerror (input_location
, "field %q+#D with same name as class", x
);
3518 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3519 it should also define a copy constructor and an assignment operator to
3520 implement the correct copy semantic (deep vs shallow, etc.). As it is
3521 not feasible to check whether the constructors do allocate dynamic memory
3522 and store it within members, we approximate the warning like this:
3524 -- Warn only if there are members which are pointers
3525 -- Warn only if there is a non-trivial constructor (otherwise,
3526 there cannot be memory allocated).
3527 -- Warn only if there is a non-trivial destructor. We assume that the
3528 user at least implemented the cleanup correctly, and a destructor
3529 is needed to free dynamic memory.
3531 This seems enough for practical purposes. */
3534 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3535 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3536 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3538 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3540 if (! TYPE_HAS_COPY_CTOR (t
))
3542 warning (OPT_Weffc__
,
3543 " but does not override %<%T(const %T&)%>", t
, t
);
3544 if (!TYPE_HAS_COPY_ASSIGN (t
))
3545 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3547 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3548 warning (OPT_Weffc__
,
3549 " but does not override %<operator=(const %T&)%>", t
);
3552 /* Non-static data member initializers make the default constructor
3554 if (any_default_members
)
3556 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3557 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3560 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3562 TYPE_PACKED (t
) = 0;
3564 /* Check anonymous struct/anonymous union fields. */
3565 finish_struct_anon (t
);
3567 /* We've built up the list of access declarations in reverse order.
3569 *access_decls
= nreverse (*access_decls
);
3572 /* If TYPE is an empty class type, records its OFFSET in the table of
3576 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3580 if (!is_empty_class (type
))
3583 /* Record the location of this empty object in OFFSETS. */
3584 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3586 n
= splay_tree_insert (offsets
,
3587 (splay_tree_key
) offset
,
3588 (splay_tree_value
) NULL_TREE
);
3589 n
->value
= ((splay_tree_value
)
3590 tree_cons (NULL_TREE
,
3597 /* Returns nonzero if TYPE is an empty class type and there is
3598 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3601 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3606 if (!is_empty_class (type
))
3609 /* Record the location of this empty object in OFFSETS. */
3610 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3614 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3615 if (same_type_p (TREE_VALUE (t
), type
))
3621 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3622 F for every subobject, passing it the type, offset, and table of
3623 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3626 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3627 than MAX_OFFSET will not be walked.
3629 If F returns a nonzero value, the traversal ceases, and that value
3630 is returned. Otherwise, returns zero. */
3633 walk_subobject_offsets (tree type
,
3634 subobject_offset_fn f
,
3641 tree type_binfo
= NULL_TREE
;
3643 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3645 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3648 if (type
== error_mark_node
)
3653 if (abi_version_at_least (2))
3655 type
= BINFO_TYPE (type
);
3658 if (CLASS_TYPE_P (type
))
3664 /* Avoid recursing into objects that are not interesting. */
3665 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3668 /* Record the location of TYPE. */
3669 r
= (*f
) (type
, offset
, offsets
);
3673 /* Iterate through the direct base classes of TYPE. */
3675 type_binfo
= TYPE_BINFO (type
);
3676 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3680 if (abi_version_at_least (2)
3681 && BINFO_VIRTUAL_P (binfo
))
3685 && BINFO_VIRTUAL_P (binfo
)
3686 && !BINFO_PRIMARY_P (binfo
))
3689 if (!abi_version_at_least (2))
3690 binfo_offset
= size_binop (PLUS_EXPR
,
3692 BINFO_OFFSET (binfo
));
3696 /* We cannot rely on BINFO_OFFSET being set for the base
3697 class yet, but the offsets for direct non-virtual
3698 bases can be calculated by going back to the TYPE. */
3699 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3700 binfo_offset
= size_binop (PLUS_EXPR
,
3702 BINFO_OFFSET (orig_binfo
));
3705 r
= walk_subobject_offsets (binfo
,
3710 (abi_version_at_least (2)
3711 ? /*vbases_p=*/0 : vbases_p
));
3716 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3719 vec
<tree
, va_gc
> *vbases
;
3721 /* Iterate through the virtual base classes of TYPE. In G++
3722 3.2, we included virtual bases in the direct base class
3723 loop above, which results in incorrect results; the
3724 correct offsets for virtual bases are only known when
3725 working with the most derived type. */
3727 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3728 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3730 r
= walk_subobject_offsets (binfo
,
3732 size_binop (PLUS_EXPR
,
3734 BINFO_OFFSET (binfo
)),
3743 /* We still have to walk the primary base, if it is
3744 virtual. (If it is non-virtual, then it was walked
3746 tree vbase
= get_primary_binfo (type_binfo
);
3748 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3749 && BINFO_PRIMARY_P (vbase
)
3750 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3752 r
= (walk_subobject_offsets
3754 offsets
, max_offset
, /*vbases_p=*/0));
3761 /* Iterate through the fields of TYPE. */
3762 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3763 if (TREE_CODE (field
) == FIELD_DECL
&& !DECL_ARTIFICIAL (field
))
3767 if (abi_version_at_least (2))
3768 field_offset
= byte_position (field
);
3770 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3771 field_offset
= DECL_FIELD_OFFSET (field
);
3773 r
= walk_subobject_offsets (TREE_TYPE (field
),
3775 size_binop (PLUS_EXPR
,
3785 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3787 tree element_type
= strip_array_types (type
);
3788 tree domain
= TYPE_DOMAIN (type
);
3791 /* Avoid recursing into objects that are not interesting. */
3792 if (!CLASS_TYPE_P (element_type
)
3793 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3796 /* Step through each of the elements in the array. */
3797 for (index
= size_zero_node
;
3798 /* G++ 3.2 had an off-by-one error here. */
3799 (abi_version_at_least (2)
3800 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3801 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3802 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3804 r
= walk_subobject_offsets (TREE_TYPE (type
),
3812 offset
= size_binop (PLUS_EXPR
, offset
,
3813 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3814 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3815 there's no point in iterating through the remaining
3816 elements of the array. */
3817 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3825 /* Record all of the empty subobjects of TYPE (either a type or a
3826 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3827 is being placed at OFFSET; otherwise, it is a base class that is
3828 being placed at OFFSET. */
3831 record_subobject_offsets (tree type
,
3834 bool is_data_member
)
3837 /* If recording subobjects for a non-static data member or a
3838 non-empty base class , we do not need to record offsets beyond
3839 the size of the biggest empty class. Additional data members
3840 will go at the end of the class. Additional base classes will go
3841 either at offset zero (if empty, in which case they cannot
3842 overlap with offsets past the size of the biggest empty class) or
3843 at the end of the class.
3845 However, if we are placing an empty base class, then we must record
3846 all offsets, as either the empty class is at offset zero (where
3847 other empty classes might later be placed) or at the end of the
3848 class (where other objects might then be placed, so other empty
3849 subobjects might later overlap). */
3851 || !is_empty_class (BINFO_TYPE (type
)))
3852 max_offset
= sizeof_biggest_empty_class
;
3854 max_offset
= NULL_TREE
;
3855 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3856 offsets
, max_offset
, is_data_member
);
3859 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3860 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3861 virtual bases of TYPE are examined. */
3864 layout_conflict_p (tree type
,
3869 splay_tree_node max_node
;
3871 /* Get the node in OFFSETS that indicates the maximum offset where
3872 an empty subobject is located. */
3873 max_node
= splay_tree_max (offsets
);
3874 /* If there aren't any empty subobjects, then there's no point in
3875 performing this check. */
3879 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3880 offsets
, (tree
) (max_node
->key
),
3884 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3885 non-static data member of the type indicated by RLI. BINFO is the
3886 binfo corresponding to the base subobject, OFFSETS maps offsets to
3887 types already located at those offsets. This function determines
3888 the position of the DECL. */
3891 layout_nonempty_base_or_field (record_layout_info rli
,
3896 tree offset
= NULL_TREE
;
3902 /* For the purposes of determining layout conflicts, we want to
3903 use the class type of BINFO; TREE_TYPE (DECL) will be the
3904 CLASSTYPE_AS_BASE version, which does not contain entries for
3905 zero-sized bases. */
3906 type
= TREE_TYPE (binfo
);
3911 type
= TREE_TYPE (decl
);
3915 /* Try to place the field. It may take more than one try if we have
3916 a hard time placing the field without putting two objects of the
3917 same type at the same address. */
3920 struct record_layout_info_s old_rli
= *rli
;
3922 /* Place this field. */
3923 place_field (rli
, decl
);
3924 offset
= byte_position (decl
);
3926 /* We have to check to see whether or not there is already
3927 something of the same type at the offset we're about to use.
3928 For example, consider:
3931 struct T : public S { int i; };
3932 struct U : public S, public T {};
3934 Here, we put S at offset zero in U. Then, we can't put T at
3935 offset zero -- its S component would be at the same address
3936 as the S we already allocated. So, we have to skip ahead.
3937 Since all data members, including those whose type is an
3938 empty class, have nonzero size, any overlap can happen only
3939 with a direct or indirect base-class -- it can't happen with
3941 /* In a union, overlap is permitted; all members are placed at
3943 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
3945 /* G++ 3.2 did not check for overlaps when placing a non-empty
3947 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
3949 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
3952 /* Strip off the size allocated to this field. That puts us
3953 at the first place we could have put the field with
3954 proper alignment. */
3957 /* Bump up by the alignment required for the type. */
3959 = size_binop (PLUS_EXPR
, rli
->bitpos
,
3961 ? CLASSTYPE_ALIGN (type
)
3962 : TYPE_ALIGN (type
)));
3963 normalize_rli (rli
);
3966 /* There was no conflict. We're done laying out this field. */
3970 /* Now that we know where it will be placed, update its
3972 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
3973 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3974 this point because their BINFO_OFFSET is copied from another
3975 hierarchy. Therefore, we may not need to add the entire
3977 propagate_binfo_offsets (binfo
,
3978 size_diffop_loc (input_location
,
3979 convert (ssizetype
, offset
),
3981 BINFO_OFFSET (binfo
))));
3984 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3987 empty_base_at_nonzero_offset_p (tree type
,
3989 splay_tree
/*offsets*/)
3991 return is_empty_class (type
) && !integer_zerop (offset
);
3994 /* Layout the empty base BINFO. EOC indicates the byte currently just
3995 past the end of the class, and should be correctly aligned for a
3996 class of the type indicated by BINFO; OFFSETS gives the offsets of
3997 the empty bases allocated so far. T is the most derived
3998 type. Return nonzero iff we added it at the end. */
4001 layout_empty_base (record_layout_info rli
, tree binfo
,
4002 tree eoc
, splay_tree offsets
)
4005 tree basetype
= BINFO_TYPE (binfo
);
4008 /* This routine should only be used for empty classes. */
4009 gcc_assert (is_empty_class (basetype
));
4010 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4012 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4014 if (abi_version_at_least (2))
4015 propagate_binfo_offsets
4016 (binfo
, size_diffop_loc (input_location
,
4017 size_zero_node
, BINFO_OFFSET (binfo
)));
4020 "offset of empty base %qT may not be ABI-compliant and may"
4021 "change in a future version of GCC",
4022 BINFO_TYPE (binfo
));
4025 /* This is an empty base class. We first try to put it at offset
4027 if (layout_conflict_p (binfo
,
4028 BINFO_OFFSET (binfo
),
4032 /* That didn't work. Now, we move forward from the next
4033 available spot in the class. */
4035 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4038 if (!layout_conflict_p (binfo
,
4039 BINFO_OFFSET (binfo
),
4042 /* We finally found a spot where there's no overlap. */
4045 /* There's overlap here, too. Bump along to the next spot. */
4046 propagate_binfo_offsets (binfo
, alignment
);
4050 if (CLASSTYPE_USER_ALIGN (basetype
))
4052 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4054 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4055 TYPE_USER_ALIGN (rli
->t
) = 1;
4061 /* Layout the base given by BINFO in the class indicated by RLI.
4062 *BASE_ALIGN is a running maximum of the alignments of
4063 any base class. OFFSETS gives the location of empty base
4064 subobjects. T is the most derived type. Return nonzero if the new
4065 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4066 *NEXT_FIELD, unless BINFO is for an empty base class.
4068 Returns the location at which the next field should be inserted. */
4071 build_base_field (record_layout_info rli
, tree binfo
,
4072 splay_tree offsets
, tree
*next_field
)
4075 tree basetype
= BINFO_TYPE (binfo
);
4077 if (!COMPLETE_TYPE_P (basetype
))
4078 /* This error is now reported in xref_tag, thus giving better
4079 location information. */
4082 /* Place the base class. */
4083 if (!is_empty_class (basetype
))
4087 /* The containing class is non-empty because it has a non-empty
4089 CLASSTYPE_EMPTY_P (t
) = 0;
4091 /* Create the FIELD_DECL. */
4092 decl
= build_decl (input_location
,
4093 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4094 DECL_ARTIFICIAL (decl
) = 1;
4095 DECL_IGNORED_P (decl
) = 1;
4096 DECL_FIELD_CONTEXT (decl
) = t
;
4097 if (CLASSTYPE_AS_BASE (basetype
))
4099 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4100 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4101 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4102 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4103 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4104 DECL_FIELD_IS_BASE (decl
) = 1;
4106 /* Try to place the field. It may take more than one try if we
4107 have a hard time placing the field without putting two
4108 objects of the same type at the same address. */
4109 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4110 /* Add the new FIELD_DECL to the list of fields for T. */
4111 DECL_CHAIN (decl
) = *next_field
;
4113 next_field
= &DECL_CHAIN (decl
);
4121 /* On some platforms (ARM), even empty classes will not be
4123 eoc
= round_up_loc (input_location
,
4124 rli_size_unit_so_far (rli
),
4125 CLASSTYPE_ALIGN_UNIT (basetype
));
4126 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4127 /* A nearly-empty class "has no proper base class that is empty,
4128 not morally virtual, and at an offset other than zero." */
4129 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4132 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4133 /* The check above (used in G++ 3.2) is insufficient because
4134 an empty class placed at offset zero might itself have an
4135 empty base at a nonzero offset. */
4136 else if (walk_subobject_offsets (basetype
,
4137 empty_base_at_nonzero_offset_p
,
4140 /*max_offset=*/NULL_TREE
,
4143 if (abi_version_at_least (2))
4144 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4147 "class %qT will be considered nearly empty in a "
4148 "future version of GCC", t
);
4152 /* We do not create a FIELD_DECL for empty base classes because
4153 it might overlap some other field. We want to be able to
4154 create CONSTRUCTORs for the class by iterating over the
4155 FIELD_DECLs, and the back end does not handle overlapping
4158 /* An empty virtual base causes a class to be non-empty
4159 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4160 here because that was already done when the virtual table
4161 pointer was created. */
4164 /* Record the offsets of BINFO and its base subobjects. */
4165 record_subobject_offsets (binfo
,
4166 BINFO_OFFSET (binfo
),
4168 /*is_data_member=*/false);
4173 /* Layout all of the non-virtual base classes. Record empty
4174 subobjects in OFFSETS. T is the most derived type. Return nonzero
4175 if the type cannot be nearly empty. The fields created
4176 corresponding to the base classes will be inserted at
4180 build_base_fields (record_layout_info rli
,
4181 splay_tree offsets
, tree
*next_field
)
4183 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4186 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4189 /* The primary base class is always allocated first. */
4190 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4191 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4192 offsets
, next_field
);
4194 /* Now allocate the rest of the bases. */
4195 for (i
= 0; i
< n_baseclasses
; ++i
)
4199 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4201 /* The primary base was already allocated above, so we don't
4202 need to allocate it again here. */
4203 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4206 /* Virtual bases are added at the end (a primary virtual base
4207 will have already been added). */
4208 if (BINFO_VIRTUAL_P (base_binfo
))
4211 next_field
= build_base_field (rli
, base_binfo
,
4212 offsets
, next_field
);
4216 /* Go through the TYPE_METHODS of T issuing any appropriate
4217 diagnostics, figuring out which methods override which other
4218 methods, and so forth. */
4221 check_methods (tree t
)
4225 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4227 check_for_override (x
, t
);
4228 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4229 error ("initializer specified for non-virtual method %q+D", x
);
4230 /* The name of the field is the original field name
4231 Save this in auxiliary field for later overloading. */
4232 if (DECL_VINDEX (x
))
4234 TYPE_POLYMORPHIC_P (t
) = 1;
4235 if (DECL_PURE_VIRTUAL_P (x
))
4236 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4238 /* All user-provided destructors are non-trivial.
4239 Constructors and assignment ops are handled in
4240 grok_special_member_properties. */
4241 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4242 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4246 /* FN is a constructor or destructor. Clone the declaration to create
4247 a specialized in-charge or not-in-charge version, as indicated by
4251 build_clone (tree fn
, tree name
)
4256 /* Copy the function. */
4257 clone
= copy_decl (fn
);
4258 /* Reset the function name. */
4259 DECL_NAME (clone
) = name
;
4260 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4261 /* Remember where this function came from. */
4262 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4263 /* Make it easy to find the CLONE given the FN. */
4264 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4265 DECL_CHAIN (fn
) = clone
;
4267 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4268 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4270 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4271 DECL_TEMPLATE_RESULT (clone
) = result
;
4272 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4273 DECL_TI_TEMPLATE (result
) = clone
;
4274 TREE_TYPE (clone
) = TREE_TYPE (result
);
4278 DECL_CLONED_FUNCTION (clone
) = fn
;
4279 /* There's no pending inline data for this function. */
4280 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4281 DECL_PENDING_INLINE_P (clone
) = 0;
4283 /* The base-class destructor is not virtual. */
4284 if (name
== base_dtor_identifier
)
4286 DECL_VIRTUAL_P (clone
) = 0;
4287 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4288 DECL_VINDEX (clone
) = NULL_TREE
;
4291 /* If there was an in-charge parameter, drop it from the function
4293 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4299 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4300 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4301 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4302 /* Skip the `this' parameter. */
4303 parmtypes
= TREE_CHAIN (parmtypes
);
4304 /* Skip the in-charge parameter. */
4305 parmtypes
= TREE_CHAIN (parmtypes
);
4306 /* And the VTT parm, in a complete [cd]tor. */
4307 if (DECL_HAS_VTT_PARM_P (fn
)
4308 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4309 parmtypes
= TREE_CHAIN (parmtypes
);
4310 /* If this is subobject constructor or destructor, add the vtt
4313 = build_method_type_directly (basetype
,
4314 TREE_TYPE (TREE_TYPE (clone
)),
4317 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4320 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4321 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4324 /* Copy the function parameters. */
4325 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4326 /* Remove the in-charge parameter. */
4327 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4329 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4330 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4331 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4333 /* And the VTT parm, in a complete [cd]tor. */
4334 if (DECL_HAS_VTT_PARM_P (fn
))
4336 if (DECL_NEEDS_VTT_PARM_P (clone
))
4337 DECL_HAS_VTT_PARM_P (clone
) = 1;
4340 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4341 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4342 DECL_HAS_VTT_PARM_P (clone
) = 0;
4346 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4348 DECL_CONTEXT (parms
) = clone
;
4349 cxx_dup_lang_specific_decl (parms
);
4352 /* Create the RTL for this function. */
4353 SET_DECL_RTL (clone
, NULL
);
4354 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4357 note_decl_for_pch (clone
);
4362 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4363 not invoke this function directly.
4365 For a non-thunk function, returns the address of the slot for storing
4366 the function it is a clone of. Otherwise returns NULL_TREE.
4368 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4369 cloned_function is unset. This is to support the separate
4370 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4371 on a template makes sense, but not the former. */
4374 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4378 decl
= STRIP_TEMPLATE (decl
);
4380 if (TREE_CODE (decl
) != FUNCTION_DECL
4381 || !DECL_LANG_SPECIFIC (decl
)
4382 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4384 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4386 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4392 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4393 if (just_testing
&& *ptr
== NULL_TREE
)
4399 /* Produce declarations for all appropriate clones of FN. If
4400 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4401 CLASTYPE_METHOD_VEC as well. */
4404 clone_function_decl (tree fn
, int update_method_vec_p
)
4408 /* Avoid inappropriate cloning. */
4410 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4413 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4415 /* For each constructor, we need two variants: an in-charge version
4416 and a not-in-charge version. */
4417 clone
= build_clone (fn
, complete_ctor_identifier
);
4418 if (update_method_vec_p
)
4419 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4420 clone
= build_clone (fn
, base_ctor_identifier
);
4421 if (update_method_vec_p
)
4422 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4426 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4428 /* For each destructor, we need three variants: an in-charge
4429 version, a not-in-charge version, and an in-charge deleting
4430 version. We clone the deleting version first because that
4431 means it will go second on the TYPE_METHODS list -- and that
4432 corresponds to the correct layout order in the virtual
4435 For a non-virtual destructor, we do not build a deleting
4437 if (DECL_VIRTUAL_P (fn
))
4439 clone
= build_clone (fn
, deleting_dtor_identifier
);
4440 if (update_method_vec_p
)
4441 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4443 clone
= build_clone (fn
, complete_dtor_identifier
);
4444 if (update_method_vec_p
)
4445 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4446 clone
= build_clone (fn
, base_dtor_identifier
);
4447 if (update_method_vec_p
)
4448 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4451 /* Note that this is an abstract function that is never emitted. */
4452 DECL_ABSTRACT (fn
) = 1;
4455 /* DECL is an in charge constructor, which is being defined. This will
4456 have had an in class declaration, from whence clones were
4457 declared. An out-of-class definition can specify additional default
4458 arguments. As it is the clones that are involved in overload
4459 resolution, we must propagate the information from the DECL to its
4463 adjust_clone_args (tree decl
)
4467 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4468 clone
= DECL_CHAIN (clone
))
4470 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4471 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4472 tree decl_parms
, clone_parms
;
4474 clone_parms
= orig_clone_parms
;
4476 /* Skip the 'this' parameter. */
4477 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4478 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4480 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4481 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4482 if (DECL_HAS_VTT_PARM_P (decl
))
4483 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4485 clone_parms
= orig_clone_parms
;
4486 if (DECL_HAS_VTT_PARM_P (clone
))
4487 clone_parms
= TREE_CHAIN (clone_parms
);
4489 for (decl_parms
= orig_decl_parms
; decl_parms
;
4490 decl_parms
= TREE_CHAIN (decl_parms
),
4491 clone_parms
= TREE_CHAIN (clone_parms
))
4493 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4494 TREE_TYPE (clone_parms
)));
4496 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4498 /* A default parameter has been added. Adjust the
4499 clone's parameters. */
4500 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4501 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4502 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4505 clone_parms
= orig_decl_parms
;
4507 if (DECL_HAS_VTT_PARM_P (clone
))
4509 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4510 TREE_VALUE (orig_clone_parms
),
4512 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4514 type
= build_method_type_directly (basetype
,
4515 TREE_TYPE (TREE_TYPE (clone
)),
4518 type
= build_exception_variant (type
, exceptions
);
4520 type
= cp_build_type_attribute_variant (type
, attrs
);
4521 TREE_TYPE (clone
) = type
;
4523 clone_parms
= NULL_TREE
;
4527 gcc_assert (!clone_parms
);
4531 /* For each of the constructors and destructors in T, create an
4532 in-charge and not-in-charge variant. */
4535 clone_constructors_and_destructors (tree t
)
4539 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4541 if (!CLASSTYPE_METHOD_VEC (t
))
4544 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4545 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4546 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4547 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4550 /* Deduce noexcept for a destructor DTOR. */
4553 deduce_noexcept_on_destructor (tree dtor
)
4555 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4557 tree ctx
= DECL_CONTEXT (dtor
);
4558 tree implicit_fn
= implicitly_declare_fn (sfk_destructor
, ctx
,
4561 tree eh_spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn
));
4562 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4566 /* For each destructor in T, deduce noexcept:
4568 12.4/3: A declaration of a destructor that does not have an
4569 exception-specification is implicitly considered to have the
4570 same exception-specification as an implicit declaration (15.4). */
4573 deduce_noexcept_on_destructors (tree t
)
4577 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4579 if (!CLASSTYPE_METHOD_VEC (t
))
4582 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4583 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4586 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4587 of TYPE for virtual functions which FNDECL overrides. Return a
4588 mask of the tm attributes found therein. */
4591 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4593 tree binfo
= TYPE_BINFO (type
);
4597 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4599 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4601 if (!TYPE_POLYMORPHIC_P (basetype
))
4604 o
= look_for_overrides_here (basetype
, fndecl
);
4606 found
|= tm_attr_to_mask (find_tm_attribute
4607 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4609 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4615 /* Subroutine of set_method_tm_attributes. Handle the checks and
4616 inheritance for one virtual method FNDECL. */
4619 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4624 found
= look_for_tm_attr_overrides (type
, fndecl
);
4626 /* If FNDECL doesn't actually override anything (i.e. T is the
4627 class that first declares FNDECL virtual), then we're done. */
4631 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4632 have
= tm_attr_to_mask (tm_attr
);
4634 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4635 tm_pure must match exactly, otherwise no weakening of
4636 tm_safe > tm_callable > nothing. */
4637 /* ??? The tm_pure attribute didn't make the transition to the
4638 multivendor language spec. */
4639 if (have
== TM_ATTR_PURE
)
4641 if (found
!= TM_ATTR_PURE
)
4647 /* If the overridden function is tm_pure, then FNDECL must be. */
4648 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4650 /* Look for base class combinations that cannot be satisfied. */
4651 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4653 found
&= ~TM_ATTR_PURE
;
4655 error_at (DECL_SOURCE_LOCATION (fndecl
),
4656 "method overrides both %<transaction_pure%> and %qE methods",
4657 tm_mask_to_attr (found
));
4659 /* If FNDECL did not declare an attribute, then inherit the most
4661 else if (tm_attr
== NULL
)
4663 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4665 /* Otherwise validate that we're not weaker than a function
4666 that is being overridden. */
4670 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4676 error_at (DECL_SOURCE_LOCATION (fndecl
),
4677 "method declared %qE overriding %qE method",
4678 tm_attr
, tm_mask_to_attr (found
));
4681 /* For each of the methods in T, propagate a class-level tm attribute. */
4684 set_method_tm_attributes (tree t
)
4686 tree class_tm_attr
, fndecl
;
4688 /* Don't bother collecting tm attributes if transactional memory
4689 support is not enabled. */
4693 /* Process virtual methods first, as they inherit directly from the
4694 base virtual function and also require validation of new attributes. */
4695 if (TYPE_CONTAINS_VPTR_P (t
))
4698 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4699 vchain
= TREE_CHAIN (vchain
))
4701 fndecl
= BV_FN (vchain
);
4702 if (DECL_THUNK_P (fndecl
))
4703 fndecl
= THUNK_TARGET (fndecl
);
4704 set_one_vmethod_tm_attributes (t
, fndecl
);
4708 /* If the class doesn't have an attribute, nothing more to do. */
4709 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4710 if (class_tm_attr
== NULL
)
4713 /* Any method that does not yet have a tm attribute inherits
4714 the one from the class. */
4715 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4717 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4718 apply_tm_attr (fndecl
, class_tm_attr
);
4722 /* Returns true iff class T has a user-defined constructor other than
4723 the default constructor. */
4726 type_has_user_nondefault_constructor (tree t
)
4730 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4733 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4735 tree fn
= OVL_CURRENT (fns
);
4736 if (!DECL_ARTIFICIAL (fn
)
4737 && (TREE_CODE (fn
) == TEMPLATE_DECL
4738 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4746 /* Returns the defaulted constructor if T has one. Otherwise, returns
4750 in_class_defaulted_default_constructor (tree t
)
4754 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4757 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4759 tree fn
= OVL_CURRENT (fns
);
4761 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4763 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4764 while (args
&& TREE_PURPOSE (args
))
4765 args
= TREE_CHAIN (args
);
4766 if (!args
|| args
== void_list_node
)
4774 /* Returns true iff FN is a user-provided function, i.e. user-declared
4775 and not defaulted at its first declaration; or explicit, private,
4776 protected, or non-const. */
4779 user_provided_p (tree fn
)
4781 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4784 return (!DECL_ARTIFICIAL (fn
)
4785 && !DECL_DEFAULTED_IN_CLASS_P (fn
));
4788 /* Returns true iff class T has a user-provided constructor. */
4791 type_has_user_provided_constructor (tree t
)
4795 if (!CLASS_TYPE_P (t
))
4798 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4801 /* This can happen in error cases; avoid crashing. */
4802 if (!CLASSTYPE_METHOD_VEC (t
))
4805 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4806 if (user_provided_p (OVL_CURRENT (fns
)))
4812 /* Returns true iff class T has a user-provided default constructor. */
4815 type_has_user_provided_default_constructor (tree t
)
4819 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4822 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4824 tree fn
= OVL_CURRENT (fns
);
4825 if (TREE_CODE (fn
) == FUNCTION_DECL
4826 && user_provided_p (fn
)
4827 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4834 /* TYPE is being used as a virtual base, and has a non-trivial move
4835 assignment. Return true if this is due to there being a user-provided
4836 move assignment in TYPE or one of its subobjects; if there isn't, then
4837 multiple move assignment can't cause any harm. */
4840 vbase_has_user_provided_move_assign (tree type
)
4842 /* Does the type itself have a user-provided move assignment operator? */
4844 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4845 fns
; fns
= OVL_NEXT (fns
))
4847 tree fn
= OVL_CURRENT (fns
);
4848 if (move_fn_p (fn
) && user_provided_p (fn
))
4852 /* Do any of its bases? */
4853 tree binfo
= TYPE_BINFO (type
);
4855 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4856 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
4859 /* Or non-static data members? */
4860 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4862 if (TREE_CODE (field
) == FIELD_DECL
4863 && CLASS_TYPE_P (TREE_TYPE (field
))
4864 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
4872 /* If default-initialization leaves part of TYPE uninitialized, returns
4873 a DECL for the field or TYPE itself (DR 253). */
4876 default_init_uninitialized_part (tree type
)
4881 type
= strip_array_types (type
);
4882 if (!CLASS_TYPE_P (type
))
4884 if (type_has_user_provided_default_constructor (type
))
4886 for (binfo
= TYPE_BINFO (type
), i
= 0;
4887 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
4889 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
4893 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
4894 if (TREE_CODE (t
) == FIELD_DECL
4895 && !DECL_ARTIFICIAL (t
)
4896 && !DECL_INITIAL (t
))
4898 r
= default_init_uninitialized_part (TREE_TYPE (t
));
4900 return DECL_P (r
) ? r
: t
;
4906 /* Returns true iff for class T, a trivial synthesized default constructor
4907 would be constexpr. */
4910 trivial_default_constructor_is_constexpr (tree t
)
4912 /* A defaulted trivial default constructor is constexpr
4913 if there is nothing to initialize. */
4914 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
4915 return is_really_empty_class (t
);
4918 /* Returns true iff class T has a constexpr default constructor. */
4921 type_has_constexpr_default_constructor (tree t
)
4925 if (!CLASS_TYPE_P (t
))
4927 /* The caller should have stripped an enclosing array. */
4928 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
4931 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
4933 if (!TYPE_HAS_COMPLEX_DFLT (t
))
4934 return trivial_default_constructor_is_constexpr (t
);
4935 /* Non-trivial, we need to check subobject constructors. */
4936 lazily_declare_fn (sfk_constructor
, t
);
4938 fns
= locate_ctor (t
);
4939 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
4942 /* Returns true iff class TYPE has a virtual destructor. */
4945 type_has_virtual_destructor (tree type
)
4949 if (!CLASS_TYPE_P (type
))
4952 gcc_assert (COMPLETE_TYPE_P (type
));
4953 dtor
= CLASSTYPE_DESTRUCTORS (type
);
4954 return (dtor
&& DECL_VIRTUAL_P (dtor
));
4957 /* Returns true iff class T has a move constructor. */
4960 type_has_move_constructor (tree t
)
4964 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
4966 gcc_assert (COMPLETE_TYPE_P (t
));
4967 lazily_declare_fn (sfk_move_constructor
, t
);
4970 if (!CLASSTYPE_METHOD_VEC (t
))
4973 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4974 if (move_fn_p (OVL_CURRENT (fns
)))
4980 /* Returns true iff class T has a move assignment operator. */
4983 type_has_move_assign (tree t
)
4987 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
4989 gcc_assert (COMPLETE_TYPE_P (t
));
4990 lazily_declare_fn (sfk_move_assignment
, t
);
4993 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
4994 fns
; fns
= OVL_NEXT (fns
))
4995 if (move_fn_p (OVL_CURRENT (fns
)))
5001 /* Returns true iff class T has a move constructor that was explicitly
5002 declared in the class body. Note that this is different from
5003 "user-provided", which doesn't include functions that are defaulted in
5007 type_has_user_declared_move_constructor (tree t
)
5011 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5014 if (!CLASSTYPE_METHOD_VEC (t
))
5017 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5019 tree fn
= OVL_CURRENT (fns
);
5020 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5027 /* Returns true iff class T has a move assignment operator that was
5028 explicitly declared in the class body. */
5031 type_has_user_declared_move_assign (tree t
)
5035 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5038 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5039 fns
; fns
= OVL_NEXT (fns
))
5041 tree fn
= OVL_CURRENT (fns
);
5042 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5049 /* Nonzero if we need to build up a constructor call when initializing an
5050 object of this class, either because it has a user-provided constructor
5051 or because it doesn't have a default constructor (so we need to give an
5052 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5053 what you care about is whether or not an object can be produced by a
5054 constructor (e.g. so we don't set TREE_READONLY on const variables of
5055 such type); use this function when what you care about is whether or not
5056 to try to call a constructor to create an object. The latter case is
5057 the former plus some cases of constructors that cannot be called. */
5060 type_build_ctor_call (tree t
)
5063 if (TYPE_NEEDS_CONSTRUCTING (t
))
5065 inner
= strip_array_types (t
);
5066 return (CLASS_TYPE_P (inner
) && !TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
)
5067 && !ANON_AGGR_TYPE_P (inner
));
5070 /* Remove all zero-width bit-fields from T. */
5073 remove_zero_width_bit_fields (tree t
)
5077 fieldsp
= &TYPE_FIELDS (t
);
5080 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5081 && DECL_C_BIT_FIELD (*fieldsp
)
5082 /* We should not be confused by the fact that grokbitfield
5083 temporarily sets the width of the bit field into
5084 DECL_INITIAL (*fieldsp).
5085 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5087 && integer_zerop (DECL_SIZE (*fieldsp
)))
5088 *fieldsp
= DECL_CHAIN (*fieldsp
);
5090 fieldsp
= &DECL_CHAIN (*fieldsp
);
5094 /* Returns TRUE iff we need a cookie when dynamically allocating an
5095 array whose elements have the indicated class TYPE. */
5098 type_requires_array_cookie (tree type
)
5101 bool has_two_argument_delete_p
= false;
5103 gcc_assert (CLASS_TYPE_P (type
));
5105 /* If there's a non-trivial destructor, we need a cookie. In order
5106 to iterate through the array calling the destructor for each
5107 element, we'll have to know how many elements there are. */
5108 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5111 /* If the usual deallocation function is a two-argument whose second
5112 argument is of type `size_t', then we have to pass the size of
5113 the array to the deallocation function, so we will need to store
5115 fns
= lookup_fnfields (TYPE_BINFO (type
),
5116 ansi_opname (VEC_DELETE_EXPR
),
5118 /* If there are no `operator []' members, or the lookup is
5119 ambiguous, then we don't need a cookie. */
5120 if (!fns
|| fns
== error_mark_node
)
5122 /* Loop through all of the functions. */
5123 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5128 /* Select the current function. */
5129 fn
= OVL_CURRENT (fns
);
5130 /* See if this function is a one-argument delete function. If
5131 it is, then it will be the usual deallocation function. */
5132 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5133 if (second_parm
== void_list_node
)
5135 /* Do not consider this function if its second argument is an
5139 /* Otherwise, if we have a two-argument function and the second
5140 argument is `size_t', it will be the usual deallocation
5141 function -- unless there is one-argument function, too. */
5142 if (TREE_CHAIN (second_parm
) == void_list_node
5143 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5144 has_two_argument_delete_p
= true;
5147 return has_two_argument_delete_p
;
5150 /* Finish computing the `literal type' property of class type T.
5152 At this point, we have already processed base classes and
5153 non-static data members. We need to check whether the copy
5154 constructor is trivial, the destructor is trivial, and there
5155 is a trivial default constructor or at least one constexpr
5156 constructor other than the copy constructor. */
5159 finalize_literal_type_property (tree t
)
5163 if (cxx_dialect
< cxx0x
5164 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5165 CLASSTYPE_LITERAL_P (t
) = false;
5166 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5167 && CLASSTYPE_NON_AGGREGATE (t
)
5168 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5169 CLASSTYPE_LITERAL_P (t
) = false;
5171 if (!CLASSTYPE_LITERAL_P (t
))
5172 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5173 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5174 && TREE_CODE (fn
) != TEMPLATE_DECL
5175 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5176 && !DECL_CONSTRUCTOR_P (fn
))
5178 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5179 if (!DECL_GENERATED_P (fn
))
5181 error ("enclosing class of constexpr non-static member "
5182 "function %q+#D is not a literal type", fn
);
5183 explain_non_literal_class (t
);
5188 /* T is a non-literal type used in a context which requires a constant
5189 expression. Explain why it isn't literal. */
5192 explain_non_literal_class (tree t
)
5194 static struct pointer_set_t
*diagnosed
;
5196 if (!CLASS_TYPE_P (t
))
5198 t
= TYPE_MAIN_VARIANT (t
);
5200 if (diagnosed
== NULL
)
5201 diagnosed
= pointer_set_create ();
5202 if (pointer_set_insert (diagnosed
, t
) != 0)
5203 /* Already explained. */
5206 inform (0, "%q+T is not literal because:", t
);
5207 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5208 inform (0, " %q+T has a non-trivial destructor", t
);
5209 else if (CLASSTYPE_NON_AGGREGATE (t
)
5210 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5211 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5213 inform (0, " %q+T is not an aggregate, does not have a trivial "
5214 "default constructor, and has no constexpr constructor that "
5215 "is not a copy or move constructor", t
);
5216 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5217 && !type_has_user_provided_default_constructor (t
))
5219 /* Note that we can't simply call locate_ctor because when the
5220 constructor is deleted it just returns NULL_TREE. */
5222 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5224 tree fn
= OVL_CURRENT (fns
);
5225 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5227 parms
= skip_artificial_parms_for (fn
, parms
);
5229 if (sufficient_parms_p (parms
))
5231 if (DECL_DELETED_FN (fn
))
5232 maybe_explain_implicit_delete (fn
);
5234 explain_invalid_constexpr_fn (fn
);
5242 tree binfo
, base_binfo
, field
; int i
;
5243 for (binfo
= TYPE_BINFO (t
), i
= 0;
5244 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5246 tree basetype
= TREE_TYPE (base_binfo
);
5247 if (!CLASSTYPE_LITERAL_P (basetype
))
5249 inform (0, " base class %qT of %q+T is non-literal",
5251 explain_non_literal_class (basetype
);
5255 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5258 if (TREE_CODE (field
) != FIELD_DECL
)
5260 ftype
= TREE_TYPE (field
);
5261 if (!literal_type_p (ftype
))
5263 inform (0, " non-static data member %q+D has "
5264 "non-literal type", field
);
5265 if (CLASS_TYPE_P (ftype
))
5266 explain_non_literal_class (ftype
);
5272 /* Check the validity of the bases and members declared in T. Add any
5273 implicitly-generated functions (like copy-constructors and
5274 assignment operators). Compute various flag bits (like
5275 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5276 level: i.e., independently of the ABI in use. */
5279 check_bases_and_members (tree t
)
5281 /* Nonzero if the implicitly generated copy constructor should take
5282 a non-const reference argument. */
5283 int cant_have_const_ctor
;
5284 /* Nonzero if the implicitly generated assignment operator
5285 should take a non-const reference argument. */
5286 int no_const_asn_ref
;
5288 bool saved_complex_asn_ref
;
5289 bool saved_nontrivial_dtor
;
5292 /* By default, we use const reference arguments and generate default
5294 cant_have_const_ctor
= 0;
5295 no_const_asn_ref
= 0;
5297 /* Check all the base-classes. */
5298 check_bases (t
, &cant_have_const_ctor
,
5301 /* Deduce noexcept on destructors. This needs to happen after we've set
5302 triviality flags appropriately for our bases. */
5303 if (cxx_dialect
>= cxx0x
)
5304 deduce_noexcept_on_destructors (t
);
5306 /* Check all the method declarations. */
5309 /* Save the initial values of these flags which only indicate whether
5310 or not the class has user-provided functions. As we analyze the
5311 bases and members we can set these flags for other reasons. */
5312 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5313 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5315 /* Check all the data member declarations. We cannot call
5316 check_field_decls until we have called check_bases check_methods,
5317 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5318 being set appropriately. */
5319 check_field_decls (t
, &access_decls
,
5320 &cant_have_const_ctor
,
5323 /* A nearly-empty class has to be vptr-containing; a nearly empty
5324 class contains just a vptr. */
5325 if (!TYPE_CONTAINS_VPTR_P (t
))
5326 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5328 /* Do some bookkeeping that will guide the generation of implicitly
5329 declared member functions. */
5330 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5331 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5332 /* We need to call a constructor for this class if it has a
5333 user-provided constructor, or if the default constructor is going
5334 to initialize the vptr. (This is not an if-and-only-if;
5335 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5336 themselves need constructing.) */
5337 TYPE_NEEDS_CONSTRUCTING (t
)
5338 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5341 An aggregate is an array or a class with no user-provided
5342 constructors ... and no virtual functions.
5344 Again, other conditions for being an aggregate are checked
5346 CLASSTYPE_NON_AGGREGATE (t
)
5347 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5348 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5349 retain the old definition internally for ABI reasons. */
5350 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5351 |= (CLASSTYPE_NON_AGGREGATE (t
)
5352 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5353 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5354 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5355 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5356 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5358 /* If the class has no user-declared constructor, but does have
5359 non-static const or reference data members that can never be
5360 initialized, issue a warning. */
5361 if (warn_uninitialized
5362 /* Classes with user-declared constructors are presumed to
5363 initialize these members. */
5364 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5365 /* Aggregates can be initialized with brace-enclosed
5367 && CLASSTYPE_NON_AGGREGATE (t
))
5371 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5375 if (TREE_CODE (field
) != FIELD_DECL
5376 || DECL_INITIAL (field
) != NULL_TREE
)
5379 type
= TREE_TYPE (field
);
5380 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5381 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5382 "in class without a constructor", field
);
5383 else if (CP_TYPE_CONST_P (type
)
5384 && (!CLASS_TYPE_P (type
)
5385 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5386 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5387 "in class without a constructor", field
);
5391 /* Synthesize any needed methods. */
5392 add_implicitly_declared_members (t
, &access_decls
,
5393 cant_have_const_ctor
,
5396 /* Check defaulted declarations here so we have cant_have_const_ctor
5397 and don't need to worry about clones. */
5398 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5399 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5401 int copy
= copy_fn_p (fn
);
5405 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5406 : !no_const_asn_ref
);
5407 bool fn_const_p
= (copy
== 2);
5409 if (fn_const_p
&& !imp_const_p
)
5410 /* If the function is defaulted outside the class, we just
5411 give the synthesis error. */
5412 error ("%q+D declared to take const reference, but implicit "
5413 "declaration would take non-const", fn
);
5415 defaulted_late_check (fn
);
5418 if (LAMBDA_TYPE_P (t
))
5420 /* "The closure type associated with a lambda-expression has a deleted
5421 default constructor and a deleted copy assignment operator." */
5422 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5423 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5424 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5425 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5427 /* "This class type is not an aggregate." */
5428 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5431 /* Compute the 'literal type' property before we
5432 do anything with non-static member functions. */
5433 finalize_literal_type_property (t
);
5435 /* Create the in-charge and not-in-charge variants of constructors
5437 clone_constructors_and_destructors (t
);
5439 /* Process the using-declarations. */
5440 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5441 handle_using_decl (TREE_VALUE (access_decls
), t
);
5443 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5444 finish_struct_methods (t
);
5446 /* Figure out whether or not we will need a cookie when dynamically
5447 allocating an array of this type. */
5448 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5449 = type_requires_array_cookie (t
);
5452 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5453 accordingly. If a new vfield was created (because T doesn't have a
5454 primary base class), then the newly created field is returned. It
5455 is not added to the TYPE_FIELDS list; it is the caller's
5456 responsibility to do that. Accumulate declared virtual functions
5460 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5464 /* Collect the virtual functions declared in T. */
5465 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5466 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5467 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5469 tree new_virtual
= make_node (TREE_LIST
);
5471 BV_FN (new_virtual
) = fn
;
5472 BV_DELTA (new_virtual
) = integer_zero_node
;
5473 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5475 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5476 *virtuals_p
= new_virtual
;
5479 /* If we couldn't find an appropriate base class, create a new field
5480 here. Even if there weren't any new virtual functions, we might need a
5481 new virtual function table if we're supposed to include vptrs in
5482 all classes that need them. */
5483 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5485 /* We build this decl with vtbl_ptr_type_node, which is a
5486 `vtable_entry_type*'. It might seem more precise to use
5487 `vtable_entry_type (*)[N]' where N is the number of virtual
5488 functions. However, that would require the vtable pointer in
5489 base classes to have a different type than the vtable pointer
5490 in derived classes. We could make that happen, but that
5491 still wouldn't solve all the problems. In particular, the
5492 type-based alias analysis code would decide that assignments
5493 to the base class vtable pointer can't alias assignments to
5494 the derived class vtable pointer, since they have different
5495 types. Thus, in a derived class destructor, where the base
5496 class constructor was inlined, we could generate bad code for
5497 setting up the vtable pointer.
5499 Therefore, we use one type for all vtable pointers. We still
5500 use a type-correct type; it's just doesn't indicate the array
5501 bounds. That's better than using `void*' or some such; it's
5502 cleaner, and it let's the alias analysis code know that these
5503 stores cannot alias stores to void*! */
5506 field
= build_decl (input_location
,
5507 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5508 DECL_VIRTUAL_P (field
) = 1;
5509 DECL_ARTIFICIAL (field
) = 1;
5510 DECL_FIELD_CONTEXT (field
) = t
;
5511 DECL_FCONTEXT (field
) = t
;
5512 if (TYPE_PACKED (t
))
5513 DECL_PACKED (field
) = 1;
5515 TYPE_VFIELD (t
) = field
;
5517 /* This class is non-empty. */
5518 CLASSTYPE_EMPTY_P (t
) = 0;
5526 /* Add OFFSET to all base types of BINFO which is a base in the
5527 hierarchy dominated by T.
5529 OFFSET, which is a type offset, is number of bytes. */
5532 propagate_binfo_offsets (tree binfo
, tree offset
)
5538 /* Update BINFO's offset. */
5539 BINFO_OFFSET (binfo
)
5540 = convert (sizetype
,
5541 size_binop (PLUS_EXPR
,
5542 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5545 /* Find the primary base class. */
5546 primary_binfo
= get_primary_binfo (binfo
);
5548 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5549 propagate_binfo_offsets (primary_binfo
, offset
);
5551 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5553 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5555 /* Don't do the primary base twice. */
5556 if (base_binfo
== primary_binfo
)
5559 if (BINFO_VIRTUAL_P (base_binfo
))
5562 propagate_binfo_offsets (base_binfo
, offset
);
5566 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5567 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5568 empty subobjects of T. */
5571 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5575 bool first_vbase
= true;
5578 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5581 if (!abi_version_at_least(2))
5583 /* In G++ 3.2, we incorrectly rounded the size before laying out
5584 the virtual bases. */
5585 finish_record_layout (rli
, /*free_p=*/false);
5586 #ifdef STRUCTURE_SIZE_BOUNDARY
5587 /* Packed structures don't need to have minimum size. */
5588 if (! TYPE_PACKED (t
))
5589 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5591 rli
->offset
= TYPE_SIZE_UNIT (t
);
5592 rli
->bitpos
= bitsize_zero_node
;
5593 rli
->record_align
= TYPE_ALIGN (t
);
5596 /* Find the last field. The artificial fields created for virtual
5597 bases will go after the last extant field to date. */
5598 next_field
= &TYPE_FIELDS (t
);
5600 next_field
= &DECL_CHAIN (*next_field
);
5602 /* Go through the virtual bases, allocating space for each virtual
5603 base that is not already a primary base class. These are
5604 allocated in inheritance graph order. */
5605 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5607 if (!BINFO_VIRTUAL_P (vbase
))
5610 if (!BINFO_PRIMARY_P (vbase
))
5612 tree basetype
= TREE_TYPE (vbase
);
5614 /* This virtual base is not a primary base of any class in the
5615 hierarchy, so we have to add space for it. */
5616 next_field
= build_base_field (rli
, vbase
,
5617 offsets
, next_field
);
5619 /* If the first virtual base might have been placed at a
5620 lower address, had we started from CLASSTYPE_SIZE, rather
5621 than TYPE_SIZE, issue a warning. There can be both false
5622 positives and false negatives from this warning in rare
5623 cases; to deal with all the possibilities would probably
5624 require performing both layout algorithms and comparing
5625 the results which is not particularly tractable. */
5629 (size_binop (CEIL_DIV_EXPR
,
5630 round_up_loc (input_location
,
5632 CLASSTYPE_ALIGN (basetype
)),
5634 BINFO_OFFSET (vbase
))))
5636 "offset of virtual base %qT is not ABI-compliant and "
5637 "may change in a future version of GCC",
5640 first_vbase
= false;
5645 /* Returns the offset of the byte just past the end of the base class
5649 end_of_base (tree binfo
)
5653 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5654 size
= TYPE_SIZE_UNIT (char_type_node
);
5655 else if (is_empty_class (BINFO_TYPE (binfo
)))
5656 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5657 allocate some space for it. It cannot have virtual bases, so
5658 TYPE_SIZE_UNIT is fine. */
5659 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5661 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5663 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5666 /* Returns the offset of the byte just past the end of the base class
5667 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5668 only non-virtual bases are included. */
5671 end_of_class (tree t
, int include_virtuals_p
)
5673 tree result
= size_zero_node
;
5674 vec
<tree
, va_gc
> *vbases
;
5680 for (binfo
= TYPE_BINFO (t
), i
= 0;
5681 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5683 if (!include_virtuals_p
5684 && BINFO_VIRTUAL_P (base_binfo
)
5685 && (!BINFO_PRIMARY_P (base_binfo
)
5686 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5689 offset
= end_of_base (base_binfo
);
5690 if (INT_CST_LT_UNSIGNED (result
, offset
))
5694 /* G++ 3.2 did not check indirect virtual bases. */
5695 if (abi_version_at_least (2) && include_virtuals_p
)
5696 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5697 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5699 offset
= end_of_base (base_binfo
);
5700 if (INT_CST_LT_UNSIGNED (result
, offset
))
5707 /* Warn about bases of T that are inaccessible because they are
5708 ambiguous. For example:
5711 struct T : public S {};
5712 struct U : public S, public T {};
5714 Here, `(S*) new U' is not allowed because there are two `S'
5718 warn_about_ambiguous_bases (tree t
)
5721 vec
<tree
, va_gc
> *vbases
;
5726 /* If there are no repeated bases, nothing can be ambiguous. */
5727 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5730 /* Check direct bases. */
5731 for (binfo
= TYPE_BINFO (t
), i
= 0;
5732 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5734 basetype
= BINFO_TYPE (base_binfo
);
5736 if (!uniquely_derived_from_p (basetype
, t
))
5737 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5741 /* Check for ambiguous virtual bases. */
5743 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5744 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5746 basetype
= BINFO_TYPE (binfo
);
5748 if (!uniquely_derived_from_p (basetype
, t
))
5749 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5750 "to ambiguity", basetype
, t
);
5754 /* Compare two INTEGER_CSTs K1 and K2. */
5757 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5759 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5762 /* Increase the size indicated in RLI to account for empty classes
5763 that are "off the end" of the class. */
5766 include_empty_classes (record_layout_info rli
)
5771 /* It might be the case that we grew the class to allocate a
5772 zero-sized base class. That won't be reflected in RLI, yet,
5773 because we are willing to overlay multiple bases at the same
5774 offset. However, now we need to make sure that RLI is big enough
5775 to reflect the entire class. */
5776 eoc
= end_of_class (rli
->t
,
5777 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5778 rli_size
= rli_size_unit_so_far (rli
);
5779 if (TREE_CODE (rli_size
) == INTEGER_CST
5780 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
5782 if (!abi_version_at_least (2))
5783 /* In version 1 of the ABI, the size of a class that ends with
5784 a bitfield was not rounded up to a whole multiple of a
5785 byte. Because rli_size_unit_so_far returns only the number
5786 of fully allocated bytes, any extra bits were not included
5788 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
5790 /* The size should have been rounded to a whole byte. */
5791 gcc_assert (tree_int_cst_equal
5792 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5794 = size_binop (PLUS_EXPR
,
5796 size_binop (MULT_EXPR
,
5797 convert (bitsizetype
,
5798 size_binop (MINUS_EXPR
,
5800 bitsize_int (BITS_PER_UNIT
)));
5801 normalize_rli (rli
);
5805 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5806 BINFO_OFFSETs for all of the base-classes. Position the vtable
5807 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5810 layout_class_type (tree t
, tree
*virtuals_p
)
5812 tree non_static_data_members
;
5815 record_layout_info rli
;
5816 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5817 types that appear at that offset. */
5818 splay_tree empty_base_offsets
;
5819 /* True if the last field layed out was a bit-field. */
5820 bool last_field_was_bitfield
= false;
5821 /* The location at which the next field should be inserted. */
5823 /* T, as a base class. */
5826 /* Keep track of the first non-static data member. */
5827 non_static_data_members
= TYPE_FIELDS (t
);
5829 /* Start laying out the record. */
5830 rli
= start_record_layout (t
);
5832 /* Mark all the primary bases in the hierarchy. */
5833 determine_primary_bases (t
);
5835 /* Create a pointer to our virtual function table. */
5836 vptr
= create_vtable_ptr (t
, virtuals_p
);
5838 /* The vptr is always the first thing in the class. */
5841 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
5842 TYPE_FIELDS (t
) = vptr
;
5843 next_field
= &DECL_CHAIN (vptr
);
5844 place_field (rli
, vptr
);
5847 next_field
= &TYPE_FIELDS (t
);
5849 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5850 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5852 build_base_fields (rli
, empty_base_offsets
, next_field
);
5854 /* Layout the non-static data members. */
5855 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
5860 /* We still pass things that aren't non-static data members to
5861 the back end, in case it wants to do something with them. */
5862 if (TREE_CODE (field
) != FIELD_DECL
)
5864 place_field (rli
, field
);
5865 /* If the static data member has incomplete type, keep track
5866 of it so that it can be completed later. (The handling
5867 of pending statics in finish_record_layout is
5868 insufficient; consider:
5871 struct S2 { static S1 s1; };
5873 At this point, finish_record_layout will be called, but
5874 S1 is still incomplete.) */
5877 maybe_register_incomplete_var (field
);
5878 /* The visibility of static data members is determined
5879 at their point of declaration, not their point of
5881 determine_visibility (field
);
5886 type
= TREE_TYPE (field
);
5887 if (type
== error_mark_node
)
5890 padding
= NULL_TREE
;
5892 /* If this field is a bit-field whose width is greater than its
5893 type, then there are some special rules for allocating
5895 if (DECL_C_BIT_FIELD (field
)
5896 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
5900 bool was_unnamed_p
= false;
5901 /* We must allocate the bits as if suitably aligned for the
5902 longest integer type that fits in this many bits. type
5903 of the field. Then, we are supposed to use the left over
5904 bits as additional padding. */
5905 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
5906 if (integer_types
[itk
] != NULL_TREE
5907 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
5908 TYPE_SIZE (integer_types
[itk
]))
5909 || INT_CST_LT (DECL_SIZE (field
),
5910 TYPE_SIZE (integer_types
[itk
]))))
5913 /* ITK now indicates a type that is too large for the
5914 field. We have to back up by one to find the largest
5919 integer_type
= integer_types
[itk
];
5920 } while (itk
> 0 && integer_type
== NULL_TREE
);
5922 /* Figure out how much additional padding is required. GCC
5923 3.2 always created a padding field, even if it had zero
5925 if (!abi_version_at_least (2)
5926 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
5928 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
5929 /* In a union, the padding field must have the full width
5930 of the bit-field; all fields start at offset zero. */
5931 padding
= DECL_SIZE (field
);
5934 if (TREE_CODE (t
) == UNION_TYPE
)
5935 warning (OPT_Wabi
, "size assigned to %qT may not be "
5936 "ABI-compliant and may change in a future "
5939 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
5940 TYPE_SIZE (integer_type
));
5943 #ifdef PCC_BITFIELD_TYPE_MATTERS
5944 /* An unnamed bitfield does not normally affect the
5945 alignment of the containing class on a target where
5946 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
5947 make any exceptions for unnamed bitfields when the
5948 bitfields are longer than their types. Therefore, we
5949 temporarily give the field a name. */
5950 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
5952 was_unnamed_p
= true;
5953 DECL_NAME (field
) = make_anon_name ();
5956 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
5957 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
5958 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
5959 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5960 empty_base_offsets
);
5962 DECL_NAME (field
) = NULL_TREE
;
5963 /* Now that layout has been performed, set the size of the
5964 field to the size of its declared type; the rest of the
5965 field is effectively invisible. */
5966 DECL_SIZE (field
) = TYPE_SIZE (type
);
5967 /* We must also reset the DECL_MODE of the field. */
5968 if (abi_version_at_least (2))
5969 DECL_MODE (field
) = TYPE_MODE (type
);
5971 && DECL_MODE (field
) != TYPE_MODE (type
))
5972 /* Versions of G++ before G++ 3.4 did not reset the
5975 "the offset of %qD may not be ABI-compliant and may "
5976 "change in a future version of GCC", field
);
5979 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
5980 empty_base_offsets
);
5982 /* Remember the location of any empty classes in FIELD. */
5983 if (abi_version_at_least (2))
5984 record_subobject_offsets (TREE_TYPE (field
),
5985 byte_position(field
),
5987 /*is_data_member=*/true);
5989 /* If a bit-field does not immediately follow another bit-field,
5990 and yet it starts in the middle of a byte, we have failed to
5991 comply with the ABI. */
5993 && DECL_C_BIT_FIELD (field
)
5994 /* The TREE_NO_WARNING flag gets set by Objective-C when
5995 laying out an Objective-C class. The ObjC ABI differs
5996 from the C++ ABI, and so we do not want a warning
5998 && !TREE_NO_WARNING (field
)
5999 && !last_field_was_bitfield
6000 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6001 DECL_FIELD_BIT_OFFSET (field
),
6002 bitsize_unit_node
)))
6003 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6004 "change in a future version of GCC", field
);
6006 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6007 offset of the field. */
6009 && !abi_version_at_least (2)
6010 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
6011 byte_position (field
))
6012 && contains_empty_class_p (TREE_TYPE (field
)))
6013 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
6014 "classes to be placed at different locations in a "
6015 "future version of GCC", field
);
6017 /* The middle end uses the type of expressions to determine the
6018 possible range of expression values. In order to optimize
6019 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6020 must be made aware of the width of "i", via its type.
6022 Because C++ does not have integer types of arbitrary width,
6023 we must (for the purposes of the front end) convert from the
6024 type assigned here to the declared type of the bitfield
6025 whenever a bitfield expression is used as an rvalue.
6026 Similarly, when assigning a value to a bitfield, the value
6027 must be converted to the type given the bitfield here. */
6028 if (DECL_C_BIT_FIELD (field
))
6030 unsigned HOST_WIDE_INT width
;
6031 tree ftype
= TREE_TYPE (field
);
6032 width
= tree_low_cst (DECL_SIZE (field
), /*unsignedp=*/1);
6033 if (width
!= TYPE_PRECISION (ftype
))
6036 = c_build_bitfield_integer_type (width
,
6037 TYPE_UNSIGNED (ftype
));
6039 = cp_build_qualified_type (TREE_TYPE (field
),
6040 cp_type_quals (ftype
));
6044 /* If we needed additional padding after this field, add it
6050 padding_field
= build_decl (input_location
,
6054 DECL_BIT_FIELD (padding_field
) = 1;
6055 DECL_SIZE (padding_field
) = padding
;
6056 DECL_CONTEXT (padding_field
) = t
;
6057 DECL_ARTIFICIAL (padding_field
) = 1;
6058 DECL_IGNORED_P (padding_field
) = 1;
6059 layout_nonempty_base_or_field (rli
, padding_field
,
6061 empty_base_offsets
);
6064 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6067 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6069 /* Make sure that we are on a byte boundary so that the size of
6070 the class without virtual bases will always be a round number
6072 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6073 normalize_rli (rli
);
6076 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6078 if (!abi_version_at_least (2))
6079 include_empty_classes(rli
);
6081 /* Delete all zero-width bit-fields from the list of fields. Now
6082 that the type is laid out they are no longer important. */
6083 remove_zero_width_bit_fields (t
);
6085 /* Create the version of T used for virtual bases. We do not use
6086 make_class_type for this version; this is an artificial type. For
6087 a POD type, we just reuse T. */
6088 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6090 base_t
= make_node (TREE_CODE (t
));
6092 /* Set the size and alignment for the new type. In G++ 3.2, all
6093 empty classes were considered to have size zero when used as
6095 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6097 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6098 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6099 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6101 "layout of classes derived from empty class %qT "
6102 "may change in a future version of GCC",
6109 /* If the ABI version is not at least two, and the last
6110 field was a bit-field, RLI may not be on a byte
6111 boundary. In particular, rli_size_unit_so_far might
6112 indicate the last complete byte, while rli_size_so_far
6113 indicates the total number of bits used. Therefore,
6114 rli_size_so_far, rather than rli_size_unit_so_far, is
6115 used to compute TYPE_SIZE_UNIT. */
6116 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6117 TYPE_SIZE_UNIT (base_t
)
6118 = size_binop (MAX_EXPR
,
6120 size_binop (CEIL_DIV_EXPR
,
6121 rli_size_so_far (rli
),
6122 bitsize_int (BITS_PER_UNIT
))),
6125 = size_binop (MAX_EXPR
,
6126 rli_size_so_far (rli
),
6127 size_binop (MULT_EXPR
,
6128 convert (bitsizetype
, eoc
),
6129 bitsize_int (BITS_PER_UNIT
)));
6131 TYPE_ALIGN (base_t
) = rli
->record_align
;
6132 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6134 /* Copy the fields from T. */
6135 next_field
= &TYPE_FIELDS (base_t
);
6136 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6137 if (TREE_CODE (field
) == FIELD_DECL
)
6139 *next_field
= build_decl (input_location
,
6143 DECL_CONTEXT (*next_field
) = base_t
;
6144 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6145 DECL_FIELD_BIT_OFFSET (*next_field
)
6146 = DECL_FIELD_BIT_OFFSET (field
);
6147 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6148 DECL_MODE (*next_field
) = DECL_MODE (field
);
6149 next_field
= &DECL_CHAIN (*next_field
);
6152 /* Record the base version of the type. */
6153 CLASSTYPE_AS_BASE (t
) = base_t
;
6154 TYPE_CONTEXT (base_t
) = t
;
6157 CLASSTYPE_AS_BASE (t
) = t
;
6159 /* Every empty class contains an empty class. */
6160 if (CLASSTYPE_EMPTY_P (t
))
6161 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6163 /* Set the TYPE_DECL for this type to contain the right
6164 value for DECL_OFFSET, so that we can use it as part
6165 of a COMPONENT_REF for multiple inheritance. */
6166 layout_decl (TYPE_MAIN_DECL (t
), 0);
6168 /* Now fix up any virtual base class types that we left lying
6169 around. We must get these done before we try to lay out the
6170 virtual function table. As a side-effect, this will remove the
6171 base subobject fields. */
6172 layout_virtual_bases (rli
, empty_base_offsets
);
6174 /* Make sure that empty classes are reflected in RLI at this
6176 include_empty_classes(rli
);
6178 /* Make sure not to create any structures with zero size. */
6179 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6181 build_decl (input_location
,
6182 FIELD_DECL
, NULL_TREE
, char_type_node
));
6184 /* If this is a non-POD, declaring it packed makes a difference to how it
6185 can be used as a field; don't let finalize_record_size undo it. */
6186 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6187 rli
->packed_maybe_necessary
= true;
6189 /* Let the back end lay out the type. */
6190 finish_record_layout (rli
, /*free_p=*/true);
6192 /* Warn about bases that can't be talked about due to ambiguity. */
6193 warn_about_ambiguous_bases (t
);
6195 /* Now that we're done with layout, give the base fields the real types. */
6196 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6197 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6198 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6201 splay_tree_delete (empty_base_offsets
);
6203 if (CLASSTYPE_EMPTY_P (t
)
6204 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6205 TYPE_SIZE_UNIT (t
)))
6206 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6209 /* Determine the "key method" for the class type indicated by TYPE,
6210 and set CLASSTYPE_KEY_METHOD accordingly. */
6213 determine_key_method (tree type
)
6217 if (TYPE_FOR_JAVA (type
)
6218 || processing_template_decl
6219 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6220 || CLASSTYPE_INTERFACE_KNOWN (type
))
6223 /* The key method is the first non-pure virtual function that is not
6224 inline at the point of class definition. On some targets the
6225 key function may not be inline; those targets should not call
6226 this function until the end of the translation unit. */
6227 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6228 method
= DECL_CHAIN (method
))
6229 if (DECL_VINDEX (method
) != NULL_TREE
6230 && ! DECL_DECLARED_INLINE_P (method
)
6231 && ! DECL_PURE_VIRTUAL_P (method
))
6233 CLASSTYPE_KEY_METHOD (type
) = method
;
6241 /* Allocate and return an instance of struct sorted_fields_type with
6244 static struct sorted_fields_type
*
6245 sorted_fields_type_new (int n
)
6247 struct sorted_fields_type
*sft
;
6248 sft
= ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type
)
6249 + n
* sizeof (tree
));
6256 /* Perform processing required when the definition of T (a class type)
6260 finish_struct_1 (tree t
)
6263 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6264 tree virtuals
= NULL_TREE
;
6266 if (COMPLETE_TYPE_P (t
))
6268 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6269 error ("redefinition of %q#T", t
);
6274 /* If this type was previously laid out as a forward reference,
6275 make sure we lay it out again. */
6276 TYPE_SIZE (t
) = NULL_TREE
;
6277 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6279 /* Make assumptions about the class; we'll reset the flags if
6281 CLASSTYPE_EMPTY_P (t
) = 1;
6282 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6283 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6284 CLASSTYPE_LITERAL_P (t
) = true;
6286 /* Do end-of-class semantic processing: checking the validity of the
6287 bases and members and add implicitly generated methods. */
6288 check_bases_and_members (t
);
6290 /* Find the key method. */
6291 if (TYPE_CONTAINS_VPTR_P (t
))
6293 /* The Itanium C++ ABI permits the key method to be chosen when
6294 the class is defined -- even though the key method so
6295 selected may later turn out to be an inline function. On
6296 some systems (such as ARM Symbian OS) the key method cannot
6297 be determined until the end of the translation unit. On such
6298 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6299 will cause the class to be added to KEYED_CLASSES. Then, in
6300 finish_file we will determine the key method. */
6301 if (targetm
.cxx
.key_method_may_be_inline ())
6302 determine_key_method (t
);
6304 /* If a polymorphic class has no key method, we may emit the vtable
6305 in every translation unit where the class definition appears. */
6306 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6307 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6310 /* Layout the class itself. */
6311 layout_class_type (t
, &virtuals
);
6312 if (CLASSTYPE_AS_BASE (t
) != t
)
6313 /* We use the base type for trivial assignments, and hence it
6315 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6317 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6319 /* If necessary, create the primary vtable for this class. */
6320 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6322 /* We must enter these virtuals into the table. */
6323 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6324 build_primary_vtable (NULL_TREE
, t
);
6325 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6326 /* Here we know enough to change the type of our virtual
6327 function table, but we will wait until later this function. */
6328 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6330 /* If we're warning about ABI tags, check the types of the new
6331 virtual functions. */
6333 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6334 check_abi_tags (t
, TREE_VALUE (v
));
6337 if (TYPE_CONTAINS_VPTR_P (t
))
6342 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6343 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6344 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6345 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6347 /* Add entries for virtual functions introduced by this class. */
6348 BINFO_VIRTUALS (TYPE_BINFO (t
))
6349 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6351 /* Set DECL_VINDEX for all functions declared in this class. */
6352 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6354 fn
= TREE_CHAIN (fn
),
6355 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6356 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6358 tree fndecl
= BV_FN (fn
);
6360 if (DECL_THUNK_P (fndecl
))
6361 /* A thunk. We should never be calling this entry directly
6362 from this vtable -- we'd use the entry for the non
6363 thunk base function. */
6364 DECL_VINDEX (fndecl
) = NULL_TREE
;
6365 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6366 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6370 finish_struct_bits (t
);
6371 set_method_tm_attributes (t
);
6373 /* Complete the rtl for any static member objects of the type we're
6375 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6376 if (VAR_P (x
) && TREE_STATIC (x
)
6377 && TREE_TYPE (x
) != error_mark_node
6378 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6379 DECL_MODE (x
) = TYPE_MODE (t
);
6381 /* Done with FIELDS...now decide whether to sort these for
6382 faster lookups later.
6384 We use a small number because most searches fail (succeeding
6385 ultimately as the search bores through the inheritance
6386 hierarchy), and we want this failure to occur quickly. */
6388 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6390 /* Complain if one of the field types requires lower visibility. */
6391 constrain_class_visibility (t
);
6393 /* Make the rtl for any new vtables we have created, and unmark
6394 the base types we marked. */
6397 /* Build the VTT for T. */
6400 /* This warning does not make sense for Java classes, since they
6401 cannot have destructors. */
6402 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
))
6406 dtor
= CLASSTYPE_DESTRUCTORS (t
);
6407 if (/* An implicitly declared destructor is always public. And,
6408 if it were virtual, we would have created it by now. */
6410 || (!DECL_VINDEX (dtor
)
6411 && (/* public non-virtual */
6412 (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
6413 || (/* non-public non-virtual with friends */
6414 (TREE_PRIVATE (dtor
) || TREE_PROTECTED (dtor
))
6415 && (CLASSTYPE_FRIEND_CLASSES (t
)
6416 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))))))
6417 warning (OPT_Wnon_virtual_dtor
,
6418 "%q#T has virtual functions and accessible"
6419 " non-virtual destructor", t
);
6424 if (warn_overloaded_virtual
)
6427 /* Class layout, assignment of virtual table slots, etc., is now
6428 complete. Give the back end a chance to tweak the visibility of
6429 the class or perform any other required target modifications. */
6430 targetm
.cxx
.adjust_class_at_definition (t
);
6432 maybe_suppress_debug_info (t
);
6434 dump_class_hierarchy (t
);
6436 /* Finish debugging output for this type. */
6437 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6439 if (TYPE_TRANSPARENT_AGGR (t
))
6441 tree field
= first_field (t
);
6442 if (field
== NULL_TREE
|| error_operand_p (field
))
6444 error ("type transparent %q#T does not have any fields", t
);
6445 TYPE_TRANSPARENT_AGGR (t
) = 0;
6447 else if (DECL_ARTIFICIAL (field
))
6449 if (DECL_FIELD_IS_BASE (field
))
6450 error ("type transparent class %qT has base classes", t
);
6453 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6454 error ("type transparent class %qT has virtual functions", t
);
6456 TYPE_TRANSPARENT_AGGR (t
) = 0;
6458 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6460 error ("type transparent %q#T cannot be made transparent because "
6461 "the type of the first field has a different ABI from the "
6462 "class overall", t
);
6463 TYPE_TRANSPARENT_AGGR (t
) = 0;
6468 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6469 equal to THRESHOLD or greater than THRESHOLD. */
6472 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6474 int n_fields
= count_fields (fields
);
6475 if (n_fields
>= threshold
)
6477 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6478 add_fields_to_record_type (fields
, field_vec
, 0);
6479 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6480 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6484 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6487 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6489 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6494 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6495 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6497 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6498 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6500 add_enum_fields_to_record_type (enumtype
, field_vec
,
6501 sorted_fields
->len
);
6502 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6503 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6507 /* When T was built up, the member declarations were added in reverse
6508 order. Rearrange them to declaration order. */
6511 unreverse_member_declarations (tree t
)
6517 /* The following lists are all in reverse order. Put them in
6518 declaration order now. */
6519 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6520 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6522 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6523 reverse order, so we can't just use nreverse. */
6525 for (x
= TYPE_FIELDS (t
);
6526 x
&& TREE_CODE (x
) != TYPE_DECL
;
6529 next
= DECL_CHAIN (x
);
6530 DECL_CHAIN (x
) = prev
;
6535 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6537 TYPE_FIELDS (t
) = prev
;
6542 finish_struct (tree t
, tree attributes
)
6544 location_t saved_loc
= input_location
;
6546 /* Now that we've got all the field declarations, reverse everything
6548 unreverse_member_declarations (t
);
6550 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6552 /* Nadger the current location so that diagnostics point to the start of
6553 the struct, not the end. */
6554 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6556 if (processing_template_decl
)
6560 finish_struct_methods (t
);
6561 TYPE_SIZE (t
) = bitsize_zero_node
;
6562 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6564 /* We need to emit an error message if this type was used as a parameter
6565 and it is an abstract type, even if it is a template. We construct
6566 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6567 account and we call complete_vars with this type, which will check
6568 the PARM_DECLS. Note that while the type is being defined,
6569 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6570 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6571 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6572 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6573 if (DECL_PURE_VIRTUAL_P (x
))
6574 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6576 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6577 an enclosing scope is a template class, so that this function be
6578 found by lookup_fnfields_1 when the using declaration is not
6579 instantiated yet. */
6580 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6581 if (TREE_CODE (x
) == USING_DECL
)
6583 tree fn
= strip_using_decl (x
);
6584 if (is_overloaded_fn (fn
))
6585 for (; fn
; fn
= OVL_NEXT (fn
))
6586 add_method (t
, OVL_CURRENT (fn
), x
);
6589 /* Remember current #pragma pack value. */
6590 TYPE_PRECISION (t
) = maximum_field_alignment
;
6592 /* Fix up any variants we've already built. */
6593 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6595 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6596 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6597 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6598 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6602 finish_struct_1 (t
);
6604 input_location
= saved_loc
;
6606 TYPE_BEING_DEFINED (t
) = 0;
6608 if (current_class_type
)
6611 error ("trying to finish struct, but kicked out due to previous parse errors");
6613 if (processing_template_decl
&& at_function_scope_p ()
6614 /* Lambdas are defined by the LAMBDA_EXPR. */
6615 && !LAMBDA_TYPE_P (t
))
6616 add_stmt (build_min (TAG_DEFN
, t
));
6621 /* Hash table to avoid endless recursion when handling references. */
6622 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6624 /* Return the dynamic type of INSTANCE, if known.
6625 Used to determine whether the virtual function table is needed
6628 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6629 of our knowledge of its type. *NONNULL should be initialized
6630 before this function is called. */
6633 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6635 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6637 switch (TREE_CODE (instance
))
6640 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6643 return RECUR (TREE_OPERAND (instance
, 0));
6646 /* This is a call to a constructor, hence it's never zero. */
6647 if (TREE_HAS_CONSTRUCTOR (instance
))
6651 return TREE_TYPE (instance
);
6656 /* This is a call to a constructor, hence it's never zero. */
6657 if (TREE_HAS_CONSTRUCTOR (instance
))
6661 return TREE_TYPE (instance
);
6663 return RECUR (TREE_OPERAND (instance
, 0));
6665 case POINTER_PLUS_EXPR
:
6668 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6669 return RECUR (TREE_OPERAND (instance
, 0));
6670 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6671 /* Propagate nonnull. */
6672 return RECUR (TREE_OPERAND (instance
, 0));
6677 return RECUR (TREE_OPERAND (instance
, 0));
6680 instance
= TREE_OPERAND (instance
, 0);
6683 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6684 with a real object -- given &p->f, p can still be null. */
6685 tree t
= get_base_address (instance
);
6686 /* ??? Probably should check DECL_WEAK here. */
6687 if (t
&& DECL_P (t
))
6690 return RECUR (instance
);
6693 /* If this component is really a base class reference, then the field
6694 itself isn't definitive. */
6695 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6696 return RECUR (TREE_OPERAND (instance
, 0));
6697 return RECUR (TREE_OPERAND (instance
, 1));
6701 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6702 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6706 return TREE_TYPE (TREE_TYPE (instance
));
6708 /* fall through... */
6712 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6716 return TREE_TYPE (instance
);
6718 else if (instance
== current_class_ptr
)
6723 /* if we're in a ctor or dtor, we know our type. If
6724 current_class_ptr is set but we aren't in a function, we're in
6725 an NSDMI (and therefore a constructor). */
6726 if (current_scope () != current_function_decl
6727 || (DECL_LANG_SPECIFIC (current_function_decl
)
6728 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6729 || DECL_DESTRUCTOR_P (current_function_decl
))))
6733 return TREE_TYPE (TREE_TYPE (instance
));
6736 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6738 /* We only need one hash table because it is always left empty. */
6739 if (!fixed_type_or_null_ref_ht
.is_created ())
6740 fixed_type_or_null_ref_ht
.create (37);
6742 /* Reference variables should be references to objects. */
6746 /* Enter the INSTANCE in a table to prevent recursion; a
6747 variable's initializer may refer to the variable
6749 if (VAR_P (instance
)
6750 && DECL_INITIAL (instance
)
6751 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6752 && !fixed_type_or_null_ref_ht
.find (instance
))
6757 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6759 type
= RECUR (DECL_INITIAL (instance
));
6760 fixed_type_or_null_ref_ht
.remove_elt (instance
);
6773 /* Return nonzero if the dynamic type of INSTANCE is known, and
6774 equivalent to the static type. We also handle the case where
6775 INSTANCE is really a pointer. Return negative if this is a
6776 ctor/dtor. There the dynamic type is known, but this might not be
6777 the most derived base of the original object, and hence virtual
6778 bases may not be layed out according to this type.
6780 Used to determine whether the virtual function table is needed
6783 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6784 of our knowledge of its type. *NONNULL should be initialized
6785 before this function is called. */
6788 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6790 tree t
= TREE_TYPE (instance
);
6794 /* processing_template_decl can be false in a template if we're in
6795 fold_non_dependent_expr, but we still want to suppress this check. */
6796 if (in_template_function ())
6798 /* In a template we only care about the type of the result. */
6804 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6805 if (fixed
== NULL_TREE
)
6807 if (POINTER_TYPE_P (t
))
6809 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6811 return cdtorp
? -1 : 1;
6816 init_class_processing (void)
6818 current_class_depth
= 0;
6819 current_class_stack_size
= 10;
6821 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6822 vec_alloc (local_classes
, 8);
6823 sizeof_biggest_empty_class
= size_zero_node
;
6825 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6826 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6827 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6830 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6833 restore_class_cache (void)
6837 /* We are re-entering the same class we just left, so we don't
6838 have to search the whole inheritance matrix to find all the
6839 decls to bind again. Instead, we install the cached
6840 class_shadowed list and walk through it binding names. */
6841 push_binding_level (previous_class_level
);
6842 class_binding_level
= previous_class_level
;
6843 /* Restore IDENTIFIER_TYPE_VALUE. */
6844 for (type
= class_binding_level
->type_shadowed
;
6846 type
= TREE_CHAIN (type
))
6847 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
6850 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6851 appropriate for TYPE.
6853 So that we may avoid calls to lookup_name, we cache the _TYPE
6854 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
6856 For multiple inheritance, we perform a two-pass depth-first search
6857 of the type lattice. */
6860 pushclass (tree type
)
6862 class_stack_node_t csn
;
6864 type
= TYPE_MAIN_VARIANT (type
);
6866 /* Make sure there is enough room for the new entry on the stack. */
6867 if (current_class_depth
+ 1 >= current_class_stack_size
)
6869 current_class_stack_size
*= 2;
6871 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
6872 current_class_stack_size
);
6875 /* Insert a new entry on the class stack. */
6876 csn
= current_class_stack
+ current_class_depth
;
6877 csn
->name
= current_class_name
;
6878 csn
->type
= current_class_type
;
6879 csn
->access
= current_access_specifier
;
6880 csn
->names_used
= 0;
6882 current_class_depth
++;
6884 /* Now set up the new type. */
6885 current_class_name
= TYPE_NAME (type
);
6886 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
6887 current_class_name
= DECL_NAME (current_class_name
);
6888 current_class_type
= type
;
6890 /* By default, things in classes are private, while things in
6891 structures or unions are public. */
6892 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
6893 ? access_private_node
6894 : access_public_node
);
6896 if (previous_class_level
6897 && type
!= previous_class_level
->this_entity
6898 && current_class_depth
== 1)
6900 /* Forcibly remove any old class remnants. */
6901 invalidate_class_lookup_cache ();
6904 if (!previous_class_level
6905 || type
!= previous_class_level
->this_entity
6906 || current_class_depth
> 1)
6909 restore_class_cache ();
6912 /* When we exit a toplevel class scope, we save its binding level so
6913 that we can restore it quickly. Here, we've entered some other
6914 class, so we must invalidate our cache. */
6917 invalidate_class_lookup_cache (void)
6919 previous_class_level
= NULL
;
6922 /* Get out of the current class scope. If we were in a class scope
6923 previously, that is the one popped to. */
6930 current_class_depth
--;
6931 current_class_name
= current_class_stack
[current_class_depth
].name
;
6932 current_class_type
= current_class_stack
[current_class_depth
].type
;
6933 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
6934 if (current_class_stack
[current_class_depth
].names_used
)
6935 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
6938 /* Mark the top of the class stack as hidden. */
6941 push_class_stack (void)
6943 if (current_class_depth
)
6944 ++current_class_stack
[current_class_depth
- 1].hidden
;
6947 /* Mark the top of the class stack as un-hidden. */
6950 pop_class_stack (void)
6952 if (current_class_depth
)
6953 --current_class_stack
[current_class_depth
- 1].hidden
;
6956 /* Returns 1 if the class type currently being defined is either T or
6957 a nested type of T. */
6960 currently_open_class (tree t
)
6964 if (!CLASS_TYPE_P (t
))
6967 t
= TYPE_MAIN_VARIANT (t
);
6969 /* We start looking from 1 because entry 0 is from global scope,
6971 for (i
= current_class_depth
; i
> 0; --i
)
6974 if (i
== current_class_depth
)
6975 c
= current_class_type
;
6978 if (current_class_stack
[i
].hidden
)
6980 c
= current_class_stack
[i
].type
;
6984 if (same_type_p (c
, t
))
6990 /* If either current_class_type or one of its enclosing classes are derived
6991 from T, return the appropriate type. Used to determine how we found
6992 something via unqualified lookup. */
6995 currently_open_derived_class (tree t
)
6999 /* The bases of a dependent type are unknown. */
7000 if (dependent_type_p (t
))
7003 if (!current_class_type
)
7006 if (DERIVED_FROM_P (t
, current_class_type
))
7007 return current_class_type
;
7009 for (i
= current_class_depth
- 1; i
> 0; --i
)
7011 if (current_class_stack
[i
].hidden
)
7013 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7014 return current_class_stack
[i
].type
;
7020 /* Returns the innermost class type which is not a lambda closure type. */
7023 current_nonlambda_class_type (void)
7027 /* We start looking from 1 because entry 0 is from global scope,
7029 for (i
= current_class_depth
; i
> 0; --i
)
7032 if (i
== current_class_depth
)
7033 c
= current_class_type
;
7036 if (current_class_stack
[i
].hidden
)
7038 c
= current_class_stack
[i
].type
;
7042 if (!LAMBDA_TYPE_P (c
))
7048 /* When entering a class scope, all enclosing class scopes' names with
7049 static meaning (static variables, static functions, types and
7050 enumerators) have to be visible. This recursive function calls
7051 pushclass for all enclosing class contexts until global or a local
7052 scope is reached. TYPE is the enclosed class. */
7055 push_nested_class (tree type
)
7057 /* A namespace might be passed in error cases, like A::B:C. */
7058 if (type
== NULL_TREE
7059 || !CLASS_TYPE_P (type
))
7062 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7067 /* Undoes a push_nested_class call. */
7070 pop_nested_class (void)
7072 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7075 if (context
&& CLASS_TYPE_P (context
))
7076 pop_nested_class ();
7079 /* Returns the number of extern "LANG" blocks we are nested within. */
7082 current_lang_depth (void)
7084 return vec_safe_length (current_lang_base
);
7087 /* Set global variables CURRENT_LANG_NAME to appropriate value
7088 so that behavior of name-mangling machinery is correct. */
7091 push_lang_context (tree name
)
7093 vec_safe_push (current_lang_base
, current_lang_name
);
7095 if (name
== lang_name_cplusplus
)
7097 current_lang_name
= name
;
7099 else if (name
== lang_name_java
)
7101 current_lang_name
= name
;
7102 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7103 (See record_builtin_java_type in decl.c.) However, that causes
7104 incorrect debug entries if these types are actually used.
7105 So we re-enable debug output after extern "Java". */
7106 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7107 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7108 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7109 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7110 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7111 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7112 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7113 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7115 else if (name
== lang_name_c
)
7117 current_lang_name
= name
;
7120 error ("language string %<\"%E\"%> not recognized", name
);
7123 /* Get out of the current language scope. */
7126 pop_lang_context (void)
7128 current_lang_name
= current_lang_base
->pop ();
7131 /* Type instantiation routines. */
7133 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7134 matches the TARGET_TYPE. If there is no satisfactory match, return
7135 error_mark_node, and issue an error & warning messages under
7136 control of FLAGS. Permit pointers to member function if FLAGS
7137 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7138 a template-id, and EXPLICIT_TARGS are the explicitly provided
7141 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7142 is the base path used to reference those member functions. If
7143 the address is resolved to a member function, access checks will be
7144 performed and errors issued if appropriate. */
7147 resolve_address_of_overloaded_function (tree target_type
,
7149 tsubst_flags_t flags
,
7151 tree explicit_targs
,
7154 /* Here's what the standard says:
7158 If the name is a function template, template argument deduction
7159 is done, and if the argument deduction succeeds, the deduced
7160 arguments are used to generate a single template function, which
7161 is added to the set of overloaded functions considered.
7163 Non-member functions and static member functions match targets of
7164 type "pointer-to-function" or "reference-to-function." Nonstatic
7165 member functions match targets of type "pointer-to-member
7166 function;" the function type of the pointer to member is used to
7167 select the member function from the set of overloaded member
7168 functions. If a nonstatic member function is selected, the
7169 reference to the overloaded function name is required to have the
7170 form of a pointer to member as described in 5.3.1.
7172 If more than one function is selected, any template functions in
7173 the set are eliminated if the set also contains a non-template
7174 function, and any given template function is eliminated if the
7175 set contains a second template function that is more specialized
7176 than the first according to the partial ordering rules 14.5.5.2.
7177 After such eliminations, if any, there shall remain exactly one
7178 selected function. */
7181 /* We store the matches in a TREE_LIST rooted here. The functions
7182 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7183 interoperability with most_specialized_instantiation. */
7184 tree matches
= NULL_TREE
;
7186 tree target_fn_type
;
7188 /* By the time we get here, we should be seeing only real
7189 pointer-to-member types, not the internal POINTER_TYPE to
7190 METHOD_TYPE representation. */
7191 gcc_assert (!TYPE_PTR_P (target_type
)
7192 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7194 gcc_assert (is_overloaded_fn (overload
));
7196 /* Check that the TARGET_TYPE is reasonable. */
7197 if (TYPE_PTRFN_P (target_type
)
7198 || TYPE_REFFN_P (target_type
))
7200 else if (TYPE_PTRMEMFUNC_P (target_type
))
7201 /* This is OK, too. */
7203 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7204 /* This is OK, too. This comes from a conversion to reference
7206 target_type
= build_reference_type (target_type
);
7209 if (flags
& tf_error
)
7210 error ("cannot resolve overloaded function %qD based on"
7211 " conversion to type %qT",
7212 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7213 return error_mark_node
;
7216 /* Non-member functions and static member functions match targets of type
7217 "pointer-to-function" or "reference-to-function." Nonstatic member
7218 functions match targets of type "pointer-to-member-function;" the
7219 function type of the pointer to member is used to select the member
7220 function from the set of overloaded member functions.
7222 So figure out the FUNCTION_TYPE that we want to match against. */
7223 target_fn_type
= static_fn_type (target_type
);
7225 /* If we can find a non-template function that matches, we can just
7226 use it. There's no point in generating template instantiations
7227 if we're just going to throw them out anyhow. But, of course, we
7228 can only do this when we don't *need* a template function. */
7233 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7235 tree fn
= OVL_CURRENT (fns
);
7237 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7238 /* We're not looking for templates just yet. */
7241 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7243 /* We're looking for a non-static member, and this isn't
7244 one, or vice versa. */
7247 /* Ignore functions which haven't been explicitly
7249 if (DECL_ANTICIPATED (fn
))
7252 /* See if there's a match. */
7253 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7254 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7258 /* Now, if we've already got a match (or matches), there's no need
7259 to proceed to the template functions. But, if we don't have a
7260 match we need to look at them, too. */
7263 tree target_arg_types
;
7264 tree target_ret_type
;
7267 unsigned int nargs
, ia
;
7270 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7271 target_ret_type
= TREE_TYPE (target_fn_type
);
7273 nargs
= list_length (target_arg_types
);
7274 args
= XALLOCAVEC (tree
, nargs
);
7275 for (arg
= target_arg_types
, ia
= 0;
7276 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7277 arg
= TREE_CHAIN (arg
), ++ia
)
7278 args
[ia
] = TREE_VALUE (arg
);
7281 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7283 tree fn
= OVL_CURRENT (fns
);
7287 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7288 /* We're only looking for templates. */
7291 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7293 /* We're not looking for a non-static member, and this is
7294 one, or vice versa. */
7297 tree ret
= target_ret_type
;
7299 /* If the template has a deduced return type, don't expose it to
7300 template argument deduction. */
7301 if (undeduced_auto_decl (fn
))
7304 /* Try to do argument deduction. */
7305 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7306 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7308 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7310 if (instantiation
== error_mark_node
)
7311 /* Instantiation failed. */
7314 /* And now force instantiation to do return type deduction. */
7315 if (undeduced_auto_decl (instantiation
))
7318 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7321 require_deduced_type (instantiation
);
7324 /* See if there's a match. */
7325 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7326 matches
= tree_cons (instantiation
, fn
, matches
);
7331 /* Now, remove all but the most specialized of the matches. */
7334 tree match
= most_specialized_instantiation (matches
);
7336 if (match
!= error_mark_node
)
7337 matches
= tree_cons (TREE_PURPOSE (match
),
7343 /* Now we should have exactly one function in MATCHES. */
7344 if (matches
== NULL_TREE
)
7346 /* There were *no* matches. */
7347 if (flags
& tf_error
)
7349 error ("no matches converting function %qD to type %q#T",
7350 DECL_NAME (OVL_CURRENT (overload
)),
7353 print_candidates (overload
);
7355 return error_mark_node
;
7357 else if (TREE_CHAIN (matches
))
7359 /* There were too many matches. First check if they're all
7360 the same function. */
7361 tree match
= NULL_TREE
;
7363 fn
= TREE_PURPOSE (matches
);
7365 /* For multi-versioned functions, more than one match is just fine and
7366 decls_match will return false as they are different. */
7367 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7368 if (!decls_match (fn
, TREE_PURPOSE (match
))
7369 && !targetm
.target_option
.function_versions
7370 (fn
, TREE_PURPOSE (match
)))
7375 if (flags
& tf_error
)
7377 error ("converting overloaded function %qD to type %q#T is ambiguous",
7378 DECL_NAME (OVL_FUNCTION (overload
)),
7381 /* Since print_candidates expects the functions in the
7382 TREE_VALUE slot, we flip them here. */
7383 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7384 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7386 print_candidates (matches
);
7389 return error_mark_node
;
7393 /* Good, exactly one match. Now, convert it to the correct type. */
7394 fn
= TREE_PURPOSE (matches
);
7396 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7397 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7399 static int explained
;
7401 if (!(flags
& tf_error
))
7402 return error_mark_node
;
7404 permerror (input_location
, "assuming pointer to member %qD", fn
);
7407 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7412 /* If a pointer to a function that is multi-versioned is requested, the
7413 pointer to the dispatcher function is returned instead. This works
7414 well because indirectly calling the function will dispatch the right
7415 function version at run-time. */
7416 if (DECL_FUNCTION_VERSIONED (fn
))
7418 fn
= get_function_version_dispatcher (fn
);
7420 return error_mark_node
;
7421 /* Mark all the versions corresponding to the dispatcher as used. */
7422 if (!(flags
& tf_conv
))
7423 mark_versions_used (fn
);
7426 /* If we're doing overload resolution purely for the purpose of
7427 determining conversion sequences, we should not consider the
7428 function used. If this conversion sequence is selected, the
7429 function will be marked as used at this point. */
7430 if (!(flags
& tf_conv
))
7432 /* Make =delete work with SFINAE. */
7433 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7434 return error_mark_node
;
7439 /* We could not check access to member functions when this
7440 expression was originally created since we did not know at that
7441 time to which function the expression referred. */
7442 if (DECL_FUNCTION_MEMBER_P (fn
))
7444 gcc_assert (access_path
);
7445 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7448 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7449 return cp_build_addr_expr (fn
, flags
);
7452 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7453 will mark the function as addressed, but here we must do it
7455 cxx_mark_addressable (fn
);
7461 /* This function will instantiate the type of the expression given in
7462 RHS to match the type of LHSTYPE. If errors exist, then return
7463 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7464 we complain on errors. If we are not complaining, never modify rhs,
7465 as overload resolution wants to try many possible instantiations, in
7466 the hope that at least one will work.
7468 For non-recursive calls, LHSTYPE should be a function, pointer to
7469 function, or a pointer to member function. */
7472 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7474 tsubst_flags_t flags_in
= flags
;
7475 tree access_path
= NULL_TREE
;
7477 flags
&= ~tf_ptrmem_ok
;
7479 if (lhstype
== unknown_type_node
)
7481 if (flags
& tf_error
)
7482 error ("not enough type information");
7483 return error_mark_node
;
7486 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7488 tree fntype
= non_reference (lhstype
);
7489 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7491 if (flag_ms_extensions
7492 && TYPE_PTRMEMFUNC_P (fntype
)
7493 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7494 /* Microsoft allows `A::f' to be resolved to a
7495 pointer-to-member. */
7499 if (flags
& tf_error
)
7500 error ("cannot convert %qE from type %qT to type %qT",
7501 rhs
, TREE_TYPE (rhs
), fntype
);
7502 return error_mark_node
;
7506 if (BASELINK_P (rhs
))
7508 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7509 rhs
= BASELINK_FUNCTIONS (rhs
);
7512 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7513 deduce any type information. */
7514 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7516 if (flags
& tf_error
)
7517 error ("not enough type information");
7518 return error_mark_node
;
7521 /* There only a few kinds of expressions that may have a type
7522 dependent on overload resolution. */
7523 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7524 || TREE_CODE (rhs
) == COMPONENT_REF
7525 || really_overloaded_fn (rhs
)
7526 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7528 /* This should really only be used when attempting to distinguish
7529 what sort of a pointer to function we have. For now, any
7530 arithmetic operation which is not supported on pointers
7531 is rejected as an error. */
7533 switch (TREE_CODE (rhs
))
7537 tree member
= TREE_OPERAND (rhs
, 1);
7539 member
= instantiate_type (lhstype
, member
, flags
);
7540 if (member
!= error_mark_node
7541 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7542 /* Do not lose object's side effects. */
7543 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7544 TREE_OPERAND (rhs
, 0), member
);
7549 rhs
= TREE_OPERAND (rhs
, 1);
7550 if (BASELINK_P (rhs
))
7551 return instantiate_type (lhstype
, rhs
, flags_in
);
7553 /* This can happen if we are forming a pointer-to-member for a
7555 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7559 case TEMPLATE_ID_EXPR
:
7561 tree fns
= TREE_OPERAND (rhs
, 0);
7562 tree args
= TREE_OPERAND (rhs
, 1);
7565 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7566 /*template_only=*/true,
7573 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7574 /*template_only=*/false,
7575 /*explicit_targs=*/NULL_TREE
,
7580 if (PTRMEM_OK_P (rhs
))
7581 flags
|= tf_ptrmem_ok
;
7583 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7587 return error_mark_node
;
7592 return error_mark_node
;
7595 /* Return the name of the virtual function pointer field
7596 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7597 this may have to look back through base types to find the
7598 ultimate field name. (For single inheritance, these could
7599 all be the same name. Who knows for multiple inheritance). */
7602 get_vfield_name (tree type
)
7604 tree binfo
, base_binfo
;
7607 for (binfo
= TYPE_BINFO (type
);
7608 BINFO_N_BASE_BINFOS (binfo
);
7611 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7613 if (BINFO_VIRTUAL_P (base_binfo
)
7614 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7618 type
= BINFO_TYPE (binfo
);
7619 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7620 + TYPE_NAME_LENGTH (type
) + 2);
7621 sprintf (buf
, VFIELD_NAME_FORMAT
,
7622 IDENTIFIER_POINTER (constructor_name (type
)));
7623 return get_identifier (buf
);
7627 print_class_statistics (void)
7629 if (! GATHER_STATISTICS
)
7632 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7633 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7636 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7637 n_vtables
, n_vtable_searches
);
7638 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7639 n_vtable_entries
, n_vtable_elems
);
7643 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7644 according to [class]:
7645 The class-name is also inserted
7646 into the scope of the class itself. For purposes of access checking,
7647 the inserted class name is treated as if it were a public member name. */
7650 build_self_reference (void)
7652 tree name
= constructor_name (current_class_type
);
7653 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7656 DECL_NONLOCAL (value
) = 1;
7657 DECL_CONTEXT (value
) = current_class_type
;
7658 DECL_ARTIFICIAL (value
) = 1;
7659 SET_DECL_SELF_REFERENCE_P (value
);
7660 set_underlying_type (value
);
7662 if (processing_template_decl
)
7663 value
= push_template_decl (value
);
7665 saved_cas
= current_access_specifier
;
7666 current_access_specifier
= access_public_node
;
7667 finish_member_declaration (value
);
7668 current_access_specifier
= saved_cas
;
7671 /* Returns 1 if TYPE contains only padding bytes. */
7674 is_empty_class (tree type
)
7676 if (type
== error_mark_node
)
7679 if (! CLASS_TYPE_P (type
))
7682 /* In G++ 3.2, whether or not a class was empty was determined by
7683 looking at its size. */
7684 if (abi_version_at_least (2))
7685 return CLASSTYPE_EMPTY_P (type
);
7687 return integer_zerop (CLASSTYPE_SIZE (type
));
7690 /* Returns true if TYPE contains an empty class. */
7693 contains_empty_class_p (tree type
)
7695 if (is_empty_class (type
))
7697 if (CLASS_TYPE_P (type
))
7704 for (binfo
= TYPE_BINFO (type
), i
= 0;
7705 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7706 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7708 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7709 if (TREE_CODE (field
) == FIELD_DECL
7710 && !DECL_ARTIFICIAL (field
)
7711 && is_empty_class (TREE_TYPE (field
)))
7714 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7715 return contains_empty_class_p (TREE_TYPE (type
));
7719 /* Returns true if TYPE contains no actual data, just various
7720 possible combinations of empty classes and possibly a vptr. */
7723 is_really_empty_class (tree type
)
7725 if (CLASS_TYPE_P (type
))
7732 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7733 out, but we'd like to be able to check this before then. */
7734 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7737 for (binfo
= TYPE_BINFO (type
), i
= 0;
7738 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7739 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7741 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7742 if (TREE_CODE (field
) == FIELD_DECL
7743 && !DECL_ARTIFICIAL (field
)
7744 && !is_really_empty_class (TREE_TYPE (field
)))
7748 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7749 return is_really_empty_class (TREE_TYPE (type
));
7753 /* Note that NAME was looked up while the current class was being
7754 defined and that the result of that lookup was DECL. */
7757 maybe_note_name_used_in_class (tree name
, tree decl
)
7759 splay_tree names_used
;
7761 /* If we're not defining a class, there's nothing to do. */
7762 if (!(innermost_scope_kind() == sk_class
7763 && TYPE_BEING_DEFINED (current_class_type
)
7764 && !LAMBDA_TYPE_P (current_class_type
)))
7767 /* If there's already a binding for this NAME, then we don't have
7768 anything to worry about. */
7769 if (lookup_member (current_class_type
, name
,
7770 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7773 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7774 current_class_stack
[current_class_depth
- 1].names_used
7775 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7776 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7778 splay_tree_insert (names_used
,
7779 (splay_tree_key
) name
,
7780 (splay_tree_value
) decl
);
7783 /* Note that NAME was declared (as DECL) in the current class. Check
7784 to see that the declaration is valid. */
7787 note_name_declared_in_class (tree name
, tree decl
)
7789 splay_tree names_used
;
7792 /* Look to see if we ever used this name. */
7794 = current_class_stack
[current_class_depth
- 1].names_used
;
7797 /* The C language allows members to be declared with a type of the same
7798 name, and the C++ standard says this diagnostic is not required. So
7799 allow it in extern "C" blocks unless predantic is specified.
7800 Allow it in all cases if -ms-extensions is specified. */
7801 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7802 || flag_ms_extensions
)
7804 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7807 /* [basic.scope.class]
7809 A name N used in a class S shall refer to the same declaration
7810 in its context and when re-evaluated in the completed scope of
7812 permerror (input_location
, "declaration of %q#D", decl
);
7813 permerror (input_location
, "changes meaning of %qD from %q+#D",
7814 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7818 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7819 Secondary vtables are merged with primary vtables; this function
7820 will return the VAR_DECL for the primary vtable. */
7823 get_vtbl_decl_for_binfo (tree binfo
)
7827 decl
= BINFO_VTABLE (binfo
);
7828 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7830 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7831 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7834 gcc_assert (VAR_P (decl
));
7839 /* Returns the binfo for the primary base of BINFO. If the resulting
7840 BINFO is a virtual base, and it is inherited elsewhere in the
7841 hierarchy, then the returned binfo might not be the primary base of
7842 BINFO in the complete object. Check BINFO_PRIMARY_P or
7843 BINFO_LOST_PRIMARY_P to be sure. */
7846 get_primary_binfo (tree binfo
)
7850 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
7854 return copied_binfo (primary_base
, binfo
);
7857 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
7860 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
7863 fprintf (stream
, "%*s", indent
, "");
7867 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
7868 INDENT should be zero when called from the top level; it is
7869 incremented recursively. IGO indicates the next expected BINFO in
7870 inheritance graph ordering. */
7873 dump_class_hierarchy_r (FILE *stream
,
7883 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
7884 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
7885 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
7886 (HOST_WIDE_INT
) (uintptr_t) binfo
);
7889 fprintf (stream
, "alternative-path\n");
7892 igo
= TREE_CHAIN (binfo
);
7894 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
7895 tree_low_cst (BINFO_OFFSET (binfo
), 0));
7896 if (is_empty_class (BINFO_TYPE (binfo
)))
7897 fprintf (stream
, " empty");
7898 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
7899 fprintf (stream
, " nearly-empty");
7900 if (BINFO_VIRTUAL_P (binfo
))
7901 fprintf (stream
, " virtual");
7902 fprintf (stream
, "\n");
7905 if (BINFO_PRIMARY_P (binfo
))
7907 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7908 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
7909 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
7910 TFF_PLAIN_IDENTIFIER
),
7911 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
7913 if (BINFO_LOST_PRIMARY_P (binfo
))
7915 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7916 fprintf (stream
, " lost-primary");
7919 fprintf (stream
, "\n");
7921 if (!(flags
& TDF_SLIM
))
7925 if (BINFO_SUBVTT_INDEX (binfo
))
7927 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7928 fprintf (stream
, " subvttidx=%s",
7929 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
7930 TFF_PLAIN_IDENTIFIER
));
7932 if (BINFO_VPTR_INDEX (binfo
))
7934 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7935 fprintf (stream
, " vptridx=%s",
7936 expr_as_string (BINFO_VPTR_INDEX (binfo
),
7937 TFF_PLAIN_IDENTIFIER
));
7939 if (BINFO_VPTR_FIELD (binfo
))
7941 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7942 fprintf (stream
, " vbaseoffset=%s",
7943 expr_as_string (BINFO_VPTR_FIELD (binfo
),
7944 TFF_PLAIN_IDENTIFIER
));
7946 if (BINFO_VTABLE (binfo
))
7948 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
7949 fprintf (stream
, " vptr=%s",
7950 expr_as_string (BINFO_VTABLE (binfo
),
7951 TFF_PLAIN_IDENTIFIER
));
7955 fprintf (stream
, "\n");
7958 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
7959 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
7964 /* Dump the BINFO hierarchy for T. */
7967 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
7969 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
7970 fprintf (stream
, " size=%lu align=%lu\n",
7971 (unsigned long)(tree_low_cst (TYPE_SIZE (t
), 0) / BITS_PER_UNIT
),
7972 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
7973 fprintf (stream
, " base size=%lu base align=%lu\n",
7974 (unsigned long)(tree_low_cst (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)), 0)
7976 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
7978 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
7979 fprintf (stream
, "\n");
7982 /* Debug interface to hierarchy dumping. */
7985 debug_class (tree t
)
7987 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
7991 dump_class_hierarchy (tree t
)
7994 FILE *stream
= dump_begin (TDI_class
, &flags
);
7998 dump_class_hierarchy_1 (stream
, flags
, t
);
7999 dump_end (TDI_class
, stream
);
8004 dump_array (FILE * stream
, tree decl
)
8007 unsigned HOST_WIDE_INT ix
;
8009 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8011 elt
= (tree_low_cst (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))), 0)
8013 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8014 fprintf (stream
, " %s entries",
8015 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8016 TFF_PLAIN_IDENTIFIER
));
8017 fprintf (stream
, "\n");
8019 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8021 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8022 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8026 dump_vtable (tree t
, tree binfo
, tree vtable
)
8029 FILE *stream
= dump_begin (TDI_class
, &flags
);
8034 if (!(flags
& TDF_SLIM
))
8036 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8038 fprintf (stream
, "%s for %s",
8039 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8040 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8043 if (!BINFO_VIRTUAL_P (binfo
))
8044 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8045 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8046 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8048 fprintf (stream
, "\n");
8049 dump_array (stream
, vtable
);
8050 fprintf (stream
, "\n");
8053 dump_end (TDI_class
, stream
);
8057 dump_vtt (tree t
, tree vtt
)
8060 FILE *stream
= dump_begin (TDI_class
, &flags
);
8065 if (!(flags
& TDF_SLIM
))
8067 fprintf (stream
, "VTT for %s\n",
8068 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8069 dump_array (stream
, vtt
);
8070 fprintf (stream
, "\n");
8073 dump_end (TDI_class
, stream
);
8076 /* Dump a function or thunk and its thunkees. */
8079 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8081 static const char spaces
[] = " ";
8082 tree name
= DECL_NAME (thunk
);
8085 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8087 !DECL_THUNK_P (thunk
) ? "function"
8088 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8089 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8090 if (DECL_THUNK_P (thunk
))
8092 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8093 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8095 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8096 if (!virtual_adjust
)
8098 else if (DECL_THIS_THUNK_P (thunk
))
8099 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8100 tree_low_cst (virtual_adjust
, 0));
8102 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8103 tree_low_cst (BINFO_VPTR_FIELD (virtual_adjust
), 0),
8104 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8105 if (THUNK_ALIAS (thunk
))
8106 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8108 fprintf (stream
, "\n");
8109 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8110 dump_thunk (stream
, indent
+ 2, thunks
);
8113 /* Dump the thunks for FN. */
8116 debug_thunks (tree fn
)
8118 dump_thunk (stderr
, 0, fn
);
8121 /* Virtual function table initialization. */
8123 /* Create all the necessary vtables for T and its base classes. */
8126 finish_vtbls (tree t
)
8129 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8130 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8132 /* We lay out the primary and secondary vtables in one contiguous
8133 vtable. The primary vtable is first, followed by the non-virtual
8134 secondary vtables in inheritance graph order. */
8135 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8138 /* Then come the virtual bases, also in inheritance graph order. */
8139 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8141 if (!BINFO_VIRTUAL_P (vbase
))
8143 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8146 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8147 initialize_vtable (TYPE_BINFO (t
), v
);
8150 /* Initialize the vtable for BINFO with the INITS. */
8153 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8157 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8158 decl
= get_vtbl_decl_for_binfo (binfo
);
8159 initialize_artificial_var (decl
, inits
);
8160 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8163 /* Build the VTT (virtual table table) for T.
8164 A class requires a VTT if it has virtual bases.
8167 1 - primary virtual pointer for complete object T
8168 2 - secondary VTTs for each direct non-virtual base of T which requires a
8170 3 - secondary virtual pointers for each direct or indirect base of T which
8171 has virtual bases or is reachable via a virtual path from T.
8172 4 - secondary VTTs for each direct or indirect virtual base of T.
8174 Secondary VTTs look like complete object VTTs without part 4. */
8182 vec
<constructor_elt
, va_gc
> *inits
;
8184 /* Build up the initializers for the VTT. */
8186 index
= size_zero_node
;
8187 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8189 /* If we didn't need a VTT, we're done. */
8193 /* Figure out the type of the VTT. */
8194 type
= build_array_of_n_type (const_ptr_type_node
,
8197 /* Now, build the VTT object itself. */
8198 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8199 initialize_artificial_var (vtt
, inits
);
8200 /* Add the VTT to the vtables list. */
8201 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8202 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8207 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8208 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8209 and CHAIN the vtable pointer for this binfo after construction is
8210 complete. VALUE can also be another BINFO, in which case we recurse. */
8213 binfo_ctor_vtable (tree binfo
)
8219 vt
= BINFO_VTABLE (binfo
);
8220 if (TREE_CODE (vt
) == TREE_LIST
)
8221 vt
= TREE_VALUE (vt
);
8222 if (TREE_CODE (vt
) == TREE_BINFO
)
8231 /* Data for secondary VTT initialization. */
8232 typedef struct secondary_vptr_vtt_init_data_s
8234 /* Is this the primary VTT? */
8237 /* Current index into the VTT. */
8240 /* Vector of initializers built up. */
8241 vec
<constructor_elt
, va_gc
> *inits
;
8243 /* The type being constructed by this secondary VTT. */
8244 tree type_being_constructed
;
8245 } secondary_vptr_vtt_init_data
;
8247 /* Recursively build the VTT-initializer for BINFO (which is in the
8248 hierarchy dominated by T). INITS points to the end of the initializer
8249 list to date. INDEX is the VTT index where the next element will be
8250 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8251 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8252 for virtual bases of T. When it is not so, we build the constructor
8253 vtables for the BINFO-in-T variant. */
8256 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8262 secondary_vptr_vtt_init_data data
;
8263 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8265 /* We only need VTTs for subobjects with virtual bases. */
8266 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8269 /* We need to use a construction vtable if this is not the primary
8273 build_ctor_vtbl_group (binfo
, t
);
8275 /* Record the offset in the VTT where this sub-VTT can be found. */
8276 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8279 /* Add the address of the primary vtable for the complete object. */
8280 init
= binfo_ctor_vtable (binfo
);
8281 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8284 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8285 BINFO_VPTR_INDEX (binfo
) = *index
;
8287 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8289 /* Recursively add the secondary VTTs for non-virtual bases. */
8290 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8291 if (!BINFO_VIRTUAL_P (b
))
8292 build_vtt_inits (b
, t
, inits
, index
);
8294 /* Add secondary virtual pointers for all subobjects of BINFO with
8295 either virtual bases or reachable along a virtual path, except
8296 subobjects that are non-virtual primary bases. */
8297 data
.top_level_p
= top_level_p
;
8298 data
.index
= *index
;
8299 data
.inits
= *inits
;
8300 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8302 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8304 *index
= data
.index
;
8306 /* data.inits might have grown as we added secondary virtual pointers.
8307 Make sure our caller knows about the new vector. */
8308 *inits
= data
.inits
;
8311 /* Add the secondary VTTs for virtual bases in inheritance graph
8313 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8315 if (!BINFO_VIRTUAL_P (b
))
8318 build_vtt_inits (b
, t
, inits
, index
);
8321 /* Remove the ctor vtables we created. */
8322 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8325 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8326 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8329 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8331 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8333 /* We don't care about bases that don't have vtables. */
8334 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8335 return dfs_skip_bases
;
8337 /* We're only interested in proper subobjects of the type being
8339 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8342 /* We're only interested in bases with virtual bases or reachable
8343 via a virtual path from the type being constructed. */
8344 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8345 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8346 return dfs_skip_bases
;
8348 /* We're not interested in non-virtual primary bases. */
8349 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8352 /* Record the index where this secondary vptr can be found. */
8353 if (data
->top_level_p
)
8355 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8356 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8358 if (BINFO_VIRTUAL_P (binfo
))
8360 /* It's a primary virtual base, and this is not a
8361 construction vtable. Find the base this is primary of in
8362 the inheritance graph, and use that base's vtable
8364 while (BINFO_PRIMARY_P (binfo
))
8365 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8369 /* Add the initializer for the secondary vptr itself. */
8370 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8372 /* Advance the vtt index. */
8373 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8374 TYPE_SIZE_UNIT (ptr_type_node
));
8379 /* Called from build_vtt_inits via dfs_walk. After building
8380 constructor vtables and generating the sub-vtt from them, we need
8381 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8382 binfo of the base whose sub vtt was generated. */
8385 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8387 tree vtable
= BINFO_VTABLE (binfo
);
8389 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8390 /* If this class has no vtable, none of its bases do. */
8391 return dfs_skip_bases
;
8394 /* This might be a primary base, so have no vtable in this
8398 /* If we scribbled the construction vtable vptr into BINFO, clear it
8400 if (TREE_CODE (vtable
) == TREE_LIST
8401 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8402 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8407 /* Build the construction vtable group for BINFO which is in the
8408 hierarchy dominated by T. */
8411 build_ctor_vtbl_group (tree binfo
, tree t
)
8417 vec
<constructor_elt
, va_gc
> *v
;
8419 /* See if we've already created this construction vtable group. */
8420 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8421 if (IDENTIFIER_GLOBAL_VALUE (id
))
8424 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8425 /* Build a version of VTBL (with the wrong type) for use in
8426 constructing the addresses of secondary vtables in the
8427 construction vtable group. */
8428 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8429 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8430 /* Don't export construction vtables from shared libraries. Even on
8431 targets that don't support hidden visibility, this tells
8432 can_refer_decl_in_current_unit_p not to assume that it's safe to
8433 access from a different compilation unit (bz 54314). */
8434 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8435 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8438 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8439 binfo
, vtbl
, t
, &v
);
8441 /* Add the vtables for each of our virtual bases using the vbase in T
8443 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8445 vbase
= TREE_CHAIN (vbase
))
8449 if (!BINFO_VIRTUAL_P (vbase
))
8451 b
= copied_binfo (vbase
, binfo
);
8453 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8456 /* Figure out the type of the construction vtable. */
8457 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8459 TREE_TYPE (vtbl
) = type
;
8460 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8461 layout_decl (vtbl
, 0);
8463 /* Initialize the construction vtable. */
8464 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8465 initialize_artificial_var (vtbl
, v
);
8466 dump_vtable (t
, binfo
, vtbl
);
8469 /* Add the vtbl initializers for BINFO (and its bases other than
8470 non-virtual primaries) to the list of INITS. BINFO is in the
8471 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8472 the constructor the vtbl inits should be accumulated for. (If this
8473 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8474 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8475 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8476 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8477 but are not necessarily the same in terms of layout. */
8480 accumulate_vtbl_inits (tree binfo
,
8485 vec
<constructor_elt
, va_gc
> **inits
)
8489 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8491 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8493 /* If it doesn't have a vptr, we don't do anything. */
8494 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8497 /* If we're building a construction vtable, we're not interested in
8498 subobjects that don't require construction vtables. */
8500 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8501 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8504 /* Build the initializers for the BINFO-in-T vtable. */
8505 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8507 /* Walk the BINFO and its bases. We walk in preorder so that as we
8508 initialize each vtable we can figure out at what offset the
8509 secondary vtable lies from the primary vtable. We can't use
8510 dfs_walk here because we need to iterate through bases of BINFO
8511 and RTTI_BINFO simultaneously. */
8512 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8514 /* Skip virtual bases. */
8515 if (BINFO_VIRTUAL_P (base_binfo
))
8517 accumulate_vtbl_inits (base_binfo
,
8518 BINFO_BASE_BINFO (orig_binfo
, i
),
8519 rtti_binfo
, vtbl
, t
,
8524 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8525 BINFO vtable to L. */
8528 dfs_accumulate_vtbl_inits (tree binfo
,
8533 vec
<constructor_elt
, va_gc
> **l
)
8535 tree vtbl
= NULL_TREE
;
8536 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8540 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8542 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8543 primary virtual base. If it is not the same primary in
8544 the hierarchy of T, we'll need to generate a ctor vtable
8545 for it, to place at its location in T. If it is the same
8546 primary, we still need a VTT entry for the vtable, but it
8547 should point to the ctor vtable for the base it is a
8548 primary for within the sub-hierarchy of RTTI_BINFO.
8550 There are three possible cases:
8552 1) We are in the same place.
8553 2) We are a primary base within a lost primary virtual base of
8555 3) We are primary to something not a base of RTTI_BINFO. */
8558 tree last
= NULL_TREE
;
8560 /* First, look through the bases we are primary to for RTTI_BINFO
8561 or a virtual base. */
8563 while (BINFO_PRIMARY_P (b
))
8565 b
= BINFO_INHERITANCE_CHAIN (b
);
8567 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8570 /* If we run out of primary links, keep looking down our
8571 inheritance chain; we might be an indirect primary. */
8572 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8573 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8577 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8578 base B and it is a base of RTTI_BINFO, this is case 2. In
8579 either case, we share our vtable with LAST, i.e. the
8580 derived-most base within B of which we are a primary. */
8582 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8583 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8584 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8585 binfo_ctor_vtable after everything's been set up. */
8588 /* Otherwise, this is case 3 and we get our own. */
8590 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8593 n_inits
= vec_safe_length (*l
);
8600 /* Add the initializer for this vtable. */
8601 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8602 &non_fn_entries
, l
);
8604 /* Figure out the position to which the VPTR should point. */
8605 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8606 index
= size_binop (MULT_EXPR
,
8607 TYPE_SIZE_UNIT (vtable_entry_type
),
8608 size_int (non_fn_entries
+ n_inits
));
8609 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8613 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8614 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8615 straighten this out. */
8616 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8617 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8618 /* Throw away any unneeded intializers. */
8619 (*l
)->truncate (n_inits
);
8621 /* For an ordinary vtable, set BINFO_VTABLE. */
8622 BINFO_VTABLE (binfo
) = vtbl
;
8625 static GTY(()) tree abort_fndecl_addr
;
8627 /* Construct the initializer for BINFO's virtual function table. BINFO
8628 is part of the hierarchy dominated by T. If we're building a
8629 construction vtable, the ORIG_BINFO is the binfo we should use to
8630 find the actual function pointers to put in the vtable - but they
8631 can be overridden on the path to most-derived in the graph that
8632 ORIG_BINFO belongs. Otherwise,
8633 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8634 BINFO that should be indicated by the RTTI information in the
8635 vtable; it will be a base class of T, rather than T itself, if we
8636 are building a construction vtable.
8638 The value returned is a TREE_LIST suitable for wrapping in a
8639 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8640 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8641 number of non-function entries in the vtable.
8643 It might seem that this function should never be called with a
8644 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8645 base is always subsumed by a derived class vtable. However, when
8646 we are building construction vtables, we do build vtables for
8647 primary bases; we need these while the primary base is being
8651 build_vtbl_initializer (tree binfo
,
8655 int* non_fn_entries_p
,
8656 vec
<constructor_elt
, va_gc
> **inits
)
8662 vec
<tree
, va_gc
> *vbases
;
8665 /* Initialize VID. */
8666 memset (&vid
, 0, sizeof (vid
));
8669 vid
.rtti_binfo
= rtti_binfo
;
8670 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8671 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8672 vid
.generate_vcall_entries
= true;
8673 /* The first vbase or vcall offset is at index -3 in the vtable. */
8674 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8676 /* Add entries to the vtable for RTTI. */
8677 build_rtti_vtbl_entries (binfo
, &vid
);
8679 /* Create an array for keeping track of the functions we've
8680 processed. When we see multiple functions with the same
8681 signature, we share the vcall offsets. */
8682 vec_alloc (vid
.fns
, 32);
8683 /* Add the vcall and vbase offset entries. */
8684 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8686 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8687 build_vbase_offset_vtbl_entries. */
8688 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8689 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8690 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8692 /* If the target requires padding between data entries, add that now. */
8693 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8695 int n_entries
= vec_safe_length (vid
.inits
);
8697 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8699 /* Move data entries into their new positions and add padding
8700 after the new positions. Iterate backwards so we don't
8701 overwrite entries that we would need to process later. */
8702 for (ix
= n_entries
- 1;
8703 vid
.inits
->iterate (ix
, &e
);
8707 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8708 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8710 (*vid
.inits
)[new_position
] = *e
;
8712 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8714 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8715 f
->index
= NULL_TREE
;
8716 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8722 if (non_fn_entries_p
)
8723 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8725 /* The initializers for virtual functions were built up in reverse
8726 order. Straighten them out and add them to the running list in one
8728 jx
= vec_safe_length (*inits
);
8729 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8731 for (ix
= vid
.inits
->length () - 1;
8732 vid
.inits
->iterate (ix
, &e
);
8736 /* Go through all the ordinary virtual functions, building up
8738 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8742 tree fn
, fn_original
;
8743 tree init
= NULL_TREE
;
8747 if (DECL_THUNK_P (fn
))
8749 if (!DECL_NAME (fn
))
8751 if (THUNK_ALIAS (fn
))
8753 fn
= THUNK_ALIAS (fn
);
8756 fn_original
= THUNK_TARGET (fn
);
8759 /* If the only definition of this function signature along our
8760 primary base chain is from a lost primary, this vtable slot will
8761 never be used, so just zero it out. This is important to avoid
8762 requiring extra thunks which cannot be generated with the function.
8764 We first check this in update_vtable_entry_for_fn, so we handle
8765 restored primary bases properly; we also need to do it here so we
8766 zero out unused slots in ctor vtables, rather than filling them
8767 with erroneous values (though harmless, apart from relocation
8769 if (BV_LOST_PRIMARY (v
))
8770 init
= size_zero_node
;
8774 /* Pull the offset for `this', and the function to call, out of
8776 delta
= BV_DELTA (v
);
8777 vcall_index
= BV_VCALL_INDEX (v
);
8779 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8780 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8782 /* You can't call an abstract virtual function; it's abstract.
8783 So, we replace these functions with __pure_virtual. */
8784 if (DECL_PURE_VIRTUAL_P (fn_original
))
8787 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8789 if (abort_fndecl_addr
== NULL
)
8791 = fold_convert (vfunc_ptr_type_node
,
8792 build_fold_addr_expr (fn
));
8793 init
= abort_fndecl_addr
;
8796 /* Likewise for deleted virtuals. */
8797 else if (DECL_DELETED_FN (fn_original
))
8799 fn
= get_identifier ("__cxa_deleted_virtual");
8800 if (!get_global_value_if_present (fn
, &fn
))
8801 fn
= push_library_fn (fn
, (build_function_type_list
8802 (void_type_node
, NULL_TREE
)),
8804 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8805 init
= fold_convert (vfunc_ptr_type_node
,
8806 build_fold_addr_expr (fn
));
8810 if (!integer_zerop (delta
) || vcall_index
)
8812 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8813 if (!DECL_NAME (fn
))
8816 /* Take the address of the function, considering it to be of an
8817 appropriate generic type. */
8818 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8819 init
= fold_convert (vfunc_ptr_type_node
,
8820 build_fold_addr_expr (fn
));
8824 /* And add it to the chain of initializers. */
8825 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8828 if (init
== size_zero_node
)
8829 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8830 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8832 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8834 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8835 fn
, build_int_cst (NULL_TREE
, i
));
8836 TREE_CONSTANT (fdesc
) = 1;
8838 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8842 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8846 /* Adds to vid->inits the initializers for the vbase and vcall
8847 offsets in BINFO, which is in the hierarchy dominated by T. */
8850 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8854 /* If this is a derived class, we must first create entries
8855 corresponding to the primary base class. */
8856 b
= get_primary_binfo (binfo
);
8858 build_vcall_and_vbase_vtbl_entries (b
, vid
);
8860 /* Add the vbase entries for this base. */
8861 build_vbase_offset_vtbl_entries (binfo
, vid
);
8862 /* Add the vcall entries for this base. */
8863 build_vcall_offset_vtbl_entries (binfo
, vid
);
8866 /* Returns the initializers for the vbase offset entries in the vtable
8867 for BINFO (which is part of the class hierarchy dominated by T), in
8868 reverse order. VBASE_OFFSET_INDEX gives the vtable index
8869 where the next vbase offset will go. */
8872 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8876 tree non_primary_binfo
;
8878 /* If there are no virtual baseclasses, then there is nothing to
8880 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8885 /* We might be a primary base class. Go up the inheritance hierarchy
8886 until we find the most derived class of which we are a primary base:
8887 it is the offset of that which we need to use. */
8888 non_primary_binfo
= binfo
;
8889 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
8893 /* If we have reached a virtual base, then it must be a primary
8894 base (possibly multi-level) of vid->binfo, or we wouldn't
8895 have called build_vcall_and_vbase_vtbl_entries for it. But it
8896 might be a lost primary, so just skip down to vid->binfo. */
8897 if (BINFO_VIRTUAL_P (non_primary_binfo
))
8899 non_primary_binfo
= vid
->binfo
;
8903 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
8904 if (get_primary_binfo (b
) != non_primary_binfo
)
8906 non_primary_binfo
= b
;
8909 /* Go through the virtual bases, adding the offsets. */
8910 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8912 vbase
= TREE_CHAIN (vbase
))
8917 if (!BINFO_VIRTUAL_P (vbase
))
8920 /* Find the instance of this virtual base in the complete
8922 b
= copied_binfo (vbase
, binfo
);
8924 /* If we've already got an offset for this virtual base, we
8925 don't need another one. */
8926 if (BINFO_VTABLE_PATH_MARKED (b
))
8928 BINFO_VTABLE_PATH_MARKED (b
) = 1;
8930 /* Figure out where we can find this vbase offset. */
8931 delta
= size_binop (MULT_EXPR
,
8934 TYPE_SIZE_UNIT (vtable_entry_type
)));
8935 if (vid
->primary_vtbl_p
)
8936 BINFO_VPTR_FIELD (b
) = delta
;
8938 if (binfo
!= TYPE_BINFO (t
))
8939 /* The vbase offset had better be the same. */
8940 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
8942 /* The next vbase will come at a more negative offset. */
8943 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
8944 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
8946 /* The initializer is the delta from BINFO to this virtual base.
8947 The vbase offsets go in reverse inheritance-graph order, and
8948 we are walking in inheritance graph order so these end up in
8950 delta
= size_diffop_loc (input_location
,
8951 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
8953 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
8954 fold_build1_loc (input_location
, NOP_EXPR
,
8955 vtable_entry_type
, delta
));
8959 /* Adds the initializers for the vcall offset entries in the vtable
8960 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
8964 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
8966 /* We only need these entries if this base is a virtual base. We
8967 compute the indices -- but do not add to the vtable -- when
8968 building the main vtable for a class. */
8969 if (binfo
== TYPE_BINFO (vid
->derived
)
8970 || (BINFO_VIRTUAL_P (binfo
)
8971 /* If BINFO is RTTI_BINFO, then (since BINFO does not
8972 correspond to VID->DERIVED), we are building a primary
8973 construction virtual table. Since this is a primary
8974 virtual table, we do not need the vcall offsets for
8976 && binfo
!= vid
->rtti_binfo
))
8978 /* We need a vcall offset for each of the virtual functions in this
8979 vtable. For example:
8981 class A { virtual void f (); };
8982 class B1 : virtual public A { virtual void f (); };
8983 class B2 : virtual public A { virtual void f (); };
8984 class C: public B1, public B2 { virtual void f (); };
8986 A C object has a primary base of B1, which has a primary base of A. A
8987 C also has a secondary base of B2, which no longer has a primary base
8988 of A. So the B2-in-C construction vtable needs a secondary vtable for
8989 A, which will adjust the A* to a B2* to call f. We have no way of
8990 knowing what (or even whether) this offset will be when we define B2,
8991 so we store this "vcall offset" in the A sub-vtable and look it up in
8992 a "virtual thunk" for B2::f.
8994 We need entries for all the functions in our primary vtable and
8995 in our non-virtual bases' secondary vtables. */
8997 /* If we are just computing the vcall indices -- but do not need
8998 the actual entries -- not that. */
8999 if (!BINFO_VIRTUAL_P (binfo
))
9000 vid
->generate_vcall_entries
= false;
9001 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9002 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9006 /* Build vcall offsets, starting with those for BINFO. */
9009 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9015 /* Don't walk into virtual bases -- except, of course, for the
9016 virtual base for which we are building vcall offsets. Any
9017 primary virtual base will have already had its offsets generated
9018 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9019 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9022 /* If BINFO has a primary base, process it first. */
9023 primary_binfo
= get_primary_binfo (binfo
);
9025 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9027 /* Add BINFO itself to the list. */
9028 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9030 /* Scan the non-primary bases of BINFO. */
9031 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9032 if (base_binfo
!= primary_binfo
)
9033 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9036 /* Called from build_vcall_offset_vtbl_entries_r. */
9039 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9041 /* Make entries for the rest of the virtuals. */
9042 if (abi_version_at_least (2))
9046 /* The ABI requires that the methods be processed in declaration
9047 order. G++ 3.2 used the order in the vtable. */
9048 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9050 orig_fn
= DECL_CHAIN (orig_fn
))
9051 if (DECL_VINDEX (orig_fn
))
9052 add_vcall_offset (orig_fn
, binfo
, vid
);
9056 tree derived_virtuals
;
9059 /* If BINFO is a primary base, the most derived class which has
9060 BINFO as a primary base; otherwise, just BINFO. */
9061 tree non_primary_binfo
;
9063 /* We might be a primary base class. Go up the inheritance hierarchy
9064 until we find the most derived class of which we are a primary base:
9065 it is the BINFO_VIRTUALS there that we need to consider. */
9066 non_primary_binfo
= binfo
;
9067 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9071 /* If we have reached a virtual base, then it must be vid->vbase,
9072 because we ignore other virtual bases in
9073 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9074 base (possibly multi-level) of vid->binfo, or we wouldn't
9075 have called build_vcall_and_vbase_vtbl_entries for it. But it
9076 might be a lost primary, so just skip down to vid->binfo. */
9077 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9079 gcc_assert (non_primary_binfo
== vid
->vbase
);
9080 non_primary_binfo
= vid
->binfo
;
9084 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9085 if (get_primary_binfo (b
) != non_primary_binfo
)
9087 non_primary_binfo
= b
;
9090 if (vid
->ctor_vtbl_p
)
9091 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9092 where rtti_binfo is the most derived type. */
9094 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9096 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9097 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9098 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9100 base_virtuals
= TREE_CHAIN (base_virtuals
),
9101 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9102 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9106 /* Find the declaration that originally caused this function to
9107 be present in BINFO_TYPE (binfo). */
9108 orig_fn
= BV_FN (orig_virtuals
);
9110 /* When processing BINFO, we only want to generate vcall slots for
9111 function slots introduced in BINFO. So don't try to generate
9112 one if the function isn't even defined in BINFO. */
9113 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9116 add_vcall_offset (orig_fn
, binfo
, vid
);
9121 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9124 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9130 /* If there is already an entry for a function with the same
9131 signature as FN, then we do not need a second vcall offset.
9132 Check the list of functions already present in the derived
9134 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9136 if (same_signature_p (derived_entry
, orig_fn
)
9137 /* We only use one vcall offset for virtual destructors,
9138 even though there are two virtual table entries. */
9139 || (DECL_DESTRUCTOR_P (derived_entry
)
9140 && DECL_DESTRUCTOR_P (orig_fn
)))
9144 /* If we are building these vcall offsets as part of building
9145 the vtable for the most derived class, remember the vcall
9147 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9149 tree_pair_s elt
= {orig_fn
, vid
->index
};
9150 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9153 /* The next vcall offset will be found at a more negative
9155 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9156 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9158 /* Keep track of this function. */
9159 vec_safe_push (vid
->fns
, orig_fn
);
9161 if (vid
->generate_vcall_entries
)
9166 /* Find the overriding function. */
9167 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9168 if (fn
== error_mark_node
)
9169 vcall_offset
= build_zero_cst (vtable_entry_type
);
9172 base
= TREE_VALUE (fn
);
9174 /* The vbase we're working on is a primary base of
9175 vid->binfo. But it might be a lost primary, so its
9176 BINFO_OFFSET might be wrong, so we just use the
9177 BINFO_OFFSET from vid->binfo. */
9178 vcall_offset
= size_diffop_loc (input_location
,
9179 BINFO_OFFSET (base
),
9180 BINFO_OFFSET (vid
->binfo
));
9181 vcall_offset
= fold_build1_loc (input_location
,
9182 NOP_EXPR
, vtable_entry_type
,
9185 /* Add the initializer to the vtable. */
9186 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9190 /* Return vtbl initializers for the RTTI entries corresponding to the
9191 BINFO's vtable. The RTTI entries should indicate the object given
9192 by VID->rtti_binfo. */
9195 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9203 t
= BINFO_TYPE (vid
->rtti_binfo
);
9205 /* To find the complete object, we will first convert to our most
9206 primary base, and then add the offset in the vtbl to that value. */
9208 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9209 && !BINFO_LOST_PRIMARY_P (b
))
9213 primary_base
= get_primary_binfo (b
);
9214 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9215 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9218 offset
= size_diffop_loc (input_location
,
9219 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9221 /* The second entry is the address of the typeinfo object. */
9223 decl
= build_address (get_tinfo_decl (t
));
9225 decl
= integer_zero_node
;
9227 /* Convert the declaration to a type that can be stored in the
9229 init
= build_nop (vfunc_ptr_type_node
, decl
);
9230 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9232 /* Add the offset-to-top entry. It comes earlier in the vtable than
9233 the typeinfo entry. Convert the offset to look like a
9234 function pointer, so that we can put it in the vtable. */
9235 init
= build_nop (vfunc_ptr_type_node
, offset
);
9236 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9239 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9243 uniquely_derived_from_p (tree parent
, tree type
)
9245 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9246 return base
&& base
!= error_mark_node
;
9249 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9252 publicly_uniquely_derived_p (tree parent
, tree type
)
9254 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9256 return base
&& base
!= error_mark_node
;
9259 #include "gt-cp-class.h"