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"
29 #include "stringpool.h"
30 #include "stor-layout.h"
40 #include "splay-tree.h"
41 #include "pointer-set.h"
42 #include "hash-table.h"
46 /* The number of nested classes being processed. If we are not in the
47 scope of any class, this is zero. */
49 int current_class_depth
;
51 /* In order to deal with nested classes, we keep a stack of classes.
52 The topmost entry is the innermost class, and is the entry at index
53 CURRENT_CLASS_DEPTH */
55 typedef struct class_stack_node
{
56 /* The name of the class. */
59 /* The _TYPE node for the class. */
62 /* The access specifier pending for new declarations in the scope of
66 /* If were defining TYPE, the names used in this class. */
67 splay_tree names_used
;
69 /* Nonzero if this class is no longer open, because of a call to
72 }* class_stack_node_t
;
74 typedef struct vtbl_init_data_s
76 /* The base for which we're building initializers. */
78 /* The type of the most-derived type. */
80 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
81 unless ctor_vtbl_p is true. */
83 /* The negative-index vtable initializers built up so far. These
84 are in order from least negative index to most negative index. */
85 vec
<constructor_elt
, va_gc
> *inits
;
86 /* The binfo for the virtual base for which we're building
87 vcall offset initializers. */
89 /* The functions in vbase for which we have already provided vcall
91 vec
<tree
, va_gc
> *fns
;
92 /* The vtable index of the next vcall or vbase offset. */
94 /* Nonzero if we are building the initializer for the primary
97 /* Nonzero if we are building the initializer for a construction
100 /* True when adding vcall offset entries to the vtable. False when
101 merely computing the indices. */
102 bool generate_vcall_entries
;
105 /* The type of a function passed to walk_subobject_offsets. */
106 typedef int (*subobject_offset_fn
) (tree
, tree
, splay_tree
);
108 /* The stack itself. This is a dynamically resized array. The
109 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
110 static int current_class_stack_size
;
111 static class_stack_node_t current_class_stack
;
113 /* The size of the largest empty class seen in this translation unit. */
114 static GTY (()) tree sizeof_biggest_empty_class
;
116 /* An array of all local classes present in this translation unit, in
117 declaration order. */
118 vec
<tree
, va_gc
> *local_classes
;
120 static tree
get_vfield_name (tree
);
121 static void finish_struct_anon (tree
);
122 static tree
get_vtable_name (tree
);
123 static tree
get_basefndecls (tree
, tree
);
124 static int build_primary_vtable (tree
, tree
);
125 static int build_secondary_vtable (tree
);
126 static void finish_vtbls (tree
);
127 static void modify_vtable_entry (tree
, tree
, tree
, tree
, tree
*);
128 static void finish_struct_bits (tree
);
129 static int alter_access (tree
, tree
, tree
);
130 static void handle_using_decl (tree
, tree
);
131 static tree
dfs_modify_vtables (tree
, void *);
132 static tree
modify_all_vtables (tree
, tree
);
133 static void determine_primary_bases (tree
);
134 static void finish_struct_methods (tree
);
135 static void maybe_warn_about_overly_private_class (tree
);
136 static int method_name_cmp (const void *, const void *);
137 static int resort_method_name_cmp (const void *, const void *);
138 static void add_implicitly_declared_members (tree
, tree
*, int, int);
139 static tree
fixed_type_or_null (tree
, int *, int *);
140 static tree
build_simple_base_path (tree expr
, tree binfo
);
141 static tree
build_vtbl_ref_1 (tree
, tree
);
142 static void build_vtbl_initializer (tree
, tree
, tree
, tree
, int *,
143 vec
<constructor_elt
, va_gc
> **);
144 static int count_fields (tree
);
145 static int add_fields_to_record_type (tree
, struct sorted_fields_type
*, int);
146 static void insert_into_classtype_sorted_fields (tree
, tree
, int);
147 static bool check_bitfield_decl (tree
);
148 static void check_field_decl (tree
, tree
, int *, int *, int *);
149 static void check_field_decls (tree
, tree
*, int *, int *);
150 static tree
*build_base_field (record_layout_info
, tree
, splay_tree
, tree
*);
151 static void build_base_fields (record_layout_info
, splay_tree
, tree
*);
152 static void check_methods (tree
);
153 static void remove_zero_width_bit_fields (tree
);
154 static void check_bases (tree
, int *, int *);
155 static void check_bases_and_members (tree
);
156 static tree
create_vtable_ptr (tree
, tree
*);
157 static void include_empty_classes (record_layout_info
);
158 static void layout_class_type (tree
, tree
*);
159 static void propagate_binfo_offsets (tree
, tree
);
160 static void layout_virtual_bases (record_layout_info
, splay_tree
);
161 static void build_vbase_offset_vtbl_entries (tree
, vtbl_init_data
*);
162 static void add_vcall_offset_vtbl_entries_r (tree
, vtbl_init_data
*);
163 static void add_vcall_offset_vtbl_entries_1 (tree
, vtbl_init_data
*);
164 static void build_vcall_offset_vtbl_entries (tree
, vtbl_init_data
*);
165 static void add_vcall_offset (tree
, tree
, vtbl_init_data
*);
166 static void layout_vtable_decl (tree
, int);
167 static tree
dfs_find_final_overrider_pre (tree
, void *);
168 static tree
dfs_find_final_overrider_post (tree
, void *);
169 static tree
find_final_overrider (tree
, tree
, tree
);
170 static int make_new_vtable (tree
, tree
);
171 static tree
get_primary_binfo (tree
);
172 static int maybe_indent_hierarchy (FILE *, int, int);
173 static tree
dump_class_hierarchy_r (FILE *, int, tree
, tree
, int);
174 static void dump_class_hierarchy (tree
);
175 static void dump_class_hierarchy_1 (FILE *, int, tree
);
176 static void dump_array (FILE *, tree
);
177 static void dump_vtable (tree
, tree
, tree
);
178 static void dump_vtt (tree
, tree
);
179 static void dump_thunk (FILE *, int, tree
);
180 static tree
build_vtable (tree
, tree
, tree
);
181 static void initialize_vtable (tree
, vec
<constructor_elt
, va_gc
> *);
182 static void layout_nonempty_base_or_field (record_layout_info
,
183 tree
, tree
, splay_tree
);
184 static tree
end_of_class (tree
, int);
185 static bool layout_empty_base (record_layout_info
, tree
, tree
, splay_tree
);
186 static void accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
187 vec
<constructor_elt
, va_gc
> **);
188 static void dfs_accumulate_vtbl_inits (tree
, tree
, tree
, tree
, tree
,
189 vec
<constructor_elt
, va_gc
> **);
190 static void build_rtti_vtbl_entries (tree
, vtbl_init_data
*);
191 static void build_vcall_and_vbase_vtbl_entries (tree
, vtbl_init_data
*);
192 static void clone_constructors_and_destructors (tree
);
193 static tree
build_clone (tree
, tree
);
194 static void update_vtable_entry_for_fn (tree
, tree
, tree
, tree
*, unsigned);
195 static void build_ctor_vtbl_group (tree
, tree
);
196 static void build_vtt (tree
);
197 static tree
binfo_ctor_vtable (tree
);
198 static void build_vtt_inits (tree
, tree
, vec
<constructor_elt
, va_gc
> **,
200 static tree
dfs_build_secondary_vptr_vtt_inits (tree
, void *);
201 static tree
dfs_fixup_binfo_vtbls (tree
, void *);
202 static int record_subobject_offset (tree
, tree
, splay_tree
);
203 static int check_subobject_offset (tree
, tree
, splay_tree
);
204 static int walk_subobject_offsets (tree
, subobject_offset_fn
,
205 tree
, splay_tree
, tree
, int);
206 static void record_subobject_offsets (tree
, tree
, splay_tree
, bool);
207 static int layout_conflict_p (tree
, tree
, splay_tree
, int);
208 static int splay_tree_compare_integer_csts (splay_tree_key k1
,
210 static void warn_about_ambiguous_bases (tree
);
211 static bool type_requires_array_cookie (tree
);
212 static bool contains_empty_class_p (tree
);
213 static bool base_derived_from (tree
, tree
);
214 static int empty_base_at_nonzero_offset_p (tree
, tree
, splay_tree
);
215 static tree
end_of_base (tree
);
216 static tree
get_vcall_index (tree
, tree
);
218 /* Variables shared between class.c and call.c. */
221 int n_vtable_entries
= 0;
222 int n_vtable_searches
= 0;
223 int n_vtable_elems
= 0;
224 int n_convert_harshness
= 0;
225 int n_compute_conversion_costs
= 0;
226 int n_inner_fields_searched
= 0;
228 /* Convert to or from a base subobject. EXPR is an expression of type
229 `A' or `A*', an expression of type `B' or `B*' is returned. To
230 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
231 the B base instance within A. To convert base A to derived B, CODE
232 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
233 In this latter case, A must not be a morally virtual base of B.
234 NONNULL is true if EXPR is known to be non-NULL (this is only
235 needed when EXPR is of pointer type). CV qualifiers are preserved
239 build_base_path (enum tree_code code
,
243 tsubst_flags_t complain
)
245 tree v_binfo
= NULL_TREE
;
246 tree d_binfo
= NULL_TREE
;
250 tree null_test
= NULL
;
251 tree ptr_target_type
;
253 int want_pointer
= TYPE_PTR_P (TREE_TYPE (expr
));
254 bool has_empty
= false;
257 if (expr
== error_mark_node
|| binfo
== error_mark_node
|| !binfo
)
258 return error_mark_node
;
260 for (probe
= binfo
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
263 if (is_empty_class (BINFO_TYPE (probe
)))
265 if (!v_binfo
&& BINFO_VIRTUAL_P (probe
))
269 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (expr
));
271 probe
= TYPE_MAIN_VARIANT (TREE_TYPE (probe
));
273 if (code
== PLUS_EXPR
274 && !SAME_BINFO_TYPE_P (BINFO_TYPE (d_binfo
), probe
))
276 /* This can happen when adjust_result_of_qualified_name_lookup can't
277 find a unique base binfo in a call to a member function. We
278 couldn't give the diagnostic then since we might have been calling
279 a static member function, so we do it now. */
280 if (complain
& tf_error
)
282 tree base
= lookup_base (probe
, BINFO_TYPE (d_binfo
),
283 ba_unique
, NULL
, complain
);
284 gcc_assert (base
== error_mark_node
);
286 return error_mark_node
;
289 gcc_assert ((code
== MINUS_EXPR
290 && SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), probe
))
291 || code
== PLUS_EXPR
);
293 if (binfo
== d_binfo
)
297 if (code
== MINUS_EXPR
&& v_binfo
)
299 if (complain
& tf_error
)
301 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (v_binfo
)))
304 error ("cannot convert from pointer to base class %qT to "
305 "pointer to derived class %qT because the base is "
306 "virtual", BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
308 error ("cannot convert from base class %qT to derived "
309 "class %qT because the base is virtual",
310 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
));
315 error ("cannot convert from pointer to base class %qT to "
316 "pointer to derived class %qT via virtual base %qT",
317 BINFO_TYPE (binfo
), BINFO_TYPE (d_binfo
),
318 BINFO_TYPE (v_binfo
));
320 error ("cannot convert from base class %qT to derived "
321 "class %qT via virtual base %qT", BINFO_TYPE (binfo
),
322 BINFO_TYPE (d_binfo
), BINFO_TYPE (v_binfo
));
325 return error_mark_node
;
329 /* This must happen before the call to save_expr. */
330 expr
= cp_build_addr_expr (expr
, complain
);
332 expr
= mark_rvalue_use (expr
);
334 offset
= BINFO_OFFSET (binfo
);
335 fixed_type_p
= resolves_to_fixed_type_p (expr
, &nonnull
);
336 target_type
= code
== PLUS_EXPR
? BINFO_TYPE (binfo
) : BINFO_TYPE (d_binfo
);
337 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
338 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
339 expression returned matches the input. */
340 target_type
= cp_build_qualified_type
341 (target_type
, cp_type_quals (TREE_TYPE (TREE_TYPE (expr
))));
342 ptr_target_type
= build_pointer_type (target_type
);
344 /* Do we need to look in the vtable for the real offset? */
345 virtual_access
= (v_binfo
&& fixed_type_p
<= 0);
347 /* Don't bother with the calculations inside sizeof; they'll ICE if the
348 source type is incomplete and the pointer value doesn't matter. In a
349 template (even in fold_non_dependent_expr), we don't have vtables set
350 up properly yet, and the value doesn't matter there either; we're just
351 interested in the result of overload resolution. */
352 if (cp_unevaluated_operand
!= 0
353 || in_template_function ())
355 expr
= build_nop (ptr_target_type
, expr
);
357 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
361 /* If we're in an NSDMI, we don't have the full constructor context yet
362 that we need for converting to a virtual base, so just build a stub
363 CONVERT_EXPR and expand it later in bot_replace. */
364 if (virtual_access
&& fixed_type_p
< 0
365 && current_scope () != current_function_decl
)
367 expr
= build1 (CONVERT_EXPR
, ptr_target_type
, expr
);
368 CONVERT_EXPR_VBASE_PATH (expr
) = true;
370 expr
= build_indirect_ref (EXPR_LOCATION (expr
), expr
, RO_NULL
);
374 /* Do we need to check for a null pointer? */
375 if (want_pointer
&& !nonnull
)
377 /* If we know the conversion will not actually change the value
378 of EXPR, then we can avoid testing the expression for NULL.
379 We have to avoid generating a COMPONENT_REF for a base class
380 field, because other parts of the compiler know that such
381 expressions are always non-NULL. */
382 if (!virtual_access
&& integer_zerop (offset
))
383 return build_nop (ptr_target_type
, expr
);
384 null_test
= error_mark_node
;
387 /* Protect against multiple evaluation if necessary. */
388 if (TREE_SIDE_EFFECTS (expr
) && (null_test
|| virtual_access
))
389 expr
= save_expr (expr
);
391 /* Now that we've saved expr, build the real null test. */
394 tree zero
= cp_convert (TREE_TYPE (expr
), nullptr_node
, complain
);
395 null_test
= fold_build2_loc (input_location
, NE_EXPR
, boolean_type_node
,
399 /* If this is a simple base reference, express it as a COMPONENT_REF. */
400 if (code
== PLUS_EXPR
&& !virtual_access
401 /* We don't build base fields for empty bases, and they aren't very
402 interesting to the optimizers anyway. */
405 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
406 expr
= build_simple_base_path (expr
, binfo
);
408 expr
= build_address (expr
);
409 target_type
= TREE_TYPE (expr
);
415 /* Going via virtual base V_BINFO. We need the static offset
416 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
417 V_BINFO. That offset is an entry in D_BINFO's vtable. */
420 if (fixed_type_p
< 0 && in_base_initializer
)
422 /* In a base member initializer, we cannot rely on the
423 vtable being set up. We have to indirect via the
427 t
= TREE_TYPE (TYPE_VFIELD (current_class_type
));
428 t
= build_pointer_type (t
);
429 v_offset
= convert (t
, current_vtt_parm
);
430 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
433 v_offset
= build_vfield_ref (cp_build_indirect_ref (expr
, RO_NULL
,
435 TREE_TYPE (TREE_TYPE (expr
)));
437 v_offset
= fold_build_pointer_plus (v_offset
, BINFO_VPTR_FIELD (v_binfo
));
438 v_offset
= build1 (NOP_EXPR
,
439 build_pointer_type (ptrdiff_type_node
),
441 v_offset
= cp_build_indirect_ref (v_offset
, RO_NULL
, complain
);
442 TREE_CONSTANT (v_offset
) = 1;
444 offset
= convert_to_integer (ptrdiff_type_node
,
445 size_diffop_loc (input_location
, offset
,
446 BINFO_OFFSET (v_binfo
)));
448 if (!integer_zerop (offset
))
449 v_offset
= build2 (code
, ptrdiff_type_node
, v_offset
, offset
);
451 if (fixed_type_p
< 0)
452 /* Negative fixed_type_p means this is a constructor or destructor;
453 virtual base layout is fixed in in-charge [cd]tors, but not in
455 offset
= build3 (COND_EXPR
, ptrdiff_type_node
,
456 build2 (EQ_EXPR
, boolean_type_node
,
457 current_in_charge_parm
, integer_zero_node
),
459 convert_to_integer (ptrdiff_type_node
,
460 BINFO_OFFSET (binfo
)));
466 target_type
= ptr_target_type
;
468 expr
= build1 (NOP_EXPR
, ptr_target_type
, expr
);
470 if (!integer_zerop (offset
))
472 offset
= fold_convert (sizetype
, offset
);
473 if (code
== MINUS_EXPR
)
474 offset
= fold_build1_loc (input_location
, NEGATE_EXPR
, sizetype
, offset
);
475 expr
= fold_build_pointer_plus (expr
, offset
);
481 expr
= cp_build_indirect_ref (expr
, RO_NULL
, complain
);
485 expr
= fold_build3_loc (input_location
, COND_EXPR
, target_type
, null_test
, expr
,
486 build_zero_cst (target_type
));
491 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
492 Perform a derived-to-base conversion by recursively building up a
493 sequence of COMPONENT_REFs to the appropriate base fields. */
496 build_simple_base_path (tree expr
, tree binfo
)
498 tree type
= BINFO_TYPE (binfo
);
499 tree d_binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
502 if (d_binfo
== NULL_TREE
)
506 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (expr
)) == type
);
508 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
509 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
510 an lvalue in the front end; only _DECLs and _REFs are lvalues
512 temp
= unary_complex_lvalue (ADDR_EXPR
, expr
);
514 expr
= cp_build_indirect_ref (temp
, RO_NULL
, tf_warning_or_error
);
520 expr
= build_simple_base_path (expr
, d_binfo
);
522 for (field
= TYPE_FIELDS (BINFO_TYPE (d_binfo
));
523 field
; field
= DECL_CHAIN (field
))
524 /* Is this the base field created by build_base_field? */
525 if (TREE_CODE (field
) == FIELD_DECL
526 && DECL_FIELD_IS_BASE (field
)
527 && TREE_TYPE (field
) == type
528 /* If we're looking for a field in the most-derived class,
529 also check the field offset; we can have two base fields
530 of the same type if one is an indirect virtual base and one
531 is a direct non-virtual base. */
532 && (BINFO_INHERITANCE_CHAIN (d_binfo
)
533 || tree_int_cst_equal (byte_position (field
),
534 BINFO_OFFSET (binfo
))))
536 /* We don't use build_class_member_access_expr here, as that
537 has unnecessary checks, and more importantly results in
538 recursive calls to dfs_walk_once. */
539 int type_quals
= cp_type_quals (TREE_TYPE (expr
));
541 expr
= build3 (COMPONENT_REF
,
542 cp_build_qualified_type (type
, type_quals
),
543 expr
, field
, NULL_TREE
);
544 expr
= fold_if_not_in_template (expr
);
546 /* Mark the expression const or volatile, as appropriate.
547 Even though we've dealt with the type above, we still have
548 to mark the expression itself. */
549 if (type_quals
& TYPE_QUAL_CONST
)
550 TREE_READONLY (expr
) = 1;
551 if (type_quals
& TYPE_QUAL_VOLATILE
)
552 TREE_THIS_VOLATILE (expr
) = 1;
557 /* Didn't find the base field?!? */
561 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
562 type is a class type or a pointer to a class type. In the former
563 case, TYPE is also a class type; in the latter it is another
564 pointer type. If CHECK_ACCESS is true, an error message is emitted
565 if TYPE is inaccessible. If OBJECT has pointer type, the value is
566 assumed to be non-NULL. */
569 convert_to_base (tree object
, tree type
, bool check_access
, bool nonnull
,
570 tsubst_flags_t complain
)
575 if (TYPE_PTR_P (TREE_TYPE (object
)))
577 object_type
= TREE_TYPE (TREE_TYPE (object
));
578 type
= TREE_TYPE (type
);
581 object_type
= TREE_TYPE (object
);
583 binfo
= lookup_base (object_type
, type
, check_access
? ba_check
: ba_unique
,
585 if (!binfo
|| binfo
== error_mark_node
)
586 return error_mark_node
;
588 return build_base_path (PLUS_EXPR
, object
, binfo
, nonnull
, complain
);
591 /* EXPR is an expression with unqualified class type. BASE is a base
592 binfo of that class type. Returns EXPR, converted to the BASE
593 type. This function assumes that EXPR is the most derived class;
594 therefore virtual bases can be found at their static offsets. */
597 convert_to_base_statically (tree expr
, tree base
)
601 expr_type
= TREE_TYPE (expr
);
602 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (base
), expr_type
))
604 /* If this is a non-empty base, use a COMPONENT_REF. */
605 if (!is_empty_class (BINFO_TYPE (base
)))
606 return build_simple_base_path (expr
, base
);
608 /* We use fold_build2 and fold_convert below to simplify the trees
609 provided to the optimizers. It is not safe to call these functions
610 when processing a template because they do not handle C++-specific
612 gcc_assert (!processing_template_decl
);
613 expr
= cp_build_addr_expr (expr
, tf_warning_or_error
);
614 if (!integer_zerop (BINFO_OFFSET (base
)))
615 expr
= fold_build_pointer_plus_loc (input_location
,
616 expr
, BINFO_OFFSET (base
));
617 expr
= fold_convert (build_pointer_type (BINFO_TYPE (base
)), expr
);
618 expr
= build_fold_indirect_ref_loc (input_location
, expr
);
626 build_vfield_ref (tree datum
, tree type
)
628 tree vfield
, vcontext
;
630 if (datum
== error_mark_node
)
631 return error_mark_node
;
633 /* First, convert to the requested type. */
634 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (datum
), type
))
635 datum
= convert_to_base (datum
, type
, /*check_access=*/false,
636 /*nonnull=*/true, tf_warning_or_error
);
638 /* Second, the requested type may not be the owner of its own vptr.
639 If not, convert to the base class that owns it. We cannot use
640 convert_to_base here, because VCONTEXT may appear more than once
641 in the inheritance hierarchy of TYPE, and thus direct conversion
642 between the types may be ambiguous. Following the path back up
643 one step at a time via primary bases avoids the problem. */
644 vfield
= TYPE_VFIELD (type
);
645 vcontext
= DECL_CONTEXT (vfield
);
646 while (!same_type_ignoring_top_level_qualifiers_p (vcontext
, type
))
648 datum
= build_simple_base_path (datum
, CLASSTYPE_PRIMARY_BINFO (type
));
649 type
= TREE_TYPE (datum
);
652 return build3 (COMPONENT_REF
, TREE_TYPE (vfield
), datum
, vfield
, NULL_TREE
);
655 /* Given an object INSTANCE, return an expression which yields the
656 vtable element corresponding to INDEX. There are many special
657 cases for INSTANCE which we take care of here, mainly to avoid
658 creating extra tree nodes when we don't have to. */
661 build_vtbl_ref_1 (tree instance
, tree idx
)
664 tree vtbl
= NULL_TREE
;
666 /* Try to figure out what a reference refers to, and
667 access its virtual function table directly. */
670 tree fixed_type
= fixed_type_or_null (instance
, NULL
, &cdtorp
);
672 tree basetype
= non_reference (TREE_TYPE (instance
));
674 if (fixed_type
&& !cdtorp
)
676 tree binfo
= lookup_base (fixed_type
, basetype
,
677 ba_unique
, NULL
, tf_none
);
678 if (binfo
&& binfo
!= error_mark_node
)
679 vtbl
= unshare_expr (BINFO_VTABLE (binfo
));
683 vtbl
= build_vfield_ref (instance
, basetype
);
685 aref
= build_array_ref (input_location
, vtbl
, idx
);
686 TREE_CONSTANT (aref
) |= TREE_CONSTANT (vtbl
) && TREE_CONSTANT (idx
);
692 build_vtbl_ref (tree instance
, tree idx
)
694 tree aref
= build_vtbl_ref_1 (instance
, idx
);
699 /* Given a stable object pointer INSTANCE_PTR, return an expression which
700 yields a function pointer corresponding to vtable element INDEX. */
703 build_vfn_ref (tree instance_ptr
, tree idx
)
707 aref
= build_vtbl_ref_1 (cp_build_indirect_ref (instance_ptr
, RO_NULL
,
708 tf_warning_or_error
),
711 /* When using function descriptors, the address of the
712 vtable entry is treated as a function pointer. */
713 if (TARGET_VTABLE_USES_DESCRIPTORS
)
714 aref
= build1 (NOP_EXPR
, TREE_TYPE (aref
),
715 cp_build_addr_expr (aref
, tf_warning_or_error
));
717 /* Remember this as a method reference, for later devirtualization. */
718 aref
= build3 (OBJ_TYPE_REF
, TREE_TYPE (aref
), aref
, instance_ptr
, idx
);
723 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
724 for the given TYPE. */
727 get_vtable_name (tree type
)
729 return mangle_vtbl_for_type (type
);
732 /* DECL is an entity associated with TYPE, like a virtual table or an
733 implicitly generated constructor. Determine whether or not DECL
734 should have external or internal linkage at the object file
735 level. This routine does not deal with COMDAT linkage and other
736 similar complexities; it simply sets TREE_PUBLIC if it possible for
737 entities in other translation units to contain copies of DECL, in
741 set_linkage_according_to_type (tree
/*type*/, tree decl
)
743 TREE_PUBLIC (decl
) = 1;
744 determine_visibility (decl
);
747 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
748 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
749 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
752 build_vtable (tree class_type
, tree name
, tree vtable_type
)
756 decl
= build_lang_decl (VAR_DECL
, name
, vtable_type
);
757 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
758 now to avoid confusion in mangle_decl. */
759 SET_DECL_ASSEMBLER_NAME (decl
, name
);
760 DECL_CONTEXT (decl
) = class_type
;
761 DECL_ARTIFICIAL (decl
) = 1;
762 TREE_STATIC (decl
) = 1;
763 TREE_READONLY (decl
) = 1;
764 DECL_VIRTUAL_P (decl
) = 1;
765 DECL_ALIGN (decl
) = TARGET_VTABLE_ENTRY_ALIGN
;
766 DECL_VTABLE_OR_VTT_P (decl
) = 1;
767 /* At one time the vtable info was grabbed 2 words at a time. This
768 fails on sparc unless you have 8-byte alignment. (tiemann) */
769 DECL_ALIGN (decl
) = MAX (TYPE_ALIGN (double_type_node
),
771 set_linkage_according_to_type (class_type
, decl
);
772 /* The vtable has not been defined -- yet. */
773 DECL_EXTERNAL (decl
) = 1;
774 DECL_NOT_REALLY_EXTERN (decl
) = 1;
776 /* Mark the VAR_DECL node representing the vtable itself as a
777 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
778 is rather important that such things be ignored because any
779 effort to actually generate DWARF for them will run into
780 trouble when/if we encounter code like:
783 struct S { virtual void member (); };
785 because the artificial declaration of the vtable itself (as
786 manufactured by the g++ front end) will say that the vtable is
787 a static member of `S' but only *after* the debug output for
788 the definition of `S' has already been output. This causes
789 grief because the DWARF entry for the definition of the vtable
790 will try to refer back to an earlier *declaration* of the
791 vtable as a static member of `S' and there won't be one. We
792 might be able to arrange to have the "vtable static member"
793 attached to the member list for `S' before the debug info for
794 `S' get written (which would solve the problem) but that would
795 require more intrusive changes to the g++ front end. */
796 DECL_IGNORED_P (decl
) = 1;
801 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
802 or even complete. If this does not exist, create it. If COMPLETE is
803 nonzero, then complete the definition of it -- that will render it
804 impossible to actually build the vtable, but is useful to get at those
805 which are known to exist in the runtime. */
808 get_vtable_decl (tree type
, int complete
)
812 if (CLASSTYPE_VTABLES (type
))
813 return CLASSTYPE_VTABLES (type
);
815 decl
= build_vtable (type
, get_vtable_name (type
), vtbl_type_node
);
816 CLASSTYPE_VTABLES (type
) = decl
;
820 DECL_EXTERNAL (decl
) = 1;
821 cp_finish_decl (decl
, NULL_TREE
, false, NULL_TREE
, 0);
827 /* Build the primary virtual function table for TYPE. If BINFO is
828 non-NULL, build the vtable starting with the initial approximation
829 that it is the same as the one which is the head of the association
830 list. Returns a nonzero value if a new vtable is actually
834 build_primary_vtable (tree binfo
, tree type
)
839 decl
= get_vtable_decl (type
, /*complete=*/0);
843 if (BINFO_NEW_VTABLE_MARKED (binfo
))
844 /* We have already created a vtable for this base, so there's
845 no need to do it again. */
848 virtuals
= copy_list (BINFO_VIRTUALS (binfo
));
849 TREE_TYPE (decl
) = TREE_TYPE (get_vtbl_decl_for_binfo (binfo
));
850 DECL_SIZE (decl
) = TYPE_SIZE (TREE_TYPE (decl
));
851 DECL_SIZE_UNIT (decl
) = TYPE_SIZE_UNIT (TREE_TYPE (decl
));
855 gcc_assert (TREE_TYPE (decl
) == vtbl_type_node
);
856 virtuals
= NULL_TREE
;
859 if (GATHER_STATISTICS
)
862 n_vtable_elems
+= list_length (virtuals
);
865 /* Initialize the association list for this type, based
866 on our first approximation. */
867 BINFO_VTABLE (TYPE_BINFO (type
)) = decl
;
868 BINFO_VIRTUALS (TYPE_BINFO (type
)) = virtuals
;
869 SET_BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (type
));
873 /* Give BINFO a new virtual function table which is initialized
874 with a skeleton-copy of its original initialization. The only
875 entry that changes is the `delta' entry, so we can really
876 share a lot of structure.
878 FOR_TYPE is the most derived type which caused this table to
881 Returns nonzero if we haven't met BINFO before.
883 The order in which vtables are built (by calling this function) for
884 an object must remain the same, otherwise a binary incompatibility
888 build_secondary_vtable (tree binfo
)
890 if (BINFO_NEW_VTABLE_MARKED (binfo
))
891 /* We already created a vtable for this base. There's no need to
895 /* Remember that we've created a vtable for this BINFO, so that we
896 don't try to do so again. */
897 SET_BINFO_NEW_VTABLE_MARKED (binfo
);
899 /* Make fresh virtual list, so we can smash it later. */
900 BINFO_VIRTUALS (binfo
) = copy_list (BINFO_VIRTUALS (binfo
));
902 /* Secondary vtables are laid out as part of the same structure as
903 the primary vtable. */
904 BINFO_VTABLE (binfo
) = NULL_TREE
;
908 /* Create a new vtable for BINFO which is the hierarchy dominated by
909 T. Return nonzero if we actually created a new vtable. */
912 make_new_vtable (tree t
, tree binfo
)
914 if (binfo
== TYPE_BINFO (t
))
915 /* In this case, it is *type*'s vtable we are modifying. We start
916 with the approximation that its vtable is that of the
917 immediate base class. */
918 return build_primary_vtable (binfo
, t
);
920 /* This is our very own copy of `basetype' to play with. Later,
921 we will fill in all the virtual functions that override the
922 virtual functions in these base classes which are not defined
923 by the current type. */
924 return build_secondary_vtable (binfo
);
927 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
928 (which is in the hierarchy dominated by T) list FNDECL as its
929 BV_FN. DELTA is the required constant adjustment from the `this'
930 pointer where the vtable entry appears to the `this' required when
931 the function is actually called. */
934 modify_vtable_entry (tree t
,
944 if (fndecl
!= BV_FN (v
)
945 || !tree_int_cst_equal (delta
, BV_DELTA (v
)))
947 /* We need a new vtable for BINFO. */
948 if (make_new_vtable (t
, binfo
))
950 /* If we really did make a new vtable, we also made a copy
951 of the BINFO_VIRTUALS list. Now, we have to find the
952 corresponding entry in that list. */
953 *virtuals
= BINFO_VIRTUALS (binfo
);
954 while (BV_FN (*virtuals
) != BV_FN (v
))
955 *virtuals
= TREE_CHAIN (*virtuals
);
959 BV_DELTA (v
) = delta
;
960 BV_VCALL_INDEX (v
) = NULL_TREE
;
966 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
967 the USING_DECL naming METHOD. Returns true if the method could be
968 added to the method vec. */
971 add_method (tree type
, tree method
, tree using_decl
)
975 bool template_conv_p
= false;
977 vec
<tree
, va_gc
> *method_vec
;
979 bool insert_p
= false;
983 if (method
== error_mark_node
)
986 complete_p
= COMPLETE_TYPE_P (type
);
987 conv_p
= DECL_CONV_FN_P (method
);
989 template_conv_p
= (TREE_CODE (method
) == TEMPLATE_DECL
990 && DECL_TEMPLATE_CONV_FN_P (method
));
992 method_vec
= CLASSTYPE_METHOD_VEC (type
);
995 /* Make a new method vector. We start with 8 entries. We must
996 allocate at least two (for constructors and destructors), and
997 we're going to end up with an assignment operator at some
999 vec_alloc (method_vec
, 8);
1000 /* Create slots for constructors and destructors. */
1001 method_vec
->quick_push (NULL_TREE
);
1002 method_vec
->quick_push (NULL_TREE
);
1003 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1006 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1007 grok_special_member_properties (method
);
1009 /* Constructors and destructors go in special slots. */
1010 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (method
))
1011 slot
= CLASSTYPE_CONSTRUCTOR_SLOT
;
1012 else if (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1014 slot
= CLASSTYPE_DESTRUCTOR_SLOT
;
1016 if (TYPE_FOR_JAVA (type
))
1018 if (!DECL_ARTIFICIAL (method
))
1019 error ("Java class %qT cannot have a destructor", type
);
1020 else if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
1021 error ("Java class %qT cannot have an implicit non-trivial "
1031 /* See if we already have an entry with this name. */
1032 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
1033 vec_safe_iterate (method_vec
, slot
, &m
);
1036 m
= OVL_CURRENT (m
);
1037 if (template_conv_p
)
1039 if (TREE_CODE (m
) == TEMPLATE_DECL
1040 && DECL_TEMPLATE_CONV_FN_P (m
))
1044 if (conv_p
&& !DECL_CONV_FN_P (m
))
1046 if (DECL_NAME (m
) == DECL_NAME (method
))
1052 && !DECL_CONV_FN_P (m
)
1053 && DECL_NAME (m
) > DECL_NAME (method
))
1057 current_fns
= insert_p
? NULL_TREE
: (*method_vec
)[slot
];
1059 /* Check to see if we've already got this method. */
1060 for (fns
= current_fns
; fns
; fns
= OVL_NEXT (fns
))
1062 tree fn
= OVL_CURRENT (fns
);
1068 if (TREE_CODE (fn
) != TREE_CODE (method
))
1071 /* [over.load] Member function declarations with the
1072 same name and the same parameter types cannot be
1073 overloaded if any of them is a static member
1074 function declaration.
1076 [over.load] Member function declarations with the same name and
1077 the same parameter-type-list as well as member function template
1078 declarations with the same name, the same parameter-type-list, and
1079 the same template parameter lists cannot be overloaded if any of
1080 them, but not all, have a ref-qualifier.
1082 [namespace.udecl] When a using-declaration brings names
1083 from a base class into a derived class scope, member
1084 functions in the derived class override and/or hide member
1085 functions with the same name and parameter types in a base
1086 class (rather than conflicting). */
1087 fn_type
= TREE_TYPE (fn
);
1088 method_type
= TREE_TYPE (method
);
1089 parms1
= TYPE_ARG_TYPES (fn_type
);
1090 parms2
= TYPE_ARG_TYPES (method_type
);
1092 /* Compare the quals on the 'this' parm. Don't compare
1093 the whole types, as used functions are treated as
1094 coming from the using class in overload resolution. */
1095 if (! DECL_STATIC_FUNCTION_P (fn
)
1096 && ! DECL_STATIC_FUNCTION_P (method
)
1097 /* Either both or neither need to be ref-qualified for
1098 differing quals to allow overloading. */
1099 && (FUNCTION_REF_QUALIFIED (fn_type
)
1100 == FUNCTION_REF_QUALIFIED (method_type
))
1101 && (type_memfn_quals (fn_type
) != type_memfn_quals (method_type
)
1102 || type_memfn_rqual (fn_type
) != type_memfn_rqual (method_type
)))
1105 /* For templates, the return type and template parameters
1106 must be identical. */
1107 if (TREE_CODE (fn
) == TEMPLATE_DECL
1108 && (!same_type_p (TREE_TYPE (fn_type
),
1109 TREE_TYPE (method_type
))
1110 || !comp_template_parms (DECL_TEMPLATE_PARMS (fn
),
1111 DECL_TEMPLATE_PARMS (method
))))
1114 if (! DECL_STATIC_FUNCTION_P (fn
))
1115 parms1
= TREE_CHAIN (parms1
);
1116 if (! DECL_STATIC_FUNCTION_P (method
))
1117 parms2
= TREE_CHAIN (parms2
);
1119 if (compparms (parms1
, parms2
)
1120 && (!DECL_CONV_FN_P (fn
)
1121 || same_type_p (TREE_TYPE (fn_type
),
1122 TREE_TYPE (method_type
))))
1124 /* For function versions, their parms and types match
1125 but they are not duplicates. Record function versions
1126 as and when they are found. extern "C" functions are
1127 not treated as versions. */
1128 if (TREE_CODE (fn
) == FUNCTION_DECL
1129 && TREE_CODE (method
) == FUNCTION_DECL
1130 && !DECL_EXTERN_C_P (fn
)
1131 && !DECL_EXTERN_C_P (method
)
1132 && targetm
.target_option
.function_versions (fn
, method
))
1134 /* Mark functions as versions if necessary. Modify the mangled
1135 decl name if necessary. */
1136 if (!DECL_FUNCTION_VERSIONED (fn
))
1138 DECL_FUNCTION_VERSIONED (fn
) = 1;
1139 if (DECL_ASSEMBLER_NAME_SET_P (fn
))
1142 if (!DECL_FUNCTION_VERSIONED (method
))
1144 DECL_FUNCTION_VERSIONED (method
) = 1;
1145 if (DECL_ASSEMBLER_NAME_SET_P (method
))
1146 mangle_decl (method
);
1148 record_function_versions (fn
, method
);
1151 if (DECL_INHERITED_CTOR_BASE (method
))
1153 if (DECL_INHERITED_CTOR_BASE (fn
))
1155 error_at (DECL_SOURCE_LOCATION (method
),
1156 "%q#D inherited from %qT", method
,
1157 DECL_INHERITED_CTOR_BASE (method
));
1158 error_at (DECL_SOURCE_LOCATION (fn
),
1159 "conflicts with version inherited from %qT",
1160 DECL_INHERITED_CTOR_BASE (fn
));
1162 /* Otherwise defer to the other function. */
1167 if (DECL_CONTEXT (fn
) == type
)
1168 /* Defer to the local function. */
1173 error ("%q+#D cannot be overloaded", method
);
1174 error ("with %q+#D", fn
);
1177 /* We don't call duplicate_decls here to merge the
1178 declarations because that will confuse things if the
1179 methods have inline definitions. In particular, we
1180 will crash while processing the definitions. */
1185 /* A class should never have more than one destructor. */
1186 if (current_fns
&& DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (method
))
1189 /* Add the new binding. */
1192 overload
= ovl_cons (method
, current_fns
);
1193 OVL_USED (overload
) = true;
1196 overload
= build_overload (method
, current_fns
);
1199 TYPE_HAS_CONVERSION (type
) = 1;
1200 else if (slot
>= CLASSTYPE_FIRST_CONVERSION_SLOT
&& !complete_p
)
1201 push_class_level_binding (DECL_NAME (method
), overload
);
1207 /* We only expect to add few methods in the COMPLETE_P case, so
1208 just make room for one more method in that case. */
1210 reallocated
= vec_safe_reserve_exact (method_vec
, 1);
1212 reallocated
= vec_safe_reserve (method_vec
, 1);
1214 CLASSTYPE_METHOD_VEC (type
) = method_vec
;
1215 if (slot
== method_vec
->length ())
1216 method_vec
->quick_push (overload
);
1218 method_vec
->quick_insert (slot
, overload
);
1221 /* Replace the current slot. */
1222 (*method_vec
)[slot
] = overload
;
1226 /* Subroutines of finish_struct. */
1228 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1229 legit, otherwise return 0. */
1232 alter_access (tree t
, tree fdecl
, tree access
)
1236 if (!DECL_LANG_SPECIFIC (fdecl
))
1237 retrofit_lang_decl (fdecl
);
1239 gcc_assert (!DECL_DISCRIMINATOR_P (fdecl
));
1241 elem
= purpose_member (t
, DECL_ACCESS (fdecl
));
1244 if (TREE_VALUE (elem
) != access
)
1246 if (TREE_CODE (TREE_TYPE (fdecl
)) == FUNCTION_DECL
)
1247 error ("conflicting access specifications for method"
1248 " %q+D, ignored", TREE_TYPE (fdecl
));
1250 error ("conflicting access specifications for field %qE, ignored",
1255 /* They're changing the access to the same thing they changed
1256 it to before. That's OK. */
1262 perform_or_defer_access_check (TYPE_BINFO (t
), fdecl
, fdecl
,
1263 tf_warning_or_error
);
1264 DECL_ACCESS (fdecl
) = tree_cons (t
, access
, DECL_ACCESS (fdecl
));
1270 /* Process the USING_DECL, which is a member of T. */
1273 handle_using_decl (tree using_decl
, tree t
)
1275 tree decl
= USING_DECL_DECLS (using_decl
);
1276 tree name
= DECL_NAME (using_decl
);
1278 = TREE_PRIVATE (using_decl
) ? access_private_node
1279 : TREE_PROTECTED (using_decl
) ? access_protected_node
1280 : access_public_node
;
1281 tree flist
= NULL_TREE
;
1284 gcc_assert (!processing_template_decl
&& decl
);
1286 old_value
= lookup_member (t
, name
, /*protect=*/0, /*want_type=*/false,
1287 tf_warning_or_error
);
1290 if (is_overloaded_fn (old_value
))
1291 old_value
= OVL_CURRENT (old_value
);
1293 if (DECL_P (old_value
) && DECL_CONTEXT (old_value
) == t
)
1296 old_value
= NULL_TREE
;
1299 cp_emit_debug_info_for_using (decl
, USING_DECL_SCOPE (using_decl
));
1301 if (is_overloaded_fn (decl
))
1306 else if (is_overloaded_fn (old_value
))
1309 /* It's OK to use functions from a base when there are functions with
1310 the same name already present in the current class. */;
1313 error ("%q+D invalid in %q#T", using_decl
, t
);
1314 error (" because of local method %q+#D with same name",
1315 OVL_CURRENT (old_value
));
1319 else if (!DECL_ARTIFICIAL (old_value
))
1321 error ("%q+D invalid in %q#T", using_decl
, t
);
1322 error (" because of local member %q+#D with same name", old_value
);
1326 /* Make type T see field decl FDECL with access ACCESS. */
1328 for (; flist
; flist
= OVL_NEXT (flist
))
1330 add_method (t
, OVL_CURRENT (flist
), using_decl
);
1331 alter_access (t
, OVL_CURRENT (flist
), access
);
1334 alter_access (t
, decl
, access
);
1337 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1338 types with abi tags, add the corresponding identifiers to the VEC in
1339 *DATA and set IDENTIFIER_MARKED. */
1348 find_abi_tags_r (tree
*tp
, int */
*walk_subtrees*/
, void *data
)
1350 if (!OVERLOAD_TYPE_P (*tp
))
1353 if (tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (*tp
)))
1355 struct abi_tag_data
*p
= static_cast<struct abi_tag_data
*>(data
);
1356 for (tree list
= TREE_VALUE (attributes
); list
;
1357 list
= TREE_CHAIN (list
))
1359 tree tag
= TREE_VALUE (list
);
1360 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1361 if (!IDENTIFIER_MARKED (id
))
1363 if (TYPE_P (p
->subob
))
1365 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1366 "that base %qT has", p
->t
, tag
, p
->subob
);
1367 inform (location_of (p
->subob
), "%qT declared here",
1372 warning (OPT_Wabi_tag
, "%qT does not have the %E abi tag "
1373 "that %qT (used in the type of %qD) has",
1374 p
->t
, tag
, *tp
, p
->subob
);
1375 inform (location_of (p
->subob
), "%qD declared here",
1377 inform (location_of (*tp
), "%qT declared here", *tp
);
1385 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1386 complete) template arguments. */
1389 mark_type_abi_tags (tree t
, bool val
)
1391 tree attributes
= lookup_attribute ("abi_tag", TYPE_ATTRIBUTES (t
));
1394 for (tree list
= TREE_VALUE (attributes
); list
;
1395 list
= TREE_CHAIN (list
))
1397 tree tag
= TREE_VALUE (list
);
1398 tree id
= get_identifier (TREE_STRING_POINTER (tag
));
1399 IDENTIFIER_MARKED (id
) = val
;
1403 /* Also mark ABI tags from template arguments. */
1404 if (CLASSTYPE_TEMPLATE_INFO (t
))
1406 tree args
= CLASSTYPE_TI_ARGS (t
);
1407 for (int i
= 0; i
< TMPL_ARGS_DEPTH (args
); ++i
)
1409 tree level
= TMPL_ARGS_LEVEL (args
, i
+1);
1410 for (int j
= 0; j
< TREE_VEC_LENGTH (level
); ++j
)
1412 tree arg
= TREE_VEC_ELT (level
, j
);
1413 if (CLASS_TYPE_P (arg
))
1414 mark_type_abi_tags (arg
, val
);
1420 /* Check that class T has all the abi tags that subobject SUBOB has, or
1424 check_abi_tags (tree t
, tree subob
)
1426 mark_type_abi_tags (t
, true);
1428 tree subtype
= TYPE_P (subob
) ? subob
: TREE_TYPE (subob
);
1429 struct abi_tag_data data
= { t
, subob
};
1431 cp_walk_tree_without_duplicates (&subtype
, find_abi_tags_r
, &data
);
1433 mark_type_abi_tags (t
, false);
1436 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1437 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1438 properties of the bases. */
1441 check_bases (tree t
,
1442 int* cant_have_const_ctor_p
,
1443 int* no_const_asn_ref_p
)
1446 bool seen_non_virtual_nearly_empty_base_p
= 0;
1447 int seen_tm_mask
= 0;
1450 tree field
= NULL_TREE
;
1452 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1453 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
1454 if (TREE_CODE (field
) == FIELD_DECL
)
1457 for (binfo
= TYPE_BINFO (t
), i
= 0;
1458 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
1460 tree basetype
= TREE_TYPE (base_binfo
);
1462 gcc_assert (COMPLETE_TYPE_P (basetype
));
1464 if (CLASSTYPE_FINAL (basetype
))
1465 error ("cannot derive from %<final%> base %qT in derived type %qT",
1468 /* If any base class is non-literal, so is the derived class. */
1469 if (!CLASSTYPE_LITERAL_P (basetype
))
1470 CLASSTYPE_LITERAL_P (t
) = false;
1472 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1473 here because the case of virtual functions but non-virtual
1474 dtor is handled in finish_struct_1. */
1475 if (!TYPE_POLYMORPHIC_P (basetype
))
1476 warning (OPT_Weffc__
,
1477 "base class %q#T has a non-virtual destructor", basetype
);
1479 /* If the base class doesn't have copy constructors or
1480 assignment operators that take const references, then the
1481 derived class cannot have such a member automatically
1483 if (TYPE_HAS_COPY_CTOR (basetype
)
1484 && ! TYPE_HAS_CONST_COPY_CTOR (basetype
))
1485 *cant_have_const_ctor_p
= 1;
1486 if (TYPE_HAS_COPY_ASSIGN (basetype
)
1487 && !TYPE_HAS_CONST_COPY_ASSIGN (basetype
))
1488 *no_const_asn_ref_p
= 1;
1490 if (BINFO_VIRTUAL_P (base_binfo
))
1491 /* A virtual base does not effect nearly emptiness. */
1493 else if (CLASSTYPE_NEARLY_EMPTY_P (basetype
))
1495 if (seen_non_virtual_nearly_empty_base_p
)
1496 /* And if there is more than one nearly empty base, then the
1497 derived class is not nearly empty either. */
1498 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1500 /* Remember we've seen one. */
1501 seen_non_virtual_nearly_empty_base_p
= 1;
1503 else if (!is_empty_class (basetype
))
1504 /* If the base class is not empty or nearly empty, then this
1505 class cannot be nearly empty. */
1506 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
1508 /* A lot of properties from the bases also apply to the derived
1510 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (basetype
);
1511 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
1512 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (basetype
);
1513 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
1514 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (basetype
)
1515 || !TYPE_HAS_COPY_ASSIGN (basetype
));
1516 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (basetype
)
1517 || !TYPE_HAS_COPY_CTOR (basetype
));
1518 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
)
1519 |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (basetype
);
1520 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (basetype
);
1521 TYPE_POLYMORPHIC_P (t
) |= TYPE_POLYMORPHIC_P (basetype
);
1522 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
)
1523 |= CLASSTYPE_CONTAINS_EMPTY_CLASS_P (basetype
);
1524 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
1525 || TYPE_HAS_COMPLEX_DFLT (basetype
));
1526 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1527 (t
, CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
1528 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (basetype
));
1529 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1530 (t
, CLASSTYPE_REF_FIELDS_NEED_INIT (t
)
1531 | CLASSTYPE_REF_FIELDS_NEED_INIT (basetype
));
1533 /* A standard-layout class is a class that:
1535 * has no non-standard-layout base classes, */
1536 CLASSTYPE_NON_STD_LAYOUT (t
) |= CLASSTYPE_NON_STD_LAYOUT (basetype
);
1537 if (!CLASSTYPE_NON_STD_LAYOUT (t
))
1540 /* ...has no base classes of the same type as the first non-static
1542 if (field
&& DECL_CONTEXT (field
) == t
1543 && (same_type_ignoring_top_level_qualifiers_p
1544 (TREE_TYPE (field
), basetype
)))
1545 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1547 /* ...either has no non-static data members in the most-derived
1548 class and at most one base class with non-static data
1549 members, or has no base classes with non-static data
1551 for (basefield
= TYPE_FIELDS (basetype
); basefield
;
1552 basefield
= DECL_CHAIN (basefield
))
1553 if (TREE_CODE (basefield
) == FIELD_DECL
)
1556 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
1563 /* Don't bother collecting tm attributes if transactional memory
1564 support is not enabled. */
1567 tree tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (basetype
));
1569 seen_tm_mask
|= tm_attr_to_mask (tm_attr
);
1572 check_abi_tags (t
, basetype
);
1575 /* If one of the base classes had TM attributes, and the current class
1576 doesn't define its own, then the current class inherits one. */
1577 if (seen_tm_mask
&& !find_tm_attribute (TYPE_ATTRIBUTES (t
)))
1579 tree tm_attr
= tm_mask_to_attr (seen_tm_mask
& -seen_tm_mask
);
1580 TYPE_ATTRIBUTES (t
) = tree_cons (tm_attr
, NULL
, TYPE_ATTRIBUTES (t
));
1584 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1585 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1586 that have had a nearly-empty virtual primary base stolen by some
1587 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1591 determine_primary_bases (tree t
)
1594 tree primary
= NULL_TREE
;
1595 tree type_binfo
= TYPE_BINFO (t
);
1598 /* Determine the primary bases of our bases. */
1599 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1600 base_binfo
= TREE_CHAIN (base_binfo
))
1602 tree primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (base_binfo
));
1604 /* See if we're the non-virtual primary of our inheritance
1606 if (!BINFO_VIRTUAL_P (base_binfo
))
1608 tree parent
= BINFO_INHERITANCE_CHAIN (base_binfo
);
1609 tree parent_primary
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (parent
));
1612 && SAME_BINFO_TYPE_P (BINFO_TYPE (base_binfo
),
1613 BINFO_TYPE (parent_primary
)))
1614 /* We are the primary binfo. */
1615 BINFO_PRIMARY_P (base_binfo
) = 1;
1617 /* Determine if we have a virtual primary base, and mark it so.
1619 if (primary
&& BINFO_VIRTUAL_P (primary
))
1621 tree this_primary
= copied_binfo (primary
, base_binfo
);
1623 if (BINFO_PRIMARY_P (this_primary
))
1624 /* Someone already claimed this base. */
1625 BINFO_LOST_PRIMARY_P (base_binfo
) = 1;
1630 BINFO_PRIMARY_P (this_primary
) = 1;
1631 BINFO_INHERITANCE_CHAIN (this_primary
) = base_binfo
;
1633 /* A virtual binfo might have been copied from within
1634 another hierarchy. As we're about to use it as a
1635 primary base, make sure the offsets match. */
1636 delta
= size_diffop_loc (input_location
,
1638 BINFO_OFFSET (base_binfo
)),
1640 BINFO_OFFSET (this_primary
)));
1642 propagate_binfo_offsets (this_primary
, delta
);
1647 /* First look for a dynamic direct non-virtual base. */
1648 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, base_binfo
); i
++)
1650 tree basetype
= BINFO_TYPE (base_binfo
);
1652 if (TYPE_CONTAINS_VPTR_P (basetype
) && !BINFO_VIRTUAL_P (base_binfo
))
1654 primary
= base_binfo
;
1659 /* A "nearly-empty" virtual base class can be the primary base
1660 class, if no non-virtual polymorphic base can be found. Look for
1661 a nearly-empty virtual dynamic base that is not already a primary
1662 base of something in the hierarchy. If there is no such base,
1663 just pick the first nearly-empty virtual base. */
1665 for (base_binfo
= TREE_CHAIN (type_binfo
); base_binfo
;
1666 base_binfo
= TREE_CHAIN (base_binfo
))
1667 if (BINFO_VIRTUAL_P (base_binfo
)
1668 && CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (base_binfo
)))
1670 if (!BINFO_PRIMARY_P (base_binfo
))
1672 /* Found one that is not primary. */
1673 primary
= base_binfo
;
1677 /* Remember the first candidate. */
1678 primary
= base_binfo
;
1682 /* If we've got a primary base, use it. */
1685 tree basetype
= BINFO_TYPE (primary
);
1687 CLASSTYPE_PRIMARY_BINFO (t
) = primary
;
1688 if (BINFO_PRIMARY_P (primary
))
1689 /* We are stealing a primary base. */
1690 BINFO_LOST_PRIMARY_P (BINFO_INHERITANCE_CHAIN (primary
)) = 1;
1691 BINFO_PRIMARY_P (primary
) = 1;
1692 if (BINFO_VIRTUAL_P (primary
))
1696 BINFO_INHERITANCE_CHAIN (primary
) = type_binfo
;
1697 /* A virtual binfo might have been copied from within
1698 another hierarchy. As we're about to use it as a primary
1699 base, make sure the offsets match. */
1700 delta
= size_diffop_loc (input_location
, ssize_int (0),
1701 convert (ssizetype
, BINFO_OFFSET (primary
)));
1703 propagate_binfo_offsets (primary
, delta
);
1706 primary
= TYPE_BINFO (basetype
);
1708 TYPE_VFIELD (t
) = TYPE_VFIELD (basetype
);
1709 BINFO_VTABLE (type_binfo
) = BINFO_VTABLE (primary
);
1710 BINFO_VIRTUALS (type_binfo
) = BINFO_VIRTUALS (primary
);
1714 /* Update the variant types of T. */
1717 fixup_type_variants (tree t
)
1724 for (variants
= TYPE_NEXT_VARIANT (t
);
1726 variants
= TYPE_NEXT_VARIANT (variants
))
1728 /* These fields are in the _TYPE part of the node, not in
1729 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1730 TYPE_HAS_USER_CONSTRUCTOR (variants
) = TYPE_HAS_USER_CONSTRUCTOR (t
);
1731 TYPE_NEEDS_CONSTRUCTING (variants
) = TYPE_NEEDS_CONSTRUCTING (t
);
1732 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (variants
)
1733 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
1735 TYPE_POLYMORPHIC_P (variants
) = TYPE_POLYMORPHIC_P (t
);
1737 TYPE_BINFO (variants
) = TYPE_BINFO (t
);
1739 /* Copy whatever these are holding today. */
1740 TYPE_VFIELD (variants
) = TYPE_VFIELD (t
);
1741 TYPE_METHODS (variants
) = TYPE_METHODS (t
);
1742 TYPE_FIELDS (variants
) = TYPE_FIELDS (t
);
1746 /* Early variant fixups: we apply attributes at the beginning of the class
1747 definition, and we need to fix up any variants that have already been
1748 made via elaborated-type-specifier so that check_qualified_type works. */
1751 fixup_attribute_variants (tree t
)
1758 for (variants
= TYPE_NEXT_VARIANT (t
);
1760 variants
= TYPE_NEXT_VARIANT (variants
))
1762 /* These are the two fields that check_qualified_type looks at and
1763 are affected by attributes. */
1764 TYPE_ATTRIBUTES (variants
) = TYPE_ATTRIBUTES (t
);
1765 TYPE_ALIGN (variants
) = TYPE_ALIGN (t
);
1769 /* Set memoizing fields and bits of T (and its variants) for later
1773 finish_struct_bits (tree t
)
1775 /* Fix up variants (if any). */
1776 fixup_type_variants (t
);
1778 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) && TYPE_POLYMORPHIC_P (t
))
1779 /* For a class w/o baseclasses, 'finish_struct' has set
1780 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1781 Similarly for a class whose base classes do not have vtables.
1782 When neither of these is true, we might have removed abstract
1783 virtuals (by providing a definition), added some (by declaring
1784 new ones), or redeclared ones from a base class. We need to
1785 recalculate what's really an abstract virtual at this point (by
1786 looking in the vtables). */
1787 get_pure_virtuals (t
);
1789 /* If this type has a copy constructor or a destructor, force its
1790 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1791 nonzero. This will cause it to be passed by invisible reference
1792 and prevent it from being returned in a register. */
1793 if (type_has_nontrivial_copy_init (t
)
1794 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
1797 DECL_MODE (TYPE_MAIN_DECL (t
)) = BLKmode
;
1798 for (variants
= t
; variants
; variants
= TYPE_NEXT_VARIANT (variants
))
1800 SET_TYPE_MODE (variants
, BLKmode
);
1801 TREE_ADDRESSABLE (variants
) = 1;
1806 /* Issue warnings about T having private constructors, but no friends,
1809 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1810 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1811 non-private static member functions. */
1814 maybe_warn_about_overly_private_class (tree t
)
1816 int has_member_fn
= 0;
1817 int has_nonprivate_method
= 0;
1820 if (!warn_ctor_dtor_privacy
1821 /* If the class has friends, those entities might create and
1822 access instances, so we should not warn. */
1823 || (CLASSTYPE_FRIEND_CLASSES (t
)
1824 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))
1825 /* We will have warned when the template was declared; there's
1826 no need to warn on every instantiation. */
1827 || CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
1828 /* There's no reason to even consider warning about this
1832 /* We only issue one warning, if more than one applies, because
1833 otherwise, on code like:
1836 // Oops - forgot `public:'
1842 we warn several times about essentially the same problem. */
1844 /* Check to see if all (non-constructor, non-destructor) member
1845 functions are private. (Since there are no friends or
1846 non-private statics, we can't ever call any of the private member
1848 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
1849 /* We're not interested in compiler-generated methods; they don't
1850 provide any way to call private members. */
1851 if (!DECL_ARTIFICIAL (fn
))
1853 if (!TREE_PRIVATE (fn
))
1855 if (DECL_STATIC_FUNCTION_P (fn
))
1856 /* A non-private static member function is just like a
1857 friend; it can create and invoke private member
1858 functions, and be accessed without a class
1862 has_nonprivate_method
= 1;
1863 /* Keep searching for a static member function. */
1865 else if (!DECL_CONSTRUCTOR_P (fn
) && !DECL_DESTRUCTOR_P (fn
))
1869 if (!has_nonprivate_method
&& has_member_fn
)
1871 /* There are no non-private methods, and there's at least one
1872 private member function that isn't a constructor or
1873 destructor. (If all the private members are
1874 constructors/destructors we want to use the code below that
1875 issues error messages specifically referring to
1876 constructors/destructors.) */
1878 tree binfo
= TYPE_BINFO (t
);
1880 for (i
= 0; i
!= BINFO_N_BASE_BINFOS (binfo
); i
++)
1881 if (BINFO_BASE_ACCESS (binfo
, i
) != access_private_node
)
1883 has_nonprivate_method
= 1;
1886 if (!has_nonprivate_method
)
1888 warning (OPT_Wctor_dtor_privacy
,
1889 "all member functions in class %qT are private", t
);
1894 /* Even if some of the member functions are non-private, the class
1895 won't be useful for much if all the constructors or destructors
1896 are private: such an object can never be created or destroyed. */
1897 fn
= CLASSTYPE_DESTRUCTORS (t
);
1898 if (fn
&& TREE_PRIVATE (fn
))
1900 warning (OPT_Wctor_dtor_privacy
,
1901 "%q#T only defines a private destructor and has no friends",
1906 /* Warn about classes that have private constructors and no friends. */
1907 if (TYPE_HAS_USER_CONSTRUCTOR (t
)
1908 /* Implicitly generated constructors are always public. */
1909 && (!CLASSTYPE_LAZY_DEFAULT_CTOR (t
)
1910 || !CLASSTYPE_LAZY_COPY_CTOR (t
)))
1912 int nonprivate_ctor
= 0;
1914 /* If a non-template class does not define a copy
1915 constructor, one is defined for it, enabling it to avoid
1916 this warning. For a template class, this does not
1917 happen, and so we would normally get a warning on:
1919 template <class T> class C { private: C(); };
1921 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1922 complete non-template or fully instantiated classes have this
1924 if (!TYPE_HAS_COPY_CTOR (t
))
1925 nonprivate_ctor
= 1;
1927 for (fn
= CLASSTYPE_CONSTRUCTORS (t
); fn
; fn
= OVL_NEXT (fn
))
1929 tree ctor
= OVL_CURRENT (fn
);
1930 /* Ideally, we wouldn't count copy constructors (or, in
1931 fact, any constructor that takes an argument of the
1932 class type as a parameter) because such things cannot
1933 be used to construct an instance of the class unless
1934 you already have one. But, for now at least, we're
1936 if (! TREE_PRIVATE (ctor
))
1938 nonprivate_ctor
= 1;
1943 if (nonprivate_ctor
== 0)
1945 warning (OPT_Wctor_dtor_privacy
,
1946 "%q#T only defines private constructors and has no friends",
1954 gt_pointer_operator new_value
;
1958 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1961 method_name_cmp (const void* m1_p
, const void* m2_p
)
1963 const tree
*const m1
= (const tree
*) m1_p
;
1964 const tree
*const m2
= (const tree
*) m2_p
;
1966 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1968 if (*m1
== NULL_TREE
)
1970 if (*m2
== NULL_TREE
)
1972 if (DECL_NAME (OVL_CURRENT (*m1
)) < DECL_NAME (OVL_CURRENT (*m2
)))
1977 /* This routine compares two fields like method_name_cmp but using the
1978 pointer operator in resort_field_decl_data. */
1981 resort_method_name_cmp (const void* m1_p
, const void* m2_p
)
1983 const tree
*const m1
= (const tree
*) m1_p
;
1984 const tree
*const m2
= (const tree
*) m2_p
;
1985 if (*m1
== NULL_TREE
&& *m2
== NULL_TREE
)
1987 if (*m1
== NULL_TREE
)
1989 if (*m2
== NULL_TREE
)
1992 tree d1
= DECL_NAME (OVL_CURRENT (*m1
));
1993 tree d2
= DECL_NAME (OVL_CURRENT (*m2
));
1994 resort_data
.new_value (&d1
, resort_data
.cookie
);
1995 resort_data
.new_value (&d2
, resort_data
.cookie
);
2002 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2005 resort_type_method_vec (void* obj
,
2007 gt_pointer_operator new_value
,
2010 vec
<tree
, va_gc
> *method_vec
= (vec
<tree
, va_gc
> *) obj
;
2011 int len
= vec_safe_length (method_vec
);
2015 /* The type conversion ops have to live at the front of the vec, so we
2017 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2018 vec_safe_iterate (method_vec
, slot
, &fn
);
2020 if (!DECL_CONV_FN_P (OVL_CURRENT (fn
)))
2025 resort_data
.new_value
= new_value
;
2026 resort_data
.cookie
= cookie
;
2027 qsort (method_vec
->address () + slot
, len
- slot
, sizeof (tree
),
2028 resort_method_name_cmp
);
2032 /* Warn about duplicate methods in fn_fields.
2034 Sort methods that are not special (i.e., constructors, destructors,
2035 and type conversion operators) so that we can find them faster in
2039 finish_struct_methods (tree t
)
2042 vec
<tree
, va_gc
> *method_vec
;
2045 method_vec
= CLASSTYPE_METHOD_VEC (t
);
2049 len
= method_vec
->length ();
2051 /* Clear DECL_IN_AGGR_P for all functions. */
2052 for (fn_fields
= TYPE_METHODS (t
); fn_fields
;
2053 fn_fields
= DECL_CHAIN (fn_fields
))
2054 DECL_IN_AGGR_P (fn_fields
) = 0;
2056 /* Issue warnings about private constructors and such. If there are
2057 no methods, then some public defaults are generated. */
2058 maybe_warn_about_overly_private_class (t
);
2060 /* The type conversion ops have to live at the front of the vec, so we
2062 for (slot
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2063 method_vec
->iterate (slot
, &fn_fields
);
2065 if (!DECL_CONV_FN_P (OVL_CURRENT (fn_fields
)))
2068 qsort (method_vec
->address () + slot
,
2069 len
-slot
, sizeof (tree
), method_name_cmp
);
2072 /* Make BINFO's vtable have N entries, including RTTI entries,
2073 vbase and vcall offsets, etc. Set its type and call the back end
2077 layout_vtable_decl (tree binfo
, int n
)
2082 atype
= build_array_of_n_type (vtable_entry_type
, n
);
2083 layout_type (atype
);
2085 /* We may have to grow the vtable. */
2086 vtable
= get_vtbl_decl_for_binfo (binfo
);
2087 if (!same_type_p (TREE_TYPE (vtable
), atype
))
2089 TREE_TYPE (vtable
) = atype
;
2090 DECL_SIZE (vtable
) = DECL_SIZE_UNIT (vtable
) = NULL_TREE
;
2091 layout_decl (vtable
, 0);
2095 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2096 have the same signature. */
2099 same_signature_p (const_tree fndecl
, const_tree base_fndecl
)
2101 /* One destructor overrides another if they are the same kind of
2103 if (DECL_DESTRUCTOR_P (base_fndecl
) && DECL_DESTRUCTOR_P (fndecl
)
2104 && special_function_p (base_fndecl
) == special_function_p (fndecl
))
2106 /* But a non-destructor never overrides a destructor, nor vice
2107 versa, nor do different kinds of destructors override
2108 one-another. For example, a complete object destructor does not
2109 override a deleting destructor. */
2110 if (DECL_DESTRUCTOR_P (base_fndecl
) || DECL_DESTRUCTOR_P (fndecl
))
2113 if (DECL_NAME (fndecl
) == DECL_NAME (base_fndecl
)
2114 || (DECL_CONV_FN_P (fndecl
)
2115 && DECL_CONV_FN_P (base_fndecl
)
2116 && same_type_p (DECL_CONV_FN_TYPE (fndecl
),
2117 DECL_CONV_FN_TYPE (base_fndecl
))))
2119 tree fntype
= TREE_TYPE (fndecl
);
2120 tree base_fntype
= TREE_TYPE (base_fndecl
);
2121 if (type_memfn_quals (fntype
) == type_memfn_quals (base_fntype
)
2122 && type_memfn_rqual (fntype
) == type_memfn_rqual (base_fntype
)
2123 && compparms (FUNCTION_FIRST_USER_PARMTYPE (fndecl
),
2124 FUNCTION_FIRST_USER_PARMTYPE (base_fndecl
)))
2130 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2134 base_derived_from (tree derived
, tree base
)
2138 for (probe
= base
; probe
; probe
= BINFO_INHERITANCE_CHAIN (probe
))
2140 if (probe
== derived
)
2142 else if (BINFO_VIRTUAL_P (probe
))
2143 /* If we meet a virtual base, we can't follow the inheritance
2144 any more. See if the complete type of DERIVED contains
2145 such a virtual base. */
2146 return (binfo_for_vbase (BINFO_TYPE (probe
), BINFO_TYPE (derived
))
2152 typedef struct find_final_overrider_data_s
{
2153 /* The function for which we are trying to find a final overrider. */
2155 /* The base class in which the function was declared. */
2156 tree declaring_base
;
2157 /* The candidate overriders. */
2159 /* Path to most derived. */
2161 } find_final_overrider_data
;
2163 /* Add the overrider along the current path to FFOD->CANDIDATES.
2164 Returns true if an overrider was found; false otherwise. */
2167 dfs_find_final_overrider_1 (tree binfo
,
2168 find_final_overrider_data
*ffod
,
2173 /* If BINFO is not the most derived type, try a more derived class.
2174 A definition there will overrider a definition here. */
2178 if (dfs_find_final_overrider_1
2179 (ffod
->path
[depth
], ffod
, depth
))
2183 method
= look_for_overrides_here (BINFO_TYPE (binfo
), ffod
->fn
);
2186 tree
*candidate
= &ffod
->candidates
;
2188 /* Remove any candidates overridden by this new function. */
2191 /* If *CANDIDATE overrides METHOD, then METHOD
2192 cannot override anything else on the list. */
2193 if (base_derived_from (TREE_VALUE (*candidate
), binfo
))
2195 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2196 if (base_derived_from (binfo
, TREE_VALUE (*candidate
)))
2197 *candidate
= TREE_CHAIN (*candidate
);
2199 candidate
= &TREE_CHAIN (*candidate
);
2202 /* Add the new function. */
2203 ffod
->candidates
= tree_cons (method
, binfo
, ffod
->candidates
);
2210 /* Called from find_final_overrider via dfs_walk. */
2213 dfs_find_final_overrider_pre (tree binfo
, void *data
)
2215 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2217 if (binfo
== ffod
->declaring_base
)
2218 dfs_find_final_overrider_1 (binfo
, ffod
, ffod
->path
.length ());
2219 ffod
->path
.safe_push (binfo
);
2225 dfs_find_final_overrider_post (tree
/*binfo*/, void *data
)
2227 find_final_overrider_data
*ffod
= (find_final_overrider_data
*) data
;
2233 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2234 FN and whose TREE_VALUE is the binfo for the base where the
2235 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2236 DERIVED) is the base object in which FN is declared. */
2239 find_final_overrider (tree derived
, tree binfo
, tree fn
)
2241 find_final_overrider_data ffod
;
2243 /* Getting this right is a little tricky. This is valid:
2245 struct S { virtual void f (); };
2246 struct T { virtual void f (); };
2247 struct U : public S, public T { };
2249 even though calling `f' in `U' is ambiguous. But,
2251 struct R { virtual void f(); };
2252 struct S : virtual public R { virtual void f (); };
2253 struct T : virtual public R { virtual void f (); };
2254 struct U : public S, public T { };
2256 is not -- there's no way to decide whether to put `S::f' or
2257 `T::f' in the vtable for `R'.
2259 The solution is to look at all paths to BINFO. If we find
2260 different overriders along any two, then there is a problem. */
2261 if (DECL_THUNK_P (fn
))
2262 fn
= THUNK_TARGET (fn
);
2264 /* Determine the depth of the hierarchy. */
2266 ffod
.declaring_base
= binfo
;
2267 ffod
.candidates
= NULL_TREE
;
2268 ffod
.path
.create (30);
2270 dfs_walk_all (derived
, dfs_find_final_overrider_pre
,
2271 dfs_find_final_overrider_post
, &ffod
);
2273 ffod
.path
.release ();
2275 /* If there was no winner, issue an error message. */
2276 if (!ffod
.candidates
|| TREE_CHAIN (ffod
.candidates
))
2277 return error_mark_node
;
2279 return ffod
.candidates
;
2282 /* Return the index of the vcall offset for FN when TYPE is used as a
2286 get_vcall_index (tree fn
, tree type
)
2288 vec
<tree_pair_s
, va_gc
> *indices
= CLASSTYPE_VCALL_INDICES (type
);
2292 FOR_EACH_VEC_SAFE_ELT (indices
, ix
, p
)
2293 if ((DECL_DESTRUCTOR_P (fn
) && DECL_DESTRUCTOR_P (p
->purpose
))
2294 || same_signature_p (fn
, p
->purpose
))
2297 /* There should always be an appropriate index. */
2301 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2302 dominated by T. FN is the old function; VIRTUALS points to the
2303 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2304 of that entry in the list. */
2307 update_vtable_entry_for_fn (tree t
, tree binfo
, tree fn
, tree
* virtuals
,
2315 tree overrider_fn
, overrider_target
;
2316 tree target_fn
= DECL_THUNK_P (fn
) ? THUNK_TARGET (fn
) : fn
;
2317 tree over_return
, base_return
;
2320 /* Find the nearest primary base (possibly binfo itself) which defines
2321 this function; this is the class the caller will convert to when
2322 calling FN through BINFO. */
2323 for (b
= binfo
; ; b
= get_primary_binfo (b
))
2326 if (look_for_overrides_here (BINFO_TYPE (b
), target_fn
))
2329 /* The nearest definition is from a lost primary. */
2330 if (BINFO_LOST_PRIMARY_P (b
))
2335 /* Find the final overrider. */
2336 overrider
= find_final_overrider (TYPE_BINFO (t
), b
, target_fn
);
2337 if (overrider
== error_mark_node
)
2339 error ("no unique final overrider for %qD in %qT", target_fn
, t
);
2342 overrider_target
= overrider_fn
= TREE_PURPOSE (overrider
);
2344 /* Check for adjusting covariant return types. */
2345 over_return
= TREE_TYPE (TREE_TYPE (overrider_target
));
2346 base_return
= TREE_TYPE (TREE_TYPE (target_fn
));
2348 if (POINTER_TYPE_P (over_return
)
2349 && TREE_CODE (over_return
) == TREE_CODE (base_return
)
2350 && CLASS_TYPE_P (TREE_TYPE (over_return
))
2351 && CLASS_TYPE_P (TREE_TYPE (base_return
))
2352 /* If the overrider is invalid, don't even try. */
2353 && !DECL_INVALID_OVERRIDER_P (overrider_target
))
2355 /* If FN is a covariant thunk, we must figure out the adjustment
2356 to the final base FN was converting to. As OVERRIDER_TARGET might
2357 also be converting to the return type of FN, we have to
2358 combine the two conversions here. */
2359 tree fixed_offset
, virtual_offset
;
2361 over_return
= TREE_TYPE (over_return
);
2362 base_return
= TREE_TYPE (base_return
);
2364 if (DECL_THUNK_P (fn
))
2366 gcc_assert (DECL_RESULT_THUNK_P (fn
));
2367 fixed_offset
= ssize_int (THUNK_FIXED_OFFSET (fn
));
2368 virtual_offset
= THUNK_VIRTUAL_OFFSET (fn
);
2371 fixed_offset
= virtual_offset
= NULL_TREE
;
2374 /* Find the equivalent binfo within the return type of the
2375 overriding function. We will want the vbase offset from
2377 virtual_offset
= binfo_for_vbase (BINFO_TYPE (virtual_offset
),
2379 else if (!same_type_ignoring_top_level_qualifiers_p
2380 (over_return
, base_return
))
2382 /* There was no existing virtual thunk (which takes
2383 precedence). So find the binfo of the base function's
2384 return type within the overriding function's return type.
2385 We cannot call lookup base here, because we're inside a
2386 dfs_walk, and will therefore clobber the BINFO_MARKED
2387 flags. Fortunately we know the covariancy is valid (it
2388 has already been checked), so we can just iterate along
2389 the binfos, which have been chained in inheritance graph
2390 order. Of course it is lame that we have to repeat the
2391 search here anyway -- we should really be caching pieces
2392 of the vtable and avoiding this repeated work. */
2393 tree thunk_binfo
, base_binfo
;
2395 /* Find the base binfo within the overriding function's
2396 return type. We will always find a thunk_binfo, except
2397 when the covariancy is invalid (which we will have
2398 already diagnosed). */
2399 for (base_binfo
= TYPE_BINFO (base_return
),
2400 thunk_binfo
= TYPE_BINFO (over_return
);
2402 thunk_binfo
= TREE_CHAIN (thunk_binfo
))
2403 if (SAME_BINFO_TYPE_P (BINFO_TYPE (thunk_binfo
),
2404 BINFO_TYPE (base_binfo
)))
2407 /* See if virtual inheritance is involved. */
2408 for (virtual_offset
= thunk_binfo
;
2410 virtual_offset
= BINFO_INHERITANCE_CHAIN (virtual_offset
))
2411 if (BINFO_VIRTUAL_P (virtual_offset
))
2415 || (thunk_binfo
&& !BINFO_OFFSET_ZEROP (thunk_binfo
)))
2417 tree offset
= convert (ssizetype
, BINFO_OFFSET (thunk_binfo
));
2421 /* We convert via virtual base. Adjust the fixed
2422 offset to be from there. */
2424 size_diffop (offset
,
2426 BINFO_OFFSET (virtual_offset
)));
2429 /* There was an existing fixed offset, this must be
2430 from the base just converted to, and the base the
2431 FN was thunking to. */
2432 fixed_offset
= size_binop (PLUS_EXPR
, fixed_offset
, offset
);
2434 fixed_offset
= offset
;
2438 if (fixed_offset
|| virtual_offset
)
2439 /* Replace the overriding function with a covariant thunk. We
2440 will emit the overriding function in its own slot as
2442 overrider_fn
= make_thunk (overrider_target
, /*this_adjusting=*/0,
2443 fixed_offset
, virtual_offset
);
2446 gcc_assert (DECL_INVALID_OVERRIDER_P (overrider_target
) ||
2447 !DECL_THUNK_P (fn
));
2449 /* If we need a covariant thunk, then we may need to adjust first_defn.
2450 The ABI specifies that the thunks emitted with a function are
2451 determined by which bases the function overrides, so we need to be
2452 sure that we're using a thunk for some overridden base; even if we
2453 know that the necessary this adjustment is zero, there may not be an
2454 appropriate zero-this-adjusment thunk for us to use since thunks for
2455 overriding virtual bases always use the vcall offset.
2457 Furthermore, just choosing any base that overrides this function isn't
2458 quite right, as this slot won't be used for calls through a type that
2459 puts a covariant thunk here. Calling the function through such a type
2460 will use a different slot, and that slot is the one that determines
2461 the thunk emitted for that base.
2463 So, keep looking until we find the base that we're really overriding
2464 in this slot: the nearest primary base that doesn't use a covariant
2465 thunk in this slot. */
2466 if (overrider_target
!= overrider_fn
)
2468 if (BINFO_TYPE (b
) == DECL_CONTEXT (overrider_target
))
2469 /* We already know that the overrider needs a covariant thunk. */
2470 b
= get_primary_binfo (b
);
2471 for (; ; b
= get_primary_binfo (b
))
2473 tree main_binfo
= TYPE_BINFO (BINFO_TYPE (b
));
2474 tree bv
= chain_index (ix
, BINFO_VIRTUALS (main_binfo
));
2475 if (!DECL_THUNK_P (TREE_VALUE (bv
)))
2477 if (BINFO_LOST_PRIMARY_P (b
))
2483 /* Assume that we will produce a thunk that convert all the way to
2484 the final overrider, and not to an intermediate virtual base. */
2485 virtual_base
= NULL_TREE
;
2487 /* See if we can convert to an intermediate virtual base first, and then
2488 use the vcall offset located there to finish the conversion. */
2489 for (; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
2491 /* If we find the final overrider, then we can stop
2493 if (SAME_BINFO_TYPE_P (BINFO_TYPE (b
),
2494 BINFO_TYPE (TREE_VALUE (overrider
))))
2497 /* If we find a virtual base, and we haven't yet found the
2498 overrider, then there is a virtual base between the
2499 declaring base (first_defn) and the final overrider. */
2500 if (BINFO_VIRTUAL_P (b
))
2507 /* Compute the constant adjustment to the `this' pointer. The
2508 `this' pointer, when this function is called, will point at BINFO
2509 (or one of its primary bases, which are at the same offset). */
2511 /* The `this' pointer needs to be adjusted from the declaration to
2512 the nearest virtual base. */
2513 delta
= size_diffop_loc (input_location
,
2514 convert (ssizetype
, BINFO_OFFSET (virtual_base
)),
2515 convert (ssizetype
, BINFO_OFFSET (first_defn
)));
2517 /* If the nearest definition is in a lost primary, we don't need an
2518 entry in our vtable. Except possibly in a constructor vtable,
2519 if we happen to get our primary back. In that case, the offset
2520 will be zero, as it will be a primary base. */
2521 delta
= size_zero_node
;
2523 /* The `this' pointer needs to be adjusted from pointing to
2524 BINFO to pointing at the base where the final overrider
2526 delta
= size_diffop_loc (input_location
,
2528 BINFO_OFFSET (TREE_VALUE (overrider
))),
2529 convert (ssizetype
, BINFO_OFFSET (binfo
)));
2531 modify_vtable_entry (t
, binfo
, overrider_fn
, delta
, virtuals
);
2534 BV_VCALL_INDEX (*virtuals
)
2535 = get_vcall_index (overrider_target
, BINFO_TYPE (virtual_base
));
2537 BV_VCALL_INDEX (*virtuals
) = NULL_TREE
;
2539 BV_LOST_PRIMARY (*virtuals
) = lost
;
2542 /* Called from modify_all_vtables via dfs_walk. */
2545 dfs_modify_vtables (tree binfo
, void* data
)
2547 tree t
= (tree
) data
;
2552 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2553 /* A base without a vtable needs no modification, and its bases
2554 are uninteresting. */
2555 return dfs_skip_bases
;
2557 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
)
2558 && !CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
2559 /* Don't do the primary vtable, if it's new. */
2562 if (BINFO_PRIMARY_P (binfo
) && !BINFO_VIRTUAL_P (binfo
))
2563 /* There's no need to modify the vtable for a non-virtual primary
2564 base; we're not going to use that vtable anyhow. We do still
2565 need to do this for virtual primary bases, as they could become
2566 non-primary in a construction vtable. */
2569 make_new_vtable (t
, binfo
);
2571 /* Now, go through each of the virtual functions in the virtual
2572 function table for BINFO. Find the final overrider, and update
2573 the BINFO_VIRTUALS list appropriately. */
2574 for (ix
= 0, virtuals
= BINFO_VIRTUALS (binfo
),
2575 old_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
2577 ix
++, virtuals
= TREE_CHAIN (virtuals
),
2578 old_virtuals
= TREE_CHAIN (old_virtuals
))
2579 update_vtable_entry_for_fn (t
,
2581 BV_FN (old_virtuals
),
2587 /* Update all of the primary and secondary vtables for T. Create new
2588 vtables as required, and initialize their RTTI information. Each
2589 of the functions in VIRTUALS is declared in T and may override a
2590 virtual function from a base class; find and modify the appropriate
2591 entries to point to the overriding functions. Returns a list, in
2592 declaration order, of the virtual functions that are declared in T,
2593 but do not appear in the primary base class vtable, and which
2594 should therefore be appended to the end of the vtable for T. */
2597 modify_all_vtables (tree t
, tree virtuals
)
2599 tree binfo
= TYPE_BINFO (t
);
2602 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2603 if (TYPE_CONTAINS_VPTR_P (t
))
2604 get_vtable_decl (t
, false);
2606 /* Update all of the vtables. */
2607 dfs_walk_once (binfo
, dfs_modify_vtables
, NULL
, t
);
2609 /* Add virtual functions not already in our primary vtable. These
2610 will be both those introduced by this class, and those overridden
2611 from secondary bases. It does not include virtuals merely
2612 inherited from secondary bases. */
2613 for (fnsp
= &virtuals
; *fnsp
; )
2615 tree fn
= TREE_VALUE (*fnsp
);
2617 if (!value_member (fn
, BINFO_VIRTUALS (binfo
))
2618 || DECL_VINDEX (fn
) == error_mark_node
)
2620 /* We don't need to adjust the `this' pointer when
2621 calling this function. */
2622 BV_DELTA (*fnsp
) = integer_zero_node
;
2623 BV_VCALL_INDEX (*fnsp
) = NULL_TREE
;
2625 /* This is a function not already in our vtable. Keep it. */
2626 fnsp
= &TREE_CHAIN (*fnsp
);
2629 /* We've already got an entry for this function. Skip it. */
2630 *fnsp
= TREE_CHAIN (*fnsp
);
2636 /* Get the base virtual function declarations in T that have the
2640 get_basefndecls (tree name
, tree t
)
2643 tree base_fndecls
= NULL_TREE
;
2644 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
2647 /* Find virtual functions in T with the indicated NAME. */
2648 i
= lookup_fnfields_1 (t
, name
);
2650 for (methods
= (*CLASSTYPE_METHOD_VEC (t
))[i
];
2652 methods
= OVL_NEXT (methods
))
2654 tree method
= OVL_CURRENT (methods
);
2656 if (TREE_CODE (method
) == FUNCTION_DECL
2657 && DECL_VINDEX (method
))
2658 base_fndecls
= tree_cons (NULL_TREE
, method
, base_fndecls
);
2662 return base_fndecls
;
2664 for (i
= 0; i
< n_baseclasses
; i
++)
2666 tree basetype
= BINFO_TYPE (BINFO_BASE_BINFO (TYPE_BINFO (t
), i
));
2667 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2671 return base_fndecls
;
2674 /* If this declaration supersedes the declaration of
2675 a method declared virtual in the base class, then
2676 mark this field as being virtual as well. */
2679 check_for_override (tree decl
, tree ctype
)
2681 bool overrides_found
= false;
2682 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2683 /* In [temp.mem] we have:
2685 A specialization of a member function template does not
2686 override a virtual function from a base class. */
2688 if ((DECL_DESTRUCTOR_P (decl
)
2689 || IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
))
2690 || DECL_CONV_FN_P (decl
))
2691 && look_for_overrides (ctype
, decl
)
2692 && !DECL_STATIC_FUNCTION_P (decl
))
2693 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2694 the error_mark_node so that we know it is an overriding
2697 DECL_VINDEX (decl
) = decl
;
2698 overrides_found
= true;
2701 if (DECL_VIRTUAL_P (decl
))
2703 if (!DECL_VINDEX (decl
))
2704 DECL_VINDEX (decl
) = error_mark_node
;
2705 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
2706 if (DECL_DESTRUCTOR_P (decl
))
2707 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (ctype
) = true;
2709 else if (DECL_FINAL_P (decl
))
2710 error ("%q+#D marked final, but is not virtual", decl
);
2711 if (DECL_OVERRIDE_P (decl
) && !overrides_found
)
2712 error ("%q+#D marked override, but does not override", decl
);
2715 /* Warn about hidden virtual functions that are not overridden in t.
2716 We know that constructors and destructors don't apply. */
2719 warn_hidden (tree t
)
2721 vec
<tree
, va_gc
> *method_vec
= CLASSTYPE_METHOD_VEC (t
);
2725 /* We go through each separately named virtual function. */
2726 for (i
= CLASSTYPE_FIRST_CONVERSION_SLOT
;
2727 vec_safe_iterate (method_vec
, i
, &fns
);
2738 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2739 have the same name. Figure out what name that is. */
2740 name
= DECL_NAME (OVL_CURRENT (fns
));
2741 /* There are no possibly hidden functions yet. */
2742 base_fndecls
= NULL_TREE
;
2743 /* Iterate through all of the base classes looking for possibly
2744 hidden functions. */
2745 for (binfo
= TYPE_BINFO (t
), j
= 0;
2746 BINFO_BASE_ITERATE (binfo
, j
, base_binfo
); j
++)
2748 tree basetype
= BINFO_TYPE (base_binfo
);
2749 base_fndecls
= chainon (get_basefndecls (name
, basetype
),
2753 /* If there are no functions to hide, continue. */
2757 /* Remove any overridden functions. */
2758 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
2760 fndecl
= OVL_CURRENT (fn
);
2761 if (DECL_VINDEX (fndecl
))
2763 tree
*prev
= &base_fndecls
;
2766 /* If the method from the base class has the same
2767 signature as the method from the derived class, it
2768 has been overridden. */
2769 if (same_signature_p (fndecl
, TREE_VALUE (*prev
)))
2770 *prev
= TREE_CHAIN (*prev
);
2772 prev
= &TREE_CHAIN (*prev
);
2776 /* Now give a warning for all base functions without overriders,
2777 as they are hidden. */
2778 while (base_fndecls
)
2780 /* Here we know it is a hider, and no overrider exists. */
2781 warning (OPT_Woverloaded_virtual
, "%q+D was hidden", TREE_VALUE (base_fndecls
));
2782 warning (OPT_Woverloaded_virtual
, " by %q+D", fns
);
2783 base_fndecls
= TREE_CHAIN (base_fndecls
);
2788 /* Recursive helper for finish_struct_anon. */
2791 finish_struct_anon_r (tree field
, bool complain
)
2793 bool is_union
= TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
;
2794 tree elt
= TYPE_FIELDS (TREE_TYPE (field
));
2795 for (; elt
; elt
= DECL_CHAIN (elt
))
2797 /* We're generally only interested in entities the user
2798 declared, but we also find nested classes by noticing
2799 the TYPE_DECL that we create implicitly. You're
2800 allowed to put one anonymous union inside another,
2801 though, so we explicitly tolerate that. We use
2802 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2803 we also allow unnamed types used for defining fields. */
2804 if (DECL_ARTIFICIAL (elt
)
2805 && (!DECL_IMPLICIT_TYPEDEF_P (elt
)
2806 || TYPE_ANONYMOUS_P (TREE_TYPE (elt
))))
2809 if (TREE_CODE (elt
) != FIELD_DECL
)
2814 permerror (input_location
,
2815 "%q+#D invalid; an anonymous union can "
2816 "only have non-static data members", elt
);
2818 permerror (input_location
,
2819 "%q+#D invalid; an anonymous struct can "
2820 "only have non-static data members", elt
);
2827 if (TREE_PRIVATE (elt
))
2830 permerror (input_location
,
2831 "private member %q+#D in anonymous union", elt
);
2833 permerror (input_location
,
2834 "private member %q+#D in anonymous struct", elt
);
2836 else if (TREE_PROTECTED (elt
))
2839 permerror (input_location
,
2840 "protected member %q+#D in anonymous union", elt
);
2842 permerror (input_location
,
2843 "protected member %q+#D in anonymous struct", elt
);
2847 TREE_PRIVATE (elt
) = TREE_PRIVATE (field
);
2848 TREE_PROTECTED (elt
) = TREE_PROTECTED (field
);
2850 /* Recurse into the anonymous aggregates to handle correctly
2851 access control (c++/24926):
2862 if (DECL_NAME (elt
) == NULL_TREE
2863 && ANON_AGGR_TYPE_P (TREE_TYPE (elt
)))
2864 finish_struct_anon_r (elt
, /*complain=*/false);
2868 /* Check for things that are invalid. There are probably plenty of other
2869 things we should check for also. */
2872 finish_struct_anon (tree t
)
2874 for (tree field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2876 if (TREE_STATIC (field
))
2878 if (TREE_CODE (field
) != FIELD_DECL
)
2881 if (DECL_NAME (field
) == NULL_TREE
2882 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2883 finish_struct_anon_r (field
, /*complain=*/true);
2887 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2888 will be used later during class template instantiation.
2889 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2890 a non-static member data (FIELD_DECL), a member function
2891 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2892 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2893 When FRIEND_P is nonzero, T is either a friend class
2894 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2895 (FUNCTION_DECL, TEMPLATE_DECL). */
2898 maybe_add_class_template_decl_list (tree type
, tree t
, int friend_p
)
2900 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2901 if (CLASSTYPE_TEMPLATE_INFO (type
))
2902 CLASSTYPE_DECL_LIST (type
)
2903 = tree_cons (friend_p
? NULL_TREE
: type
,
2904 t
, CLASSTYPE_DECL_LIST (type
));
2907 /* This function is called from declare_virt_assop_and_dtor via
2910 DATA is a type that direcly or indirectly inherits the base
2911 represented by BINFO. If BINFO contains a virtual assignment [copy
2912 assignment or move assigment] operator or a virtual constructor,
2913 declare that function in DATA if it hasn't been already declared. */
2916 dfs_declare_virt_assop_and_dtor (tree binfo
, void *data
)
2918 tree bv
, fn
, t
= (tree
)data
;
2919 tree opname
= ansi_assopname (NOP_EXPR
);
2921 gcc_assert (t
&& CLASS_TYPE_P (t
));
2922 gcc_assert (binfo
&& TREE_CODE (binfo
) == TREE_BINFO
);
2924 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
2925 /* A base without a vtable needs no modification, and its bases
2926 are uninteresting. */
2927 return dfs_skip_bases
;
2929 if (BINFO_PRIMARY_P (binfo
))
2930 /* If this is a primary base, then we have already looked at the
2931 virtual functions of its vtable. */
2934 for (bv
= BINFO_VIRTUALS (binfo
); bv
; bv
= TREE_CHAIN (bv
))
2938 if (DECL_NAME (fn
) == opname
)
2940 if (CLASSTYPE_LAZY_COPY_ASSIGN (t
))
2941 lazily_declare_fn (sfk_copy_assignment
, t
);
2942 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
2943 lazily_declare_fn (sfk_move_assignment
, t
);
2945 else if (DECL_DESTRUCTOR_P (fn
)
2946 && CLASSTYPE_LAZY_DESTRUCTOR (t
))
2947 lazily_declare_fn (sfk_destructor
, t
);
2953 /* If the class type T has a direct or indirect base that contains a
2954 virtual assignment operator or a virtual destructor, declare that
2955 function in T if it hasn't been already declared. */
2958 declare_virt_assop_and_dtor (tree t
)
2960 if (!(TYPE_POLYMORPHIC_P (t
)
2961 && (CLASSTYPE_LAZY_COPY_ASSIGN (t
)
2962 || CLASSTYPE_LAZY_MOVE_ASSIGN (t
)
2963 || CLASSTYPE_LAZY_DESTRUCTOR (t
))))
2966 dfs_walk_all (TYPE_BINFO (t
),
2967 dfs_declare_virt_assop_and_dtor
,
2971 /* Declare the inheriting constructor for class T inherited from base
2972 constructor CTOR with the parameter array PARMS of size NPARMS. */
2975 one_inheriting_sig (tree t
, tree ctor
, tree
*parms
, int nparms
)
2977 /* We don't declare an inheriting ctor that would be a default,
2978 copy or move ctor for derived or base. */
2982 && TREE_CODE (parms
[0]) == REFERENCE_TYPE
)
2984 tree parm
= TYPE_MAIN_VARIANT (TREE_TYPE (parms
[0]));
2985 if (parm
== t
|| parm
== DECL_CONTEXT (ctor
))
2989 tree parmlist
= void_list_node
;
2990 for (int i
= nparms
- 1; i
>= 0; i
--)
2991 parmlist
= tree_cons (NULL_TREE
, parms
[i
], parmlist
);
2992 tree fn
= implicitly_declare_fn (sfk_inheriting_constructor
,
2993 t
, false, ctor
, parmlist
);
2994 if (add_method (t
, fn
, NULL_TREE
))
2996 DECL_CHAIN (fn
) = TYPE_METHODS (t
);
2997 TYPE_METHODS (t
) = fn
;
3001 /* Declare all the inheriting constructors for class T inherited from base
3002 constructor CTOR. */
3005 one_inherited_ctor (tree ctor
, tree t
)
3007 tree parms
= FUNCTION_FIRST_USER_PARMTYPE (ctor
);
3009 tree
*new_parms
= XALLOCAVEC (tree
, list_length (parms
));
3011 for (; parms
&& parms
!= void_list_node
; parms
= TREE_CHAIN (parms
))
3013 if (TREE_PURPOSE (parms
))
3014 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3015 new_parms
[i
++] = TREE_VALUE (parms
);
3017 one_inheriting_sig (t
, ctor
, new_parms
, i
);
3018 if (parms
== NULL_TREE
)
3020 warning (OPT_Winherited_variadic_ctor
,
3021 "the ellipsis in %qD is not inherited", ctor
);
3022 inform (DECL_SOURCE_LOCATION (ctor
), "%qD declared here", ctor
);
3026 /* Create default constructors, assignment operators, and so forth for
3027 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3028 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3029 the class cannot have a default constructor, copy constructor
3030 taking a const reference argument, or an assignment operator taking
3031 a const reference, respectively. */
3034 add_implicitly_declared_members (tree t
, tree
* access_decls
,
3035 int cant_have_const_cctor
,
3036 int cant_have_const_assignment
)
3038 bool move_ok
= false;
3040 if (cxx_dialect
>= cxx11
&& !CLASSTYPE_DESTRUCTORS (t
)
3041 && !TYPE_HAS_COPY_CTOR (t
) && !TYPE_HAS_COPY_ASSIGN (t
)
3042 && !type_has_move_constructor (t
) && !type_has_move_assign (t
))
3046 if (!CLASSTYPE_DESTRUCTORS (t
))
3048 /* In general, we create destructors lazily. */
3049 CLASSTYPE_LAZY_DESTRUCTOR (t
) = 1;
3051 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3052 && TYPE_FOR_JAVA (t
))
3053 /* But if this is a Java class, any non-trivial destructor is
3054 invalid, even if compiler-generated. Therefore, if the
3055 destructor is non-trivial we create it now. */
3056 lazily_declare_fn (sfk_destructor
, t
);
3061 If there is no user-declared constructor for a class, a default
3062 constructor is implicitly declared. */
3063 if (! TYPE_HAS_USER_CONSTRUCTOR (t
))
3065 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 1;
3066 CLASSTYPE_LAZY_DEFAULT_CTOR (t
) = 1;
3067 if (cxx_dialect
>= cxx11
)
3068 TYPE_HAS_CONSTEXPR_CTOR (t
)
3069 /* This might force the declaration. */
3070 = type_has_constexpr_default_constructor (t
);
3075 If a class definition does not explicitly declare a copy
3076 constructor, one is declared implicitly. */
3077 if (! TYPE_HAS_COPY_CTOR (t
) && ! TYPE_FOR_JAVA (t
))
3079 TYPE_HAS_COPY_CTOR (t
) = 1;
3080 TYPE_HAS_CONST_COPY_CTOR (t
) = !cant_have_const_cctor
;
3081 CLASSTYPE_LAZY_COPY_CTOR (t
) = 1;
3083 CLASSTYPE_LAZY_MOVE_CTOR (t
) = 1;
3086 /* If there is no assignment operator, one will be created if and
3087 when it is needed. For now, just record whether or not the type
3088 of the parameter to the assignment operator will be a const or
3089 non-const reference. */
3090 if (!TYPE_HAS_COPY_ASSIGN (t
) && !TYPE_FOR_JAVA (t
))
3092 TYPE_HAS_COPY_ASSIGN (t
) = 1;
3093 TYPE_HAS_CONST_COPY_ASSIGN (t
) = !cant_have_const_assignment
;
3094 CLASSTYPE_LAZY_COPY_ASSIGN (t
) = 1;
3096 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 1;
3099 /* We can't be lazy about declaring functions that might override
3100 a virtual function from a base class. */
3101 declare_virt_assop_and_dtor (t
);
3103 while (*access_decls
)
3105 tree using_decl
= TREE_VALUE (*access_decls
);
3106 tree decl
= USING_DECL_DECLS (using_decl
);
3107 if (DECL_NAME (using_decl
) == ctor_identifier
)
3109 /* declare, then remove the decl */
3110 tree ctor_list
= decl
;
3111 location_t loc
= input_location
;
3112 input_location
= DECL_SOURCE_LOCATION (using_decl
);
3114 for (; ctor_list
; ctor_list
= OVL_NEXT (ctor_list
))
3115 one_inherited_ctor (OVL_CURRENT (ctor_list
), t
);
3116 *access_decls
= TREE_CHAIN (*access_decls
);
3117 input_location
= loc
;
3120 access_decls
= &TREE_CHAIN (*access_decls
);
3124 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3125 count the number of fields in TYPE, including anonymous union
3129 count_fields (tree fields
)
3133 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3135 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3136 n_fields
+= count_fields (TYPE_FIELDS (TREE_TYPE (x
)));
3143 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3144 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3145 elts, starting at offset IDX. */
3148 add_fields_to_record_type (tree fields
, struct sorted_fields_type
*field_vec
, int idx
)
3151 for (x
= fields
; x
; x
= DECL_CHAIN (x
))
3153 if (TREE_CODE (x
) == FIELD_DECL
&& ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
3154 idx
= add_fields_to_record_type (TYPE_FIELDS (TREE_TYPE (x
)), field_vec
, idx
);
3156 field_vec
->elts
[idx
++] = x
;
3161 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3162 starting at offset IDX. */
3165 add_enum_fields_to_record_type (tree enumtype
,
3166 struct sorted_fields_type
*field_vec
,
3170 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
3171 field_vec
->elts
[idx
++] = TREE_VALUE (values
);
3175 /* FIELD is a bit-field. We are finishing the processing for its
3176 enclosing type. Issue any appropriate messages and set appropriate
3177 flags. Returns false if an error has been diagnosed. */
3180 check_bitfield_decl (tree field
)
3182 tree type
= TREE_TYPE (field
);
3185 /* Extract the declared width of the bitfield, which has been
3186 temporarily stashed in DECL_INITIAL. */
3187 w
= DECL_INITIAL (field
);
3188 gcc_assert (w
!= NULL_TREE
);
3189 /* Remove the bit-field width indicator so that the rest of the
3190 compiler does not treat that value as an initializer. */
3191 DECL_INITIAL (field
) = NULL_TREE
;
3193 /* Detect invalid bit-field type. */
3194 if (!INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
3196 error ("bit-field %q+#D with non-integral type", field
);
3197 w
= error_mark_node
;
3201 location_t loc
= input_location
;
3202 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3205 /* detect invalid field size. */
3206 input_location
= DECL_SOURCE_LOCATION (field
);
3207 w
= cxx_constant_value (w
);
3208 input_location
= loc
;
3210 if (TREE_CODE (w
) != INTEGER_CST
)
3212 error ("bit-field %q+D width not an integer constant", field
);
3213 w
= error_mark_node
;
3215 else if (tree_int_cst_sgn (w
) < 0)
3217 error ("negative width in bit-field %q+D", field
);
3218 w
= error_mark_node
;
3220 else if (integer_zerop (w
) && DECL_NAME (field
) != 0)
3222 error ("zero width for bit-field %q+D", field
);
3223 w
= error_mark_node
;
3225 else if ((TREE_CODE (type
) != ENUMERAL_TYPE
3226 && TREE_CODE (type
) != BOOLEAN_TYPE
3227 && compare_tree_int (w
, TYPE_PRECISION (type
)) > 0)
3228 || ((TREE_CODE (type
) == ENUMERAL_TYPE
3229 || TREE_CODE (type
) == BOOLEAN_TYPE
)
3230 && tree_int_cst_lt (TYPE_SIZE (type
), w
)))
3231 warning (0, "width of %q+D exceeds its type", field
);
3232 else if (TREE_CODE (type
) == ENUMERAL_TYPE
3233 && (0 > (compare_tree_int
3234 (w
, TYPE_PRECISION (ENUM_UNDERLYING_TYPE (type
))))))
3235 warning (0, "%q+D is too small to hold all values of %q#T", field
, type
);
3238 if (w
!= error_mark_node
)
3240 DECL_SIZE (field
) = convert (bitsizetype
, w
);
3241 DECL_BIT_FIELD (field
) = 1;
3246 /* Non-bit-fields are aligned for their type. */
3247 DECL_BIT_FIELD (field
) = 0;
3248 CLEAR_DECL_C_BIT_FIELD (field
);
3253 /* FIELD is a non bit-field. We are finishing the processing for its
3254 enclosing type T. Issue any appropriate messages and set appropriate
3258 check_field_decl (tree field
,
3260 int* cant_have_const_ctor
,
3261 int* no_const_asn_ref
,
3262 int* any_default_members
)
3264 tree type
= strip_array_types (TREE_TYPE (field
));
3266 /* In C++98 an anonymous union cannot contain any fields which would change
3267 the settings of CANT_HAVE_CONST_CTOR and friends. */
3268 if (ANON_UNION_TYPE_P (type
) && cxx_dialect
< cxx11
)
3270 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3271 structs. So, we recurse through their fields here. */
3272 else if (ANON_AGGR_TYPE_P (type
))
3276 for (fields
= TYPE_FIELDS (type
); fields
; fields
= DECL_CHAIN (fields
))
3277 if (TREE_CODE (fields
) == FIELD_DECL
&& !DECL_C_BIT_FIELD (field
))
3278 check_field_decl (fields
, t
, cant_have_const_ctor
,
3279 no_const_asn_ref
, any_default_members
);
3281 /* Check members with class type for constructors, destructors,
3283 else if (CLASS_TYPE_P (type
))
3285 /* Never let anything with uninheritable virtuals
3286 make it through without complaint. */
3287 abstract_virtuals_error (field
, type
);
3289 if (TREE_CODE (t
) == UNION_TYPE
&& cxx_dialect
< cxx11
)
3292 int oldcount
= errorcount
;
3293 if (TYPE_NEEDS_CONSTRUCTING (type
))
3294 error ("member %q+#D with constructor not allowed in union",
3296 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3297 error ("member %q+#D with destructor not allowed in union", field
);
3298 if (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
))
3299 error ("member %q+#D with copy assignment operator not allowed in union",
3301 if (!warned
&& errorcount
> oldcount
)
3303 inform (DECL_SOURCE_LOCATION (field
), "unrestricted unions "
3304 "only available with -std=c++11 or -std=gnu++11");
3310 TYPE_NEEDS_CONSTRUCTING (t
) |= TYPE_NEEDS_CONSTRUCTING (type
);
3311 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3312 |= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
);
3313 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
)
3314 |= (TYPE_HAS_COMPLEX_COPY_ASSIGN (type
)
3315 || !TYPE_HAS_COPY_ASSIGN (type
));
3316 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= (TYPE_HAS_COMPLEX_COPY_CTOR (type
)
3317 || !TYPE_HAS_COPY_CTOR (type
));
3318 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_HAS_COMPLEX_MOVE_ASSIGN (type
);
3319 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_HAS_COMPLEX_MOVE_CTOR (type
);
3320 TYPE_HAS_COMPLEX_DFLT (t
) |= (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)
3321 || TYPE_HAS_COMPLEX_DFLT (type
));
3324 if (TYPE_HAS_COPY_CTOR (type
)
3325 && !TYPE_HAS_CONST_COPY_CTOR (type
))
3326 *cant_have_const_ctor
= 1;
3328 if (TYPE_HAS_COPY_ASSIGN (type
)
3329 && !TYPE_HAS_CONST_COPY_ASSIGN (type
))
3330 *no_const_asn_ref
= 1;
3333 check_abi_tags (t
, field
);
3335 if (DECL_INITIAL (field
) != NULL_TREE
)
3337 /* `build_class_init_list' does not recognize
3339 if (TREE_CODE (t
) == UNION_TYPE
&& *any_default_members
!= 0)
3340 error ("multiple fields in union %qT initialized", t
);
3341 *any_default_members
= 1;
3345 /* Check the data members (both static and non-static), class-scoped
3346 typedefs, etc., appearing in the declaration of T. Issue
3347 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3348 declaration order) of access declarations; each TREE_VALUE in this
3349 list is a USING_DECL.
3351 In addition, set the following flags:
3354 The class is empty, i.e., contains no non-static data members.
3356 CANT_HAVE_CONST_CTOR_P
3357 This class cannot have an implicitly generated copy constructor
3358 taking a const reference.
3360 CANT_HAVE_CONST_ASN_REF
3361 This class cannot have an implicitly generated assignment
3362 operator taking a const reference.
3364 All of these flags should be initialized before calling this
3367 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3368 fields can be added by adding to this chain. */
3371 check_field_decls (tree t
, tree
*access_decls
,
3372 int *cant_have_const_ctor_p
,
3373 int *no_const_asn_ref_p
)
3378 int any_default_members
;
3380 int field_access
= -1;
3382 /* Assume there are no access declarations. */
3383 *access_decls
= NULL_TREE
;
3384 /* Assume this class has no pointer members. */
3385 has_pointers
= false;
3386 /* Assume none of the members of this class have default
3388 any_default_members
= 0;
3390 for (field
= &TYPE_FIELDS (t
); *field
; field
= next
)
3393 tree type
= TREE_TYPE (x
);
3394 int this_field_access
;
3396 next
= &DECL_CHAIN (x
);
3398 if (TREE_CODE (x
) == USING_DECL
)
3400 /* Save the access declarations for our caller. */
3401 *access_decls
= tree_cons (NULL_TREE
, x
, *access_decls
);
3405 if (TREE_CODE (x
) == TYPE_DECL
3406 || TREE_CODE (x
) == TEMPLATE_DECL
)
3409 /* If we've gotten this far, it's a data member, possibly static,
3410 or an enumerator. */
3411 if (TREE_CODE (x
) != CONST_DECL
)
3412 DECL_CONTEXT (x
) = t
;
3414 /* When this goes into scope, it will be a non-local reference. */
3415 DECL_NONLOCAL (x
) = 1;
3417 if (TREE_CODE (t
) == UNION_TYPE
)
3421 If a union contains a static data member, or a member of
3422 reference type, the program is ill-formed. */
3425 error ("%q+D may not be static because it is a member of a union", x
);
3428 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3430 error ("%q+D may not have reference type %qT because"
3431 " it is a member of a union",
3437 /* Perform error checking that did not get done in
3439 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3441 error ("field %q+D invalidly declared function type", x
);
3442 type
= build_pointer_type (type
);
3443 TREE_TYPE (x
) = type
;
3445 else if (TREE_CODE (type
) == METHOD_TYPE
)
3447 error ("field %q+D invalidly declared method type", x
);
3448 type
= build_pointer_type (type
);
3449 TREE_TYPE (x
) = type
;
3452 if (type
== error_mark_node
)
3455 if (TREE_CODE (x
) == CONST_DECL
|| VAR_P (x
))
3458 /* Now it can only be a FIELD_DECL. */
3460 if (TREE_PRIVATE (x
) || TREE_PROTECTED (x
))
3461 CLASSTYPE_NON_AGGREGATE (t
) = 1;
3463 /* If at least one non-static data member is non-literal, the whole
3464 class becomes non-literal. Note: if the type is incomplete we
3465 will complain later on. */
3466 if (COMPLETE_TYPE_P (type
) && !literal_type_p (type
))
3467 CLASSTYPE_LITERAL_P (t
) = false;
3469 /* A standard-layout class is a class that:
3471 has the same access control (Clause 11) for all non-static data members,
3473 this_field_access
= TREE_PROTECTED (x
) ? 1 : TREE_PRIVATE (x
) ? 2 : 0;
3474 if (field_access
== -1)
3475 field_access
= this_field_access
;
3476 else if (this_field_access
!= field_access
)
3477 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3479 /* If this is of reference type, check if it needs an init. */
3480 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3482 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3483 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3484 if (DECL_INITIAL (x
) == NULL_TREE
)
3485 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3487 /* ARM $12.6.2: [A member initializer list] (or, for an
3488 aggregate, initialization by a brace-enclosed list) is the
3489 only way to initialize nonstatic const and reference
3491 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3492 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3495 type
= strip_array_types (type
);
3497 if (TYPE_PACKED (t
))
3499 if (!layout_pod_type_p (type
) && !TYPE_PACKED (type
))
3503 "ignoring packed attribute because of unpacked non-POD field %q+#D",
3507 else if (DECL_C_BIT_FIELD (x
)
3508 || TYPE_ALIGN (TREE_TYPE (x
)) > BITS_PER_UNIT
)
3509 DECL_PACKED (x
) = 1;
3512 if (DECL_C_BIT_FIELD (x
) && integer_zerop (DECL_INITIAL (x
)))
3513 /* We don't treat zero-width bitfields as making a class
3518 /* The class is non-empty. */
3519 CLASSTYPE_EMPTY_P (t
) = 0;
3520 /* The class is not even nearly empty. */
3521 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
3522 /* If one of the data members contains an empty class,
3524 if (CLASS_TYPE_P (type
)
3525 && CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3526 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
3529 /* This is used by -Weffc++ (see below). Warn only for pointers
3530 to members which might hold dynamic memory. So do not warn
3531 for pointers to functions or pointers to members. */
3532 if (TYPE_PTR_P (type
)
3533 && !TYPE_PTRFN_P (type
))
3534 has_pointers
= true;
3536 if (CLASS_TYPE_P (type
))
3538 if (CLASSTYPE_REF_FIELDS_NEED_INIT (type
))
3539 SET_CLASSTYPE_REF_FIELDS_NEED_INIT (t
, 1);
3540 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
))
3541 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3544 if (DECL_MUTABLE_P (x
) || TYPE_HAS_MUTABLE_P (type
))
3545 CLASSTYPE_HAS_MUTABLE (t
) = 1;
3547 if (DECL_MUTABLE_P (x
))
3549 if (CP_TYPE_CONST_P (type
))
3551 error ("member %q+D cannot be declared both %<const%> "
3552 "and %<mutable%>", x
);
3555 if (TREE_CODE (type
) == REFERENCE_TYPE
)
3557 error ("member %q+D cannot be declared as a %<mutable%> "
3563 if (! layout_pod_type_p (type
))
3564 /* DR 148 now allows pointers to members (which are POD themselves),
3565 to be allowed in POD structs. */
3566 CLASSTYPE_NON_LAYOUT_POD_P (t
) = 1;
3568 if (!std_layout_type_p (type
))
3569 CLASSTYPE_NON_STD_LAYOUT (t
) = 1;
3571 if (! zero_init_p (type
))
3572 CLASSTYPE_NON_ZERO_INIT_P (t
) = 1;
3574 /* We set DECL_C_BIT_FIELD in grokbitfield.
3575 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3576 if (! DECL_C_BIT_FIELD (x
) || ! check_bitfield_decl (x
))
3577 check_field_decl (x
, t
,
3578 cant_have_const_ctor_p
,
3580 &any_default_members
);
3582 /* Now that we've removed bit-field widths from DECL_INITIAL,
3583 anything left in DECL_INITIAL is an NSDMI that makes the class
3585 if (DECL_INITIAL (x
))
3586 CLASSTYPE_NON_AGGREGATE (t
) = true;
3588 /* If any field is const, the structure type is pseudo-const. */
3589 if (CP_TYPE_CONST_P (type
))
3591 C_TYPE_FIELDS_READONLY (t
) = 1;
3592 if (DECL_INITIAL (x
) == NULL_TREE
)
3593 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
, 1);
3595 /* ARM $12.6.2: [A member initializer list] (or, for an
3596 aggregate, initialization by a brace-enclosed list) is the
3597 only way to initialize nonstatic const and reference
3599 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
3600 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) = 1;
3602 /* A field that is pseudo-const makes the structure likewise. */
3603 else if (CLASS_TYPE_P (type
))
3605 C_TYPE_FIELDS_READONLY (t
) |= C_TYPE_FIELDS_READONLY (type
);
3606 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
,
3607 CLASSTYPE_READONLY_FIELDS_NEED_INIT (t
)
3608 | CLASSTYPE_READONLY_FIELDS_NEED_INIT (type
));
3611 /* Core issue 80: A nonstatic data member is required to have a
3612 different name from the class iff the class has a
3613 user-declared constructor. */
3614 if (constructor_name_p (DECL_NAME (x
), t
)
3615 && TYPE_HAS_USER_CONSTRUCTOR (t
))
3616 permerror (input_location
, "field %q+#D with same name as class", x
);
3619 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3620 it should also define a copy constructor and an assignment operator to
3621 implement the correct copy semantic (deep vs shallow, etc.). As it is
3622 not feasible to check whether the constructors do allocate dynamic memory
3623 and store it within members, we approximate the warning like this:
3625 -- Warn only if there are members which are pointers
3626 -- Warn only if there is a non-trivial constructor (otherwise,
3627 there cannot be memory allocated).
3628 -- Warn only if there is a non-trivial destructor. We assume that the
3629 user at least implemented the cleanup correctly, and a destructor
3630 is needed to free dynamic memory.
3632 This seems enough for practical purposes. */
3635 && TYPE_HAS_USER_CONSTRUCTOR (t
)
3636 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
)
3637 && !(TYPE_HAS_COPY_CTOR (t
) && TYPE_HAS_COPY_ASSIGN (t
)))
3639 warning (OPT_Weffc__
, "%q#T has pointer data members", t
);
3641 if (! TYPE_HAS_COPY_CTOR (t
))
3643 warning (OPT_Weffc__
,
3644 " but does not override %<%T(const %T&)%>", t
, t
);
3645 if (!TYPE_HAS_COPY_ASSIGN (t
))
3646 warning (OPT_Weffc__
, " or %<operator=(const %T&)%>", t
);
3648 else if (! TYPE_HAS_COPY_ASSIGN (t
))
3649 warning (OPT_Weffc__
,
3650 " but does not override %<operator=(const %T&)%>", t
);
3653 /* Non-static data member initializers make the default constructor
3655 if (any_default_members
)
3657 TYPE_NEEDS_CONSTRUCTING (t
) = true;
3658 TYPE_HAS_COMPLEX_DFLT (t
) = true;
3661 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3663 TYPE_PACKED (t
) = 0;
3665 /* Check anonymous struct/anonymous union fields. */
3666 finish_struct_anon (t
);
3668 /* We've built up the list of access declarations in reverse order.
3670 *access_decls
= nreverse (*access_decls
);
3673 /* If TYPE is an empty class type, records its OFFSET in the table of
3677 record_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3681 if (!is_empty_class (type
))
3684 /* Record the location of this empty object in OFFSETS. */
3685 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3687 n
= splay_tree_insert (offsets
,
3688 (splay_tree_key
) offset
,
3689 (splay_tree_value
) NULL_TREE
);
3690 n
->value
= ((splay_tree_value
)
3691 tree_cons (NULL_TREE
,
3698 /* Returns nonzero if TYPE is an empty class type and there is
3699 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3702 check_subobject_offset (tree type
, tree offset
, splay_tree offsets
)
3707 if (!is_empty_class (type
))
3710 /* Record the location of this empty object in OFFSETS. */
3711 n
= splay_tree_lookup (offsets
, (splay_tree_key
) offset
);
3715 for (t
= (tree
) n
->value
; t
; t
= TREE_CHAIN (t
))
3716 if (same_type_p (TREE_VALUE (t
), type
))
3722 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3723 F for every subobject, passing it the type, offset, and table of
3724 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3727 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3728 than MAX_OFFSET will not be walked.
3730 If F returns a nonzero value, the traversal ceases, and that value
3731 is returned. Otherwise, returns zero. */
3734 walk_subobject_offsets (tree type
,
3735 subobject_offset_fn f
,
3742 tree type_binfo
= NULL_TREE
;
3744 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3746 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3749 if (type
== error_mark_node
)
3754 if (abi_version_at_least (2))
3756 type
= BINFO_TYPE (type
);
3759 if (CLASS_TYPE_P (type
))
3765 /* Avoid recursing into objects that are not interesting. */
3766 if (!CLASSTYPE_CONTAINS_EMPTY_CLASS_P (type
))
3769 /* Record the location of TYPE. */
3770 r
= (*f
) (type
, offset
, offsets
);
3774 /* Iterate through the direct base classes of TYPE. */
3776 type_binfo
= TYPE_BINFO (type
);
3777 for (i
= 0; BINFO_BASE_ITERATE (type_binfo
, i
, binfo
); i
++)
3781 if (abi_version_at_least (2)
3782 && BINFO_VIRTUAL_P (binfo
))
3786 && BINFO_VIRTUAL_P (binfo
)
3787 && !BINFO_PRIMARY_P (binfo
))
3790 if (!abi_version_at_least (2))
3791 binfo_offset
= size_binop (PLUS_EXPR
,
3793 BINFO_OFFSET (binfo
));
3797 /* We cannot rely on BINFO_OFFSET being set for the base
3798 class yet, but the offsets for direct non-virtual
3799 bases can be calculated by going back to the TYPE. */
3800 orig_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (type
), i
);
3801 binfo_offset
= size_binop (PLUS_EXPR
,
3803 BINFO_OFFSET (orig_binfo
));
3806 r
= walk_subobject_offsets (binfo
,
3811 (abi_version_at_least (2)
3812 ? /*vbases_p=*/0 : vbases_p
));
3817 if (abi_version_at_least (2) && CLASSTYPE_VBASECLASSES (type
))
3820 vec
<tree
, va_gc
> *vbases
;
3822 /* Iterate through the virtual base classes of TYPE. In G++
3823 3.2, we included virtual bases in the direct base class
3824 loop above, which results in incorrect results; the
3825 correct offsets for virtual bases are only known when
3826 working with the most derived type. */
3828 for (vbases
= CLASSTYPE_VBASECLASSES (type
), ix
= 0;
3829 vec_safe_iterate (vbases
, ix
, &binfo
); ix
++)
3831 r
= walk_subobject_offsets (binfo
,
3833 size_binop (PLUS_EXPR
,
3835 BINFO_OFFSET (binfo
)),
3844 /* We still have to walk the primary base, if it is
3845 virtual. (If it is non-virtual, then it was walked
3847 tree vbase
= get_primary_binfo (type_binfo
);
3849 if (vbase
&& BINFO_VIRTUAL_P (vbase
)
3850 && BINFO_PRIMARY_P (vbase
)
3851 && BINFO_INHERITANCE_CHAIN (vbase
) == type_binfo
)
3853 r
= (walk_subobject_offsets
3855 offsets
, max_offset
, /*vbases_p=*/0));
3862 /* Iterate through the fields of TYPE. */
3863 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3864 if (TREE_CODE (field
) == FIELD_DECL
3865 && TREE_TYPE (field
) != error_mark_node
3866 && !DECL_ARTIFICIAL (field
))
3870 if (abi_version_at_least (2))
3871 field_offset
= byte_position (field
);
3873 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3874 field_offset
= DECL_FIELD_OFFSET (field
);
3876 r
= walk_subobject_offsets (TREE_TYPE (field
),
3878 size_binop (PLUS_EXPR
,
3888 else if (TREE_CODE (type
) == ARRAY_TYPE
)
3890 tree element_type
= strip_array_types (type
);
3891 tree domain
= TYPE_DOMAIN (type
);
3894 /* Avoid recursing into objects that are not interesting. */
3895 if (!CLASS_TYPE_P (element_type
)
3896 || !CLASSTYPE_CONTAINS_EMPTY_CLASS_P (element_type
))
3899 /* Step through each of the elements in the array. */
3900 for (index
= size_zero_node
;
3901 /* G++ 3.2 had an off-by-one error here. */
3902 (abi_version_at_least (2)
3903 ? !INT_CST_LT (TYPE_MAX_VALUE (domain
), index
)
3904 : INT_CST_LT (index
, TYPE_MAX_VALUE (domain
)));
3905 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
3907 r
= walk_subobject_offsets (TREE_TYPE (type
),
3915 offset
= size_binop (PLUS_EXPR
, offset
,
3916 TYPE_SIZE_UNIT (TREE_TYPE (type
)));
3917 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3918 there's no point in iterating through the remaining
3919 elements of the array. */
3920 if (max_offset
&& INT_CST_LT (max_offset
, offset
))
3928 /* Record all of the empty subobjects of TYPE (either a type or a
3929 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3930 is being placed at OFFSET; otherwise, it is a base class that is
3931 being placed at OFFSET. */
3934 record_subobject_offsets (tree type
,
3937 bool is_data_member
)
3940 /* If recording subobjects for a non-static data member or a
3941 non-empty base class , we do not need to record offsets beyond
3942 the size of the biggest empty class. Additional data members
3943 will go at the end of the class. Additional base classes will go
3944 either at offset zero (if empty, in which case they cannot
3945 overlap with offsets past the size of the biggest empty class) or
3946 at the end of the class.
3948 However, if we are placing an empty base class, then we must record
3949 all offsets, as either the empty class is at offset zero (where
3950 other empty classes might later be placed) or at the end of the
3951 class (where other objects might then be placed, so other empty
3952 subobjects might later overlap). */
3954 || !is_empty_class (BINFO_TYPE (type
)))
3955 max_offset
= sizeof_biggest_empty_class
;
3957 max_offset
= NULL_TREE
;
3958 walk_subobject_offsets (type
, record_subobject_offset
, offset
,
3959 offsets
, max_offset
, is_data_member
);
3962 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3963 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3964 virtual bases of TYPE are examined. */
3967 layout_conflict_p (tree type
,
3972 splay_tree_node max_node
;
3974 /* Get the node in OFFSETS that indicates the maximum offset where
3975 an empty subobject is located. */
3976 max_node
= splay_tree_max (offsets
);
3977 /* If there aren't any empty subobjects, then there's no point in
3978 performing this check. */
3982 return walk_subobject_offsets (type
, check_subobject_offset
, offset
,
3983 offsets
, (tree
) (max_node
->key
),
3987 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3988 non-static data member of the type indicated by RLI. BINFO is the
3989 binfo corresponding to the base subobject, OFFSETS maps offsets to
3990 types already located at those offsets. This function determines
3991 the position of the DECL. */
3994 layout_nonempty_base_or_field (record_layout_info rli
,
3999 tree offset
= NULL_TREE
;
4005 /* For the purposes of determining layout conflicts, we want to
4006 use the class type of BINFO; TREE_TYPE (DECL) will be the
4007 CLASSTYPE_AS_BASE version, which does not contain entries for
4008 zero-sized bases. */
4009 type
= TREE_TYPE (binfo
);
4014 type
= TREE_TYPE (decl
);
4018 /* Try to place the field. It may take more than one try if we have
4019 a hard time placing the field without putting two objects of the
4020 same type at the same address. */
4023 struct record_layout_info_s old_rli
= *rli
;
4025 /* Place this field. */
4026 place_field (rli
, decl
);
4027 offset
= byte_position (decl
);
4029 /* We have to check to see whether or not there is already
4030 something of the same type at the offset we're about to use.
4031 For example, consider:
4034 struct T : public S { int i; };
4035 struct U : public S, public T {};
4037 Here, we put S at offset zero in U. Then, we can't put T at
4038 offset zero -- its S component would be at the same address
4039 as the S we already allocated. So, we have to skip ahead.
4040 Since all data members, including those whose type is an
4041 empty class, have nonzero size, any overlap can happen only
4042 with a direct or indirect base-class -- it can't happen with
4044 /* In a union, overlap is permitted; all members are placed at
4046 if (TREE_CODE (rli
->t
) == UNION_TYPE
)
4048 /* G++ 3.2 did not check for overlaps when placing a non-empty
4050 if (!abi_version_at_least (2) && binfo
&& BINFO_VIRTUAL_P (binfo
))
4052 if (layout_conflict_p (field_p
? type
: binfo
, offset
,
4055 /* Strip off the size allocated to this field. That puts us
4056 at the first place we could have put the field with
4057 proper alignment. */
4060 /* Bump up by the alignment required for the type. */
4062 = size_binop (PLUS_EXPR
, rli
->bitpos
,
4064 ? CLASSTYPE_ALIGN (type
)
4065 : TYPE_ALIGN (type
)));
4066 normalize_rli (rli
);
4069 /* There was no conflict. We're done laying out this field. */
4073 /* Now that we know where it will be placed, update its
4075 if (binfo
&& CLASS_TYPE_P (BINFO_TYPE (binfo
)))
4076 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4077 this point because their BINFO_OFFSET is copied from another
4078 hierarchy. Therefore, we may not need to add the entire
4080 propagate_binfo_offsets (binfo
,
4081 size_diffop_loc (input_location
,
4082 convert (ssizetype
, offset
),
4084 BINFO_OFFSET (binfo
))));
4087 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4090 empty_base_at_nonzero_offset_p (tree type
,
4092 splay_tree
/*offsets*/)
4094 return is_empty_class (type
) && !integer_zerop (offset
);
4097 /* Layout the empty base BINFO. EOC indicates the byte currently just
4098 past the end of the class, and should be correctly aligned for a
4099 class of the type indicated by BINFO; OFFSETS gives the offsets of
4100 the empty bases allocated so far. T is the most derived
4101 type. Return nonzero iff we added it at the end. */
4104 layout_empty_base (record_layout_info rli
, tree binfo
,
4105 tree eoc
, splay_tree offsets
)
4108 tree basetype
= BINFO_TYPE (binfo
);
4111 /* This routine should only be used for empty classes. */
4112 gcc_assert (is_empty_class (basetype
));
4113 alignment
= ssize_int (CLASSTYPE_ALIGN_UNIT (basetype
));
4115 if (!integer_zerop (BINFO_OFFSET (binfo
)))
4117 if (abi_version_at_least (2))
4118 propagate_binfo_offsets
4119 (binfo
, size_diffop_loc (input_location
,
4120 size_zero_node
, BINFO_OFFSET (binfo
)));
4123 "offset of empty base %qT may not be ABI-compliant and may"
4124 "change in a future version of GCC",
4125 BINFO_TYPE (binfo
));
4128 /* This is an empty base class. We first try to put it at offset
4130 if (layout_conflict_p (binfo
,
4131 BINFO_OFFSET (binfo
),
4135 /* That didn't work. Now, we move forward from the next
4136 available spot in the class. */
4138 propagate_binfo_offsets (binfo
, convert (ssizetype
, eoc
));
4141 if (!layout_conflict_p (binfo
,
4142 BINFO_OFFSET (binfo
),
4145 /* We finally found a spot where there's no overlap. */
4148 /* There's overlap here, too. Bump along to the next spot. */
4149 propagate_binfo_offsets (binfo
, alignment
);
4153 if (CLASSTYPE_USER_ALIGN (basetype
))
4155 rli
->record_align
= MAX (rli
->record_align
, CLASSTYPE_ALIGN (basetype
));
4157 rli
->unpacked_align
= MAX (rli
->unpacked_align
, CLASSTYPE_ALIGN (basetype
));
4158 TYPE_USER_ALIGN (rli
->t
) = 1;
4164 /* Layout the base given by BINFO in the class indicated by RLI.
4165 *BASE_ALIGN is a running maximum of the alignments of
4166 any base class. OFFSETS gives the location of empty base
4167 subobjects. T is the most derived type. Return nonzero if the new
4168 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4169 *NEXT_FIELD, unless BINFO is for an empty base class.
4171 Returns the location at which the next field should be inserted. */
4174 build_base_field (record_layout_info rli
, tree binfo
,
4175 splay_tree offsets
, tree
*next_field
)
4178 tree basetype
= BINFO_TYPE (binfo
);
4180 if (!COMPLETE_TYPE_P (basetype
))
4181 /* This error is now reported in xref_tag, thus giving better
4182 location information. */
4185 /* Place the base class. */
4186 if (!is_empty_class (basetype
))
4190 /* The containing class is non-empty because it has a non-empty
4192 CLASSTYPE_EMPTY_P (t
) = 0;
4194 /* Create the FIELD_DECL. */
4195 decl
= build_decl (input_location
,
4196 FIELD_DECL
, NULL_TREE
, CLASSTYPE_AS_BASE (basetype
));
4197 DECL_ARTIFICIAL (decl
) = 1;
4198 DECL_IGNORED_P (decl
) = 1;
4199 DECL_FIELD_CONTEXT (decl
) = t
;
4200 if (CLASSTYPE_AS_BASE (basetype
))
4202 DECL_SIZE (decl
) = CLASSTYPE_SIZE (basetype
);
4203 DECL_SIZE_UNIT (decl
) = CLASSTYPE_SIZE_UNIT (basetype
);
4204 DECL_ALIGN (decl
) = CLASSTYPE_ALIGN (basetype
);
4205 DECL_USER_ALIGN (decl
) = CLASSTYPE_USER_ALIGN (basetype
);
4206 DECL_MODE (decl
) = TYPE_MODE (basetype
);
4207 DECL_FIELD_IS_BASE (decl
) = 1;
4209 /* Try to place the field. It may take more than one try if we
4210 have a hard time placing the field without putting two
4211 objects of the same type at the same address. */
4212 layout_nonempty_base_or_field (rli
, decl
, binfo
, offsets
);
4213 /* Add the new FIELD_DECL to the list of fields for T. */
4214 DECL_CHAIN (decl
) = *next_field
;
4216 next_field
= &DECL_CHAIN (decl
);
4224 /* On some platforms (ARM), even empty classes will not be
4226 eoc
= round_up_loc (input_location
,
4227 rli_size_unit_so_far (rli
),
4228 CLASSTYPE_ALIGN_UNIT (basetype
));
4229 atend
= layout_empty_base (rli
, binfo
, eoc
, offsets
);
4230 /* A nearly-empty class "has no proper base class that is empty,
4231 not morally virtual, and at an offset other than zero." */
4232 if (!BINFO_VIRTUAL_P (binfo
) && CLASSTYPE_NEARLY_EMPTY_P (t
))
4235 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4236 /* The check above (used in G++ 3.2) is insufficient because
4237 an empty class placed at offset zero might itself have an
4238 empty base at a nonzero offset. */
4239 else if (walk_subobject_offsets (basetype
,
4240 empty_base_at_nonzero_offset_p
,
4243 /*max_offset=*/NULL_TREE
,
4246 if (abi_version_at_least (2))
4247 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
4250 "class %qT will be considered nearly empty in a "
4251 "future version of GCC", t
);
4255 /* We do not create a FIELD_DECL for empty base classes because
4256 it might overlap some other field. We want to be able to
4257 create CONSTRUCTORs for the class by iterating over the
4258 FIELD_DECLs, and the back end does not handle overlapping
4261 /* An empty virtual base causes a class to be non-empty
4262 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4263 here because that was already done when the virtual table
4264 pointer was created. */
4267 /* Record the offsets of BINFO and its base subobjects. */
4268 record_subobject_offsets (binfo
,
4269 BINFO_OFFSET (binfo
),
4271 /*is_data_member=*/false);
4276 /* Layout all of the non-virtual base classes. Record empty
4277 subobjects in OFFSETS. T is the most derived type. Return nonzero
4278 if the type cannot be nearly empty. The fields created
4279 corresponding to the base classes will be inserted at
4283 build_base_fields (record_layout_info rli
,
4284 splay_tree offsets
, tree
*next_field
)
4286 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4289 int n_baseclasses
= BINFO_N_BASE_BINFOS (TYPE_BINFO (t
));
4292 /* The primary base class is always allocated first. */
4293 if (CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
4294 next_field
= build_base_field (rli
, CLASSTYPE_PRIMARY_BINFO (t
),
4295 offsets
, next_field
);
4297 /* Now allocate the rest of the bases. */
4298 for (i
= 0; i
< n_baseclasses
; ++i
)
4302 base_binfo
= BINFO_BASE_BINFO (TYPE_BINFO (t
), i
);
4304 /* The primary base was already allocated above, so we don't
4305 need to allocate it again here. */
4306 if (base_binfo
== CLASSTYPE_PRIMARY_BINFO (t
))
4309 /* Virtual bases are added at the end (a primary virtual base
4310 will have already been added). */
4311 if (BINFO_VIRTUAL_P (base_binfo
))
4314 next_field
= build_base_field (rli
, base_binfo
,
4315 offsets
, next_field
);
4319 /* Go through the TYPE_METHODS of T issuing any appropriate
4320 diagnostics, figuring out which methods override which other
4321 methods, and so forth. */
4324 check_methods (tree t
)
4328 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
4330 check_for_override (x
, t
);
4331 if (DECL_PURE_VIRTUAL_P (x
) && ! DECL_VINDEX (x
))
4332 error ("initializer specified for non-virtual method %q+D", x
);
4333 /* The name of the field is the original field name
4334 Save this in auxiliary field for later overloading. */
4335 if (DECL_VINDEX (x
))
4337 TYPE_POLYMORPHIC_P (t
) = 1;
4338 if (DECL_PURE_VIRTUAL_P (x
))
4339 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
4341 /* All user-provided destructors are non-trivial.
4342 Constructors and assignment ops are handled in
4343 grok_special_member_properties. */
4344 if (DECL_DESTRUCTOR_P (x
) && user_provided_p (x
))
4345 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = 1;
4349 /* FN is a constructor or destructor. Clone the declaration to create
4350 a specialized in-charge or not-in-charge version, as indicated by
4354 build_clone (tree fn
, tree name
)
4359 /* Copy the function. */
4360 clone
= copy_decl (fn
);
4361 /* Reset the function name. */
4362 DECL_NAME (clone
) = name
;
4363 SET_DECL_ASSEMBLER_NAME (clone
, NULL_TREE
);
4364 /* Remember where this function came from. */
4365 DECL_ABSTRACT_ORIGIN (clone
) = fn
;
4366 /* Make it easy to find the CLONE given the FN. */
4367 DECL_CHAIN (clone
) = DECL_CHAIN (fn
);
4368 DECL_CHAIN (fn
) = clone
;
4370 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4371 if (TREE_CODE (clone
) == TEMPLATE_DECL
)
4373 tree result
= build_clone (DECL_TEMPLATE_RESULT (clone
), name
);
4374 DECL_TEMPLATE_RESULT (clone
) = result
;
4375 DECL_TEMPLATE_INFO (result
) = copy_node (DECL_TEMPLATE_INFO (result
));
4376 DECL_TI_TEMPLATE (result
) = clone
;
4377 TREE_TYPE (clone
) = TREE_TYPE (result
);
4381 DECL_CLONED_FUNCTION (clone
) = fn
;
4382 /* There's no pending inline data for this function. */
4383 DECL_PENDING_INLINE_INFO (clone
) = NULL
;
4384 DECL_PENDING_INLINE_P (clone
) = 0;
4386 /* The base-class destructor is not virtual. */
4387 if (name
== base_dtor_identifier
)
4389 DECL_VIRTUAL_P (clone
) = 0;
4390 if (TREE_CODE (clone
) != TEMPLATE_DECL
)
4391 DECL_VINDEX (clone
) = NULL_TREE
;
4394 /* If there was an in-charge parameter, drop it from the function
4396 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4402 exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4403 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4404 parmtypes
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4405 /* Skip the `this' parameter. */
4406 parmtypes
= TREE_CHAIN (parmtypes
);
4407 /* Skip the in-charge parameter. */
4408 parmtypes
= TREE_CHAIN (parmtypes
);
4409 /* And the VTT parm, in a complete [cd]tor. */
4410 if (DECL_HAS_VTT_PARM_P (fn
)
4411 && ! DECL_NEEDS_VTT_PARM_P (clone
))
4412 parmtypes
= TREE_CHAIN (parmtypes
);
4413 /* If this is subobject constructor or destructor, add the vtt
4416 = build_method_type_directly (basetype
,
4417 TREE_TYPE (TREE_TYPE (clone
)),
4420 TREE_TYPE (clone
) = build_exception_variant (TREE_TYPE (clone
),
4423 = cp_build_type_attribute_variant (TREE_TYPE (clone
),
4424 TYPE_ATTRIBUTES (TREE_TYPE (fn
)));
4427 /* Copy the function parameters. */
4428 DECL_ARGUMENTS (clone
) = copy_list (DECL_ARGUMENTS (clone
));
4429 /* Remove the in-charge parameter. */
4430 if (DECL_HAS_IN_CHARGE_PARM_P (clone
))
4432 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4433 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4434 DECL_HAS_IN_CHARGE_PARM_P (clone
) = 0;
4436 /* And the VTT parm, in a complete [cd]tor. */
4437 if (DECL_HAS_VTT_PARM_P (fn
))
4439 if (DECL_NEEDS_VTT_PARM_P (clone
))
4440 DECL_HAS_VTT_PARM_P (clone
) = 1;
4443 DECL_CHAIN (DECL_ARGUMENTS (clone
))
4444 = DECL_CHAIN (DECL_CHAIN (DECL_ARGUMENTS (clone
)));
4445 DECL_HAS_VTT_PARM_P (clone
) = 0;
4449 for (parms
= DECL_ARGUMENTS (clone
); parms
; parms
= DECL_CHAIN (parms
))
4451 DECL_CONTEXT (parms
) = clone
;
4452 cxx_dup_lang_specific_decl (parms
);
4455 /* Create the RTL for this function. */
4456 SET_DECL_RTL (clone
, NULL
);
4457 rest_of_decl_compilation (clone
, /*top_level=*/1, at_eof
);
4460 note_decl_for_pch (clone
);
4465 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4466 not invoke this function directly.
4468 For a non-thunk function, returns the address of the slot for storing
4469 the function it is a clone of. Otherwise returns NULL_TREE.
4471 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4472 cloned_function is unset. This is to support the separate
4473 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4474 on a template makes sense, but not the former. */
4477 decl_cloned_function_p (const_tree decl
, bool just_testing
)
4481 decl
= STRIP_TEMPLATE (decl
);
4483 if (TREE_CODE (decl
) != FUNCTION_DECL
4484 || !DECL_LANG_SPECIFIC (decl
)
4485 || DECL_LANG_SPECIFIC (decl
)->u
.fn
.thunk_p
)
4487 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4489 lang_check_failed (__FILE__
, __LINE__
, __FUNCTION__
);
4495 ptr
= &DECL_LANG_SPECIFIC (decl
)->u
.fn
.u5
.cloned_function
;
4496 if (just_testing
&& *ptr
== NULL_TREE
)
4502 /* Produce declarations for all appropriate clones of FN. If
4503 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4504 CLASTYPE_METHOD_VEC as well. */
4507 clone_function_decl (tree fn
, int update_method_vec_p
)
4511 /* Avoid inappropriate cloning. */
4513 && DECL_CLONED_FUNCTION_P (DECL_CHAIN (fn
)))
4516 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
4518 /* For each constructor, we need two variants: an in-charge version
4519 and a not-in-charge version. */
4520 clone
= build_clone (fn
, complete_ctor_identifier
);
4521 if (update_method_vec_p
)
4522 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4523 clone
= build_clone (fn
, base_ctor_identifier
);
4524 if (update_method_vec_p
)
4525 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4529 gcc_assert (DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
));
4531 /* For each destructor, we need three variants: an in-charge
4532 version, a not-in-charge version, and an in-charge deleting
4533 version. We clone the deleting version first because that
4534 means it will go second on the TYPE_METHODS list -- and that
4535 corresponds to the correct layout order in the virtual
4538 For a non-virtual destructor, we do not build a deleting
4540 if (DECL_VIRTUAL_P (fn
))
4542 clone
= build_clone (fn
, deleting_dtor_identifier
);
4543 if (update_method_vec_p
)
4544 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4546 clone
= build_clone (fn
, complete_dtor_identifier
);
4547 if (update_method_vec_p
)
4548 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4549 clone
= build_clone (fn
, base_dtor_identifier
);
4550 if (update_method_vec_p
)
4551 add_method (DECL_CONTEXT (clone
), clone
, NULL_TREE
);
4554 /* Note that this is an abstract function that is never emitted. */
4555 DECL_ABSTRACT (fn
) = 1;
4558 /* DECL is an in charge constructor, which is being defined. This will
4559 have had an in class declaration, from whence clones were
4560 declared. An out-of-class definition can specify additional default
4561 arguments. As it is the clones that are involved in overload
4562 resolution, we must propagate the information from the DECL to its
4566 adjust_clone_args (tree decl
)
4570 for (clone
= DECL_CHAIN (decl
); clone
&& DECL_CLONED_FUNCTION_P (clone
);
4571 clone
= DECL_CHAIN (clone
))
4573 tree orig_clone_parms
= TYPE_ARG_TYPES (TREE_TYPE (clone
));
4574 tree orig_decl_parms
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
4575 tree decl_parms
, clone_parms
;
4577 clone_parms
= orig_clone_parms
;
4579 /* Skip the 'this' parameter. */
4580 orig_clone_parms
= TREE_CHAIN (orig_clone_parms
);
4581 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4583 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
4584 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4585 if (DECL_HAS_VTT_PARM_P (decl
))
4586 orig_decl_parms
= TREE_CHAIN (orig_decl_parms
);
4588 clone_parms
= orig_clone_parms
;
4589 if (DECL_HAS_VTT_PARM_P (clone
))
4590 clone_parms
= TREE_CHAIN (clone_parms
);
4592 for (decl_parms
= orig_decl_parms
; decl_parms
;
4593 decl_parms
= TREE_CHAIN (decl_parms
),
4594 clone_parms
= TREE_CHAIN (clone_parms
))
4596 gcc_assert (same_type_p (TREE_TYPE (decl_parms
),
4597 TREE_TYPE (clone_parms
)));
4599 if (TREE_PURPOSE (decl_parms
) && !TREE_PURPOSE (clone_parms
))
4601 /* A default parameter has been added. Adjust the
4602 clone's parameters. */
4603 tree exceptions
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (clone
));
4604 tree attrs
= TYPE_ATTRIBUTES (TREE_TYPE (clone
));
4605 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (clone
));
4608 clone_parms
= orig_decl_parms
;
4610 if (DECL_HAS_VTT_PARM_P (clone
))
4612 clone_parms
= tree_cons (TREE_PURPOSE (orig_clone_parms
),
4613 TREE_VALUE (orig_clone_parms
),
4615 TREE_TYPE (clone_parms
) = TREE_TYPE (orig_clone_parms
);
4617 type
= build_method_type_directly (basetype
,
4618 TREE_TYPE (TREE_TYPE (clone
)),
4621 type
= build_exception_variant (type
, exceptions
);
4623 type
= cp_build_type_attribute_variant (type
, attrs
);
4624 TREE_TYPE (clone
) = type
;
4626 clone_parms
= NULL_TREE
;
4630 gcc_assert (!clone_parms
);
4634 /* For each of the constructors and destructors in T, create an
4635 in-charge and not-in-charge variant. */
4638 clone_constructors_and_destructors (tree t
)
4642 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4644 if (!CLASSTYPE_METHOD_VEC (t
))
4647 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4648 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4649 for (fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4650 clone_function_decl (OVL_CURRENT (fns
), /*update_method_vec_p=*/1);
4653 /* Deduce noexcept for a destructor DTOR. */
4656 deduce_noexcept_on_destructor (tree dtor
)
4658 if (!TYPE_RAISES_EXCEPTIONS (TREE_TYPE (dtor
)))
4660 tree ctx
= DECL_CONTEXT (dtor
);
4661 tree implicit_fn
= implicitly_declare_fn (sfk_destructor
, ctx
,
4664 tree eh_spec
= TYPE_RAISES_EXCEPTIONS (TREE_TYPE (implicit_fn
));
4665 TREE_TYPE (dtor
) = build_exception_variant (TREE_TYPE (dtor
), eh_spec
);
4669 /* For each destructor in T, deduce noexcept:
4671 12.4/3: A declaration of a destructor that does not have an
4672 exception-specification is implicitly considered to have the
4673 same exception-specification as an implicit declaration (15.4). */
4676 deduce_noexcept_on_destructors (tree t
)
4678 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4680 if (!CLASSTYPE_METHOD_VEC (t
))
4683 for (tree fns
= CLASSTYPE_DESTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4684 deduce_noexcept_on_destructor (OVL_CURRENT (fns
));
4687 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4688 of TYPE for virtual functions which FNDECL overrides. Return a
4689 mask of the tm attributes found therein. */
4692 look_for_tm_attr_overrides (tree type
, tree fndecl
)
4694 tree binfo
= TYPE_BINFO (type
);
4698 for (ix
= 0; BINFO_BASE_ITERATE (binfo
, ix
, base_binfo
); ++ix
)
4700 tree o
, basetype
= BINFO_TYPE (base_binfo
);
4702 if (!TYPE_POLYMORPHIC_P (basetype
))
4705 o
= look_for_overrides_here (basetype
, fndecl
);
4707 found
|= tm_attr_to_mask (find_tm_attribute
4708 (TYPE_ATTRIBUTES (TREE_TYPE (o
))));
4710 found
|= look_for_tm_attr_overrides (basetype
, fndecl
);
4716 /* Subroutine of set_method_tm_attributes. Handle the checks and
4717 inheritance for one virtual method FNDECL. */
4720 set_one_vmethod_tm_attributes (tree type
, tree fndecl
)
4725 found
= look_for_tm_attr_overrides (type
, fndecl
);
4727 /* If FNDECL doesn't actually override anything (i.e. T is the
4728 class that first declares FNDECL virtual), then we're done. */
4732 tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
)));
4733 have
= tm_attr_to_mask (tm_attr
);
4735 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4736 tm_pure must match exactly, otherwise no weakening of
4737 tm_safe > tm_callable > nothing. */
4738 /* ??? The tm_pure attribute didn't make the transition to the
4739 multivendor language spec. */
4740 if (have
== TM_ATTR_PURE
)
4742 if (found
!= TM_ATTR_PURE
)
4748 /* If the overridden function is tm_pure, then FNDECL must be. */
4749 else if (found
== TM_ATTR_PURE
&& tm_attr
)
4751 /* Look for base class combinations that cannot be satisfied. */
4752 else if (found
!= TM_ATTR_PURE
&& (found
& TM_ATTR_PURE
))
4754 found
&= ~TM_ATTR_PURE
;
4756 error_at (DECL_SOURCE_LOCATION (fndecl
),
4757 "method overrides both %<transaction_pure%> and %qE methods",
4758 tm_mask_to_attr (found
));
4760 /* If FNDECL did not declare an attribute, then inherit the most
4762 else if (tm_attr
== NULL
)
4764 apply_tm_attr (fndecl
, tm_mask_to_attr (found
& -found
));
4766 /* Otherwise validate that we're not weaker than a function
4767 that is being overridden. */
4771 if (found
<= TM_ATTR_CALLABLE
&& have
> found
)
4777 error_at (DECL_SOURCE_LOCATION (fndecl
),
4778 "method declared %qE overriding %qE method",
4779 tm_attr
, tm_mask_to_attr (found
));
4782 /* For each of the methods in T, propagate a class-level tm attribute. */
4785 set_method_tm_attributes (tree t
)
4787 tree class_tm_attr
, fndecl
;
4789 /* Don't bother collecting tm attributes if transactional memory
4790 support is not enabled. */
4794 /* Process virtual methods first, as they inherit directly from the
4795 base virtual function and also require validation of new attributes. */
4796 if (TYPE_CONTAINS_VPTR_P (t
))
4799 for (vchain
= BINFO_VIRTUALS (TYPE_BINFO (t
)); vchain
;
4800 vchain
= TREE_CHAIN (vchain
))
4802 fndecl
= BV_FN (vchain
);
4803 if (DECL_THUNK_P (fndecl
))
4804 fndecl
= THUNK_TARGET (fndecl
);
4805 set_one_vmethod_tm_attributes (t
, fndecl
);
4809 /* If the class doesn't have an attribute, nothing more to do. */
4810 class_tm_attr
= find_tm_attribute (TYPE_ATTRIBUTES (t
));
4811 if (class_tm_attr
== NULL
)
4814 /* Any method that does not yet have a tm attribute inherits
4815 the one from the class. */
4816 for (fndecl
= TYPE_METHODS (t
); fndecl
; fndecl
= TREE_CHAIN (fndecl
))
4818 if (!find_tm_attribute (TYPE_ATTRIBUTES (TREE_TYPE (fndecl
))))
4819 apply_tm_attr (fndecl
, class_tm_attr
);
4823 /* Returns true iff class T has a user-defined constructor other than
4824 the default constructor. */
4827 type_has_user_nondefault_constructor (tree t
)
4831 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4834 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4836 tree fn
= OVL_CURRENT (fns
);
4837 if (!DECL_ARTIFICIAL (fn
)
4838 && (TREE_CODE (fn
) == TEMPLATE_DECL
4839 || (skip_artificial_parms_for (fn
, DECL_ARGUMENTS (fn
))
4847 /* Returns the defaulted constructor if T has one. Otherwise, returns
4851 in_class_defaulted_default_constructor (tree t
)
4855 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4858 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4860 tree fn
= OVL_CURRENT (fns
);
4862 if (DECL_DEFAULTED_IN_CLASS_P (fn
))
4864 args
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
4865 while (args
&& TREE_PURPOSE (args
))
4866 args
= TREE_CHAIN (args
);
4867 if (!args
|| args
== void_list_node
)
4875 /* Returns true iff FN is a user-provided function, i.e. user-declared
4876 and not defaulted at its first declaration; or explicit, private,
4877 protected, or non-const. */
4880 user_provided_p (tree fn
)
4882 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4885 return (!DECL_ARTIFICIAL (fn
)
4886 && !(DECL_INITIALIZED_IN_CLASS_P (fn
)
4887 && (DECL_DEFAULTED_FN (fn
) || DECL_DELETED_FN (fn
))));
4890 /* Returns true iff class T has a user-provided constructor. */
4893 type_has_user_provided_constructor (tree t
)
4897 if (!CLASS_TYPE_P (t
))
4900 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4903 /* This can happen in error cases; avoid crashing. */
4904 if (!CLASSTYPE_METHOD_VEC (t
))
4907 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4908 if (user_provided_p (OVL_CURRENT (fns
)))
4914 /* Returns true iff class T has a user-provided default constructor. */
4917 type_has_user_provided_default_constructor (tree t
)
4921 if (!TYPE_HAS_USER_CONSTRUCTOR (t
))
4924 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
4926 tree fn
= OVL_CURRENT (fns
);
4927 if (TREE_CODE (fn
) == FUNCTION_DECL
4928 && user_provided_p (fn
)
4929 && sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (fn
)))
4936 /* TYPE is being used as a virtual base, and has a non-trivial move
4937 assignment. Return true if this is due to there being a user-provided
4938 move assignment in TYPE or one of its subobjects; if there isn't, then
4939 multiple move assignment can't cause any harm. */
4942 vbase_has_user_provided_move_assign (tree type
)
4944 /* Does the type itself have a user-provided move assignment operator? */
4946 = lookup_fnfields_slot_nolazy (type
, ansi_assopname (NOP_EXPR
));
4947 fns
; fns
= OVL_NEXT (fns
))
4949 tree fn
= OVL_CURRENT (fns
);
4950 if (move_fn_p (fn
) && user_provided_p (fn
))
4954 /* Do any of its bases? */
4955 tree binfo
= TYPE_BINFO (type
);
4957 for (int i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
4958 if (vbase_has_user_provided_move_assign (BINFO_TYPE (base_binfo
)))
4961 /* Or non-static data members? */
4962 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4964 if (TREE_CODE (field
) == FIELD_DECL
4965 && CLASS_TYPE_P (TREE_TYPE (field
))
4966 && vbase_has_user_provided_move_assign (TREE_TYPE (field
)))
4974 /* If default-initialization leaves part of TYPE uninitialized, returns
4975 a DECL for the field or TYPE itself (DR 253). */
4978 default_init_uninitialized_part (tree type
)
4983 type
= strip_array_types (type
);
4984 if (!CLASS_TYPE_P (type
))
4986 if (type_has_user_provided_default_constructor (type
))
4988 for (binfo
= TYPE_BINFO (type
), i
= 0;
4989 BINFO_BASE_ITERATE (binfo
, i
, t
); ++i
)
4991 r
= default_init_uninitialized_part (BINFO_TYPE (t
));
4995 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
4996 if (TREE_CODE (t
) == FIELD_DECL
4997 && !DECL_ARTIFICIAL (t
)
4998 && !DECL_INITIAL (t
))
5000 r
= default_init_uninitialized_part (TREE_TYPE (t
));
5002 return DECL_P (r
) ? r
: t
;
5008 /* Returns true iff for class T, a trivial synthesized default constructor
5009 would be constexpr. */
5012 trivial_default_constructor_is_constexpr (tree t
)
5014 /* A defaulted trivial default constructor is constexpr
5015 if there is nothing to initialize. */
5016 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (t
));
5017 return is_really_empty_class (t
);
5020 /* Returns true iff class T has a constexpr default constructor. */
5023 type_has_constexpr_default_constructor (tree t
)
5027 if (!CLASS_TYPE_P (t
))
5029 /* The caller should have stripped an enclosing array. */
5030 gcc_assert (TREE_CODE (t
) != ARRAY_TYPE
);
5033 if (CLASSTYPE_LAZY_DEFAULT_CTOR (t
))
5035 if (!TYPE_HAS_COMPLEX_DFLT (t
))
5036 return trivial_default_constructor_is_constexpr (t
);
5037 /* Non-trivial, we need to check subobject constructors. */
5038 lazily_declare_fn (sfk_constructor
, t
);
5040 fns
= locate_ctor (t
);
5041 return (fns
&& DECL_DECLARED_CONSTEXPR_P (fns
));
5044 /* Returns true iff class TYPE has a virtual destructor. */
5047 type_has_virtual_destructor (tree type
)
5051 if (!CLASS_TYPE_P (type
))
5054 gcc_assert (COMPLETE_TYPE_P (type
));
5055 dtor
= CLASSTYPE_DESTRUCTORS (type
);
5056 return (dtor
&& DECL_VIRTUAL_P (dtor
));
5059 /* Returns true iff class T has a move constructor. */
5062 type_has_move_constructor (tree t
)
5066 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5068 gcc_assert (COMPLETE_TYPE_P (t
));
5069 lazily_declare_fn (sfk_move_constructor
, t
);
5072 if (!CLASSTYPE_METHOD_VEC (t
))
5075 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5076 if (move_fn_p (OVL_CURRENT (fns
)))
5082 /* Returns true iff class T has a move assignment operator. */
5085 type_has_move_assign (tree t
)
5089 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5091 gcc_assert (COMPLETE_TYPE_P (t
));
5092 lazily_declare_fn (sfk_move_assignment
, t
);
5095 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5096 fns
; fns
= OVL_NEXT (fns
))
5097 if (move_fn_p (OVL_CURRENT (fns
)))
5103 /* Returns true iff class T has a move constructor that was explicitly
5104 declared in the class body. Note that this is different from
5105 "user-provided", which doesn't include functions that are defaulted in
5109 type_has_user_declared_move_constructor (tree t
)
5113 if (CLASSTYPE_LAZY_MOVE_CTOR (t
))
5116 if (!CLASSTYPE_METHOD_VEC (t
))
5119 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5121 tree fn
= OVL_CURRENT (fns
);
5122 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5129 /* Returns true iff class T has a move assignment operator that was
5130 explicitly declared in the class body. */
5133 type_has_user_declared_move_assign (tree t
)
5137 if (CLASSTYPE_LAZY_MOVE_ASSIGN (t
))
5140 for (fns
= lookup_fnfields_slot_nolazy (t
, ansi_assopname (NOP_EXPR
));
5141 fns
; fns
= OVL_NEXT (fns
))
5143 tree fn
= OVL_CURRENT (fns
);
5144 if (move_fn_p (fn
) && !DECL_ARTIFICIAL (fn
))
5151 /* Nonzero if we need to build up a constructor call when initializing an
5152 object of this class, either because it has a user-declared constructor
5153 or because it doesn't have a default constructor (so we need to give an
5154 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5155 what you care about is whether or not an object can be produced by a
5156 constructor (e.g. so we don't set TREE_READONLY on const variables of
5157 such type); use this function when what you care about is whether or not
5158 to try to call a constructor to create an object. The latter case is
5159 the former plus some cases of constructors that cannot be called. */
5162 type_build_ctor_call (tree t
)
5165 if (TYPE_NEEDS_CONSTRUCTING (t
))
5167 inner
= strip_array_types (t
);
5168 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
))
5170 if (!TYPE_HAS_DEFAULT_CONSTRUCTOR (inner
))
5172 if (cxx_dialect
< cxx11
)
5174 /* A user-declared constructor might be private, and a constructor might
5175 be trivial but deleted. */
5176 for (tree fns
= lookup_fnfields_slot (inner
, complete_ctor_identifier
);
5177 fns
; fns
= OVL_NEXT (fns
))
5179 tree fn
= OVL_CURRENT (fns
);
5180 if (!DECL_ARTIFICIAL (fn
)
5181 || DECL_DELETED_FN (fn
))
5187 /* Like type_build_ctor_call, but for destructors. */
5190 type_build_dtor_call (tree t
)
5193 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5195 inner
= strip_array_types (t
);
5196 if (!CLASS_TYPE_P (inner
) || ANON_AGGR_TYPE_P (inner
)
5197 || !COMPLETE_TYPE_P (inner
))
5199 if (cxx_dialect
< cxx11
)
5201 /* A user-declared destructor might be private, and a destructor might
5202 be trivial but deleted. */
5203 for (tree fns
= lookup_fnfields_slot (inner
, complete_dtor_identifier
);
5204 fns
; fns
= OVL_NEXT (fns
))
5206 tree fn
= OVL_CURRENT (fns
);
5207 if (!DECL_ARTIFICIAL (fn
)
5208 || DECL_DELETED_FN (fn
))
5214 /* Remove all zero-width bit-fields from T. */
5217 remove_zero_width_bit_fields (tree t
)
5221 fieldsp
= &TYPE_FIELDS (t
);
5224 if (TREE_CODE (*fieldsp
) == FIELD_DECL
5225 && DECL_C_BIT_FIELD (*fieldsp
)
5226 /* We should not be confused by the fact that grokbitfield
5227 temporarily sets the width of the bit field into
5228 DECL_INITIAL (*fieldsp).
5229 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5231 && integer_zerop (DECL_SIZE (*fieldsp
)))
5232 *fieldsp
= DECL_CHAIN (*fieldsp
);
5234 fieldsp
= &DECL_CHAIN (*fieldsp
);
5238 /* Returns TRUE iff we need a cookie when dynamically allocating an
5239 array whose elements have the indicated class TYPE. */
5242 type_requires_array_cookie (tree type
)
5245 bool has_two_argument_delete_p
= false;
5247 gcc_assert (CLASS_TYPE_P (type
));
5249 /* If there's a non-trivial destructor, we need a cookie. In order
5250 to iterate through the array calling the destructor for each
5251 element, we'll have to know how many elements there are. */
5252 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
5255 /* If the usual deallocation function is a two-argument whose second
5256 argument is of type `size_t', then we have to pass the size of
5257 the array to the deallocation function, so we will need to store
5259 fns
= lookup_fnfields (TYPE_BINFO (type
),
5260 ansi_opname (VEC_DELETE_EXPR
),
5262 /* If there are no `operator []' members, or the lookup is
5263 ambiguous, then we don't need a cookie. */
5264 if (!fns
|| fns
== error_mark_node
)
5266 /* Loop through all of the functions. */
5267 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
5272 /* Select the current function. */
5273 fn
= OVL_CURRENT (fns
);
5274 /* See if this function is a one-argument delete function. If
5275 it is, then it will be the usual deallocation function. */
5276 second_parm
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5277 if (second_parm
== void_list_node
)
5279 /* Do not consider this function if its second argument is an
5283 /* Otherwise, if we have a two-argument function and the second
5284 argument is `size_t', it will be the usual deallocation
5285 function -- unless there is one-argument function, too. */
5286 if (TREE_CHAIN (second_parm
) == void_list_node
5287 && same_type_p (TREE_VALUE (second_parm
), size_type_node
))
5288 has_two_argument_delete_p
= true;
5291 return has_two_argument_delete_p
;
5294 /* Finish computing the `literal type' property of class type T.
5296 At this point, we have already processed base classes and
5297 non-static data members. We need to check whether the copy
5298 constructor is trivial, the destructor is trivial, and there
5299 is a trivial default constructor or at least one constexpr
5300 constructor other than the copy constructor. */
5303 finalize_literal_type_property (tree t
)
5307 if (cxx_dialect
< cxx11
5308 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5309 CLASSTYPE_LITERAL_P (t
) = false;
5310 else if (CLASSTYPE_LITERAL_P (t
) && !TYPE_HAS_TRIVIAL_DFLT (t
)
5311 && CLASSTYPE_NON_AGGREGATE (t
)
5312 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5313 CLASSTYPE_LITERAL_P (t
) = false;
5315 if (!CLASSTYPE_LITERAL_P (t
))
5316 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5317 if (DECL_DECLARED_CONSTEXPR_P (fn
)
5318 && TREE_CODE (fn
) != TEMPLATE_DECL
5319 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
5320 && !DECL_CONSTRUCTOR_P (fn
))
5322 DECL_DECLARED_CONSTEXPR_P (fn
) = false;
5323 if (!DECL_GENERATED_P (fn
))
5325 error ("enclosing class of constexpr non-static member "
5326 "function %q+#D is not a literal type", fn
);
5327 explain_non_literal_class (t
);
5332 /* T is a non-literal type used in a context which requires a constant
5333 expression. Explain why it isn't literal. */
5336 explain_non_literal_class (tree t
)
5338 static struct pointer_set_t
*diagnosed
;
5340 if (!CLASS_TYPE_P (t
))
5342 t
= TYPE_MAIN_VARIANT (t
);
5344 if (diagnosed
== NULL
)
5345 diagnosed
= pointer_set_create ();
5346 if (pointer_set_insert (diagnosed
, t
) != 0)
5347 /* Already explained. */
5350 inform (0, "%q+T is not literal because:", t
);
5351 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
))
5352 inform (0, " %q+T has a non-trivial destructor", t
);
5353 else if (CLASSTYPE_NON_AGGREGATE (t
)
5354 && !TYPE_HAS_TRIVIAL_DFLT (t
)
5355 && !TYPE_HAS_CONSTEXPR_CTOR (t
))
5357 inform (0, " %q+T is not an aggregate, does not have a trivial "
5358 "default constructor, and has no constexpr constructor that "
5359 "is not a copy or move constructor", t
);
5360 if (TYPE_HAS_DEFAULT_CONSTRUCTOR (t
)
5361 && !type_has_user_provided_default_constructor (t
))
5363 /* Note that we can't simply call locate_ctor because when the
5364 constructor is deleted it just returns NULL_TREE. */
5366 for (fns
= CLASSTYPE_CONSTRUCTORS (t
); fns
; fns
= OVL_NEXT (fns
))
5368 tree fn
= OVL_CURRENT (fns
);
5369 tree parms
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5371 parms
= skip_artificial_parms_for (fn
, parms
);
5373 if (sufficient_parms_p (parms
))
5375 if (DECL_DELETED_FN (fn
))
5376 maybe_explain_implicit_delete (fn
);
5378 explain_invalid_constexpr_fn (fn
);
5386 tree binfo
, base_binfo
, field
; int i
;
5387 for (binfo
= TYPE_BINFO (t
), i
= 0;
5388 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
5390 tree basetype
= TREE_TYPE (base_binfo
);
5391 if (!CLASSTYPE_LITERAL_P (basetype
))
5393 inform (0, " base class %qT of %q+T is non-literal",
5395 explain_non_literal_class (basetype
);
5399 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
5402 if (TREE_CODE (field
) != FIELD_DECL
)
5404 ftype
= TREE_TYPE (field
);
5405 if (!literal_type_p (ftype
))
5407 inform (0, " non-static data member %q+D has "
5408 "non-literal type", field
);
5409 if (CLASS_TYPE_P (ftype
))
5410 explain_non_literal_class (ftype
);
5416 /* Check the validity of the bases and members declared in T. Add any
5417 implicitly-generated functions (like copy-constructors and
5418 assignment operators). Compute various flag bits (like
5419 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5420 level: i.e., independently of the ABI in use. */
5423 check_bases_and_members (tree t
)
5425 /* Nonzero if the implicitly generated copy constructor should take
5426 a non-const reference argument. */
5427 int cant_have_const_ctor
;
5428 /* Nonzero if the implicitly generated assignment operator
5429 should take a non-const reference argument. */
5430 int no_const_asn_ref
;
5432 bool saved_complex_asn_ref
;
5433 bool saved_nontrivial_dtor
;
5436 /* By default, we use const reference arguments and generate default
5438 cant_have_const_ctor
= 0;
5439 no_const_asn_ref
= 0;
5441 /* Check all the base-classes. */
5442 check_bases (t
, &cant_have_const_ctor
,
5445 /* Deduce noexcept on destructors. This needs to happen after we've set
5446 triviality flags appropriately for our bases. */
5447 if (cxx_dialect
>= cxx11
)
5448 deduce_noexcept_on_destructors (t
);
5450 /* Check all the method declarations. */
5453 /* Save the initial values of these flags which only indicate whether
5454 or not the class has user-provided functions. As we analyze the
5455 bases and members we can set these flags for other reasons. */
5456 saved_complex_asn_ref
= TYPE_HAS_COMPLEX_COPY_ASSIGN (t
);
5457 saved_nontrivial_dtor
= TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
);
5459 /* Check all the data member declarations. We cannot call
5460 check_field_decls until we have called check_bases check_methods,
5461 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5462 being set appropriately. */
5463 check_field_decls (t
, &access_decls
,
5464 &cant_have_const_ctor
,
5467 /* A nearly-empty class has to be vptr-containing; a nearly empty
5468 class contains just a vptr. */
5469 if (!TYPE_CONTAINS_VPTR_P (t
))
5470 CLASSTYPE_NEARLY_EMPTY_P (t
) = 0;
5472 /* Do some bookkeeping that will guide the generation of implicitly
5473 declared member functions. */
5474 TYPE_HAS_COMPLEX_COPY_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5475 TYPE_HAS_COMPLEX_MOVE_CTOR (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5476 /* We need to call a constructor for this class if it has a
5477 user-provided constructor, or if the default constructor is going
5478 to initialize the vptr. (This is not an if-and-only-if;
5479 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5480 themselves need constructing.) */
5481 TYPE_NEEDS_CONSTRUCTING (t
)
5482 |= (type_has_user_provided_constructor (t
) || TYPE_CONTAINS_VPTR_P (t
));
5485 An aggregate is an array or a class with no user-provided
5486 constructors ... and no virtual functions.
5488 Again, other conditions for being an aggregate are checked
5490 CLASSTYPE_NON_AGGREGATE (t
)
5491 |= (type_has_user_provided_constructor (t
) || TYPE_POLYMORPHIC_P (t
));
5492 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5493 retain the old definition internally for ABI reasons. */
5494 CLASSTYPE_NON_LAYOUT_POD_P (t
)
5495 |= (CLASSTYPE_NON_AGGREGATE (t
)
5496 || saved_nontrivial_dtor
|| saved_complex_asn_ref
);
5497 CLASSTYPE_NON_STD_LAYOUT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5498 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5499 TYPE_HAS_COMPLEX_MOVE_ASSIGN (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5500 TYPE_HAS_COMPLEX_DFLT (t
) |= TYPE_CONTAINS_VPTR_P (t
);
5502 /* If the class has no user-declared constructor, but does have
5503 non-static const or reference data members that can never be
5504 initialized, issue a warning. */
5505 if (warn_uninitialized
5506 /* Classes with user-declared constructors are presumed to
5507 initialize these members. */
5508 && !TYPE_HAS_USER_CONSTRUCTOR (t
)
5509 /* Aggregates can be initialized with brace-enclosed
5511 && CLASSTYPE_NON_AGGREGATE (t
))
5515 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
5519 if (TREE_CODE (field
) != FIELD_DECL
5520 || DECL_INITIAL (field
) != NULL_TREE
)
5523 type
= TREE_TYPE (field
);
5524 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5525 warning (OPT_Wuninitialized
, "non-static reference %q+#D "
5526 "in class without a constructor", field
);
5527 else if (CP_TYPE_CONST_P (type
)
5528 && (!CLASS_TYPE_P (type
)
5529 || !TYPE_HAS_DEFAULT_CONSTRUCTOR (type
)))
5530 warning (OPT_Wuninitialized
, "non-static const member %q+#D "
5531 "in class without a constructor", field
);
5535 /* Synthesize any needed methods. */
5536 add_implicitly_declared_members (t
, &access_decls
,
5537 cant_have_const_ctor
,
5540 /* Check defaulted declarations here so we have cant_have_const_ctor
5541 and don't need to worry about clones. */
5542 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5543 if (!DECL_ARTIFICIAL (fn
) && DECL_DEFAULTED_IN_CLASS_P (fn
))
5545 int copy
= copy_fn_p (fn
);
5549 = (DECL_CONSTRUCTOR_P (fn
) ? !cant_have_const_ctor
5550 : !no_const_asn_ref
);
5551 bool fn_const_p
= (copy
== 2);
5553 if (fn_const_p
&& !imp_const_p
)
5554 /* If the function is defaulted outside the class, we just
5555 give the synthesis error. */
5556 error ("%q+D declared to take const reference, but implicit "
5557 "declaration would take non-const", fn
);
5559 defaulted_late_check (fn
);
5562 if (LAMBDA_TYPE_P (t
))
5564 /* "The closure type associated with a lambda-expression has a deleted
5565 default constructor and a deleted copy assignment operator." */
5566 TYPE_NEEDS_CONSTRUCTING (t
) = 1;
5567 TYPE_HAS_COMPLEX_DFLT (t
) = 1;
5568 TYPE_HAS_COMPLEX_COPY_ASSIGN (t
) = 1;
5569 CLASSTYPE_LAZY_MOVE_ASSIGN (t
) = 0;
5571 /* "This class type is not an aggregate." */
5572 CLASSTYPE_NON_AGGREGATE (t
) = 1;
5575 /* Compute the 'literal type' property before we
5576 do anything with non-static member functions. */
5577 finalize_literal_type_property (t
);
5579 /* Create the in-charge and not-in-charge variants of constructors
5581 clone_constructors_and_destructors (t
);
5583 /* Process the using-declarations. */
5584 for (; access_decls
; access_decls
= TREE_CHAIN (access_decls
))
5585 handle_using_decl (TREE_VALUE (access_decls
), t
);
5587 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5588 finish_struct_methods (t
);
5590 /* Figure out whether or not we will need a cookie when dynamically
5591 allocating an array of this type. */
5592 TYPE_LANG_SPECIFIC (t
)->u
.c
.vec_new_uses_cookie
5593 = type_requires_array_cookie (t
);
5596 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5597 accordingly. If a new vfield was created (because T doesn't have a
5598 primary base class), then the newly created field is returned. It
5599 is not added to the TYPE_FIELDS list; it is the caller's
5600 responsibility to do that. Accumulate declared virtual functions
5604 create_vtable_ptr (tree t
, tree
* virtuals_p
)
5608 /* Collect the virtual functions declared in T. */
5609 for (fn
= TYPE_METHODS (t
); fn
; fn
= DECL_CHAIN (fn
))
5610 if (DECL_VINDEX (fn
) && !DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (fn
)
5611 && TREE_CODE (DECL_VINDEX (fn
)) != INTEGER_CST
)
5613 tree new_virtual
= make_node (TREE_LIST
);
5615 BV_FN (new_virtual
) = fn
;
5616 BV_DELTA (new_virtual
) = integer_zero_node
;
5617 BV_VCALL_INDEX (new_virtual
) = NULL_TREE
;
5619 TREE_CHAIN (new_virtual
) = *virtuals_p
;
5620 *virtuals_p
= new_virtual
;
5623 /* If we couldn't find an appropriate base class, create a new field
5624 here. Even if there weren't any new virtual functions, we might need a
5625 new virtual function table if we're supposed to include vptrs in
5626 all classes that need them. */
5627 if (!TYPE_VFIELD (t
) && (*virtuals_p
|| TYPE_CONTAINS_VPTR_P (t
)))
5629 /* We build this decl with vtbl_ptr_type_node, which is a
5630 `vtable_entry_type*'. It might seem more precise to use
5631 `vtable_entry_type (*)[N]' where N is the number of virtual
5632 functions. However, that would require the vtable pointer in
5633 base classes to have a different type than the vtable pointer
5634 in derived classes. We could make that happen, but that
5635 still wouldn't solve all the problems. In particular, the
5636 type-based alias analysis code would decide that assignments
5637 to the base class vtable pointer can't alias assignments to
5638 the derived class vtable pointer, since they have different
5639 types. Thus, in a derived class destructor, where the base
5640 class constructor was inlined, we could generate bad code for
5641 setting up the vtable pointer.
5643 Therefore, we use one type for all vtable pointers. We still
5644 use a type-correct type; it's just doesn't indicate the array
5645 bounds. That's better than using `void*' or some such; it's
5646 cleaner, and it let's the alias analysis code know that these
5647 stores cannot alias stores to void*! */
5650 field
= build_decl (input_location
,
5651 FIELD_DECL
, get_vfield_name (t
), vtbl_ptr_type_node
);
5652 DECL_VIRTUAL_P (field
) = 1;
5653 DECL_ARTIFICIAL (field
) = 1;
5654 DECL_FIELD_CONTEXT (field
) = t
;
5655 DECL_FCONTEXT (field
) = t
;
5656 if (TYPE_PACKED (t
))
5657 DECL_PACKED (field
) = 1;
5659 TYPE_VFIELD (t
) = field
;
5661 /* This class is non-empty. */
5662 CLASSTYPE_EMPTY_P (t
) = 0;
5670 /* Add OFFSET to all base types of BINFO which is a base in the
5671 hierarchy dominated by T.
5673 OFFSET, which is a type offset, is number of bytes. */
5676 propagate_binfo_offsets (tree binfo
, tree offset
)
5682 /* Update BINFO's offset. */
5683 BINFO_OFFSET (binfo
)
5684 = convert (sizetype
,
5685 size_binop (PLUS_EXPR
,
5686 convert (ssizetype
, BINFO_OFFSET (binfo
)),
5689 /* Find the primary base class. */
5690 primary_binfo
= get_primary_binfo (binfo
);
5692 if (primary_binfo
&& BINFO_INHERITANCE_CHAIN (primary_binfo
) == binfo
)
5693 propagate_binfo_offsets (primary_binfo
, offset
);
5695 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5697 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5699 /* Don't do the primary base twice. */
5700 if (base_binfo
== primary_binfo
)
5703 if (BINFO_VIRTUAL_P (base_binfo
))
5706 propagate_binfo_offsets (base_binfo
, offset
);
5710 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5711 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5712 empty subobjects of T. */
5715 layout_virtual_bases (record_layout_info rli
, splay_tree offsets
)
5719 bool first_vbase
= true;
5722 if (BINFO_N_BASE_BINFOS (TYPE_BINFO (t
)) == 0)
5725 if (!abi_version_at_least(2))
5727 /* In G++ 3.2, we incorrectly rounded the size before laying out
5728 the virtual bases. */
5729 finish_record_layout (rli
, /*free_p=*/false);
5730 #ifdef STRUCTURE_SIZE_BOUNDARY
5731 /* Packed structures don't need to have minimum size. */
5732 if (! TYPE_PACKED (t
))
5733 TYPE_ALIGN (t
) = MAX (TYPE_ALIGN (t
), (unsigned) STRUCTURE_SIZE_BOUNDARY
);
5735 rli
->offset
= TYPE_SIZE_UNIT (t
);
5736 rli
->bitpos
= bitsize_zero_node
;
5737 rli
->record_align
= TYPE_ALIGN (t
);
5740 /* Find the last field. The artificial fields created for virtual
5741 bases will go after the last extant field to date. */
5742 next_field
= &TYPE_FIELDS (t
);
5744 next_field
= &DECL_CHAIN (*next_field
);
5746 /* Go through the virtual bases, allocating space for each virtual
5747 base that is not already a primary base class. These are
5748 allocated in inheritance graph order. */
5749 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
5751 if (!BINFO_VIRTUAL_P (vbase
))
5754 if (!BINFO_PRIMARY_P (vbase
))
5756 tree basetype
= TREE_TYPE (vbase
);
5758 /* This virtual base is not a primary base of any class in the
5759 hierarchy, so we have to add space for it. */
5760 next_field
= build_base_field (rli
, vbase
,
5761 offsets
, next_field
);
5763 /* If the first virtual base might have been placed at a
5764 lower address, had we started from CLASSTYPE_SIZE, rather
5765 than TYPE_SIZE, issue a warning. There can be both false
5766 positives and false negatives from this warning in rare
5767 cases; to deal with all the possibilities would probably
5768 require performing both layout algorithms and comparing
5769 the results which is not particularly tractable. */
5773 (size_binop (CEIL_DIV_EXPR
,
5774 round_up_loc (input_location
,
5776 CLASSTYPE_ALIGN (basetype
)),
5778 BINFO_OFFSET (vbase
))))
5780 "offset of virtual base %qT is not ABI-compliant and "
5781 "may change in a future version of GCC",
5784 first_vbase
= false;
5789 /* Returns the offset of the byte just past the end of the base class
5793 end_of_base (tree binfo
)
5797 if (!CLASSTYPE_AS_BASE (BINFO_TYPE (binfo
)))
5798 size
= TYPE_SIZE_UNIT (char_type_node
);
5799 else if (is_empty_class (BINFO_TYPE (binfo
)))
5800 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5801 allocate some space for it. It cannot have virtual bases, so
5802 TYPE_SIZE_UNIT is fine. */
5803 size
= TYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5805 size
= CLASSTYPE_SIZE_UNIT (BINFO_TYPE (binfo
));
5807 return size_binop (PLUS_EXPR
, BINFO_OFFSET (binfo
), size
);
5810 /* Returns the offset of the byte just past the end of the base class
5811 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5812 only non-virtual bases are included. */
5815 end_of_class (tree t
, int include_virtuals_p
)
5817 tree result
= size_zero_node
;
5818 vec
<tree
, va_gc
> *vbases
;
5824 for (binfo
= TYPE_BINFO (t
), i
= 0;
5825 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5827 if (!include_virtuals_p
5828 && BINFO_VIRTUAL_P (base_binfo
)
5829 && (!BINFO_PRIMARY_P (base_binfo
)
5830 || BINFO_INHERITANCE_CHAIN (base_binfo
) != TYPE_BINFO (t
)))
5833 offset
= end_of_base (base_binfo
);
5834 if (INT_CST_LT_UNSIGNED (result
, offset
))
5838 /* G++ 3.2 did not check indirect virtual bases. */
5839 if (abi_version_at_least (2) && include_virtuals_p
)
5840 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5841 vec_safe_iterate (vbases
, i
, &base_binfo
); i
++)
5843 offset
= end_of_base (base_binfo
);
5844 if (INT_CST_LT_UNSIGNED (result
, offset
))
5851 /* Warn about bases of T that are inaccessible because they are
5852 ambiguous. For example:
5855 struct T : public S {};
5856 struct U : public S, public T {};
5858 Here, `(S*) new U' is not allowed because there are two `S'
5862 warn_about_ambiguous_bases (tree t
)
5865 vec
<tree
, va_gc
> *vbases
;
5870 /* If there are no repeated bases, nothing can be ambiguous. */
5871 if (!CLASSTYPE_REPEATED_BASE_P (t
))
5874 /* Check direct bases. */
5875 for (binfo
= TYPE_BINFO (t
), i
= 0;
5876 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
5878 basetype
= BINFO_TYPE (base_binfo
);
5880 if (!uniquely_derived_from_p (basetype
, t
))
5881 warning (0, "direct base %qT inaccessible in %qT due to ambiguity",
5885 /* Check for ambiguous virtual bases. */
5887 for (vbases
= CLASSTYPE_VBASECLASSES (t
), i
= 0;
5888 vec_safe_iterate (vbases
, i
, &binfo
); i
++)
5890 basetype
= BINFO_TYPE (binfo
);
5892 if (!uniquely_derived_from_p (basetype
, t
))
5893 warning (OPT_Wextra
, "virtual base %qT inaccessible in %qT due "
5894 "to ambiguity", basetype
, t
);
5898 /* Compare two INTEGER_CSTs K1 and K2. */
5901 splay_tree_compare_integer_csts (splay_tree_key k1
, splay_tree_key k2
)
5903 return tree_int_cst_compare ((tree
) k1
, (tree
) k2
);
5906 /* Increase the size indicated in RLI to account for empty classes
5907 that are "off the end" of the class. */
5910 include_empty_classes (record_layout_info rli
)
5915 /* It might be the case that we grew the class to allocate a
5916 zero-sized base class. That won't be reflected in RLI, yet,
5917 because we are willing to overlay multiple bases at the same
5918 offset. However, now we need to make sure that RLI is big enough
5919 to reflect the entire class. */
5920 eoc
= end_of_class (rli
->t
,
5921 CLASSTYPE_AS_BASE (rli
->t
) != NULL_TREE
);
5922 rli_size
= rli_size_unit_so_far (rli
);
5923 if (TREE_CODE (rli_size
) == INTEGER_CST
5924 && INT_CST_LT_UNSIGNED (rli_size
, eoc
))
5926 if (!abi_version_at_least (2))
5927 /* In version 1 of the ABI, the size of a class that ends with
5928 a bitfield was not rounded up to a whole multiple of a
5929 byte. Because rli_size_unit_so_far returns only the number
5930 of fully allocated bytes, any extra bits were not included
5932 rli
->bitpos
= round_down (rli
->bitpos
, BITS_PER_UNIT
);
5934 /* The size should have been rounded to a whole byte. */
5935 gcc_assert (tree_int_cst_equal
5936 (rli
->bitpos
, round_down (rli
->bitpos
, BITS_PER_UNIT
)));
5938 = size_binop (PLUS_EXPR
,
5940 size_binop (MULT_EXPR
,
5941 convert (bitsizetype
,
5942 size_binop (MINUS_EXPR
,
5944 bitsize_int (BITS_PER_UNIT
)));
5945 normalize_rli (rli
);
5949 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5950 BINFO_OFFSETs for all of the base-classes. Position the vtable
5951 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5954 layout_class_type (tree t
, tree
*virtuals_p
)
5956 tree non_static_data_members
;
5959 record_layout_info rli
;
5960 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5961 types that appear at that offset. */
5962 splay_tree empty_base_offsets
;
5963 /* True if the last field laid out was a bit-field. */
5964 bool last_field_was_bitfield
= false;
5965 /* The location at which the next field should be inserted. */
5967 /* T, as a base class. */
5970 /* Keep track of the first non-static data member. */
5971 non_static_data_members
= TYPE_FIELDS (t
);
5973 /* Start laying out the record. */
5974 rli
= start_record_layout (t
);
5976 /* Mark all the primary bases in the hierarchy. */
5977 determine_primary_bases (t
);
5979 /* Create a pointer to our virtual function table. */
5980 vptr
= create_vtable_ptr (t
, virtuals_p
);
5982 /* The vptr is always the first thing in the class. */
5985 DECL_CHAIN (vptr
) = TYPE_FIELDS (t
);
5986 TYPE_FIELDS (t
) = vptr
;
5987 next_field
= &DECL_CHAIN (vptr
);
5988 place_field (rli
, vptr
);
5991 next_field
= &TYPE_FIELDS (t
);
5993 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5994 empty_base_offsets
= splay_tree_new (splay_tree_compare_integer_csts
,
5996 build_base_fields (rli
, empty_base_offsets
, next_field
);
5998 /* Layout the non-static data members. */
5999 for (field
= non_static_data_members
; field
; field
= DECL_CHAIN (field
))
6004 /* We still pass things that aren't non-static data members to
6005 the back end, in case it wants to do something with them. */
6006 if (TREE_CODE (field
) != FIELD_DECL
)
6008 place_field (rli
, field
);
6009 /* If the static data member has incomplete type, keep track
6010 of it so that it can be completed later. (The handling
6011 of pending statics in finish_record_layout is
6012 insufficient; consider:
6015 struct S2 { static S1 s1; };
6017 At this point, finish_record_layout will be called, but
6018 S1 is still incomplete.) */
6021 maybe_register_incomplete_var (field
);
6022 /* The visibility of static data members is determined
6023 at their point of declaration, not their point of
6025 determine_visibility (field
);
6030 type
= TREE_TYPE (field
);
6031 if (type
== error_mark_node
)
6034 padding
= NULL_TREE
;
6036 /* If this field is a bit-field whose width is greater than its
6037 type, then there are some special rules for allocating
6039 if (DECL_C_BIT_FIELD (field
)
6040 && INT_CST_LT (TYPE_SIZE (type
), DECL_SIZE (field
)))
6044 bool was_unnamed_p
= false;
6045 /* We must allocate the bits as if suitably aligned for the
6046 longest integer type that fits in this many bits. type
6047 of the field. Then, we are supposed to use the left over
6048 bits as additional padding. */
6049 for (itk
= itk_char
; itk
!= itk_none
; ++itk
)
6050 if (integer_types
[itk
] != NULL_TREE
6051 && (INT_CST_LT (size_int (MAX_FIXED_MODE_SIZE
),
6052 TYPE_SIZE (integer_types
[itk
]))
6053 || INT_CST_LT (DECL_SIZE (field
),
6054 TYPE_SIZE (integer_types
[itk
]))))
6057 /* ITK now indicates a type that is too large for the
6058 field. We have to back up by one to find the largest
6063 integer_type
= integer_types
[itk
];
6064 } while (itk
> 0 && integer_type
== NULL_TREE
);
6066 /* Figure out how much additional padding is required. GCC
6067 3.2 always created a padding field, even if it had zero
6069 if (!abi_version_at_least (2)
6070 || INT_CST_LT (TYPE_SIZE (integer_type
), DECL_SIZE (field
)))
6072 if (abi_version_at_least (2) && TREE_CODE (t
) == UNION_TYPE
)
6073 /* In a union, the padding field must have the full width
6074 of the bit-field; all fields start at offset zero. */
6075 padding
= DECL_SIZE (field
);
6078 if (TREE_CODE (t
) == UNION_TYPE
)
6079 warning (OPT_Wabi
, "size assigned to %qT may not be "
6080 "ABI-compliant and may change in a future "
6083 padding
= size_binop (MINUS_EXPR
, DECL_SIZE (field
),
6084 TYPE_SIZE (integer_type
));
6087 #ifdef PCC_BITFIELD_TYPE_MATTERS
6088 /* An unnamed bitfield does not normally affect the
6089 alignment of the containing class on a target where
6090 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6091 make any exceptions for unnamed bitfields when the
6092 bitfields are longer than their types. Therefore, we
6093 temporarily give the field a name. */
6094 if (PCC_BITFIELD_TYPE_MATTERS
&& !DECL_NAME (field
))
6096 was_unnamed_p
= true;
6097 DECL_NAME (field
) = make_anon_name ();
6100 DECL_SIZE (field
) = TYPE_SIZE (integer_type
);
6101 DECL_ALIGN (field
) = TYPE_ALIGN (integer_type
);
6102 DECL_USER_ALIGN (field
) = TYPE_USER_ALIGN (integer_type
);
6103 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6104 empty_base_offsets
);
6106 DECL_NAME (field
) = NULL_TREE
;
6107 /* Now that layout has been performed, set the size of the
6108 field to the size of its declared type; the rest of the
6109 field is effectively invisible. */
6110 DECL_SIZE (field
) = TYPE_SIZE (type
);
6111 /* We must also reset the DECL_MODE of the field. */
6112 if (abi_version_at_least (2))
6113 DECL_MODE (field
) = TYPE_MODE (type
);
6115 && DECL_MODE (field
) != TYPE_MODE (type
))
6116 /* Versions of G++ before G++ 3.4 did not reset the
6119 "the offset of %qD may not be ABI-compliant and may "
6120 "change in a future version of GCC", field
);
6123 layout_nonempty_base_or_field (rli
, field
, NULL_TREE
,
6124 empty_base_offsets
);
6126 /* Remember the location of any empty classes in FIELD. */
6127 if (abi_version_at_least (2))
6128 record_subobject_offsets (TREE_TYPE (field
),
6129 byte_position(field
),
6131 /*is_data_member=*/true);
6133 /* If a bit-field does not immediately follow another bit-field,
6134 and yet it starts in the middle of a byte, we have failed to
6135 comply with the ABI. */
6137 && DECL_C_BIT_FIELD (field
)
6138 /* The TREE_NO_WARNING flag gets set by Objective-C when
6139 laying out an Objective-C class. The ObjC ABI differs
6140 from the C++ ABI, and so we do not want a warning
6142 && !TREE_NO_WARNING (field
)
6143 && !last_field_was_bitfield
6144 && !integer_zerop (size_binop (TRUNC_MOD_EXPR
,
6145 DECL_FIELD_BIT_OFFSET (field
),
6146 bitsize_unit_node
)))
6147 warning (OPT_Wabi
, "offset of %q+D is not ABI-compliant and may "
6148 "change in a future version of GCC", field
);
6150 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6151 offset of the field. */
6153 && !abi_version_at_least (2)
6154 && !tree_int_cst_equal (DECL_FIELD_OFFSET (field
),
6155 byte_position (field
))
6156 && contains_empty_class_p (TREE_TYPE (field
)))
6157 warning (OPT_Wabi
, "%q+D contains empty classes which may cause base "
6158 "classes to be placed at different locations in a "
6159 "future version of GCC", field
);
6161 /* The middle end uses the type of expressions to determine the
6162 possible range of expression values. In order to optimize
6163 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6164 must be made aware of the width of "i", via its type.
6166 Because C++ does not have integer types of arbitrary width,
6167 we must (for the purposes of the front end) convert from the
6168 type assigned here to the declared type of the bitfield
6169 whenever a bitfield expression is used as an rvalue.
6170 Similarly, when assigning a value to a bitfield, the value
6171 must be converted to the type given the bitfield here. */
6172 if (DECL_C_BIT_FIELD (field
))
6174 unsigned HOST_WIDE_INT width
;
6175 tree ftype
= TREE_TYPE (field
);
6176 width
= tree_to_uhwi (DECL_SIZE (field
));
6177 if (width
!= TYPE_PRECISION (ftype
))
6180 = c_build_bitfield_integer_type (width
,
6181 TYPE_UNSIGNED (ftype
));
6183 = cp_build_qualified_type (TREE_TYPE (field
),
6184 cp_type_quals (ftype
));
6188 /* If we needed additional padding after this field, add it
6194 padding_field
= build_decl (input_location
,
6198 DECL_BIT_FIELD (padding_field
) = 1;
6199 DECL_SIZE (padding_field
) = padding
;
6200 DECL_CONTEXT (padding_field
) = t
;
6201 DECL_ARTIFICIAL (padding_field
) = 1;
6202 DECL_IGNORED_P (padding_field
) = 1;
6203 layout_nonempty_base_or_field (rli
, padding_field
,
6205 empty_base_offsets
);
6208 last_field_was_bitfield
= DECL_C_BIT_FIELD (field
);
6211 if (abi_version_at_least (2) && !integer_zerop (rli
->bitpos
))
6213 /* Make sure that we are on a byte boundary so that the size of
6214 the class without virtual bases will always be a round number
6216 rli
->bitpos
= round_up_loc (input_location
, rli
->bitpos
, BITS_PER_UNIT
);
6217 normalize_rli (rli
);
6220 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6222 if (!abi_version_at_least (2))
6223 include_empty_classes(rli
);
6225 /* Delete all zero-width bit-fields from the list of fields. Now
6226 that the type is laid out they are no longer important. */
6227 remove_zero_width_bit_fields (t
);
6229 /* Create the version of T used for virtual bases. We do not use
6230 make_class_type for this version; this is an artificial type. For
6231 a POD type, we just reuse T. */
6232 if (CLASSTYPE_NON_LAYOUT_POD_P (t
) || CLASSTYPE_EMPTY_P (t
))
6234 base_t
= make_node (TREE_CODE (t
));
6236 /* Set the size and alignment for the new type. In G++ 3.2, all
6237 empty classes were considered to have size zero when used as
6239 if (!abi_version_at_least (2) && CLASSTYPE_EMPTY_P (t
))
6241 TYPE_SIZE (base_t
) = bitsize_zero_node
;
6242 TYPE_SIZE_UNIT (base_t
) = size_zero_node
;
6243 if (warn_abi
&& !integer_zerop (rli_size_unit_so_far (rli
)))
6245 "layout of classes derived from empty class %qT "
6246 "may change in a future version of GCC",
6253 /* If the ABI version is not at least two, and the last
6254 field was a bit-field, RLI may not be on a byte
6255 boundary. In particular, rli_size_unit_so_far might
6256 indicate the last complete byte, while rli_size_so_far
6257 indicates the total number of bits used. Therefore,
6258 rli_size_so_far, rather than rli_size_unit_so_far, is
6259 used to compute TYPE_SIZE_UNIT. */
6260 eoc
= end_of_class (t
, /*include_virtuals_p=*/0);
6261 TYPE_SIZE_UNIT (base_t
)
6262 = size_binop (MAX_EXPR
,
6264 size_binop (CEIL_DIV_EXPR
,
6265 rli_size_so_far (rli
),
6266 bitsize_int (BITS_PER_UNIT
))),
6269 = size_binop (MAX_EXPR
,
6270 rli_size_so_far (rli
),
6271 size_binop (MULT_EXPR
,
6272 convert (bitsizetype
, eoc
),
6273 bitsize_int (BITS_PER_UNIT
)));
6275 TYPE_ALIGN (base_t
) = rli
->record_align
;
6276 TYPE_USER_ALIGN (base_t
) = TYPE_USER_ALIGN (t
);
6278 /* Copy the fields from T. */
6279 next_field
= &TYPE_FIELDS (base_t
);
6280 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6281 if (TREE_CODE (field
) == FIELD_DECL
)
6283 *next_field
= build_decl (input_location
,
6287 DECL_CONTEXT (*next_field
) = base_t
;
6288 DECL_FIELD_OFFSET (*next_field
) = DECL_FIELD_OFFSET (field
);
6289 DECL_FIELD_BIT_OFFSET (*next_field
)
6290 = DECL_FIELD_BIT_OFFSET (field
);
6291 DECL_SIZE (*next_field
) = DECL_SIZE (field
);
6292 DECL_MODE (*next_field
) = DECL_MODE (field
);
6293 next_field
= &DECL_CHAIN (*next_field
);
6296 /* Record the base version of the type. */
6297 CLASSTYPE_AS_BASE (t
) = base_t
;
6298 TYPE_CONTEXT (base_t
) = t
;
6301 CLASSTYPE_AS_BASE (t
) = t
;
6303 /* Every empty class contains an empty class. */
6304 if (CLASSTYPE_EMPTY_P (t
))
6305 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 1;
6307 /* Set the TYPE_DECL for this type to contain the right
6308 value for DECL_OFFSET, so that we can use it as part
6309 of a COMPONENT_REF for multiple inheritance. */
6310 layout_decl (TYPE_MAIN_DECL (t
), 0);
6312 /* Now fix up any virtual base class types that we left lying
6313 around. We must get these done before we try to lay out the
6314 virtual function table. As a side-effect, this will remove the
6315 base subobject fields. */
6316 layout_virtual_bases (rli
, empty_base_offsets
);
6318 /* Make sure that empty classes are reflected in RLI at this
6320 include_empty_classes(rli
);
6322 /* Make sure not to create any structures with zero size. */
6323 if (integer_zerop (rli_size_unit_so_far (rli
)) && CLASSTYPE_EMPTY_P (t
))
6325 build_decl (input_location
,
6326 FIELD_DECL
, NULL_TREE
, char_type_node
));
6328 /* If this is a non-POD, declaring it packed makes a difference to how it
6329 can be used as a field; don't let finalize_record_size undo it. */
6330 if (TYPE_PACKED (t
) && !layout_pod_type_p (t
))
6331 rli
->packed_maybe_necessary
= true;
6333 /* Let the back end lay out the type. */
6334 finish_record_layout (rli
, /*free_p=*/true);
6336 if (TYPE_SIZE_UNIT (t
)
6337 && TREE_CODE (TYPE_SIZE_UNIT (t
)) == INTEGER_CST
6338 && !TREE_OVERFLOW (TYPE_SIZE_UNIT (t
))
6339 && !valid_constant_size_p (TYPE_SIZE_UNIT (t
)))
6340 error ("type %qT is too large", t
);
6342 /* Warn about bases that can't be talked about due to ambiguity. */
6343 warn_about_ambiguous_bases (t
);
6345 /* Now that we're done with layout, give the base fields the real types. */
6346 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
6347 if (DECL_ARTIFICIAL (field
) && IS_FAKE_BASE_TYPE (TREE_TYPE (field
)))
6348 TREE_TYPE (field
) = TYPE_CONTEXT (TREE_TYPE (field
));
6351 splay_tree_delete (empty_base_offsets
);
6353 if (CLASSTYPE_EMPTY_P (t
)
6354 && tree_int_cst_lt (sizeof_biggest_empty_class
,
6355 TYPE_SIZE_UNIT (t
)))
6356 sizeof_biggest_empty_class
= TYPE_SIZE_UNIT (t
);
6359 /* Determine the "key method" for the class type indicated by TYPE,
6360 and set CLASSTYPE_KEY_METHOD accordingly. */
6363 determine_key_method (tree type
)
6367 if (TYPE_FOR_JAVA (type
)
6368 || processing_template_decl
6369 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
6370 || CLASSTYPE_INTERFACE_KNOWN (type
))
6373 /* The key method is the first non-pure virtual function that is not
6374 inline at the point of class definition. On some targets the
6375 key function may not be inline; those targets should not call
6376 this function until the end of the translation unit. */
6377 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
6378 method
= DECL_CHAIN (method
))
6379 if (DECL_VINDEX (method
) != NULL_TREE
6380 && ! DECL_DECLARED_INLINE_P (method
)
6381 && ! DECL_PURE_VIRTUAL_P (method
))
6383 CLASSTYPE_KEY_METHOD (type
) = method
;
6391 /* Allocate and return an instance of struct sorted_fields_type with
6394 static struct sorted_fields_type
*
6395 sorted_fields_type_new (int n
)
6397 struct sorted_fields_type
*sft
;
6398 sft
= ggc_alloc_sorted_fields_type (sizeof (struct sorted_fields_type
)
6399 + n
* sizeof (tree
));
6406 /* Perform processing required when the definition of T (a class type)
6410 finish_struct_1 (tree t
)
6413 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6414 tree virtuals
= NULL_TREE
;
6416 if (COMPLETE_TYPE_P (t
))
6418 gcc_assert (MAYBE_CLASS_TYPE_P (t
));
6419 error ("redefinition of %q#T", t
);
6424 /* If this type was previously laid out as a forward reference,
6425 make sure we lay it out again. */
6426 TYPE_SIZE (t
) = NULL_TREE
;
6427 CLASSTYPE_PRIMARY_BINFO (t
) = NULL_TREE
;
6429 /* Make assumptions about the class; we'll reset the flags if
6431 CLASSTYPE_EMPTY_P (t
) = 1;
6432 CLASSTYPE_NEARLY_EMPTY_P (t
) = 1;
6433 CLASSTYPE_CONTAINS_EMPTY_CLASS_P (t
) = 0;
6434 CLASSTYPE_LITERAL_P (t
) = true;
6436 /* Do end-of-class semantic processing: checking the validity of the
6437 bases and members and add implicitly generated methods. */
6438 check_bases_and_members (t
);
6440 /* Find the key method. */
6441 if (TYPE_CONTAINS_VPTR_P (t
))
6443 /* The Itanium C++ ABI permits the key method to be chosen when
6444 the class is defined -- even though the key method so
6445 selected may later turn out to be an inline function. On
6446 some systems (such as ARM Symbian OS) the key method cannot
6447 be determined until the end of the translation unit. On such
6448 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6449 will cause the class to be added to KEYED_CLASSES. Then, in
6450 finish_file we will determine the key method. */
6451 if (targetm
.cxx
.key_method_may_be_inline ())
6452 determine_key_method (t
);
6454 /* If a polymorphic class has no key method, we may emit the vtable
6455 in every translation unit where the class definition appears. */
6456 if (CLASSTYPE_KEY_METHOD (t
) == NULL_TREE
)
6457 keyed_classes
= tree_cons (NULL_TREE
, t
, keyed_classes
);
6460 /* Layout the class itself. */
6461 layout_class_type (t
, &virtuals
);
6462 if (CLASSTYPE_AS_BASE (t
) != t
)
6463 /* We use the base type for trivial assignments, and hence it
6465 compute_record_mode (CLASSTYPE_AS_BASE (t
));
6467 virtuals
= modify_all_vtables (t
, nreverse (virtuals
));
6469 /* If necessary, create the primary vtable for this class. */
6470 if (virtuals
|| TYPE_CONTAINS_VPTR_P (t
))
6472 /* We must enter these virtuals into the table. */
6473 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6474 build_primary_vtable (NULL_TREE
, t
);
6475 else if (! BINFO_NEW_VTABLE_MARKED (TYPE_BINFO (t
)))
6476 /* Here we know enough to change the type of our virtual
6477 function table, but we will wait until later this function. */
6478 build_primary_vtable (CLASSTYPE_PRIMARY_BINFO (t
), t
);
6480 /* If we're warning about ABI tags, check the types of the new
6481 virtual functions. */
6483 for (tree v
= virtuals
; v
; v
= TREE_CHAIN (v
))
6484 check_abi_tags (t
, TREE_VALUE (v
));
6487 if (TYPE_CONTAINS_VPTR_P (t
))
6492 if (BINFO_VTABLE (TYPE_BINFO (t
)))
6493 gcc_assert (DECL_VIRTUAL_P (BINFO_VTABLE (TYPE_BINFO (t
))));
6494 if (!CLASSTYPE_HAS_PRIMARY_BASE_P (t
))
6495 gcc_assert (BINFO_VIRTUALS (TYPE_BINFO (t
)) == NULL_TREE
);
6497 /* Add entries for virtual functions introduced by this class. */
6498 BINFO_VIRTUALS (TYPE_BINFO (t
))
6499 = chainon (BINFO_VIRTUALS (TYPE_BINFO (t
)), virtuals
);
6501 /* Set DECL_VINDEX for all functions declared in this class. */
6502 for (vindex
= 0, fn
= BINFO_VIRTUALS (TYPE_BINFO (t
));
6504 fn
= TREE_CHAIN (fn
),
6505 vindex
+= (TARGET_VTABLE_USES_DESCRIPTORS
6506 ? TARGET_VTABLE_USES_DESCRIPTORS
: 1))
6508 tree fndecl
= BV_FN (fn
);
6510 if (DECL_THUNK_P (fndecl
))
6511 /* A thunk. We should never be calling this entry directly
6512 from this vtable -- we'd use the entry for the non
6513 thunk base function. */
6514 DECL_VINDEX (fndecl
) = NULL_TREE
;
6515 else if (TREE_CODE (DECL_VINDEX (fndecl
)) != INTEGER_CST
)
6516 DECL_VINDEX (fndecl
) = build_int_cst (NULL_TREE
, vindex
);
6520 finish_struct_bits (t
);
6521 set_method_tm_attributes (t
);
6523 /* Complete the rtl for any static member objects of the type we're
6525 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6526 if (VAR_P (x
) && TREE_STATIC (x
)
6527 && TREE_TYPE (x
) != error_mark_node
6528 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (x
)), t
))
6529 DECL_MODE (x
) = TYPE_MODE (t
);
6531 /* Done with FIELDS...now decide whether to sort these for
6532 faster lookups later.
6534 We use a small number because most searches fail (succeeding
6535 ultimately as the search bores through the inheritance
6536 hierarchy), and we want this failure to occur quickly. */
6538 insert_into_classtype_sorted_fields (TYPE_FIELDS (t
), t
, 8);
6540 /* Complain if one of the field types requires lower visibility. */
6541 constrain_class_visibility (t
);
6543 /* Make the rtl for any new vtables we have created, and unmark
6544 the base types we marked. */
6547 /* Build the VTT for T. */
6550 /* This warning does not make sense for Java classes, since they
6551 cannot have destructors. */
6552 if (!TYPE_FOR_JAVA (t
) && warn_nonvdtor
&& TYPE_POLYMORPHIC_P (t
))
6556 dtor
= CLASSTYPE_DESTRUCTORS (t
);
6557 if (/* An implicitly declared destructor is always public. And,
6558 if it were virtual, we would have created it by now. */
6560 || (!DECL_VINDEX (dtor
)
6561 && (/* public non-virtual */
6562 (!TREE_PRIVATE (dtor
) && !TREE_PROTECTED (dtor
))
6563 || (/* non-public non-virtual with friends */
6564 (TREE_PRIVATE (dtor
) || TREE_PROTECTED (dtor
))
6565 && (CLASSTYPE_FRIEND_CLASSES (t
)
6566 || DECL_FRIENDLIST (TYPE_MAIN_DECL (t
)))))))
6567 warning (OPT_Wnon_virtual_dtor
,
6568 "%q#T has virtual functions and accessible"
6569 " non-virtual destructor", t
);
6574 if (warn_overloaded_virtual
)
6577 /* Class layout, assignment of virtual table slots, etc., is now
6578 complete. Give the back end a chance to tweak the visibility of
6579 the class or perform any other required target modifications. */
6580 targetm
.cxx
.adjust_class_at_definition (t
);
6582 maybe_suppress_debug_info (t
);
6584 if (flag_vtable_verify
)
6585 vtv_save_class_info (t
);
6587 dump_class_hierarchy (t
);
6589 /* Finish debugging output for this type. */
6590 rest_of_type_compilation (t
, ! LOCAL_CLASS_P (t
));
6592 if (TYPE_TRANSPARENT_AGGR (t
))
6594 tree field
= first_field (t
);
6595 if (field
== NULL_TREE
|| error_operand_p (field
))
6597 error ("type transparent %q#T does not have any fields", t
);
6598 TYPE_TRANSPARENT_AGGR (t
) = 0;
6600 else if (DECL_ARTIFICIAL (field
))
6602 if (DECL_FIELD_IS_BASE (field
))
6603 error ("type transparent class %qT has base classes", t
);
6606 gcc_checking_assert (DECL_VIRTUAL_P (field
));
6607 error ("type transparent class %qT has virtual functions", t
);
6609 TYPE_TRANSPARENT_AGGR (t
) = 0;
6611 else if (TYPE_MODE (t
) != DECL_MODE (field
))
6613 error ("type transparent %q#T cannot be made transparent because "
6614 "the type of the first field has a different ABI from the "
6615 "class overall", t
);
6616 TYPE_TRANSPARENT_AGGR (t
) = 0;
6621 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6622 equal to THRESHOLD or greater than THRESHOLD. */
6625 insert_into_classtype_sorted_fields (tree fields
, tree t
, int threshold
)
6627 int n_fields
= count_fields (fields
);
6628 if (n_fields
>= threshold
)
6630 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6631 add_fields_to_record_type (fields
, field_vec
, 0);
6632 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6633 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6637 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6640 insert_late_enum_def_into_classtype_sorted_fields (tree enumtype
, tree t
)
6642 struct sorted_fields_type
*sorted_fields
= CLASSTYPE_SORTED_FIELDS (t
);
6647 = list_length (TYPE_VALUES (enumtype
)) + sorted_fields
->len
;
6648 struct sorted_fields_type
*field_vec
= sorted_fields_type_new (n_fields
);
6650 for (i
= 0; i
< sorted_fields
->len
; ++i
)
6651 field_vec
->elts
[i
] = sorted_fields
->elts
[i
];
6653 add_enum_fields_to_record_type (enumtype
, field_vec
,
6654 sorted_fields
->len
);
6655 qsort (field_vec
->elts
, n_fields
, sizeof (tree
), field_decl_cmp
);
6656 CLASSTYPE_SORTED_FIELDS (t
) = field_vec
;
6660 /* When T was built up, the member declarations were added in reverse
6661 order. Rearrange them to declaration order. */
6664 unreverse_member_declarations (tree t
)
6670 /* The following lists are all in reverse order. Put them in
6671 declaration order now. */
6672 TYPE_METHODS (t
) = nreverse (TYPE_METHODS (t
));
6673 CLASSTYPE_DECL_LIST (t
) = nreverse (CLASSTYPE_DECL_LIST (t
));
6675 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6676 reverse order, so we can't just use nreverse. */
6678 for (x
= TYPE_FIELDS (t
);
6679 x
&& TREE_CODE (x
) != TYPE_DECL
;
6682 next
= DECL_CHAIN (x
);
6683 DECL_CHAIN (x
) = prev
;
6688 DECL_CHAIN (TYPE_FIELDS (t
)) = x
;
6690 TYPE_FIELDS (t
) = prev
;
6695 finish_struct (tree t
, tree attributes
)
6697 location_t saved_loc
= input_location
;
6699 /* Now that we've got all the field declarations, reverse everything
6701 unreverse_member_declarations (t
);
6703 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
6705 /* Nadger the current location so that diagnostics point to the start of
6706 the struct, not the end. */
6707 input_location
= DECL_SOURCE_LOCATION (TYPE_NAME (t
));
6709 if (processing_template_decl
)
6713 finish_struct_methods (t
);
6714 TYPE_SIZE (t
) = bitsize_zero_node
;
6715 TYPE_SIZE_UNIT (t
) = size_zero_node
;
6717 /* We need to emit an error message if this type was used as a parameter
6718 and it is an abstract type, even if it is a template. We construct
6719 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6720 account and we call complete_vars with this type, which will check
6721 the PARM_DECLS. Note that while the type is being defined,
6722 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6723 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6724 CLASSTYPE_PURE_VIRTUALS (t
) = NULL
;
6725 for (x
= TYPE_METHODS (t
); x
; x
= DECL_CHAIN (x
))
6726 if (DECL_PURE_VIRTUAL_P (x
))
6727 vec_safe_push (CLASSTYPE_PURE_VIRTUALS (t
), x
);
6729 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6730 an enclosing scope is a template class, so that this function be
6731 found by lookup_fnfields_1 when the using declaration is not
6732 instantiated yet. */
6733 for (x
= TYPE_FIELDS (t
); x
; x
= DECL_CHAIN (x
))
6734 if (TREE_CODE (x
) == USING_DECL
)
6736 tree fn
= strip_using_decl (x
);
6737 if (is_overloaded_fn (fn
))
6738 for (; fn
; fn
= OVL_NEXT (fn
))
6739 add_method (t
, OVL_CURRENT (fn
), x
);
6742 /* Remember current #pragma pack value. */
6743 TYPE_PRECISION (t
) = maximum_field_alignment
;
6745 /* Fix up any variants we've already built. */
6746 for (x
= TYPE_NEXT_VARIANT (t
); x
; x
= TYPE_NEXT_VARIANT (x
))
6748 TYPE_SIZE (x
) = TYPE_SIZE (t
);
6749 TYPE_SIZE_UNIT (x
) = TYPE_SIZE_UNIT (t
);
6750 TYPE_FIELDS (x
) = TYPE_FIELDS (t
);
6751 TYPE_METHODS (x
) = TYPE_METHODS (t
);
6755 finish_struct_1 (t
);
6757 input_location
= saved_loc
;
6759 TYPE_BEING_DEFINED (t
) = 0;
6761 if (current_class_type
)
6764 error ("trying to finish struct, but kicked out due to previous parse errors");
6766 if (processing_template_decl
&& at_function_scope_p ()
6767 /* Lambdas are defined by the LAMBDA_EXPR. */
6768 && !LAMBDA_TYPE_P (t
))
6769 add_stmt (build_min (TAG_DEFN
, t
));
6774 /* Hash table to avoid endless recursion when handling references. */
6775 static hash_table
<pointer_hash
<tree_node
> > fixed_type_or_null_ref_ht
;
6777 /* Return the dynamic type of INSTANCE, if known.
6778 Used to determine whether the virtual function table is needed
6781 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6782 of our knowledge of its type. *NONNULL should be initialized
6783 before this function is called. */
6786 fixed_type_or_null (tree instance
, int *nonnull
, int *cdtorp
)
6788 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6790 switch (TREE_CODE (instance
))
6793 if (POINTER_TYPE_P (TREE_TYPE (instance
)))
6796 return RECUR (TREE_OPERAND (instance
, 0));
6799 /* This is a call to a constructor, hence it's never zero. */
6800 if (TREE_HAS_CONSTRUCTOR (instance
))
6804 return TREE_TYPE (instance
);
6809 /* This is a call to a constructor, hence it's never zero. */
6810 if (TREE_HAS_CONSTRUCTOR (instance
))
6814 return TREE_TYPE (instance
);
6816 return RECUR (TREE_OPERAND (instance
, 0));
6818 case POINTER_PLUS_EXPR
:
6821 if (TREE_CODE (TREE_OPERAND (instance
, 0)) == ADDR_EXPR
)
6822 return RECUR (TREE_OPERAND (instance
, 0));
6823 if (TREE_CODE (TREE_OPERAND (instance
, 1)) == INTEGER_CST
)
6824 /* Propagate nonnull. */
6825 return RECUR (TREE_OPERAND (instance
, 0));
6830 return RECUR (TREE_OPERAND (instance
, 0));
6833 instance
= TREE_OPERAND (instance
, 0);
6836 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6837 with a real object -- given &p->f, p can still be null. */
6838 tree t
= get_base_address (instance
);
6839 /* ??? Probably should check DECL_WEAK here. */
6840 if (t
&& DECL_P (t
))
6843 return RECUR (instance
);
6846 /* If this component is really a base class reference, then the field
6847 itself isn't definitive. */
6848 if (DECL_FIELD_IS_BASE (TREE_OPERAND (instance
, 1)))
6849 return RECUR (TREE_OPERAND (instance
, 0));
6850 return RECUR (TREE_OPERAND (instance
, 1));
6854 if (TREE_CODE (TREE_TYPE (instance
)) == ARRAY_TYPE
6855 && MAYBE_CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
6859 return TREE_TYPE (TREE_TYPE (instance
));
6861 /* fall through... */
6865 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (instance
)))
6869 return TREE_TYPE (instance
);
6871 else if (instance
== current_class_ptr
)
6876 /* if we're in a ctor or dtor, we know our type. If
6877 current_class_ptr is set but we aren't in a function, we're in
6878 an NSDMI (and therefore a constructor). */
6879 if (current_scope () != current_function_decl
6880 || (DECL_LANG_SPECIFIC (current_function_decl
)
6881 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6882 || DECL_DESTRUCTOR_P (current_function_decl
))))
6886 return TREE_TYPE (TREE_TYPE (instance
));
6889 else if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
6891 /* We only need one hash table because it is always left empty. */
6892 if (!fixed_type_or_null_ref_ht
.is_created ())
6893 fixed_type_or_null_ref_ht
.create (37);
6895 /* Reference variables should be references to objects. */
6899 /* Enter the INSTANCE in a table to prevent recursion; a
6900 variable's initializer may refer to the variable
6902 if (VAR_P (instance
)
6903 && DECL_INITIAL (instance
)
6904 && !type_dependent_expression_p_push (DECL_INITIAL (instance
))
6905 && !fixed_type_or_null_ref_ht
.find (instance
))
6910 slot
= fixed_type_or_null_ref_ht
.find_slot (instance
, INSERT
);
6912 type
= RECUR (DECL_INITIAL (instance
));
6913 fixed_type_or_null_ref_ht
.remove_elt (instance
);
6926 /* Return nonzero if the dynamic type of INSTANCE is known, and
6927 equivalent to the static type. We also handle the case where
6928 INSTANCE is really a pointer. Return negative if this is a
6929 ctor/dtor. There the dynamic type is known, but this might not be
6930 the most derived base of the original object, and hence virtual
6931 bases may not be laid out according to this type.
6933 Used to determine whether the virtual function table is needed
6936 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6937 of our knowledge of its type. *NONNULL should be initialized
6938 before this function is called. */
6941 resolves_to_fixed_type_p (tree instance
, int* nonnull
)
6943 tree t
= TREE_TYPE (instance
);
6947 /* processing_template_decl can be false in a template if we're in
6948 fold_non_dependent_expr, but we still want to suppress this check. */
6949 if (in_template_function ())
6951 /* In a template we only care about the type of the result. */
6957 fixed
= fixed_type_or_null (instance
, nonnull
, &cdtorp
);
6958 if (fixed
== NULL_TREE
)
6960 if (POINTER_TYPE_P (t
))
6962 if (!same_type_ignoring_top_level_qualifiers_p (t
, fixed
))
6964 return cdtorp
? -1 : 1;
6969 init_class_processing (void)
6971 current_class_depth
= 0;
6972 current_class_stack_size
= 10;
6974 = XNEWVEC (struct class_stack_node
, current_class_stack_size
);
6975 vec_alloc (local_classes
, 8);
6976 sizeof_biggest_empty_class
= size_zero_node
;
6978 ridpointers
[(int) RID_PUBLIC
] = access_public_node
;
6979 ridpointers
[(int) RID_PRIVATE
] = access_private_node
;
6980 ridpointers
[(int) RID_PROTECTED
] = access_protected_node
;
6983 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6986 restore_class_cache (void)
6990 /* We are re-entering the same class we just left, so we don't
6991 have to search the whole inheritance matrix to find all the
6992 decls to bind again. Instead, we install the cached
6993 class_shadowed list and walk through it binding names. */
6994 push_binding_level (previous_class_level
);
6995 class_binding_level
= previous_class_level
;
6996 /* Restore IDENTIFIER_TYPE_VALUE. */
6997 for (type
= class_binding_level
->type_shadowed
;
6999 type
= TREE_CHAIN (type
))
7000 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (type
), TREE_TYPE (type
));
7003 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7004 appropriate for TYPE.
7006 So that we may avoid calls to lookup_name, we cache the _TYPE
7007 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7009 For multiple inheritance, we perform a two-pass depth-first search
7010 of the type lattice. */
7013 pushclass (tree type
)
7015 class_stack_node_t csn
;
7017 type
= TYPE_MAIN_VARIANT (type
);
7019 /* Make sure there is enough room for the new entry on the stack. */
7020 if (current_class_depth
+ 1 >= current_class_stack_size
)
7022 current_class_stack_size
*= 2;
7024 = XRESIZEVEC (struct class_stack_node
, current_class_stack
,
7025 current_class_stack_size
);
7028 /* Insert a new entry on the class stack. */
7029 csn
= current_class_stack
+ current_class_depth
;
7030 csn
->name
= current_class_name
;
7031 csn
->type
= current_class_type
;
7032 csn
->access
= current_access_specifier
;
7033 csn
->names_used
= 0;
7035 current_class_depth
++;
7037 /* Now set up the new type. */
7038 current_class_name
= TYPE_NAME (type
);
7039 if (TREE_CODE (current_class_name
) == TYPE_DECL
)
7040 current_class_name
= DECL_NAME (current_class_name
);
7041 current_class_type
= type
;
7043 /* By default, things in classes are private, while things in
7044 structures or unions are public. */
7045 current_access_specifier
= (CLASSTYPE_DECLARED_CLASS (type
)
7046 ? access_private_node
7047 : access_public_node
);
7049 if (previous_class_level
7050 && type
!= previous_class_level
->this_entity
7051 && current_class_depth
== 1)
7053 /* Forcibly remove any old class remnants. */
7054 invalidate_class_lookup_cache ();
7057 if (!previous_class_level
7058 || type
!= previous_class_level
->this_entity
7059 || current_class_depth
> 1)
7062 restore_class_cache ();
7065 /* When we exit a toplevel class scope, we save its binding level so
7066 that we can restore it quickly. Here, we've entered some other
7067 class, so we must invalidate our cache. */
7070 invalidate_class_lookup_cache (void)
7072 previous_class_level
= NULL
;
7075 /* Get out of the current class scope. If we were in a class scope
7076 previously, that is the one popped to. */
7083 current_class_depth
--;
7084 current_class_name
= current_class_stack
[current_class_depth
].name
;
7085 current_class_type
= current_class_stack
[current_class_depth
].type
;
7086 current_access_specifier
= current_class_stack
[current_class_depth
].access
;
7087 if (current_class_stack
[current_class_depth
].names_used
)
7088 splay_tree_delete (current_class_stack
[current_class_depth
].names_used
);
7091 /* Mark the top of the class stack as hidden. */
7094 push_class_stack (void)
7096 if (current_class_depth
)
7097 ++current_class_stack
[current_class_depth
- 1].hidden
;
7100 /* Mark the top of the class stack as un-hidden. */
7103 pop_class_stack (void)
7105 if (current_class_depth
)
7106 --current_class_stack
[current_class_depth
- 1].hidden
;
7109 /* Returns 1 if the class type currently being defined is either T or
7110 a nested type of T. */
7113 currently_open_class (tree t
)
7117 if (!CLASS_TYPE_P (t
))
7120 t
= TYPE_MAIN_VARIANT (t
);
7122 /* We start looking from 1 because entry 0 is from global scope,
7124 for (i
= current_class_depth
; i
> 0; --i
)
7127 if (i
== current_class_depth
)
7128 c
= current_class_type
;
7131 if (current_class_stack
[i
].hidden
)
7133 c
= current_class_stack
[i
].type
;
7137 if (same_type_p (c
, t
))
7143 /* If either current_class_type or one of its enclosing classes are derived
7144 from T, return the appropriate type. Used to determine how we found
7145 something via unqualified lookup. */
7148 currently_open_derived_class (tree t
)
7152 /* The bases of a dependent type are unknown. */
7153 if (dependent_type_p (t
))
7156 if (!current_class_type
)
7159 if (DERIVED_FROM_P (t
, current_class_type
))
7160 return current_class_type
;
7162 for (i
= current_class_depth
- 1; i
> 0; --i
)
7164 if (current_class_stack
[i
].hidden
)
7166 if (DERIVED_FROM_P (t
, current_class_stack
[i
].type
))
7167 return current_class_stack
[i
].type
;
7173 /* Returns the innermost class type which is not a lambda closure type. */
7176 current_nonlambda_class_type (void)
7180 /* We start looking from 1 because entry 0 is from global scope,
7182 for (i
= current_class_depth
; i
> 0; --i
)
7185 if (i
== current_class_depth
)
7186 c
= current_class_type
;
7189 if (current_class_stack
[i
].hidden
)
7191 c
= current_class_stack
[i
].type
;
7195 if (!LAMBDA_TYPE_P (c
))
7201 /* When entering a class scope, all enclosing class scopes' names with
7202 static meaning (static variables, static functions, types and
7203 enumerators) have to be visible. This recursive function calls
7204 pushclass for all enclosing class contexts until global or a local
7205 scope is reached. TYPE is the enclosed class. */
7208 push_nested_class (tree type
)
7210 /* A namespace might be passed in error cases, like A::B:C. */
7211 if (type
== NULL_TREE
7212 || !CLASS_TYPE_P (type
))
7215 push_nested_class (DECL_CONTEXT (TYPE_MAIN_DECL (type
)));
7220 /* Undoes a push_nested_class call. */
7223 pop_nested_class (void)
7225 tree context
= DECL_CONTEXT (TYPE_MAIN_DECL (current_class_type
));
7228 if (context
&& CLASS_TYPE_P (context
))
7229 pop_nested_class ();
7232 /* Returns the number of extern "LANG" blocks we are nested within. */
7235 current_lang_depth (void)
7237 return vec_safe_length (current_lang_base
);
7240 /* Set global variables CURRENT_LANG_NAME to appropriate value
7241 so that behavior of name-mangling machinery is correct. */
7244 push_lang_context (tree name
)
7246 vec_safe_push (current_lang_base
, current_lang_name
);
7248 if (name
== lang_name_cplusplus
)
7250 current_lang_name
= name
;
7252 else if (name
== lang_name_java
)
7254 current_lang_name
= name
;
7255 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7256 (See record_builtin_java_type in decl.c.) However, that causes
7257 incorrect debug entries if these types are actually used.
7258 So we re-enable debug output after extern "Java". */
7259 DECL_IGNORED_P (TYPE_NAME (java_byte_type_node
)) = 0;
7260 DECL_IGNORED_P (TYPE_NAME (java_short_type_node
)) = 0;
7261 DECL_IGNORED_P (TYPE_NAME (java_int_type_node
)) = 0;
7262 DECL_IGNORED_P (TYPE_NAME (java_long_type_node
)) = 0;
7263 DECL_IGNORED_P (TYPE_NAME (java_float_type_node
)) = 0;
7264 DECL_IGNORED_P (TYPE_NAME (java_double_type_node
)) = 0;
7265 DECL_IGNORED_P (TYPE_NAME (java_char_type_node
)) = 0;
7266 DECL_IGNORED_P (TYPE_NAME (java_boolean_type_node
)) = 0;
7268 else if (name
== lang_name_c
)
7270 current_lang_name
= name
;
7273 error ("language string %<\"%E\"%> not recognized", name
);
7276 /* Get out of the current language scope. */
7279 pop_lang_context (void)
7281 current_lang_name
= current_lang_base
->pop ();
7284 /* Type instantiation routines. */
7286 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7287 matches the TARGET_TYPE. If there is no satisfactory match, return
7288 error_mark_node, and issue an error & warning messages under
7289 control of FLAGS. Permit pointers to member function if FLAGS
7290 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7291 a template-id, and EXPLICIT_TARGS are the explicitly provided
7294 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7295 is the base path used to reference those member functions. If
7296 the address is resolved to a member function, access checks will be
7297 performed and errors issued if appropriate. */
7300 resolve_address_of_overloaded_function (tree target_type
,
7302 tsubst_flags_t flags
,
7304 tree explicit_targs
,
7307 /* Here's what the standard says:
7311 If the name is a function template, template argument deduction
7312 is done, and if the argument deduction succeeds, the deduced
7313 arguments are used to generate a single template function, which
7314 is added to the set of overloaded functions considered.
7316 Non-member functions and static member functions match targets of
7317 type "pointer-to-function" or "reference-to-function." Nonstatic
7318 member functions match targets of type "pointer-to-member
7319 function;" the function type of the pointer to member is used to
7320 select the member function from the set of overloaded member
7321 functions. If a nonstatic member function is selected, the
7322 reference to the overloaded function name is required to have the
7323 form of a pointer to member as described in 5.3.1.
7325 If more than one function is selected, any template functions in
7326 the set are eliminated if the set also contains a non-template
7327 function, and any given template function is eliminated if the
7328 set contains a second template function that is more specialized
7329 than the first according to the partial ordering rules 14.5.5.2.
7330 After such eliminations, if any, there shall remain exactly one
7331 selected function. */
7334 /* We store the matches in a TREE_LIST rooted here. The functions
7335 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7336 interoperability with most_specialized_instantiation. */
7337 tree matches
= NULL_TREE
;
7339 tree target_fn_type
;
7341 /* By the time we get here, we should be seeing only real
7342 pointer-to-member types, not the internal POINTER_TYPE to
7343 METHOD_TYPE representation. */
7344 gcc_assert (!TYPE_PTR_P (target_type
)
7345 || TREE_CODE (TREE_TYPE (target_type
)) != METHOD_TYPE
);
7347 gcc_assert (is_overloaded_fn (overload
));
7349 /* Check that the TARGET_TYPE is reasonable. */
7350 if (TYPE_PTRFN_P (target_type
)
7351 || TYPE_REFFN_P (target_type
))
7353 else if (TYPE_PTRMEMFUNC_P (target_type
))
7354 /* This is OK, too. */
7356 else if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
7357 /* This is OK, too. This comes from a conversion to reference
7359 target_type
= build_reference_type (target_type
);
7362 if (flags
& tf_error
)
7363 error ("cannot resolve overloaded function %qD based on"
7364 " conversion to type %qT",
7365 DECL_NAME (OVL_FUNCTION (overload
)), target_type
);
7366 return error_mark_node
;
7369 /* Non-member functions and static member functions match targets of type
7370 "pointer-to-function" or "reference-to-function." Nonstatic member
7371 functions match targets of type "pointer-to-member-function;" the
7372 function type of the pointer to member is used to select the member
7373 function from the set of overloaded member functions.
7375 So figure out the FUNCTION_TYPE that we want to match against. */
7376 target_fn_type
= static_fn_type (target_type
);
7378 /* If we can find a non-template function that matches, we can just
7379 use it. There's no point in generating template instantiations
7380 if we're just going to throw them out anyhow. But, of course, we
7381 can only do this when we don't *need* a template function. */
7386 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7388 tree fn
= OVL_CURRENT (fns
);
7390 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
7391 /* We're not looking for templates just yet. */
7394 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7396 /* We're looking for a non-static member, and this isn't
7397 one, or vice versa. */
7400 /* Ignore functions which haven't been explicitly
7402 if (DECL_ANTICIPATED (fn
))
7405 /* See if there's a match. */
7406 if (same_type_p (target_fn_type
, static_fn_type (fn
)))
7407 matches
= tree_cons (fn
, NULL_TREE
, matches
);
7411 /* Now, if we've already got a match (or matches), there's no need
7412 to proceed to the template functions. But, if we don't have a
7413 match we need to look at them, too. */
7416 tree target_arg_types
;
7417 tree target_ret_type
;
7420 unsigned int nargs
, ia
;
7423 target_arg_types
= TYPE_ARG_TYPES (target_fn_type
);
7424 target_ret_type
= TREE_TYPE (target_fn_type
);
7426 nargs
= list_length (target_arg_types
);
7427 args
= XALLOCAVEC (tree
, nargs
);
7428 for (arg
= target_arg_types
, ia
= 0;
7429 arg
!= NULL_TREE
&& arg
!= void_list_node
;
7430 arg
= TREE_CHAIN (arg
), ++ia
)
7431 args
[ia
] = TREE_VALUE (arg
);
7434 for (fns
= overload
; fns
; fns
= OVL_NEXT (fns
))
7436 tree fn
= OVL_CURRENT (fns
);
7440 if (TREE_CODE (fn
) != TEMPLATE_DECL
)
7441 /* We're only looking for templates. */
7444 if ((TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7446 /* We're not looking for a non-static member, and this is
7447 one, or vice versa. */
7450 tree ret
= target_ret_type
;
7452 /* If the template has a deduced return type, don't expose it to
7453 template argument deduction. */
7454 if (undeduced_auto_decl (fn
))
7457 /* Try to do argument deduction. */
7458 targs
= make_tree_vec (DECL_NTPARMS (fn
));
7459 instantiation
= fn_type_unification (fn
, explicit_targs
, targs
, args
,
7461 DEDUCE_EXACT
, LOOKUP_NORMAL
,
7463 if (instantiation
== error_mark_node
)
7464 /* Instantiation failed. */
7467 /* And now force instantiation to do return type deduction. */
7468 if (undeduced_auto_decl (instantiation
))
7471 instantiate_decl (instantiation
, /*defer*/false, /*class*/false);
7474 require_deduced_type (instantiation
);
7477 /* See if there's a match. */
7478 if (same_type_p (target_fn_type
, static_fn_type (instantiation
)))
7479 matches
= tree_cons (instantiation
, fn
, matches
);
7484 /* Now, remove all but the most specialized of the matches. */
7487 tree match
= most_specialized_instantiation (matches
);
7489 if (match
!= error_mark_node
)
7490 matches
= tree_cons (TREE_PURPOSE (match
),
7496 /* Now we should have exactly one function in MATCHES. */
7497 if (matches
== NULL_TREE
)
7499 /* There were *no* matches. */
7500 if (flags
& tf_error
)
7502 error ("no matches converting function %qD to type %q#T",
7503 DECL_NAME (OVL_CURRENT (overload
)),
7506 print_candidates (overload
);
7508 return error_mark_node
;
7510 else if (TREE_CHAIN (matches
))
7512 /* There were too many matches. First check if they're all
7513 the same function. */
7514 tree match
= NULL_TREE
;
7516 fn
= TREE_PURPOSE (matches
);
7518 /* For multi-versioned functions, more than one match is just fine and
7519 decls_match will return false as they are different. */
7520 for (match
= TREE_CHAIN (matches
); match
; match
= TREE_CHAIN (match
))
7521 if (!decls_match (fn
, TREE_PURPOSE (match
))
7522 && !targetm
.target_option
.function_versions
7523 (fn
, TREE_PURPOSE (match
)))
7528 if (flags
& tf_error
)
7530 error ("converting overloaded function %qD to type %q#T is ambiguous",
7531 DECL_NAME (OVL_FUNCTION (overload
)),
7534 /* Since print_candidates expects the functions in the
7535 TREE_VALUE slot, we flip them here. */
7536 for (match
= matches
; match
; match
= TREE_CHAIN (match
))
7537 TREE_VALUE (match
) = TREE_PURPOSE (match
);
7539 print_candidates (matches
);
7542 return error_mark_node
;
7546 /* Good, exactly one match. Now, convert it to the correct type. */
7547 fn
= TREE_PURPOSE (matches
);
7549 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
7550 && !(flags
& tf_ptrmem_ok
) && !flag_ms_extensions
)
7552 static int explained
;
7554 if (!(flags
& tf_error
))
7555 return error_mark_node
;
7557 permerror (input_location
, "assuming pointer to member %qD", fn
);
7560 inform (input_location
, "(a pointer to member can only be formed with %<&%E%>)", fn
);
7565 /* If a pointer to a function that is multi-versioned is requested, the
7566 pointer to the dispatcher function is returned instead. This works
7567 well because indirectly calling the function will dispatch the right
7568 function version at run-time. */
7569 if (DECL_FUNCTION_VERSIONED (fn
))
7571 fn
= get_function_version_dispatcher (fn
);
7573 return error_mark_node
;
7574 /* Mark all the versions corresponding to the dispatcher as used. */
7575 if (!(flags
& tf_conv
))
7576 mark_versions_used (fn
);
7579 /* If we're doing overload resolution purely for the purpose of
7580 determining conversion sequences, we should not consider the
7581 function used. If this conversion sequence is selected, the
7582 function will be marked as used at this point. */
7583 if (!(flags
& tf_conv
))
7585 /* Make =delete work with SFINAE. */
7586 if (DECL_DELETED_FN (fn
) && !(flags
& tf_error
))
7587 return error_mark_node
;
7592 /* We could not check access to member functions when this
7593 expression was originally created since we did not know at that
7594 time to which function the expression referred. */
7595 if (DECL_FUNCTION_MEMBER_P (fn
))
7597 gcc_assert (access_path
);
7598 perform_or_defer_access_check (access_path
, fn
, fn
, flags
);
7601 if (TYPE_PTRFN_P (target_type
) || TYPE_PTRMEMFUNC_P (target_type
))
7602 return cp_build_addr_expr (fn
, flags
);
7605 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7606 will mark the function as addressed, but here we must do it
7608 cxx_mark_addressable (fn
);
7614 /* This function will instantiate the type of the expression given in
7615 RHS to match the type of LHSTYPE. If errors exist, then return
7616 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7617 we complain on errors. If we are not complaining, never modify rhs,
7618 as overload resolution wants to try many possible instantiations, in
7619 the hope that at least one will work.
7621 For non-recursive calls, LHSTYPE should be a function, pointer to
7622 function, or a pointer to member function. */
7625 instantiate_type (tree lhstype
, tree rhs
, tsubst_flags_t flags
)
7627 tsubst_flags_t flags_in
= flags
;
7628 tree access_path
= NULL_TREE
;
7630 flags
&= ~tf_ptrmem_ok
;
7632 if (lhstype
== unknown_type_node
)
7634 if (flags
& tf_error
)
7635 error ("not enough type information");
7636 return error_mark_node
;
7639 if (TREE_TYPE (rhs
) != NULL_TREE
&& ! (type_unknown_p (rhs
)))
7641 tree fntype
= non_reference (lhstype
);
7642 if (same_type_p (fntype
, TREE_TYPE (rhs
)))
7644 if (flag_ms_extensions
7645 && TYPE_PTRMEMFUNC_P (fntype
)
7646 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
7647 /* Microsoft allows `A::f' to be resolved to a
7648 pointer-to-member. */
7652 if (flags
& tf_error
)
7653 error ("cannot convert %qE from type %qT to type %qT",
7654 rhs
, TREE_TYPE (rhs
), fntype
);
7655 return error_mark_node
;
7659 if (BASELINK_P (rhs
))
7661 access_path
= BASELINK_ACCESS_BINFO (rhs
);
7662 rhs
= BASELINK_FUNCTIONS (rhs
);
7665 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7666 deduce any type information. */
7667 if (TREE_CODE (rhs
) == NON_DEPENDENT_EXPR
)
7669 if (flags
& tf_error
)
7670 error ("not enough type information");
7671 return error_mark_node
;
7674 /* There only a few kinds of expressions that may have a type
7675 dependent on overload resolution. */
7676 gcc_assert (TREE_CODE (rhs
) == ADDR_EXPR
7677 || TREE_CODE (rhs
) == COMPONENT_REF
7678 || is_overloaded_fn (rhs
)
7679 || (flag_ms_extensions
&& TREE_CODE (rhs
) == FUNCTION_DECL
));
7681 /* This should really only be used when attempting to distinguish
7682 what sort of a pointer to function we have. For now, any
7683 arithmetic operation which is not supported on pointers
7684 is rejected as an error. */
7686 switch (TREE_CODE (rhs
))
7690 tree member
= TREE_OPERAND (rhs
, 1);
7692 member
= instantiate_type (lhstype
, member
, flags
);
7693 if (member
!= error_mark_node
7694 && TREE_SIDE_EFFECTS (TREE_OPERAND (rhs
, 0)))
7695 /* Do not lose object's side effects. */
7696 return build2 (COMPOUND_EXPR
, TREE_TYPE (member
),
7697 TREE_OPERAND (rhs
, 0), member
);
7702 rhs
= TREE_OPERAND (rhs
, 1);
7703 if (BASELINK_P (rhs
))
7704 return instantiate_type (lhstype
, rhs
, flags_in
);
7706 /* This can happen if we are forming a pointer-to-member for a
7708 gcc_assert (TREE_CODE (rhs
) == TEMPLATE_ID_EXPR
);
7712 case TEMPLATE_ID_EXPR
:
7714 tree fns
= TREE_OPERAND (rhs
, 0);
7715 tree args
= TREE_OPERAND (rhs
, 1);
7718 resolve_address_of_overloaded_function (lhstype
, fns
, flags_in
,
7719 /*template_only=*/true,
7726 resolve_address_of_overloaded_function (lhstype
, rhs
, flags_in
,
7727 /*template_only=*/false,
7728 /*explicit_targs=*/NULL_TREE
,
7733 if (PTRMEM_OK_P (rhs
))
7734 flags
|= tf_ptrmem_ok
;
7736 return instantiate_type (lhstype
, TREE_OPERAND (rhs
, 0), flags
);
7740 return error_mark_node
;
7745 return error_mark_node
;
7748 /* Return the name of the virtual function pointer field
7749 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7750 this may have to look back through base types to find the
7751 ultimate field name. (For single inheritance, these could
7752 all be the same name. Who knows for multiple inheritance). */
7755 get_vfield_name (tree type
)
7757 tree binfo
, base_binfo
;
7760 for (binfo
= TYPE_BINFO (type
);
7761 BINFO_N_BASE_BINFOS (binfo
);
7764 base_binfo
= BINFO_BASE_BINFO (binfo
, 0);
7766 if (BINFO_VIRTUAL_P (base_binfo
)
7767 || !TYPE_CONTAINS_VPTR_P (BINFO_TYPE (base_binfo
)))
7771 type
= BINFO_TYPE (binfo
);
7772 buf
= (char *) alloca (sizeof (VFIELD_NAME_FORMAT
)
7773 + TYPE_NAME_LENGTH (type
) + 2);
7774 sprintf (buf
, VFIELD_NAME_FORMAT
,
7775 IDENTIFIER_POINTER (constructor_name (type
)));
7776 return get_identifier (buf
);
7780 print_class_statistics (void)
7782 if (! GATHER_STATISTICS
)
7785 fprintf (stderr
, "convert_harshness = %d\n", n_convert_harshness
);
7786 fprintf (stderr
, "compute_conversion_costs = %d\n", n_compute_conversion_costs
);
7789 fprintf (stderr
, "vtables = %d; vtable searches = %d\n",
7790 n_vtables
, n_vtable_searches
);
7791 fprintf (stderr
, "vtable entries = %d; vtable elems = %d\n",
7792 n_vtable_entries
, n_vtable_elems
);
7796 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7797 according to [class]:
7798 The class-name is also inserted
7799 into the scope of the class itself. For purposes of access checking,
7800 the inserted class name is treated as if it were a public member name. */
7803 build_self_reference (void)
7805 tree name
= constructor_name (current_class_type
);
7806 tree value
= build_lang_decl (TYPE_DECL
, name
, current_class_type
);
7809 DECL_NONLOCAL (value
) = 1;
7810 DECL_CONTEXT (value
) = current_class_type
;
7811 DECL_ARTIFICIAL (value
) = 1;
7812 SET_DECL_SELF_REFERENCE_P (value
);
7813 set_underlying_type (value
);
7815 if (processing_template_decl
)
7816 value
= push_template_decl (value
);
7818 saved_cas
= current_access_specifier
;
7819 current_access_specifier
= access_public_node
;
7820 finish_member_declaration (value
);
7821 current_access_specifier
= saved_cas
;
7824 /* Returns 1 if TYPE contains only padding bytes. */
7827 is_empty_class (tree type
)
7829 if (type
== error_mark_node
)
7832 if (! CLASS_TYPE_P (type
))
7835 /* In G++ 3.2, whether or not a class was empty was determined by
7836 looking at its size. */
7837 if (abi_version_at_least (2))
7838 return CLASSTYPE_EMPTY_P (type
);
7840 return integer_zerop (CLASSTYPE_SIZE (type
));
7843 /* Returns true if TYPE contains an empty class. */
7846 contains_empty_class_p (tree type
)
7848 if (is_empty_class (type
))
7850 if (CLASS_TYPE_P (type
))
7857 for (binfo
= TYPE_BINFO (type
), i
= 0;
7858 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7859 if (contains_empty_class_p (BINFO_TYPE (base_binfo
)))
7861 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
7862 if (TREE_CODE (field
) == FIELD_DECL
7863 && !DECL_ARTIFICIAL (field
)
7864 && is_empty_class (TREE_TYPE (field
)))
7867 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7868 return contains_empty_class_p (TREE_TYPE (type
));
7872 /* Returns true if TYPE contains no actual data, just various
7873 possible combinations of empty classes and possibly a vptr. */
7876 is_really_empty_class (tree type
)
7878 if (CLASS_TYPE_P (type
))
7885 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7886 out, but we'd like to be able to check this before then. */
7887 if (COMPLETE_TYPE_P (type
) && is_empty_class (type
))
7890 for (binfo
= TYPE_BINFO (type
), i
= 0;
7891 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
7892 if (!is_really_empty_class (BINFO_TYPE (base_binfo
)))
7894 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
7895 if (TREE_CODE (field
) == FIELD_DECL
7896 && !DECL_ARTIFICIAL (field
)
7897 && !is_really_empty_class (TREE_TYPE (field
)))
7901 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7902 return is_really_empty_class (TREE_TYPE (type
));
7906 /* Note that NAME was looked up while the current class was being
7907 defined and that the result of that lookup was DECL. */
7910 maybe_note_name_used_in_class (tree name
, tree decl
)
7912 splay_tree names_used
;
7914 /* If we're not defining a class, there's nothing to do. */
7915 if (!(innermost_scope_kind() == sk_class
7916 && TYPE_BEING_DEFINED (current_class_type
)
7917 && !LAMBDA_TYPE_P (current_class_type
)))
7920 /* If there's already a binding for this NAME, then we don't have
7921 anything to worry about. */
7922 if (lookup_member (current_class_type
, name
,
7923 /*protect=*/0, /*want_type=*/false, tf_warning_or_error
))
7926 if (!current_class_stack
[current_class_depth
- 1].names_used
)
7927 current_class_stack
[current_class_depth
- 1].names_used
7928 = splay_tree_new (splay_tree_compare_pointers
, 0, 0);
7929 names_used
= current_class_stack
[current_class_depth
- 1].names_used
;
7931 splay_tree_insert (names_used
,
7932 (splay_tree_key
) name
,
7933 (splay_tree_value
) decl
);
7936 /* Note that NAME was declared (as DECL) in the current class. Check
7937 to see that the declaration is valid. */
7940 note_name_declared_in_class (tree name
, tree decl
)
7942 splay_tree names_used
;
7945 /* Look to see if we ever used this name. */
7947 = current_class_stack
[current_class_depth
- 1].names_used
;
7950 /* The C language allows members to be declared with a type of the same
7951 name, and the C++ standard says this diagnostic is not required. So
7952 allow it in extern "C" blocks unless predantic is specified.
7953 Allow it in all cases if -ms-extensions is specified. */
7954 if ((!pedantic
&& current_lang_name
== lang_name_c
)
7955 || flag_ms_extensions
)
7957 n
= splay_tree_lookup (names_used
, (splay_tree_key
) name
);
7960 /* [basic.scope.class]
7962 A name N used in a class S shall refer to the same declaration
7963 in its context and when re-evaluated in the completed scope of
7965 permerror (input_location
, "declaration of %q#D", decl
);
7966 permerror (input_location
, "changes meaning of %qD from %q+#D",
7967 DECL_NAME (OVL_CURRENT (decl
)), (tree
) n
->value
);
7971 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7972 Secondary vtables are merged with primary vtables; this function
7973 will return the VAR_DECL for the primary vtable. */
7976 get_vtbl_decl_for_binfo (tree binfo
)
7980 decl
= BINFO_VTABLE (binfo
);
7981 if (decl
&& TREE_CODE (decl
) == POINTER_PLUS_EXPR
)
7983 gcc_assert (TREE_CODE (TREE_OPERAND (decl
, 0)) == ADDR_EXPR
);
7984 decl
= TREE_OPERAND (TREE_OPERAND (decl
, 0), 0);
7987 gcc_assert (VAR_P (decl
));
7992 /* Returns the binfo for the primary base of BINFO. If the resulting
7993 BINFO is a virtual base, and it is inherited elsewhere in the
7994 hierarchy, then the returned binfo might not be the primary base of
7995 BINFO in the complete object. Check BINFO_PRIMARY_P or
7996 BINFO_LOST_PRIMARY_P to be sure. */
7999 get_primary_binfo (tree binfo
)
8003 primary_base
= CLASSTYPE_PRIMARY_BINFO (BINFO_TYPE (binfo
));
8007 return copied_binfo (primary_base
, binfo
);
8010 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8013 maybe_indent_hierarchy (FILE * stream
, int indent
, int indented_p
)
8016 fprintf (stream
, "%*s", indent
, "");
8020 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8021 INDENT should be zero when called from the top level; it is
8022 incremented recursively. IGO indicates the next expected BINFO in
8023 inheritance graph ordering. */
8026 dump_class_hierarchy_r (FILE *stream
,
8036 indented
= maybe_indent_hierarchy (stream
, indent
, 0);
8037 fprintf (stream
, "%s (0x" HOST_WIDE_INT_PRINT_HEX
") ",
8038 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
),
8039 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8042 fprintf (stream
, "alternative-path\n");
8045 igo
= TREE_CHAIN (binfo
);
8047 fprintf (stream
, HOST_WIDE_INT_PRINT_DEC
,
8048 tree_to_shwi (BINFO_OFFSET (binfo
)));
8049 if (is_empty_class (BINFO_TYPE (binfo
)))
8050 fprintf (stream
, " empty");
8051 else if (CLASSTYPE_NEARLY_EMPTY_P (BINFO_TYPE (binfo
)))
8052 fprintf (stream
, " nearly-empty");
8053 if (BINFO_VIRTUAL_P (binfo
))
8054 fprintf (stream
, " virtual");
8055 fprintf (stream
, "\n");
8058 if (BINFO_PRIMARY_P (binfo
))
8060 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8061 fprintf (stream
, " primary-for %s (0x" HOST_WIDE_INT_PRINT_HEX
")",
8062 type_as_string (BINFO_TYPE (BINFO_INHERITANCE_CHAIN (binfo
)),
8063 TFF_PLAIN_IDENTIFIER
),
8064 (HOST_WIDE_INT
) (uintptr_t) BINFO_INHERITANCE_CHAIN (binfo
));
8066 if (BINFO_LOST_PRIMARY_P (binfo
))
8068 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8069 fprintf (stream
, " lost-primary");
8072 fprintf (stream
, "\n");
8074 if (!(flags
& TDF_SLIM
))
8078 if (BINFO_SUBVTT_INDEX (binfo
))
8080 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8081 fprintf (stream
, " subvttidx=%s",
8082 expr_as_string (BINFO_SUBVTT_INDEX (binfo
),
8083 TFF_PLAIN_IDENTIFIER
));
8085 if (BINFO_VPTR_INDEX (binfo
))
8087 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8088 fprintf (stream
, " vptridx=%s",
8089 expr_as_string (BINFO_VPTR_INDEX (binfo
),
8090 TFF_PLAIN_IDENTIFIER
));
8092 if (BINFO_VPTR_FIELD (binfo
))
8094 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8095 fprintf (stream
, " vbaseoffset=%s",
8096 expr_as_string (BINFO_VPTR_FIELD (binfo
),
8097 TFF_PLAIN_IDENTIFIER
));
8099 if (BINFO_VTABLE (binfo
))
8101 indented
= maybe_indent_hierarchy (stream
, indent
+ 3, indented
);
8102 fprintf (stream
, " vptr=%s",
8103 expr_as_string (BINFO_VTABLE (binfo
),
8104 TFF_PLAIN_IDENTIFIER
));
8108 fprintf (stream
, "\n");
8111 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8112 igo
= dump_class_hierarchy_r (stream
, flags
, base_binfo
, igo
, indent
+ 2);
8117 /* Dump the BINFO hierarchy for T. */
8120 dump_class_hierarchy_1 (FILE *stream
, int flags
, tree t
)
8122 fprintf (stream
, "Class %s\n", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8123 fprintf (stream
, " size=%lu align=%lu\n",
8124 (unsigned long)(tree_to_shwi (TYPE_SIZE (t
)) / BITS_PER_UNIT
),
8125 (unsigned long)(TYPE_ALIGN (t
) / BITS_PER_UNIT
));
8126 fprintf (stream
, " base size=%lu base align=%lu\n",
8127 (unsigned long)(tree_to_shwi (TYPE_SIZE (CLASSTYPE_AS_BASE (t
)))
8129 (unsigned long)(TYPE_ALIGN (CLASSTYPE_AS_BASE (t
))
8131 dump_class_hierarchy_r (stream
, flags
, TYPE_BINFO (t
), TYPE_BINFO (t
), 0);
8132 fprintf (stream
, "\n");
8135 /* Debug interface to hierarchy dumping. */
8138 debug_class (tree t
)
8140 dump_class_hierarchy_1 (stderr
, TDF_SLIM
, t
);
8144 dump_class_hierarchy (tree t
)
8147 FILE *stream
= dump_begin (TDI_class
, &flags
);
8151 dump_class_hierarchy_1 (stream
, flags
, t
);
8152 dump_end (TDI_class
, stream
);
8157 dump_array (FILE * stream
, tree decl
)
8160 unsigned HOST_WIDE_INT ix
;
8162 tree size
= TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (decl
)));
8164 elt
= (tree_to_shwi (TYPE_SIZE (TREE_TYPE (TREE_TYPE (decl
))))
8166 fprintf (stream
, "%s:", decl_as_string (decl
, TFF_PLAIN_IDENTIFIER
));
8167 fprintf (stream
, " %s entries",
8168 expr_as_string (size_binop (PLUS_EXPR
, size
, size_one_node
),
8169 TFF_PLAIN_IDENTIFIER
));
8170 fprintf (stream
, "\n");
8172 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl
)),
8174 fprintf (stream
, "%-4ld %s\n", (long)(ix
* elt
),
8175 expr_as_string (value
, TFF_PLAIN_IDENTIFIER
));
8179 dump_vtable (tree t
, tree binfo
, tree vtable
)
8182 FILE *stream
= dump_begin (TDI_class
, &flags
);
8187 if (!(flags
& TDF_SLIM
))
8189 int ctor_vtbl_p
= TYPE_BINFO (t
) != binfo
;
8191 fprintf (stream
, "%s for %s",
8192 ctor_vtbl_p
? "Construction vtable" : "Vtable",
8193 type_as_string (BINFO_TYPE (binfo
), TFF_PLAIN_IDENTIFIER
));
8196 if (!BINFO_VIRTUAL_P (binfo
))
8197 fprintf (stream
, " (0x" HOST_WIDE_INT_PRINT_HEX
" instance)",
8198 (HOST_WIDE_INT
) (uintptr_t) binfo
);
8199 fprintf (stream
, " in %s", type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8201 fprintf (stream
, "\n");
8202 dump_array (stream
, vtable
);
8203 fprintf (stream
, "\n");
8206 dump_end (TDI_class
, stream
);
8210 dump_vtt (tree t
, tree vtt
)
8213 FILE *stream
= dump_begin (TDI_class
, &flags
);
8218 if (!(flags
& TDF_SLIM
))
8220 fprintf (stream
, "VTT for %s\n",
8221 type_as_string (t
, TFF_PLAIN_IDENTIFIER
));
8222 dump_array (stream
, vtt
);
8223 fprintf (stream
, "\n");
8226 dump_end (TDI_class
, stream
);
8229 /* Dump a function or thunk and its thunkees. */
8232 dump_thunk (FILE *stream
, int indent
, tree thunk
)
8234 static const char spaces
[] = " ";
8235 tree name
= DECL_NAME (thunk
);
8238 fprintf (stream
, "%.*s%p %s %s", indent
, spaces
,
8240 !DECL_THUNK_P (thunk
) ? "function"
8241 : DECL_THIS_THUNK_P (thunk
) ? "this-thunk" : "covariant-thunk",
8242 name
? IDENTIFIER_POINTER (name
) : "<unset>");
8243 if (DECL_THUNK_P (thunk
))
8245 HOST_WIDE_INT fixed_adjust
= THUNK_FIXED_OFFSET (thunk
);
8246 tree virtual_adjust
= THUNK_VIRTUAL_OFFSET (thunk
);
8248 fprintf (stream
, " fixed=" HOST_WIDE_INT_PRINT_DEC
, fixed_adjust
);
8249 if (!virtual_adjust
)
8251 else if (DECL_THIS_THUNK_P (thunk
))
8252 fprintf (stream
, " vcall=" HOST_WIDE_INT_PRINT_DEC
,
8253 tree_to_shwi (virtual_adjust
));
8255 fprintf (stream
, " vbase=" HOST_WIDE_INT_PRINT_DEC
"(%s)",
8256 tree_to_shwi (BINFO_VPTR_FIELD (virtual_adjust
)),
8257 type_as_string (BINFO_TYPE (virtual_adjust
), TFF_SCOPE
));
8258 if (THUNK_ALIAS (thunk
))
8259 fprintf (stream
, " alias to %p", (void *)THUNK_ALIAS (thunk
));
8261 fprintf (stream
, "\n");
8262 for (thunks
= DECL_THUNKS (thunk
); thunks
; thunks
= TREE_CHAIN (thunks
))
8263 dump_thunk (stream
, indent
+ 2, thunks
);
8266 /* Dump the thunks for FN. */
8269 debug_thunks (tree fn
)
8271 dump_thunk (stderr
, 0, fn
);
8274 /* Virtual function table initialization. */
8276 /* Create all the necessary vtables for T and its base classes. */
8279 finish_vtbls (tree t
)
8282 vec
<constructor_elt
, va_gc
> *v
= NULL
;
8283 tree vtable
= BINFO_VTABLE (TYPE_BINFO (t
));
8285 /* We lay out the primary and secondary vtables in one contiguous
8286 vtable. The primary vtable is first, followed by the non-virtual
8287 secondary vtables in inheritance graph order. */
8288 accumulate_vtbl_inits (TYPE_BINFO (t
), TYPE_BINFO (t
), TYPE_BINFO (t
),
8291 /* Then come the virtual bases, also in inheritance graph order. */
8292 for (vbase
= TYPE_BINFO (t
); vbase
; vbase
= TREE_CHAIN (vbase
))
8294 if (!BINFO_VIRTUAL_P (vbase
))
8296 accumulate_vtbl_inits (vbase
, vbase
, TYPE_BINFO (t
), vtable
, t
, &v
);
8299 if (BINFO_VTABLE (TYPE_BINFO (t
)))
8300 initialize_vtable (TYPE_BINFO (t
), v
);
8303 /* Initialize the vtable for BINFO with the INITS. */
8306 initialize_vtable (tree binfo
, vec
<constructor_elt
, va_gc
> *inits
)
8310 layout_vtable_decl (binfo
, vec_safe_length (inits
));
8311 decl
= get_vtbl_decl_for_binfo (binfo
);
8312 initialize_artificial_var (decl
, inits
);
8313 dump_vtable (BINFO_TYPE (binfo
), binfo
, decl
);
8316 /* Build the VTT (virtual table table) for T.
8317 A class requires a VTT if it has virtual bases.
8320 1 - primary virtual pointer for complete object T
8321 2 - secondary VTTs for each direct non-virtual base of T which requires a
8323 3 - secondary virtual pointers for each direct or indirect base of T which
8324 has virtual bases or is reachable via a virtual path from T.
8325 4 - secondary VTTs for each direct or indirect virtual base of T.
8327 Secondary VTTs look like complete object VTTs without part 4. */
8335 vec
<constructor_elt
, va_gc
> *inits
;
8337 /* Build up the initializers for the VTT. */
8339 index
= size_zero_node
;
8340 build_vtt_inits (TYPE_BINFO (t
), t
, &inits
, &index
);
8342 /* If we didn't need a VTT, we're done. */
8346 /* Figure out the type of the VTT. */
8347 type
= build_array_of_n_type (const_ptr_type_node
,
8350 /* Now, build the VTT object itself. */
8351 vtt
= build_vtable (t
, mangle_vtt_for_type (t
), type
);
8352 initialize_artificial_var (vtt
, inits
);
8353 /* Add the VTT to the vtables list. */
8354 DECL_CHAIN (vtt
) = DECL_CHAIN (CLASSTYPE_VTABLES (t
));
8355 DECL_CHAIN (CLASSTYPE_VTABLES (t
)) = vtt
;
8360 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8361 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8362 and CHAIN the vtable pointer for this binfo after construction is
8363 complete. VALUE can also be another BINFO, in which case we recurse. */
8366 binfo_ctor_vtable (tree binfo
)
8372 vt
= BINFO_VTABLE (binfo
);
8373 if (TREE_CODE (vt
) == TREE_LIST
)
8374 vt
= TREE_VALUE (vt
);
8375 if (TREE_CODE (vt
) == TREE_BINFO
)
8384 /* Data for secondary VTT initialization. */
8385 typedef struct secondary_vptr_vtt_init_data_s
8387 /* Is this the primary VTT? */
8390 /* Current index into the VTT. */
8393 /* Vector of initializers built up. */
8394 vec
<constructor_elt
, va_gc
> *inits
;
8396 /* The type being constructed by this secondary VTT. */
8397 tree type_being_constructed
;
8398 } secondary_vptr_vtt_init_data
;
8400 /* Recursively build the VTT-initializer for BINFO (which is in the
8401 hierarchy dominated by T). INITS points to the end of the initializer
8402 list to date. INDEX is the VTT index where the next element will be
8403 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8404 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8405 for virtual bases of T. When it is not so, we build the constructor
8406 vtables for the BINFO-in-T variant. */
8409 build_vtt_inits (tree binfo
, tree t
, vec
<constructor_elt
, va_gc
> **inits
,
8415 secondary_vptr_vtt_init_data data
;
8416 int top_level_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8418 /* We only need VTTs for subobjects with virtual bases. */
8419 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
8422 /* We need to use a construction vtable if this is not the primary
8426 build_ctor_vtbl_group (binfo
, t
);
8428 /* Record the offset in the VTT where this sub-VTT can be found. */
8429 BINFO_SUBVTT_INDEX (binfo
) = *index
;
8432 /* Add the address of the primary vtable for the complete object. */
8433 init
= binfo_ctor_vtable (binfo
);
8434 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8437 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8438 BINFO_VPTR_INDEX (binfo
) = *index
;
8440 *index
= size_binop (PLUS_EXPR
, *index
, TYPE_SIZE_UNIT (ptr_type_node
));
8442 /* Recursively add the secondary VTTs for non-virtual bases. */
8443 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, b
); ++i
)
8444 if (!BINFO_VIRTUAL_P (b
))
8445 build_vtt_inits (b
, t
, inits
, index
);
8447 /* Add secondary virtual pointers for all subobjects of BINFO with
8448 either virtual bases or reachable along a virtual path, except
8449 subobjects that are non-virtual primary bases. */
8450 data
.top_level_p
= top_level_p
;
8451 data
.index
= *index
;
8452 data
.inits
= *inits
;
8453 data
.type_being_constructed
= BINFO_TYPE (binfo
);
8455 dfs_walk_once (binfo
, dfs_build_secondary_vptr_vtt_inits
, NULL
, &data
);
8457 *index
= data
.index
;
8459 /* data.inits might have grown as we added secondary virtual pointers.
8460 Make sure our caller knows about the new vector. */
8461 *inits
= data
.inits
;
8464 /* Add the secondary VTTs for virtual bases in inheritance graph
8466 for (b
= TYPE_BINFO (BINFO_TYPE (binfo
)); b
; b
= TREE_CHAIN (b
))
8468 if (!BINFO_VIRTUAL_P (b
))
8471 build_vtt_inits (b
, t
, inits
, index
);
8474 /* Remove the ctor vtables we created. */
8475 dfs_walk_all (binfo
, dfs_fixup_binfo_vtbls
, NULL
, binfo
);
8478 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8479 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8482 dfs_build_secondary_vptr_vtt_inits (tree binfo
, void *data_
)
8484 secondary_vptr_vtt_init_data
*data
= (secondary_vptr_vtt_init_data
*)data_
;
8486 /* We don't care about bases that don't have vtables. */
8487 if (!TYPE_VFIELD (BINFO_TYPE (binfo
)))
8488 return dfs_skip_bases
;
8490 /* We're only interested in proper subobjects of the type being
8492 if (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), data
->type_being_constructed
))
8495 /* We're only interested in bases with virtual bases or reachable
8496 via a virtual path from the type being constructed. */
8497 if (!(CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8498 || binfo_via_virtual (binfo
, data
->type_being_constructed
)))
8499 return dfs_skip_bases
;
8501 /* We're not interested in non-virtual primary bases. */
8502 if (!BINFO_VIRTUAL_P (binfo
) && BINFO_PRIMARY_P (binfo
))
8505 /* Record the index where this secondary vptr can be found. */
8506 if (data
->top_level_p
)
8508 gcc_assert (!BINFO_VPTR_INDEX (binfo
));
8509 BINFO_VPTR_INDEX (binfo
) = data
->index
;
8511 if (BINFO_VIRTUAL_P (binfo
))
8513 /* It's a primary virtual base, and this is not a
8514 construction vtable. Find the base this is primary of in
8515 the inheritance graph, and use that base's vtable
8517 while (BINFO_PRIMARY_P (binfo
))
8518 binfo
= BINFO_INHERITANCE_CHAIN (binfo
);
8522 /* Add the initializer for the secondary vptr itself. */
8523 CONSTRUCTOR_APPEND_ELT (data
->inits
, NULL_TREE
, binfo_ctor_vtable (binfo
));
8525 /* Advance the vtt index. */
8526 data
->index
= size_binop (PLUS_EXPR
, data
->index
,
8527 TYPE_SIZE_UNIT (ptr_type_node
));
8532 /* Called from build_vtt_inits via dfs_walk. After building
8533 constructor vtables and generating the sub-vtt from them, we need
8534 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8535 binfo of the base whose sub vtt was generated. */
8538 dfs_fixup_binfo_vtbls (tree binfo
, void* data
)
8540 tree vtable
= BINFO_VTABLE (binfo
);
8542 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8543 /* If this class has no vtable, none of its bases do. */
8544 return dfs_skip_bases
;
8547 /* This might be a primary base, so have no vtable in this
8551 /* If we scribbled the construction vtable vptr into BINFO, clear it
8553 if (TREE_CODE (vtable
) == TREE_LIST
8554 && (TREE_PURPOSE (vtable
) == (tree
) data
))
8555 BINFO_VTABLE (binfo
) = TREE_CHAIN (vtable
);
8560 /* Build the construction vtable group for BINFO which is in the
8561 hierarchy dominated by T. */
8564 build_ctor_vtbl_group (tree binfo
, tree t
)
8570 vec
<constructor_elt
, va_gc
> *v
;
8572 /* See if we've already created this construction vtable group. */
8573 id
= mangle_ctor_vtbl_for_type (t
, binfo
);
8574 if (IDENTIFIER_GLOBAL_VALUE (id
))
8577 gcc_assert (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
));
8578 /* Build a version of VTBL (with the wrong type) for use in
8579 constructing the addresses of secondary vtables in the
8580 construction vtable group. */
8581 vtbl
= build_vtable (t
, id
, ptr_type_node
);
8582 DECL_CONSTRUCTION_VTABLE_P (vtbl
) = 1;
8583 /* Don't export construction vtables from shared libraries. Even on
8584 targets that don't support hidden visibility, this tells
8585 can_refer_decl_in_current_unit_p not to assume that it's safe to
8586 access from a different compilation unit (bz 54314). */
8587 DECL_VISIBILITY (vtbl
) = VISIBILITY_HIDDEN
;
8588 DECL_VISIBILITY_SPECIFIED (vtbl
) = true;
8591 accumulate_vtbl_inits (binfo
, TYPE_BINFO (TREE_TYPE (binfo
)),
8592 binfo
, vtbl
, t
, &v
);
8594 /* Add the vtables for each of our virtual bases using the vbase in T
8596 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
8598 vbase
= TREE_CHAIN (vbase
))
8602 if (!BINFO_VIRTUAL_P (vbase
))
8604 b
= copied_binfo (vbase
, binfo
);
8606 accumulate_vtbl_inits (b
, vbase
, binfo
, vtbl
, t
, &v
);
8609 /* Figure out the type of the construction vtable. */
8610 type
= build_array_of_n_type (vtable_entry_type
, v
->length ());
8612 TREE_TYPE (vtbl
) = type
;
8613 DECL_SIZE (vtbl
) = DECL_SIZE_UNIT (vtbl
) = NULL_TREE
;
8614 layout_decl (vtbl
, 0);
8616 /* Initialize the construction vtable. */
8617 CLASSTYPE_VTABLES (t
) = chainon (CLASSTYPE_VTABLES (t
), vtbl
);
8618 initialize_artificial_var (vtbl
, v
);
8619 dump_vtable (t
, binfo
, vtbl
);
8622 /* Add the vtbl initializers for BINFO (and its bases other than
8623 non-virtual primaries) to the list of INITS. BINFO is in the
8624 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8625 the constructor the vtbl inits should be accumulated for. (If this
8626 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8627 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8628 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8629 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8630 but are not necessarily the same in terms of layout. */
8633 accumulate_vtbl_inits (tree binfo
,
8638 vec
<constructor_elt
, va_gc
> **inits
)
8642 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8644 gcc_assert (SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), BINFO_TYPE (orig_binfo
)));
8646 /* If it doesn't have a vptr, we don't do anything. */
8647 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo
)))
8650 /* If we're building a construction vtable, we're not interested in
8651 subobjects that don't require construction vtables. */
8653 && !CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
))
8654 && !binfo_via_virtual (orig_binfo
, BINFO_TYPE (rtti_binfo
)))
8657 /* Build the initializers for the BINFO-in-T vtable. */
8658 dfs_accumulate_vtbl_inits (binfo
, orig_binfo
, rtti_binfo
, vtbl
, t
, inits
);
8660 /* Walk the BINFO and its bases. We walk in preorder so that as we
8661 initialize each vtable we can figure out at what offset the
8662 secondary vtable lies from the primary vtable. We can't use
8663 dfs_walk here because we need to iterate through bases of BINFO
8664 and RTTI_BINFO simultaneously. */
8665 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
8667 /* Skip virtual bases. */
8668 if (BINFO_VIRTUAL_P (base_binfo
))
8670 accumulate_vtbl_inits (base_binfo
,
8671 BINFO_BASE_BINFO (orig_binfo
, i
),
8672 rtti_binfo
, vtbl
, t
,
8677 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8678 BINFO vtable to L. */
8681 dfs_accumulate_vtbl_inits (tree binfo
,
8686 vec
<constructor_elt
, va_gc
> **l
)
8688 tree vtbl
= NULL_TREE
;
8689 int ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8693 && BINFO_VIRTUAL_P (orig_binfo
) && BINFO_PRIMARY_P (orig_binfo
))
8695 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8696 primary virtual base. If it is not the same primary in
8697 the hierarchy of T, we'll need to generate a ctor vtable
8698 for it, to place at its location in T. If it is the same
8699 primary, we still need a VTT entry for the vtable, but it
8700 should point to the ctor vtable for the base it is a
8701 primary for within the sub-hierarchy of RTTI_BINFO.
8703 There are three possible cases:
8705 1) We are in the same place.
8706 2) We are a primary base within a lost primary virtual base of
8708 3) We are primary to something not a base of RTTI_BINFO. */
8711 tree last
= NULL_TREE
;
8713 /* First, look through the bases we are primary to for RTTI_BINFO
8714 or a virtual base. */
8716 while (BINFO_PRIMARY_P (b
))
8718 b
= BINFO_INHERITANCE_CHAIN (b
);
8720 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8723 /* If we run out of primary links, keep looking down our
8724 inheritance chain; we might be an indirect primary. */
8725 for (b
= last
; b
; b
= BINFO_INHERITANCE_CHAIN (b
))
8726 if (BINFO_VIRTUAL_P (b
) || b
== rtti_binfo
)
8730 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8731 base B and it is a base of RTTI_BINFO, this is case 2. In
8732 either case, we share our vtable with LAST, i.e. the
8733 derived-most base within B of which we are a primary. */
8735 || (b
&& binfo_for_vbase (BINFO_TYPE (b
), BINFO_TYPE (rtti_binfo
))))
8736 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8737 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8738 binfo_ctor_vtable after everything's been set up. */
8741 /* Otherwise, this is case 3 and we get our own. */
8743 else if (!BINFO_NEW_VTABLE_MARKED (orig_binfo
))
8746 n_inits
= vec_safe_length (*l
);
8753 /* Add the initializer for this vtable. */
8754 build_vtbl_initializer (binfo
, orig_binfo
, t
, rtti_binfo
,
8755 &non_fn_entries
, l
);
8757 /* Figure out the position to which the VPTR should point. */
8758 vtbl
= build1 (ADDR_EXPR
, vtbl_ptr_type_node
, orig_vtbl
);
8759 index
= size_binop (MULT_EXPR
,
8760 TYPE_SIZE_UNIT (vtable_entry_type
),
8761 size_int (non_fn_entries
+ n_inits
));
8762 vtbl
= fold_build_pointer_plus (vtbl
, index
);
8766 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8767 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8768 straighten this out. */
8769 BINFO_VTABLE (binfo
) = tree_cons (rtti_binfo
, vtbl
, BINFO_VTABLE (binfo
));
8770 else if (BINFO_PRIMARY_P (binfo
) && BINFO_VIRTUAL_P (binfo
))
8771 /* Throw away any unneeded intializers. */
8772 (*l
)->truncate (n_inits
);
8774 /* For an ordinary vtable, set BINFO_VTABLE. */
8775 BINFO_VTABLE (binfo
) = vtbl
;
8778 static GTY(()) tree abort_fndecl_addr
;
8780 /* Construct the initializer for BINFO's virtual function table. BINFO
8781 is part of the hierarchy dominated by T. If we're building a
8782 construction vtable, the ORIG_BINFO is the binfo we should use to
8783 find the actual function pointers to put in the vtable - but they
8784 can be overridden on the path to most-derived in the graph that
8785 ORIG_BINFO belongs. Otherwise,
8786 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8787 BINFO that should be indicated by the RTTI information in the
8788 vtable; it will be a base class of T, rather than T itself, if we
8789 are building a construction vtable.
8791 The value returned is a TREE_LIST suitable for wrapping in a
8792 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8793 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8794 number of non-function entries in the vtable.
8796 It might seem that this function should never be called with a
8797 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8798 base is always subsumed by a derived class vtable. However, when
8799 we are building construction vtables, we do build vtables for
8800 primary bases; we need these while the primary base is being
8804 build_vtbl_initializer (tree binfo
,
8808 int* non_fn_entries_p
,
8809 vec
<constructor_elt
, va_gc
> **inits
)
8815 vec
<tree
, va_gc
> *vbases
;
8818 /* Initialize VID. */
8819 memset (&vid
, 0, sizeof (vid
));
8822 vid
.rtti_binfo
= rtti_binfo
;
8823 vid
.primary_vtbl_p
= SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), t
);
8824 vid
.ctor_vtbl_p
= !SAME_BINFO_TYPE_P (BINFO_TYPE (rtti_binfo
), t
);
8825 vid
.generate_vcall_entries
= true;
8826 /* The first vbase or vcall offset is at index -3 in the vtable. */
8827 vid
.index
= ssize_int(-3 * TARGET_VTABLE_DATA_ENTRY_DISTANCE
);
8829 /* Add entries to the vtable for RTTI. */
8830 build_rtti_vtbl_entries (binfo
, &vid
);
8832 /* Create an array for keeping track of the functions we've
8833 processed. When we see multiple functions with the same
8834 signature, we share the vcall offsets. */
8835 vec_alloc (vid
.fns
, 32);
8836 /* Add the vcall and vbase offset entries. */
8837 build_vcall_and_vbase_vtbl_entries (binfo
, &vid
);
8839 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8840 build_vbase_offset_vtbl_entries. */
8841 for (vbases
= CLASSTYPE_VBASECLASSES (t
), ix
= 0;
8842 vec_safe_iterate (vbases
, ix
, &vbinfo
); ix
++)
8843 BINFO_VTABLE_PATH_MARKED (vbinfo
) = 0;
8845 /* If the target requires padding between data entries, add that now. */
8846 if (TARGET_VTABLE_DATA_ENTRY_DISTANCE
> 1)
8848 int n_entries
= vec_safe_length (vid
.inits
);
8850 vec_safe_grow (vid
.inits
, TARGET_VTABLE_DATA_ENTRY_DISTANCE
* n_entries
);
8852 /* Move data entries into their new positions and add padding
8853 after the new positions. Iterate backwards so we don't
8854 overwrite entries that we would need to process later. */
8855 for (ix
= n_entries
- 1;
8856 vid
.inits
->iterate (ix
, &e
);
8860 int new_position
= (TARGET_VTABLE_DATA_ENTRY_DISTANCE
* ix
8861 + (TARGET_VTABLE_DATA_ENTRY_DISTANCE
- 1));
8863 (*vid
.inits
)[new_position
] = *e
;
8865 for (j
= 1; j
< TARGET_VTABLE_DATA_ENTRY_DISTANCE
; ++j
)
8867 constructor_elt
*f
= &(*vid
.inits
)[new_position
- j
];
8868 f
->index
= NULL_TREE
;
8869 f
->value
= build1 (NOP_EXPR
, vtable_entry_type
,
8875 if (non_fn_entries_p
)
8876 *non_fn_entries_p
= vec_safe_length (vid
.inits
);
8878 /* The initializers for virtual functions were built up in reverse
8879 order. Straighten them out and add them to the running list in one
8881 jx
= vec_safe_length (*inits
);
8882 vec_safe_grow (*inits
, jx
+ vid
.inits
->length ());
8884 for (ix
= vid
.inits
->length () - 1;
8885 vid
.inits
->iterate (ix
, &e
);
8889 /* Go through all the ordinary virtual functions, building up
8891 for (v
= BINFO_VIRTUALS (orig_binfo
); v
; v
= TREE_CHAIN (v
))
8895 tree fn
, fn_original
;
8896 tree init
= NULL_TREE
;
8900 if (DECL_THUNK_P (fn
))
8902 if (!DECL_NAME (fn
))
8904 if (THUNK_ALIAS (fn
))
8906 fn
= THUNK_ALIAS (fn
);
8909 fn_original
= THUNK_TARGET (fn
);
8912 /* If the only definition of this function signature along our
8913 primary base chain is from a lost primary, this vtable slot will
8914 never be used, so just zero it out. This is important to avoid
8915 requiring extra thunks which cannot be generated with the function.
8917 We first check this in update_vtable_entry_for_fn, so we handle
8918 restored primary bases properly; we also need to do it here so we
8919 zero out unused slots in ctor vtables, rather than filling them
8920 with erroneous values (though harmless, apart from relocation
8922 if (BV_LOST_PRIMARY (v
))
8923 init
= size_zero_node
;
8927 /* Pull the offset for `this', and the function to call, out of
8929 delta
= BV_DELTA (v
);
8930 vcall_index
= BV_VCALL_INDEX (v
);
8932 gcc_assert (TREE_CODE (delta
) == INTEGER_CST
);
8933 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8935 /* You can't call an abstract virtual function; it's abstract.
8936 So, we replace these functions with __pure_virtual. */
8937 if (DECL_PURE_VIRTUAL_P (fn_original
))
8940 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8942 if (abort_fndecl_addr
== NULL
)
8944 = fold_convert (vfunc_ptr_type_node
,
8945 build_fold_addr_expr (fn
));
8946 init
= abort_fndecl_addr
;
8949 /* Likewise for deleted virtuals. */
8950 else if (DECL_DELETED_FN (fn_original
))
8952 fn
= get_identifier ("__cxa_deleted_virtual");
8953 if (!get_global_value_if_present (fn
, &fn
))
8954 fn
= push_library_fn (fn
, (build_function_type_list
8955 (void_type_node
, NULL_TREE
)),
8956 NULL_TREE
, ECF_NORETURN
);
8957 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8958 init
= fold_convert (vfunc_ptr_type_node
,
8959 build_fold_addr_expr (fn
));
8963 if (!integer_zerop (delta
) || vcall_index
)
8965 fn
= make_thunk (fn
, /*this_adjusting=*/1, delta
, vcall_index
);
8966 if (!DECL_NAME (fn
))
8969 /* Take the address of the function, considering it to be of an
8970 appropriate generic type. */
8971 if (!TARGET_VTABLE_USES_DESCRIPTORS
)
8972 init
= fold_convert (vfunc_ptr_type_node
,
8973 build_fold_addr_expr (fn
));
8977 /* And add it to the chain of initializers. */
8978 if (TARGET_VTABLE_USES_DESCRIPTORS
)
8981 if (init
== size_zero_node
)
8982 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8983 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8985 for (i
= 0; i
< TARGET_VTABLE_USES_DESCRIPTORS
; ++i
)
8987 tree fdesc
= build2 (FDESC_EXPR
, vfunc_ptr_type_node
,
8988 fn
, build_int_cst (NULL_TREE
, i
));
8989 TREE_CONSTANT (fdesc
) = 1;
8991 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, fdesc
);
8995 CONSTRUCTOR_APPEND_ELT (*inits
, NULL_TREE
, init
);
8999 /* Adds to vid->inits the initializers for the vbase and vcall
9000 offsets in BINFO, which is in the hierarchy dominated by T. */
9003 build_vcall_and_vbase_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9007 /* If this is a derived class, we must first create entries
9008 corresponding to the primary base class. */
9009 b
= get_primary_binfo (binfo
);
9011 build_vcall_and_vbase_vtbl_entries (b
, vid
);
9013 /* Add the vbase entries for this base. */
9014 build_vbase_offset_vtbl_entries (binfo
, vid
);
9015 /* Add the vcall entries for this base. */
9016 build_vcall_offset_vtbl_entries (binfo
, vid
);
9019 /* Returns the initializers for the vbase offset entries in the vtable
9020 for BINFO (which is part of the class hierarchy dominated by T), in
9021 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9022 where the next vbase offset will go. */
9025 build_vbase_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9029 tree non_primary_binfo
;
9031 /* If there are no virtual baseclasses, then there is nothing to
9033 if (!CLASSTYPE_VBASECLASSES (BINFO_TYPE (binfo
)))
9038 /* We might be a primary base class. Go up the inheritance hierarchy
9039 until we find the most derived class of which we are a primary base:
9040 it is the offset of that which we need to use. */
9041 non_primary_binfo
= binfo
;
9042 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9046 /* If we have reached a virtual base, then it must be a primary
9047 base (possibly multi-level) of vid->binfo, or we wouldn't
9048 have called build_vcall_and_vbase_vtbl_entries for it. But it
9049 might be a lost primary, so just skip down to vid->binfo. */
9050 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9052 non_primary_binfo
= vid
->binfo
;
9056 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9057 if (get_primary_binfo (b
) != non_primary_binfo
)
9059 non_primary_binfo
= b
;
9062 /* Go through the virtual bases, adding the offsets. */
9063 for (vbase
= TYPE_BINFO (BINFO_TYPE (binfo
));
9065 vbase
= TREE_CHAIN (vbase
))
9070 if (!BINFO_VIRTUAL_P (vbase
))
9073 /* Find the instance of this virtual base in the complete
9075 b
= copied_binfo (vbase
, binfo
);
9077 /* If we've already got an offset for this virtual base, we
9078 don't need another one. */
9079 if (BINFO_VTABLE_PATH_MARKED (b
))
9081 BINFO_VTABLE_PATH_MARKED (b
) = 1;
9083 /* Figure out where we can find this vbase offset. */
9084 delta
= size_binop (MULT_EXPR
,
9087 TYPE_SIZE_UNIT (vtable_entry_type
)));
9088 if (vid
->primary_vtbl_p
)
9089 BINFO_VPTR_FIELD (b
) = delta
;
9091 if (binfo
!= TYPE_BINFO (t
))
9092 /* The vbase offset had better be the same. */
9093 gcc_assert (tree_int_cst_equal (delta
, BINFO_VPTR_FIELD (vbase
)));
9095 /* The next vbase will come at a more negative offset. */
9096 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9097 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9099 /* The initializer is the delta from BINFO to this virtual base.
9100 The vbase offsets go in reverse inheritance-graph order, and
9101 we are walking in inheritance graph order so these end up in
9103 delta
= size_diffop_loc (input_location
,
9104 BINFO_OFFSET (b
), BINFO_OFFSET (non_primary_binfo
));
9106 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
,
9107 fold_build1_loc (input_location
, NOP_EXPR
,
9108 vtable_entry_type
, delta
));
9112 /* Adds the initializers for the vcall offset entries in the vtable
9113 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9117 build_vcall_offset_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9119 /* We only need these entries if this base is a virtual base. We
9120 compute the indices -- but do not add to the vtable -- when
9121 building the main vtable for a class. */
9122 if (binfo
== TYPE_BINFO (vid
->derived
)
9123 || (BINFO_VIRTUAL_P (binfo
)
9124 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9125 correspond to VID->DERIVED), we are building a primary
9126 construction virtual table. Since this is a primary
9127 virtual table, we do not need the vcall offsets for
9129 && binfo
!= vid
->rtti_binfo
))
9131 /* We need a vcall offset for each of the virtual functions in this
9132 vtable. For example:
9134 class A { virtual void f (); };
9135 class B1 : virtual public A { virtual void f (); };
9136 class B2 : virtual public A { virtual void f (); };
9137 class C: public B1, public B2 { virtual void f (); };
9139 A C object has a primary base of B1, which has a primary base of A. A
9140 C also has a secondary base of B2, which no longer has a primary base
9141 of A. So the B2-in-C construction vtable needs a secondary vtable for
9142 A, which will adjust the A* to a B2* to call f. We have no way of
9143 knowing what (or even whether) this offset will be when we define B2,
9144 so we store this "vcall offset" in the A sub-vtable and look it up in
9145 a "virtual thunk" for B2::f.
9147 We need entries for all the functions in our primary vtable and
9148 in our non-virtual bases' secondary vtables. */
9150 /* If we are just computing the vcall indices -- but do not need
9151 the actual entries -- not that. */
9152 if (!BINFO_VIRTUAL_P (binfo
))
9153 vid
->generate_vcall_entries
= false;
9154 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9155 add_vcall_offset_vtbl_entries_r (binfo
, vid
);
9159 /* Build vcall offsets, starting with those for BINFO. */
9162 add_vcall_offset_vtbl_entries_r (tree binfo
, vtbl_init_data
* vid
)
9168 /* Don't walk into virtual bases -- except, of course, for the
9169 virtual base for which we are building vcall offsets. Any
9170 primary virtual base will have already had its offsets generated
9171 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9172 if (BINFO_VIRTUAL_P (binfo
) && vid
->vbase
!= binfo
)
9175 /* If BINFO has a primary base, process it first. */
9176 primary_binfo
= get_primary_binfo (binfo
);
9178 add_vcall_offset_vtbl_entries_r (primary_binfo
, vid
);
9180 /* Add BINFO itself to the list. */
9181 add_vcall_offset_vtbl_entries_1 (binfo
, vid
);
9183 /* Scan the non-primary bases of BINFO. */
9184 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); ++i
)
9185 if (base_binfo
!= primary_binfo
)
9186 add_vcall_offset_vtbl_entries_r (base_binfo
, vid
);
9189 /* Called from build_vcall_offset_vtbl_entries_r. */
9192 add_vcall_offset_vtbl_entries_1 (tree binfo
, vtbl_init_data
* vid
)
9194 /* Make entries for the rest of the virtuals. */
9195 if (abi_version_at_least (2))
9199 /* The ABI requires that the methods be processed in declaration
9200 order. G++ 3.2 used the order in the vtable. */
9201 for (orig_fn
= TYPE_METHODS (BINFO_TYPE (binfo
));
9203 orig_fn
= DECL_CHAIN (orig_fn
))
9204 if (DECL_VINDEX (orig_fn
))
9205 add_vcall_offset (orig_fn
, binfo
, vid
);
9209 tree derived_virtuals
;
9212 /* If BINFO is a primary base, the most derived class which has
9213 BINFO as a primary base; otherwise, just BINFO. */
9214 tree non_primary_binfo
;
9216 /* We might be a primary base class. Go up the inheritance hierarchy
9217 until we find the most derived class of which we are a primary base:
9218 it is the BINFO_VIRTUALS there that we need to consider. */
9219 non_primary_binfo
= binfo
;
9220 while (BINFO_INHERITANCE_CHAIN (non_primary_binfo
))
9224 /* If we have reached a virtual base, then it must be vid->vbase,
9225 because we ignore other virtual bases in
9226 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9227 base (possibly multi-level) of vid->binfo, or we wouldn't
9228 have called build_vcall_and_vbase_vtbl_entries for it. But it
9229 might be a lost primary, so just skip down to vid->binfo. */
9230 if (BINFO_VIRTUAL_P (non_primary_binfo
))
9232 gcc_assert (non_primary_binfo
== vid
->vbase
);
9233 non_primary_binfo
= vid
->binfo
;
9237 b
= BINFO_INHERITANCE_CHAIN (non_primary_binfo
);
9238 if (get_primary_binfo (b
) != non_primary_binfo
)
9240 non_primary_binfo
= b
;
9243 if (vid
->ctor_vtbl_p
)
9244 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9245 where rtti_binfo is the most derived type. */
9247 = original_binfo (non_primary_binfo
, vid
->rtti_binfo
);
9249 for (base_virtuals
= BINFO_VIRTUALS (binfo
),
9250 derived_virtuals
= BINFO_VIRTUALS (non_primary_binfo
),
9251 orig_virtuals
= BINFO_VIRTUALS (TYPE_BINFO (BINFO_TYPE (binfo
)));
9253 base_virtuals
= TREE_CHAIN (base_virtuals
),
9254 derived_virtuals
= TREE_CHAIN (derived_virtuals
),
9255 orig_virtuals
= TREE_CHAIN (orig_virtuals
))
9259 /* Find the declaration that originally caused this function to
9260 be present in BINFO_TYPE (binfo). */
9261 orig_fn
= BV_FN (orig_virtuals
);
9263 /* When processing BINFO, we only want to generate vcall slots for
9264 function slots introduced in BINFO. So don't try to generate
9265 one if the function isn't even defined in BINFO. */
9266 if (!SAME_BINFO_TYPE_P (BINFO_TYPE (binfo
), DECL_CONTEXT (orig_fn
)))
9269 add_vcall_offset (orig_fn
, binfo
, vid
);
9274 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9277 add_vcall_offset (tree orig_fn
, tree binfo
, vtbl_init_data
*vid
)
9283 /* If there is already an entry for a function with the same
9284 signature as FN, then we do not need a second vcall offset.
9285 Check the list of functions already present in the derived
9287 FOR_EACH_VEC_SAFE_ELT (vid
->fns
, i
, derived_entry
)
9289 if (same_signature_p (derived_entry
, orig_fn
)
9290 /* We only use one vcall offset for virtual destructors,
9291 even though there are two virtual table entries. */
9292 || (DECL_DESTRUCTOR_P (derived_entry
)
9293 && DECL_DESTRUCTOR_P (orig_fn
)))
9297 /* If we are building these vcall offsets as part of building
9298 the vtable for the most derived class, remember the vcall
9300 if (vid
->binfo
== TYPE_BINFO (vid
->derived
))
9302 tree_pair_s elt
= {orig_fn
, vid
->index
};
9303 vec_safe_push (CLASSTYPE_VCALL_INDICES (vid
->derived
), elt
);
9306 /* The next vcall offset will be found at a more negative
9308 vid
->index
= size_binop (MINUS_EXPR
, vid
->index
,
9309 ssize_int (TARGET_VTABLE_DATA_ENTRY_DISTANCE
));
9311 /* Keep track of this function. */
9312 vec_safe_push (vid
->fns
, orig_fn
);
9314 if (vid
->generate_vcall_entries
)
9319 /* Find the overriding function. */
9320 fn
= find_final_overrider (vid
->rtti_binfo
, binfo
, orig_fn
);
9321 if (fn
== error_mark_node
)
9322 vcall_offset
= build_zero_cst (vtable_entry_type
);
9325 base
= TREE_VALUE (fn
);
9327 /* The vbase we're working on is a primary base of
9328 vid->binfo. But it might be a lost primary, so its
9329 BINFO_OFFSET might be wrong, so we just use the
9330 BINFO_OFFSET from vid->binfo. */
9331 vcall_offset
= size_diffop_loc (input_location
,
9332 BINFO_OFFSET (base
),
9333 BINFO_OFFSET (vid
->binfo
));
9334 vcall_offset
= fold_build1_loc (input_location
,
9335 NOP_EXPR
, vtable_entry_type
,
9338 /* Add the initializer to the vtable. */
9339 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, vcall_offset
);
9343 /* Return vtbl initializers for the RTTI entries corresponding to the
9344 BINFO's vtable. The RTTI entries should indicate the object given
9345 by VID->rtti_binfo. */
9348 build_rtti_vtbl_entries (tree binfo
, vtbl_init_data
* vid
)
9356 t
= BINFO_TYPE (vid
->rtti_binfo
);
9358 /* To find the complete object, we will first convert to our most
9359 primary base, and then add the offset in the vtbl to that value. */
9361 while (CLASSTYPE_HAS_PRIMARY_BASE_P (BINFO_TYPE (b
))
9362 && !BINFO_LOST_PRIMARY_P (b
))
9366 primary_base
= get_primary_binfo (b
);
9367 gcc_assert (BINFO_PRIMARY_P (primary_base
)
9368 && BINFO_INHERITANCE_CHAIN (primary_base
) == b
);
9371 offset
= size_diffop_loc (input_location
,
9372 BINFO_OFFSET (vid
->rtti_binfo
), BINFO_OFFSET (b
));
9374 /* The second entry is the address of the typeinfo object. */
9376 decl
= build_address (get_tinfo_decl (t
));
9378 decl
= integer_zero_node
;
9380 /* Convert the declaration to a type that can be stored in the
9382 init
= build_nop (vfunc_ptr_type_node
, decl
);
9383 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9385 /* Add the offset-to-top entry. It comes earlier in the vtable than
9386 the typeinfo entry. Convert the offset to look like a
9387 function pointer, so that we can put it in the vtable. */
9388 init
= build_nop (vfunc_ptr_type_node
, offset
);
9389 CONSTRUCTOR_APPEND_ELT (vid
->inits
, NULL_TREE
, init
);
9392 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9396 uniquely_derived_from_p (tree parent
, tree type
)
9398 tree base
= lookup_base (type
, parent
, ba_unique
, NULL
, tf_none
);
9399 return base
&& base
!= error_mark_node
;
9402 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9405 publicly_uniquely_derived_p (tree parent
, tree type
)
9407 tree base
= lookup_base (type
, parent
, ba_ignore_scope
| ba_check
,
9409 return base
&& base
!= error_mark_node
;
9412 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9413 class between them, if any. */
9416 common_enclosing_class (tree ctx1
, tree ctx2
)
9418 if (!TYPE_P (ctx1
) || !TYPE_P (ctx2
))
9420 gcc_assert (ctx1
== TYPE_MAIN_VARIANT (ctx1
)
9421 && ctx2
== TYPE_MAIN_VARIANT (ctx2
));
9424 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9425 TYPE_MARKED_P (t
) = true;
9426 tree found
= NULL_TREE
;
9427 for (tree t
= ctx2
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9428 if (TYPE_MARKED_P (t
))
9433 for (tree t
= ctx1
; TYPE_P (t
); t
= TYPE_CONTEXT (t
))
9434 TYPE_MARKED_P (t
) = false;
9438 #include "gt-cp-class.h"